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

IEEE International Conference on Autonomous Robot systems and Competitions (ICARSC)

作者： Abbas Abdolmaleki David Simões Nuno Lau Luís Paulo Reis Gerhard Neumann DETIIUA - Electronics University of Aveiro Aveiro Portugal LIACC - Artificial Intelligence and Computer Science Laboratory University of Porto Porto Portugal IEETA - Institute of Electronics and Informatics Engineering of Aveiro University of Aveiro Aveiro Portugal DSI - Department of Information Systems University of Minho Braga Portugal CLAS - Computational Learning for Autonomous Systems Group Technische Universität Darmstadt Darmstadt Germany

Stochastic search algorithms are black-box optimizers of an objective function. They have recently gained a lot of attention in operations research, machine learning and policy search of robot motor skills due to their ease of use and their generality. However, with slightly different tasks or objective functions, many stochastic search algorithms require complete re-learning in order to adapt the solution to the new objective function or the new context. As such, we consider the contextual stochastic search paradigm. Here, we want to find good parameter vectors for multiple related tasks, where each task is described by a continuous context vector. Hence, the objective function might change slightly for each parameter vector evaluation. Contextual algorithms have been investigated in the field of policy search. However, contextual policy search algorithms typically suffer from premature convergence and perform unfavourably in comparison with state of the art stochastic search methods. In this paper, we investigate a contextual stochastic search algorithm known as Contextual Relative Entropy Policy Search (CREPS), an informationtheoretic algorithm that can learn for multiple tasks simultaneously. We extend that algorithm with a covariance matrix adaptation technique that alleviates the premature convergence problem. We call the new algorithm Contextual Relative Entropy Policy Search with Covariance Matrix Adaptation (CREPS-CMA). We will show that CREPS-CMA outperforms the original CREPS by orders of magnitude. We illustrate the performance of CREPS-CMA on several contextual tasks, including a complex simulated robot kick task.

关键词： Context Covariance matrices Linear programming Convergence Entropy Robots Search methods

来源：评论

学校读者我要写书评

暂无评论

Case study based educational tools for teaching software V&V course at undergraduate level 122

Case study based educational tools for teaching software V&V...

引用

2015 122nd ASEE Annual Conference and Exposition

作者： Manohar, Priya Acharya, Sushil Wu, Peter Y. Ansari, Ali A. Schilling, Walter W. Robert Morris University PittsburghPA United States Department of Computer and Information Systems Robert Morris University United States Virginia State University United States Software Engineering Program Milwaukee School of Engineering MilwaukeeWI United States

One of the critical problems facing software industry today is the lack of appreciation of the full benefits that can be derived from software Verification and Validation (V&V) and an associated problem of shortage of adequately trained V&V practitioners. To address this situation, software V&V course curriculum is being improved at author's institution via a NSF-funded project. The basic objectives of this project are to improve software education to make it well aligned with academic research as well as industry best practices. In addition, it is aimed that the course material could also be used to enhance on-the-job professional training in SW industry settings, thereby helping to increase the pool of professionals with contemporary V&V knowledge and skills. The new course curriculum enhancement described in this paper is guided by academic research and industry best practices that focus on four specific V&V focus areas: requirements engineering, reviews, configuration management, and testing. Among many educational tools that are being developed to achieve project objectives, the work related to the development of case studies is described here. Historically, case studies have been as educational tools in business, law and medicine but not so much in software engineering. The hypothesis is that case studies would be effective educational tools to introduce real-world professional practices into the classroom which would help the students in identifying and solving problems, and develop a perspective on knowledge application. In this paper we describe a set of V&V related casestudies that we have drawn from industry experiences and developed them as pedagogical tools. These case-studies cover several important topics in S/W V&V domain such as software testing, legal issues in software, software consumer protection, and requirements from the customers' perspectives. We will also report on the results of initial implementation of case studies related to software te

关键词：

来源：评论

学校读者我要写书评

暂无评论

