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

Distributed Leader-Follower Flight Control for Large-Scale Clusters of Small Unmanned Aerial Vehicles

IEEE ACCESS 2018年 6卷 32790-32799页

作者： Jia, Yongnan Li, Qing Qiu, Shanqiao Univ Sci & Technol Beijing Sch Automat & Elect Engn Beijing 100083 Peoples R China China Aerosp Sci & Ind Corp Acad 3 Beijing 100074 Peoples R China

Cluster of small unmanned aerial vehicles (SUAVs) has become a subject of significant interest as a hopefully low-cost solution for the high-threat environment during modern warfare. Therein, the most fundamental issue is the cooperation control problem of these SUAVs. Moreover, it is still an open problem that how to control such a complex system flying as a flock while following an expected trajectory. In addition, how to organize the individuals belonging to one system is really a great challenge for large-scale systems. Since leader-follower structures widely exist in nature among the social animals, one leader-follower structure is introduced for effective organization of the large-scale cluster. A distributed and simplified flocking algorithm is proposed to enable the followers to fly in a cohesive configuration under the guidance of the leader and avoid collision with each other. The distributed protocol of the follower is proposed by just relying on the position-related measurement and the attitude-angle measurement in favor of the convenient engineering application. Numerical simulations are provided to illustrate the effectiveness of the cooperation approach for large-scale clusters of the SUAVs.

关键词： Aerospace biophysics algorithm design and analysis cooperative systems large-scale clusters leader-follower flocking small unmanned aerial vehicles

来源：评论

学校读者我要写书评

暂无评论

A Novel Uplink Scheduling algorithm for the Galileo System

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2018年第2期54卷 819-833页

作者： Porretta, Marco Schlarmann, Bernhard Kleine Ballereau, Alexandre Crisci, Massimo European Space Agcy European Space Res & Technol Ctr Ajilon Technol Aerosp BV NL-2200 AG Noordwijk Netherlands European GNSS Agcy Galileo Exploitat Dept Prague 17000 Czech Republic European Space Agcy European Space Res & Technol Ctr NL-2200 AG Noordwijk Netherlands

This paper describes a novel uplink scheduling (ULSC) algorithm for the Galileo system. The algorithm is designed to meet the stringent dissemination requirements that are currently foreseen for the provision of the Galileo Commercial Service (CS). In particular, these include "link availability" (LA) requirements that call for a minimum percentage of time ("availability") when a minimum number of satellites ("space vehicles," SVs), connected with an uplink station antenna, shall be in view with a generic user at a minimum elevation angle. LA requirements for CS were not fully considered in the design phase of the ULSC algorithm, which is currently implemented at the Mission and Uplink Control Facility (MUCF) of the Galileo Ground Segment. Similarly, this type of requirements is not considered in the ULSC algorithms available in the scientific literature. In particular, current solutions take into account only specifications about 1) the maximum "gap" duration between two subsequent contacts and 2) the minimum contact duration (MCD). In the new ULSC algorithm, LA specifications are effectively dealt with by a proper selection of the subset of the SVs to be allocated. In particular, the proposed selection scheme takes into account the specifications about both maximum gap duration and MCD while maximizing the "spatial diversity" of the solution. Such a diversity is defined as the union of the coverage areas of the allocated satellites. The performance of the new ULSC algorithm is evaluated based on the final deployment stage (full operational capability) of the Galileo system. The performance is also compared with that of the ULSC algorithm currently implemented at the Galileo MUCF ("reference" algorithm). Numerical results show that, compared to the reference algorithm, the average disconnection duration is reduced by more than 50%. In addition, the availability of the links needed for the provision of CS is significantly improved (up to 7%). As a result, preliminar

关键词： Antennas Uplink algorithm design and analysis Space vehicles Europe Global navigation satellite system

来源：评论

学校读者我要写书评

暂无评论

HANS PETER LUHN AND THE BIRTH OF THE HASHING algorithm

引用

IEEE SPECTRUM 2018年第2期55卷 44-49页

作者： Stevens, Hallam Nanyang Technol Univ Hist Singapore Singapore

NOVEMBER 1958, AT A SIX-DAY INTERNATIONAL CONFERence devoted to scientific information, the inventor Hans Peter Luhn demonstrated a series of his electromechanical machines. They looked rather ordinary. Much like other computing devices of the day, they were boxy and utilitarian, designed to scoop and sort tall stacks of punch cards into slots and bins.

关键词： algorithm design and analysis Text mining Electromechanical devices Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Clustering Enabled Wireless Channel Modeling Using Big Data algorithms

引用

