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

Distributed Resource Allocation Over Directed Graphs via Continuous-Time algorithms

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2021年第2期51卷 1097-1106页

作者： Zhu, Yanan Ren, Wei Yu, Wenwu Wen, Guanghui Southeast Univ Sch Math Jiangsu Prov Key Lab Networked Collect Intelligen Nanjing 210096 Peoples R China Univ Calif Riverside Dept Elect & Comp Engn Riverside CA 95251 USA RMIT Univ Sch Engn Melbourne Vic 3000 Australia

This paper investigates the resource allocation problem for a group of agents communicating over a strongly connected directed graph, where the total objective function of the problem is composted of the sum of the local objective functions incurred by the agents. With local convex sets, we first design a continuous-time projection algorithm over a strongly connected and weight-balanced directed graph. Our convergence analysis indicates that when the local objective functions are strongly convex, the output state of the projection algorithm could asymptotically converge to the optimal solution of the resource allocation problem. In particular, when the projection operation is not involved, we show the exponential convergence at the equilibrium point of the algorithm. Second, we propose an adaptive continuous-time gradient algorithm over a strongly connected and weight-unbalanced directed graph for the reduced case without local convex sets. In this case, we prove that the adaptive algorithm converges exponentially to the optimal solution of the considered problem, where the local objective functions and their gradients satisfy strong convexity and Lipachitz conditions, respectively. Numerical simulations illustrate the performance of our algorithms.

关键词： Adaptive algorithm directed graphs projection algorithm resource allocation

来源：评论

学校读者我要写书评

暂无评论

Vectorization of hand-drawn image using piecewise cubic Bezier curves fitting

引用

PATTERN RECOGNITION 1998年第11期31卷 1747-1755页

作者： Chang, HH Yan, H Univ Sydney Dept Elect Engn Sydney NSW 2006 Australia

In this paper, we present a new curve-fitting algorithm for vectorizing hand-drawn key frames in a computer-aided cartooning system. In our algorithm, a new optimization technique is developed for finding a parametric curve, which approximates to the given data points. In order to obtain the desired results, we also define a new distance function to measure the error between the curve and the data points. In addition, in the piecewise curve fitting our method can satisfy the geometrical continuity on a non-corner knot. With these techniques the hand-drawn images can faithfully be represented by piecewise cubic Bezier curves. (C) 1998 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

关键词： curve fitting least-squares approximation cubic Bezier curves projection algorithm

来源：评论

学校读者我要写书评

暂无评论

Remarks on a formula for the pseudoinverse by the modified Huang algorithm

引用

COMPUTING 1997年第2期59卷 183-185页

作者： Huang, K Yu, J Department of Mathematics Nanjing Normal University Nanjing People’s Republic of China

We present and prove an alternative formula of the Moore-Penrose pseudoinverse for a matrix by the modified Huang algorithm. The results correct a formula in the book entitled 'ABS projection algorithms: mathemati... 详细信息

关键词： Moore-Penrose pseudoinverse modified Huang algorithms projection algorithm

来源：评论

学校读者我要写书评

暂无评论

On the cone eigenvalue complementarity problem for higher-order tensors

引用

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS 2016年第1期63卷 143-168页

作者： Ling, Chen He, Hongjin Qi, Liqun Hangzhou Dianzi Univ Sch Sci Dept Math Hangzhou 310018 Zhejiang Peoples R China Hong Kong Polytech Univ Dept Appl Math Kowloon Hong Kong Peoples R China

In this paper, we consider the tensor generalized eigenvalue complementarity problem (TGEiCP), which is an interesting generalization of matrix eigenvalue complementarity problem (EiCP). First, we give an affirmative result showing that TGEiCP is solvable and has at least one solution under some reasonable assumptions. Then, we introduce two optimization reformulations of TGEiCP, thereby beneficially establishing an upper bound on cone eigenvalues of tensors. Moreover, some new results concerning the bounds on the number of eigenvalues of TGEiCP further enrich the theory of TGEiCP. Last but not least, an implementable projection algorithm for solving TGEiCP is also developed for the problem under consideration. As an illustration of our theoretical results, preliminary computational results are reported.

关键词： Higher order tensor Eigenvalue complementarity problem Cone eigenvalue Optimization reformulation projection algorithm

来源：评论

学校读者我要写书评

暂无评论

Squirrel-cage induction generator system using hybrid wavelet fuzzy neural network control for wind power applications

引用

NEURAL COMPUTING & APPLICATIONS 2015年第4期26卷 911-928页

作者： Lin, Faa-Jeng Tan, Kuang-Hsiung Fang, Dun-Yi Natl Cent Univ Dept Elect Engn Chungli 320 Taiwan Natl Def Univ Chung Cheng Inst Technol Dept Elect & Elect Engn Taoyuan 335 Taiwan

