{"title":"An Approach for Personalized Web Information Retrieval using Modified PageRank Method","authors":"Aarti Singh, Anu Sharma","doi":"10.1145/2979779.2979881","DOIUrl":"https://doi.org/10.1145/2979779.2979881","url":null,"abstract":"Search engines - a tool to retrieve the desired information from web are based on the link structure of the web to arrange the Web Search Results (WSR) for a given query. Study of available literature highlighted that only a few studies consider the user's rating of a web page in ranking WSR. Also, most of the user queries are short and ambiguous and results obtained do not satisfy their information needs. So, it is desirable to personalize the WSR. The present study proposes a novel method for rating web pages by implicit methods and a modification to existing inverted index is presented. A modified PageRank algorithm using proposed Inverted Recommendation Index is also discussed. A novel strategy for personalized re-ranking the search results based on Long Term Interest (LTI) and Short Term Interest (STI) is also presented.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121195360","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":"Transactional memory analysis using CSB+ trees","authors":"Rishab Bansal, P. Ramachandran","doi":"10.1145/2979779.2979780","DOIUrl":"https://doi.org/10.1145/2979779.2979780","url":null,"abstract":"Enterprise applications using in-memory databases prefer to run on scale up systems where the amount of memory and CPUs available are increasing with each generation. In addition to the cores/socket, the number of hardware threads per core has also increased. Increasing cores/socket and HW threads per core provides opportunities for more parallelism from application's perspective. But the applications fail to achieve the expected linear scaling due to various reasons. One of the key reason being the application having to serialize access to certain resources. Hardware transactional memory provides a way for the application to execute concurrently without serializing them using locks. We let the CPUs execute enter transactional mode concurrently and let them execute until a transaction failure is detected which primarily is due to cache line collision. Else, we let all of them succeed. Hardware transactional memory is available in Haswell processors from Intel and also in Power8 processors from IBM. The most important data structure where enabling parallel access becomes critical is a tree update or modify. Without this we will have to serialize the threads using a global lock which prevents the application from using all the available CPUs. In this paper, we will use an sample program of cache sensitive B+ tree (CSB+ tree) which is used in file-system meta-data indexing and in key-value database systems where the data access performance is very critical and compare the performance advantages of using a transactional memory and its scalability. Also, we will provide ways to improve or tune the performance.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126843882","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":"Protein Sequence Structure Prediction Using Artificial Intelligent Techniques","authors":"V. P. Upadhyay, S. Panwar, Ramchander Merugu","doi":"10.1145/2979779.2979887","DOIUrl":"https://doi.org/10.1145/2979779.2979887","url":null,"abstract":"Predicting structure of the protein is one of the most significant application of modern computational biology. Researchers are working on this field for so many years and have been tried various approaches for getting a good accuracy for the prediction task. With advent of artificial intelligence techniques researchers have started to focus on using machine learning algorithms for the task of protein structure prediction. Also AI techniques provides much better accuracy as compare to traditional methods used previously for protein structure prediction. Here we have been surveyed research work done by the researchers for predicting protein structure using AI techniques. We have been studied top most highly cited articles published in this field and derived a complete summery report regarding the application of AI techniques in protein structure prediction.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130735071","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":"Design of New Multi Keyword Ranked Search Scheme and Validation for Cloud Computing","authors":"P. Tanwar, A. Khunteta, V. Goar","doi":"10.1145/2979779.2979885","DOIUrl":"https://doi.org/10.1145/2979779.2979885","url":null,"abstract":"Cloud computing has been emerged as a revolution in the world of information technology. It provides a flexible and economic strategy for the sharing of resources management of data. Preservation of privacy and data security are the major concerns in the current scenario. To achieve the purpose of security and privacy number of schemes are analyzed and proposed to support keyword basis searching. In this paper we are going to design a Multi Keyword Ranked Search Scheme upon Cloud Data (MKRSCD), basically emphasizing on index and query. We can make expansion in the scheme with the help of already available secure inner product scheme and k nearest neighbor (kNN) technique. The secure inner product technique is not fit for our scheme MKRSCD, it is observed. The reason behind it is that the single randomness included is the scale factor for the generation of trapdoor, which does not provide optimum non-determinacy required by the unlinking of trapdoor as well as privacy of keyword requirement. Finally we are providing more advanced scheme MKRSCD-CM (Multi Keyword Ranked Search Scheme for Cloud Data in Known Ciphertext Model). To obtain the result, complete analysis of security and performance evaluation on experiments performed on the real world dataset which demonstrate that the scheme indeed accords with our proposed design goals.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131191789","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":"SearchAutomaton: Searching mechanism for multi-format data by combining indexing tools and techniques","authors":"Hiren D. Pandya, Girish Mulchandani, T. Patalia","doi":"10.1145/2979779.2979846","DOIUrl":"https://doi.org/10.1145/2979779.2979846","url":null,"abstract":"In present days, I.T. Industry is rapidly growing there for its operational data increase significantly. Any large organization review its data effectively for performance evaluation and day to day monitoring. To provide such functionality Search Engine is required. Sometimes requirement of multi-format data retrieval is also important with compare to text retrieval. Oracle, Lucene and Terrier all having its own indexing mechanism to deal with such kind of retrieval. All these have its own limitations too. By combining oracle and Lucene or terrier indexing mechanism formulation of multi-format searching mechanism can be built and these is the main gist of these research. In SearchAutomaton master index is built by combining Oracle 11g index data and Terrier index data. With the help of Top-k algorithm and modified ranking model different indexing structures were analyzed as a master index entries. Effective retrieval is being possible through trained ranking model which give priority ranking for database item and file system item.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134130631","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 Proposed framework for improved identification of implicit aspects in tourism domain using supervised learning technique","authors":"Vishal Bhatnagar, Mahima Goyal, Md Anayat Hussain","doi":"10.1145/2979779.2979835","DOIUrl":"https://doi.org/10.1145/2979779.2979835","url":null,"abstract":"The sudden boom of e-commerce web sites, has paved a way for users to write different reviews about an entity on these sites. This large amount of data must be extracted for analyzing the opinion to perform better by taking optimized decisions in different streams. In this paper, we have proposed an explicit and implicit aspect opinion mining framework and algorithm for the tourism domain. It first determines the explicit aspects using the frequent nouns. It, then extracts the implicit aspects using implicit aspect recognizer which is deployed using a supervised machine learning technique i.e. CRF. The trained CRF file will be used for recognizing the implicit aspects indicator in the tourism domain. The proposed algorithm has been validated empirically by showing the extracted implicit and explicit aspects.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133217205","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":"Reversible Data Hiding Scheme for LZW Codes using LSB Flipping Strategy","authors":"Aruna Malik, Rajeev Kumar, Samayveer Singh","doi":"10.1145/2979779.2979837","DOIUrl":"https://doi.org/10.1145/2979779.2979837","url":null,"abstract":"This paper introduces a high capacity reversible data hiding scheme which embeds the secret data into LZW codes. It firstly compresses the cover media using LZW compression algorithm and then the output codes are used to embed the secret data. It constructs a location map of the LZW codes before embedding the secret data so that reversibility of the scheme is ensured. The secret data is embedded into the LZW codes by either flipping their first LSB or leaving them unchanged. Thus, the maximum change made to a code is ±1 which helps in achieving better compression ratio. This scheme is very simple and has high hiding capacity. Experimentally, our scheme embeds more secret data and achieves better compression ratio than the existing state of the art schemes.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130929063","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":"Text Steganography Based on Feature Coding Method","authors":"Sunita Chaudhary, Meenu Dave, Amit Sanghi","doi":"10.1145/2979779.2979786","DOIUrl":"https://doi.org/10.1145/2979779.2979786","url":null,"abstract":"Stegnography is a sheltered communication in which information such as text, image, audio and video is kept under shelter of another message. The message providing the shelter can also be text, image, video etc. No one except the dispatcher and projected addressee can have any idea if any sort of hidden writing exists. In this paper, we present and evaluate an approach for text steganography which is hiding text underneath text. The approach is based on feature encoding and random character generation method. Our focus is primarily on the shape of the capital alphabets of the English language and hence the algorithm has been termed as capital alphabet shape encoding method.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114971385","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":"Analysis and Measurement of Medical Image Defects through the Reliability Computing of Image data","authors":"R. Parveen, S. Tazi","doi":"10.1145/2979779.2979814","DOIUrl":"https://doi.org/10.1145/2979779.2979814","url":null,"abstract":"Defect is an important issue in medical image the computational technique adapt everywhere in the real world. Most of their adoption is based on analysis and comparative study of novel adventures. The missing data in an image is computed through error detection mechanism a defect is creating a major problem in the medical science. The decision to classify the actual problem into a human are defected through the existence of minor defect in to their X-RAY, MRI and CT scan report. Due to this defect a patient didn't advised to take a genuine medicine to improve their disease. The experimental data obtain as a result of survey clarify the importance of image defect to their removal process. Therefore, we are focusing the impact of image defect into real world.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114987184","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":"Encoding of Color Images in DWT domain using FrFT","authors":"Kshitij Agrawal, Shalini Batra","doi":"10.1145/2979779.2979834","DOIUrl":"https://doi.org/10.1145/2979779.2979834","url":null,"abstract":"This paper presents a new color image encoding and decoding technique using Fractional Fourier Transform (FrFT) and Discrete Wavelet Transform (DWT). In proposed work, all three planes of color images are encoded using subbands of DWT and parameters of FrFT. Selection of subband (among the subbands obtained after applying DWT) for applying FrFT and parameters of FrFT are used as security key for the purpose of encoding and decoding of all three color channels. For ensuring the correct decoding of color images, the knowledge of correct selection of subband of DWT for applying FrFT and exact values of FrFT parameters is required. Correct decoding is not possible without the correct knowledge of DWT subband and FrFT parameters values. The proposed technique is also compared with one of the recent existing techniques and experimental results are used to show the effectiveness of the proposed technique.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"52 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120941768","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}