ANGEL: Agent-Based Scheduling for Real-Time Tasks in Virtualized Clouds

引用

IEEE Transactions on computers 2015年第12期64卷 3389-3403页

作者： Zhu, Xiaomin Chen, Chao Yang, Laurence T. Xiang, Yang Science and Technology on Information Systems Engineering Laboratory National University of Defense Technology ChangshaHunan410073 China Department of Computer Science St. Francis Xavier University AntigonishNSB2G 2W5 Canada School of Information Technology Deakin University 221 BurwoodVIC3125 Australia

The success of cloud computing makes an increasing number of real-time applications such as signal processing and weather forecasting run in the cloud. Meanwhile, scheduling for real-time tasks is playing an essential role for a cloud provider to maintain its quality of service and enhance the system's performance. In this paper, we devise a novel agent-based scheduling mechanism in cloud computing environment to allocate real-time tasks and dynamically provision resources. In contrast to traditional contract net protocols, we employ a bidirectional announcement-bidding mechanism and the collaborative process consists of three phases, i.e., basic matching phase, forward announcement-bidding phase and backward announcement-bidding phase. Moreover, the elasticity is sufficiently considered while scheduling by dynamically adding virtual machines to improve schedulability. Furthermore, we design calculation rules of the bidding values in both forward and backward announcement-bidding phases and two heuristics for selecting contractors. On the basis of the bidirectional announcement-bidding mechanism, we propose an agent-based dynamic scheduling algorithm named ANGEL for real-time, independent and aperiodic tasks in clouds. Extensive experiments are conducted on CloudSim platform by injecting random synthetic workloads and the workloads from the last version of the Google cloud tracelogs to evaluate the performance of our ANGEL. The experimental results indicate that ANGEL can efficiently solve the real-time task scheduling problem in virtualized clouds. © 1968-2012 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A community evolution model based on visibility graph 34

A community evolution model based on visibility graph

引用

34th Chinese Control Conference, CCC 2015

作者： Hong, Wang Yan-Shen, Sun School of Information Science and Engineering Shandong Normal University Jinan China Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan China Department of Earth Sciences Zhejiang University Hangzhou China

ISBN: (纸本)9789881563897

One of the most important work to analyze networks is community detection. We present a dynamic community discovery method based on Visibility Graph. Firstly, we put forward related definitions of Visibility Graph for multi-dimensional time series. Then, we present algorithms to describe how to use Visibility Graph in finding communities in complex networks. Finally, we present algorithms to find dynamic multi-relational communities. We apply our method in some real data sets. Experimental results show that our methods do better for finding dynamic communities in complex networks. © 2015 Technical Committee on Control Theory, Chinese Association of Automation.

关键词： community discovery community evolution complex network visibility graph

来源：评论

学校读者我要写书评

暂无评论

Low-density generator matrix code for correcting errors with a small optical transponder

Low-density generator matrix code for correcting errors with...

引用

IEEE International Conference on Space Optical systems and Applications, ICSOS 2015

作者： Takenaka, Hideki Okamoto, Eiji Toyoshima, Morio Department of Space Communication Systems Laboratory Wireless Network Research Institute National Institute of Information and Communications Technology Tokyo Japan Department of Computer Science and Engineering Graduate School of Engineering Nagoya Institute of Technology Nagoya Japan

ISBN: (纸本)9781509002818

Space optical communications is studied at National Institute of information and Communications Technology, where the Small Optical TrAnsponder (SOTA) was developed and embarked on a 50-kg-class satellite. Atmospheric fluctuation is an issue to be solved in ground-to-satellite optical communication links. The SOTA has error-correcting functions using Reed-Solomon code and low-density generator matrix (LDGM) code to prevent the omission of data from signal fading owing to atmospheric fluctuations. In this paper, we present a demonstration that involves sending image data taken by an onboard camera with LDGM code via satellite-to-ground optical communication links. Our demonstration reveals how to correct the omission of data resulting from atmospheric turbulence and tracking errors. © 2015 IEEE.

