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

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： L. Cannelli F. Facchinei V. Kungurtsev G. Scutari School of Industrial Engineering Purdue University USA Dept. of Computer Control and Management Engineering University of Rome "La Sapienza" Italy Agent Technology Center Czech Technical University in Prague Czech Republic

ISBN: (纸本)9781509041183

We propose a novel parallel asynchronous algorithmic framework for the minimization of the sum of a smooth (nonconvex) function and a convex (nonsmooth) regularizer. The framework hinges on Successive Convex Approximation (SCA) techniques and on a novel probabilistic model which describes in a unified way a variety of asynchronous settings in a more faithful and exhaustive way with respect to state-of-the-art models. Key features of our framework are: i) it accommodates inconsistent read, meaning that components of the variables may be written by some cores while being simultaneously read by others;ii) it covers in a unified way several existing methods;and iii) it accommodates a variety of parallel computing architectures. Almost sure convergence to stationary solutions is proved for the general case, and iteration complexity analysis is given for a specific version of our model. Numerical results show that our scheme outperforms existing asynchronous ones.

关键词： Asynchronous algorithms big-data inconsistent read nonconvex constrained optimization Asynchronous Constrained optimization Probabilistic Model Frameworks PARALLEL PROCESSING (computerS) Parallel Lines Road Convexity core

来源：评论

学校读者我要写书评

暂无评论

Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs 19

Constant-factor approximations for asymmetric TSP on nearly-...

引用

19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016

作者： Marx, Dániel Salmasi, Ario Sidiropoulos, Anastasios Institute of Computer Science and Control Hungarian Academy of Sciences MTA SZTAKI Budapest Hungary Dept. of Computer Science and Engineering Ohio State University ColumbusOH United States Dept. of Computer Science and Engineering Dept. of Mathematics Ohio State University ColumbusOH United States

ISBN: (纸本)9783959770187

In the Asymmetric Traveling Salesperson Problem (ATSP) the goal is to find a closed walk of minimum cost in a directed graph visiting every vertex. We consider the approximability of ATSP on topologically restricted graphs. It has been shown by Oveis Gharan and Saberi [13] that there exists polynomial-Time constant-factor approximations on planar graphs and more generally graphs of constant orientable genus. This result was extended to non-orientable genus by Erickson and Sidiropoulos [8]. We show that for any class of nearly-embeddable graphs, ATSP admits a polynomial-Time constant-factor approximation. More precisely, we show that for any fixed k κ 0, there exist α β > 0, such that ATSP on n-vertex k-nearly-embeddable graphs admits an-Approximation in time O(n). The class of k-nearly-embeddable graphs contains graphs with at most κ apices, κ vortices of width at most k, and an underlying surface of either orientable or non-orientable genus at most κ. Prior to our work, even the case of graphs with a single apex was open. Our algorithm combines tools from rounding the Held-Karp LP via thin trees with dynamic programming. We complement our upper bounds by showing that solving ATSP exactly on graphs of pathwidth κ (and hence on κ-nearly embeddable graphs) requires time nω(κ), assuming the Exponential-Time Hypothesis (ETH). This is surprising in light of the fact that both TSP on undirected graphs and Minimum Cost Hamiltonian Cycle on directed graphs are FPT parameterized by treewidth.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Computing the Shapley value in allocation problems: Approximations and bounds, with an application to the Italian VQR research assessment program 23

Computing the Shapley value in allocation problems: Approxim...

引用

23rd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, RCRA 2016

作者： Lupia, Francesco Mendicelli, Angelo Ribichini, Andrea Scarcello, Francesco Schaerf, Marco Dept. of Computer Science Modeling Electronics and Systems Engineering University of Calabria Rende87036 Italy Dept. of Physics Sapienza University Rome00185 Italy Dept. of Computer Control and Management Engineering Antonio Ruberti Sapienza University Rome00185 Italy

