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

Minimum distance between the faces of two convex polyhedra: A sufficient condition

JOURNAL OF GLOBAL OPTIMIZATION 2003年第4期26卷 361-385页

作者： Llanas, B De Sevilla, MF Feliu, V ETSI Caminos Dpto Matemat & Informat Madrid 28040 Spain ETSI Ind Dpto Ingn Elect Ciudad Real 13071 Spain

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.

关键词： distance between convex polyhedra local descent projection algorithms sufficient condition of global minimum

来源：评论

学校读者我要写书评

暂无评论

A MILDLY WEAKER SUFFICIENT CONDITION IN IIR ADAPTIVE FILTERING

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1994年第1期42卷 203-206页

作者： NAYERI, M Department of Electrical Engineering Michigan State University East Lansing MI USA

The cross-covariance matrix of two stable autoregressive (AR) sequences is considered. A mildly weaker condition is identified that ensures the nonsingularity of this matrix. As one consequence of this result, a weaker sufficient condition is obtained that would guarantee the unimodality of the mean-square output error surface of an IIR adaptive filter with white noise excitation.

关键词： Sufficient conditions Adaptive filters Image reconstruction Equations IIR filters projection algorithms Signal processing White noise Quantization Upper bound

来源：评论

学校读者我要写书评

暂无评论

Signal recovery by best feasible approximation

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 1993年第2期2卷 269-271页

作者： Combettes, Patrick L. CUNY City Coll Dept Elect Engn New York NY 10031 USA CUNY Grad Sch New York NY 10031 USA

The objective of set theoretic signal recovery is to find a feasible signal in the form of a point in the intersection S of sets modeling the information available about the problem. For problems in which the true signal is known to lie near a reference signal r, the solution should not be any feasible point but one which best approximates r, i.e., a projection of r onto S. Such a solution cannot be obtained by the feasibility algorithms currently in use, e.g., the method of projections onto convex sets (POCS) and its offsprings. In this work, methods to project a point onto the intersection of closed and convex sets in a Hilbert space are introduced and applied to signal recovery by best feasible approximation of a reference signal. These recent algorithms are closely related to the above projection methods, to which they add little computational complexity.

关键词： Hilbert space Estimation theory projection algorithms Convergence Computational complexity Signal restoration Constraint theory Silicon compounds Stress State estimation

来源：评论

学校读者我要写书评

暂无评论

Upscaling PV Power Considering Module Orientations

引用

IEEE JOURNAL OF PHOTOVOLTAICS 2017年第3期7卷 941-944页

作者： Killinger, Sven Guthke, Philipp Semmig, Andreas Mueller, Bjoern Wille-Haussmann, Bernhard Fichtner, Wolf Fraunhofer Inst Solar Energy Syst ISE D-79110 Freiburg Germany Karlsruhe Inst Technol D-76187 Karlsruhe Germany TransnetBW GmbH D-70173 Stuttgart Germany

Only a small share of photovoltaic (PV) systems installed in Germany are equipped with near real-time measurement devices. To estimate the generated power of a large number of unmeasured photovoltaic systems (e.g., to determine the sum of all systems in a portfolio), existing methodologies typically incorporate an upscaling step based on measured reference units. The upscaling approach presented in this paper extends this methodology by additionally taking into account the module orientation of all reference and target systems. Unknown module orientations are determined in a parameterization step using available geographic information system (GIS) based data sources. The power of the reference units is then used to estimate the power generation of all target units by applying a power projection and spatial interpolation as described in the literature. This new approach leads to improvements up to similar to 5% in terms of RMSErel values by offering a high spatial resolution and covering individual differences of PV systems.

关键词： Interpolation parameter estimation photovoltaic (PV) grid-connected systems and building integration projection algorithms

来源：评论

学校读者我要写书评

暂无评论

Mutual coupling compensation in a power synthesis technique of planar array antennas

引用

IEE PROCEEDINGS-MICROWAVES ANTENNAS AND PROPAGATION 2000年第2期147卷 95-99页

作者： D'Elia, G Soldovieri, F Di Massa, G Univ Naples Federico II Dipartimento Ingn Eletron & Tecomunicazioni I-80125 Naples Italy Univ Calabria Dipartimento Elettron Informat & Sistemist I-87036 Rende Italy

