{"title":"Component Interoperabilty Using Aspect Oriented Approach","authors":"S. Shukla, R. Yadav, D. K. Yadav","doi":"10.1109/ICCCT.2012.33","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.33","url":null,"abstract":"Component-Based Software Engineering is an emergent discipline that is generating tremendous interest due to the development of plug and play reusable software, which has led to the concept of 'commercial off the shelf' (COTS) components. This approach moves organizations from application development to application assembly. In this paper we are making two components interact with each other. The components are functionally compatible to each other but there are other incompatibilities which will be resolved using Adapter. The components are coded in java and the adapter is implemented using AspectJ.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116847807","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}
Saumitra Krishna, Sachin Kansal, A. Makhal, P. Chakraborty, G. Nandi
{"title":"Systematic Study of Binocular Depth Finding Using Two Web Cameras","authors":"Saumitra Krishna, Sachin Kansal, A. Makhal, P. Chakraborty, G. Nandi","doi":"10.1109/ICCCT.2012.25","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.25","url":null,"abstract":"A stereovision sensor system for depth measurement has been developed in our department. Stereo cameras attached to a robot can perform several tasks effectively, such as calculating distance of an object or that of a person by using depth map, which can further lead to achieve a bigger goal of grasping or manipulation of objects. We have calibrated the cameras and applied rectification algorithm to the images to develop the stereo pair. While taking the data we have observed that due to divergence of cameras, the calculated distances were larger than the actual distances. We concluded that a further improved system can be developed which can take care of this systematic error and achieve more accurate results.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124069782","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":"An Ontology-Based Topical Crawling Algorithm for Accessing Deep Web Content","authors":"K. Arya, B. R. Vadlamudi","doi":"10.1109/ICCCT.2012.10","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.10","url":null,"abstract":"Due to the large volume of the Web information and relatively high speed of information update, the coverage and quality of the retrieved pages by modern search engines is comparatively small. Given the volume of the Web and its frequency of content change, the coverage and quality of pages retrieved by modern search engines is relatively small since they crawl only hypertext links ignoring the search forms which are the entry points for accessing deep web content where two-thirds of information is resides. In this paper an algorithm has been designed to enable topical crawlers to access hidden web content by using domain based ontology to determine the forms' relevance to the domain. In this work scientific research publications domain has been considered. Experimental results show that proposed approach is better as compared to keyword based crawlers in terms of both relevancy and completeness.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130025768","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":"An Approach to Adaptive Locality Based Maintenance of Correlated Data","authors":"A. Biswas","doi":"10.1109/ICCCT.2012.17","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.17","url":null,"abstract":"Operations performed in a Binary Search Tree generally starts from root node. As result search space (total number of nodes) constitutes entire tree, where a normal users intention is only certain part of the tree. In this paper we propose a noble method for performing operations such as insertion, deletion and retrieval within the local search space of a lookup node rather than the root node. To define local search space of a node, we implement leaf nodes null pointers, which are generally remains unused. These local search spaces divides the actual search space which generally constitutes entire tree. Hence complexity reduced to O(log m) from O(log n) for a local node, where m is the number of nodes present in sub tree formed by local search space and n is the number of nodes present in the tree.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115857691","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":"SVD Based Poor Contrast Improvement of Blurred Multispectral Remote Sensing Satellite Images","authors":"A. Bhandari, A. Kumar, G. K. Singh","doi":"10.1109/ICCCT.2012.81","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.81","url":null,"abstract":"In this letter, analyze the satellite images by using discrete cosine transform and singular value decomposition. The proposed technique presents an advance multiband satellite colour, contrast improvement technique of a poor-contrast satellite images. The input image is decomposed into the two frequency sub bands by using DCT and estimates the singular value matrix of the lowâ\"low sub band image and then it reconstructs the enhanced image by applying inverse DCT. This technique is useful for the betterment of the INSAT as well as LANDSAT satellite image for the feature extraction purpose. The singular value matrix represents the intensity information of the given image and any change on the singular values change the intensity of the input image. The proposed technique converts the image into the DCT-SVD domain and after normalizing the singular value matrix, the enhanced image is reconstructed by using IDCT. The visual and quantitative results suggest that the proposed DCT-SVD method clearly shows the increased efficiency and flexibility of the proposed method over the exiting methods such as the Decor relation Stretching, Linear Contrast Stretch, GHE and DWT-SVD based techniques. The experimental results show the superiority of the proposed method over conventional methods.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121395392","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":"Ber Analysis for Various Modulation Techniques under Diffferent Fading Environment","authors":"M. Jain, Y. Rajvanshi, S. Sharma, R. P. Agarwal","doi":"10.1109/ICCCT.2012.61","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.61","url":null,"abstract":"Ever increasing demand for wireless communication and its complex nature, requires study of information at transmitting end in greater depth. This requires understanding of different ways for improving the reliability of information over the wireless channel [1]. The ways should be efficient and productive enough that it should provide minimum error transmission and it should also consider various fading models. Bit error rates are graphically displayed for different modulation schemes in different fading conditions for various values of signal to noise ratio. The results displayed in this paper give adequate idea about the best modulation scheme possible for minimum error transmission in different fading model [2].","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116763873","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":"Controlling Free Riding Using Extended Point Based Incentive Mechanism in Peer-to-Peer Networks","authors":"S. Srivastava, V. Gupta, R. Yadav, K. Kant","doi":"10.1109/ICCCT.2012.48","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.48","url":null,"abstract":"Over the years of the emergence of peer-to-peer systems a phenomenon named 'Free Riding' has affected its performance and become a serious threat to be resolved. Free riding phenomenon was first felt in the study of Gnutella. As the number of free riders increases, the performance of the overall system decreases as free riders use resources without giving anything to the system. To solve the problem of free riding we have developed an Extended Point Based Incentive Mechanism (EPBIM) through which the users are given some incentives to share some files into the system. Our scheme attracts the users to share more and more as it gives more points to the users which provide responses for some queries of other users in the system. This scheme is different from other incentive based schemes in the way that it uses some new parameters for incentives like the time user spends in the network, upload speed of the user, how many simultaneous uploads a user is providing, how many query responses a user is giving and query forwarding of other users in the network. Our simulation results show that this scheme reduces the percentage of free riders to a great extent therefore increasing the performance of a peer-to-peer network.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122613986","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 Secured Five Pixel Pair Differencing Algorithm for Compressed Image Steganography","authors":"K. Avinash, M. Joshi","doi":"10.1109/ICCCT.2012.63","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.63","url":null,"abstract":"Steganography can be defined as a method of hiding data within a cover media so that other individuals fail to realize their existence. Steganographic systems play a vital role in covertly transmission of information even in the presence of an arbiter The message can be hidden in images, audio files or in text. Although the embedded message changes the characteristics and nature of the document in which it is hidden, it is required that these changes are difficult to be identified. The difference in the pixel values can be used for hiding the information. To enlarge the capacity of the hidden secret information and to provide an imperceptible stego-image for human vision, a novel steganographic approach using five pixel pair differencing (FPPD) is proposed in this paper. Experimental results shows that the proposed algorithm provides increased capacity of message hiding along with better quality of stego images.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134405873","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 Better Matching Accuracy for Verification & Identification Using Biometric Features","authors":"N. Pal, S. Pal, A. Yadav, P. Rana","doi":"10.1109/ICCCT.2012.49","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.49","url":null,"abstract":"Fingerprints are the most widely used biometric feature for person identification & verification in the field of biometric identification. Fingerprint possesâ two main types of features that are used for automatic fingerprint identification & verification (i) Ridge & furrow structure that forms a special pattern in the central region of finger print & (ii) Minutiae details associated with the local ridge & furrow structure. This paper Presents an approach to speed up the matching process by classifying the fingerprint pattern into different groups at the time of enrollment & improves finger print matching while matching the input template with stored template. And apart from that we have introduced spectral minutiae features and involved the singular point algorithms and as well as into feature reduction algorithms. With reduced features we can also achieve a fast minutiae based matching algorithm. The algorithm result indicates that this approach manages to speed up the matching effectively and therefore prove to be suitable for large database like forensic divisions.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"298 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124266911","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":"Aspectization of Contracts in DbC","authors":"Manish Jain","doi":"10.1109/ICCCT.2012.32","DOIUrl":"https://doi.org/10.1109/ICCCT.2012.32","url":null,"abstract":"Contracts in Design by Contract (DbC) programming methodology are commonly considered as an example of crosscutting concerns that can be implemented using aspects in Aspect Oriented Programming (AOP). In this dissertation project, we try to examine this fact by writing several programs in DbC and then aspectizing the contracts therein. We verify whether the benefits offered by the DbC programming methodology are retained in the aspectized version of the programs. The DbC programs are written using Eiffel Studio and AOP equivalents are written using AspectJ. AspectJ is the most widely used standard for AOP.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126138315","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}