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

Blind identification of IIR model based on output over-sampling

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1998年第11期E81A卷 2350-2360页

作者： Kagiwada, H Sun, LM Sano, A Liu, WJ Keio Univ Fac Sci & Technol Yokohama Kanagawa 2238522 Japan Xian Jiaotong Univ Dept Automat Control Engn Xian 710049 Peoples R China

A new identification algorithm based on output over-sampling scheme is proposed for a IIR model whose input signal can not be available directly. By using only an output signal sampled at higher rate than unknown input, parameters of the IIR model can be identified. It is clarified that the consistency of the obtained parameter estimates is assured under some specified conditions. Further an efficient recursive algorithm for blind parameter estimation is also given for practical applications. Simulation results demonstrate its effectiveness in both system and channel identification.

关键词： blind identification channel identification over-sampling consistency recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimum-Weighted RLS Channel Estimation for Rapid Fading MIMO Channels

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2008年第11期7卷 4248-4260页

作者： Akino, Toshiaki Koike Harvard Univ Sch Engn & Appl Sci Cambridge MA 02138 USA

This paper investigates on an accurate channel estimation scheme for fast fading channels in multiple-input multiple-output (MIMO) mobile communications. A high-order exponential-weighted recursive least-squares (EW-RLS) method has been known as a good channel estimation scheme in rapid fading. However, there exists a drawback that we need to properly adjust the estimation parameters of a forgetting factor and an estimation order according to the channel environment. In this paper, we theoretically derive an optimum-weighted LS (OW-LS) channel estimation based on the statistical knowledge of the spatio-temporal channel correlation. Through the analysis, we reveal that the zero-th order polynomial becomes optimal when the optimum-weighting is employed. Furthermore, we propose an efficient recursive algorithm for channel tracking in order to reduce the computational complexity. Since the proposed scheme automatically adapts the weighting coefficients to the channel condition, it has a significant advantage in mean-square error (MSE) performance compared to the EW-RLS scheme.

关键词： Weighted least-squares (LS) channel estimation multiple-input multiple-output (MIMO) optimum-weighting recursive algorithm fast fading channel

来源：评论

学校读者我要写书评

暂无评论

Two algorithms for Constructing Independent Spanning Trees in (n,k)-Star Graphs

引用

IEEE ACCESS 2020年 8卷 175932-175947页

作者： Huang, Jie-Fu Cheng, Eddie Hsieh, Sun-Yuan Natl Cheng Kung Univ Dept Comp Sci & Informat Engn Tainan 701 Taiwan Oakland Univ Dept Math & Stat Rochester MI 48309 USA Natl Cheng Kung Univ Dept Comp Sci & Informat Engn Inst Med InformatInst Mfg Informat & Syst Ctr Innovat FinTech Business ModelsInt Ctr Sci D Tainan 701 Taiwan

In a graph G, two spanning trees T-1 and T-2 are rooted at the same vertex r. If, for every v is an element of V (G), the paths from v to the root r in T 1 and T 2 are internally vertex-disjoint, they are called independent spanning trees (ISTs). ISTs can be applied in numerous fields, such as fault-tolerant broadcasting and secure message distribution. The (n,k)-star graphs S-n,S-k constitute a generalized version of the star network. The method of constructing ISTs in (n,k)-star graphs remains unknown. In this paper, we propose one recursive algorithm and one parallel algorithm for constructing ISTs on (n,k)-star graphs. The main ideas of the recursive algorithm are to use induction to change small trees into large trees, to use a modified breadth-first search (MBFS) traversal to create a frame for an IST, and to use a breadth-first search (BFS) traversal to connect the rest of nodes. The main ideas of the parallel algorithm are to create frames through MBFS traversals in parallel, and to use some specific rules to connect the rest of nodes in parallel. We also present validation proofs for both algorithms, and analyze the time complexities of both algorithms. The time complexity of the recursive algorithm in S-n,S-k is O(n x n!/(n-k)!), where n!/(n-k)! is the number of nodes of S-n,S-k. The time complexity of the parallel algorithm can be reduced to On!/(n-k)! if the system has n - 1 processors computing in parallel. Both algorithms are correct with the stated time complexity values;the parallel algorithm is more efficient than the recursive algorithm.

