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

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8886卷 644-655页

作者： Zhan, Zhi-Hui Zhang, Ge-Yi Ying-Lin Gong, Yue-Jiao Zhang, Jun Department of Computer Science Sun Yat-sen University Guangzhou510006 China Key Lab. Machine Intelligence and Advanced Computing Ministry of Education China Engineering Research Center of Supercomputing Engineering Software MOE China Key Lab. Software Technology Education Department Guangdong Province China School of Sofware Engineering Sun Yat-sen University Guangzhou510006 China Department of Psychology Sun Yat-sen university 510275 China

This paper proposes to solve the task scheduling problem in cloud computing by using a load balance aware genetic algorithm (LAGA) with Minmin and Max-min methods. Task scheduling problems are of great importance in cloud computing, and become especially challenging when taking load balance into account. Our proposed LAGA algorithm has several advantages when solving this kind of problems. Firstly, by introducing the time load balance (TLB) model to help establish the fitness function with makespan, the algorithm benefits from the ability to find the solution that performs best on load balance among a set of solutions with the same makespan. More importantly, the interaction between makespan and TLB helps the algorithm to minimize makespan in the same time. Secondly, Min-min and Max-min methods are used to produce promising individuals at the beginning of evolution, leading to noticeable improvement of evolution efficiency. We evaluated LAGA on several task scheduling problems and compared with a Min-min, Max-min improved version of genetic algorithm (MMGA), which does not use the TLB strategy. The results show that LAGA can obtain very competitive results with good load balancing properties, and outperform MMGA in both makespan and TLB objectives. © Springer International Publishing Switzerland 2014.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on load balancing strategy based on middleware

引用

ICIC Express Letters 2014年第9期8卷 2655-2661页

作者： Gu, Xiaoying Liu, Yongshan Man, Yubao Department of Information Science and Engineering Qinhuangdao 066004 China The Key Lab. for Computer Virtual Tech. and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave Qinhuangdao 066004 China Data Industry Research Lab Qinhuangdao 066004 China

According to the former research achievements about load balancing strategy, considering the load distribution, the load condition of service node and the number of user connections, we propose a load balancing strategy based on middleware. According to the cluster service load and the number of user connections, the requests from user will be reasonably allocated to each service node by using middleware technology, then service node and requested user establish a temporary connection, after all the requests of this user are processed by this node. Experiments show that, this strategy reduces the number of requests for allocation, improves the resource utilization rate of cluster system and load balancing degree, and effectively suppresses the load jitter of system. © 2014 ISSN 1881-803X.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Joint channel assignment, stable routing and adaptive power control in mobile cognitive networks

Joint channel assignment, stable routing and adaptive power ...

引用

IEEE Conference on Wireless Communications and Networking

作者： Jin Zhou Feilong Tang Jie Li Wenchao Xu Minyi Guo School of Software Shanghai Jiao Tong University Shanghai China State Key Lab. for Novel Software Technology Nanjing University P. R. China Department of Computer Science & Engineering Shanghai Jiao Tong University Shanghai China Faculty of Engineering Information and Systems University of Tsukuba Japan Department of Communication Engineering East China Normal University Shanghai China

ISBN: (纸本)9781479984077

Most existing routing algorithms assume wireless nodes use maximal transmission power or set up the power at the beginning of the network configuration. These static approaches potentially introduce signal interference that can be mitigated through power control. In this paper, we propose a Joint Channel assignment, stable Routing and adaptive Power control (JCRP) approach that dynamically controls the transmission power to avoid the channel interference for improving the channel utility. Our JCRP allows a node to control its transmission power to a certain value at which it has a longest channel conflict-free time. Besides, we propose a novel routing metric integrated selecting stability (ISS) to measure the quality of links, which considers node mobility and channel interference, together with the dynamical power control. The simulation results demonstrate that our JCRP significantly outperforms the related routing algorithms in terms of network throughput.

关键词： Interference Power control Routing Stability analysis Nickel Channel allocation Measurement

来源：评论

学校读者我要写书评

暂无评论

A load balancing algorithm for multi-root ONS

引用

Journal of Computational Information systems 2014年第7期10卷 2735-2742页

作者： Hao, Fengzhai Liu, Yongshan Chen, Wei College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao 066004 China Data Industry Research Lab. Qinhuangdao 066004 China

