{"title":"OMTSE - An Optical Interconnection System for Parallel Computing","authors":"Satish Ch. Panigrahi, Sanchita Paul, Gadadhar Sahoo","doi":"10.1109/ADCOM.2006.4289971","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289971","url":null,"abstract":"The paper introduces a new interconnection system OMTSE (Optical Multi-Trees with shuffle Exchange) using both electronics and optical links among processors. The network has a total of N = 3n3/2 nodes. The diameter of the network is 0(log n) and the bisection width is 0(n3).","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124342811","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":"Comparison of SECNM's distributed and end-to-end QoS monitoring, regarding a TLS and an unsecured connection","authors":"T. Raty, M. Karinsalo, T. Heikkila, M. Sihvonen","doi":"10.1109/ADCOM.2006.4289876","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289876","url":null,"abstract":"The monitoring structure implemented in this research paper is called SECNM (Single End-Client and Network Monitors). It comprises of a single QoS (Quality of Service) end-client monitor and a QoS network monitor. SECNM's network monitor performs as a QoS distributed monitor, and SECNM's end-client monitor as a QoS end-to-end monitor. SECNM combines these two monitor models. The strength of SECNM is immense when applied to the ensuing scenarios: 1) a plenary QoS end-to-end monitor cannot be applied and 2) a mere network monitor is not adequate. The structure of the SECNM environment was modeled on journals and conference papers regarding QoS monitoring, distributed monitoring, and end-to-end monitoring. A comparison of these theoretical paradigms and SECNM was performed. Test cases were conducted to discriminate the main differences between SECNM's monitor types in the M4MAMI system. The notable discrepancies includes indications of different delays and data quantities, lost data, retransmissions, and initial and final negotiation related to the TLS communication.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116122979","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":"Self-Rotating Cluster Head for Self-Organizing Cluster Sensor Networks","authors":"R. Misra, C. Mandal","doi":"10.1109/ADCOM.2006.4289859","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289859","url":null,"abstract":"Self-organizing capability enables remote deployment of wireless sensor network to form an ad hoc network having constrained lifetime due to non-replaceable battery source. To enhance lifetime, Sensor network protocols need reconfiguration to re-assign the roles of clusterhead to the high energy nodes for load balancing. We use our approach which is known as 'clusterhead-clique' to localize rotation region for local self-configuration. Based on this approach, the node rotates clusterhead position to node in close proximity which is known as 'self-rotating' clusterhead. Thus, self-rotating clusterhead switches the role of clusterhead to node in cluster-clique reducing the re-configuration load by containment of self-configuration in close locality. The approach taken in this work suffers from fragmentation/de-fragmentation. We provide the simulation results of our local self-configuration protocol for Self-Rotation and compared re-clustering with respect to energy metrics. The Simulation of our protocol based on Self-Rotation approach achieves 35% energy-efficiency over the existing re-clustering scheme.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121434722","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":"Study of Pattern Storage Technique in Self Organizing Map using Hopfield Energy Function Analysis","authors":"S. Gill, Manu Pratap Singh, N. Sharma","doi":"10.1109/ADCOM.2006.4289978","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289978","url":null,"abstract":"The Pattern Storage for the Continuum Features of the pattern can be characterized with the Self Organizing Map and Hopfield Energy Function Analysis. The Competitive Learning for the Self Organizing Map determines the Feature Mapping for the patterns with the Continuum Features. The iterations of the competitive learning between the Input Layer, the Feedback Layer reduce the neighboring region in the processing elements of Feedback Layer. On each iteration of this learning, the states of the feedback processing elements changes. The Energy Function corresponding to these states are determined. The change in Energy Function decreases; it shows that the network is approaches towards the Equilibrium State of the Global Stability. The minimum of the Energy States represents the stored pattern. The Network will able to encode the Pattern Information in the terms of Feature Space of the Patterns. Thus the pattern having the same feature will belong to the same Equilibrium State. This mechanism will help to determine the feature mapping for any unknown input pattern as well as any other prototype or noisy input pattern of the already stored pattern.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122707903","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}
C. Nalini, Nagaraj, P. Anandmohan, D. Poornaiah, V. Kulkarni
{"title":"An FPGA Based Performance Analysis of Pipelining and Unrolling of AES Algorithm","authors":"C. Nalini, Nagaraj, P. Anandmohan, D. Poornaiah, V. Kulkarni","doi":"10.1109/ADCOM.2006.4289939","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289939","url":null,"abstract":"This paper proposes an efficient solution to combine Rijndael encryption and decryption in one FPGA design, with a strong focus on low area constraints and high throughput. This Rijndael implementation runs its symmetric cipher algorithm using a key size of 128 bits, mode called AES128.In this paper a fully pipelined AES encryptor/decryptor core is presented. Various approaches for efficient hardware implementation of the Advanced Encryption Standard algorithm based on architectural optimization and algorithmic optimization are discussed, implemented, and their performance results obtained are compared with previous reported designs. The proposed design uses the widely used lookup-table implementation of S-box n terms of ROM and Block RAM and is easily pipelined to achieve high throughput rate and the advantage of sub-pipelining can be further explored. The pipelined architecture can be made to toggle between the encryption and decryption modes without the presence of any dead cycle. Using the proposed architecture, a fully sub-pipelined AES core with both inner and outer round pipelining and a 2 sub-stages in each round unit realized using Virtex-E devices can achieve a throughput of 30.88Gbps at 241.313 MHz and 4626 CLB Slices with 160 BRAM'S. in non-feedback modes, which is faster and more efficient than the fastest previous FPGA implementation known to date.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125071818","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":"Middleware for Multimedia Streaming in a Heterogeneous Distributed Environment","authors":"K. Sridhar","doi":"10.1109/ADCOM.2006.4289850","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289850","url":null,"abstract":"Advanced, large-scale applications targeted for the next generation Internet are motivating advances in scalable and adaptive highspeed networks and middleware. This paper provides a framework and middleware for heterogeneous distributed applications. And also describes how they have been applied successfully in practice to improve the reusability and quality of software system. An application written in one language is capable of playing media files and giving a request to an intermediate server, which is written in another language. The communications between these two different languages are established by converting the requesting application in to intermediate form. Therefore the converted application seems to be same language application as Intermediate Server. Finally the intermediate server, streams the requested media file to the client from the servers group which are under the control of the intermediate server.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125917914","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":"On Evaluating Obfuscatory Strength of Alias-based Transforms using Static Analysis","authors":"A. Majumdar, A. Monsifrot, C. Thomborson","doi":"10.1109/ADCOM.2006.4289963","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289963","url":null,"abstract":"Aliasing occurs when two variables refer to the same memory location. This technique has been exploited for constructing resilient obfuscation transforms in languages that extensively use indirect referencing. The theoretical basis for these transforms is derived from the hard complexity results of precisely determining which set of variables refer to the same memory location at a given program point during execution. However, no method is known for randomly generating hard problem instances. Unless we are able to evaluate the obfuscatory strength of these transforms using static analysis tools, we cannot correlate the resilience expected in theory with what actually holds in practice. In this contribution, we will outline the main difficulties in experimentally evaluating obfuscatory strength and give an overview of techniques that are suited for analysing well-established alias-based obfuscation transforms.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114911426","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":"A Novel Secant Based Method for Recognition of Handwritten Pitman Shorthand Language Consonants and Vowels","authors":"V. Hemadri, B. Anami, C. N. Ravikumar","doi":"10.1109/ADCOM.2006.4289902","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289902","url":null,"abstract":"Pitman Shorthand Language (PSL) is a phonetic based language developed in 1837 to translate speech into text. Recognition of text recorded in PSL is an interesting research problem. The PSL has the practical advantage of high speed of recording, more than 120-200 words per minute, because of which it is universally acknowledged. This recording medium has its continued existence inspite of considerable developments in speech processing systems, which are not universally established yet. In order to exploit the vast transcribing potential of PSL a new area of research on automation of PSL processing is conceived. In this work, we have proposed the secant based method for recognition of PSL characters. The work comprises of preprocessing such as thinning and filling, determination of end points of the handwritten strokes. Slope of the strokes are determined using end points of the stroke. Characters are classified based on the estimated slopes of secants and other features such as stroke type and thickness. The vowels are classified based on the vowel type such as dash or dot and thickness and position with respect to a stroke. The proposed work is thoroughly tested for a large number of handwritten strokes. The recognition rates are estimated and found to be in the range of 60 to 95 %.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121891114","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}
G. Patra, T. Ramamohan, V. Anil Kumar, R. P. Thangavelu
{"title":"Improve in Security Level of First Generation Chaotic Communication System by Mutual Synchronization","authors":"G. Patra, T. Ramamohan, V. Anil Kumar, R. P. Thangavelu","doi":"10.1109/ADCOM.2006.4289882","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289882","url":null,"abstract":"We try to revive the first generation chaotic secure communication scheme by improving the degree of security level, using the concept of mutual chaotic synchronization. This provides additional robustness to secure communication systems designed for quality of service applications. This is aimed at obtaining a system which can generate very long streams of keys to be directly used for one-time stream ciphers (additive masking). The first generation scheme has the advantage of being easily implementable and uses less complex algorithm but have less degree of security. This proposed method is supposed to increase the degree of security level as it is protected against the parameter estimation attacks, which are a major threat to the identical synchronization schemes.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124085612","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":"Towards Spatial Complexity Measures for Comprehension of Java Programs","authors":"J. Chhabra, Varan Gupta","doi":"10.1109/ADCOM.2006.4289930","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289930","url":null,"abstract":"The software comprehension is an important activity that influences a variety of software engineering tasks. Software comprehension is required when a software engineer maintains, reuses, and reengineers software systems. In order to understand a program, we need to look at human factors involved in the comprehension process. Program comprehension is a complex cognitive skill, which requires understanding of spatial orientations of the program entities. These spatial orientations of the program entities give rise to the spatial complexity of program. Various spatial complexity measures have been proposed to characterize the difficulty of understanding programs. This paper tries to extend these measures especially for the comprehension of Java programs. This paper identifies two spatial complexity measures for Java programs, which are based on classes and objects. The proposed measures have been applied to 10 different software projects developed using Java and the results obtained, have been used to draw a number of conclusions.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"284 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124189867","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}