In allocation problems, a given set of goods are assigned to agents in such a way that the social welfare is maximized, that is, the largest possible global worth is achieved. When goods are indivisible, it is possible to use money compensation to perform a fair allocation taking into account the actual contribution of all agents to the social welfare. Coalitional games provide a formal mathematical framework to model such problems, in particular the Shapley value is a solution concept widely used for assigning worths to agents in a fair way. Unfortunately, computing this value is a #P-hard problem, so that applying this good theoretical notion is often quite difficult in real-world problems. In this paper, we first review the application of the Shapley value to an allocation problem that models the evaluation of the Italian research structures with a procedure known as VQR. For large universities, the problem involves thousands of agents and goods (here, researchers and their research products). We then describe some useful properties that allow us to greatly simplify many such large instances. Moreover, we propose new algorithms for computing lower bounds and upper bounds of the Shapley value, which in some cases provide the exact result and that can be combined with approximation algorithms. The proposed techniques have been tested on large real-world instances of the VQR research evaluation problem.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Multiagent coverage problems: The trade-off between anarchy and stability

arXiv

引用

arXiv 2017年

作者： Ramaswamy, Vinod Paccagnan, Dario Marden, Jason R. Dept. of Electrical Computer and Energy Engineering University of Colorado BoulderCO80309 United States Automatic Control Laboratory ETH Zürich Zurich Switzerland Electrical and Computer Engineering Department UC Santa Barbara Santa BarbaraCA93106 United States

Networked systems are ubiquitous in today's world with examples spanning from ecology to the social and engineering sciences. Much of the research in networked systems is analytical, where the focus is on characterizing (and potentially inuencing) the emergent collective behavior, e.g., predicting the distribution of animals and humans in a given ecological system. A more recent trend of research focuses on the design of networked systems capable of achieving diverse and highly coordinated collective behavior in the absence of centralized control, e.g., designing a team of unmanned aerial vehicles to monitor the perimeter of a wild fire. Unfortunately, our understanding of how microscopic behavior impacts the macroscopic phenomena in network systems is inadequate for meeting the demands of this emerging design task. This paper focuses on an instance of this design task for a well-studied class of coverage problems where the goal is to allocate a collection of agents to a subset of resources in order to maximize the cumulative value of the covered resources. Our first result demonstrates that any agent-based algorithm relying solely on local information induces a fundamental trade-off between the best and worst case performance guarantees, as measured by the price of anarchy and price of stability. This result highlights how the information available to the agents translates to constraints on the achievable efficiency guarantees in networked control systems. Our second results demonstrates how to use an additional piece of system-level information to breach these limitations, thereby improving the system's performance. Copyright © 2017, The Authors. All rights reserved.

关键词： Networked control systems

来源：评论

学校读者我要写书评

暂无评论

Virtual control Labs Experimentation: The Water Tank System

引用

IFAC-PapersOnLine 2016年第6期49卷 87-92页

作者： Galan, Daniel Heradio, Ruben Torre, Luis de la Dormido, Sebastian Esquembre, Francisco Dept. of Computer Science and Automatic Control Universidad Nacional de Educación a Distancia Juan del Rosal 16 MadridE-28040 Spain Dept. of Software Engineering and Computer Systems Universidad Nacional de Educación a Distancia Juan del Rosal 16 MadridE-28040 Spain Dept. of Mathematics Universidad de Murcia Campus de Espinardo MurciaE-30071 Spain

This paper describes a new way to perform automated experiments using virtual laboratories. Experiments are developed and executed using a new software tool: the Experiment Editor. This tool uses virtual laboratories applications designed with educational purposes. The main features/advantages of the Experiment Editor are: 1) the possibility of modifying the initial functionality of the laboratories (i.e. adding new controllers to the plant), 2) analyzing the obtained results during the experiment and performing complex or repetitive tasks in a simple way, 3) and any others explained in the paper. To illustrate the utility of the Experiment Editor a very well-known system is used: the water tank system. © 2016

