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

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

来源：评论

学校读者我要写书评

暂无评论

Do architectural design decisions improve the understanding of software architecture? Two controlled experiments 22

Do architectural design decisions improve the understanding ...

引用

22nd International Conference on Program Comprehension, ICPC 2014

作者： Shahin, Mojtaba Liang, Peng Li, Zengyang State Key Lab of Software Engineering School of Computer Wuhan University China Department of Computer Engineering Neyriz Branch Islamic Azad University Iran Department of Computer Science VU University Amsterdam Netherlands Department of Computing Science University of Groningen Netherlands

ISBN: (纸本)9781450328791

Architectural design decision (ADD) and its design rationale, as a paradigm shift on documenting and enriching architecture design description, is supposed to facilitate the understanding of architecture and the reasoning behind the design rationale, which consequently improves the architecting process and gets better architecture design results. But the lack of empirical evaluation that supports this statement is one of the major reasons that prevent industrial practitioners from using ADDs in their daily architecting activities. In this paper, we conducted two controlled experiments, as a family of experiments, to investigate how presence of ADDs can improve the understanding of architecture. The main results of our experiments are: (i) using ADDs and their rationale in architecture documentation does not affect the time needed for completing architecture design tasks;(ii) one experiment and the family of experiments achieved a significantly better understanding of architecture design when using ADDs;and (iii) with regard to the correctness of architecture understanding, more experienced participants benefited more from ADDs in comparison with less experienced ones. Copyright © 2014 ACM.

关键词： software architecture

来源：评论

学校读者我要写书评

暂无评论

Prototype tool for supporting a formal engineering approach to service-based software modeling

Prototype tool for supporting a formal engineering approach ...

引用

3rd International Workshop on Structured Object-Oriented Formal Language and Method, SOFL+MSVL 2013

作者： Miao, Weikai Liu, Shaoying Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China Department of Computer Science Hosei University Tokyo Japan

ISBN: (纸本)9783319049144

Despite the advances in service-based software modeling, few existing approaches and tools support a systematic engineering process in which precise specification construction and accurate web service selection are integrated coherently. Due to this reality, how to carry out service-based software modeling so that existing services can be accurately discovered, selected, and effectively reused in the system under development is still a challenge. To solve this problem, this paper describes a prototype tool that supports a formal engineering framework for service-based software modeling. Formal specification can be constructed in an evolutionary manner;meanwhile, appropriate services are discovered and selected through the specification evolution. We illustrate the basic principle underlying the tool. The tool design and its implementation are also described. An example is presented to demonstrate major features of this tool. © 2014 Springer International Publishing Switzerland.

关键词： Formal specification

来源：评论

学校读者我要写书评

暂无评论

PEVTS: Privacy-Preserving Electric Vehicles Test-Bedding Scheme

PEVTS: Privacy-Preserving Electric Vehicles Test-Bedding Sch...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Xu Yang Joseph K. Liu Wei Wu Man Ho Au Willy Susilo Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University China and State Key Laboratory of Cryptology Beijing China Faculty of Information Technology Monash University Australia Department of Computing Hong Kong Polytechnic University Hong Kong School of Computer Science and Software Engineering University of Wollongong Australia

Electric Vehicle (EV) infrastructure is relatively new in many countries. Due to the recency of an EV infrastructure, it is important to carry out a series of testing programs. Furthermore, authenticity for collection of data is necessary for testing programs in order to provide accurate results. At the same time, user privacy should not cease since tracing one's daily logistic movements or behaviour from the EV testing programs means breaching one's privacy. In this paper, we propose a novel solution PEVTS for enabling both data authenticity and user privacy concurrently. Our proposed system provides great flexibility to the authority to choose any arbitrary set of authenticated users for testing in every time period. At the same time, it provides anonymity for all participating users. Yet it can trace any vehicle within a time period for statistical purpose. We give a detailed description of our system. We also implement the prototype of our system to show its practicality.

关键词： Testing Privacy Cryptography Electric vehicles Data privacy Authentication

来源：评论

