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

筛选
英文 中文
Cluster growth technique for combinatorial evolvable digital circuits 组合可进化数字电路的簇生长技术
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897189
A. Srivastava, H. Gupta
{"title":"Cluster growth technique for combinatorial evolvable digital circuits","authors":"A. Srivastava, H. Gupta","doi":"10.1109/IC3.2014.6897189","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897189","url":null,"abstract":"The genetic algorithm (GA) is one of the optimization techniques of evolutionary algorithm used to design evolvable hardware. This paper proposes the application of cluster based growth approach with genetic algorithm for evolvable hardware. Earlier methods of evolving hardware proposed on static m × n grid structure of hardware that is evolved by reconfiguring interconnections. Clustering technique is a synthesis method where the hardware functionality is evaluated for minimum number of gates. The cluster grows by adding more gates into the cluster if the functionality is not obtained. Reconfiguration of interconnections is also preformed along with the cluster growth. Our main contributions are: 1) Adaptation of genetic operators in a way suitable for clustering growth. 2) Applications to task with unknown number of clusters in Clustering with genetic algorithm and demonstrate its performance. 3) To obtain the desired functionality with least number of logic gates such that the interconnection of nodes in the earlier defined architecture is modified with clustering, so that the fast convergence is obtained.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"85 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":"127197374","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
Energy-aware resource management for computing systems 计算系统的能源感知资源管理
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897139
H. Siegel, Bhavesh Khemka, Ryan D. Friese, S. Pasricha, A. A. Maciejewski, G. Koenig, Sarah Powers, Marcia Hilton, Jendra Rambharos, Gene Okonski, Steve Poole
{"title":"Energy-aware resource management for computing systems","authors":"H. Siegel, Bhavesh Khemka, Ryan D. Friese, S. Pasricha, A. A. Maciejewski, G. Koenig, Sarah Powers, Marcia Hilton, Jendra Rambharos, Gene Okonski, Steve Poole","doi":"10.1109/IC3.2014.6897139","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897139","url":null,"abstract":"This corresponds to the material in the invited keynote presentation by H. J. Siegel, summarizing the research in [1], [2]. We address the problem of assigning dynamically-arriving tasks to machines in a heterogeneous computing environment. These machines execute a workload composed of different tasks, where the tasks have diverse computational requirements. Each task has a utility function associated with it that represents the value of completing that task, and this utility decreases the longer it takes a task to complete. The goal of our resource manager is to maximize the sum of the utilities earned by all tasks arriving in the system over a given interval of time, while satisfying an energy constraint. We describe example energy-aware resource management methods to accomplish this goal, and compare their performance. We also study the bi-objective problem of maximizing system utility and minimizing the system energy consumption. This analysis technique allows system administrators to investigate the trade-offs between these conflicting goals.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"18 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":"114694818","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
Leveraging hadoop framework to develop duplication detector and analysis using Mapreduce, Hive and Pig 利用hadoop框架,使用Mapreduce, Hive和Pig开发重复检测和分析
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897216
Priyanka Sethi, Prakash Kumar
{"title":"Leveraging hadoop framework to develop duplication detector and analysis using Mapreduce, Hive and Pig","authors":"Priyanka Sethi, Prakash Kumar","doi":"10.1109/IC3.2014.6897216","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897216","url":null,"abstract":"The burgeoning volume of torrential data continues to grow exponentially in this very age of the Internet of Things. As this torrent of digital datasets continue to outgrow in datacenters, the focus needs to be shifted to stored data reduction methods and that too pertaining to NoSQL databases as traditional structured storage systems continuously tend to face challenges in providing the required storage, throughputs and computational power requirements necessary to capture, store, manage and analyze the deluge of data. Deduplication systems, thus designed, retain a single copy of redundant data on disk to save disk space, but what if we want to keep certain copies intentionally and need wishful elimination. This paper leverages Hadoop framework to design and develop a duplication detection system that detects multiple copies of the same data right at the file level itself and that too before transmission. Thereafter, various datasets are tuned for better performance and analysed using MapReduce, Hive and Pig.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"287 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":"114261127","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
OFDTs:-An optimally fair dynamic task scheduling algorithm in cloud environment ofdt:一种云环境下最优公平的动态任务调度算法
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897238
Shilpi Saxena, S. Chouhan
{"title":"OFDTs:-An optimally fair dynamic task scheduling algorithm in cloud environment","authors":"Shilpi Saxena, S. Chouhan","doi":"10.1109/IC3.2014.6897238","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897238","url":null,"abstract":"Cloud computing, the term in present scenario, covers almost entire internet-based activity. Today, almost everything is deployed, run and managed on the cloud environment. The growing demand for cloud based activities and its day by day increasing count, of number of users and providers, has made it the cynosure among the computing environments. This emerging interest of users and providers has made optimized scheduling of tasks, a major challenge in this arena. For the substantial growth of cloud computing, there is an emerging need of an efficient, optimized and dynamic task scheduling strategy. In this paper, we proposed a scheduling algorithm named “An Optimally Fair Dynamic Task Scheduling Algorithm”. The proposed algorithm is tested using CloudSim simulator and the simulation results and graphs shows the enhanced performance of proposed algorithm over other traditional algorithm.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"26 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":"127037266","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
Email recipient prediction using reverse chronologically arranged implicit groups 电子邮件收件人预测使用反向时间顺序安排隐式组
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897217
Akash Desai, S. Dash
{"title":"Email recipient prediction using reverse chronologically arranged implicit groups","authors":"Akash Desai, S. Dash","doi":"10.1109/IC3.2014.6897217","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897217","url":null,"abstract":"Although social networking has significantly influenced online communication, email still has managed to retain its importance. There are number of techniques proposed in past by researchers for recipient prediction/suggestion. Most of them are complex to implement and takes good amount of computation time. The major factor behind higher time complexity and space complexity is the prediction models these methods use. These days mobile device applications are being widely used for emailing and thus appropriate techniques should be found considering constraints of mobile devices. Keeping this in view our research focuses on proposing prediction model, which takes very less computational efforts to be maintained. Apart from this, existing methods focus on maximizing number of intended recipients in one prediction cycle. In this paper, we also propose a different way of looking at the problem, by targeting 1 intended recipient in each iteration. For this, we introduce hit rate as a good measurement technique to measure the effectiveness of recipient prediction algorithm. We also present a flaw in the compiled version of Enron data set, and show some novel analysis on Enron data set which will help immensely in creating efficient recipient prediction algorithm.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"89 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":"116647283","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
Focused crawling with ontology using semi-automatic tagging for relevancy 集中抓取本体,使用半自动标记的相关性
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897224
Risha Gaur, D. Sharma
{"title":"Focused crawling with ontology using semi-automatic tagging for relevancy","authors":"Risha Gaur, D. Sharma","doi":"10.1109/IC3.2014.6897224","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897224","url":null,"abstract":"World Wide Web (WWW) is considered to be the most important source of information now a days but it's difficult to decide which resources are useful and which are more important. Thus to make a specific part of web leading to only the required resources is searched for. The focused crawler crawl a specific part of the web to retrieve the relevant resources. Here in this paper the focused crawler is applied on social network having ontology dependent tags. The ontology here is also used in preprocessing step of focused crawlers to make the search more specific by expanding the search topic semantically. Further the relevancy of manually tagged and semi-automatically tagged resource is compared. Then finally the harvest rate is evaluated for focused crawlers with ontology and using semi-automatic tagging to check for the relevance.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"26 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":"130631075","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
PoGest: A vision based tool for facilitating Kathak learning PoGest:一个基于视觉的工具,用于促进卡塔克学习
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897142
Sonal Gupta, S. Goel
{"title":"PoGest: A vision based tool for facilitating Kathak learning","authors":"Sonal Gupta, S. Goel","doi":"10.1109/IC3.2014.6897142","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897142","url":null,"abstract":"We present a vision based tool for enriching the conventional method of learning Kathak. Teachers can record their dance steps using PoGest and give it to the learners for practice according to their pace and convenience. PoGest will help learners to analyze their dance movements by giving them immediate feedback in the form of similarity score and also the concurrent display of juxtaposed recordings of their own performance with respect to that of the teacher's.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"54 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":"114816133","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
SemIndex: Efficient indexing mechanism for ontologies SemIndex:本体的有效索引机制
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897197
Vandana Dhingra, K. Bhatia
{"title":"SemIndex: Efficient indexing mechanism for ontologies","authors":"Vandana Dhingra, K. Bhatia","doi":"10.1109/IC3.2014.6897197","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897197","url":null,"abstract":"To make machine understand the semantics of web page, there is need for representation language other than HTML, XML. Semantic Web, allows the information to be represented in well-defined manner using different languages like RDF, OWL which enhances the inference power of the machines, making the contents machine-interpretable. Indexing of the fetched web contents for these representation languages for effective information retrieval is the key issue of research. In this paper comparative analysis of existing indexing techniques for RDF documents is done. And framework is proposed and implemented for indexing crawled ontologies represented in Semantic Web Language like RDF language.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"11 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":"133215250","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
From specification languages to wide-spectrum logics 从规范语言到广谱逻辑
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897140
Martin C. Henson
{"title":"From specification languages to wide-spectrum logics","authors":"Martin C. Henson","doi":"10.1109/IC3.2014.6897140","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897140","url":null,"abstract":"In this paper we describe a new approach to system specification that takes the language Z as its inspiration but moves the focus from language to logic and from specification to wide-spectrum. In this paper we illustrate the differences between Z and nuZ and the advantages of the latter by means of illustrative examples.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"21 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":"116449209","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
Local weather interpolation using remote AWS data with error corrections using sparse WSN for automated irrigation for Indian farming 使用远程AWS数据进行本地天气插值,并使用稀疏WSN进行误差校正,用于印度农业的自动灌溉
2014 Seventh International Conference on Contemporary Computing (IC3) Pub Date : 2014-09-15 DOI: 10.1109/IC3.2014.6897220
N. Hema, K. Kant
{"title":"Local weather interpolation using remote AWS data with error corrections using sparse WSN for automated irrigation for Indian farming","authors":"N. Hema, K. Kant","doi":"10.1109/IC3.2014.6897220","DOIUrl":"https://doi.org/10.1109/IC3.2014.6897220","url":null,"abstract":"Automated irrigation system needs weather information for irrigation control. Scattered automated weather stations (ASW) from government agencies or wireless sensor network (WSN) are used for weather monitoring purpose. Each has its own advantages and disadvantage in terms of cost to farmers and accuracy on monitoring parameters. This paper proposes a technique of real-time spatial interpolation using nearby ASW to predict real-time local weather (area under consideration for irrigation) parameter and accuracy of result is about 99.59%. Further, this paper proposes a correction technique by using sparse WSN with soil moisture sensor installed in it. This proposed technique is expected to increase the accuracy of climatic parameters for the area under consideration with more precise irrigation, which in turn saves energy, water and installation cost to farmers.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"19 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":"121987645","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学术官方微信