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

H_∞ multi-step prediction for linear discrete-time systems:: A distributed algorithm

INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS 2008年第1期6卷 135-141页

作者： Wang, Hao-qian Zhang, Huan-shui Hu, Hong Tsinghua Univ Dept Automat Beijing 100084 Peoples R China Shandong Univ Sch Control Sci & Engn Jinan 250061 Peoples R China Harbin Inst Technol Shenzhen Grad Sch Shenzhen 518055 Peoples R China

A new approach to H-infinity multi-step prediction is developed by applying the innovation analysis theory. Although the predictor is derived by resorting to state augmentation, nevertheless, it is completely different from the previous works with state augmentation. The augmented state here is considered just as a theoretical mathematic tool for deriving the estimator. A distributed algorithm for the Riccati equation of the augmented system is presented. By using the reorganized innovation analysis, calculation of the estimator does not require any augmentation. A numerical example demonstrates the effect in reducing computing burden.

关键词： distributed algorithm H-infinity estimation innovation Krein space

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for Solving Linear Algebraic Equations Over Random Networks

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2021年第5期66卷 2399-2406页

作者： Alaviani, Seyyed Shaho Elia, Nicola Iowa State Univ Ames IA 50011 USA Clemson Univ Dept Mech Engn Clemson SC 29634 USA Univ Minnesota Dept Elect & Comp Engn Minneapolis MN 55455 USA

This article considers the problem of solving linear algebraic equations of the form Ax=b among multiagents, which seek a solution by using local information in presence of random communication topologies. The equation is solved by m agents where each agent only knows a subset of rows of the partitioned matrix [A,b]. The problem is formulated such that this formulation does not need the distribution of random interconnection graphs. Therefore, this framework includes asynchronous updates and/or unreliable communication protocols. The random Krasnoselskii-Mann iterative algorithm is applied that converges almost surely and in mean square to a solution of the problem for any matrices A and b and any initial conditions of agents' states. The algorithm is a totally asynchronous algorithm without requiring a priori B-connectivity and distribution dependency assumptions. The algorithm is able to solve the problem even if the weighted matrix of the graph is periodic and irreducible for synchronous protocol. It is demonstrated that the limit point to which the agents' states converge is determined by the unique solution of a convex optimization problem regardless of the distribution of random communication graphs. Finally, some numerical examples are given to show the results.

关键词： Mathematical model Protocols Hilbert space distributed algorithms Convex functions Network topology Topology Asynchronous distributed algorithm linear algebraic equations random graphs

来源：评论

学校读者我要写书评

暂无评论

Voltage control approach based on PCPM distributed algorithm in the presence of high PV penetration: a stochastic modeling

引用

ELECTRICAL ENGINEERING 2021年第6期103卷 2561-2572页

作者： Yousefi, Hadi Gholamian, S. Asghar Zakariazadeh, Alireza Babol Noshirvani Univ Technol Dept Elect & Comp Engn Babol Iran Univ Sci & Technol Mazandaran Dept Elect Engn Behshahr Iran

The uncertainty of solar generation is a challenging issue for the operation and control of distribution systems. Also, because of the large number of control and operation variables in advanced distribution networks, the centralized optimization technique requires high computational capabilities. In this paper, a distributed voltage regulation approach in a distribution system based on the predictor corrector proximal multiplier (PCPM) algorithm has been presented. This paper focuses on the voltage rise in distribution systems with high penetration of photovoltaics. The proposed method uses a clustering approach to divide the network into partitions based on the coupling degrees among different nodes. The optimal reactive power control strategy is conducted in each partition and integrated using PCPM. The proposed method is tested on 69 and 123 nodes IEEE distribution test systems. The results confirmed that the proposed method achieves the optimal solution with the same accuracy as the centralized method but in a much shorter computation time.

关键词： Reactive power Distribution system Photovoltaic system distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

An optimal distributed algorithm for finding articulation points in a network

引用

COMPUTER COMMUNICATIONS 1998年第18期21卷 1707-1715页

作者： Chaudhuri, P Kuwait Univ Dept Elect & Comp Engn Safat Kuwait