关键词： Independent spanning trees (n,k)-star graphs breadth-first search recursive algorithm parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

EXACT ANALYSIS FOR PAIRED BINARY DATA

引用

BIOMETRICS 1994年第4期50卷 964-974页

作者： HIRJI, KF Department of Biomathematics UCLA School of Medicine 90024-1766.

This paper provides an efficient algorithm to generate exact distributions for the bivariate logistic model with common and sub-unit-specific covariates. The algorithm can be used to analyze correlated paired binary response data from studies lacking a large sample size. Possible applications include a clinical trial with two distinct binary outcomes, a binary outcome cross-over or two-time point cohort study, and a pair-matched prospective study with binary outcome. Analysis of data from an ophthalmologic study is provided to illustrate the method. Extension to three or more correlated binary responses is also outlined.

关键词： BIVARIATE LOGISTIC MODEL PAIRED BINARY DATA recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Online Aerodynamic Model Structure Selection and Parameter Estimation for Fault-Tolerant Control

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2010年第3期33卷 707-723页

作者： Lombaerts, T. J. J. Van Oort, E. R. Chu, Q. P. Mulder, J. A. Joosten, D. A. Delft Univ Technol Control & Simulat Div Aerosp Software & Technol Inst NL-2600 GB Delft Netherlands Delft Univ Technol Delft Ctr Syst & Control NL-2600 GB Delft Netherlands

This paper describes a new recursive algorithm for the approximation of time-varying nonlinear aerodynamic models by means of a joint adaptive selection of the model structure and parameter estimation. This procedure is called adaptive recursive orthogonal least squares and is an extension and modification of the classical recursive orthogonal least-squares procedure. This algorithm is considered to be particularly useful for indirect fault-tolerant flight control, making use of model-based adaptive control routines. After the failure, a completely new aerodynamic model can be elaborated recursively with respect to structure, as well as parameter values. The performance of the identification algorithm is demonstrated on some simulation data sets.

关键词： Adaptive Control algorithm recursive algorithm Flight Control Control Surfaces Calibrated Airspeed Angle of Attack Aerodynamic Properties GPS Angle of Sideslip Inertial Navigation System

来源：评论

学校读者我要写书评

暂无评论

Reliability analysis based on the dual-CIST in shuffle-cubes

引用

APPLIED MATHEMATICS AND COMPUTATION 2021年 397卷 125900-125900页

作者： Qin, Xiao-Wen Hao, Rong-Xia Beijing Jiaotong Univ Dept Math Beijing Peoples R China

Let T-1, T-2, ..., T-k be k spanning trees of the graph G. They are called completely independent spanning trees (CISTs for short) if the paths joining every pair of vertices x and y in any two trees have neither vertex nor edge in common, except for x and y. In particular, two CISTs are called a dual CIST. The construction of a dual-CIST in a network has applications in the fault-tolerance of data transmission and the establishment of a protection routing. It has been proved that determining if a graph G admits a dual-CIST is NP-complete. In this paper, we show the existence of a dual-CIST in the n-dimensional shuffle-cube SQ(n) with n = 4k + 2 and k >= 1. Furthermore, recursive construction algorithms for the dual-CIST in SQ(n) are given. (C) 2021 Elsevier Inc. All rights reserved.

关键词： Completely independent spanning tree Shuffle-cube, CIST-partition recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

A linear time algorithm for the unbalanced Hitchcock transportation problem

引用

NETWORKS 2016年第2期67卷 170-182页

作者： Matsui, Tomomi Scheifele, Rudolf Tokyo Inst Technol Grad Sch Decis Sci & Technol Dept Social Engn Meguro Ku Tokyo 1528550 Japan Univ Bonn Res Inst Discrete Math Lennestr 2 D-53113 Bonn Germany

The Hitchcock transportation problem is a special case of the minimum cost flow problem where the graph is bipartite and capacities are infinite. If we let m denote the size of the larger and n the size of the smaller side of the bipartition, we call the Hitchcock transportation problem unbalanced if m is much larger than n. The unbalanced case arises in various applications, motivating the search for algorithms whose running time dependence on m is as small as possible. In this work, we give an algorithm with running time , which is the fastest known algorithm whose running time grows linearly in m. Moreover, we compare running times of algorithms for the Hitchcock transportation problem and the minimum cost flow problem and point out the fastest algorithms for particular relations of m and n, where m and n denote the number of edges and vertices in the context of the minimum cost flow problem. (c) 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 67(2), 170-182 2016

