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

A Distributed Task Allocation Based on a Winner-Take-All Approach for Multiple Energy Storage Systems Coordination in a Microgrid

引用

IEEE TRANSACTIONS ON SMART GRID 2020年第1期11卷 686-695页

作者： Xu, Yinliang Wu, Wenchuan Zhou, Jianguo Tsinghua Univ Tsinghua Shenzhen Int Grad Sch Tsinghua Berkeley Shenzhen Inst Shenzhen 518055 Peoples R China Tsinghua Univ Dept Elect Engn State Key Lab Power Syst Beijing 100084 Peoples R China

With the advance in energy storage technology, various energy storage systems (ESSs) have been exploited for providing frequency/voltage control and other services in a microgrid. It may be impractical to adjust all of the ESSs charging/discharging behaviors to compensate for the supply demand mismatch due to limited number of control actions constraints, availability conditions, and ESS lifespan concerns for frequent charging/discharging operations. Therefore, this paper proposes a novel discrete distributed task allocation approach based on the winner-take-all (WTA) algorithm to select the most suitable ESSs through a sparse communication network using a consensus filter. The active power controllers of the chosen ESSs are activated to track the desired charging/discharging power reference provided by the local controller, while those of the rest ESSs remain deactivated. The proposed discrete approach is suitable for digital implementation, and its convergence and optimality are guaranteed by rigorous analysis. Simulation studies verify the effectiveness of the proposed distributed WTA-based control approach with two modified versions of the benchmark low-voltage (LV) microgrid networks.

关键词： Microgrids Task analysis Frequency control Resource management Convergence Batteries Energy storage systems task allocation distributed control discrete algorithm winner-take-all algorithm

来源：评论

学校读者我要写书评

暂无评论

SCHENSTED algorithmS FOR DUAL GRADED GRAPHS

引用

JOURNAL OF ALGEBRAIC COMBINATORICS 1995年第1期4卷 5-45页

作者： FOMIN, S RUSSIAN ACAD SCI SPIIRANTHEORY ALGORITHMS LABMOSCOWRUSSIA MIT DEPT MATHCAMBRIDGEMA 02139

This paper is a sequel to [3]. We keep the notation and terminology and extent the numbering of sections, propositions, and formulae of [3]. The main result of this paper as a generalization of the Robinson-Schensted correspondence to the class of dual graded graphs introduced in [3]. This class extends the class of Y-graphs, or differential posets [22], for which a generalized Schensted correspondence was constructed earlier in [2]. The main construction leads to unified bijective proofs of various identities related to path counting, including those obtained in [3]. It is also applied to permutation enumeration, including rook placements on Ferrers boards and enumeration of involutions. As particular cases of the general construction, we re-derive the classical algorithm of Robinson, Schensted, and Knuth [19, 12], the Sagan-Stanley [18], Sagan-Worley [16, 29] and Haiman's [11] algorithms and the author's algorithm for the Young-Fibonacci graph [2]. Some new applications are suggested. The rim hook correspondence of Stanton and White [23] and Viennot's bijection [28] are also special cases of the general construction of this paper. In [5], the results of this paper and the previous paper [3] were presented in a form of extended abstract.

关键词： discrete algorithm ENUMERATIVE COMBINATORICS POSET YOUNG DIAGRAM

来源：评论

学校读者我要写书评

暂无评论

Experimenting with Proxy Agents in Online Combinatorial Auctions

引用

INTERNATIONAL JOURNAL OF INTELLIGENT INFORMATION TECHNOLOGIES 2014年第2期10卷 56-75页

作者： Chakraborty, Soumyakanti Sen, Anup Bagchi, Amitava XLRI Xavier Sch Business Informat Syst Jamshedpur Bihar India Indian Inst Management Management Informat Syst Kolkata Joka India Heritage Inst Technol Comp Sci & Engn Anandapur India

To promote online eBay-like combinatorial auctions, the authors experiment with a distributive agent based mechanism PRACA which attempts to address two research issues. First, the scheme uses an algorithm CompDL to incrementally solve the Winner Determination Problem under limited memory for any package that the bidder may be interested to bid at any time. This helps the bidder to bid effectively knowing the current state of the auction. CompDL thereby allows a large number of items to be put on auction. Second, PRACA supplies an autonomous proxy agent to each bidder who logs in to an ongoing auction;this agent bids on the bidder's behalf and relays data on requested packages to the bidder. Therefore, PRACA helps in reducing operational overheads of seller and bidder in online combinatorial auctions. Both schemes have been implemented and the efficacy of the approach is demonstrated by experiments.