关键词： Distance education computer aided software engineering computer software Experiments Laboratories Water tanks Easy java(script) Simulations Experimentation Language Repetitive task Simulations Tank system Tool use Virtual control Virtual laboratories

来源：评论

学校读者我要写书评

暂无评论

A neural network for predicting unintentional lane departures

A neural network for predicting unintentional lane departure...

引用

IEEE International Conference on Industrial Technology (ICIT)

作者： Jamaa M. Ambarak Hao Ying Fazal Syed Dimitar Filev Dept. of Electrical and Computer Engineering Wayne State University Detroit Michigan USA Hybrid Electric Vehicle Control System Ford Motor Company Dearborn Michigan USA Research and Advanced Engineering Ford Motor Company Dearborn Michigan USA

ISBN: (纸本)9781509053216

Unintended lane departure accidents are due to driver's inattention, incapacitation, and drowsiness. Lane departure warning systems have been developed to enhance traffic safety by predicting/detecting driving situation and alerting drivers to avoid or mitigate traffic accidents. This paper explores effectiveness of a three-layer perceptron neural network in predicting an unintentional lane departure, which to the best of our knowledge has not been reported in the literature. This study used driver experiment data generated by VIRTTEX, a hydraulically powered 6-degrees-of-freedom moving base driving simulator at Ford Motor Company. The experimental data represented 16 drowsy drivers who drove a simulated 2000 Volvo S80 (three hours per driver), which consisted of a total of 3,508 lane departure occurrences. Two-third of the lane departures were randomly selected to generate training examples for the network (82,040 examples for a 0.2-second prediction horizon and 171,112 for a 0.5-second horizon). The number of hidden neurons as well as the input vehicle variables were optimized experimentally through the training process. The optimized network was then used to predict lane departure by processing the entire driving time series of the 16 drivers one by one after all the training data was removed from the time series. The network made a prediction at each sampling moment of the time series and there were over 6.3 million predictions. The overall recall and precision of the optimized network for the 0.2-second horizon were 99.74% and 99.66%, respectively, which degraded to 99.23% and 85.49%, respectively, when the horizon increased to 0.5 s.

关键词： Vehicles Training Roads Time series analysis Biological neural networks Alarm systems

来源：评论

学校读者我要写书评

暂无评论

When Naïve bayes nearest neighbors meet convolutional neural networks

When Naïve bayes nearest neighbors meet convolutional neura...

引用

2016 IEEE Conference on computer Vision and Pattern Recognition, CVPR 2016

作者： Kuzborskij, Ilja Carlucci, Fabio Maria Caputo, Barbara Sapienza Rome University Dept. of Computer Control and Management Engineering Italy Idiap Research Institute Switzerland Switzerland

ISBN: (纸本)9781467388511

Since Convolutional Neural Networks (CNNs) have become the leading learning paradigm in visual recognition, Naive Bayes Nearest Neighbor (NBNN)-based classifiers have lost momentum in the community. This is because (1) such algorithms cannot use CNN activations as input features; (2) they cannot be used as final layer of CNN architectures for end-to-end training, and (3) they are generally not scalable and hence cannot handle big data. This paper proposes a framework that addresses all these issues, thus bringing back NBNNs on the map. We solve the first by extracting CNN activations from local patches at multiple scale levels, similarly to [13]. We address simultaneously the second and third by proposing a scalable version of Naive Bayes Non-linear Learning (NBNL, [7]). Results obtained using pre-trained CNNs on standard scene and domain adaptation databases show the strength of our approach, opening a new season for NBNNs.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

A communication load balanced dynamic wireless sensor network topology management algorithm based on AODV (CLB-AODV) 11

A communication load balanced dynamic wireless sensor networ...

引用

11th International Conference on computer engineering and Systems, ICCES 2016

