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

On generalized max-min rate allocation and distributed convergence algorithm for packet networks

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2004年第5期15卷 401-416页

作者： Hou, YT Panwar, SS Tzeng, HHY Virginia Tech Bradley Dept Elect & Comp Engn Blacksburg VA 24061 USA Polytech Univ Dept Elect & Comp Engn Brooklyn NY 11201 USA Nokia Networks Div Mountain View CA 94043 USA

This paper considers the fundamental problem of bandwidth allocation among flows in a packet-switched network. The classical max-min rate allocation has been widely regarded as a fair rate allocation policy. But, for a flow with a minimum rate requirement and a peak rate constraint, the classical max-min policy no longer suffices to determine rate allocation since it is not capable of supporting either the minimum rate or the peak rate constraint from a flow. In this paper, we generalize the theory of the classical max-min rate allocation with the support of both the minimum rate and peak rate constraints for each flow. Additionally, to achieve generalized max-min rate allocation in a fully distributed packet network, we present a distributed algorithm that uses a feedback- based flow control mechanism. Our design not only offers a fresh perspective on flow marking technique, but also advances the state-of-the-art flow marking technique favored by other researchers. We provide proof that such a distributed algorithm, through asynchronous iterations, will always converge to the generalized max-min rate allocation under any network configuration and any set of link distances. We use simulation results to demonstrate the fast convergence property of the distributed algorithm.

关键词： max-min rate allocation minimum rate peak rate centralized algorithm distributed algorithm convergence flow control packet networks

来源：评论

学校读者我要写书评

暂无评论

Cost-Minimizing distributed algorithm for Managing Renewable-Integrated Power Grids

Cost-Minimizing Distributed Algorithm for Managing Renewable...

引用

IEEE Global Conference on Signal and Information Processing

作者： Sun Sun Min Dongt Ben Liang Dept. of Electrical and Computer Engineering University of Toronto Canada Dept. of Electrical Computer and Software Engineering University of Ontario Institute of Technology Canada

ISBN: (纸本)9781479975921

We investigate the problem of power balancing in a general renewable-integrated power grid with storage and flexible loads. We consider a power grid that is supplied by one conventional generator (CG) and multiple renewable generators (RGs) each co-located with storage, and is additionally connected with external markets. An aggregator operates the power grid and aims at minimizing the long-term system cost. We propose a distributed real-time power balancing solution, taking into account the uncertainty of the renewable generation, loads, and energy prices. We demonstrate that our proposed algorithm is asymptotically optimal as the storage capacity increases and the CG ramping constraint loosens. The distributed implementation enjoys a fast convergence rate and enables each RG and the aggregator to make their own decisions.

关键词： distributed algorithm energy storage flexible loads renewable generation stochastic optimization

来源：评论

学校读者我要写书评

暂无评论

Design of FIR Filter Based on distributed algorithm

Design of FIR Filter Based on Distributed Algorithm

引用

2012电子信息与电气工程国际学术会议(EIEE2012)

作者： NIE YANG Dept Physics of Ji ning Teachers College Ji ning , China GE HUA Dept Physics of Ji ning Teachers College Ji ning , China

This article introduces a distributed algorithm to design FIR filters, using System Generator complete high-level the filter design. Experimental results show that distributed algorithms significantly reduce the FPGA ... 详细信息

关键词： distributed algorithm FIR FPGA

来源：评论

学校读者我要写书评

暂无评论

A distributed pricing algorithm for achieving network-wide proportional fairness

引用

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2012年第15期12卷 1338-1350页

作者： Zhou, Hui Fan, Pingyi Xia, Xiang-Gen Letaief, K. B. Tsinghua Univ Dept Elect Engn Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China Univ Delaware Dept Elect & Comp Engn Newark DE USA Hong Kong Univ Sci & Technol Dept Elect & Comp Engn Hong Kong Hong Kong Peoples R China

Proportional fairness (PF) scheduling achieves a balanced tradeoff between throughput and fairness and has attracted great attention recently. However, most previous work on PF only considers the single cell scenario. This paper focuses on the problem of achieving network-wide PF in a generalized multiple base station multiple user network. The problem is formulated as a maximization model and solved using the dual method. By decomposing the dual objective function, we get a distributed pricing based algorithm. Optimality of this algorithm is presented. Although the algorithm is derived using fixed link rate assumption, it can still apply in the presence of time-varying rates. The proposed algorithm is suitable for distributed systems in the sense that it does not need any inter base station communication at all. Simulations illustrate that the proposed distributed network-wide PF scheduling algorithm achieves almost the same performance as the centralized one. Compared with traditional local PF (LPF) scheduling, the network-wide PF scheduling achieves higher throughput, lower throughput oscillation, and greater fairness. Copyright (C) 2010 John Wiley & Sons, Ltd.