An intelligent controlled three-phase squirrel-cage induction generator (SCIG) system for grid-connected wind power applications using hybrid wavelet fuzzy neural network (WFNN) is proposed in this study. First, the indirect field-oriented mechanism is implemented for the control of the SCIG system. Then, an AC/DC power converter and a DC/AC power inverter are developed to convert the electric power generated by a three-phase SCIG to power grid. Moreover, the dynamic model of the SCIG system and an ideal computed torque controller are developed for the control of the square of DC-link voltage. Furthermore, an intelligent hybrid WFNN controller and two WFNN controllers, which are computation intensive approaches, are proposed for the AC/DC power converter and the DC/AC power inverter, respectively, to improve the transient and steady-state responses of the SCIG system at different operating conditions. In the intelligent hybrid WFNN controller, to relax the requirement of the lumped uncertainty in the design of the ideal computed torque controller, a WFNN is designed as an uncertainty observer to adapt the lumped uncertainty online. Finally, the feasibility and effectiveness of the SCIG system for grid-connected wind power applications are verified with experimental results.

关键词： Intelligent hybrid control Wavelet fuzzy neural network Indirect field-oriented mechanism Squirrel-cage induction generator projection algorithm

来源：评论

学校读者我要写书评

暂无评论

Identification methods for Hammerstein nonlinear systems

引用

DIGITAL SIGNAL PROCESSING 2011年第2期21卷 215-238页

作者： Ding, Feng Liu, Xiaoping Peter Liu, Guangjun Jiangnan Univ Control Sci & Engn Res Ctr Wuxi 214122 Peoples R China Jiangnan Univ Minist Educ Key Lab Adv Proc Control Light Ind Wuxi 214122 Peoples R China Carleton Univ Dept Syst & Comp Engn Ottawa ON K1S 5B6 Canada Ryerson Univ Dept Aerosp Engn Toronto ON M5B 2K3 Canada

This paper considers the identification problems of the Hammerstein nonlinear systems. A projection and a stochastic gradient (SG) identification algorithms are presented for the Hammerstein nonlinear systems by using the gradient search method. Since the projection algorithm is sensitive to noise and the SG algorithm has a slow convergence rate, a Newton recursive and a Newton iterative identification algorithms are derived by using the Newton method (Newton-Raphson method), in order to reduce the sensitivity of the projection algorithm to noise, and to improve convergence rates of the SG algorithm. Furthermore, the performances of these approaches are analyzed and compared using a numerical example, including the parameter estimation errors, the stationarity and convergence rates of parameter estimates and the computational efficiency. (C) 2010 Elsevier Inc. All rights reserved.

关键词： Recursive identification Parameter estimation Stochastic gradient Least squares projection algorithm Newton iterations Hammerstein models Wiener models

来源：评论

学校读者我要写书评

暂无评论

Degarbling Mode S replies received in single channel stations with a digital incremental improvement

引用

IET RADAR SONAR AND NAVIGATION 2015年第6期9卷 681-691页

作者： Galati, Gaspare Petrochilos, Nicolas Piracci, Emilio G. Univ Roma Tor Vergata Dept Elect Engn I-00133 Rome Italy Univ Reims CReSTIC F-51687 Reims 2 France

Multilateration and automatic dependent surveillance - broadcast systems are used in air traffic control to detect, locate and identify cooperating aircraft using signals emitted by airborne transponders and received by dedicated ground stations. In areas with a high traffic density, these stations may receive simultaneously several superimposed signals. Present operational systems use only one receiving channel connected to a non-directional antenna. When the received replies are superimposed, that is, 'garbled', their detection and/or decoding are severely affected in nowadays equipment. The aim of this study is to transform the single channel problem into a multiple channels problem in order to solve it using specific knowledge about the Mode S signals. In fact, the multiple channels problem is a typical signals separation problem applied to Mode S mixture for which several algorithms already exist. The authors' algorithm, named projection algorithm (PA) single antenna, is based on the existing PA and can be easily implemented on existing receiving stations. The effectiveness of their method is demonstrated using real data collected from their experimental receiver.

关键词： source separation air traffic control aircraft communication transponders decoding signal detection aircraft antennas telecommunication traffic degarbling mode S replies single channel stations digital incremental improvement automatic dependent surveillance-broadcast systems multilateration air traffic control aircraft airborne transponders dedicated ground stations high traffic density superimposed signals nondirectional antenna receiving channel decoding single channel problem multiple channel problem signal separation problem mode S signals projection algorithm PA single antenna receiving stations experimental receiver

来源：评论

学校读者我要写书评

暂无评论

A new transit assignment model based on line and node strategies

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2021年 150卷 121-142页

作者： Ren, Hualing Song, Yingjie Long, Jiancheng Si, Bingfeng Beijing Jiaotong Univ Sch Traff & Transportat Beijing 100044 Peoples R China Hefei Univ Technol Sch Automot & Transportat Engn Hefei 230009 Peoples R China

