Pub Date : 2014-11-01DOI: 10.1109/IC3I.2014.7019595
Priyanksha Khanna
This paper investigates testability from the perspective of metrics used in an object-oriented system. The idea is to give an overview of object oriented design metrics with the prioritization of same keeping testability as the overall goal. We have used Analytic Hierarchy Process (AHP) method to attain which metric is mostly used and is best for testability.
{"title":"Testability of object-oriented systems: An AHP-based approach for prioritization of metrics","authors":"Priyanksha Khanna","doi":"10.1109/IC3I.2014.7019595","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019595","url":null,"abstract":"This paper investigates testability from the perspective of metrics used in an object-oriented system. The idea is to give an overview of object oriented design metrics with the prioritization of same keeping testability as the overall goal. We have used Analytic Hierarchy Process (AHP) method to attain which metric is mostly used and is best for testability.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"258 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":"115689280","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.7019741
Seema B. Hegde, Research Scholor, B Sathish Babu
Opportunistic computing(OC) being a new paradigm of computing exploits the chance of acquiring the devices and service required for computing with the principle, sharing of resources with resource utilization at high priority. Among the multitude of challenges faced by OC, routing and security factors are the urgent issues to be attended. The paper provides a review of various routing protocols taxnomised based on the smartness they accomplish and security protocols designed around the OC principles.
{"title":"An analysis of routing and security protocols in oppurtunstic computing","authors":"Seema B. Hegde, Research Scholor, B Sathish Babu","doi":"10.1109/IC3I.2014.7019741","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019741","url":null,"abstract":"Opportunistic computing(OC) being a new paradigm of computing exploits the chance of acquiring the devices and service required for computing with the principle, sharing of resources with resource utilization at high priority. Among the multitude of challenges faced by OC, routing and security factors are the urgent issues to be attended. The paper provides a review of various routing protocols taxnomised based on the smartness they accomplish and security protocols designed around the OC principles.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"34 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":"123849564","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.7019706
G. Vadivelou, E. Ilavarasan
Web services have become the primary source for constructing software system over Internet. The quality of whole system greatly dependents on the QoS of single Web service, so QoS information is an important indicator for service selection. In reality, QoSs of some Web services may be unavailable for users. How to predicate the missing QoS value of Web service through fully using the existing information is a difficult problem. This paper attempts to settle this difficulty by fusing Pearson similarity and Slope One methods for QoS prediction. In this paper, the Pearson similarity is adopted between two services as the weight of their deviation. Meanwhile, some strategies like weight adjustment and SPC-based smoothing are also utilized for reducing prediction error. In order to evaluate the validity of the proposed algorithm, comparative experiments are performed on the real-world data set. The result shows that the proposed algorithm exhibits better prediction precision than both basic Slope One and the well-known WsRec algorithm in most cases. Meanwhile, the new approach has the strong ability of reducing the impact of noise data.
{"title":"Fusion of Pearson similarity and Slope One methods for QoS prediction for web services","authors":"G. Vadivelou, E. Ilavarasan","doi":"10.1109/IC3I.2014.7019706","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019706","url":null,"abstract":"Web services have become the primary source for constructing software system over Internet. The quality of whole system greatly dependents on the QoS of single Web service, so QoS information is an important indicator for service selection. In reality, QoSs of some Web services may be unavailable for users. How to predicate the missing QoS value of Web service through fully using the existing information is a difficult problem. This paper attempts to settle this difficulty by fusing Pearson similarity and Slope One methods for QoS prediction. In this paper, the Pearson similarity is adopted between two services as the weight of their deviation. Meanwhile, some strategies like weight adjustment and SPC-based smoothing are also utilized for reducing prediction error. In order to evaluate the validity of the proposed algorithm, comparative experiments are performed on the real-world data set. The result shows that the proposed algorithm exhibits better prediction precision than both basic Slope One and the well-known WsRec algorithm in most cases. Meanwhile, the new approach has the strong ability of reducing the impact of noise data.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"44 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":"125165393","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.7019581
Gourav Kumar Javeriya, Deepak Gupta, Shikha Gupta, A. Dahiya
In this paper we work on noise analysis on blocks of images. We introduced a technique through which we are observing the effect of noise on various blocks of an image. Finally we are resultant the maximum and minimum effect of noise. For the proposed work we are considering only Gaussian noise. PSNR and SNR values are calculated for images with and without blocks. Proposed work has been implemented on many images of same format. This paper is highly beneficial for reducing the noise to only those blocks which are highly affected instead of applying the process of noise removal on whole image. This can reduce the processing time highly on the cost of small considerable noise. Also, the another advantage of this approach is that in the real time system, the blocks of image having high value of noise can be determined and can be processed further leaving the blocks with the low values of noise. This can effectively reduce the processing time without applying an extra effort.
{"title":"Noise distribution on various blocks of image and their analysis","authors":"Gourav Kumar Javeriya, Deepak Gupta, Shikha Gupta, A. Dahiya","doi":"10.1109/IC3I.2014.7019581","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019581","url":null,"abstract":"In this paper we work on noise analysis on blocks of images. We introduced a technique through which we are observing the effect of noise on various blocks of an image. Finally we are resultant the maximum and minimum effect of noise. For the proposed work we are considering only Gaussian noise. PSNR and SNR values are calculated for images with and without blocks. Proposed work has been implemented on many images of same format. This paper is highly beneficial for reducing the noise to only those blocks which are highly affected instead of applying the process of noise removal on whole image. This can reduce the processing time highly on the cost of small considerable noise. Also, the another advantage of this approach is that in the real time system, the blocks of image having high value of noise can be determined and can be processed further leaving the blocks with the low values of noise. This can effectively reduce the processing time without applying an extra effort.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"103 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":"123350817","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.7019643
Rupesh Gupta, T. Singh
Since the rise of usage of internet in the world security is becoming the major concern all over. So making this thing clear in mind developers are continuously working to make internet a safe environment for all the users. Many algorithm or techniques are proposed and they worked but as the intruders are acting smartly to hack information developers are also supposed to invent new techniques to stop hacker's intentions. As per the basic knowledge more is the PSNR value and lesser is the MSE results are better so, here in this paper we are proposing a new method by combing three major security techniques that is cryptography, stegnography and watermarking that will not only hide the information but produce better results for MSE. PSNR and Embedding capacity still after the noise attack. The purpose this paper is to provide a new technique that will provide better security for hiding data in an image and watermarked video.
{"title":"New proposed practice for secure image combing cryptography stegnography and watermarking based on various parameters","authors":"Rupesh Gupta, T. Singh","doi":"10.1109/IC3I.2014.7019643","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019643","url":null,"abstract":"Since the rise of usage of internet in the world security is becoming the major concern all over. So making this thing clear in mind developers are continuously working to make internet a safe environment for all the users. Many algorithm or techniques are proposed and they worked but as the intruders are acting smartly to hack information developers are also supposed to invent new techniques to stop hacker's intentions. As per the basic knowledge more is the PSNR value and lesser is the MSE results are better so, here in this paper we are proposing a new method by combing three major security techniques that is cryptography, stegnography and watermarking that will not only hide the information but produce better results for MSE. PSNR and Embedding capacity still after the noise attack. The purpose this paper is to provide a new technique that will provide better security for hiding data in an image and watermarked video.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"211 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":"124147875","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.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.7019805
M. Saranya, Arun K. Mohan, K. Anusudha
A Composite algorithm for improved image security is proposed by taking the advantages of DNA based image encryption and evolutionary algorithms (EA). A number of deoxyribonucleic acid (DNA) masks are created using logistic map function and DNA conversion rules. Then encryption is performed on the plain image to generate a number of cipher images. Finally, genetic algorithm (GA) is applied to find the best DNA mask. From the simulation results it is observed that the proposed scheme improves the level of security.
{"title":"A composite image cipher using DNA sequence and genetic algorithm","authors":"M. Saranya, Arun K. Mohan, K. Anusudha","doi":"10.1109/IC3I.2014.7019805","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019805","url":null,"abstract":"A Composite algorithm for improved image security is proposed by taking the advantages of DNA based image encryption and evolutionary algorithms (EA). A number of deoxyribonucleic acid (DNA) masks are created using logistic map function and DNA conversion rules. Then encryption is performed on the plain image to generate a number of cipher images. Finally, genetic algorithm (GA) is applied to find the best DNA mask. From the simulation results it is observed that the proposed scheme improves the level of security.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"8 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":"131118782","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.7019624
Navjot Kaur, G. Soni
Free space optical communication provides a unique method for the satellites orbiting around the earth to communication with each other. Inter-satellite optical wireless communication systems (IsOWC), one of the important applications of Free space optical communication technology, will be deployed in space in the near future as such systems provide a high bandwidth, small size, light weight, low power and low cost alternative to present microwave satellite systems. In this paper, optical inter-satellite link (ISL) is modeled using optisystem and then investigation is carried out to study the effect of varying the wavelength between two satellites estranged by a distance of 1300 km at data rate 3 Gbps. In this paper the performance of the IsOWC link is evaluated keeping into consideration the pointing errors.
{"title":"Performance analysis of inter-satellite optical wireless communication (IsOWC) system at 980 nm and 1550 nm wavelengths","authors":"Navjot Kaur, G. Soni","doi":"10.1109/IC3I.2014.7019624","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019624","url":null,"abstract":"Free space optical communication provides a unique method for the satellites orbiting around the earth to communication with each other. Inter-satellite optical wireless communication systems (IsOWC), one of the important applications of Free space optical communication technology, will be deployed in space in the near future as such systems provide a high bandwidth, small size, light weight, low power and low cost alternative to present microwave satellite systems. In this paper, optical inter-satellite link (ISL) is modeled using optisystem and then investigation is carried out to study the effect of varying the wavelength between two satellites estranged by a distance of 1300 km at data rate 3 Gbps. In this paper the performance of the IsOWC link is evaluated keeping into consideration the pointing errors.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"34 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":"130083136","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.7019825
M. Patel, S. L. Reddy
The scanning of paper documents followed by the storage, retrieval, display, and management of the resulting electronic images, is known as document image processing, which is a subfield of Digital Image Processing. The main objective of the document image analysis is to recognize the text and graphics components in the images. Optical Character Recognition [OCR] is the process of converting the image obtained by scanning a text or a document into machine-editable format. OCR has practical potential applications in writer identification, forensic analysis handwriting, health care, legal, banking, postal services, etc. Recently, handwriting recognition is now gain spread lot of importance due to sources such as paper documents, photographs, touch-screens and other devices. In this paper we study the impact of grid based approach in offline handwritten Kannada word recognition. Popular subspace learning method, i.e. Principal Component Analysis is used for better representation of the given input word. The study is experimented on handwritten word comprising of 28 district names of Karnataka state. The experiment suggest grid based approach outperforms the standard global based approach.
{"title":"An impact of grid based approach in offline handwritten Kannada word recognition","authors":"M. Patel, S. L. Reddy","doi":"10.1109/IC3I.2014.7019825","DOIUrl":"https://doi.org/10.1109/IC3I.2014.7019825","url":null,"abstract":"The scanning of paper documents followed by the storage, retrieval, display, and management of the resulting electronic images, is known as document image processing, which is a subfield of Digital Image Processing. The main objective of the document image analysis is to recognize the text and graphics components in the images. Optical Character Recognition [OCR] is the process of converting the image obtained by scanning a text or a document into machine-editable format. OCR has practical potential applications in writer identification, forensic analysis handwriting, health care, legal, banking, postal services, etc. Recently, handwriting recognition is now gain spread lot of importance due to sources such as paper documents, photographs, touch-screens and other devices. In this paper we study the impact of grid based approach in offline handwritten Kannada word recognition. Popular subspace learning method, i.e. Principal Component Analysis is used for better representation of the given input word. The study is experimented on handwritten word comprising of 28 district names of Karnataka state. The experiment suggest grid based approach outperforms the standard global based approach.","PeriodicalId":430848,"journal":{"name":"2014 International Conference on Contemporary Computing and Informatics (IC3I)","volume":"53 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":"129459602","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：