2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)最新文献_第7页

Speech compression using different transform techniques 语音压缩采用不同的变换技术

2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011) Pub Date : 2011-11-10 DOI: 10.1109/ICCCT.2011.6075173

G. Rajesh, A. Kumar, K. Ranjeet

引用次数: 23

Document image retrieval using signature as query 使用签名作为查询的文档图像检索

2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011) Pub Date : 2011-11-10 DOI: 10.1109/ICCCT.2011.6075200

M. Shirdhonkar, M. Kokare

引用次数: 7

Clustering of scale free networks using a k-medoid framework 基于k-媒质框架的无标度网络聚类

2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011) Pub Date : 2011-11-10 DOI: 10.1109/ICCCT.2011.6075178

Samik Ray, M. K. Pakhira

引用次数: 4

A modified parallel approach to Single Source Shortest Path Problem for massively dense graphs using CUDA 基于CUDA的大规模密集图单源最短路径问题的改进并行方法

2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011) Pub Date : 2011-11-10 DOI: 10.1109/ICCCT.2011.6075214

Sumit Kumar, A. Misra, R. S. Tomar

引用次数: 31

A metric suite for early estimation of software testing effort using requirement engineering document and its validation 一个度量套件，用于使用需求工程文档及其验证对软件测试工作进行早期估计

2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011) Pub Date : 2011-11-10 DOI: 10.1109/ICCCT.2011.6075150

Ashish Sharma, D. S. Kushwaha

{"title":"A metric suite for early estimation of software testing effort using requirement engineering document and its validation","authors":"Ashish Sharma, D. S. Kushwaha","doi":"10.1109/ICCCT.2011.6075150","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075150","url":null,"abstract":"Software testing is one of the most important and critical activity of software development life cycle which ensures software quality and directly influences the development cost and success of the software. This paper empirically proposes a test metric for the estimation of the software testing effort using IEEE-Software Requirement Specification (SRS) document in order to avoid budget overshoot, schedule escalation etc., at very early stage of software development. Further the effort required to develop or test the software will also depend on the complexity of the proposed software. Therefore the proposed test metric computes the requirement based complexity for yet to be developed software on the basis of SRS document. Later the proposed measure is also compared with other proposals for test effort estimation like code based, cognitive value based and use case based measures. The result obtained validates that the proposed test metric is a comprehensive one and compares well with various other prominent measures. The computation of proposed test effort estimation involves least overhead as compared to others.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133291763","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}

引用次数: 17

A cryptanalytic attack on the knapsack cryptosystem using binary Firefly algorithm 利用二进制萤火虫算法对背包密码系统进行密码分析攻击

2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011) Pub Date : 2011-11-10 DOI: 10.1109/ICCCT.2011.6075143

Supravo Palit, Saptarshi Neil Sinha, Mostafiz Amin Molla, Atreyee Khanra, Malay Kule

引用次数: 89

A reliable and total order tree based broadcast in wireless sensor network 基于全顺序树的无线传感器网络可靠广播

2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011) Pub Date : 2011-11-10 DOI: 10.1109/ICCCT.2011.6075099

Suchetana Chakraborty, Sandip Chakraborty, Sukumar Nandi, S. Karmakar

{"title":"A reliable and total order tree based broadcast in wireless sensor network","authors":"Suchetana Chakraborty, Sandip Chakraborty, Sukumar Nandi, S. Karmakar","doi":"10.1109/ICCCT.2011.6075099","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075099","url":null,"abstract":"A reliable broadcast demands that each data packet forwarded from the source node is received by all other nodes in the network without any loss. A flooding based Broadcast scheme incurs significant overhead due to explosion of packets in the network. So an efficient way of routing packets in order to broadcast saves the energy of resource constrained sensor nodes. The delivery of broadcast packets at each node in correct sequence is also crucial for certain applications. In this paper a tree based broadcast mechanism is proposed that constructs a spanning tree out of all nodes in the network rooted at the source of the broadcast. The broadcast tree eventually becomes a Breadth-First Search(BFS) tree where each node maintains the shortest path to the root. So packets routed through the shortest paths reduce transmission delay and packet loss. BFS tree based broadcast saves the battery power at each node by reducing the number of packet transmissions. The proposed scheme for broadcast is also crash tolerant. Each node computes a maintenance plan during the broadcast tree construction for future requirement. If a node dies, all the nodes in neighborhood repairs the tree locally within constant round of message transmissions. Each broadcast packet is assured to be delivered at each node without redundancy and maintaining the correct order.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115847221","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}

引用次数: 7

Human mobility based message transfer in Delay Tolerant Networks — A single relay approach 容忍延迟网络中基于人的移动性的消息传输。单中继方法

2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011) Pub Date : 2011-11-10 DOI: 10.1109/ICCCT.2011.6075187

