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

distributed data association in smart camera network via dual decomposition

INFORMATION FUSION 2018年 39卷 120-138页

作者： Wan Jiuqing Chen Xu Bu Shaocong Liu Li Beihang Univ Dept Automat 37 Xueyuan Rd Beijing Peoples R China

One of the fundamental requirements for pedestrian surveillance using smart camera network is the correct association of each person's observations generated on different camera nodes to the person's track. Recently, distributed data association methods that involve only local information processing on each camera node and mutual information exchanging between neighboring cameras have attracted many research interests due to their superiority in large scale applications. In this paper, we propose a new method that performs global data association in a distributed manner by fusing the appearance and spatio-temporal measurements of objects captured by all camera nodes in the entire network. Specifically, we formulate the data association problem in smart camera networks as an Integer Programming problem by introducing a set of linking variables, and propose two distributed algorithms, namely L-DD and Q-DD, to solve the Integer Programming problem using the dual decomposition technique. In our algorithms, the original Integer Programming problem is decomposed into several subproblems, which can be solved locally on each smart camera. Different subproblems reach consensus on their solutions in a rigorous way by adjusting their parameters iteratively based on the projected subgradient optimization. The proposed method is simple and flexible, in that (i) we can incorporate any feature extraction and matching technique into our framework to calculate the similarity between observations, which corresponds to the costs of links in our model, and (ii) we can decompose the original problem in any way as long as the resulting subproblem can be solved independently and efficiently. We show the competitiveness of our method in both accuracy and speed by theoretical analysis and experimental comparison with state-of-the-art algorithms. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Data association Smart camera network Dual decomposition distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed trajectory design for data gathering using mobile sink in wireless sensor networks

引用

AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS 2018年 96卷 1-12页

作者： Alsaafin, Areej Khedr, Ahmed M. Al Aghbari, Zaher Univ Sharjah Dept Comp Sci Sharjah U Arab Emirates Zagazig Univ Math Dept Fac Sci Zagazig Egypt

Several studies have demonstrated the benefits of using a mobile sink (MS) to reduce energy consumption resulting from multi-hop data collection using a static sink in wireless sensor networks (WSNs). However, using MS may increase data delivery latency as it needs to visit each sensor node in the network to collect data. This is a critical issue in delay-sensitive applications where all sensed data must be gathered within a given time constraint. In this paper, we propose a distributed data gathering protocol utilizing MS for WSNs. The proposed protocol designs a trajectory for the MS, which minimizes energy consumption and delay. Our protocol operates in four main phases: data sensing, rendezvous point (RP) selection, trajectory design, and data gathering. In data sensing, a number of deployed sensor nodes keep sensing the target field for a specific period of time to capture events. Then, using a cluster-based RP selection algorithm, some sensor nodes are selected to become RPs based on local information. The selected RPs are then used to determine a trajectory for the MS. To do so, we propose three trajectory design algorithms that support different types of applications, namely reduced energy path (REP), reduced delay path (RDP), and delay bound path (DBP). The MS moves through the constructed path to accomplish its data gathering according to an effective scheduling technique that is introduced in this work. We validate the proposed protocol via extensive simulations over several metrics such as energy, delay, and time complexity. (C) 2018 Elsevier GmbH. All rights reserved.

关键词： distributed algorithm Wireless sensor network Data gathering Mobile sink Trajectory design

来源：评论

学校读者我要写书评

暂无评论

distributed ReliefF-based feature selection in Spark

引用

KNOWLEDGE AND INFORMATION SYSTEMS 2018年第1期57卷 1-20页

作者： Palma-Mendoza, Raul-Jose Rodriguez, Daniel de-Marcos, Luis Natl Autonomous Univ Honduras Syst Engn Dept Tegucigalpa Honduras Univ Alcala Comp Sci Dept Edificio PolitecnCtra Barcelona Km 33-7 Madrid 28871 Spain

Feature selection (FS) is a key research area in the machine learning and data mining fields;removing irrelevant and redundant features usually helps to reduce the effort required to process a dataset while maintaining or even improving the processing algorithm's accuracy. However, traditional algorithms designed for executing on a single machine lack scalability to deal with the increasing amount of data that have become available in the current Big Data era. ReliefF is one of the most important algorithms successfully implemented in many FS applications. In this paper, we present a completely redesigned distributed version of the popular ReliefF algorithm based on the novel Spark cluster computing model that we have called DiReliefF. The effectiveness of our proposal is tested on four publicly available datasets, all of them with a large number of instances and two of them with also a large number of features. Subsets of these datasets were also used to compare the results to a non-distributed implementation of the algorithm. The results show that the non-distributed implementation is unable to handle such large volumes of data without specialized hardware, while our design can process them in a scalable way with much better processing times and memory usage.

关键词： Feature selection ReliefF distributed algorithm Big Data Apache Spark