关键词： Agent Based Systems discrete algorithm Information Feedback Online Combinatorial Auction Participation Costs of Bidders Winner Determination Problem (WDP)

来源：评论

学校读者我要写书评

暂无评论

The discrete tube:: A spatial acceleration technique for efficient diffraction computation 8th

The discrete tube:: A spatial acceleration technique for eff...

引用

8th International Conference on discrete Geometry for Computer Imagery (DGCI 99)

作者： Aveneau, L Andres, E Mériaux, M IRCOM SIC CNRS UMR 6615 F-86960 Futuroscope France

ISBN: (纸本)3540656855

Keller's Geometrical Theory of Diffraction [8] allows to render scenes with dihedron diffraction account. The Diffraction algorithm presented in [2] is too slow, since its complexity is linear with respect to the number of dihedra. In order to accelerate it, we propose to reduce the complexity with a discrete based algorithm. Considering that diffraction mainly occurs inside the n-first FRESNEL'S ellipsoids [11], we can limit the diffraction computation to dihedra inside such ellipsoids. For efficiency we propose to use an ellipsoid approximation, the discrete tube. We describe two different algorithms for computing such a discrete tube. Their results are discussed, and show an important acceleration compared to the previous method.

关键词： discrete algorithm rendering techniques diffraction GTD ray-tracing

来源：评论

学校读者我要写书评

暂无评论

Faster Min-Plus Product for Monotone Instances 2022

Faster Min-Plus Product for Monotone Instances

引用

54th Annual ACM SIGACT Symposium on Theory of Computing (STOC)

作者： Chi, Shucheng Duan, Ran Xie, Tianle Zhang, Tianyi Tsinghua Univ Beijing Peoples R China Tel Aviv Univ Tel Aviv Israel

In this paper, we show that the time complexity of monotone minplus product of two n x n matrices is (O) over tilde (n((3)(+omega)()/2)) = (O) over tilde (n(2.687)), where omega (n((3)(+omega)()/2)) time, which greatl... 详细信息

ISBN: (纸本)9781450392648

In this paper, we show that the time complexity of monotone minplus product of two n x n matrices is (O) over tilde (n((3)(+omega)()/2)) = (O) over tilde (n(2.687)), where omega < 2.373 is the fast matrix multiplication exponent [Alman and Vassilevska Williams 2021]. That is, when A is an arbitrary integer matrix and B is either row-monotone or columnmonotone with integer elements bounded by O(n), computing the min-plus product C where C-i,C-j = min(k){A(i,k) + B-k,B-j} takes <(O)over tilde>(n((3)(+omega)()/2)) time, which greatly improves the previous time bound of (O) over tilde (n((12+omega)/5)) = (O) over tilde (n(2.875)) [Gu, Polak, Vassilevska Williams and Xu 2021]. Then by simple reductions, this means the case that A is arbitrary and the columns or rows of B are bounded-difference can also be solved in (O) over tilde (n((3)(+omega)()/2)) time, whose previous result gives time complexity of (O) over tilde (n(2.922)) [Bringmann, Grandoni, Saha and Vassilevska Williams 2016]. So the case that both of A and B are bounded-difference also has (O) over tilde (n((3)(+omega)()/2)) time algorithm, whose previous results give time complexities of (O) over tilde (n(2.824)) [Bringmann, Grandoni, Saha and Vassilevska Williams 2016] and (O) over tilde (n(2.779)) [Chi, Duan and Xie 2022]. Many problems are reducible to these problems, such as language edit distance, RNA-folding, scored parsing problem on BD grammars [Bringmann, Grandoni, Saha and Vassilevska Williams 2016]. Thus, their complexities are all improved. Finally, we also consider the problem of min-plus convolution between two integral sequences which are monotone and bounded by O(n), and achieve a running time upper bound of (O) over tilde (n(1.5)). Previously, this task requires running time (O) over tilde (n((9+root 177)/12)) = O(n(1.859)) [Chan and Lewenstein 2015].

关键词： discrete algorithm randomized algorithm matrix multiplication application

来源：评论

学校读者我要写书评

暂无评论

Simulation Modeling of Robust Control System for Nonlinear Non-Affine Objects 2