IEEE COMMUNICATIONS MAGAZINE 2018年第5期56卷 177-183页

作者： He, Ruisi Ai, Bo Molisch, Andreas F. Stuber, Gordon L. Li, Qingyong Zhong, Zhangdui Yu, Jian Beijing Jiaotong Univ Beijing Peoples R China Beijing Jiaotong Univ State Key Lab Rail Traff Control & Safety Beijing Peoples R China Univ Southern Calif Los Angeles CA USA Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA Georgia Inst Technol Sch Elect & Comp Engn Commun Atlanta GA 30332 USA

Recently, rapid growth in data services has ushered in the so-called big data era, and data mining and analysis techniques have been widely adopted to extract value from data for different applications. Channel modeling also benefits in this era, in particular by exploiting algorithmic techniques developed for big data applications. In this article, the challenges and opportunities in clustering-enabled wireless channel modeling are discussed in this context. First, some well known clustering techniques, which are potentially capable of enabling clustered channel modeling, are presented. Next, the motivation of cluster-based channel modeling is presented. The typical concepts of clusters used in channel models are summarized, and the state-of-the-art clustering and tracking algorithms are reviewed and compared. Finally, several promising research problems for channel clustering are highlighted.

关键词： Clustering algorithms Channel models Partitioning algorithms Wireless communication Data models Delays algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Insights by Visual Comparison: The State and Challenges

引用

IEEE COMPUTER GRAPHICS AND APPLICATIONS 2018年第3期38卷 140-148页

作者： von Landesberger, Tatiana Tech Univ Darmstadt Darmstadt Germany

Data comparison is one of the core tasks in exploratory analysis, which combines algorithmic analysis and interactive visualization in a visual data comparison process. Comparison of large and complex datasets requires several steps-i.e., a workflow. This article discusses the comparison process, its research challenges, and examples of solutions.

关键词： Task analysis Data visualization Image segmentation algorithm design and analysis Clustering algorithms Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Speeding Up Distributed Machine Learning Using Codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第3期64卷 1514-1529页

作者： Lee, Kangwook Lam, Maximilian Pedarsani, Ramtin Papailiopoulos, Dimitris Ramchandran, Kannan Korea Adv Inst Sci & Technol Sch Elect Engn Daejeon 34141 South Korea Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA Univ Wisconsin Dept Elect & Comp Engn 1415 Johnson Dr Madison WI 53706 USA

Codes are widely used in many engineering applications to offer robustness against noise. In large-scale systems, there are several types of noise that can affect the performance of distributed machine learning algorithms-straggler nodes, system failures, or communication bottlenecks-but there has been little interaction cutting across codes, machine learning, and distributed systems. In this paper, we provide theoretical insights on how coded solutions can achieve significant gains compared with uncoded ones. We focus on two of the most basic building blocks of distributed learning algorithms: matrix multiplication and data shuffling. For matrix multiplication, we use codes to alleviate the effect of stragglers and show that if the number of homogeneous workers is n, and the runtime of each subtask has an exponential tail, coded computation can speed up distributed matrix multiplication by a factor of log n. For data shuffling, we use codes to reduce communication bottlenecks, exploiting the excess in storage. We show that when a constant fraction a of the data matrix can be cached at each worker, and n is the number of workers, coded shuffling reduces the communication cost by a factor of (alpha + 1/n)gamma(n) compared with uncoded shuffling, where gamma(n) is the ratio of the cost of unicasting n messages to n users to multicasting a common message (of the same size) to n users. For instance, gamma(n) similar or equal to n if multicasting a message to n users is as cheap as unicasting a message to one user. We also provide experimental results, corroborating our theoretical gains of the coded algorithms.

关键词： algorithm design and analysis channel coding distributed computing distributed databases encoding machine learning algorithms multicast communication robustness runtime

来源：评论

学校读者我要写书评

暂无评论

A Differential Evolution Performance Comparison Comparing how various differential evolution algorithms perform in designing microstrip antennas and arrays

引用

IEEE ANTENNAS AND PROPAGATION MAGAZINE 2018年第1期60卷 51-61页

作者： Deb, Arindam Roy, Jibendu Sekhar Gupta, Bhaskar Kalinga Inst Ind Technol Sch Elect Engn Bhubaneswar Orissa India Jadavpur Univ Dept Elect & Telecommun Engn Kolkata India

In this article, we have undertaken a performance comparison of different variants and hybridized schemes of differential evolution (DE) algorithms with respect to several antenna and array designs. These include DE/rand/1, self-adaptive DE (SADE), DE with global and local neighborhood search (DEGL), biogeography-based optimization with DE (BBODE), modified DE (MDE), MDE with p-best crossover strategy (MDE-pBX), improved DE (IDE), harmonic search DE (HSDE), DE with an individual dependent mechanism (DE-IDP-IDM), and adaptive DE with optimization-state estimation (ADE).

