{"title":"Page Ranking Algorithms in Web Mining, Limitations of Existing Methods and a New Method for Indexing Web Pages","authors":"A. Jain, R. Sharma, G. Dixit, V. Tomar","doi":"10.1109/CSNT.2013.137","DOIUrl":"https://doi.org/10.1109/CSNT.2013.137","url":null,"abstract":"As the web is growing very rapidly, the users get easily lost in the rich hyper structure. The primary goal of search engines is to provide relevant information to the users to cater to their needs. Therefore, finding the content of the Web and retrieving the users' interests and needs have become increasingly important. The different algorithms used for link analysis like Page Rank (PR), Weighted Page Rank (WPR), Hyperlink-Induced Topic Search (HITS) and CLEVER algorithms are discussed and compared in this paper. The aim of this research is to discover an efficient and better system for mining the web topology to identify authoritative web pages.","PeriodicalId":111865,"journal":{"name":"2013 International Conference on Communication Systems and Network Technologies","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128597952","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":"Retscreen -- Small Hydro Project Software","authors":"F. Masoudinia","doi":"10.1109/CSNT.2013.184","DOIUrl":"https://doi.org/10.1109/CSNT.2013.184","url":null,"abstract":"The RET Screen Clean Energy Project Analysis Software make decision for clean energy and enable users to calculate the financial viability of renewable energy and energy efficiency projects. In a small hydropower scheme, Studying about various items that be used is important for estimating the energy generation, nearly cost of the project, and the required budget. RET Screen capable of evaluating the energy generation, maintenance costs for small hydro projects. for evaluate application of this program in every countries, energy and cost equations related with energy generation and cost estimation of various items, such as costs of turbines, generators, installation of energy maintenance, etc., will study by details.","PeriodicalId":111865,"journal":{"name":"2013 International Conference on Communication Systems and Network Technologies","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127918000","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":"Non-destructive Quality Evaluation Technique for Processed Phyllanthus Emblica(Gooseberry) Using Image Processing","authors":"R. Patel, K. Jain, T. Patel","doi":"10.1109/CSNT.2013.24","DOIUrl":"https://doi.org/10.1109/CSNT.2013.24","url":null,"abstract":"This paper proposes non-destructive quality evaluation method to categorize a processed phyllanthus emblica (gooseberry) using image processing by color and texture features. Russia is one of the most important gooseberry producers in North Asia, than Germany, Poland, U.K, India etc, but fruit sorting in some area is still done by hand which is tedious and inaccurate. Thus, the need exists for improvement of efficiency and accuracy of this fruit quality assessment that can meet the demands of international markets. Low-cost and non-destructive technologies capable of sorting processed gooseberry according to their properties would help to promote the gooseberry export industries. This paper propose the method of colorization and extracting value parameters, by this parameters the detection of browning or affected part and identification of the uniform shape and size. This differentiate the quality of processed gooseberries.","PeriodicalId":111865,"journal":{"name":"2013 International Conference on Communication Systems and Network Technologies","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121117365","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":"Study of Semantic Web Usage Mining","authors":"Yujiang Liu","doi":"10.1109/CSNT.2013.144","DOIUrl":"https://doi.org/10.1109/CSNT.2013.144","url":null,"abstract":"The related theories of Web and Web mining in semantic are concluded and analyzed in this paper. The description on RDF resource is analyzed on the semantic step, and the clustering method for RDFMS data clustering based on Semantic distance is proposed, with the detailed description for the algorithm and examples. With the discussion on the data mining techniques for semantic Web mining, the design on inductive logic programming is proposed for the data mining techniques that are suitable to the semantic Web. Additionally, how to apply to the description of the algorithm is given through the specific examples to verify the feasibility for the data mining in the semantic Web environment.","PeriodicalId":111865,"journal":{"name":"2013 International Conference on Communication Systems and Network Technologies","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116449655","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}
K. Wankhade, G. H. Raisoni, Sadia Patka, M. T. Student, Ravinrda Thool
{"title":"An Overview of Intrusion Detection Based on Data Mining Techniques","authors":"K. Wankhade, G. H. Raisoni, Sadia Patka, M. T. Student, Ravinrda Thool","doi":"10.1109/CSNT.2013.134","DOIUrl":"https://doi.org/10.1109/CSNT.2013.134","url":null,"abstract":"Intrusion Detection System (IDS) is a vital component of any network in today's world of Internet. IDS are an effective way to detect different kinds of attacks in interconnected network. An effective Intrusion Detection System requires high accuracy and detection rate as well as low false alarm rate. Different Data Mining techniques such as clustering and classification are proving to be useful for analyzing and dealing with large amount of network traffic. This paper presents various data mining techniques applied on intrusion detection systems for the effective identification of both known and unknown patterns of attacks, to develop secure information systems.","PeriodicalId":111865,"journal":{"name":"2013 International Conference on Communication Systems and Network Technologies","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126479170","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 Review on Smiley Face Recognition","authors":"M. Dixit, P. Rai, S. Silakari","doi":"10.1109/CSNT.2013.38","DOIUrl":"https://doi.org/10.1109/CSNT.2013.38","url":null,"abstract":"Face recognition has played a significant role in vision technology. Above it the Smiley Face recognition is of further importance in vision technology and facial expression recognition in recent advances in this field. There is difficulty in Smiley face recognition while handling the variations in the smiley expression and illumination when only a limited number of training samples are available. In this paper we proposed a hybrid approach 3DEPIS for smiley face Recognition, where estimating the FAR & FRR at different Threshold Level Value on 50 image training set and applying on 5 different images. This reflects combination of known and unknown testing images.","PeriodicalId":111865,"journal":{"name":"2013 International Conference on Communication Systems and Network Technologies","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125862047","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":"Gaussian Q-function and Its Approximations","authors":"Sirisha Malluri, Vinay Kumar, Pamula","doi":"10.1109/CSNT.2013.25","DOIUrl":"https://doi.org/10.1109/CSNT.2013.25","url":null,"abstract":"This paper presents some useful approximations to the Gaussian Q-function with an application to computation of bit error probability (BEP) of M-ary phase shift keying (MPSK) modulation scheme. Computational results are provided to compare various approximations to Gaussian Q-function.","PeriodicalId":111865,"journal":{"name":"2013 International Conference on Communication Systems and Network Technologies","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125223130","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}
B. Mandal, D. Bhattacharyya, Samir Kumar Bandyopadhyay
{"title":"Designing and Performance Analysis of a Proposed Symmetric Cryptography Algorithm","authors":"B. Mandal, D. Bhattacharyya, Samir Kumar Bandyopadhyay","doi":"10.1109/CSNT.2013.101","DOIUrl":"https://doi.org/10.1109/CSNT.2013.101","url":null,"abstract":"We design an algorithm to merge both RSA algorithm and Diffie-Hellman Algorithm of them to provide a user with even higher level of data security. Actually, our intent is to secure data of smaller as well as larger size by obtaining one randomly chosen key pair from set of RSA keys and one randomly chosen secret key using Diffie-Hellman algorithm and then applying RSA encryption to make even public components of Diffie-Hellman algorithm inaccessible for any eavesdropper freely. Encrypted exchange of public components of Diffie-Hellman part of the system makes it hidden from all other than intended users to see Diffie-Hellman generator and prime modulus. This will make our algorithm M*N times complex to break using even the latest version of Brute Force attack, where M and N are corresponding complexities imposed by the Diffie-Hellman and RSA algorithms respectively. Encryption algorithms play a main role in information security systems. On the other side, those algorithms consume a significant amount of computing resources such as CPU time, memory, and battery power. This paper provides evaluation of five of the most common encryption algorithms namely: AES (Rijndael), DES, 3DES, RC2, Blowfish. A comparison has been conducted with our proposed algorithm.","PeriodicalId":111865,"journal":{"name":"2013 International Conference on Communication Systems and Network Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130614301","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":"ACO Based Routing Algorithms for Ad-hoc Network (WSN, MANETs): A Survey","authors":"S. Shirkande, R. A. Vatti","doi":"10.1109/CSNT.2013.56","DOIUrl":"https://doi.org/10.1109/CSNT.2013.56","url":null,"abstract":"In Ad-Hoc network there are many problems, which can be categorized as an optimization problem such as energy consumption, routing, localization, node deployment. Many researchers have done research to solve these problems and recently new class of routing algorithms came up which is based on Swarm Intelligence. Ant Colony algorithm is inspired from self-organizing behavior of ants which fall under Swarm Intelligence. In this paper, a survey is done on various ant colony based routing algorithms for Wireless Sensor network (WSN) and Mobile Ad-Hoc Network (MANETs). A comparison of various algorithms is made based on performance metrics, pheromone function to select next node, simulator used, energy awareness, etc.","PeriodicalId":111865,"journal":{"name":"2013 International Conference on Communication Systems and Network Technologies","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132082259","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":"Email Access by Visually Impaired","authors":"G. Anand, S. Geethamsi, R. Chary, C. M. Babu","doi":"10.1109/CSNT.2013.128","DOIUrl":"https://doi.org/10.1109/CSNT.2013.128","url":null,"abstract":"Web accessibility refers to the inclusive practice of making web based applications usable by people of all abilities and disabilities. When web applications are correctly designed, developed and edited, all users can have equal access to information and functionality, also they can be accommodated without decreasing the usability of the application for non disabled users. The most common and essential need for using the internet is accessing emails. Little systematic applied research has been conducted on how a vision impaired user can have an access to his emails and this paper aims to fill some of that gap.","PeriodicalId":111865,"journal":{"name":"2013 International Conference on Communication Systems and Network Technologies","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134546420","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}