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

IEEE International Conference on Industrial Engineering and Engineering Management (IEEM 2009)

作者： Ebrahimipur, V. Shabani, A. Univ Tehran Dept Ind Engn Tehran Iran

ISBN: (纸本)9781424448692

In this paper a multi state series-weighted k-out-of-n system is presented. This system has S multi state weighted k-out-of-n subsystems that are seriely connected. A new approach is used for calculating reliability of the system. In this approach first we find reliability of each subsystem by recursive algorithm, and then the universal moment generating function (UMGF) is used to calculate reliability of the whole system. In the following reliability of the system is optimized. Multi-state system (MSS) reliability is defined as the ability to maintain a specified performance level. Objective function in the optimization model is maximizing the reliability of the system, constraint is cost and weight of the system and decision variables are the number and the versions of components for each subsystem. Since this problem is a combinatorial and Np-hard problem, ant colony algorithm is used for optimization

关键词： reliability multi state weighted k-out-of-n universal moment generating function (UMGF) recursive algorithm ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

A recursive least M-estimate adaptive controller for active impulsive noise control 35

A recursive least M-estimate adaptive controller for active ...

引用

35th Chinese Control Conference (CCC)

作者： Lu Lu Zhao Haiquan Zhao Yu Yi Minist Educ Key Lab Magnet Suspens Technol & Maglev Vehicle Chengdu Peoples R China Southwest Jiaotong Univ Sch Elect Engn Chengdu Peoples R China

ISBN: (纸本)9789881563910

The filtered-x recursive square (FxRLS) algorithm has been proven to be efficient for active noise control (ANC) systems. Unfortunately, its performance deteriorates when the ANC systems are corrupted by impulsive noises. To reduce this drawback, a novel filter-x recursive least M-estimate adaptive (FxRLM) algorithm for ANC is proposed in this paper, which can overcome the adverse effect of impulsive noise on the adaptation of controller. Simulations in the context of ANC system show that the proposed FxRLM algorithm outperforms the conventional FxRLS, filtered-x least mean p-power (FxLMP) and robust FxLMS (RFxLMS) algorithms.

关键词： Active noise control Impulsive interference recursive algorithm M-estimate

来源：评论

学校读者我要写书评

暂无评论

PARAMETER IDENTIFICATION OF A SINGLE-PHASE INDUCTION MOTOR USING RLS algorithm

PARAMETER IDENTIFICATION OF A SINGLE-PHASE INDUCTION MOTOR U...

引用

10th Brazilian Power Electronics Conference

作者： Vieira, Rodrigo Padilha Azzolin, Rodrigo Zelir Gruendling, Hilton Abilio Univ Fed Santa Maria GEPOC BR-97119900 Santa Maria RS Brazil

ISBN: (纸本)9781424433698

This paper presents a methodology to modeling and parameter identification of Single-Phase Induction Motors (SPIM). From the machine model two classical recursive Least Square (RLS) algorithms are applied at qd axes, based in current measurements with standstill rotor. Thus, the identified parameters can improve the performance of the Field Oriented Control (FOC) and sensorless techniques. Furthermore, the correct parameters of SPIM allow a better representation of dynamic simulation behavior of SPIM. Simulation and experimental results are presented to provide the effectiveness of the method.

关键词： Single-Phase Induction Motor Parameter Identification recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Long-run On-line Identification with Hybrid Regularized Exponential Forgetting Method

Long-run On-line Identification with Hybrid Regularized Expo...

引用

15th International Carpathian Control Conference (ICCC)

作者： Vachalek, Jan Bartko, Michal Bizub, Jan Slovak Univ Technol Bratislava Fac Mech Engn Inst Automat Measurement & Appl Informat Bratislava 81231 Slovakia

ISBN: (纸本)9781479935284

The paper compares three on-line identification methods with forgetting of unnecessary data: regularized exponential forgetting (REF), regularized exponential forgetting with alternative covariance matrix (REFACM) and the newly created hybrid regularized exponential forgetting with alternative covariance matrix (HREFACM), which is composed of the first two and uses their benefits. Their quality and ability to track time varying parameters of dynamic systems in terms of long-run operation is analyzed by the comparison of integral sum of the Euclidean norm of the deviation of the parameters or outputs (IS), and integral sum of prediction error count (PE). In previous tests of long-run operation of time variant dynamic systems the REF algorithm showed his advantages during short simulations and REFACM proved its quality in long simulations. All three algorithms are tested by benchmark simulations in the Matlab - Simulink software environment, where the resulting IS and PE values are monitored and then compared to each other.