R. J. D'Souza, Johny Jose

{"title":"Human mobility based message transfer in Delay Tolerant Networks — A single relay approach","authors":"R. J. D'Souza, Johny Jose","doi":"10.1109/ICCCT.2011.6075187","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075187","url":null,"abstract":"A Delay Tolerant Network (DTN) is a type of Mobile Ad Hoc Network, where end-to-end connectivity between a pair of nodes may never exist. Due to this lack of end-to-end connectivity, traditional routing methods are not suitable in a DTN. However, various approaches have been proposed to achieve message transfer in such a network. This work looks into utilizing the capacity of 802.11n wireless standard, available on the modern mobile devices for this task. Modern mobile devices are equipped with multiple wireless ports as well as ever increasing processing power and storage capacity. They are not utilized as an alternative means for message transfer, even when the infrastructure-based connectivity is not available. The mobile devices move around according to the human mobility pattern, which is semi-deterministic in nature. This work studies how this semi-deterministic nature of human mobility can be effectively utilized for message transfer in a DTN environment. Simulation shows that the existing features of mobile devices are sufficient to achieve close to 100% connection opportunities.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126210469","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

Visual cryptography improvises the security of tongue as a biometric in banking system 视觉密码技术作为一种生物识别技术，在银行系统中提高了语言的安全性

2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011) Pub Date : 2011-11-10 DOI: 10.1109/ICCCT.2011.6075146

Sowmya Suryadevara, R. Naaz, Shweta, Shuchi Kapoor, Anand Sharma

{"title":"Visual cryptography improvises the security of tongue as a biometric in banking system","authors":"Sowmya Suryadevara, R. Naaz, Shweta, Shuchi Kapoor, Anand Sharma","doi":"10.1109/ICCCT.2011.6075146","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075146","url":null,"abstract":"The importance of utilizing biometrics to establish personal authenticity and to detect imposters is growing in the present scenario of global security concern. Also the Development of a biometric system for personal identification, which fulfills the requirement for access control of secured areas and other applications like identity validation for social welfare, crime detection, ATM access, computer security, etc. is felt to be the need of the day. The human tongue promises to deliver a level of uniqueness to identification applications that other biometrics cannot match in context of that it is well protected in mouth and is difficult to forge. The tongue also presents both geometric shape information and physiological texture information which are potentially useful in identity verification applications. The 3D scanning of human tongue is an important tool to acquire accurate shape and texture information of tongue for recognition purposes. As we use biometrics mainly for security purpose so preserving the privacy of digital biometric data (e.g. tongue prints) stored in a central database has become of paramount importance, for this we are using visual cryptography while using it in biometric authentication system. This paper proposes the tongue biometric with visual cryptography technique to increase the efficiency of the proposed tongue biometric authentication system (banking system) using 3D database.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128475652","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}

引用次数: 36

Bayesian versus support vector machine based approaches for facial feature classification in image sequences 基于贝叶斯和支持向量机的图像序列人脸特征分类方法

2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011) Pub Date : 2011-11-10 DOI: 10.1109/ICCCT.2011.6075168

R. A. Patil, V. Sahula, A. S. Mandal

{"title":"Bayesian versus support vector machine based approaches for facial feature classification in image sequences","authors":"R. A. Patil, V. Sahula, A. S. Mandal","doi":"10.1109/ICCCT.2011.6075168","DOIUrl":"https://doi.org/10.1109/ICCCT.2011.6075168","url":null,"abstract":"A method for automatic facial expression recognition in image sequences, is introduced which make use of Candide wire frame model and active appearance algorithm for tracking, and Bayesian classifier for classification. On the first frame of face image sequence, Candide wire frame model is adapted properly. In subsequent frames of image sequence, facial features are tracked using active appearance algorithm. The algorithm adapts Candide wire frame model to the face in each of the frames and tracks the grid in consecutive video frames over time. Last frame of image sequence corresponds to greatest facial expression intensity. The difference of the node coordinates between the first and the greatest facial expression intensity frame, called the geometrical displacement of Candide wire frame nodes is used as an input to a classifier, which classifies facial expression into one of the class such as happy, surprise, sad, anger, disgust and fear. The experimental results show that the proposed method is better in classification correctness in comparison with binary SVM tree classifier.","PeriodicalId":285986,"journal":{"name":"2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116843428","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