In order to solve the overload problem of root ONS in the EPC network, a load balancing algorithm based on multi-root ONS is proposed. Based on the proposed load balancing ONS (LB ONS) architecture, the ONS Root is defined to have two states, idle or busy. According to CPU utilization and memory utilization of the ONS Root and in combination with threshold controlling to periodically update the ONS Root states, which makes the requests coming from client applications be transferred to an ONS Root which is idle. Experiment results show that the algorithm can reduce query hops and query delays effectively and offer lookup service efficiently. © 2014 Binary Information Press.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Edge collapse mesh simplification algorithm based on detail features preserving

引用

Journal of Computational Information systems 2014年第7期10卷 2883-2890页

作者： Jia, Qi Liu, Yongshan Gu, Xiaoying College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao 066004 China Data Industry Research Lab. Qinhuangdao 066004 China

The existing model simplification algorithm in simplified speed and quality can't reach a better compromise, so we present an improved quadric error metrics edge collapse mesh simplification algorithm. This algorithm makes the local region unevenness of vertex, the local region average area of vertex and edge length as constraint factors add to the edge collapse cost, by changing the order of the edge collapse to retain the important detail features of the original model. New vertex position is calculated on the different types of edge, keeping the boundary characteristics of the mesh model. Experimental results show that the improved algorithm not only runs faster, but also maintains a higher degree on the model feature region. © 2014 Binary Information Press.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

A graph database based crowdsourcing infrastructure for modelling and searching code structure 2014

A graph database based crowdsourcing infrastructure for mode...

引用

6th Asia-Pacific Symposium on Internetware, Internetware 2014

作者： Lin, Zeqi Zhao, Junfeng Xie, Bing Institute of Software School of Electronic Engineering and Computer Peking University Beijing100871 China Key Lab. of High Confidence Software Technologies Science Ministry of Education Beijing100871 China

ISBN: (纸本)9781450334013

software reuse offers a solution to eliminate repeated work and improve efficiency and quality in the software development. In order to reuse existing software resources, software developers usually need to understand code structure of them. However, code structure is usually too complex to figure out. Therefore, it is helpful to demonstrate software developers the code structure they want to know. This paper presents a graph database based crowdsourcing infrastructure for modelling and searching code structure. In this paper, a graph based modelling paradigm of code structure is provided, which solves the problem that how code structure should be demonstrated. software developers' search purposes are analyzed by natural language processing technique. A crowdsourcing mechanism is provided to integrate different code structure analysis algorithms for these different search purposes. Our work improves the efficiency of software reuse, and it is validated through an industrial case study. © 2014 ACM.

关键词： computer software reusability

来源：评论

学校读者我要写书评

暂无评论

Positional translation language model for ad-hoc information retrieval

Positional translation language model for ad-hoc information...

引用

18th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, PAKDD 2014

作者： Tu, Xinhui Luo, Jing Li, Bo He, Tingting Gu, Jinguang College of Computer Science and Technology Wuhan University of Science and Technology Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China Department of Computer Science Central China Normal University Wuhan China State Key Lab. of Software Engineering Wuhan University Wuhan China

ISBN: (纸本)9783319066042

Most existing language modeling approaches are based on the term independence hypothesis. To go beyond this assumption, two main directions were investigated. The first one considers the use of the proximity features that capture the degree to which search terms appear close to each other in a document. Another one considers the use of semantic relationships between words. Previous studies have proven that these two types of information, including term proximity features and semantic relationships between words, are both useful to improve retrieval performance. Intuitionally, we can use them in combination to further improve retrieval performance. Based on this idea, this paper propose a positional translation language model to explicitly incorporate both of these two types of information under language modeling framework in a unified way. In the first step, we present a proximity-based method to estimate word-word translation probabilities. Then, we define a translation document model for each position of a document and use these document models to score the document. Experimental results on standard TREC collections show that the proposed model achieves significant improvements over the state-of-the-art models, including positional language model, and translation language models. © 2014 Springer International Publishing.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

CLSIFT: An optimization study of the scale invariance feature transform on GPUs

CLSIFT: An optimization study of the scale invariance featur...

引用

15th IEEE International Conference on High Performance Computing and Communications, HPCC 2013 and 11th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, EUC 2013

作者： Wang, Weiyan Zhang, Yunquan Guoping, Long Yan, Shengen Jia, Haipeng Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences China State Key Laboratory of Computing Science Institute of Software Chinese Academy of Sciences China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769550886

