检索结果-内蒙古大学图书馆

Runtime model based approach to IoT application development

Frontiers of Computer Science 2015年第4期9卷 540-553页

作者： Xing CHEN College of Mathematics and Computer Science Fuzhou University Fuzhou 350116 China Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing Fuzhou 350116 China Key Laboratory of High Confidence Software Technologies (Ministry of Education) Beijing 100871 China School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

The internet of things （loT） attracts great interest in many application domains concerned with monitoring and ：ontrol of physical phenomena. However, application devel- opment is still one of the main hurdles to a wide adoption of IoT technology. Application development is done at a low level, very close to the operating system and requires pro- grammers to focus on low-level system issues. The under- lying APIs can be very complicated and the amount of data collected can be huge. This can be very hard to deal with as a developer. In this paper, we present a runtime model based approach to IoT application development. First, the manage- ability of sensor devices is abstracted as runtime models that are automatically connected with the corresponding systems. Second, a customized model is constructed according to a personalized application scenario and the synchronization be- tween the customized model and sensor device runtime mod- els is ensured through model transformation. Thus, all the application logic can be carried out by executing programs on the customized model. An experiment on a real-world ap- plication scenario demonstrates the feasibility, effectiveness, and benefits of the new approach to IoT application develop- ment.

关键词： IoT application development software architec-ture models at runtime

来源：评论

学校读者我要写书评

暂无评论

Semantic automatic image annotation based on Non-Abstract Visual keywords

Semantic automatic image annotation based on Non-Abstract Vi...

引用

2014 International Conference on information Technology and Application, ITA2014

作者： Ke, Xiao Chen, Guolong College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing Fuzhou University Fuzhou China

ISBN: (纸本)9781138026773

Automatic image annotation is a significant and challenging problem in pattern recognition and computer vision. Existing models did not describe the visual representations of corresponding keywords, which would lead to appearing plenty of irrelevant annotations in final annotation results. These annotations did not relate to any part of images considering visual contents. We propose a new automatic image annotation model (NAVK) based on relevant visual keywords to overcome above problems. Our model focuses on non-abstract words. First, we establish visual keyword seeds of each non-abstract word, and then a new method is proposed to extract visual keyword collections by using corresponding seeds. Second, we propose adaptive parameter method and fast solution algorithm to determine similarity thresholds of each keyword. Finally, the combinations of above methods are used to improve annotation performance. Experimental results verify the effectiveness of proposed image annotation model. © 2015 Taylor & Francis Group, London.

关键词： Image annotation

来源：评论

学校读者我要写书评

暂无评论

Regression-based execution time prediction in hadoop environment

Regression-based execution time prediction in hadoop environ...

引用

International Conference on information Technology and Computer Application Engineering, ITCAE 2014

作者： Wu, Xiao Dong Zeng, Yu Zhu Zhao, C.T. Faculty of Mathematics and Computer Science Quanzhou Normal University China Fujian Provincial Key Laboratory of Data Intensive Computing China Key Laboratory of Intelligent Computing and Information Processing Fujian Province University China

ISBN: (纸本)9781138027176

Hadoop MapReduce has been proven an effective computing model to deal with big data for the last few years. However, one technical challenge facing this framework is how to predict the execution time of an individual job. In this paper, we propose a regression-based method to predict the execution times of Hadoop jobs. The proposed prediction method consists of three phases: learning data sampling, regression analysis and making prediction. Experimental results show that the predicted execution time obtained by our method is close to the actual execution time. © 2015 Taylor & Francis Group, London.

关键词： Regression analysis

来源：评论

学校读者我要写书评

暂无评论

A New Logistic Map Based Chaotic Biogeography-based Optimization Approach for Cluster Analysis

A New Logistic Map Based Chaotic Biogeography-based Optimiza...

引用

2016 IEEE International Conference on Progress in Informatics and Computing

作者： Shui-Hua Wang Hui-Min Lu Yu-Jie Li Yang Wang Zhi-Min Chen Yu-Min Wei Wen-Juan Jia Fang-Yuan Liu Yu-Dong Zhang School of Computer Science and Technology Nanjing Normal University Hunan Provincial Key Laboratory of Network Investigational Technology Hunan Policy Academy Department of Electrical Engineering The city college of New YorkCUNY Department of Mechanical and Control Engineering Kyushu Institute of Technology School of Information Engineering Yangzhou University School of Physics and Electronic Engineering Taizhou University School of Electronic Information Shanghai Dianji University School of Energy and Mechanical Engineering Nanjing Normal University Key Laboratory of Intelligent Computing and Information Processing in Fujian Provincial University Quanzhou Normal University