关键词： recursive algorithm forgetting method time varying parameters long-run on-line identification adaptive control

来源：评论

学校读者我要写书评

暂无评论

Improving Reliability of Aircraft Electric Power Distribution System

Improving Reliability of Aircraft Electric Power Distributio...

引用

IEEE Green Energy and Systems Conference (IGESC)

作者： Chwa, Justin Ameri, Alireza Mozumdar, Mohammad Calif State Univ Long Beach Dept Elect Engn Long Beach CA 90840 USA

ISBN: (纸本)9781479973330

In an Aircraft Electric Power Distribution (EPD) system, the power is distributed from generators to loads, sensors and actuators through AC and DC distribution buses using control switches. Over the years, with the increase demands of loads and its power requirement, EPD system must be optimized in order to operate the system efficiently. In this paper, we propose a synthesis tool based on a need-based design method to obtain optimal topology of EPD system considering maximum reliability, continuous connectivity, power requirement, minimal cost, and node failure. We treat the EPD system as an optimization problem by using Mixed-Integer Linear Programming (MILP) to achieve maximum reliability while satisfying a set of constraints.

关键词： Fault Tree Analysis (FTA) linear solver Mixed-Integer Linear Programming (MILP) recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Hypoglycemia early alarm systems based on recursive autoregressive partial least squares models

引用

Journal of Diabetes Science and Technology 2013年第1期7卷 206-214页

作者： Bayrak, Elif Seyma Turksoy, Kamuran Cinar, Ali Quinn, Lauretta Littlejohn, Elizabeth Rollins, Derrick Department of Chemical and Biological Engineering Illinois Institute of Technology Chicago IL 60616 10 W. 33rd St. United States Department of Biomedical Engineering Illinois Institute of Technology Chicago IL United States College of Nursing University of Illinois at Chicago Chicago IL United States Department of Pediatrics Biological Sciences Division University of Chicago Chicago IL United States Department of Chemical and Biological Engineering Iowa State University Ames IA United States

Background: Hypoglycemia caused by intensive insulin therapy is a major challenge for artificial pancreas systems. Early detection and prevention of potential hypoglycemia are essential for the acceptance of fully automated artificial pancreas systems. Many of the proposed alarm systems are based on interpretation of recent values or trends in glucose values. In the present study, subject-specific linear models are introduced to capture glucose variations and predict future blood glucose concentrations. These models can be used in early alarm systems of potential hypoglycemia. Method: A recursive autoregressive partial least squares (RARPLS) algorithm is used to model the continuous glucose monitoring sensor data and predict future glucose concentrations for use in hypoglycemia alarm systems. The partial least squares models constructed are updated recursively at each sampling step with a moving window. An early hypoglycemia alarm algorithm using these models is proposed and evaluated. Results: Glucose prediction models based on real-time filtered data has a root mean squared error of 7.79 and a sum of squares of glucose prediction error of 7.35% for six-step-ahead (30 min) glucose predictions. The early alarm systems based on RARPLS shows good performance. A sensitivity of 86% and a false alarm rate of 0.42 false positive/day are obtained for the early alarm system based on six-step-ahead predicted glucose values with an average early detection time of 25.25 min. Conclusions: The RARPLS models developed provide satisfactory glucose prediction with relatively smaller error than other proposed algorithms and are good candidates to forecast and warn about potential hypoglycemia unless preventive action is taken far in advance. © Diabetes Technology Society.

关键词： Hypoglycemia alarms Partial least squares regression recursive algorithm Type 1 diabetes mellitus

来源：评论

学校读者我要写书评

暂无评论

An improved methodology for evaluating availability of multistate series-parallel systems using the polynomial distribution function

引用

INTERNATIONAL JOURNAL OF QUALITY & RELIABILITY MANAGEMENT 2020年第6-7期37卷 1033-1047页

作者： Ghalhari, Zahra Hashemzadeh Hamadani, Ali Zeinal Isfahan Univ Technol Dept Ind Engn Esfahan Iran

Purpose This paper employs new methods to evaluate the availability of multistate series-parallel systems, in which a number of similar components are available in each subsystem. Design/methodology/approach In this paper, polynomial distribution function (PDF) is combined with universal generating function (UGF) and recursive algorithm (RA) methods to evaluate the availability of multistate series-parallel systems. To achieve this goal, the PDF is initially used to determine the performance rates and the probabilities corresponding to the performance states of the similar components in a subsystem. The obtained results are used to evaluate the system availability via the UGF and RA methods. Findings It is shown that the combined UGF and PDF (UGF-PDF) and also the combined RA and PDF (RA-PDF) methods require less computational time than did the UGF and RA methods, respectively. Originality/value In the UGF and RA methods, there is no difference in system availability evaluation time when considering similar or different components in each subsystem. But the proposed methods in this article do not have this restrictions;therefore, these methods can be used to evaluate system availability in optimal redundancy allocation problems. As a result, using these methods reduces the optimization time of those problems.

