发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
A novel algorithm for list accessing problem
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897165
S. K. Panda
{"title":"A novel algorithm for list accessing problem","authors":"S. K. Panda","doi":"10.1109/IC3.2014.6897165","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897165","url":null,"abstract":"List accessing problem is seen as a self-organizing linear search problem. The dilemma is to access a sequence of requests from an unordered linear list such that the total cost is minimized. However, the unordered linear list may be reorganized at any time. The rationale behind such reorganization is to decrease the cost of forthcoming requests. But reorganization is not always decreasing the cost. The cost of request sequence can be reduced to devise an algorithm that minimizes the reorganization of the unsorted linear list. In this paper, we propose a novel algorithm called hash table based positioning (HTBP) for list accessing problem. The algorithm is based on the concept of hash table. We incorporate the reorganization costs in terms of pre-organization, displacement and post-organization cost. We perform extensive mathematical analysis on some special types of request sequence as well as random sequence and compare the results with a well-known list accessing algorithm called move-to-front. The experimental results show that the proposed algorithm outperforms than move-to-front algorithm.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126778879","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}
引用次数: 2
A system for identification of idioms in Hindi 印地语成语识别系统
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897218
Priyanka M Tech, R M K Sinha
{"title":"A system for identification of idioms in Hindi","authors":"Priyanka M Tech, R M K Sinha","doi":"10.1109/IC3.2014.6897218","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897218","url":null,"abstract":"Idioms are extensively used in everyday language. They carry a metaphorical sense that makes their comprehension difficult as their meaning cannot be deduced from the meaning of their constituent parts. They pose a challenge for Natural language processing (NLP) applications like machine translation, information retrieval and question answering as their translation and meaning needs to be derived logically rather than literally. A lot of research work has been carried out into automatic extraction of multi-word expressions, but no comprehensive work has been reported on idioms in Hindi. In this paper, an attempt has been made to study the linguistic and morphological variations that are usually encountered in idioms in Hindi. Based on this study, a methodology for deriving rules for representation of idioms and their search has been developed. The rules representing the idioms are hand crafted. For the idiom identification, rule-base has been used to mark the input text for probable presence of idiom. Our system is limited to use only intra-sentential context. The experimental results demonstrate feasibility and scalability of our methodology.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122733541","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}
引用次数: 6
Towards software engineering paradigm for software as a service 面向软件即服务的软件工程范式
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897195
Niyati Baliyan, Sandeep Kumar
{"title":"Towards software engineering paradigm for software as a service","authors":"Niyati Baliyan, Sandeep Kumar","doi":"10.1109/IC3.2014.6897195","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897195","url":null,"abstract":"The Software as a Service model of Cloud Computing offers economies of scale through the pay per use model; however, it renders the modern software very different from traditional software. Hence, there is a need to adapt Software Engineering approach in a manner that will make the development process and delivery of Software as a Service more efficient and of high quality. After performing literature review, a classification of ongoing research in this direction of adaptation is presented. Various research gaps in the areas of software development process, software reengineering, measurement, metrics, and quality models targeted at Software as a Service are identified, which can be a first step towards the definition of standards and guidelines for Software as a Service development.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127721987","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}
引用次数: 7
Collaborating trust and item-prediction with ant colony for recommendation 基于信任和项目预测的蚁群推荐
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897196
Abhishek Kaleroun, Shalini Batra
{"title":"Collaborating trust and item-prediction with ant colony for recommendation","authors":"Abhishek Kaleroun, Shalini Batra","doi":"10.1109/IC3.2014.6897196","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897196","url":null,"abstract":"Online Recommenders are information filtering systems which works on the implicit or explicit information provided by the users and Collaborative Filtering is most widely used technique for this. But the accuracy of the recommendation process is greatly affected by the sparsity in user-item matrix. Though, collaborative filtering is one of the most promising techniques, it still suffers from the cold start problem due to which it is unable to give recommendations to new users. It is also vulnerable to many attacks like shilling attack, grey sheep, etc. which severely hamper the recommendation systems. A trust-based approach combining trust and swarm intelligence (ant colony) with collaborative filtering has been proposed. It also uses item-based predictions in the process of generating recommendations. Ant Colony exhibit self organizing and distributed properties due to which it is used in real time and constantly changing environment. Trust is updated continuously using pheromone updating strategy of ant colony thus, making the system more accurate. By combining these approaches, effective system is proposed which provide solutions to the above mentioned problems of collaborative filtering and predict whether the user will like the certain item or not. Results have been validated using dataset of movies which is available online.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127742133","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}
引用次数: 6
Enhancing JFLAP with automata construction problems and automated feedback 用自动构造问题和自动反馈增强JFLAP
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897141
Vinay S. Shekhar, A. Agarwalla, Akshay Agarwal, Nitish B., Viraj Kumar
{"title":"Enhancing JFLAP with automata construction problems and automated feedback","authors":"Vinay S. Shekhar, A. Agarwalla, Akshay Agarwal, Nitish B., Viraj Kumar","doi":"10.1109/IC3.2014.6897141","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897141","url":null,"abstract":"JFLAP is a powerful and popular educational software tool that allows students in Formal Languages and Automata courses to understand theoretical concepts in a visual and interactive manner. In this paper, we enhance the quality of JFLAP's interactivity in two ways that are extremely useful for beginners learning to build finite automata: (1) our tool can automatically generate a rich variety of practice problems (and their solutions) and immediately evaluate student answers, and (2) we propose a novel way for students to obtain prompt and meaningful feedback on their solutions to problems taken from other sources such as assignments or textbooks. We believe that these enhancements can greatly improve the utility of JFLAP as an instructional resource.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128093364","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}
引用次数: 16
A novel hybrid memetic search in Artificial Bee Colony algorithm 一种新的混合模因搜索人工蜂群算法
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897149
Sandeep Kumar, Ashutosh Kumar, V. Sharma, Harish Sharma
{"title":"A novel hybrid memetic search in Artificial Bee Colony algorithm","authors":"Sandeep Kumar, Ashutosh Kumar, V. Sharma, Harish Sharma","doi":"10.1109/IC3.2014.6897149","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897149","url":null,"abstract":"Artificial Bee Colony (ABC) algorithm is a Nature Inspired Algorithm (NIA). ABC is motivated by clever food foraging behavior of honey bees. Comparable to other population based stochastic algorithm ABC also lack balance in exploration of local search reason and exploitation of finest possible solutions in search space. The proposed algorithm is a hybrid of two memetic algorithms; it combines Levy Flight search in ABC (LFABC) and Memetic Search in ABC (MeABC) algorithm. The proposed algorithm named as Levy Flight Memetic Search in ABC (LFMABC) algorithm. The proposed LFMABC algorithm is tested over eleven benchmark functions in addition to two real world problems in order to establish its superiority over ABC and its recent variants. Results shows that proposed strategy LFMABC is able to find optimum in less time for considered problems.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128501349","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}
引用次数: 11
New approaches for service composition based on graph models 基于图模型的服务组合新方法
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897225
Pavankumar Guluru, R. Niyogi
{"title":"New approaches for service composition based on graph models","authors":"Pavankumar Guluru, R. Niyogi","doi":"10.1109/IC3.2014.6897225","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897225","url":null,"abstract":"In this paper we present web service composition problem as search problem in AND/OR Service Dependency Graph (SDG). In general web services take multiple inputs and produce single output. For this reason we concentrated on Multi-input, Single output web services composition. We proposed two algorithms for finding the composition given a service request. First algorithm finds the composition by generating all the paths from input nodes to output node and merging the paths. In Second algorithm we have incorporated cost parameters for web services and algorithm finds the minimal composition for the given request. We have evaluated our algorithms experimentally and results are shown.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121786470","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}
引用次数: 3
A weight based energy-aware hierarchical clustering scheme for mobile ad hoc networks 一种基于权重的移动自组网能量感知分层聚类方案
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897227
A. Roda, Charu
{"title":"A weight based energy-aware hierarchical clustering scheme for mobile ad hoc networks","authors":"A. Roda, Charu","doi":"10.1109/IC3.2014.6897227","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897227","url":null,"abstract":"Clustering in MANETs is a hierarchical approach of partitioning the network, combing nodes and forming groups called Clusters. The paper focuses on implementing a Clustering technique that is Energy Aware, and provides Stability by using a weighted approach for the selection of Cluster-Heads (CHs) that takes different parameters like power, mobility etc. into account while selecting the CH and thereby reducing the chances of reconfiguration. Energy awareness of the scheme is based on minimization of energy consumption by creation of clusters where numbers of nodes depend on the energy required for the completion of tasks and tasks are distributed amongst clusters to get Balanced Load. In addition, to provide stability and to be able to achieve all the tasks assigned to the nodes, we propose grouping according to relative mobility and merging of clusters depending on the similar mobility pattern, thereby achieving a stable network which is continuous. The paper includes performance evaluation and characteristic analysis of our clustering scheme along with comparison with some of the existing algorithms which form the basis for our algorithm in order to show the strength of this scheme over others.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127166112","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}
引用次数: 6
Impact of topological properties over link prediction based on node neighbourhood: A study 拓扑特性对基于节点邻域的链路预测的影响研究
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897172
Anand Kumar Gupta, Neetu Sardana
{"title":"Impact of topological properties over link prediction based on node neighbourhood: A study","authors":"Anand Kumar Gupta, Neetu Sardana","doi":"10.1109/IC3.2014.6897172","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897172","url":null,"abstract":"Link prediction is an important task to identify the future interactions among existing non-connected members of a network, by measuring the proximity between nodes in a network. Link prediction is done on the basis of node similarity. Node neighbourhood based techniques are most popularly used for link prediction. Techniques based on Node neighbourhood can be applied on various applications like biological protein-protein interaction network, social network, information network and citation network to predict the future nodes. Every network has got certain topological properties. Topological properties play an integral role in choosing a technique for a particular network for predicting future links. This paper describes the impact of topological properties over link prediction technique. It also elaborates how presence of topological properties in a network improves the efficiency of the link prediction techniques.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126553916","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}
引用次数: 4
Significance of CV transition and steady vowel regions for language identification CV转换和稳定元音区域对语言识别的意义
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897226
Dipanjan Nandi, A. Dutta, K. S. Rao
{"title":"Significance of CV transition and steady vowel regions for language identification","authors":"Dipanjan Nandi, A. Dutta, K. S. Rao","doi":"10.1109/IC3.2014.6897226","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897226","url":null,"abstract":"The present work explores the significance of the consonant-vowel (CV) transition and steady vowel (SV) regions for language identification (LID) task. The language-specific vocal tract information represented by Mel-frequency cepstral coefficients (MFCCs), extracted from the CV transition and steady vowel regions for LID task. The duration of CV transition and steady vowel regions are varied to analyze LID performance. The evidences obtained from the CV transition and steady vowel regions are combined to investigate the existence of complementary information in these two regions. The LID study carried out on 27 Indian languages from IITKGP-MLILSC speech database. The Gaussian mixture modelling (GMM) technique has been used for developing the language models. The average LID performances obtained by processing CV transition region and steady vowel regions are 70% and 71% respectively. In contemporary works, LID system has been developed by processing whole speech utterances, which provides 72% recognition accuracy.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124437854","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}
引用次数: 11
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信