关键词： Hitchcock transportation problem minimum cost flow problem linear time algorithm recursive algorithm bipartite graph parallel edges

来源：评论

学校读者我要写书评

暂无评论

Implicit method for incompressible flow calculations in three-dimensional ducts and cascades

引用

AIAA JOURNAL 1997年第10期35卷 1581-1588页

作者： Politis, ES Giannakoglou, KC Papailiou, KD National Technical University of Athens 15710 Athens Greece

A method is presented for the numerical solution of the incompressible Navier-Stokes equations in three-dimensional ducts and cascades. Both laminar and turbulent flows are resolved, the latter through the k-epsilon turbulence model. The method is based on an elliptic formulation, which consists of the sequential solution of the mean flow and the turbulence equations through an approximate factorization technique. The cost of factorization is minimized through the formation and inversion of a single matrix for all but the continuity equations. The continuity constraint is enforced by means of the pressure-correction technique for which a more efficient variant of the approximate factorization scheme is employed. The method exhibits good convergence characteristics, as depicted from the analyzed three-dimensional problems. The prediction capabilities of this method are demonstrated by analyzing the laminar flow in a three-dimensional bend and the turbulent flow in a linear compressor cascade, with zero and nonzero tip clearance. For cascade how problems with nonzero tip clearances, a variant of the present method accommodating multiple, patched subdomains is devised.

关键词： Compressor Cascade Continuity Equation Convection Convection Diffusion Equation Incompressible Flow Iterative Solution recursive algorithm Static Pressure Turbulence Models Upwind Scheme

来源：评论

学校读者我要写书评

暂无评论

Fast-tracking method of inertial constant based on system identification

SCIENCE AND TECHNOLOGY FOR ENERGY TRANSITION

引用

SCIENCE AND TECHNOLOGY FOR ENERGY TRANSITION 2024年 79卷

作者： Hu, Xuekai Zeng, Siming Meng, Liang Li, Tiecheng Zhang, Qian State Grid Hebei Elect Power Res Inst Shijiazhuang 050021 Peoples R China

Aiming at the problem of quantitative inertia evaluation of a new energy electric power system, the system inertia constant tracking method based on system identification is studied. The method is divided into two categories: non-recursive algorithm and recursive algorithm. The non-recursive algorithm uses a batch of data for batch processing to obtain the estimated value of the identification model parameters. The recursive algorithm is based on the estimated value of the model parameter at the previous moment and corrects the estimated value based on the new data currently obtained. From the perspective of the identification principle, the difference and internal relationship between the two in terms of calculation storage and identification speed are analyzed. The IEEE typical system is used to compare and verify the experimental examples. Theoretical analysis and experimental results show that the recursive algorithm has high identification accuracy, stable identification results and fast identification speed. It is suitable for the identification of objects with large numbers of nodes and complex structures, which is conducive to real-time monitoring and fast perception of the inertia constant of the new energy power system.

关键词： Electric power systems Inertia constant System identification Quantitative evaluation Non-recursive algorithm recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

An L-approach for packing (l, w)-rectangles into rectangular and L-shaped pieces

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2003年第7期54卷 777-789页

作者： Lins, L Lins, S Morabito, R Univ Fed Sao Carlos Dept Engn Producao BR-13565905 Sao Carlos SP Brazil Univ Fed Pernambuco Recife PE Brazil

This paper presents an approach using a recursive algorithm for packing (e, w)-rectangles into larger rectangular and L-shaped pieces. Such a problem has actual applications for non-guillotine cutting and pallet/container loading. Our motivation for developing the L-approach is based on the fact that it can solve difficult pallet loading instances. Indeed, it is able to solve all testing problems (more than 20 000 representatives of infinite equivalence classes of the literature), including the 18 hard instances unresolved by other heuristics. We conjecture that the L-approach always finds optimum packings of (e, w)-rectangles into rectangular pieces. Moreover, the approach may also be useful when dealing with cutting and packing problems involving L-shaped pieces.

关键词： cutting and packing pallet and container loading recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：