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

28th ACM International Conference on Information and Knowledge Management (CIKM)

作者： Zhao, Kang Pan, Pan Zheng, Yun Zhang, Yanhao Wang, Changxu Zhang, Yingya Xu, Yinghui Jin, Rong Alibaba Grp Machine Intelligence Technol Lab Hangzhou Peoples R China

ISBN: (纸本)9781450369763

Graph-based approximate nearest neighbor search has attracted more and more attentions due to its online search advantages. Numbers of methods studying the enhancement of speed and recall have been put forward. However, few of them focus on the efficiency and scale of offline graph-construction. For a deployed visual search system with several billions of online images in total, building a billion-scale offline graph in hours is essential, which is almost unachievable by most existing methods. In this paper, we propose a novel algorithm called Binary distributed Graph to solve this problem. Specifically, we combine binary codes with graph structure to speedup both offline and online procedures, and achieve comparable performance with the ones that use real-value features, by recalling and reranking more binary candidates. Furthermore, the graph-construction is optimized to completely distributed implementation, which significantly accelerates the offline process and gets rid of the limitation of single machine, such as memory and storage. Experimental comparisons on Alibaba Commodity Data Set (more than three billion images) show that the proposed method outperforms the state-of-the-art with respect to the online/offline trade-off.

关键词： Visual Search Binary Codes distributed algorithm Graph Construction

来源：评论

学校读者我要写书评

暂无评论

distributed Coloring of Graphs with an Optimal Number of Colors 36

Distributed Coloring of Graphs with an Optimal Number of Col...

引用

36th International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Bamas, Etienne Esperet, Louis Ecole Polytech Fed Lausanne Sch Comp & Commun Sci Lausanne Switzerland Univ Grenoble Alpes CNRS Lab G SCOP Grenoble France

ISBN: (纸本)9783959771009

This paper studies sufficient conditions to obtain efficient distributed algorithms coloring graphs optimally (i.e. with the minimum number of colors) in the LOCAL model of computation. Most of the work on distributed vertex coloring so far has focused on coloring graphs of maximum degree Delta with at most Delta + 1 colors (or Delta colors when some simple obstructions are forbidden). When Delta is sufficiently large and c >= Delta - k(Delta) + 1, for some integer k(Delta) approximate to root Delta - 2, we give a distributed algorithm that given a c-colorable graph G of maximum degree Delta, finds a c-coloring of G in min{O((log Delta)(13/12) log n), 2(O(log Delta + root log log n))} rounds, with high probability. The lower bound Delta - k(Delta) + 1 is best possible in the sense that for infinitely many values of Delta, we prove that when chi(G) <= Delta - k(Delta), finding an optimal coloring of G requires Omega(n) rounds. Our proof is a light adaptation of a remarkable result of Molloy and Reed, who proved that for Delta large enough, for any c >= Delta - k(Delta) deciding whether chi(G) <= c is in P, while Embden-Weinert et al. proved that for c <= Delta - k(Delta) - 1, the same problem is NP-complete. Note that the sequential and distributed thresholds differ by one. Our first result covers the case where the chromatic number of the graph ranges between Delta - root Delta and Delta + 1. Our second result covers a larger range, but gives a weaker bound on the number of colors: For any sufficiently large Delta, and Omega(log Delta) <= k <= Delta /100, we prove that every graph of maximum degree Delta and clique number at most Delta -k can be efficiently colored with at most Delta - epsilon k colors, for some absolute constant epsilon > 0, with a randomized algorithm running in O(log n/log log n) rounds with high probability.

关键词： Graph coloring distributed algorithm maximum degree

来源：评论

学校读者我要写书评

暂无评论

Loose Formation Control of Multi-Agent Systems based on Piecewise Function

Loose Formation Control of Multi-Agent Systems based on Piec...

引用

第40届中国控制会议

作者： Huaxin Qiu Xiaochu Wang Qingrui Zhou Changhao Sun Qian Xuesen Laboratory of Space Technology China Academy of Space Technology

This paper introduces a loose motion control algorithm for multi-agent systems whose interaction is described by a connected undirected *** proposed algorithm guarantees agents to achieve a loose formation *** agent is driven by a nonlinear piecewise function of the coordination errors,to save agents from unnecessarily overcontrolling and,hence,it can reduce the energy cost in the case where input uncertainties *** theoretical analyses on stability and simulations are given to demonstrate the effectiveness of the algorithm.

关键词： distributed algorithm consensus control loose formation input uncertainties

来源：评论

学校读者我要写书评

暂无评论

VRDD: vehicular relevance-based data dissemination in a vehicular ad hoc network

引用

IET INTELLIGENT TRANSPORT SYSTEMS 2019年第12期13卷 1792-1803页

作者： Chowdhury, Debanjan Roy Jain, Vinod Kumar PDPM Indian Inst Informat Technol Design & Mfg Ja Dept Comp Sci & Engn Dumna Airport RdPO Khamaria Jabalpur Madhya Pradesh India

