15th International Conference on Advanced Computing and Communications (ADCOM 2007)最新文献

筛选
英文 中文
RFID Circuit Design with Optimized CMOS Inductor for Monitoring Biomedical Signals 基于优化CMOS电感的生物医学信号监测RFID电路设计
G. Haobijam, Manikumar K., R. Paily
{"title":"RFID Circuit Design with Optimized CMOS Inductor for Monitoring Biomedical Signals","authors":"G. Haobijam, Manikumar K., R. Paily","doi":"10.1109/ADCOM.2007.110","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.110","url":null,"abstract":"RFID is evolving as a major technology enabler for identifying and tracking goods. RFID applications in biomedical area not only need to detect but also require monitoring and transmitting vital signals like the electrocardiogram (and heartbeat), blood pressure, body temperature, etc. The basic building blocks of an RFID tag for biomedical application are studied. The sizing and powering up of the tags are critical issues and this paper mainly focuses on the design and optimization of the inductor for an RFID circuit. UHF is chosen for this application mainly because of the practical values of inductance that can be realized in CMOS chip to operate at this operating frequency. The layout parameters of inductor are optimized for a maximum Q-factor value at the desired frequency. Using the optimized inductor, the functioning of the important blocks of an RFID tag such as power feeding circuit, heartbeat detection circuit as well as the modulation circuit is verified. This work would be very relevant for the remote monitoring of biomedical signals.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"1 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":"129913263","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}
引用次数: 19
A Genetic Algorithm Based Input State Assignment Technique for Leakage Power Minimization during Combinational Logic Synthesis 基于遗传算法的组合逻辑合成中漏功率最小化输入状态分配技术
K. Srinivasa, P. Srichand, A. Bhat, K. Venugopal, L. M. Patnaik
{"title":"A Genetic Algorithm Based Input State Assignment Technique for Leakage Power Minimization during Combinational Logic Synthesis","authors":"K. Srinivasa, P. Srichand, A. Bhat, K. Venugopal, L. M. Patnaik","doi":"10.1109/ADCOM.2007.33","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.33","url":null,"abstract":"This paper proposes a new approach, wherein multiple populations are evolved on different landscapes. The problem statement is broken down, to describe discrete characteristics. Each landscape, described by its fitness landscape is used to optimize or amplify a certain characteristic or set of characteristics. Individuals from each of these populations are kept geographically isolated from each other. Each population is evolved individually. After a predetermined number of evolutions, the system of populations is analysed against a normalized fitness function. Depending on this score and a predefined merging scheme, the populations are merged, one at a time, while continuing evolution. Merging continues until only one final population remains. This population is then evolved, following which the resulting population will contain the optimal solution. The final resulting population will contain individuals which have been optimized against all characteristics as desired by the problem statement. Each individual population is optimized for a local maxima. Thus when populations are merged, the effect is to produce a new population which is closer to the global maxima.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"65 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120817707","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}
引用次数: 0
Fuzzy Based Trusted Ad hoc On-demand Distance Vector Routing Protocol for MANET 基于模糊可信自组织的MANET按需距离矢量路由协议
J. Manickam, S. Shanmugavel
{"title":"Fuzzy Based Trusted Ad hoc On-demand Distance Vector Routing Protocol for MANET","authors":"J. Manickam, S. Shanmugavel","doi":"10.1109/WIMOB.2007.36","DOIUrl":"https://doi.org/10.1109/WIMOB.2007.36","url":null,"abstract":"Ad hoc networks are frequently established in insecure environments and hence become susceptible to attacks. A number of recently proposed secure routing protocols entail a number of prerequisites during both the network establishment and operation phases as they employ cryptographic algorithms. In contrast, trust-based routing protocols locate trusted routes and permit rapid deployment along with a dynamically adaptive operation, which conforms with the current network situation. In this paper, we evaluate the performance of our proposed Fuzzy based Trusted AODV routing protocol in a network, with varying number of malicious nodes. With the help of simulations, we demonstrate that the performance of the proposed protocol is better than AODV in terms of routing overhead ratio, throughput, latency and packet loss under similar attack conditions.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128415858","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}
引用次数: 51
Cleavage Site Detection in Broken 3D Objects 破碎3D物体的切割位置检测
V. Kaushik, A. Singh, Jatin Varshney, Prashant Pandey, K. P. Rao, V. Pathak
{"title":"Cleavage Site Detection in Broken 3D Objects","authors":"V. Kaushik, A. Singh, Jatin Varshney, Prashant Pandey, K. P. Rao, V. Pathak","doi":"10.1109/adcom.2007.73","DOIUrl":"https://doi.org/10.1109/adcom.2007.73","url":null,"abstract":"This paper presents an efficient surface inspection algorithm for cleavage site detection in broken 3D objects. Presented algorithm is intended to be used as a preprocessing stage for broken object reassembly. It helps reduce the area to be matched drastically by marking only the broken part of the surface resulting in much faster matches. The algorithm captures differences in the geometric structure in different parts of the 3D object represented by polygon meshes. These differences are used to find most probable cleavage/fracture sites. The presented approach is robust and the computations are simple making it time efficient, easy to implement and applicable to all triangulated surface data even in presence of noise. The algorithm finds extensive use in the field of computer vision, archeology, and computer aided orthopedic surgery etc. Index Terms-- Cleavage site detection, Roughness Estimation, 3D meshes.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127980017","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}
引用次数: 1
Hardware-Efficient Architecture for Generalized Voronoi Diagram Construction Using a Prediction-Correction Approach 基于预测校正方法的通用Voronoi图构造的硬件高效架构
L. Vachhani, K. Sridharan
{"title":"Hardware-Efficient Architecture for Generalized Voronoi Diagram Construction Using a Prediction-Correction Approach","authors":"L. Vachhani, K. Sridharan","doi":"10.1109/ADCOM.2007.42","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.42","url":null,"abstract":"This paper presents a hardware-efficient scheme to con- struct sensor-based Generalized Voronoi Diagram (GVD) of an indoor environment. An architecture to construct the GVD using a prediction and correction strategy is pre- sented. The approach is based on processing distance infor- mation from ultrasonic sensors. A feature of the proposed approach is that it does not involve operations that are ex- pensive in hardware. Results of FPGA implementation are also presented. The design is shown to be space efficient and fits in a low-end FPGA device (with a small number of system gates). Keywords: Generalized Voronoi Diagram (GVD), Ultra- sonic sensors, Prediction and Correction Strategy, Architec- ture, Field Programmable Gate Array (FPGA), Robotics","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"79 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128116799","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}
引用次数: 5
Cryptography and security - future challenges and issues 密码学和安全性——未来的挑战和问题
S. Burman
{"title":"Cryptography and security - future challenges and issues","authors":"S. Burman","doi":"10.1109/ADCOM.2007.141","DOIUrl":"https://doi.org/10.1109/ADCOM.2007.141","url":null,"abstract":"We live in an era of unimaginably rapidly advancing and amazing technologies that enable instantaneous flow of information - anytime, anywhere. The convergence of computers and networks has been the key force behind the development of these awe inspiring technologies. Increasing use of systems built using these information technologies (IT) is having a profound impact on our everyday lives. These technologies are becoming all pervasive and ubiquitous. An illustration of this is provided by the development of mobile communication. There is a flurry of activity in the development of novel applications that run on this infrastructure. Phones have gone from wireless to small to smart to a situation where they can be used as entertainment devices (games, radios, mp3 players, cameras and now television), for serious personal applications(for location services, messaging and authentication, banking) in addition to being used also to talk to people. The fast paced development of these applications has been enabled by the flexibility of the underlying computing platform and the communication infrastructure. The key perquisite for the continued development and successful exploitation of IT is the notion of assurance. Information Assurance involves - Conducting those operations that protect and defend information and information systems by ensuring availability, integrity, authentication, confidentiality, and non-repudiation. This includes providing for restoration of information systems by incorporating protection, detection, and reaction capabilities.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127278273","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}
引用次数: 3
A Mobile System for Detecting and Notifying Vehicle Rollover Events 一种用于检测和通知车辆侧翻事件的移动系统
D. Acharya, V. Kumar, G. Gaddis
{"title":"A Mobile System for Detecting and Notifying Vehicle Rollover Events","authors":"D. Acharya, V. Kumar, G. Gaddis","doi":"10.1109/adcom.2007.102","DOIUrl":"https://doi.org/10.1109/adcom.2007.102","url":null,"abstract":"According to National Highway Traffic Safety Administration, the rate of serious injury in passenger vehicle rollover crashes is 36 percent higher than in crashes with no rollover. An ideal emergency notification system would detect life threatening events immediately and then notify service providers within a short period of time without any human intervention, with necessary information to permit the delivery of appropriate type of help quickly. While there are very few existing systems that have similar functions, none of them perform the event notification without the help of human intervention. At the same time, these systems are very costly and vehicle specific. The objective of this work is to design and develop an economical general purpose wireless emergency event notification system for vehicles that might roll over. This system uses wireless channels to dispatch necessary information to emergency service providers for acquiring necessary help, with no requirement for human intervention.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123454778","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}
引用次数: 6
A New Cluster Validity Index Based on Fuzzy Granulation-degranulation Criteria 基于模糊制粒-脱粒准则的聚类有效性新指标
S. Saha, S. Bandyopadhyay
{"title":"A New Cluster Validity Index Based on Fuzzy Granulation-degranulation Criteria","authors":"S. Saha, S. Bandyopadhyay","doi":"10.1109/adcom.2007.19","DOIUrl":"https://doi.org/10.1109/adcom.2007.19","url":null,"abstract":"Identification of correct number of clusters and the corresponding partitioning are two important considerations in clustering. In this paper, a new fuzzy quantization-dequantization criterion is used to propose a cluster validity index named fuzzy vector quantization based validity index, FVQ index. This index identifies how well the formed cluster centers represent that particular data set. In general, most of the existing validity indices try to optimize the total variance of the partitioning which is a measure of compactness of the clusters so formed. Here a new kind of error function which reflects how well the formed cluster centers represent the whole data set is used as the goodness of the obtained partitioning. This error function is monotonically decreasing with increase in the number of clusters. Minimum separation between two cluster centers is used here to normalize the error function. The well-known genetic algorithm based K-means clustering algorithm (GAK-means) is used as the underlying partitioning technique. The number of clusters is varied from 2 to radicN where N is the total number of data points present in the data set and the values of the proposed validity index is noted down. The minimum value of the FVQ index over these radicN-1 partitions corresponds to the appropriate partitioning and the number of partitions as indicated by the validity index. Results on five artificially generated and three real-life data sets show the effectiveness of the proposed validity index. For the purpose of comparison the cluster number identified by a well-known cluster validity index, XB-index, for the above mentioned eight data sets are also reported.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115225325","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}
引用次数: 15
Some New Multi-Protocol Attacks 一些新的多协议攻击
A. Mathuria, Aditya Raj Singh, P. Venkat Shravan, R. Kirtankar
{"title":"Some New Multi-Protocol Attacks","authors":"A. Mathuria, Aditya Raj Singh, P. Venkat Shravan, R. Kirtankar","doi":"10.1109/adcom.2007.112","DOIUrl":"https://doi.org/10.1109/adcom.2007.112","url":null,"abstract":"Security protocols are often designed and analyzed in isolation. In the real world, however, more than one protocol may be executed concurrently, possibly with the same keying material. An intruder may therefore be able to manipulate messages from different protocols in order to break the security of an otherwise secure protocol. Attacks involving interactions between different protocols, also referred to as multi-protocol attacks, have appeared less frequently in the literature than attacks involving single protocols. This paper presents multi-protocol attacks on several existing protocols that are believed to be resistant to attacks when used in isolation.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128077095","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}
引用次数: 6
A Game Theoretical Approach for Efficient Deployment of Intrusion Detection System in Mobile Ad Hoc Networks 移动自组织网络中入侵检测系统高效部署的博弈方法
N. Marchang, R. Tripathi
{"title":"A Game Theoretical Approach for Efficient Deployment of Intrusion Detection System in Mobile Ad Hoc Networks","authors":"N. Marchang, R. Tripathi","doi":"10.1109/adcom.2007.58","DOIUrl":"https://doi.org/10.1109/adcom.2007.58","url":null,"abstract":"In this paper, we present a game-theoretic model of intrusion detection systems (IDSs) for Mobile Ad hoc Networks. In most of the existing intrusion detection systems for MANETs, a detection system sits on every node, which runs all the time, which is a costly overhead for a battery-powered mobile device. We have used game theory to model the interactions between the intrusion detection system and the attacker to determine whether it is essential to always keep the IDS running without compromising on its effectiveness. The results of our analysis show that one need not keep an IDS running all the time. Besides, our analysis helps in determining how frequently one must keep the IDS running under different conditions.","PeriodicalId":185608,"journal":{"name":"15th International Conference on Advanced Computing and Communications (ADCOM 2007)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122035503","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}
引用次数: 13
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信