Passengers traveling on transit networks involve two kinds of decision-making strategies: deciding which lines are attractive at an origin or transfer node (denoted line strategy, LS), or deciding which node to transfer at when riding a line (denoted node strategy, NS). Combining these two strategies, this paper proposes a novel variational inequality formulation for the user equilibrium passenger assignment problem. The inclusion of the NS eliminates the need for passenger assignment on a large augmented graph, reducing the modeling complexity and making it easier to track all passengers' travel routes. Moreover, constraints on the maximal number of transfers-which are crucial in practical decision-making on transit networks-are explicitly included, further drastically reducing the set of passengers' feasible strategies. Furthermore, some extant strategy-based transit assignment models are shown to be a special case of the proposed model when the transfer constraint is removed. Finally, the properties of the proposed model are illustrated on a small network, and the model and algorithm exhibit huge advantages on the chosen transit subnetwork of Beijing.

关键词： Transit assignment Line and node strategy Transfer constraint Variational inequality problem projection algorithm

来源：评论

学校读者我要写书评

暂无评论

ADMM-Based Multiperiod Optimal Power Flow Considering Plug-In Electric Vehicles Charging

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2018年第4期33卷 3886-3897页

作者： Fan, Hua Duan, Chao Zhang, Chuan-Ke Jiang, Lin Mao, Chengxiong Wang, Dan Huazhong Univ Sci & Technol Sch Elect & Elect Engn State Key Lab Adv Electromagnet Engn & Technol Wuhan 430074 Hubei Peoples R China Xi An Jiao Tong Univ Dept Elect Engn Xian 710049 Shaanxi Peoples R China Univ Liverpool Dept Elect Engn & Elect Liverpool L69 3GJ Merseyside England China Univ Geosci Sch Automat Wuhan 430074 Hubei Peoples R China

When plug-in electric vehicles (PEVs) participate in grid operation, the intertemporal feature of PEVs charging transforms the traditional optimal power flow (OPF) problem into multiperiod OPF (MOPF) problem. In the case that the population of PEVs is huge, the large number of variables and constraints renders the centralized solution technique unsuitable to solve the MOPF problem. Therefore, a distributed algorithm based on alternating direction method of multipliers is developed to decompose the MOPF into two update steps that are solved in an alternating and iterative style. To improve the solution efficiency, the second update step is transformed into a Euclidean projection problem by approximating the original objective with a surrogate function. Then, a projection algorithm is utilized to solve the approximate problem. Numerical results show that this reformulated model obtains suboptimal solutions with small relative error, but gains considerable speed-up. Furthermore, its scalability and effectiveness are tested in the 119-bus and 906-bus distribution networks.

关键词： Plug-in electric vehicles multiperiod optimal power flow alternating direction method of multipliers (ADMM) projection algorithm

来源：评论

学校读者我要写书评

暂无评论

Multiscale Texture Extraction with Hierarchical (BV,Gp,L²) Decomposition

引用

JOURNAL OF MATHEMATICAL IMAGING AND VISION 2013年第2期45卷 148-163页

作者： Tang, Liming He, Chuanjiang Chongqing Univ Coll Math & Stat Chongqing 401331 Peoples R China

In this paper, we first present a hierarchical (BV,G (p) ,L (2)) variational decomposition model and then use it to achieve multiscale texture extraction which offers a hierarchical, separated representation of image texture in different scales. The starting point is the use of the variational (BV,G (p) ,L (2)) decomposition;a given image faL (2)(Omega) is decomposed into a sum of u (0)+v (0)+r (0), where (u (0),v (0))a(BV(Omega),G (p) (Omega)) is the minimizer of an energy functional E(f,lambda (0);u,v) and r (0) is the residual (i.e. r (0)=f-u (0)-v (0)). In this decomposition, v (0) represents the fixed scale texture of f, which is measured by the parameter lambda (0). To achieve a multiscale representation, we proceed to capture essential textures of f which have been absorbed by the residuals. Such a goal can be achieved by iterating a refinement decomposition to the residual of the previous step, i.e. r (i) =u (i+1)+v (i+1)+r (i+1), where (u (i+1),v (i+1)) is the minimizer of E(r (i) ,lambda (0)/2 (i+1);u,v). In this manner, we can obtain a hierarchical representation of f. In addition, we discuss some theoretical properties of the hierarchical (BV,G (p) ,L (2)) decomposition and give its numerical implementation. Finally, we apply this hierarchical decomposition to the multiscale texture extraction. The performance of this method is demonstrated with both synthetic and real images.

关键词： Multiscale texture extraction Variational decomposition Hierarchical decomposition Duality projection algorithm Fixed point iteration scheme

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：