Simulation Modeling of Robust Control System for Nonlinear N...

引用

2nd International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM)

作者： Eremin, Eugenie L. Shelenok, Evgeniy A. Amur State Univ Informat & Control Syst Dept Blagoveshchensk Russia Pacific Natl Univ Automat & Syst Engn Dept Khabarovsk Russia

ISBN: (纸本)9781509013227

The article deals with the simulation of robust control system for nonlinear non-affine scalar dynamic objects. The considered system is constructed by using the hyperstability criterion, dynamic filter-corrector and the L-dissipativity conditions. This approach enabled synthesis of the robust law that provides fulfillment of specified quality indicators of the system operation in the presence of nonlinear parameters and structural disturbances. The aim of this article is the study of dynamic characteristics of the robust control system for non-affine nonlinear control objects with different nonlinear parameters. With help of computational experiment, the regulator coefficients are selected, which provide a predetermined precision tracking of the command signal.

关键词： non-affine nonlinear system robust control reference model filter-corrector discrete algorithm hyperstability L-dissipativity simulation model

来源：评论

学校读者我要写书评

暂无评论

Upon some continuous prediction algorithms. I

引用

Calcolo 1973年第3期9卷 197-234页

作者： Wynn, P. Centre de Recherches Mathématiques Université de Montréal Montréal Québec Canada

Three difference-differential processes operating upon an initial value function Φ (μ) and yielding a sequence of approximations to {Mathematical expression} are described. The processes are confluent analogues of an algorithm related to Romberg's extrapolation procedure, of the π-algorithm, and of the ε-algorithm. It is shown that these processes can be modified to yield approximations to the integral {Mathematical expression}, and that in certain circumstances this integral can be evaluated by a process of repeated differentiation involving the function ψ(μ). discrete algorithms for approximating {Mathematical expression}, for which it is assnmed, that values of the successive derivatives of the function Φ (μ) are available, are described. It is shown that these algorithms can be applied to the evaluation of the integral {Mathematical expression}, it being assumed that the values of the successive derivatives of the function ψ(μ) are available. A number of examples in which closed expressions for the transformed estimates can be derived are discussed. Algol procedures for implementing the discrete algorithms are given © 1973 Instituto di Elaborazione della Informazione del CNR.

关键词： Rational Function discrete algorithm Successive Derivative Confluent Form Finite Constant

来源：评论

学校读者我要写书评

暂无评论

Some Considerations About the Refinements and the Accuracy of PID-Controllers

引用

IFAC Proceedings Volumes 2000年第4期33卷 247-252页

作者： Dumitru Popescu George Tambozi Catalin Petrescu "Politehnica" Univerity of Bucharest Department of Automatic Control and Computer Science 313 Splaiul Independentei Sector 6 77206-Bucharest Romania

In now-days, the PID controllers are still implemented in the industrial applications of automatic control. The purpose of this paper is to improve the PID standard algorithm evaluating the PID control output value by some numerical refined methods and by computational accuracy of the hardware support. The experimental results were obtained in simulation, using a second-order closed-loop system with a first order plant model with time delay.

关键词： PID-controller discrete algorithm accuracy implementation performances

来源：评论

学校读者我要写书评

暂无评论

Reactive Power Optimization Based on Parallel Immune Particle Swarm Optimization

Reactive Power Optimization Based on Parallel Immune Particl...

引用

The 6th International Conference on Computer Research and Development

作者： Guili Yuan Lei Zhu Tong Yu School of Control and Computer Engineering North China Electric Power University

Reactive power optimization is important to ensure power quality, improve system security, and reduce active power loss. So, this paper proposed parallel immune particle swarm optimization(PIPSO) algorithm. This algorithm makes basic particle swarm optimization(BPSO) and discrete particle swarm optimization(DPSO) to optimize in parallel, and improves the convergence capability of particle swarm optimization with convergence ability. It is effective to overcome the problem of local convergence by immune operator, at the same time, it is more reasonable to solve the complex coding problem which discrete variables and continuous variables mixed by parallel optimization. Finally, the simulation results of IEEE-14, IEEE-30, IEEE-118 nodes system show that compared to the genetic algorithm and basic particle swarm optimization, the parallel immune particle swarm optimization can achieve the convergence effect faster and more stable, and better to solve the large-scale power system reactive power optimization.

关键词： reactive power optimization particle swarm optimization immune algorithm discrete algorithm parallel optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：