学校读者我要写书评

暂无评论

Sequential strategy for software process measurement that uses Statistical Process Control 8

Sequential strategy for software process measurement that us...

引用

8th Malaysian software engineering Conference, MySEC 2014

作者： Alhassan, Muhammad Abubakar Jawawi, Dayang N. A. Department of Computer Science Faculty of Science Federal University Dutse P.M.B 7156 Jigawa Nigeria Department of Software Engineering Faculty of Computing Universiti Teknologi Malaysia Skudai Johor81310 Malaysia

ISBN: (纸本)9781479954391

Effective measurement for successful Statistical Process Control (SPC) implementations across any level of Capability Maturity Model (CMM) is not a very straightforward activity. Based on CMM standard, SPC is only applicable to its higher maturity levels so as to tackle quantitative process management issues like out-of-control process and to point out further areas of process improvements. This study reveals that;SPC can be used at CMM level 2 to repeatedly control process but with some difficulties. The difficulty of accurate process measurement for successful SPC implementation is addressed by proposing a Sequential Strategy for Process Measurement (SSPM). This strategy can support software organization's process measurement activities for process control and management. © 2014 IEEE.

关键词： Statistical process control

来源：评论

学校读者我要写书评

暂无评论

Deadline Constrained Cloud computing Resources Scheduling through an Ant Colony System Approach

Deadline Constrained Cloud Computing Resources Scheduling th...

引用

International Conference on Cloud computing Research and Innovation (ICCCRI)

作者： Zong-Gan Chen Zhi-Hui Zhan Hai-Hao Li Ke-Jing Du Jing-Hui Zhong Yong Wee Foo Yun Li Jun Zhang Department of Computer Science Sun Yat-sen University Guangzhou P. R. China Ministry of Education Key Laboratory of Machine Intelligence and Advanced Computing P.R. China Ministry of Education Engineering Research Center of Supercomputing Engineering Software P.R. China School of Computer Science and Engineering South China University of Technology Guangzhou P. R. China School of Computer Engineering Nanyang Technological University Singapore School of Engineering University of Glasgow Glasgow U.K. Nanyang Polytechnic School of Engineering Singapore

Cloud computing resources scheduling is essential for executing workflows in the cloud platform because it relates to both execution time and execution cost. In this paper, we adopt a model that optimizes the execution cost while meeting deadline constraints. In solving this problem, we propose an Improved Ant Colony System (IACS) approach featuring two novel strategies. Firstly, a dynamic heuristic strategy is used to calculate a heuristic value during an evolutionary process by taking the workflow topological structure into consideration. Secondly, a double search strategy is used to initialize the pheromone and calculate the heuristic value according to the execution time at the beginning and to initialize the pheromone and calculate heuristic value according to the execution cost after a feasible solution is found. Therefore, the proposed IACS is adaptive to the search environment and to different objectives. We have conducted extensive experiments based on workflows with different scales and different cloud resources. We compare the result with a particle swarm optimization (PSO) approach and a dynamic objective genetic algorithm (DOGA) approach. Experimental results show that IACS is able to find better solutions with a lower cost than both PSO and DOGA do on various scheduling scales and deadline conditions.

关键词： Cloud computing Processor scheduling Encoding Scheduling Optimization Heuristic algorithms Schedules

来源：评论

学校读者我要写书评

暂无评论

Large-scale supervised multimodal hashing with semantic correlation maximization 28

Large-scale supervised multimodal hashing with semantic corr...

引用

28th AAAI Conference on Artificial Intelligence, AAAI 2014, 26th Innovative Applications of Artificial Intelligence Conference, IAAI 2014 and the 5th Symposium on Educational Advances in Artificial Intelligence, EAAI 2014

作者： Zhang, Dongqing Li, Wu-Jun Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China National Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China

ISBN: (纸本)9781577356790