A technique for the power synthesis of planar arrays, taking into account the mutual coupling between the elements of the array, is presented. This technique, which accounts for the mutual coupling by introducing the port admittance matrix, is based on a generalised projection algorithm and allows constraints on the excitation coefficients to be considered. To alleviate the difficulty related to the trapping of the solution algorithm by a local minimum of the objective functional, the squared amplitude of the co-polar, cross-polar far field components and of the excitation voltages are exploited in defining the objective functional. This choice makes it possible to manage a projection algorithm handling sets whose geometrical properties result in being favourable with respect to the trapping problem. Numerical results show the effectiveness of the approach and the crucial role played by accounting for mutual coupling in order to ensure the reliability of the synthesis procedure.

关键词： planar antenna arrays synthesis ANTENNA projection algorithms excitation voltage trapping Mutual coupling Antenna arrays Planar antennas Local Minimum

来源：评论

学校读者我要写书评

暂无评论

A Multiattribute and Multidimensional Based Comprehensive Evaluation Method for New Multipulse Integrated Metro Traction Power Supply System

引用

IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS 2020年第6期56卷 6138-6149页

作者： An, Bonan Li, Yong Lee, Wei-Jen Zhou, Houliang Zhou, Fangyuan Hunan Univ Coll Elect & Informat Engn Changsha 410082 Peoples R China Univ Texas Arlington Arlington TX 76019 USA CRRC Zhuzhou Inst Co Ltd Zhuzhou 412001 Peoples R China

To improve the comprehensive performance of the metro traction power supply system (MTPSS), a new multipulse integrated metro traction power supply system (MI-MTPSS) is proposed in this article. The configuration and characteristics of MI-MTPSS are introduced, and based on the practical bilateral-ring power supply structure, a series of MTPSS-combinations with different standby equipment have been constructed. Meanwhile, a multiattribute and multidimensional based comprehensive evaluation method is proposed and adopted for evaluating the MTPSS-combinations comprehensively and quantitatively. According to the practical data, the practicability and reliability of the system are verified, and the MI-MTPSS is expected to be used in an industrial application in the future.

关键词： Rectifiers Indexes Power quality Reliability Windings Topology Coefficient of variation economic indicators performance evaluation power quality projection algorithms rail transportation stability analysis technique for order preference by similarity to an ideal solution (TOPSIS) traction power supplies transformers

来源：评论

学校读者我要写书评

暂无评论

The successive projections algorithm for interval selection in partial least squares discriminant analysis

引用

ANALYTICAL METHODS 2016年第41期8卷 7522-7530页

作者： de Sousa Fernandes, David Douglas Almeida, Valber Elias Pinto, Licarion Veras, Germano Harrop Galvao, Roberto Kawakami Gomes, Adriano Araujo Ugulino Araujo, Mario Cesar Univ Fed Paraiba Dept Quim Lab Automacao & Instrumentacao Quim Anal Quimiome Caixa Postal 5093 BR-58051970 Joao Pessoa Paraiba Brazil Univ Estadual Paraiba Ctr Ciencia & Tecnol Lab Quim Anal & Quimiometria BR-58429500 Campina Grande Paraiba Brazil Inst Tecnol Aeronaut Div Engn Elect BR-12228900 Sao Jose Dos Campos SP Brazil Univ Fed Sul & Sudoeste Para Fac Quim Inst Ciencia Exatas Folha 17Quadra 04 BR-68505080 Maraba Para Brazil

This paper proposes a new interval selection approach for PLS-DA modelling, which is developed as an extension of the recently introduced iSPA-PLS method for multivariate calibration. The proposed iSPA-PLS-DA algorithm is tested in two case studies concerning the classification of five types of vegetable oils employing square-wave voltammetry and the classification of five species of bacteria (Escherichia coli, Enterococcus faecalis, Streptococcus salivarius, Streptococcus oralis, and Staphylococcus aureus) using digital images. For comparison, the iPLS-DA algorithm for interval selection is also employed, in standard and backward modes. In both case studies, iSPA-PLS-DA provided correct classification rates larger than or equal to those obtained by PLS-DA using all variables and iPLS-DA with single or multiple intervals.

关键词： Streptococcus oralis Streptococcus salivarius projection algorithms Vegetable Oils algorithms discriminant analysis Case studies Digital images Partial least squares

来源：评论

学校读者我要写书评

暂无评论

Norm-constrained adaptive algorithms for sparse system identification based on projections onto intersections of hyperplanes

引用

