Pub Date : 2014-11-01DOI: 10.1109/IC3I.2014.7019719
A. R. Kulkarni, A. Pallavi
Modified data aggregation at MAC layer of 4G technology using dynamic aggregation technique, wherein the data from neighboring nodes is embedded in the turbo encoded payload of the selected node is proposed in this paper. This model developed on NS3 platform is compared to the existing AFR techniques and is found to have a lower encoded data bit rate. This scheme integrates aggregation & reliability (low bit error rate resulting from usage of Turbo codes) using the same basic architecture leading to a reduction in the power consumption. The proposed embedding scheme (of 1/3 rate) detailed in our paper results in a BER which is better than that of rate ½ turbo codes.
{"title":"Data aggregation using doped turbo codes","authors":"A. R. Kulkarni, A. Pallavi","doi":"10.1109/IC3I.2014.7019719","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019719","url":null,"abstract":"Modified data aggregation at MAC layer of 4G technology using dynamic aggregation technique, wherein the data from neighboring nodes is embedded in the turbo encoded payload of the selected node is proposed in this paper. This model developed on NS3 platform is compared to the existing AFR techniques and is found to have a lower encoded data bit rate. This scheme integrates aggregation & reliability (low bit error rate resulting from usage of Turbo codes) using the same basic architecture leading to a reduction in the power consumption. The proposed embedding scheme (of 1/3 rate) detailed in our paper results in a BER which is better than that of rate ½ turbo codes.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127967725","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}
Pub Date : 2014-11-01DOI: 10.1109/IC3I.2014.7019746
J. Rajeshwari, K. Karibasappa, M. T. Gopalkrishna
Face detection is used to locate and as well as identify the human faces in the image or video in different illumination, pose, orientation, in-plane rotation, position. Since face is the centre of attraction in video and images, it is used in several applications such as security, retrieval, video compression, recognition technology. Face detection is having a high degree of variance in its appearance which makes difficult problem in computer vision. Most of the images or videos are corrupted, hence a complete study of face detection based on skin is required. This paper presents a comparison on different methods used to detect the face for different illumination, pose and occlusion on skin based. By reviewing existing algorithms better algorithms can be developed for computer vision problems.
{"title":"Survey on skin based face detection on different illumination, poses and occlusion","authors":"J. Rajeshwari, K. Karibasappa, M. T. Gopalkrishna","doi":"10.1109/IC3I.2014.7019746","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019746","url":null,"abstract":"Face detection is used to locate and as well as identify the human faces in the image or video in different illumination, pose, orientation, in-plane rotation, position. Since face is the centre of attraction in video and images, it is used in several applications such as security, retrieval, video compression, recognition technology. Face detection is having a high degree of variance in its appearance which makes difficult problem in computer vision. Most of the images or videos are corrupted, hence a complete study of face detection based on skin is required. This paper presents a comparison on different methods used to detect the face for different illumination, pose and occlusion on skin based. By reviewing existing algorithms better algorithms can be developed for computer vision problems.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132628350","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}
Pub Date : 2014-11-01DOI: 10.1109/IC3I.2014.7019702
V. Ranga, M. Dave, A. Verma
In this research paper we study the problem of optimal actor nodes selection based on mutual exclusion in the context of wireless sensor and actor network (WSAN) and propose a novel distributed approach to solve it. The major requirements for any proposed approach in such scenario are: (1) the proposed approach should select the minimum number of actor nodes to act on the given incident event region, (2) the overlaps between acting ranges should be minimum to avoid redundant action by actor nodes i.e. wastage of resources should be minimal, and finally, whole event region must be covered by one or more than one actors as per their availability in the network i.e. full coverage should be achieved. We have proposed one novel approach called Distributed Optimal Actor nodes Selection based on Mutual Exclusion approach (DOASME) in this research paper. The simulation results show the performance in terms of size of actor cover set, overlapped region, non-overlapped region and maximum actor coverage degree. We have also compared our simulated results with previously proposed benchmark algorithms.
{"title":"A distributed approach for selection of optimal actor nodes in wireless sensor and actor networks","authors":"V. Ranga, M. Dave, A. Verma","doi":"10.1109/IC3I.2014.7019702","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019702","url":null,"abstract":"In this research paper we study the problem of optimal actor nodes selection based on mutual exclusion in the context of wireless sensor and actor network (WSAN) and propose a novel distributed approach to solve it. The major requirements for any proposed approach in such scenario are: (1) the proposed approach should select the minimum number of actor nodes to act on the given incident event region, (2) the overlaps between acting ranges should be minimum to avoid redundant action by actor nodes i.e. wastage of resources should be minimal, and finally, whole event region must be covered by one or more than one actors as per their availability in the network i.e. full coverage should be achieved. We have proposed one novel approach called Distributed Optimal Actor nodes Selection based on Mutual Exclusion approach (DOASME) in this research paper. The simulation results show the performance in terms of size of actor cover set, overlapped region, non-overlapped region and maximum actor coverage degree. We have also compared our simulated results with previously proposed benchmark algorithms.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114926948","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}
Pub Date : 2014-11-01DOI: 10.1109/IC3I.2014.7019672
Anand Shanker Tewari, T. S. Ansari, A. Barman
In the rapidly increasing field of E-commerce, buyer is surrounded by many product information. However, search engines like Google, Baidu, can't satisfy the demands of buyer because the information about the product that the users want can't be obtain quickly, easily and correctly. So buyer has to spend lots of time in removing the unnecessary information. Many e-commerce website often request buyers to review products that they have already purchased. As the popularity of e-commerce is increasing day by day, the reviews from customers about the product receives also increasing heavily. As a result of this it is difficult for a buyer to read all the reviews to make a decision about the product purchase. In this paper, we extracted, summarize and categorize all the customer reviews of a book. This paper proposes a book recommendation technique based on opinion mining and Naïve Bayes classifier to recommend top ranking books to buyers. This paper also considered the important factor like price of the book while recommendation and presented a novel tabular efficient method for recommending books to the buyer, especially when the buyer is coming first time to the website.
{"title":"Opinion based book recommendation using Naive Bayes classifier","authors":"Anand Shanker Tewari, T. S. Ansari, A. Barman","doi":"10.1109/IC3I.2014.7019672","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019672","url":null,"abstract":"In the rapidly increasing field of E-commerce, buyer is surrounded by many product information. However, search engines like Google, Baidu, can't satisfy the demands of buyer because the information about the product that the users want can't be obtain quickly, easily and correctly. So buyer has to spend lots of time in removing the unnecessary information. Many e-commerce website often request buyers to review products that they have already purchased. As the popularity of e-commerce is increasing day by day, the reviews from customers about the product receives also increasing heavily. As a result of this it is difficult for a buyer to read all the reviews to make a decision about the product purchase. In this paper, we extracted, summarize and categorize all the customer reviews of a book. This paper proposes a book recommendation technique based on opinion mining and Naïve Bayes classifier to recommend top ranking books to buyers. This paper also considered the important factor like price of the book while recommendation and presented a novel tabular efficient method for recommending books to the buyer, especially when the buyer is coming first time to the website.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133621662","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}
Pub Date : 2014-11-01DOI: 10.1109/IC3I.2014.7019651
Anand Shanker Tewari, K. Priyanka
Recommendation systems are tools in e-commerce websites which helps user to find the appropriate products. With the rapid development of internet technologies the number of online book selling websites has increased which enhanced the competition among them. This paper presents online book recommendation system for students reading textbooks. The main motive of this paper is to develop the technique which recommends most suitable books to the students according to their price range and publisher's name. This is based on the combined features of classification, user based collaborative filtering and association rule mining.
{"title":"Book recommendation system based on collaborative filtering and association rule mining for college students","authors":"Anand Shanker Tewari, K. Priyanka","doi":"10.1109/IC3I.2014.7019651","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019651","url":null,"abstract":"Recommendation systems are tools in e-commerce websites which helps user to find the appropriate products. With the rapid development of internet technologies the number of online book selling websites has increased which enhanced the competition among them. This paper presents online book recommendation system for students reading textbooks. The main motive of this paper is to develop the technique which recommends most suitable books to the students according to their price range and publisher's name. This is based on the combined features of classification, user based collaborative filtering and association rule mining.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130445197","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}
Pub Date : 2014-11-01DOI: 10.1109/IC3I.2014.7019659
Rajiv Yerra, Yiu-Kai Ng
Text document categorization is one of the rapidly emerging research fields, where documents are identified, differentiated and classified manually or algorithmically. The paper focuses on application of automatic text document categorization in plagiarism detection domain. In today's world plagiarism has become a prime concern, especially in research and educational fields. This paper aims on the study and comparison of different methods of document categorization in external plagiarism detection. Here the primary focus is to explore the unsupervised document categorization/ clustering methods using different variations of K-means algorithm and compare it with the general N-gram based method and Vector Space Model based method. Finally the analysis and evaluation is done using data set from PAN-20131 and performance is compared based on precision, recall and efficiency in terms of time taken for algorithm execution.
{"title":"Using K-means cluster based techniques in external plagiarism detection","authors":"Rajiv Yerra, Yiu-Kai Ng","doi":"10.1109/IC3I.2014.7019659","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019659","url":null,"abstract":"Text document categorization is one of the rapidly emerging research fields, where documents are identified, differentiated and classified manually or algorithmically. The paper focuses on application of automatic text document categorization in plagiarism detection domain. In today's world plagiarism has become a prime concern, especially in research and educational fields. This paper aims on the study and comparison of different methods of document categorization in external plagiarism detection. Here the primary focus is to explore the unsupervised document categorization/ clustering methods using different variations of K-means algorithm and compare it with the general N-gram based method and Vector Space Model based method. Finally the analysis and evaluation is done using data set from PAN-20131 and performance is compared based on precision, recall and efficiency in terms of time taken for algorithm execution.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116983927","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}
Pub Date : 2014-11-01DOI: 10.1109/IC3I.2014.7019814
Suman V. Patgar, K. Rani, T. Vasudev
Photocopy documents are very common in our normal life. People are permitted to carry and produce photocopied documents frequently, to avoid damages or losing the original documents. But this provision is misused for temporary benefits by fabricating fake photocopied documents. When a photocopied document is produced, it may be required to check for its authenticity. An attempt is made in this direction to detect such fabricated photocopied documents. This paper proposes a system to detect fabricated photocopied document using Bounding box. The work in this paper mainly focuses on detecting fabrication of photocopied document in which some contents are manipulated by smearing whitener over the original content and writing new contents above it and manipulate the content through cut and paste technique. A detailed experimental study has been performed using a collected sample set of considerable size and a decision model is developed for classification. Testing is performed on set of collected testing samples resulted in an average detection rate close to 86%.
{"title":"An unsupervised intelligent system to detect fabrication in photocopy document using variations in Bounding Box features","authors":"Suman V. Patgar, K. Rani, T. Vasudev","doi":"10.1109/IC3I.2014.7019814","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019814","url":null,"abstract":"Photocopy documents are very common in our normal life. People are permitted to carry and produce photocopied documents frequently, to avoid damages or losing the original documents. But this provision is misused for temporary benefits by fabricating fake photocopied documents. When a photocopied document is produced, it may be required to check for its authenticity. An attempt is made in this direction to detect such fabricated photocopied documents. This paper proposes a system to detect fabricated photocopied document using Bounding box. The work in this paper mainly focuses on detecting fabrication of photocopied document in which some contents are manipulated by smearing whitener over the original content and writing new contents above it and manipulate the content through cut and paste technique. A detailed experimental study has been performed using a collected sample set of considerable size and a decision model is developed for classification. Testing is performed on set of collected testing samples resulted in an average detection rate close to 86%.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131515706","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}
Pub Date : 2014-11-01DOI: 10.1109/IC3I.2014.7019710
M. Murmu
The distributed systems are highly fault prone environment to work with. Thus, fault tolerance is a major concern in distributed computing. The available failure resiliency techniques mitigate only the failures that are limited in some way. However, it is extremely difficult to limit the failures because the autonomous nodes may suffer autonomous failures. Nevertheless, in mission critical applications, the uncontrolled failures are unaffordable. Hence, it is highly desirable that the system survives such failures. The survivability of computer networks is a popular research topic. However, the survivability of computing systems has not been in focus. In this illustration, we have attempted to raise this issue and bring out certain requirements and features related to survivable computing systems. To the best of my knowledge, it is the first attempt in the direction.
{"title":"The survivability of computing systems","authors":"M. Murmu","doi":"10.1109/IC3I.2014.7019710","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019710","url":null,"abstract":"The distributed systems are highly fault prone environment to work with. Thus, fault tolerance is a major concern in distributed computing. The available failure resiliency techniques mitigate only the failures that are limited in some way. However, it is extremely difficult to limit the failures because the autonomous nodes may suffer autonomous failures. Nevertheless, in mission critical applications, the uncontrolled failures are unaffordable. Hence, it is highly desirable that the system survives such failures. The survivability of computer networks is a popular research topic. However, the survivability of computing systems has not been in focus. In this illustration, we have attempted to raise this issue and bring out certain requirements and features related to survivable computing systems. To the best of my knowledge, it is the first attempt in the direction.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128253833","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}
Pub Date : 2014-11-01DOI: 10.1109/IC3I.2014.7019743
D. A. Kumar, S. Meher
Granular neural networks (GNNs) take the fuzzy granulated input and process them through neural networks (NNs). As a result, performance of GNNs depends highly on the granulation process and initial weights of NNs. The initial weights between nodes of GNNs provide the starting point in the searching of the lowest cost function value. The present article proposes GNN model that use class-belonging (CB) fuzzy granulation of input information and rough set-theoretic weight initialization of NNs. The model thus avoids the random initialization of weights and provides improved decisions at the output with CB granulation. Classification performance of the proposed GNN model has been assessed using various measurement indexes and its superiority over similar other methods is justified. Conventional back propagation algorithm is used to train the proposed model of GNN.
{"title":"Granular neural networks models with class-belonging granulation","authors":"D. A. Kumar, S. Meher","doi":"10.1109/IC3I.2014.7019743","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019743","url":null,"abstract":"Granular neural networks (GNNs) take the fuzzy granulated input and process them through neural networks (NNs). As a result, performance of GNNs depends highly on the granulation process and initial weights of NNs. The initial weights between nodes of GNNs provide the starting point in the searching of the lowest cost function value. The present article proposes GNN model that use class-belonging (CB) fuzzy granulation of input information and rough set-theoretic weight initialization of NNs. The model thus avoids the random initialization of weights and provides improved decisions at the output with CB granulation. Classification performance of the proposed GNN model has been assessed using various measurement indexes and its superiority over similar other methods is justified. Conventional back propagation algorithm is used to train the proposed model of GNN.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123020207","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}
Pub Date : 2014-11-01DOI: 10.1109/IC3I.2014.7019664
A. N. Nagamani, S. Ashwin, V. K. Agrawal
Reversible logic has gained the interest of many researchers due to its applicability in emerging low power technologies such as Quantum computing, QCA, optical computing etc., Adders/Subtractors are basic design components of any processor. Optimized design of these adders results in efficient processors. In this work we propose optimized Binary adders/subtractors and BCD adders. The adders/subtractors designed in this work are optimized for Quantum cost and Delay. We also propose a generic design of n-bit adders and subtractors. In this work, we explore the use of Negative control lines for detecting overflow logic of BCD adder which considerably reduces Quantum cost, delay and gate count which result in high speed BCD adder with optimized area which give way to lot of scope in the field of reversible computing in near future.
{"title":"Design of optimized reversible binary adder/subtractor and BCD adder","authors":"A. N. Nagamani, S. Ashwin, V. K. Agrawal","doi":"10.1109/IC3I.2014.7019664","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019664","url":null,"abstract":"Reversible logic has gained the interest of many researchers due to its applicability in emerging low power technologies such as Quantum computing, QCA, optical computing etc., Adders/Subtractors are basic design components of any processor. Optimized design of these adders results in efficient processors. In this work we propose optimized Binary adders/subtractors and BCD adders. The adders/subtractors designed in this work are optimized for Quantum cost and Delay. We also propose a generic design of n-bit adders and subtractors. In this work, we explore the use of Negative control lines for detecting overflow logic of BCD adder which considerably reduces Quantum cost, delay and gate count which result in high speed BCD adder with optimized area which give way to lot of scope in the field of reversible computing in near future.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121433171","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：