Due to its low storage cost and fast query speed, hashing has been widely adopted for similarity search in multimedia data. In particular, more and more attentions have been payed to multimodal hashing for search in multimedia data with multiple modalities, such as images with tags. Typically, supervised information of semantic labels is also available for the data points in many real applications. Hence, many supervised multimodal hashing (SMH) methods have been proposed to utilize such semantic labels to further improve the search accuracy. However, the training time complexity of most existing SMH methods is too high, which makes them unscalable to large-scale datasets. In this paper, a novel SMH method, called semantic correlation maximization (SCM), is proposed to seamlessly integrate semantic labels into the hashing learning procedure for large-scale data modeling. Experimental results on two real-world datasets show that SCM can significantly outperform the state-of-the-art SMH methods, in terms of both accuracy and scalability. Copyright © 2014, Association for the Advancement of Artificial Intelligence.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Distributed stochastic ADMM for matrix factorization 14

Distributed stochastic ADMM for matrix factorization

引用

23rd ACM International Conference on Information and Knowledge Management, CIKM 2014

作者： Yu, Zhi-Qin Shi, Xing-Jian Yan, Ling Li, Wu-Jun Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong National Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China

ISBN: (纸本)9781450325981

Matrix factorization (MF) has become the most popular technique for recommender systems due to its promising performance. Recently, distributed (parallel) MF models have received much attention from researchers of big data community. In this paper, we propose a novel model, called distributed stochastic alternating direction methods of multipliers (DS-ADMM), for large-scale MF problems. DS-ADMM is a distributed stochastic variant of ADMM. In particular, we first devise a new data split strategy to make the distributed MF problem fit for the ADMM framework. Then, a stochastic ADMM scheme is designed for learning. Finally, we implement DS-ADMM based on message passing interface (MPI), which can run on clusters with multiple machines (nodes). Experiments on several data sets from recommendation applications show that our DS-ADMM model can outperform other state-of-the-art distributed MF models in terms of both efficiency and accuracy. Copyright 2014 ACM.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Supervised hashing with latent factor models 14

Supervised hashing with latent factor models

引用

37th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2014

作者： Zhang, Peichao Zhang, Wei Li, Wu-Jun Guo, Minyi Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China National Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China

ISBN: (纸本)9781450322591

Due to its low storage cost and fast query speed, hashing has been widely adopted for approximate nearest neighbor search in large-scale datasets. Traditional hashing methods try to learn the hash codes in an unsupervised way where the metric (Euclidean) structure of the training data is preserved. Very recently, supervised hashing methods, which try to preserve the semantic structure constructed from the semantic labels of the training points, have exhibited higher accuracy than unsupervised methods. In this paper, we propose a novel supervised hashing method, called latent factor hashing (LFH), to learn similarity-preserving binary codes based on latent factor models. An algorithm with convergence guarantee is proposed to learn the parameters of LFH. Furthermore, a linear-time variant with stochastic learning optimization is proposed for training LFH on large-scale datasets. Experimental results on two large datasets with semantic labels show that LFH can achieve superior accuracy than state-of-the-art methods with comparable training time. Copyright 2014 ACM.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Visually impaired orientation techniques in unfamiliar indoor environments: A user study 14

Visually impaired orientation techniques in unfamiliar indoo...

引用

16th International ACM SIGACCESS Conference on Computers and Accessibility, ASSETS 2014

作者： Alkhanifer, Abdulrhman A. Ludi, Stephanie Computing and Information Science Program Rochester Institute of Technology RochesterNY14623 United States Software Engineering Department Rochester Institute of Technology RochesterNY14623 United States

ISBN: (纸本)9781450327206

Individuals who are visually impaired encounter a number of challenges when attempting to orientate their own position or the position of others in relation to them within an unfamiliar indoor environment. To design an orientation assistive technology, it is crucial to understand the factors that reduce the user's sense of orientation. In this work, we discuss the disorientation factors that resulted from three user studies, which were conducted to formulate the basic requirements for an orientation assistive technology to assist visually impaired individuals in unfamiliar indoor areas. Using the feedback we elicited from one survey and two interview studies, we shed light on the factors that reduce the user's sense of orientation in unfamiliar buildings such as noise and traffic levels.

关键词： Assistive technology

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：