关键词： scheduling proportional fairness pricing distributed algorithm

来源：评论

学校读者我要写书评

暂无评论

Research of distributed algorithm Based on Usage Mining

Research of Distributed Algorithm Based on Usage Mining

引用

2009 Second International Workshop on Knowledge Discovery and Data Mining

作者： Qingtian Han Control Engineering Department Naval Aeronautical and Astronautical University Yantai,China Xiaoyan Gao Information Engineering Department Shandong Business Institute Yantai,china

Web mining applies the data mining,the artificial intelligence and the chart technology and so on to the web data and traces users' visiting characteristics,and then extracts the users' using *** article will study on Web Mining algorithm based on Usage *** it also produces the design mentality of the electronic commerce website application *** usage mining is an application of data mining technology to mining the data of the web server log *** can discover the browsing patterns of user and some kind of correlations between the web *** usage mining provides the support for the web site design,providing personalization server and other business making decision,etc. This algorithm is simple,effective and easy to realize,it is suitable to the web usage mining demand of construct a low cost B2C website.

关键词： data mining distributed algorithm web usage mining

来源：评论

学校读者我要写书评

暂无评论

A Novel Simple distributed algorithm for Cluster Organization of Wireless Sensor Networks

A Novel Simple Distributed Algorithm for Cluster Organizatio...

引用

2008 International Seminar on Future BioMedical Information Engineering(FBIE 2008)

作者： Nan Hua Institute of Telecommunication Engineering Air Force Engineering University Xi’an,China Yi Guo Department of Computer Science and Engineering East China University of Science and Technology Shanghai,China

This paper proposes an innovative distributed algorithm for cluster organization of Wireless Sensor Networks (WSN),named *** logic,connectionless information exchange and asynchronism are prominent features of the *** involves three correlative processes:cluster organization,cluster reorganization and cluster *** process of cluster organization is the basic process of DSCO,which adopts random backoff strategy;the cluster reorganization and cluster self-healing processes are recursion of the former,which effectively simplifies the design of the ***,DSCO furthest isolates nodes and clusters,and reduces the reliance of global information to minimum,which is useful to reduce the pressure of data storage and processing in nodes,lessen the network traffic and enhance the anti-destroy ability of *** algorithm simulation illustrates that DSCO can get fast clustering speed and uniform distribution of cluster nodes,proves its good performance on clustering rate and topology control,and shows good adaptability to large-scale WSN.

关键词： wireless sensor networks (WSN) distributed algorithm cluster organization cluster reorganization self-healing mechanism

来源：评论

学校读者我要写书评

暂无评论

distributed Online algorithm for Optimal Real-Time Energy Distribution in the Smart Grid

引用

IEEE INTERNET OF THINGS JOURNAL 2014年第1期1卷 70-80页

作者： Wang, Yu Mao, Shiwen Nelms, R. M. Auburn Univ Dept Elect & Comp Engn Auburn AL 36849 USA

In recent years, the smart grid has been recognized as an important form of the Internet of Things (IoT). The two-way energy and information flows in a smart gird, together with the smart devices, bring about new perspectives to energy management. This paper investigates a distributed online algorithm for electricity distribution in a smart grid environment. We first present a formulation that captures the key design factors such as user's utility, grid load smoothing, and energy provisioning cost. The problem is shown to be convex and can be solved with a centralized online algorithm that only requires present information about users and the grid in our prior work. In this paper, we develop a distributed online algorithm that decomposes and solves the online problem in a distributed manner, and prove that the distributed online solution is asymptotically optimal. The proposed distributed online algorithm is also practical and mitigates the user privacy issue by not sharing user utility functions. It is evaluated with trace-driven simulations and shown to outperform a benchmark scheme.

关键词： Convex optimization demand response distributed algorithm Enernet Online algorithm smart grid

来源：评论

学校读者我要写书评

暂无评论

A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions

引用

SOFT COMPUTING 2019年第7期23卷 2147-2166页

作者： Alsinet, Teresa Argelich, Josep Bejar, Ramon Cemeli, Joel Univ Lleida INSPIRES Res Ctr Lleida Spain Starloop Studios Lleida Spain