Cluster analysis is important in scientific and industrial fields. In this study, we proposed a novel chaotic biogeography-based optimization(CBBO) method, and applied it in centroid-based clustering methods. The results over three types of simulation data showed that this proposed CBBO method gave better performance than chaotic particle swarm optimization, genetic algorithm, firefly algorithm, and quantum-behaved particle swarm optimization. In all, our CBBO method is effective in centroid-based clustering.

关键词： chaotic biogeography-based optimization cluster analysis centroid-based clustering simulation particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

The analysis of big Data application mode and security risk

The analysis of big Data application mode and security risk

引用

International Conference on information Sciences,Machinery,Materials and Energy（ICISMME 2015）

作者： ZENG Tai-sheng Faculty of Mathematics and Computer Science Quanzhou Normal University Fujian Provincial Key Laboratory of Data Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian Province University

ISBN: (纸本)9789462520677

In the current social background,Existing facilities and tools already can not meet the needs of big data in expanding and analysis ***'s data storage and analysis work is achieved under cloud conditions and Hadoop were set *** the conditions for cloud computing,cloud computing applications who have remote data files were not authorized to read its contents,which results in unauthorized manipulation,and it will produce a lot of security risks for large *** this paper,according to the cloud of different modes,Hadoop different stages of the operation,subject to the threat of non- confidence and security to steal big data generated to analyze a variety of privacy,with threat model as an example,it explores ways to address security threats.

关键词： big data security analysis Hadoop

来源：评论

学校读者我要写书评

暂无评论

Whole genome/proteome based phylogeny reconstruction for prokaryotes using higher order Markov model and chaos game representation

引用

Molecular phylogenetics and evolution 2016年 96卷 102-111页

作者： Wei-Feng Yang Zu-Guo Yu Vo Anh Hunan Key Laboratory for Computation and Simulation in Science and Engineering and Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Hunan 411105 PR China Department of Mathematics and Physics Hunan Institute of Engineering Hunan 411104 PR China. Electronic address: yangweifeng09@***. School of Mathematical Sciences Queensland University of Technology GPO Box 2434 Brisbane QLD 4001 Australia. Electronic address: yuzuguo@***. School of Mathematical Sciences Queensland University of Technology GPO Box 2434 Brisbane QLD 4001 Australia. Electronic address: v.anh@qut.edu.au.

UNLABELLED:Traditional methods for sequence comparison and phylogeny reconstruction rely on pair wise and multiple sequence alignments. But alignment could not be directly applied to whole genome/proteome comparison and phylogenomic studies due to their high computational complexity. Hence alignment-free methods became popular in recent years. Here we propose a fast alignment-free method for whole genome/proteome comparison and phylogeny reconstruction using higher order Markov model and chaos game representation. In the present method, we use the transition matrices of higher order Markov models to characterize amino acid or DNA sequences for their comparison. The order of the Markov model is uniquely identified by maximizing the average Shannon entropy of conditional probability distributions. Using one-dimensional chaos game representation and linked list, this method can reduce large memory and time consumption which is due to the large-scale conditional probability distributions. To illustrate the effectiveness of our method, we employ it for fast phylogeny reconstruction based on genome/proteome sequences of two species data sets used in previous published papers. Our results demonstrate that the present method is useful and efficient. AVAILABILITY AND IMPLEMENTATION:The source codes for our algorithm to get the distance matrix and genome/proteome sequences can be downloaded from ftp://121.199.20.25/. The software Phylip and EvolView we used to construct phylogenetic trees can be referred from their websites.

关键词： Alignment-free whole proteome comparison Chaos game representation Higher order Markov model Phylogenetic tree Shannon entropy

来源：评论

学校读者我要写书评

暂无评论

Idea creation of creative computing based on embedding features and ontology 2016

Idea creation of creative computing based on embedding featu...

引用

3rd Multidisciplinary International Social Networks Conference, MISNC 2016, 5th ASE International Conference on Social Informatics, SocialInformatics 2016 and 7th ASE International Conference on Data Science, DS 2016

作者： Zhang, Fuquan Mao, Zijing Ding, Gangyi Zhang, Rui Lai, Junjiang School of software Beijing Institute of Technology Beijing100081 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Ji Yuan Ju Yuan Jin Shan Fuzhou Fujian350121 China Department of Electrical Engineering University of Texas at San Antonio One UTSA Circle San AntonioTX78249 United States Software Building Beijing Institute of Technology 5 South Zhongguancun Street Haidian Beijing100081 China Department of Mathematics Minjiang University Fuzhou No.150 Binzhou Road Jin Shan Fuzhou Fujian350108 China

ISBN: (纸本)9781450341295