Scale Invariance Feature Transform (SIFT) is quite suitable for image matching because of its invariance to image scaling, rotation and slight changes in illumination or viewpoint. However, due to high computation complexity it's technically challenging to deploy SIFT in real time application situations. To address this problem, we propose CLSIFT, an OpenCL based highly speeded up and performance portable SIFT solution. Important optimization techniques employed in CLSIFT such as: (1) For less global memory traffic, independent logical functions are merged into the same kernel to reuse data.(2) loop buffers are introduced in for data and intermediate results reusing.(3)Task queue used to schedule threads in the same branch to remove branch divergences. (4) Data partition is based on the statics patterns for workload balance among workgroups. (5) Overlap of CPU time and better parallel strategies are used too. With all mentioned efforts, CLSIFT processes lena. jpg at 74.2 FPS and 43.4FPS respectively on NVidia and AMD GPUS, much higher than CPU's nearly 10 FPS and the known fastest SIFTGPU's 39.8 FPS and 13FPS. Moreover in a quantitative comparison approach we analyze those successful strategies beating SIFTGPU, a famous existing GPU implementation. Additionally, we observe and conclude that NVidia GPU achieves better occupancy and performance due to some factors. Finally, we summarize some techniques and empirical guiding principles that may be shared by other applications on GPU. © 2013 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Hybrid annex: An AADL extension for continuous behavior and cyber-physical interaction modeling

Hybrid annex: An AADL extension for continuous behavior and ...

引用

ACM SIGAda's Annual International Conference High Integrity Language Technology, HILT 2014

作者： Ahmad, Ehsan Larson, Brian R. Barrett, Stephen C. Zhan, Naijun Dong, Yunwei State Key Lab. of Comput. Sci. Inst. of Software Northwestern Polytechnical University Chinese Academy of Sciences China Computing and Information Systems Kansas State University ManhattanKS66506 United States State Key Lab. of Comput. Sci. Inst. of Software Chinese Academy of Sciences Beijing100190 China School of Computer Science Northwestern Polytechnical University Xi'an710129 China

ISBN: (纸本)9781450332170

Correct design, and system-level dependability prediction of highly-integrated systems demand the collocation of requirements and architectural artifacts within an integrated development environment. Hybrid systems, having dependencies and extensive interactions between their control portion and their environment, further intensify this need. AADL is a model-based engineering language for the architectural design and analysis of embedded control systems. Core AADL has been extended with a mechanism for discrete behavioral modeling and analysis of control systems, but not for the continuous behavior of the physical environment. In this paper, we introduce a lightweight language extension to AADL called the Hybrid Annex for continuoustime modeling, fulfilling the need for integrated modeling of the computing system along with its physical environment in their respective domains. The Isolette system described in the FAA Requirement Engineering Management Handbook is used to illustrate continuous behavior modeling with the proposed Hybrid Annex. Copyright 2014 ACM.

关键词： Hybrid systems

来源：评论

学校读者我要写书评

暂无评论

On deploying relays for connected indoor sensor networks

引用

Journal of Communications and Networks 2014年第3期16卷 335-343页

作者： Zhu, Yanmin Xue, Cuiyao Cai, Haibin Yu, Jiadi Ni, Lei Li, Minglu Li, Bo Shanghai Key Lab. of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China Department of Computer Science and Engineering Shanghai Jiao Tong University China Software Engineering Institute East China Normal University China Shanghai Jiao Tong University Hong Kong University of Science and Technology Hong Kong

This paper considers the crucial problem of deploying wireless relays for achieving a connected wireless sensor network in indoor environments, an important aspect related to the management of the sensor network. Several algorithms have been proposed for ensuring full sensing coverage and network connectivity. These algorithms are not applicable to indoor environments because of the complexity of indoor environments, in which a radio signal can be dramatically degraded by obstacles such as walls. We first prove theoretically that the indoor relay placement problem is NP-hard. We then predict the radio coverage of a given relay deployment in indoor environments. We consider two practical scenarios;wire-connected relays and radio-connected relays. For the network with wire-connected relays, we propose an efficient greedy algorithm to compute the deployment locations of relays for achieving the required coverage percentage. This algorithm is proved to provide a Hn factor approximation to the theoretical optimum, where Hn = 1 +1/2+⋯+1/n= ln(n) +1, and n is the number of all grid points. In the network with radio-connected relays, relays have to be connected in an ad hoc mode. We then propose an algorithm based on the previous algorithm for ensuring the connectivity of relays. Experimental results demonstrate that the proposed algorithms achieve better performance than baseline algorithms. © 2014 KICS.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：