Twitter is one of the most powerful social media platforms, reflecting both support and contrary opinions among people who use it. In a recent work, we developed an argumentative approach for analyzing the major opinions accepted and rejected in Twitter discussions. A Twitter discussion is modeled as a weighted argumentation graph where each node denotes a tweet, each edge denotes a relationship between a pair of tweets of the discussion and each node is attached to a weight that denotes the social relevance of the corresponding tweet in the discussion. In the social network Twitter, a tweet always refers to previous tweets in the discussion, and therefore the underlying argument graph obtained is acyclic. However, when in a discussion we group the tweets by author, the graph that we obtain can contain cycles. Based on the structure of graphs, in this work we introduce a distributed algorithm to compute the set of globally accepted opinions of a Twitter discussion based on valued argumentation. To understand the usefulness of our distributed algorithm, we study cases of argumentation graphs that can be solved efficiently with it. Finally, we present an experimental investigation that shows that when solving acyclic argumentation graphs associated with Twitter discussions our algorithm scales at most with linear time with respect to the size of the discussion. For argumentation graphs with cycles, we study tractable cases and we analyze how frequent are these cases in Twitter. Moreover, for the non-tractable cases we analyze how close is the solution of the distributed algorithm with respect to the one computed with the general sequential algorithm, that we have previously developed, that solves any argumentation graph.

关键词： Twitter discussions Valued argumentation Probability values distributed algorithm Tractable cases

来源：评论

学校读者我要写书评

暂无评论

Convergence analysis of a distributed gradient algorithm for economic dispatch in smart grids

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2022年 134卷 107373-107373页

作者： Zhang, Hao Liang, Shan Liang, Jing Han, Yiyan Chongqing Univ Coll Automat Key Lab Dependable Serv Comp Cyber Phys Soc Educ Minist China Chongqing 400044 Peoples R China Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Key Lab Image Proc & Intelligent Control Educ Minist China Wuhan 430074 Peoples R China

The increasingly complex modern energy network arouses the need of flexible and dependable approaches to solve the economic dispatch problem (EDP) in the smart grids. Toward this end, this paper develops a fresh distributed algorithm with constant step-size, which aims to schedule the power generation among generators by complying with individual generation capacity limits to satisfy the total load demand at the minimized cost. The convergence of the proposed algorithm is analyzed through utilizing the Lyapunov method and the spectral decomposition technique. When the selected constant step-size is smaller than a specifically provided upper bound, the theoretical analysis demonstrates that the proposed algorithm can linearly achieve the optimal solution of the EDP under the smooth and strongly convex assumption on generation cost functions. In particular, the linear convergence rate of the proposed algorithm is tunable, and a relationship among the linear convergence rate, generation cost functions, network topology, weight matrix and constant step-size is established. The availability of the proposed algorithm is verified through simulation experiments.

关键词： Economic dispatch distributed algorithm Constant step-size Linear convergence Smart grids

来源：评论

学校读者我要写书评

暂无评论

distributed Robust algorithm for Economic Dispatch in Smart Grids Over General Unbalanced Directed Networks

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2020年第7期16卷 4322-4332页

作者： Li, Huaqing Wang, Zheng Chen, Guo Dong, Zhao Yang Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligen Chongqing 400715 Peoples R China Univ New South Wales Sch Elect Engn & Telecommun Sydney NSW 2052 Australia

The increased complexity of modern energy network raises the necessity of flexible and reliable methods for smart grid operation. To this end, this article is centered on the economic dispatch problem (EDP) in smart grids, which aims at scheduling generators to meet the total demand at the minimized cost. This article proposes a fully distributed algorithm to address the EDP over directed networks and takes into account communication delays and noisy gradient observations. In particular, the rescaling gradient technique is introduced in the algorithm design and the implementation of the distributed algorithm only resorts to row-stochastic weight matrices, which allows each generator to locally allocate the weights on the messages received from its in-neighbors. It is proved that the optimal dispatch can be achieved under the assumptions that the nonidentical constant communication delays inflicting on each link are uniformly bounded and the noises embroiled in gradient observation of every generator are bounded variance zero mean. Simulations are provided to validate and testify the effectiveness of the presented algorithm.

关键词： Generators distributed algorithms Smart grids Delays Cost function Economics Communication delay distributed algorithm directed networks economic dispatch noisy gradient

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：