{"title":"A Modification to Circular-Scan Architecture to Improve Test Data Compression","authors":"M. Azimipour, M. Eshghi, A. Khademzadeh","doi":"10.1109/ADCOM.2007.32","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.32","url":null,"abstract":"The authors in (B. Arslan and A. Orailuglu, 2004) propose circular-scan chain architecture to reduce test time and cost in SOCs. The technique presented in this paper is based on circular-scan architecture (B. Arslan and A. Orailuglu, 2004). The basic idea of circular-scan architecture is use of the captured response of the previously applied pattern as a template for the next pattern while allowing the full observation of the captured response. Proposed architecture achieves further compression by updating conflicting bits internally instead of using data Input pin. Experimental results showed an improvement between 3.5% to 7.8% in test data compression in 5 largest ISCAS89 circuits.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134156125","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Calculation of Channel Capacity and Rician Factor in the Presence of Vegetation in Higher Altitude Platforms Communication Systems","authors":"S. K. Agrawal, P. Garg","doi":"10.1109/ADCOM.2007.52","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.52","url":null,"abstract":"Higher altitude platform (HAP) is considered in this paper for broadband wireless communication at millimeter wavelengths. Path loss due to vegetation is calculated using exponent decay model. Excess path loss is also calculated in the presence of vegetation for summer and winter season. Rician factor is calculated in the presence of seasonal excess path loss and wind for Delhi (India) based HAP link. Channel capacity is also calculated in the presence of seasonal excess path loss.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134107077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
K. Raja, L. Rohitha, S. Rekha, P. Swetha, K. Venugopal, L. Patnaik
{"title":"LSB Steganalysis to Detect the Embedded Message Length Using Pixel Pair Threshold","authors":"K. Raja, L. Rohitha, S. Rekha, P. Swetha, K. Venugopal, L. Patnaik","doi":"10.1109/ADCOM.2007.86","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.86","url":null,"abstract":"In the recent past, image steganalysis has drawn considerable attention. LSB steganography has been in use for quite sometime and researchers have focused to detect the hidden message, but have not been able to estimate accurately the length of the embedded message. In this paper, we have described an effective steganalytic tool called pixel pair analysis using fixed threshold (PPAFT) for detecting LSB steganography. First, the threshold is evaluated using both the cover image and the stego image. Then, based on statistical measures of pixel pairs, we compute the length of the embedded message. The methodology described in this paper is accurate, simple, fast and better than the existing algorithms.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134499287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Comparative analysis of low power high performance flip–flops in the 0.13µm technology","authors":"S. Agarwal, P. Ramanathan, P. Vanathi","doi":"10.1109/ADCOM.2007.57","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.57","url":null,"abstract":"In this paper, a comparative analysis of existing architecture for flip-flops along with proposed designs is made. Flip-flops are the most essential element in the design of sequential circuits. Due to continuing increase in integration of transistors and growing needs of portable equipments, low power design with high performance is of prime importance. The proposed designs have better power delay product than the existing architectures and also occupy lesser area. Simulation has been done in the IBM 130nm technology using TSpice.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116588540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Intrinsic Cluster Detection Using Adaptive Grids","authors":"S. Sarmah, R. Das, D. Bhattacharyya","doi":"10.1109/ADCOM.2007.82","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.82","url":null,"abstract":"This paper presents an algorithm GDCT, grid density clustering using triangle-subdivision, capable of identifying arbitrary shaped embedded clusters as well as multi density clusters over large spatial datasets. The experimental results establish the superiority of the technique in terms of cluster quality.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115849515","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Frequency Count Based Filter for Dimensionality Reduction","authors":"B. Nath, D. Bhattacharyya, Ashish Ghosh","doi":"10.1109/ADCOM.2007.72","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.72","url":null,"abstract":"Selecting relevant features from a dataset has been considered to be one of the major components of data mining techniques. Data mining techniques become computationally expensive when used with irrelevant features. Dimensionality reduction/feature selection algorithms are used basically to reduce the dimension of a dataset without reducing the information content of the domain. There are basically two categories of feature selection methods. Supervised, where each instance is associated with a class label, and in unsupervised, instances are not related to any class label. Unsupervised feature selection is used as a pre-processing of other machine learning techniques such as clustering, classification, association rule mining to reduce the dimensionality of the domain space without much loss of information content. This paper presents an unsupervised dimensionality reduction technique from continuous valued dataset, based on frequency count.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123961867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. N. Tripathi, G. Somani, K. Mundra, S. S. Verma, Hiren Joshi
{"title":"Soft-Reconfiguration Management for Operating Systems with Multiprocessor Architecture","authors":"J. N. Tripathi, G. Somani, K. Mundra, S. S. Verma, Hiren Joshi","doi":"10.1109/ADCOM.2007.113","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.113","url":null,"abstract":"sumer market to be prepared for business of new products everyday. With these tech-advancements, a new motherboard is designed for every release of a new processor in the form of fixed ASIC thus makes the old motherboards useless. This leads to two big problems of E-waste as well as Technology upgradation cost. To overcome these problem, authors have already proposed Three-Tier architecture for the computer processors that intro- duces a Reconfigurable Master Processor in FPGA, controling all other old technology processors. This uses a smart OS named kshtizindia1-OS (KIOS), at higher tier, Reconfigurable FPGA (Master Processor) at middle tier and the old processors at lower tier. This architecture emphasizes on an innovative concept of a very smart and auto-reconfigurable Operating System, KIOS with a reconfigurable CPU in FPGA that controls and reuses the old processors. The KIOS will incorporate the feature of soft-reconfiguration or auto-updation such that it can be able to reconfigure the FPGA as per the need of new release. All the tasks in the three tier architecture of KIOS is managed and interfaced for user by an application cum system software. Serially, these all tasks are presented here by a seven step process. This new architecture also contains new techniques of implementation for main memory, cache memory, bus architectures data and address mapping, multiprocessor scheduling and clock management. Index Terms-- E-wastage, Reconfigurable processor, Soft- reconfigurable Operating systems, Multiprocessor and Parallel architectures.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123788541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Indirect Path Setup: A New Approach for Handoff in HAWAII","authors":"Fekri M. Abduljalil, S. Bodhe","doi":"10.1109/ADCOM.2007.80","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.80","url":null,"abstract":"In the next generation wireless access technologies which are defined to be a pure IP based wireless networks; there are two types of IP mobility management: IP macro-mobility management (intra- domain), and IP micro-mobility management (inter- domain). HAWAII protocol is one of the prominent protocols for IP micro-mobility management. It supports two approaches of path setup handoff schemes: Forwarding Path Setup schemes and Non- Forwarding Path Setup schemes. In this paper, we proposed a new approach for fast path setup handoff in HAWAII. The proposed approach is implemented and evaluated using network simulator ns-2. Then, the performance of the proposed approach is compared against the two HAWAII path setup handoff schemes. The simulation results show that the number of packet loss is reduced to zero and the handoff delay and service disruption are reduced to minimum. The UDP and TCP performance are significantly improved in comparison with other HA WAII path setup schemes. The proposed approach can efficiently support realtime and non-real time applications.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127964619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analytical model for multi agent - call admission in wireless networks","authors":"N. Giri, S. Bodhe","doi":"10.1109/ADCOM.2007.45","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.45","url":null,"abstract":"Resource allocation and its planning are major issues in wireless networks. Distributed call admission control requires calls to be admitted by considering local as well as global view of the network so as to reduce overall congestion. The paper proposes MA-CAC (Multi Agent-CAC) scheme which models a D-CAC problem using multiagent system (MAS) where each cell comprises of agents. These agents interact, communicate, coordinate or negotiate with each other to determine the optimal utility function based on maximum tolerable handoff dropping probability for a cell. It also presents the analytical model for calculating dependency of handoff dropping probability of a cell on the number of calls in the adjoining cells.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132252726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Intelligent Transport Route Planning Using Parallel Genetic Algorithms and MPI In High Performance Computing Cluster","authors":"J. Arunadevi, A. Johnsanjeevkumar, N. Sujatha","doi":"10.1109/ADCOM.2007.81","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.81","url":null,"abstract":"Network analysis in geospatial information system (GIS) provides strong decision support for users in searching optimal route, finding the nearest facility and determining the service area. Searching optimal path is an important advanced analysis function in GIS. In present GIS route finding modules, heuristic algorithms have been used to carry out its search strategy. Due to the lack of global sampling in the feasible solution space, these algorithms have considerable possibility of being trapped into local optima. This paper addresses the problem of selecting route to a given destination on an actual map under a static environment. The proposed solution uses a parallel genetic algorithm (PGA) implemented using High performance Cluster(HPC). A part of an arterial road is regarded as a virus. We generate a population of viruses in addition to a population of routes. A customized method based on a genetic algorithm has been proposed in this paper. Keywords: GIS, SDSS, Parallel Genetic Algorithm, Route Finding, Vehicle Routing Problem.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128602954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}