关键词： Reed-Solomon codes

来源：评论

学校读者我要写书评

暂无评论

VCLT: An accurate trajectory tracking attack based on crowdsourcing in VANETs 15th

VCLT: An accurate trajectory tracking attack based on crowds...

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Lin, Chi Liu, Kun Xu, Bo Deng, Jing Yu, Chang Wu Wu, Guowei School of Software Dalian University of Technology Dalian116621 China Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province Dalian116621 China Department of Computer Science University of North Carolina at Greensboro GreensboroNC27412 United States Department of Computer Science and Information Engineering Chung Hua University Hsinchu Taiwan

ISBN: (纸本)9783319271361

We investigate trajectory tracking in Vehicular Ad hoc Networks (VANETs) in this work. Previous tracking methods suffer from low accuracy, large overhead, and big error. In this paper, we propose a Vehicular Crowdsourcing Localization and Tracking (VCLT) scheme for mounting a trajectory tracking attack. In our scheme, crowdsourcing technique is applied to sample the location information of certain users. Then matrix completion algorithm is used to generate our predictions of the users’ trajectories. To alleviate the error disturbance of the recovered location data, Kalman filter technique is implemented and the trajectories of certain users are recovered with accuracy. At last, extensive simulations are conducted to show the performance of our scheme. Simulations results reveal that the proposed approach is able to accurately track the trajectories of certain users. © Springer International Publishing Switzerland 2015.

关键词： Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Autonomous migration of virtual machine based on OpenStack

引用

International Journal of Hybrid information Technology 2016年第8期9卷 65-84页

作者： Zhou, Li Yu, Zhuoer Zhang, Jilin Wan, Jian Wu, Yusen School of Computer and Technology Hangzhou Dianzi University Hangzhou310018 China Key Laboratory of Complex Systems Modeling and Simulation Ministry of Education Hangzhou China College of Electrical Engineering Zhejiang University Hangzhou310058 China School of Information and Electronic engineering Zhejiang University of Science & Technology Hangzhou310023 China Zhejiang Provincial Engineering Center on Media Data Cloud Processing and Analysis HangzhouZhejiang China

For the problem of compute nodes load unbalance leads to the overload node impact VM performance and the underload node waste electrical energy. Dynamic VM consolidation is an efficient approach for improving the utilization of servers and reducing energy costs. In this paper, we introduce dynamic consolidation into OpenStack and implement AMVM based on OpenStack. AMVM collect and analyze all performance data of VM and compute node in OpenStack. Then AMVM automatically schedules VM live migrate to the most appropriate node according to the real-time load of all compute nodes. Then we use hybrid-copy instead of pre-copy in AMVM to improve the efficiency of VM live migration. Finally, we analyze the performance of hybrid-copy, hybrid-copy can reduce page faults compared with post-copy and reduce total data transferred compared with pre-copy. © 2016 SERSC.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

A mapreduce reinforced distributed sequential pattern mining algorithm 15th

A mapreduce reinforced distributed sequential pattern mining...

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Yu, Xiao Liu, Jin Liu, Xiao Ma, Chuanxiang Li, Bin State Key Laboratory of Software Engineering Computer School Wuhan University Wuhan430072 China Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai200241 China School of Computer Science and Information Engineering Hubei University Wuhan430062 China Economics and Management School Wuhan University Wuhan430072 China

ISBN: (纸本)9783319271217

Redesign and reimplementation of traditional sequential pattern mining algorithms on distributed computing frameworks are essential for dealing with big data. Along the way, the critical issue is how to minimize the communication overhead of the distributed sequential pattern mining algorithm and maximize its execution efficiency by balancing the workload of distributed computing resources. To address such an issue, this paper proposes a MapReduce reinforced distributed sequential pattern mining algorithm DGSP (Distributed GSP algorithm based on MapReduce), which consists of two MapReduce jobs. The "two-jobs" structure of DGSP can effectively reduce the communication overhead of the distributed sequential pattern mining algorithm. DGSP also enables optimizing the workload balance and the execution efficiency of distributed sequential pattern mining by evenly partitioning the database and assigning the fragments to Map workers. Experimental results indicate that DGSP can significantly improve the overall performance, scalability and fault tolerance of sequential pattern mining on big data. © Springer International Publishing Switzerland 2015.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Challenging local realism with human choices

