With the advancement of the Internet of Vehicles (IoV), delay-sensitive vehicular applications have flourished. Among them, the autonomous driving technology is a focal point. For autonomous driving vehicles, efficien...
详细信息
With the advancement of the Internet of Vehicles (IoV), delay-sensitive vehicular applications have flourished. Among them, the autonomous driving technology is a focal point. For autonomous driving vehicles, efficiently and timely processing the ever-increasing data is critical. In real traffic scenes, the task-processing efficiency is closely related to the traffic flows. However, the traffic flow modeling is always ignored or considered roughly in the most existing studies. For this issue, a traffic model based on a stochastic geometry framework is proposed to simulate a real traffic environment of autonomous driving vehicles. To reduce the cost of processing tasks, a distributed computation offloading scheme based on mobile edge computing (MEC) is proposed by soliciting nearby vehicles and roadside units (RSUs) with rich computing resources. For the average cost minimization optimization problem, we divide the NP-hard problem into several sub-problems and take advantage of the Lagrange multiplier with KKT constraints to solve by optimizing task splitting ratios. We compare the proposed traffic model with some common ones and also consider the pros and cons of different computation offloading strategies. Simulation results show that the proposed strategy outperforms other benchmarks and the proposed modeling method is rational.
Recent work on algebraic-topological methods for verifying coverage in planar sensor networks relied exclusively on centralized computation: a limiting constraint for large networks. This paper presents a distributed ...
详细信息
Recent work on algebraic-topological methods for verifying coverage in planar sensor networks relied exclusively on centralized computation: a limiting constraint for large networks. This paper presents a distributed algorithm for homology computation over a sensor network, for purposes of verifying coverage. The techniques involve reduction and coreduction of simplicial complexes, and are of independent interest. Verification of the ensuing algorithms is proved, and simulations detail the improved network efficiency and performance.
作者：
Zeng, XianlinLiang, ShuHong, YiguangChen, JieBeijing Inst Technol
Sch Automat Key Lab Intelligent Control & Decis Complex Syst Beijing 100081 Peoples R China Univ Sci & Technol Beijing
Sch Automat & Elect Engn Minist Educ Key Lab Knowledge Automat Ind Proc Beijing 100083 Peoples R China Chinese Acad Sci
Key Lab Syst & Control Acad Math & Syst Sci Beijing 100190 Peoples R China Beijing Inst Technol
Beijing Adv Innovat Ctr Intelligent Robots & Syst Key Lab Biomimet Robots & Syst Minist Educ Beijing 100081 Peoples R China
This paper investigates the distributed computation of the well-known linear matrix equation in the form of AXB = F, with the matrices A, B, X, and F of appropriate dimensions, over multiagent networks from an optimiz...
详细信息
This paper investigates the distributed computation of the well-known linear matrix equation in the form of AXB = F, with the matrices A, B, X, and F of appropriate dimensions, over multiagent networks from an optimization perspective. In this paper, we consider the standard distributed matrix-information structures, where each agent of the considered multiagent network has access to one of the subblock matrices of A, B, and F. To be specific, we first propose different decomposition methods to reformulate the matrix equations in standard structures as distributed constrained optimization problems by introducing substitutional variables;we show that the solutions of the reformulated distributed optimization problems are equivalent to least squares solutions to original matrix equations;and we design distributed continuous-time algorithms for the constrained optimization problems, even by using augmented matrices and a derivative feedback technique. Moreover, we prove the exponential convergence of the algorithms to a least squares solution to the matrix equation for any initial condition.
Synthetic biology (SB) offers a unique opportunity for designing complex molecular circuits able to perform predefined functions. But the goal of achieving a flexible toolbox of reusable molecular components has been ...
详细信息
Synthetic biology (SB) offers a unique opportunity for designing complex molecular circuits able to perform predefined functions. But the goal of achieving a flexible toolbox of reusable molecular components has been shown to be limited due to circuit unpredictability, incompatible parts or random fluctuations. Many of these problems arise from the challenges posed by engineering the molecular circuitry: multiple wires are usually difficult to implement reliably within one cell and the resulting systems cannot be reused in other modules. These problems are solved by means of a nonstandard approach to single cell devices, using cell consortia and allowing the output signal to be distributed among different cell types, which can be combined in multiple, reusable and scalable ways.
Sparsity has been extensively employed in multimedia sensing and computing in consumer electronics, signal and image processing, depth video codec, adaptive sparse-type equalizer, blind speech separation, and machine ...
详细信息
Sparsity has been extensively employed in multimedia sensing and computing in consumer electronics, signal and image processing, depth video codec, adaptive sparse-type equalizer, blind speech separation, and machine learning. Throughout this paper, we propose a novel distributed projection neurodynamic approach for solving the Basis Pursuit (BP) with flexible partition methods in a distributed manner. The proposed neurodynamic approach requires only that the network is undirected and connected, and no node can access the entire matrix simultaneously. First, we equivalently formulate the BP into a standard distributed optimization problem with a flexible partition-by-blocks method to obtain global information, and discuss the equivalence of their optimality conditions. Then, we propose a distributed continuous-time neurodynamic approach on the basis of primal-dual dynamical systems and projection operators, and also study its global convergence property. Finally, numerical experiments on sparse signals and image recovery further verify the effectiveness and superiority of our proposed neurodynamic approach.
We propose a general method for distributed Bayesian model choice, using the marginal likelihood, where a data set is split in non-overlapping subsets. These subsets are only accessed locally by individual workers and...
详细信息
We propose a general method for distributed Bayesian model choice, using the marginal likelihood, where a data set is split in non-overlapping subsets. These subsets are only accessed locally by individual workers and no data is shared between the workers. We approximate the model evidence for the full data set through Monte Carlo sampling from the posterior on every subset generating a model evidence per subset. The results are combined using a novel approach which corrects for the splitting using summary statistics of the generated samples. Our divide-and-conquer approach enables Bayesian model choice in the large data setting, exploiting all available information but limiting communication between workers. We derive theoretical error bounds that quantify the resulting trade-off between computational gain and loss in precision. The embarrassingly parallel nature yields important speed-ups when used on massive data sets as illustrated by our real world experiments. In addition, we show how the suggested approach can be extended to model choice within a reversible jump setting that explores multiple feature combinations within one run.
This paper presents a novel strategy to decentralize the soft detection procedure in an uplink cell-free massive multiple-input-multiple-output network. We propose efficient approaches to compute the a posteriori prob...
详细信息
ISBN:
(纸本)9789082797060
This paper presents a novel strategy to decentralize the soft detection procedure in an uplink cell-free massive multiple-input-multiple-output network. We propose efficient approaches to compute the a posteriori probability-per-bit, exactly or approximately, when having a sequential fronthaul. More precisely, each access point (AP) in the network computes partial sufficient statistics locally, fuses it with received partial statistics from another AP, and then forward the result to the next AP. Once the sufficient statistics reach the central processing unit, it performs the soft demodulation by computing the log-likelihood ratio (LLR) per bit, and then a channel decoding algorithm (e.g., a Turbo decoder) is utilized to decode the bits. We derive the distributed computation of LLR analytically.
In the dynamic landscape of smart cities and traffic management, it is necessary to further explore the synergistic potential of realtime traffic data and high-performance computing to optimise traffic flow through dy...
详细信息
In the dynamic landscape of smart cities and traffic management, it is necessary to further explore the synergistic potential of realtime traffic data and high-performance computing to optimise traffic flow through dynamic re-routing strategies. High-performance computing plays an essential role in achieving effective traffic flow optimisation. Our research builds upon existing studies highlighting the positive correlation between the integration of live traffic updates and route optimisation. The methodology involves simulations with our Ruth traffic simulator, where vehicles dynamically adjust routes based on up to date traffic information available to them at different levels. Scalability tests are conducted with varying numbers of CPUs and nodes to assess the simulator's capacity to scale. The results showcase the impact of live traffic data on both driving time and average speed, emphasising the adaptability of our approach for broader applications. In conclusion, our work not only advances the understanding of real-time traffic optimisation but also underscores the critical role of high-performance computing in achieving scalable solutions. The findings present practical implications for the implementation of dynamic re-routing strategies in transportation systems, paving the way for future research and real-world applications on smart cities.
In this paper, we propose two distributed algorithms for sparse optimization problems with linear equality constraints of the vector case and the matrix case. In the l(1)-norm minimization with the linear algebraic eq...
详细信息
ISBN:
(纸本)9789881563972
In this paper, we propose two distributed algorithms for sparse optimization problems with linear equality constraints of the vector case and the matrix case. In the l(1)-norm minimization with the linear algebraic equation constraint, we take the general block partition for the information matrix. In the l(2,1)-norm minimization with the linear operator constraint, we mainly focus on the case that every node holds the local linear constraint, while the case that all nodes have a coupling constraint can be easily obtained in a similar way. The two algorithms are both based on the primal-dual subgradient method and derivative feedback techniques. Finally, we investigate the convergence properties for the proposed algorithms, and then numerical examples are given to verify the algorithms.
This paper investigates the distributed computation of common Lyapunov functions over multi-agent networks for switching problems. From an optimization perspective, we present a distributed algorithm for solving the n...
详细信息
ISBN:
(纸本)9789881563958
This paper investigates the distributed computation of common Lyapunov functions over multi-agent networks for switching problems. From an optimization perspective, we present a distributed algorithm for solving the nonlinear convex programming problem by means of the projection method. Then we prove that the proposed algorithm is Lyapunov stable and can converge to an exact optimal solution of the common Lyapunov functions problem.
暂无评论