This paper used clustering to embed features and use ontology to simulate the process of idea creation from human brain. All the technologies are applied on the frame of creative computing. We are try to display the emergence, the self-organization, the self-coordination of idea creation process of human brain. By creative computing we will try to discover how the idea coming from step by step. From this paper, you will see the process in five steps from blurry motivation to clear creative idea. © 2016 ACM.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A new logistic map based chaotic biogeography-based optimization approach for cluster analysis

A new logistic map based chaotic biogeography-based optimiza...

引用

IEEE International Conference on Progress in Informatics and Computing (PIC)

作者： Shui-Hua Wang Hui-Min Lu Yu-Jie Li Yang Wang Zhi-Min Chen Yu-Min Wei Wen-Juan Jia Fang-Yuan Liu Yu-Dong Zhang Hunan Provincial Key Laboratory of Network Investigational Technology Hunan Policy Academy Changsha Hunan China School of Computer Science and Technology Nanjing Normal University Nanjing Jiangsu China Department of Electrical Engineering CUNY New York NY USA Department of Mechanical and Control Engineering Kyushu Institute of Technology Fukuoka Prefecture Japan School of Information Engineering Yangzhou University Yangzhou Jiangsu China School of Physics and Electronic Engineering Taizhou University Taizhou Zhejiang China School of Electronic Information Shanghai Dianji University Shanghai China School of Energy and Mechanical Engineering Nanjing Normal University Nanjing Jiangsu China Key Laboratory of Intelligent Computing and Information Processing in Fujian Provincial University Quanzhou Normal University Quanzhou Fujian China

ISBN: (纸本)9781509034857

Cluster analysis is important in scientific and industrial fields. In this study, we proposed a novel chaotic biogeography-based optimization (CBBO) method, and applied it in centroid-based clustering methods. The results over three types of simulation data showed that this proposed CBBO method gave better performance than chaotic particle swarm optimization, genetic algorithm, firefly algorithm, and quantum-behaved particle swarm optimization. In all, our CBBO method is effective in centroid-based clustering.

关键词： Genetic algorithms Optimization Clustering algorithms Particle swarm optimization Algorithm design and analysis Logistics Mathematical model

来源：评论

学校读者我要写书评

暂无评论

VLSI multilayer obstacle-avoiding Steiner minimal tree construction algorithms in X-architecture

引用

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics 2015年第3期27卷 523-532页

作者： Liu, Genggeng Guo, Wenzhong Chen, Guolong College of Mathematics and Computer Sciences Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China

Steiner minimal tree is a fundamental model in VLSI routing. Further considering X-architecture, the presence of obstacles, and the requirements of multilayer routing, this paper presented an efficient algorithm based on particle swarm optimization for constructing the multilayer obstacle-avoiding X-architecture Steiner minimal tree. Edge transformation was designed to make the particles have the greater ability to change the topology of the routing tree and avoided the obstacles. The new operators combined with union-find set were designed to prevent the generation of the loops. In order to avoid obstacle and discourage the generation of vias, the penalty function related to obstacle-avoiding and vias was proposed. The proposed algorithm finally optimizes the total cost of routing tree which is the most important optimization target of the multilayer routing. The experimental results show that, the proposed algorithm is effective and superior to state-of-the-art multilayer routing algorithms on the total cost. ©, 2015, Institute of Computing Technology. All right reserved.

关键词： Multilayers

来源：评论

学校读者我要写书评

暂无评论

An architecture-based autonomous engine for services configuration and deployment in hybrid clouds 2nd

An architecture-based autonomous engine for services configu...

引用

2nd International Conference on Cloud Computing and Big Data, CloudCom-Asia 2015

作者： Liu, Yanping Lan, Xingtu Chen, Xing Feng, Xin Zheng, Xianghan Guo, Wenzhong College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of ZhiCheng Fuzhou University Fuzhou350108 China

ISBN: (纸本)9783319284293

As cloud computing offers scalability, extensibility, elasticity, flexibility and cost savings to the customers of cloud service providers, there is a growing trend towards migrating services to the cloud. Hybrid clouds, which comprise nodes both in the private cloud and in the public cloud, have emerged as a new model for service providers to deploy their services. However, to deploy services in hybrid clouds is a complex task as services are in essence distributed applications. What is more, there is heterogeneity among hybrid clouds. This article proposes an autonomous engine for services configuration and deployment in hybrid clouds. The automation is enabled by the definition of generic information model, which describes all the information relevant to the deployment and configuration of services with the same abstractions, including the required resources, service dependencies and business objectives. In addition, to shield the heterogeneity of hybrid clouds, we define mapping rules for model transformation. We also deploy a three-layer architecture application on Openstack and CloudStack to validate the correctness of our approach. © Springer International Publishing Switzerland 2015.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：