arXiv

引用

arXiv 2018年

作者： Abellán, C. Acín, A. Alarcón, A. Alibart, O. Andersen, C.K. Andreoli, F. Beckert, A. Beduini, F.A. Bendersky, A. Bentivegna, M. Bierhorst, P. Burchardt, D. Cabello, A. Cariñe, J. Carrasco, S. Carvacho, G. Cavalcanti, D. Chaves, R. Cortés-Vega, J. Cuevas, A. Delgado, A. de Riedmatten, H. Eichler, C. Farrera, P. Fuenzalida, J. García-Matos, M. Garthoff, R. Gasparinetti, S. Gerrits, T. GhafariJouneghani, F. Glancy, S. Gómez, E.S. González, P. Guan, J.-Y. Handsteiner, J. Heinsoo, J. Heinze, G. Hirschmann, A. Jiménez, O. Kaiser, F. Knill, E. Knoll, L.T. Krinner, S. Kurpiers, P. Larotonda, M.A. Larsson, J.-Å. Lenhard, A. Li, H. Li, M.-H. Lima, G. Liu, B. Liu, Y. López Grande, I.H. Lunghi, T. Ma, X. Magaña-Loaiza, O.S. Magnard, P. Magnoni, A. Martí-Prieto, M. Martínez, D. Mataloni, P. Mattar, A. Mazzera, M. Mirin, R.P. Mitchell, M.W. Nam, S. Oppliger, M. Pan, J.-W. Patel, R.B. Pryde, G.J. Rauch, D. Redeker, K. Rieländer, D. Ringbauer, M. Roberson, T. Rosenfeld, W. Salathé, Y. Santodonato, L. Sauder, G. Scheidl, T. Schmiegelow, C.T. Sciarrino, F. Seri, A. Shalm, L.K. Shi, S.-C. Slussarenko, S. Stevens, M.J. Tanzilli, S. Toledo, F. Tura, J. Ursin, R. Vergyris, P. Verma, V.B. Walter, T. Wallraff, A. Wang, Z. Weinfurter, H. Weston, M.M. White, A.G. Wu, C. Xavier, G.B. You, L. Yuan, X. Zeilinger, A. Zhang, Q. Zhang, W. Zhong, J. 08860 Spain ICREA Institució Catalana de Recerca i Estudis Avançats Barcelona08010 Spain Center for Optics and Photonics MSI-Nucleus for Advanced Optics Universidad de Concepción Casilla 4016 Concepción Chile Departamento de Ingeniería Eléctrica Universidad de Concepción 160-C Concepción Chile Parc Valrose Nice Cedex 206108 France Quantum Device Lab Department of Physics ETH Zurich ZurichCH-8093 Switzerland Dipartimento di Fisica Sapienza Università di Roma RomaI-00185 Italy Departamento de Computación FCEyN UBA and ICC CONICET Ciudad Universitaria Pabellón 1 Buenos Aires1428 Argentina National Institute of Standards and Technology 325 Broadway BoulderCO80305 United States Ludwig-Maximilians-Universität München80799 Germany Departamento de Física Aplicada II Universidad de Sevilla Sevilla41012 Spain Departamento de Física Universidad de Concepción 160-C Concepción Chile International Institute of Physics Federal University of Rio Grande do Norte Natal59070-405 Brazil Austrian Academy of Sciences Boltzmanngasse 3 Vienna1090 Austria Centre for Quantum Computation and Communication Technology Griffith University BrisbaneQLD4111 Australia Centre for Quantum Dynamics Griffith University BrisbaneQLD4111 Australia Shanghai Branch National Laboratory for Physical Sciences at Microscale Dept. of Modern Physics University of Science and Technology of China Shanghai230026 China DEILAP CITEDEF & CONICET J.B. de La Salle 4397 1603 Villa Martelli Buenos Aires Argentina Departamento de Física FCEyN UBA and IFIBA Ciudad Universitaria Conicet Pabellón 1 Buenos Aires1428 Argentina Department of Electrical Engineering Linköping University Linköping581 83 Sweden State Key Laboratory of Functional Materials for Informatics Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences Shanghai200050 China CAS Center for Excellence in Superconducting Electronics Shanghai200050 China School of Computer NUDT

