2014 Seventh International Conference on Contemporary Computing (IC3)最新文献

{"title":"Author name disambiguation using vector space model and hybrid similarity measures","authors":"T. Arif, R. Ali, M. Asger","doi":"10.1109/IC3.2014.6897162","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897162","url":null,"abstract":"Differentiating people on the basis of their names has always been a complex issue and our desire for grouping people, in a particular domain, based on their attributes is growing day by day. Despite years of research and a bunch of proposed techniques, the name ambiguity problem remains largely unsolved and the so far proposed techniques have faced one problem or the other. In case of author name disambiguation in digital citations, additional attributes like e-mail ID and affiliation of author and co-authors, which are normally available in publications, can help a lot in disambiguation process. Vector space model has traditionally been used in information retrieval field with great degree of success and we explore its use in case of author name disambiguation here. In this paper we propose an enhanced vector space model for disambiguating authors and their publications. Experimental results show that additional attributes present in publications can help a lot in disambiguation and solve the name ambiguity problem with a great degree of confidence. From the study we conducted and the experimental results obtained we conclude that both mixed citation and split citations problem can be handled very efficiently. We obtained a great deal of improvement in evaluation metrics obtaining F1 score of 0.97.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"1 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125331709","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":"Earned Value Analysis for real time wireless sensor network","authors":"N. Jain, K. Kant","doi":"10.1109/IC3.2014.6897153","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897153","url":null,"abstract":"As Wireless Sensor Network (WSN) is spread across wide geographically area, global end-to-end estimates of control parameters can't predict timely reporting of data. However, as packet progresses over multihop WSN, routing decisions may have to be adapted according to changed environment parameters/conditions. Many algorithms lack dynamic adaptability to changed environment conditions. Real Time WSN need to trade off latency, path traversed in number of hops and energy cost as per dynamically changing conditions. Earned Value Management (EVM) is project management technique to trade-off schedule, cost and quality constraint. As part of this work, it is hereby suggested to adapt routing decision at each hop based on Earned Value Management of latency, energy cost and path traversed in number of hops at that time. At initial step, End-to-end estimated values for latency, energy cost and path traversed in number of hops are allocated for each flow. Estimate to complete (ETC) values for all parameters are calculated at each hop and used to decide how much is estimated remaining value of all parameters to reach at the destination. Based on ETC values, routing decisions can be adapted. At the end of delivery, variance with planned value is calculated. This value can be used to refine end-to-end estimates. The whole process can be divided into following steps: Estimate End-to-end values for latency, energy cost, number of hops, Estimate to complete (ETC) - Calculate Estimated Values for latency, energy cost, number of hops to reach at destination., Adapt or refine the control parameters such as speed or transmission power as per ETC values for latency, energy cost, number of hops. If destination can't be reached by adapting control parameters, packets are dropped., Calculate Variance with respect to planned values and refine end-to-end estimates Using Earned Value technique helps in tracking the actual progress made till current time. It helps in taking corrective action early; hence it is more cost effective. It also helps in effective usage of limited resources of WSN by dropping packets which can't reach destination within desired latency.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116006649","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 and development of a real time scheduling algorithm for mixed task set on multi-core processors","authors":"Mayuri Digalwar, Pravin Gahukar, Sudeept Mohan","doi":"10.1109/IC3.2014.6897184","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897184","url":null,"abstract":"This paper presents a real time scheduling algorithm for mixed task set on homogeneous multi-core platform. Periodic tasks are scheduled using Partitioned Earliest Deadline First (P-EDF) technique. Aperiodic tasks are assigned globally to different processor cores and scheduled using Total Bandwidth Server (TBS) on each core. In the proposed algorithm, the excess processing capacity of the cores left unused by the periodic tasks can be utilized by assigning aperiodic task to each core. This improves the overall utilization of individual core. Work conserving nature of global assignment reduces response time of aperiodic task. The proposed algorithm is implemented using java based simulator and tested on large number of synthetic test data. Results show improvement in utilization of individual processing core and improvement in response time of aperiodic tasks.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134053505","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":"LSMRP: Link stability based multicast routing protocol in MANETs","authors":"Gaurav Singal, V. Laxmi, M. Gaur, Chhagan Lal","doi":"10.1109/IC3.2014.6897182","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897182","url":null,"abstract":"In MANETs, there are many critical issues such as energy consumption, QoS, exposure to attacks, link stability etc. that need to be addressed for improved communication. `Link Stability' is important because radio links are likely to be unreliable due to node mobility. This instability leads to increased rerouting which further escalates routing overhead. One way of reducing routing overhead is use of multicasting instead of unicast routing. Multicast Routing Protocol transmits data simultaneously to a group of destination nodes to achieve better resource utilization. In this paper, we present a multicasting routing protocol that uses received signal strength as a metric to estimate link stability. Estimated SINR (Signal to Interference plus Noise Ratio) at every node in respect of different senders is used to determine a reliable path that is likely to mitigate link failures and reduce end-to-end delay. For any two nodes, we aim at finding best link with high probability of longer lifetime. We have simulated our experiment on Exata/Cyber Simulator and compared the result of the proposed routing protocol with ODMRP (On-Demand Multicast Routing Protocol) based on minimum hop count. Analysis of our simulation results show improvement of various routing performance metrics such as PDR, Routing Overhead and packet drop ratio.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130689180","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":"User feedback scoring and evaluation of a product recommendation system","authors":"S. S. Sohail, Jamshed Siddiqui, R. Ali","doi":"10.1109/IC3.2014.6897228","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897228","url":null,"abstract":"With the legerity of the Internet, daily life of a common man has changed. Rapid growth of the Internet has a diverse effect on the daily life. The influence of the Internet has changed the way we live and even the way we think. The use of Internet for purchasing different products of the daily needs has increased exponentially in recent years. Now customers prefer online shopping for the acquisition of the various products. But the huge e-business portals and increasing online shopping sites make it difficult for the customers to go for a particular product. It is very common practice that a customer wishes to know the perception of other consumers who already have acquired the same product. Therefore we tried to involve the human judgment in recommending the products to the users using implicit user feedback. In this paper we chose few products and their respective ranks arbitrarily taken from previous work. For obtaining user's purchase activities a vector feedback is taken from the user and on the basis of their feedback products are scored, hence they are again ranked which is supposed to be the user's ranking. Finally we evaluate the system performance using false negative and false positive rates, which show the effectiveness of the proposed method.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"55 48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124765908","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":"Correlation based Word Sense Disambiguation","authors":"Madhavika Agarwal, Jyoti Bajpai","doi":"10.1109/IC3.2014.6897204","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897204","url":null,"abstract":"Today internet usage has seen tremendous growth. As English is the primary language, documents are mostly available in English language. In India, Hindi is the prevalent language and user wants to access data in Hindi. For the language processing we are required to get the exact sense of polysemous word interpreting the meaning in a particular context. To disambiguate the meaning of the polysemous word, the techniques used is Word Sense Disambiguation (WSD). It is a known problem in natural language processing referred as lexical semantic ambiguity. In this paper, correlation analysis of context in which the target word is used with the collocation vector of definition of target word derived from Hindi WordNet i.e. developed at IIT Bombay and the co-occurrence vector which is derived from Hindi Corpus is computed. The proposed approach uses collocation information, co-occurrence information of target word to assign weights to the different senses of ambiguous word. The evaluation is done on the 60 ambiguous words, precision obtained is 88.92%. The proposed experiment shows better efficiency.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121065999","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 prolific approach towards automating component repository search","authors":"Ramkrishna Chatterjee, Himani Rathi","doi":"10.1109/IC3.2014.6897232","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897232","url":null,"abstract":"Incorporating software reuse in developing new software has been both a pertinent and prominent development practice. To facilitate component reuse effectively component repositories are build that are comprised of prevalent components for its future reusability. This paper focuses on the significance of reuse repository and the associated search techniques viz. keyword-based search and signature matching in a reasoned manner by exemplifying the working methodology of these techniques via its automated implementation. To address the purpose a new tool has been developed name ARE (Automated Repository Exploration) ver. 1.0.0. Readers may note that the tool (ver. 1.0.0) was initially developed with the capability to automate keyword-based search technique, and, has recently been updated with the potential of automated signature matching search technique leading its upgrade to ver. 1.0.1.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116741828","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":"Path tracking of Automated Guided Vehicle","authors":"Neerja Gupta, Abhishek Singhal, J. K. Rai, Rohit Kumar","doi":"10.1109/IC3.2014.6897183","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897183","url":null,"abstract":"In this paper, a systematic method for kinematics and dynamic tricycle modelling of AGV is presented to track the desired trajectory. The localization of AGV is done by a laser sensor NAV200 which is used to detect the AGV position in dour environment in real time. The AGV consists of 2 passive wheels at rear and 1 driving wheel at front. The navigation system for tricycle AGV is based on front wheel, i.e., the movement of AGV is controlled by front wheel. In order to move the AGV, kinematic model used here is a constant velocity model for linear motion and pure pursuit algorithm is used so that AGV follows the desired trajectory. The experimental result shows that AGV successfully tracks the predefined path in real environment.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128107794","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":"NDj - AODV: Node disjoint multipath routing in Mobile Ad Hoc Networks based on AODV protocol","authors":"V. Arya, C. Gandhi","doi":"10.1109/IC3.2014.6897241","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897241","url":null,"abstract":"Mobile Ad Hoc Networks are wireless networks which comprise of mobile nodes that communicate over wireless media. Frequent link failures may occur in these networks due to mobility, energy depletion of node, transmission interference. Link failure leads to disconnectivity among nodes in the network and hinders ongoing data transmission. Traditional routing protocols provide best effort service in transporting data from source to destination. They are not designed to handle link failures that may arise sporadically. This paper proposes a node-disjoint routing technique NDj-AODV that discovers multiple node-disjoint routes to the destination. The proposed technique can be used for load balancing, QoS based routing, and more specifically for performing energy aware routing. We overhaul AODV route discovery and maintenance procedures to find multiple node-disjoint routes to destination. Our protocol does not use the path accumulation feature employed by most node-disjoint routing techniques rather it exploits the concept of overhearing in wireless medium to distinguish between two paths as node-disjoint. Simulation results obtained using ns-2.34 simulator show efficiency of our technique in terms of finding several node disjoint routes with a minimal routing overhead and high percentage of data packet delivery ratios and reduced average end-to-end delays.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134077169","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":"Computing multiplicative order and primitive root in finite cyclic group","authors":"S. Dwivedi","doi":"10.1109/IC3.2014.6897161","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897161","url":null,"abstract":"Multiplicative order of an element a of Group g is the least positive integer n such that an = e, where e is the identity element of G. If the order of an element is equal to |G|, it is called generator or primitive root. This paper describes the algorithms for computing multiplicative order and primitive root in ℤp*, we also present a logarithmic improvement over classical algorithms.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115069036","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}