来源：评论

学校读者我要写书评

暂无评论

distributed support vector machine in master-slave mode

引用

NEURAL NETWORKS 2018年 101卷 94-100页

作者： Chen, Qingguo Cao, Feilong China Jiliang Univ Coll Sci Dept Appl Math Hangzhou 310018 Zhejiang Peoples R China

It is well known that the support vector machine (SVM) is an effective learning algorithm. The alternating direction method of multipliers (ADMM) algorithm has emerged as a powerful technique for solving distributed optimisation models. This paper proposes a distributed SVM algorithm in a master-slave mode (MS-DSVM), which integrates a distributed SVM and ADMM acting in a master-slave configuration where the master node and slave nodes are connected, meaning the results can be broadcasted. The distributed SVM is regarded as a regularised optimisation problem and modelled as a series of convex optimisation sub-problems that are solved by ADMM. Additionally, the over-relaxation technique is utilised to accelerate the convergence rate of the proposed MS-DSVM. Our theoretical analysis demonstrates that the proposed MS-DSVM has linear convergence, meaning it possesses the fastest convergence rate among existing standard distributed ADMM algorithms. Numerical examples demonstrate that the convergence and accuracy of the proposed MS-DSVM are superior to those of existing methods under the ADMM framework. (c) 2018 Elsevier Ltd. All rights reserved.

关键词： Support vector machine (SVM) Alternating direction method of multipliers (ADMM) distributed algorithm Master-slave mode

来源：评论

学校读者我要写书评

暂无评论

A distributed coordinated economic droop control scheme for islanded AC microgrid considering communication system

引用

ELECTRIC POWER SYSTEMS RESEARCH 2018年 160卷 109-118页

作者： Gao, Yang Ai, Qian Shanghai Jiao Tong Univ Dept Elect Engn Shanghai Peoples R China

The conventional PQ droop control method is easily affected by load changes and line impedance in the islanded AC microgrid and always results in the problems in dynamic performance. Therefore, the parallel distributed Generators (DGs) have uneven power distribution and poor economy. To solve the problem of inaccurate power distribution of DGs and low operating costs, we propose an improved economic droop control strategy based on distributed algorithm, in which the second-level optimization control is added to iteratively modify the reference voltage and frequency in the droop control. In this process, the system optimal economic operating point will also be achieved. Considering the advantages of centralized and decentralized control, the control architecture based on sparse multi-agent communication network improves the robustness and flexibility of the system because there is no central leader. Finally, simulation analysis of the islanded AC microgrid is carried out by using PSCAD/EMTDC simulation software to verify that this strategy can achieve the precise control of the tie-line power according to the load demand response, and the optimal economic operation for each DG. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Secondary optimization Islanded microgrid Marginal cost consistency distributed algorithm Communication delay

来源：评论

学校读者我要写书评

暂无评论

distributed Clustering-Task Scheduling for Wireless Sensor Networks Using Dynamic Hyper Round Policy

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2018年第2期17卷 334-347页

作者： Neamatollahi, Peyman Naghibzadeh, Mahmoud Abrishami, Saeid Yaghmaee, Mohammad-Hossein Ferdowsi Univ Mashhad Fac Engn Dept Comp Engn POB *** Mashhad Iran

Prolonging the network life cycle is an essential requirement for many types of Wireless Sensor Network (WSN) applications. Dynamic clustering of sensors into groups is a popular strategy to maximize the network lifetime and increase scalability. In this strategy, to achieve the sensor nodes' load balancing, with the aim of prolonging lifetime, network operations are split into rounds, i.e., fixed time intervals. Clusters are configured for the current round and reconfigured for the next round so that the costly role of the cluster head is rotated among the network nodes, i.e., Round-Based Policy (RBP). This load balancing approach potentially extends the network lifetime. However, the imposed overhead, due to the clustering in every round, wastes network energy resources. This paper proposes a distributed energy-efficient scheme to cluster a WSN, i.e., Dynamic Hyper Round Policy (DHRP), which schedules clustering-task to extend the network lifetime and reduce energy consumption. Although DHRP is applicable to any data gathering protocols that value energy efficiency, a Simple Energy-efficient Data Collecting (SEDC) protocol is also presented to evaluate the usefulness of DHRP and calculate the end-to-end energy consumption. Experimental results demonstrate that SEDC with DHRP is more effective than two well-known clustering protocols, HEED and M-LEACH, for prolonging the network lifetime and achieving energy conservation.

关键词： Clustering distributed algorithm energy-efficiency scheduling wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

distributed Harmonic Form Computation

引用

IEEE SIGNAL PROCESSING LETTERS 2018年第8期25卷 1241-1245页

