{"title":"An efficient approach for web navigation using ant colony optimization","authors":"Hitesh Hasija","doi":"10.1109/ICRAIE.2014.6909295","DOIUrl":"https://doi.org/10.1109/ICRAIE.2014.6909295","url":null,"abstract":"Implementing an optimization technique to provide user navigation is a difficult task because users are dynamic in nature. But, this paper satisfies this demand by providing ranking to different parameters like usability aspects (web usage mining) and also to the keywords & description of web pages (web content mining) as well as to the in links and out links (web structure mining) and provides relative information matrix for different web pages. This model is converted to graph form and ant colony optimization is applied over it, by defining a suitable heuristic function and optimum results are obtained within a specified time constraint.","PeriodicalId":355706,"journal":{"name":"International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127452306","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":"Novel companding technique for PAPR reduction in OFDM system","authors":"Eashendra Singh, M. Arif","doi":"10.1109/ICRAIE.2014.6909240","DOIUrl":"https://doi.org/10.1109/ICRAIE.2014.6909240","url":null,"abstract":"High value of PAPR and Inter-carrier Interference are two main drawbacks of the orthogonal frequency division multiplexing (OFDM) based wireless systems. The problem of high value of PAPR has been addressed in this work. A novel companding technique is proposed to reduce the PAPR of OFDM signals. The general analytical model for this novel scheme has been obtained and the results obtained after simulation proves that the proposed method has significantly improved the performance in the terms of BER and PAPR reduction as compared to μ-law and exponential companding. To fulfill various design requirements, the selected companding techniques parameters can also be changed to achieve a better tradeoff between BER and PAPR reduction.","PeriodicalId":355706,"journal":{"name":"International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124700974","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. Dileep, A. Raghavendra, M. Suman, G. Devesh, S. Srikanth
{"title":"Rules based automatic Linux Device Driver Verifier And Code Assistance","authors":"K. Dileep, A. Raghavendra, M. Suman, G. Devesh, S. Srikanth","doi":"10.1109/ICRAIE.2014.6909321","DOIUrl":"https://doi.org/10.1109/ICRAIE.2014.6909321","url":null,"abstract":"Development of Linux Device Drivers involves lot of complex data structures and functions. The developer should carefully apply these to the drivers otherwise code will misbehave in the Linux Kernel and degrades the performance of the system. Majorly Linux device driver code requires stability so as to provide correctness and reliability. To achieve this, the need of the hour is a proper and efficient verification tools. Linux driver code verification is a vast application area consisting of different verification methods on proper functional placement, safety and security usages. In this paper we are proposing a tool embedded into Eclipse IDE as a plug-in and this tool works on the principle of “Rules based Linux Device Driver Automatic Verifier and Code Assistance” for the bugs fixation. Majorly the rules are based on Kernel API violations, proper allocations & deallocations, synchronization mechanisms & usage, proper return type usage and interrupt context issues.","PeriodicalId":355706,"journal":{"name":"International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124884278","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":"Unsupervised feature selection for linked data","authors":"Rachana T. Nemade, R. Makhijani","doi":"10.1109/ICRAIE.2014.6909131","DOIUrl":"https://doi.org/10.1109/ICRAIE.2014.6909131","url":null,"abstract":"The widespread use of social media web sites gives high dimensional linked data. For limiting the amount and dimensionality of the data, feature subset selection is an effective way which selects features that correlate well with the target class. The high dimensional linked data from social media web sites lacks the availability of label information. So feature selection for linked data remains a challenging task. By using the link information feature relevance assessment is done. In this paper, we propose the unsupervised feature selection from linked data, UFSLD algorithm. The UFSLD algorithm works in three steps. In the first step, the interdependency among the linked data is exploited and the relevant features are selected. In the second step, the features from first step are classified to form the clusters by using graph-theoretic clustering method. In the third step, the most representative feature from each cluster is selected to form a subset of features. MST clustering method is used to ensure the efficiency of this algorithm. Experiments are conducted to compare UFSLD with one unsupervised and another supervised feature selection algorithm and the effectiveness of this algorithm is evaluated.","PeriodicalId":355706,"journal":{"name":"International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125091825","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":"Optimal payment policy for deteriorating item with preservation technology investment under trade credit and inflation","authors":"S. Singh, H. Rathore","doi":"10.1109/ICRAIE.2014.6909287","DOIUrl":"https://doi.org/10.1109/ICRAIE.2014.6909287","url":null,"abstract":"Deterioration rate is assumed to be an uncontrolled variable whereas through investment in preservation techniques it can be controlled up to certain level. In this paper we have studied effect of preservation technique for deteriorating items. So we have considered controllable deterioration rate with time dependent demand and trade credit in an inflationary environment. Objective of this study is to optimize the Total relevant cost, Payment time, ordered quantity, Preservation cost. At the end of this paper numerical illustration of this model and sensitivity analysis is performed by changing values of some important parameters using Mathematical software Mathematica7.","PeriodicalId":355706,"journal":{"name":"International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125847201","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":"Intensified regularized discriminant analysis technique","authors":"Karthika Veeramani, S. Jaganathan","doi":"10.1109/ICRAIE.2014.6909114","DOIUrl":"https://doi.org/10.1109/ICRAIE.2014.6909114","url":null,"abstract":"Discriminant Analysis is utilised in working out which specific classification, a data pertains to on the basis of its needed features. Linear Discriminant Analysis(LDA) achieves the maximum class separability by projecting high-dimensional data onto a lower dimensional space. However, LDA suffers from small sample size(SSS) problem where the dimensionality of feature vector is very large compared to the number of available training samples. Regularized Discriminant Analysis(RDA) handles SSS problem of LDA with an introduction of regularization parameter(λ) and has the ability to reduce the variance. One important issue of RDA is how to automatically estimate an appropriate regularization parameter. In this paper, we propose a new algorithm to enhance the performance of RDA by effectively estimating an appropriate regularization parameter in order to reduce training time and error rate. Experiments are done using various benchmark datasets to verify the effectiveness of our proposed method with the state-of-the-art-algorithm.","PeriodicalId":355706,"journal":{"name":"International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014)","volume":"55 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116424052","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":"Minimizing congestion and improved QoS of AODV using clustering in mobile ad hoc network","authors":"Neelam Phate, Madhvi Saxena, M. Rizvi","doi":"10.1109/ICRAIE.2014.6909217","DOIUrl":"https://doi.org/10.1109/ICRAIE.2014.6909217","url":null,"abstract":"With the increase in traffic in the network congestion increases, congestion unawareness in mobile ad hoc networks (MANETs) may lead to long delay, high overhead and packet loss which decreases the performance of ad hoc network. Many routing protocols are not congestion aware and this becomes the main design requirement of the routing protocol, which will tackle the problem of congestion and energy usage. This paper proposes an enhancement to the AODV routing protocol that consists of a cluster-based mechanism for supporting congestion control in MANET which provides a QoS aware path. The main feature of this approach is clustering and the selection of the cluster - head is on the basis of the congestion status of the nodes. This protocol is highly efficient in dealing congestion by achieving QoS constraints (good packet delivery ratio, low delay and reduces packet drop) with energy efficiency.","PeriodicalId":355706,"journal":{"name":"International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122633309","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":"Ultrasonic sensor animal safety system","authors":"V. Sundararaman, T. Vijayalakshmi, S. Venkatadri","doi":"10.1109/ICRAIE.2014.6909216","DOIUrl":"https://doi.org/10.1109/ICRAIE.2014.6909216","url":null,"abstract":"This paper intends to build an efficient module that can protect the animals especially dogs from the road accidents. Hundreds of people are injured when their vehicle come in contact with the livestock, domestic stray animals and these stray animals are responsible for the large-portion of rear-end collisions and it is very difficult to file a claim against these animals. The main aim of this prototype is to design an ultrasonic sound generator that could be used to warn the stray animals entering the road. Since the Dogs and animals of similar size can hear the ultrasonic sounds that humans cannot, we construct an ultrasonic generator that can generate and emit the sound in ultrasonic range. The ultrasonic sound generator is further energized with solar power. The ultrasonic generator transmits the sound in all the directions and when the dog hears this high-pitched sound it gets an alert and leaves the place, through this the accidents that are caused by the dogs can be minimized. This module can be used in the forest routes in the dawn time to protect the wild animals that crosses the roads from the accidents.","PeriodicalId":355706,"journal":{"name":"International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117074357","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":"PAPR reduction of OFDM systems using PTS with genetic algorithm at low computational complexity","authors":"J. Shukla, A. Joshi, R. Bansal, R. Tyagi","doi":"10.1109/ICRAIE.2014.6909187","DOIUrl":"https://doi.org/10.1109/ICRAIE.2014.6909187","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) is one of the preferred choices for high speed transmission of data in wireless domain pertaining to its immunity towards inter-symbol interference. However high value of peak to average power ratio (PAPR) is a major problem associated with OFDM. High PAPR increases circuit complexity and reduce RF amplifier efficiency. Partial Transmit Sequence (PTS) is one of the widely used techniques for PAPR reduction, however in PTS scheme the computation of optimal phase factors necessitates exhaustive searching among all allowable phase factors. This leads to exponential increase in search and computational complexity with the increase in number of subblocks. In this paper a PTS scheme using Genetic algorithm (GA) for optimized search with low computational complexity scheme is proposed. The proposed scheme provides efficient search and PAPR performance at low computational complexity for a given value of PAPR threshold.","PeriodicalId":355706,"journal":{"name":"International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129818469","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 genetic algorithm for task allocation in collaborative software developmentusing formal concept analysis","authors":"S. Chakraverty, Ashish Sachdeva, Arjun Singh","doi":"10.1109/ICRAIE.2014.6909305","DOIUrl":"https://doi.org/10.1109/ICRAIE.2014.6909305","url":null,"abstract":"Software development is no longer an isolated or localized task but a collaborative process with well coordinated contributions from personnel across the globe. Such an approach boosts productivity, but also poses challenges that must be met. One of them is to formally analyze the realms of software development tasks and the teams that are commissioned to perform them to derive the full set of conceptual units that describe these domains in terms of the needed proficiencies. Then, the best possible matching between the cohesive task-sets and the inter-coordinating teams must be obtained. In this paper, we present a model for Collaborative Software Development that addresses these issues. We employ Formal Concept Analysis to generate the concept lattices in the domains of tasks and teams in terms of various skills. We employ Genetic Algorithm, a meta-heuristic that stochastically scans the search space in a guided manner to generate the best possible pairings between task concepts and team concepts. Results show that this approach forms cohesive task sets, identifies sets of homogeneous teams and produces optimum task-team mappings that gives high skills utilization and provides a basis for coordinated and reliable operation. The GA yields a range of non-inferior solutions giving wide scope of tradeoff between various objectives.","PeriodicalId":355706,"journal":{"name":"International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126896380","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}