关键词： Multistate system Availability Universal generating function recursive algorithm Polynomial distribution function

来源：评论

学校读者我要写书评

暂无评论

A Linear Time algorithm for Rolling Binary Trees 17

A Linear Time Algorithm for Rolling Binary Trees

引用

IEEE EUROCON -17th International Conference on Smart Technologies

作者： Tanev, George Bozinovski, Adrijan UACS Sch Comp Sci & Informat Technol Skopje North Macedonia

ISBN: (纸本)9781509038435

This paper presents a new, linear algorithm for performing the roll operation on binary trees. Based on the inorder tree traversal, this algorithm has a very simple structure and achieves linear time and space complexity. A detailed analysis of this algorithm is presented, showing how its design contributes to a more streamlined operation and an improved time complexity over the original-and only other known to the authors-binary tree roll algorithm. A practical implementation of both algorithms is benchmarked by counting the minimum and maximum numbers of basic operations, as well as measuring the minimum and maximum amounts of memory space required by the algorithms to run to completion, across all binary tree topologies with progressively increasing numbers of nodes. Results obtained from this empirical analysis quantify the best and worst-case complexities of both algorithms and show how the improved algorithm outperforms the original one asymptotically, particularly in regards to their time complexity.

关键词： binary tree roll operation recursive algorithm asymptotic analysis

来源：评论

学校读者我要写书评

暂无评论

AdaVol: An recursive Prediction Method

引用

ECONOMETRICS AND STATISTICS 2022年 23卷 19-35页

作者： Werge, Nicklas Wintenberger, Olivier Sorbonne Univ LPSM 4 Pl Jussieu F-75005 Paris France

Quasi-Maximum Likelihood (QML) procedures are theoretically appealing and widely used for statistical inference. While there are extensive references on QML estimation in batch settings, it has attracted little attention in streaming settings until recently. An investigation of the convergence properties of the QML procedure in a general conditionally heteroscedastic time series model is conducted, and the classical batch optimization routines extended to the framework of streaming and large-scale problems. An adaptive recursive estimation routine for GARCH models named AdaVol is presented. The AdaVol procedure relies on stochastic approximations combined with the technique of Variance Targeting Estimation (VTE). This recursive method has computationally efficient properties, while VTE alleviates some convergence difficulties encountered by the usual QML estimation due to a lack of convexity. Empirical results demonstrate a favorable trade-off between AdaVol's stability and the ability to adapt to time-varying estimates for real-life data. (c) 2021 EcoSta Econometrics and Statistics. Published by Elsevier B.V. All rights reserved.

关键词： Volatility models Quasi-likelihood recursive algorithm GARCH Prediction method Stock index

来源：评论

学校读者我要写书评

暂无评论

recursive and parallel constructions of independent spanning trees in alternating group networks

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY 2020年第4期5卷 234-262页

作者： Huang, Jie-Fu Hsieh, Sun-Yuan Natl Cheng Kung Univ Dept Comp Sci & Informat Engn Tainan Taiwan Natl Cheng Kung Univ Dept Comp Sci & Informat Engn Inst Med Informat Int Ctr Sci Dev Shrimp Aquaculture 1 Univ Rd Tainan 701 Taiwan Natl Cheng Kung Univ Ctr Innovat FinTech Business Models Tainan Taiwan

In this paper, we propose a recursive algorithm and a parallel algorithm for constructing independent spanning trees in ANn. The main ideas of the recursive algorithm are to construct large trees from small trees, use triangle breadth-first search (TBFS) to build a frame of an IST, and use breadth-first search (BFS) to link the rest of the nodes. The main ideas of the parallel algorithm are to build frames through TBFS in parallel, and to use the specific rules to link the rest of the nodes in parallel. We prove the correctness of both algorithms for constructing ISTs in AN(n) . Both algorithms are accurate;furthermore, the parallel algorithm is more ecient than the recursive algorithm. (An extended abstract of this paper appeared in: Jie-Fu Huang and Sun-Yuan Hsieh 'Two methods for constructing independent spanning trees in alternating group networks' Proceedings of International Conference on Creative Lifestyle Computing (ICCLC), 2020.)

关键词： Independent spanning trees alternating group networks Cayley graph recursive algorithm parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：