作者： Ahmed, Randa K. Ibrahim, Dina M. Sarhan, Amany M. Computer Maintenance Dept. West Delta Sector Telecom Egypt Kafr ElSheikh Egypt Department of Computers and Control Engineering Faculty of Engineering Tanta University Egypt

ISBN: (纸本)9781509032679

In this paper, a communication load balanced dynamic topology management algorithm (CLB-AODV) is proposed to extend the wireless sensor network (WSN) lifetime via managing the participation in communication process among all nodes in the network. The idea is that, each time there is a failure in the network topology;the topology is adjusted only on-demand by choosing the best path according to paths weights between source and destination nodes. The path weight reflects the nodes participation in communication process through the lifetime of the nodes. Our algorithm is based on the routing protocol AODV instead of using a separate protocol for dynamic topology control in order to reduce the routing load among nodes. Simulation results show that CLB-AODV can prolong the lifetime of the network, increase the number of alive nodes and reduce the average routing load when compared with some of the most powerful recent algorithms. © 2016 IEEE.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

How the Workload impacts on Cognitive Cooperation: a Pilot Study

How the Workload impacts on Cognitive Cooperation: a Pilot S...

引用

Annual International Conference of the IEEE engineering in Medicine and Biology Society

作者： Nicolina Sciaraffa Gianluca Borghini Pietro Arico Gianluca Di Flumeri Jlenia Toppi Alfredo Colosimo Anastatios Bezerianos Nitish V. Thakor Fabio Babiloni Dept. Anatomical Histological Forensic & Orthopedic Sciences Sapienza University of Rome Italy IRCCS Fondazione Santa Lucia Rome Italy BrainSigns Rome Italy Dept. Molecular Medicine Sapienza University of Rome Italy Dept. of Computer Control and Management Engineering “Sapienza” University of Rome Rome Italy Singapore Institute for Neurotechnology National University of Singapore Singapore

Cooperation degradation can be seen as one of the main causes of human errors. Poor cooperation could arise from aberrant mental processes, such as mental overload, that negatively affect the user's performance. Using different levels of difficulty in a cooperative task, we combined behavioural, subjective and neurophysiological data with the aim to i) quantify the mental workload under which the crew was operating, ii) evaluate the degree of their cooperation, and iii) assess the impact of the workload demands on the cooperation levels. The combination of such data showed that high workload demand impacted significantly on the performance, workload perception, and degree of cooperation.

关键词： Electroencephalography Indexes Low pass filters Brain Degradation NASA Monitoring

来源：评论

学校读者我要写书评

暂无评论

Optimal distributed control for platooning via sparse coprime factorizations

Optimal distributed control for platooning via sparse coprim...

引用

2016 American control Conference, ACC 2016

作者： SabǍu, Şerban OarǍ, Cristian Warnick, Sean Jadbabaie, Ali Electrical and Computer Engineering Dept. Stevens Institute of Technology HobokenNJ United States Automatic Control Dept. University Politehnica Bucharest Romania Information and Decision Algorithms Laboratories Faculty of the Computer Science Department Brigham Young University United States Electrical and Systems Engineering Dept. University of Pennsylvania United States

ISBN: (纸本)9781467386821

We introduce a novel distributed control architecture for disturbances attenuation in heterogeneous platoons of linear and time-invariant autonomous agents that inherits the performance achievable by the leader-follower control policies. We provide a Youla-like parameterization for the class of all distributed controllers such that the sparsity constraints are imposed on the controllers' left coprime factors, outlining a new concept of structural constraints in distributed control. The proposed scheme lends itself to optimal controller design via norm based costs, it guarantees string stability and completely eliminates the accordion effect from the behavior of the platoon. The distributed controller is proven to attain global optimality for heterogeneous platoons and H2 costs and can easily reconfigure such as to remain optimal during formation merging/exiting maneuvers. The scheme is amenable to a GPS time base synchronization mechanism, allowing for the exact compensation of the time delays induced by the wireless communications. © 2016 American Automatic control Council (AACC).

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：