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

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

筛选
英文 中文
Sentiment analysis of twitter data using machine learning approaches and semantic analysis 使用机器学习方法和语义分析对twitter数据进行情感分析
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897213
G. Gautam, Divakar Yadav
{"title":"Sentiment analysis of twitter data using machine learning approaches and semantic analysis","authors":"G. Gautam, Divakar Yadav","doi":"10.1109/IC3.2014.6897213","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897213","url":null,"abstract":"The wide spread of World Wide Web has brought a new way of expressing the sentiments of individuals. It is also a medium with a huge amount of information where users can view the opinion of other users that are classified into different sentiment classes and are increasingly growing as a key factor in decision making. This paper contributes to the sentiment analysis for customers' review classification which is helpful to analyze the information in the form of the number of tweets where opinions are highly unstructured and are either positive or negative, or somewhere in between of these two. For this we first pre-processed the dataset, after that extracted the adjective from the dataset that have some meaning which is called feature vector, then selected the feature vector list and thereafter applied machine learning based classification algorithms namely: Naive Bayes, Maximum entropy and SVM along with the Semantic Orientation based WordNet which extracts synonyms and similarity for the content feature. Finally we measured the performance of classifier in terms of recall, precision and accuracy.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"99 6 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":"134316941","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}
引用次数: 270
Positioning multiple mobile robots for geometric pattern formation: An empirical analysis 定位多移动机器人的几何图案形成:一个实证分析
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897242
A. Gautam, Apoorv Saxena, P. Mall, Sudeept Mohan
{"title":"Positioning multiple mobile robots for geometric pattern formation: An empirical analysis","authors":"A. Gautam, Apoorv Saxena, P. Mall, Sudeept Mohan","doi":"10.1109/IC3.2014.6897242","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897242","url":null,"abstract":"This paper presents an experimental setup for absolute positioning of multiple mobile robots in an indoor environment using a low cost camera. Localization or positioning of mobile robot in its environment is crucial for deciding its future course of action. In this paper we have proposed to use an overhead camera for positioning multiple mobile robots which are required to act as a team. Also we have tested the efficacy of two existing distributed algorithms for circle formation using a team of five e-puck robots. The first algorithm is mathematically proven with many assumptions about the sensing and motion capabilities of mobile robots which are not feasible in the real world. In the second algorithm the authors have considered explicit inter robot communication and have utilized the distributed solution of a well known algorithm often discussed in distributed computing - the Dinning Philosophers Problem for the robots to synchronize during their activation cycle. The contribution of this paper is twofold i.e., first, a practical low cost, multi-robot positioning system is proposed and second, experimental evaluation of two distributed algorithms for circle formation by a team of mobile robots have been carried out. It is seen that the second algorithm outperforms the first.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"1 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":"129900895","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
Trajectory generation for myoelectrically controlled lower limb active knee exoskeleton 肌电控制下肢活动膝关节外骨骼的轨迹生成
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897178
A. S. Kundu, O. Mazumder, Ritwik Chattaraj, S. Bhaumik, P. Lenka
{"title":"Trajectory generation for myoelectrically controlled lower limb active knee exoskeleton","authors":"A. S. Kundu, O. Mazumder, Ritwik Chattaraj, S. Bhaumik, P. Lenka","doi":"10.1109/IC3.2014.6897178","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897178","url":null,"abstract":"Aim of this paper is to generate joint angle trajectory of knee joint and fed it to a myoelectric controlled lower body exoskeleton to regenerate lost gait pattern. EMG signal of six different lower limb muscles has been acquired and fused using standard fusion technique discarding spurious data. From the fused EMG data, different gait parameters like stride time, gait phase etc has been calculated. Joint trajectory during a gait cycle is obtained from Kinect sensor that can extract comprehensive gait information from all parts of the body. Joint angle obtained from kinect is combined with the gait parameters acquired from EMG and together they will be fed to a robotic lower limb exoskeleton. As the exoskeleton joints are fed with true joint angle data of the user and the joints are driven by users own intention signal, functioning, control and acceptability of the exoskeleton device is much more to a user. The system has massive application in gait rehabilitation for post stroke patients, people suffering from cerebral palsy and other neuro muscular gait defects, amputees etc.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"1 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":"131066319","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}
引用次数: 14
Spotting the phenomenon of bad smells in MobileMedia product line architecture 发现MobileMedia产品线架构中的不良气味现象
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897200
Manjinder Kaur, Parveen Kumar
{"title":"Spotting the phenomenon of bad smells in MobileMedia product line architecture","authors":"Manjinder Kaur, Parveen Kumar","doi":"10.1109/IC3.2014.6897200","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897200","url":null,"abstract":"Product line engineering a very new engineering method evolved in few past years has proven a very best technique of producing products at rapid way using the concept Reuse of assets, artifacts, and components. Software Product Lines and Software Architectures combined to form a Product Line Architecture (PLA). Many researchers have work on PLA producing different views and experiences. Architectural smells a way of accessing the PLAs, means the identification of bad smells in context of architectures formed using product line. “Why these smells occur” is briefly described and also identification has also been shown using analytical and manual analysis. These smells can be remedied but the process is too large to follow, though small systems can be easily remedied or re-factored using various techniques. Architectural smells are remedied by changing the structure and the behaviors of the internal system elements without changing the external behavior of the system. This paper describes MobileMedia Feature Model creation, Component Model creation as PLA for the assessment of Bad smells.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"1 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":"126736742","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}
引用次数: 9
Performance comparison for data storage - Db4o and MySQL databases 数据存储的性能比较- db40和MySQL数据库
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897167
Sudhanshu Kulshrestha, Shelly Sachdeva
{"title":"Performance comparison for data storage - Db4o and MySQL databases","authors":"Sudhanshu Kulshrestha, Shelly Sachdeva","doi":"10.1109/IC3.2014.6897167","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897167","url":null,"abstract":"Choice of right and appropriate database is always crucial for any information system. Since database is an integral and important part, we choose to write the performance analysis of different type of databases in context to health care data. Health care database consists of Electronic Health Records. Also, various Electronic Health Record standards like HL7, openEHR and CEN EN 13606 have been defined for relational, object and object-relational databases. So far, none of the standard has been defined using object-database. In order to do so, we must compare and analyze the performance of object-database over others. In this paper, firstly we have studied the current trends in Indian Health Care with respect to medical data storage and retrieval. Next, we have compared the performance of MySQL (relational) and Db4o (object) database in terms of persistence time and storage space for a sample hospital data of 100 users.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"46 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":"114333029","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}
引用次数: 18
A heuristic for two bin partition problem 两个bin分区问题的一种启发式算法
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897152
A. Asadullah, K. Dinesha, P. Bhatt
{"title":"A heuristic for two bin partition problem","authors":"A. Asadullah, K. Dinesha, P. Bhatt","doi":"10.1109/IC3.2014.6897152","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897152","url":null,"abstract":"There are many heuristics to address 2-bin integer partition problem. The range (R) of the values in the data set and the number of element (N) in the data set are 2-parameters which determine the appropriate heuristics. By and large, for large N, Karmarkar-Karp(KK) heuristics offers solutions. For low values of N, Complete Karmarkar-Karp heuristics (CKK), Horowitz and Sahni (HS), Schroeppel and Shamir (SS), Brute-Force search (BF) offers solutions. However, our computations indicate that for R > 1012 and for a specific range of N, depending on R, (R = 1014, N = 60 to 150) the best existing heuristics (CKK) takes long or very long CPU time. We are proposing a different heuristic to address this scenario. The proposed heuristic in the paper uses depth-first (like KK) set differencing till N become 48 and from N = 48 to 1 it performs exhaustive search (like HS). For the above mentioned scenario, we found that this combination of strategies gives better and faster solution compared to CKK.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"5 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":"122184367","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}
引用次数: 0
GPU based geometric hashing for space partioning 基于GPU的空间划分几何哈希
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897170
Bhavin Patel, Vibha Patel
{"title":"GPU based geometric hashing for space partioning","authors":"Bhavin Patel, Vibha Patel","doi":"10.1109/IC3.2014.6897170","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897170","url":null,"abstract":"This paper presents a Graphics Processing Unit (GPU) based solution for classical geometric hashing and its variation with transformation functions on Speeded Up Robust Features (SURF) space of images. GPU based classical geometric hashing provides speed-up of 14.0x to 61.0x for offline indexing and 1.08x to 10.06x for online searching compared to sequential one for different partitioning sizes. GPU based transformation by mean invariancy and principal component based alignment with geometric hashing provides speed-up of 12.12x to 63.13x for offline indexing and 1.02x to 5.82x for online searching. This paper also proposes solution to execute multiple query simultaneously. It proves to be better than the serial execution of multiple queries. GPU based implementation of multi-query provide speed-up of 1.68x to 460.45x than the sequential one for online searching for multiple queries between 1 to 10 simultaneously. Experimentation is done using standard CASIA Palm-print based images.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"33 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":"129598607","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}
引用次数: 0
Dynamic scaling of web services for xen based virtual cloud environment 基于xen的虚拟云环境的动态扩展web服务
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897175
M. Malhotra, Sanya Kapoor, Prakash Kumar
{"title":"Dynamic scaling of web services for xen based virtual cloud environment","authors":"M. Malhotra, Sanya Kapoor, Prakash Kumar","doi":"10.1109/IC3.2014.6897175","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897175","url":null,"abstract":"According to its supporters, cloud computing is emerging as a fast-growing technology that is gauged to succeed where other attempts to deliver hands-on computing to general public with a network connection have failed. One of the essential benefits of using cloud computing is the feature of scalability. In this paper, keeping in mind the `scalability' factor of the Cloud, a system is proposed that dynamically scales the web services in a virtualised cloud computing environment consisting of a front end load balancer that balances the load of the incoming HTTP requests, a Cluster Monitoring System that constantly fetches the information of the current states of the Virtual Machines and an auto-provisioning system that runs a novel algorithm in the back-end according to which virtual machines are scaled.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"1 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":"129872096","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}
引用次数: 1
A lexicon pool augmented Naive Bayes Classifier for Nepali Text 尼泊尔语文本的词典库增强朴素贝叶斯分类器
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897231
S. Thakur, V. Singh
{"title":"A lexicon pool augmented Naive Bayes Classifier for Nepali Text","authors":"S. Thakur, V. Singh","doi":"10.1109/IC3.2014.6897231","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897231","url":null,"abstract":"This paper presents our experimental work on machine classification of Nepali texts. We have implemented a Naive Bayes classifier for the task and then augmented it through a multinomial lexicon pooling. The lexicon-pooled Naive Bayes Classifier obtains better results on classification task as compared to a normal Naive Bayes implementation. This hybrid approach also helps in dealing with the unavailability of linguistic resources in Nepali (such as stemmer, stop word list and accurate POS tagger). The proposed lexicon-pooled Naive Bayes approach is evaluated by applying on a sufficiently large dataset of Nepalese news stories. The experimental results demonstrate the higher classification accuracy and usefulness of the method for Nepali text classification. The paper also contributes resources to Nepali language processing, in form of a Nepali news stories corpus and a domain specific lexicon for Nepali news stories.","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":"129166098","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
Image realization steganography with LCS based mapping 基于LCS映射的图像隐写实现
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897176
Ratnakirti Roy, S. Changder
{"title":"Image realization steganography with LCS based mapping","authors":"Ratnakirti Roy, S. Changder","doi":"10.1109/IC3.2014.6897176","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897176","url":null,"abstract":"Image Realization Steganography aims in devising techniques that realize a secret message from a cover image using a suitable cover-to-secret mapping with low embedding rates. This paper presents an Image Realization Steganography technique which maps a secret image as a Longest Common Subsequence of a given cover image. The cover image being a string of high degree of randomness and a very large length as compared to the secret image, the length of the LCS between them is expected to be close to the length of the binary string equivalent of the secret image. This enables the proposed technique to realize a secret image with very little or no modification of the cover. Experimental results validate this fact strongly. The results also indicate that any given cover image can be used to realize a secret image as large as itself thereby establishing the high hiding capacity of the technique.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"5 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":"127848141","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学术官方微信