Safety message (SM) dissemination in vehicular ad hoc network needs to be fast as it allows vehicles to become alert and avoid adverse situations. An SM usually gets disseminated within a topology by multi-hop broadcast technique. Existing protocols have proposed various controlled flooding mechanisms to address the issues of broadcast storm and network partition. However, no work has been done to take care the direction of message dissemination. In a real scenario, all vehicles within an area of interest (AOI) are not equally affected by an emergency incident. The vehicles of the road where the incident happened, or the vehicles of roads which are connected to incident location by nearby junctions, are most affected and hence are more relevant to receive the SM as fast as possible. Hence, this study proposes a novel method to predict the relevance of vehicles using a distributed algorithm and heuristically tries to disseminate SM toward the relevant vehicles. The authors have compared their work with three state of-the-art algorithms and found that vehicular relevance-based data dissemination is compatible with the existing algorithms on the metrics of packet loss and dissemination delay, but clearly leading in the metric of relevant dissemination.

关键词： vehicular ad hoc networks protocols broadcasting telecommunication network topology distributed algorithms vehicular relevance-based data dissemination relevant dissemination vehicular ad hoc network safety message dissemination multihop broadcast techniques controlled rebroadcast mechanisms controlled rebroadcast mechanisms protocols packet loss dissemination delay distributed algorithm emergency incident

来源：评论

学校读者我要写书评

暂无评论

A Constant Factor Approximation for the d-Hop Connected Dominating Set in Three-Dimensional Wireless Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2019年第9期18卷 4357-4367页

作者： Li, Ke Gao, Xiaofeng Wu, Fan Chen, Guihai Shanghai Jiao Tong Univ Shanghai Key Lab Scalable Comp & Syst Dept Comp Sci & Engn Shanghai 200240 Peoples R China

In the past few years, wireless sensor networks (WSNs) have been widely used in many areas. In these applications, sensors are remotely deployed to gather related environmental information for further analysis. To support higher scalability and better data aggregation, sensor nodes are often grouped into disjoint and mostly non-overlapping clusters. All nodes in a cluster can send their data to the cluster head within d-hop distance, and the head should communicate with other cluster heads and pass all data to base station. For better communication between these cluster heads, lower maintenance cost, and easier management, it is necessary to make the number of the clusters as small as possible. Moreover, in many environments such as mountainous area or underwater monitoring, node deployment is often not flat, resulting in a high dimensional network. In this paper, we focus on proposing a scheme to select cluster heads for a homogeneous network in three-dimensional situation. The scheme meets two requirements: the number of cluster heads is minimum and the head nodes can communicate with each other. These requirements can be formed as an NP-complete problem named d-hop connected dominating set. Correspondingly, we proposed a distributed approximation algorithm and proved its approximation ratio as (d+1)beta, where beta is a calculated parameter with respect to d. We also analyzed the performance of our algorithm with corresponding numerical experiments.

关键词： Wireless sensor network d-CDS spanning tree cluster distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Packet latency of deterministic broadcasting in adversarial multiple access channels

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2019年 99卷 27-52页

作者： Anantharamu, Lakshmi Chlebus, Bogdan S. Kowalski, Dariusz R. Rokicki, Mariusz A. Univ Colorado Dept Comp Sci & Engn Denver CO 80217 USA Univ Liverpool Dept Comp Sci Liverpool L69 3BX Merseyside England

We study broadcasting in multiple access channels with dynamic packet arrivals and jamming. Communication environments are represented by adversarial models that specify constraints on packet arrivals and jamming. We consider deterministic distributed broadcast algorithms and give upper bounds on the worst-case packet latency and the number of queued packets in relation to the parameters defining adversaries. Packet arrivals are determined by a rate of injections and a number of packets that can be generated in one round. Jamming is constrained by a rate with which an adversary can jam rounds and by a number of consecutive rounds that can be jammed. (C) 2018 Elsevier Inc. All rights reserved.

关键词： Multiple access channel Adversarial queuing Jamming distributed algorithm Deterministic algorithm Packet latency Queues size

来源：评论

学校读者我要写书评

暂无评论

Sensor Network Event Localization via Nonconvex Nonsmooth ADMM and Augmented Lagrangian Methods

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2019年第4期6卷 1473-1485页

作者： Zhang, Chunlei Wang, Yongqiang Clemson Univ Dept Elect & Comp Engn Clemson SC 29634 USA