关键词： Optimization algorithm design and analysis design methodology Statistics Microstrip antennas Linear antenna arrays

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Distributed Blind Calibration of Sensor Networks Under Noisy Measurements

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2018年第1期5卷 571-582页

作者： Stankovic, Milos S. Stankovic, Srdjan S. Johansson, Karl Henrik Univ Belgrade Sch Elect Engn Innovat Ctr Belgrade Serbia Univ Belgrade Sch Elect Engn Belgrade Serbia Vlatacom Inst Belgrade Serbia KTH Royal Inst Technol Sch Elect Engn ACCESS Linnaeus Ctr Stockholm Sweden

In this paper, a novel distributed algorithm for asynchronous blind macro-calibration in sensor networks with noisy measurements is proposed. The algorithm is formulated as a set of instrumental variable type recursions for estimating parameters of sensor calibration functions. It is proved using asynchronous stochastic approximation arguments and properties of block-diagonally dominant matrices that the algorithm achieves asymptotic consensus for sensor gains and offsets in the mean square sense and with probability one. Recommendations for system design in terms of the choice of a priori tunable weights are provided. Special attention is paid to the situation when a subset of sensors in the network (reference sensors) remains with fixed characteristics. In the case of only one reference sensor, convergence of the remaining sensors to its characteristics is proved. In the case of more than one reference sensor, it is proved that the calibration parameters converge to points that depend only on the characteristics of the reference sensors and the network properties.

关键词： Calibration Clocks Noise measurement Instruments algorithm design and analysis Approximation algorithms Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Enslaving the algorithm: From a "Right to an Explanation" to a "Right to Better Decisions"?

引用

IEEE SECURITY & PRIVACY 2018年第3期16卷 46-54页

作者： Edwards, Lilian Veale, Michael Univ Strathclyde Egovernance Glasgow Lanark Scotland UCL Dept Sci Technol Engn & Publ Policy STEaPP London England

As concerns about discrimination in black box machine learning systems rise, a legal "right to an explanation" has emerged as an attractive approach for governance. Meaningful information about algorithmic logics is more technically possible than commonly thought, but this risks a new "transparency fallacy"-an illusion of remedy over a substantive provision.

关键词： Ethics Decision making Law Government policies Data protection Artificial intelligence algorithm design and analysis INSPEC: Controlled Indexing data protection law learning (artificial intelligence) INSPEC: Non-Controlled Indexing European data protection law French administrative law draft modernized Council privacy law algorithmic logics transparency fallacy soft law algorithmic system design explanation rights black box machine learning systems governance judicial review Author Keywords GDPR algorithmic accountability data protection right to an explanation machine learning

来源：评论

学校读者我要写书评

暂无评论

Going Fast and Fair: Latency Optimization for Cloud-Based Service Chains

引用

IEEE NETWORK 2018年第2期32卷 138-143页

作者： Zhang, Yuchao Xu, Ke Wang, Haiyang Li, Qi Li, Tong Cao, Xuan Beijing Univ Posts & Telecommun Beijing Peoples R China Tsinghua Univ Beijing Peoples R China Univ Minnesota Dept Comp Sci Duluth MN 55812 USA Tsinghua Univ Grad Sch Shenzhen Shenzhen Peoples R China Huawei Shenzhen Peoples R China Baidu Beijing Peoples R China

State-of-the-art microservices have been attracting more attention in recent years. A broad spectrum of online interactive applications are now programmed to service chains on the cloud, seeking better system scalability and lower operating costs. Different from the conventional batch jobs, most of these applications consist of multiple stand-alone services that communicate with each other. These step-by-step operations unavoidably introduce higher latency to the delay-sensitive chained services. In this article, we aim at designing an optimization approach for reducing the latency of chained services. Specifically, presenting the measurement and analysis of chained services on Baidu's cloud platform, our real-world trace indicates that these chained services are suffering from significantly high latency because they are mostly handled by different queues on cloud servers for multiple times. However, such a unique feature introduces significant challenges to optimize a microservice's overall queueing delay. To address this problem, we propose a delay-guaranteed approach to accelerate the overall queueing of chained services while obtaining fairness across all the workloads. Our evaluations on Baidu servers shows that the proposed design can successfully reduce the latency of chained services by 35 percent with minimal impact on other workloads.

关键词： Servers Acceleration Cloud computing algorithm design and analysis Optimization Resource management Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：