A Bell test is a randomized trial that compares experimental observations against the philosophical worldview of local realism1, in which the properties of the physical world are independent of our observation of them and no signal travels faster than light. A Bell test requires spatially distributed entanglement, fast and high-efficiency detection and unpredictable measurement settings2,3. Although technology can satisfy the first two of these requirements4–7, the use of physical devices to choose settings in a Bell test involves making assumptions about the physics that one aims to test. Bell himself noted this weakness in using physical setting choices and argued that human ‘free will’ could be used rigorously to ensure unpredictability in Bell tests8. Here we report a set of local-realism tests using human choices, which avoids assumptions about predictability in physics. We recruited about 100,000 human participants to play an online video game that incentivizes fast, sustained input of unpredictable selections and illustrates Bell-test methodology9. The participants generated 97,347,490 binary choices, which were directed via a scalable web platform to 12 laboratories on five continents, where 13 experiments tested local realism using photons5,6, single atoms7, atomic ensembles10, and superconducting devices11. Over a 12-hour period on 30 November 2016, participants worldwide provided a sustained data flow of over 1,000 bits per second to the experiments, which used different human-generated data to choose each measurement setting. The observed correlations strongly contradict local realism and other realistic positions in bipartite and tripartite12 scenarios. Project outcomes include closing the ‘freedom-of-choice loophole’ (the possibility that the setting choices are influenced by ‘hidden variables’ to correlate with the particle properties13), the utilization of video-game methods14 for rapid collection of human generated randomness, and the use of network

关键词： Testing

来源：评论

学校读者我要写书评

暂无评论

SQL-like big data environments: Case study in clinical trial analytics

SQL-like big data environments: Case study in clinical trial...

引用

IEEE International Conference on Big Data

作者： Akshay Grover Jay Gholap Vandana P. Janeja Yelena Yesha Raghu Chintalapati Harsh Marwaha Kunal Modi Computer Science and Electrical Engineering Information Systems University of Maryland Baltimore County Ekagra Software Technologies

Big Data deals with enormous volumes of complex and exponentially growing data sets from multiple sources. With rapid growth in technology, we are now able to generate immense amount of data in almost any field imaginable including physical, biological and biomedical sciences. With the diversity and amount of data in health care industry there is an increasing need to evaluate the components in big data frameworks and gauge their adaptability to analytics techniques. However, a key step in adapting big data tools is the portability of relational databases to big data environment. Since SQL is considered to be the de-facto language for interactive queries, in this paper, we evaluate the performance of SQL-like big data solutions for the portability of existing relational databases. Our work focuses on benchmarking multiple SQL-like big data technologies over Hadoop based distributed file system (HDFS) for Study Data Tabulation Model (SDTM) used in clinical trial databases for improving the efficiency of research in clinical trials. We use publically available clinical trial data (from National Institute on Drug Abuse (NIDA)), which follows SDTM, as a test bed to measure key parameters like usability, adaptability, modularity, robustness and efficiency of these solutions. With the intention to demonstrate how current clinical trial functionality can be replicated on a big data backend with high SQL-like functionality, we evaluate several types of ad-hoc SQL queries.

关键词： Big data Clinical trials Data mining Facebook Distributed databases Data models Engines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：