Event localization plays a fundamental role in many wireless-sensor network applications, such as environmental monitoring, homeland security, medical treatment, and health care, and it is essentially a nonconvex and nonsmooth problem. In this paper, we address such a problem in a completely decentralized way based on augmented Lagrangian methods and alternating direction method of multipliers (ADMM). A decentralized algorithm is proposed to solve the nonsmooth and nonconvex event localization problem directly, rather than using conventional convex relaxation techniques. The avoidance of convex relaxation is significant in that convex relaxation-based methods generally suffer from high computational complexity. The convergence properties are also evaluated and substantiated using numerical simulations, which show that the proposed algorithm achieves better localization accuracy than existing projection-based approaches when the target is within the convex hull of localization sensors. When the target is outside the convex hull, numerical simulations show that the proposed approach has a higher probability to converge to the target event location than existing projection-based approaches. Numerical simulation results show that our approach is also robust to network topology changes.

关键词： distributed algorithm event localization wireless-sensor network

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient computation offloading and resource allocation for delay-sensitive mobile edge computing

引用

SUSTAINABLE COMPUTING-INFORMATICS & SYSTEMS 2019年 21卷 154-164页

作者： Wang, Quyuan Guo, Songtao Liu, Jiadi Yan, Yuanyuan Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligen Chongqing 400715 Peoples R China Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA

Mobile edge computing is an emerging computing paradigm to augment computational capabilities of mobile devices by offloading computation-intensive tasks from resource-constrained smart mobile device onto edge clouds nearby with potential computation capability. However, in general, edge clouds have limited computation resource and energy. Thus it is critical to achieve high energy efficiency while ensuring satisfactory user experience. In this paper, we first formulate the computation offloading problem into the system energy-efficiency cost minimization problem by taking into account the completion time and energy. Then, by solving the optimization problem, we propose a distributed algorithm consisting of clock frequency configuration, transmission power allocation, channel rate scheduling and offloading strategy selection. In this algorithm, the clock frequency for local execution and the transmission power in edge cloud execution are optimized jointly. Furthermore, to optimize the queue delay, we formulate an M/M/n queue model with individual capacity between different windows and propose an algorithm for optimal task offloading rate. Finally, the experimental results show that our algorithm can achieve energy-efficient offloading performance compared to other existing algorithms. (C) 2019 Elsevier Inc. All rights reserved.

关键词： Mobile edge computing Energy efficiency Computation offloading Resource allocation distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

distributed collaborative control strategy for integrated energy microgrid based on multi-agent system 22

Distributed collaborative control strategy for integrated en...

引用

22nd International Conference on Electrical Machines and Systems (ICEMS)

作者： Hu, Changbin Li, Shiwei Luo, Shanna Ma, Rui Fan, Hui North China Univ Technol Coll Elect & Control Engn Beijing Peoples R China State Grid Hebei Elect Power Co Shijiazhuang Hebei Peoples R China

ISBN: (纸本)9781728133980

Economic dispatch problem (EDP) in integrated energy microgrid is a basic optimization problem of power system. With the abundance of various forms of energy in the micro grid, this paper proposes a distributed cooperative algorithm based on the consistency framework to solve the EDP of the comprehensive energy economy model. This method makes use of the principle that under the optimal output power value, all micro sources can achieve the economic optimum with the same rate of cost increment. Therefore, the cost slight increase rate of each micro source is selected as the consistency variable, and the local power supply and demand mismatch value is taken as the feedback variable to meet the constraint conditions. Using multi-parameter perturbation theory and graph theory, the convergence of the algorithm is proved. The algorithm is a completely distributed algorithm with no leader or virtual command node. Simulation results show the effectiveness of this algorithm. At the same time, the simulation results directly illustrate the variation law of convergence speed.

关键词： distributed algorithm multi-agent system integrated energy microgrid consistency

来源：评论

学校读者我要写书评

暂无评论

Trust Assessment in Vehicular Social Network Based on Three-Valued Subjective Logic

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2019年第3期21卷 652-663页

作者： Cheng, Tong Liu, Guangchi Yang, Qing Sun, Jianguo Univ North Texas Dept Comp Sci & Engn Denton TX 76203 USA Stratifyd Inc Charlotte NC 28207 USA Harbin Engn Univ Coll Comp Sci Harbin 150001 Heilongjiang Peoples R China

Trustworthiness in a vehicular network plays a vital role in facilitating data sharing among vehicles to achieve better driving safety and convenience. Without trustworthiness assessment, a vehicle may not be able to trust other vehicles and, therefore, simply drop the data shared from others to avoid potential driving dangers. This problem was traditionally approached by protecting data security;however, the study of the trustworthiness of data generators (vehicles) is unfortunately omitted. We envision the existences of a vehicular social network on road, wherein vehicles exchanging data between each other are considered socially connected. Leveraging the trust propagation and fusion within a vehicular social network, the trustworthiness of individual vehicles can be accurately assessed. We adopt the three-valued subjective logic model to study trust between vehicles, and propose a holistic solution to trust assessment in vehicular social networks. The proposed solution enables objective and subjective trust assessment of vehicles, in a distributed manner. Simulation results indicate that the proposed solution offers a more accurate trust assessment and a quicker assessing time.

关键词： Trust assessment vehicular social network three-valued subjective logic community division distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：