This paper presents a distributed algorithm for finding the articulation points in an n node communication network represented by a connected undirected graph. For a given graph if the deletion of a node splits the graph into two or more components then that node is called an articulation point. The output of the algorithm is available in a distributed manner, i.e., when the algorithm terminates each node knows whether it is an articulation point or not. It is shown that the algorithm requires O(n) messages and O(n) units of time and is optimal in communication complexity to within a constant factor. (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： distributed algorithm communication network undirected graph articulation point message complexity

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for finding Hamiltonian cycles in random graphs in O (logn) time

引用

THEORETICAL COMPUTER SCIENCE 2020年 846卷 61-74页

作者： Turau, Volker Hamburg Univ Technol Inst Telemat Schwarzenberg Campus 3 D-21073 Hamburg Germany

It is known for some time that a random graph G(n, p) contains w.h.p. a Hamiltonian cycle if p is larger than the critical value p(crit) = (log n + log log n omega(n))/n. The determination of a concrete Hamiltonian cycle for G(n, p) is a nontrivial task, even when p is much larger than p(crit). In this paper we consider random graphs G(n, p) with p in (Omega) over tilde (1/root n), where (Omega) over tilde. hides poly-logarithmic factors in n. For this range of p we present a distributed algorithm A(HC) that finds w.h.p. a Hamiltonian cycle in O (logn) rounds. The algorithm works in the synchronous model and uses messages of size O (logn) and O (logn) memory per node. (C) 2020 Elsevier B.V. All rights reserved.

关键词： distributed algorithm Hamiltonian cycle Random graph

来源：评论

学校读者我要写书评

暂无评论

A Cutting Plane-Based distributed algorithm for Non-Smooth Optimisation With Coupling Constraints

引用

IEEE CONTROL SYSTEMS LETTERS 2024年 8卷 1223-1228页

作者： Zhong, Tianyi Angeli, David Imperial Coll London Dept Elect & Elect Engn London SW7 2AZ England Univ Florence Dept Informat Engn I-50121 Florence Italy

In this letter, we study a general setup for constrained convex optimisation over time-varying networks. We propose a distributed algorithm, based on the cutting plane method, to address non-smooth optimisation challenges. Cutting plane-based approaches require constraint consensus which is structurally different from established consensus schemes. We bridge this gap by linking the cutting plane-based algorithm with a dynamic average tracking scheme. The distributed cutting plane algorithm is presented and its convergence is analysed. Its performance is investigated through a numerical example.

关键词： Optimization Heuristic algorithms Approximation algorithms Linear approximation Estimation distributed algorithms Couplings Cutting plane non-smooth optimisation dynamic average tracking distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for flow induced acoustics

引用

JOURNAL OF COMPUTATIONAL ACOUSTICS 2006年第1期14卷 131-141页

作者： Lai, CH Wang, ZK Djambazov, GS Pericleous, KA Univ Greenwich Sch Comp & Math Sci London SE10 9LS England

Sound waves are propagating pressure fluctuations and axe typically several orders of magnitude smaller than the pressure variations in the flow field that account for flow acceleration. On the other hand, these fluctuations travel at the speed of sound in the medium, not as a transported fluid quantity. Due to the above two properties, the Reynolds averaged Navier-Stokes (RANS) equations do not resolve the acoustic fluctuations. Direct numerical simulation of turbulent flow is still a prohibitively expensive tool to perform noise analysis. This paper proposes a distributed algorithm, based on the acoustic correction method, which leads to an efficient method for computational aeroacoustics and noise analysis. Software issues and advantages axe discussed. Numerical experiments on a flow induced noise problem are included.

关键词： Navier-Stokes distributed algorithm acoustic correction method

来源：评论

学校读者我要写书评

暂无评论

DIAMOND: a distributed algorithm for vertex coloring problems and resource allocation

引用

IET NETWORKS 2019年第6期8卷 381-389页

作者： Miri, Mohammadhasan Mohamedpour, Kamal Darmani, Yousef Sarkar, Mahasweta KN Toosi Univ Technol Dept ECE Tehran Iran San Diego State Univ Dept ECE San Diego CA 92182 USA

The vertex colouring problem (VCP) and its generalisations have myriad applications in computer networks. To solve the VCP with $\Delta + 1$Delta+1 colours, numerous distributed algorithms based on LOCAL model have been proposed to reduce time complexity (the number of rounds), where $\Delta $Delta is the maximum vertex degree in the graph. In this paper, the authors present a distributed algorithm based on modified LOCAL model (DIAMOND) that reduces the number of rounds to one. It greedily solves the VCP with at most $\Delta + 1$Delta+1 colours. Computational results on Geometry (GEOM) graphs show that the number of used colours to colour each instance using DIAMOND is about $\left({\Delta + 1} \right)/2$mml:mfenced close=")" open="("Delta+1/2. DIAMOND is easily extended to solve greedily generalised VCPs in only one round. Moreover, they present two efficient resource allocation algorithms using DIAMOND. They allocate more resource to the graph compared with $\lpar \Delta + 1\rpar $(Delta+1)-colouring and even to $\lpar \bar d + 1\rpar $(d over bar +1)-colouring algorithms, where $\bar d$d over bar is the average vertex degree of the graph. They run in two and $\Delta $Delta rounds.

关键词： graph colouring resource allocation distributed algorithms modified LOCAL model DIAMOND GEOM graphs vertex colouring problem myriad applications computer networks maximum vertex degree distributed algorithm resource allocation algorithms distributed algorithms greedily generalised VCP

来源：评论

学校读者我要写书评

暂无评论

A methodology with a distributed algorithm for large-scale trajectory distribution prediction

引用

INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE 2019年第4期33卷 833-854页

作者： Guo, QiuLei Karimi, Hassan A. Univ Pittsburgh Sch Comp & Informat Geoinformat Lab Pittsburgh PA 15260 USA

In this paper, we propose a method for predicting the distributions of people's trajectories on the road network throughout a city. Specifically, we predict the number of people who will move from one area to another, their probable trajectories, and the corresponding likelihoods of those trajectories in the near future, such as within an hour. With this prediction, we will identify the hot road segments where potential traffic jams might occur and reveal the formation of those traffic jams. Accurate predictions of human trajectories at a city level in real time is challenging due to the uncertainty of people's spatial and temporal mobility patterns, the complexity of a city level's road network, and the scale of the data. To address these challenges, this paper proposes a method which includes several major components: (1) a model for predicting movements between neighboring areas, which combines both latent and explicit features that may influence the movements;(2) different methods to estimate corresponding flow trajectory distributions in the road network;(3) a MapReduce-based distributed algorithm to simulate large-scale trajectory distributions under real-time constraints. We conducted two case studies with taxi data collected from Beijing and New York City and systematically evaluated our method.

关键词： Trajectory distribution big data spatial-temporal prediction distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

AN ASYNCHRONOUS distributed algorithm FOR REAL-TIME PAYMENTS-PROCESSING IN A PARTIALLY-CONNECTED NETWORK OF BANKS

引用

INFORMATION & MANAGEMENT 1994年第4期26卷 199-217页

作者： LEE, T GHOSH, S BROWN UNIV DIV ENGNPROVIDENCERI 02912

The payment-processing system in the banking industry consists of deposits, withdrawals, and transfers of monies through the use of cash, checks, magnetic tapes, and electronic transactions. Of these, nearly all of the check processing through the United States Federal Reserve System, most of the check processing in the private networks, and a part of the electronic transactions are realized through the utilization of the principles of batch-mode processing. This is a conservative and secure means of transaction processing wherein operations, initiated by users, are stored within the system for a certain length of time, typically a few hours to a day or a week, and completed during off-hours i.e.;when the bank is closed to users. Batch-mode processing suffers from many limitations, the principal ones being that: (i) users are denied real-time access to their money, and that (ii) a user's banking privileges cannot be extended - a facility that is increasingly being demanded by users. A centralized banking algorithm, similar to the Swiss Interbank Clearing System (SIC), is inadequate for the United States of America with nearly 12,700 financial institutions and which is extremely vulnerable to a natural calamity or an act of terrorism. This paper proposes a new, distributed architecture for payments processing within a network of major banks as an alternative to the Federal Reserve System. This approach distributes the processing operations to multiple, concurrent, cooperating geographically distributed computers i.e., at many sites, to achieve real-time transaction processing. In essence, a user's most recent account balance and the banking privileges of withdrawal, deposit and, transfer are available to a user, transparently, anywhere i.e., at any of the major banks constituting the network. The accuracy of every transaction is guaranteed and, as a result, (i) banks are not exposed to the risk of fraudulent or bad credits, and (ii) users are not denied complete acce

关键词： BANKING PAYMENTS-PROCESSING BROAD-BAND-ISDN COMMUNICATION NETWORKS SIMULATION LOOSELY-COUPLED PARALLEL PROCESSORS distributed algorithm MODELING NETWORK OF WORKSTATIONS FINANCIAL INSTITUTIONS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：