SIGNAL PROCESSING 2016年 118卷 259-271页

作者： Beck, Eduardo Ortiz Batista, Eduardo Luiz Seara, Rui Univ Fed Santa Catarina Dept Elect & Elect Engn LINSE Circuits & Signal Proc Lab BR-88040900 Florianopolis SC Brazil

This paper introduces a novel approach to derive norm-constrained adaptive algorithms for sparse system identification. In contrast to other similar approaches found in the literature, the proposed approach is focused primarily on keeping the a posteriori error equal to zero (which is a characteristic of the normalized least-mean-square algorithm) while seeking to satisfy a norm constraint. To this end, the proposed algorithms look directly for a vector belonging to the intersection of a zero-error hyperplane and a hyperplane resulting from a relaxed norm constraint. This somewhat simpler strategy leads to effective sparsity-promoting adaptive algorithms that exhibit low computational complexity and use parameters that are easy to adjust. In this context, a general framework that allows obtaining adaptive algorithms using different norm functions is devised. From this framework, two norm-constrained algorithms based on the l(1) and l(0) norms are obtained. Moreover, enhanced versions of these algorithms are developed aiming to make them independent of user-defined norm-bound parameters. Numerical simulation results corroborate the effectiveness of the proposed framework as well as the very good performance of the obtained algorithms. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Adaptive filtering Norm-constrained optimization projection algorithms Sparse impulse response System identification

来源：评论

学校读者我要写书评

暂无评论

Subgradient of Cycle-Based Aging Cost Function and Its Application in Optimal Operation of Battery Energy Storage System With Multiple Subsystems

引用

IEEE TRANSACTIONS ON ENERGY CONVERSION 2024年第1期39卷 625-643页

作者： Diao, Rui Hu, Zechun Song, Yonghua Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Univ Macau State Key Lab Internet Things Smart City Macau 999078 Peoples R China

Recently,many researchers have adopted the cycle-based degradation model to estimate the aging of battery energy storage system (BESS) based on the cycle information obtained from the rainflow counting method. However, the lack of a mathematical expression for the rainflow counting method is one of the biggest obstacles to the widespread use of the cycle-based degradation model. This article deduces the exact analytical subgradients of the cycle-based aging cost function, which makes it possible to efficiently solve the optimal operation problem without the mathematical expression of the rainflow counting method. We introduce the subgradient projection algorithm to get the theoretical optimal operation in some special cases where the charge-discharge complementarity constraints can be relaxed. We also develop a heuristic algorithm based on the subgradient method to avoid simultaneous charging and discharging in general cases. The effectiveness of the proposed methodologies has been demonstrated with extensive numerical experiments. In the scenarios discussed in this article, implementing the cycle-based operation rather than the energy-based operation reduces the aging cost by about 12%. When the duration of the simulation is 60 minutes, the computation time of a general-purpose solver is about 74 minutes, and the proposed algorithm only needs 21 seconds.

关键词： Aging Batteries Degradation Cost function State of charge Costs projection algorithms Battery energy storage system optimal operation degradation model rainflow counting method aging cost subgradient

来源：评论

学校读者我要写书评

暂无评论

INHIBITORY GRIDS AND THE ASSIGNMENT PROBLEM

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS 1993年第2期4卷 319-331页

作者： WOLFE, WJ MACMILLAN, JM BRADY, G MATHEWS, R ROTHMAN, JA MATHIS, D OROSZ, MD ANDERSON, C ALAGHBAND, G Department of Computer Science and Engineering University of Colorado Denver CO USA Dept. of Comput. Sci. & Eng. Colorado Univ. Denver CO USA

This paper analyzes a family of symmetric neural networks that solve a simple version of the Assignment Problem (AP). We analyze the suboptimal performance of these networks and compare the results to optimal answers obtained by linear programming techniques. We use the Interactive Activation model to define the network dynamics-a model that is closely related to the Hopfield-Tank model. A systematic analysis of hypercube corner stability and eigenspaces of the connection strength matrix leads to network parameters that provide feasible solutions 100% of the time and to a novel projection algorithm that significantly improves performance. Two formulations of the problem are discussed: i) nearest corner: encode the assignment numbers as initial activations, and ii) lowest energy corner: encode the assignment numbers as external inputs.

关键词： Neural networks Linear programming Performance analysis Algorithm design and analysis Hypercubes Stability analysis projection algorithms Random number generation Computer science Analog circuits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：