作者： Zhang, Mengyi Goupil, Alban Hanaf, Alias Wang, Tian Nanjing Tech Univ Coll Elect Engn & Control Sci Nanjing 210028 Jiangsu Peoples R China Univ Reims CReSTIC F-51100 Reims France Beihang Univ Sch Automat Sci & Elect Engn Beijing 100083 Peoples R China

Spectral graph analysis based on Laplace operators has been ubiquitously applied in graph signal processing. Extending these tools to a generalization of graphs is helpful for several applications, such as network analysis, a sensor network coverage problem, and other fields, where the relationships between two or more vertices should be modeled. Such mathematical theories already exist, but the associated algorithms are still in their infancy. In this letter, we propose a new algorithm to compute harmonic forms, i.e., solutions of the Laplace equation, whose implementation is simple enough to be distributed among networks without central control center.

关键词： distributed algorithm harmonic forms Laplace equation simplicial complex

来源：评论

学校读者我要写书评

暂无评论

On the Convergence of Online Mirror Ascent for Aggregative Games with Approximated Aggregates 20

On the Convergence of Online Mirror Ascent for Aggregative G...

引用

20th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Tampubolon, Ezra Boche, Holger Tech Univ Munich Lehrstuhl Theoret Informat Tech D-80290 Munich Germany

ISBN: (纸本)9781538665282

We consider a class of continuous games called aggregative games, in which the payoff of each player can be expressed to depend on his own action and the aggregate of the population's action. This class of games appears in a vast number of engineering fields, among others signal processing and communications. We study the case where every agent possesses no knowledge about the instantaneous change of the aggregate, and where he has in addition merely an estimate rather than the actual value of the aggregate. We give a mild sufficient condition on the agent's estimate of the aggregate depending on the step size, such that the corresponding mirror ascent based algorithm, suited with the framework of no-regret online learning, converges to the Wardrop equilibrium.

关键词： Aggregative Games Online Learning Mirror Ascent distributed algorithm Large Scale networks Wardrop Equilibrium

来源：评论

学校读者我要写书评

暂无评论

Control Strategy for VSG Modified Response Based on Reliability Prediction and Adaptive Virtual Inertia 4

Control Strategy for VSG Modified Response Based on Reliabil...

引用

4th IEEE Workshop on the Electronic Grid (eGRID)

作者： Lao, Huanjing Zhang, Li Zhao, Tong Zou, Liang Shandong Univ Dept Elect Engn Jinan Peoples R China

ISBN: (纸本)9781728157047

In this paper, a control strategy for modified response of virtual synchronous generator (VSG) based on reliability prediction and adaptive virtual inertia is proposed, simultaneously pursing high-efficient tracking power generation of distributed generators and improved resilience of resisting power fluctuation disasters. By monitoring reliability of system, automatic inertia control (AIC) is carried out. Namely, when reliability of the predicted system is reduced to a critical value, it is switched to behave large inertia and presents a defensive posture to meet the requirements of failure resistance. When frequency of system is restoring, it is shown as small inertia for fast frequency restoration, which is a trade-off between small inertia required for flexible response to power of renewable energy and large inertia required for fault resistance. Besides, considering the development of distribution generation and the typical slower speed of frequency recovery compared to frequency fall, a multilevel consensus algorithm is proposed to help dispatch inertia for system with higher robustness and differential management of inertia gain calculation is carried out for inertia effective adjustment. Finally, three typical systems applying VSG technique are built with MATLAB/Simulink for verification. Simulation results demonstrate the rationality and effectiveness of the proposed strategy.

关键词： Automatic inertia control adaptive virtual inertia control distributed algorithm frequency regulation microgrid reliability prediction

来源：评论

学校读者我要写书评

暂无评论

Squeezing Streams and Composition of Self-stabilizing algorithms 39th

Squeezing Streams and Composition of Self-stabilizing Algori...

引用

39th IFIP WG 6.1 International Conference on Formal Techniques for distributed Objects, Components, and Systems (FORTE) Held as Part of the 14th International Federated Conference on distributed Computing Techniques (DisCoTec)

作者： Altisen, Karine Corbineau, Pierre Devismes, Stephane Univ Grenoble Alpes VERIMAG Grenoble INP Inst Engn CNRS F-38000 Grenoble France

ISBN: (纸本)9783030217594;9783030217587

Composition is a fundamental tool when dealing with complex systems. We study the hierarchical collateral composition which is used to combine self-stabilizing distributed algorithms. The PADEC library is a framework developed with the Coq proof assistant and dedicated to the certification of self-stabilizing algorithms. We enrich PADEC with the composition operator and a sufficient condition to show its correctness. The formal proof of the condition leads us to develop new tools and methods on potentially infinite streams, these latter ones being used to model the algorithms' executions. The cornerstone has been the definition of the function Squeeze which removes duplicates from streams.

关键词： Coq proof assistant Streams Coinduction Composition distributed algorithm Self-stabilization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：