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

A COMPLEX MAPPING NETWORK FOR PHASE SENSITIVE CLASSIFICATION

IEEE TRANSACTIONS ON NEURAL NETWORKS 1993年第1期4卷 127-135页

作者： BIRX, DL PIPENBERG, SJ Systems Research Laboratories Inc. Dayton OH USA

There are many signal processing applications involving complex-valued data in which phase information is an essential discriminant and for which nonlinear, nonparametric classification would be valuable. This is evident when utilizing the output from a Fourier transform, interpreting chaotic oscillator phase plane data, or analyzing time-sensitive impedance plane information generated from the phase quadrature detection of a modulated time domain signal. Artificial neural networks have the potential for being useful in such cases, but must rely on training alone to capture the complex relationships present in the data in order to perform a complex mapping. This paper details the design of a network which incorporates the complex relation in the structure and learning algorithm, thereby enforcing the formation of a complex mapping of the problem space. The network is applied to two phase-sensitive problems: 1) interpretation of chaotic oscillator phase plane plots, and 2) eddy current defect detection and characterization. In chaotic oscillator analysis, the network, in conjunction with the oscillator, demonstrates the ability to interpret small signal behavior. In eddy current impedance plane analysis, the network demonstrates a clear performance advantage over both real-valued multilayer feed-forward networks (MFFN's) and human subjects, with overall classification accuracy improvements of 45% (to a 99% level) and 48%, respectively. This network structure and learning algorithm should provide similar results in other signal processing applications where time or phase considerations are critical for class discrimination.

关键词： Signal processing algorithms Oscillators Chaos Eddy currents algorithm design and analysis Phase detection Signal analysis Impedance Performance analysis Nonhomogeneous media

来源：评论

学校读者我要写书评

暂无评论

DETERMINATION OF THE SINGLE-PASS IMPULSE-RESPONSE OF THE BODY-TISSUES WITH CIRCULATORY MODELS

引用

IEEE TRANSACTIONS ON BIOMEDICAL ENGINEERING 1995年第3期42卷 304-312页

作者： MARI, A Institute of Systems Science and Biomedical Engineering National Research Council Padova Italy

Classical in vivo kinetics are based on the analysis of the blood disappearance curve of a substance, This curve is determined by the interplay of the substance transport in the circulatory system and the kinetics of the body tissues, The characteristic response of the body tissues, that is, their single-pass impulse response, is obscured in the disappearance curve by multiple recirculations in the heart-systemic loop, The single-pass impulse response can be appropriately determined with circulatory models, This paper investigates the theoretical aspects of the determination of the impulse response and proposes suitable algorithms for the analysis of experimental data with circulatory models, The problem of what information the most typical experimental configurations yield on the single-pass impulse response, and what assumptions are necessary for determining the impulse response in a given configuration is studied first, It is shown that assumptions are usually necessary, unless a proper experiment design is adopted, Two algorithms are then developed for the determination of the impulse response from experimental data, in the general case, The first calculates the response from an exponential description of the disappearance curve, while the second is based on a state space representation of circulatory models, The first method has the important limitation that it does not always ensure physiologically plausible results;the state space approach overcomes this limitation, and is the method of choice, With the state space approach, the determination of the single-pass impulse response is a standard parameter estimation problem with finite dimensional linear systems. The analysis of real data from a study on glucose kinetics illustrates the practical relevance of the results.

关键词： Kinetic theory State-space methods Data analysis In vivo Blood Circulatory system algorithm design and analysis design for experiments Parameter estimation Linear systems

来源：评论

学校读者我要写书评

暂无评论

design of IIR digital filters based on eigenvalue problem

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1996年第6期44卷 1325-1333页

作者： Zhang, X Iwakura, H Department of Communications and Systems University of Electro-Communications Tokyo Japan

This paper presents a new method for designing IIR digital filters with optimum magnitude response in the Chebyshev sense and different order numerator and denominator. The proposed procedure is based on the formulation of a generalized eigenvalue problem by using Remez exchange algorithm. Since there exist more than one eigenvalue in the general eigenvalue problem, we introduce a very simple selection rule for the eigenvalue to be sought for where the rational interpolation is performed if and only if the positive minimum eigenvalue is chosen. Therefore, the solution of the rational interpolation problem can be obtained by computing only one eigenvector corresponding to the positive minimum eigenvalue, and the optimal filter coefficients are easily obtained through a few iterations, The design algorithm proposed in this paper not only retains the speed inherent in the Remez exchange algorithm but also simplifies the interpolation step because it has been reduced to the computation of the positive minimum eigenvalue. Some properties of the filters such as lowpass filters, bandpass filters, and so on are discussed, and several design examples are presented to demonstrate the effectiveness of this method.

关键词： Digital filters Eigenvalues and eigenfunctions Interpolation IIR filters Finite impulse response filter design methodology Chebyshev approximation Signal processing algorithms Band pass filters algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT PARALLEL CRITICAL PATH algorithm

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED design OF INTEGRATED CIRCUITS AND SYSTEMS 1994年第7期13卷 909-919页

作者： LIU, LR DU, DHC CHEN, HC AT&T BELL LABS TECH STAFF MURRAY HILL NJ 07974 USA UNIV MINNESOTA DEPT COMP SCI MINNEAPOLIS MN 55455 USA

The problem of identifying one of the longest sensitizable paths in a circuit is called a critical path problem. Several critical path algorithms have been proposed in the last few years. However, due to the long computation time required to produce accurate results, these algorithms may not be able to generate any result for large designs with many long false paths unless the accuracy of the results is compromised. Parallel processing seems to be an appropriate way to speed up the required computation. In this paper, we study the parallel algorithms for critical path problem. We first present a sensitization criterion. Based on this sensitization criterion an algorithm called DT-algorithm, which is a variation of the D-algorithm with stable Time range of signals also taken into consideration, is developed. The DT-algorithm is especially suitable and can be used to determine the sensitizability of a given path in a parallel processing environment. We also presented an implementation of parallel DT-algorithm that can be executed on a shared memory multiprocessor. The experimental results show that a reasonable speed-up can be obtained.

关键词： Circuits Timing Delay estimation Parallel processing Propagation delay algorithm design and analysis Concurrent computing Parallel algorithms Explosions

来源：评论

学校读者我要写书评

暂无评论

PERFORMANCE EVALUATION OF TRACK INITIATION IN DENSE TARGET ENVIRONMENTS

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 1994年第1期30卷 213-219页

作者： CHANG, KC MORI, S CHONG, CY TIBURON SYST INC SAN JOSECA 95125 BOOZ ALLEN & HAMILTON INC DIV ADSMT VIEWCA 94043

This paper describes an analysis of track initiation performance in very high target density environments. The analysis of tracking performance performed in 161 yielded very simple expressions to predict average track purity in terms of tracking parameters. These results were, however, obtained mainly for the track continuation phase in which tracks are more or less well established. We extend these results to the track initiation phase.

关键词： Target tracking Performance analysis Iterative algorithms State estimation Magnetooptic recording Systems engineering and theory Upper bound algorithm design and analysis Nearest neighbor searches Predictive models

来源：评论

学校读者我要写书评

暂无评论

THE SIMULATION OF HIGH-SPEED, HIGH-DENSITY DIGITAL INTERCONNECTS IN SINGLE CHIP PACKAGES AND MULTICHIP MODULES

引用

IEEE TRANSACTIONS ON COMPONENTS HYBRIDS AND MANUFACTURING TECHNOLOGY 1992年第4期15卷 465-477页

作者： PAN, GW PRENTICE, JA ZAHN, SK STANISZEWSKI, AJ WALTERS, WL GILBERT, BK MAYO CLIN & MAYO FDN DEPT PHYSIOL & BIOPHYSSPECIAL PURPOSE DEV GRPROCHESTERMN 55905

During the past decade, digital integrated circuits, especially silicon ECL and Gallium Arsenide (GaAs) devices, have become much faster, supporting clock rates of 0.5-2 GHz, and generating off-chip signal rise times as fast as 100 ps. These faster chips are placing considerable pressure on the electrical characteristics of both single chip packages and more recently multichip modules (MCM's), since the packages must be designed not to degrade the performance of the chips themselves. Further, not only must the package assure the integrity of the propagating wavefronts in the package interconnects;the effects of crosstalk, reflections, and other parasitics must all be taken into account simultaneously if the final package design is to be adequate. Because the complexity of the electronic packages under development for high clock rate digital signal processors increasingly overwhelmed the simulation tools which were available to us, we have developed a new, comprehensive electromagnetic (EM) modeling tool, the Networking algorithm, which is capable of simulating on a digital computer the complexities inherent in real-world interconnects and packages, including simultaneous treatment of the effects of mixed types of transmission line interconnects (i.e., mixtures of stripline, microstrip, and coplanar lines), stubs and branches, reflections, and crosstalk between multiple nets. In this paper we will describe the type of modeling tool which has been developed, discuss the mathematics of the Networking algorithm, and then present a number of actual examples taken from our high frequency digital package design work to show how such a computer-based EM modeling tool set can assist in the design of high performance packages.

关键词： Packaging Computational modeling Mathematical model algorithm design and analysis Electromagnetic modeling Computer simulation Coplanar transmission lines Stripline Microstrip Reflection

来源：评论

学校读者我要写书评

暂无评论

Gain-Varying Guidance algorithm using Differential Geometric Guidance Command

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2010年第2期46卷 725-736页

作者： Li, Chaoyong Jing, Wuxing Wang, Hui Qi, Zhiguo Harbin Inst Technol Dept Aerosp Engn Harbin 150006 Peoples R China Shanghai Electromech Engn Inst Shanghai Peoples R China

A new gain-varying algorithm for the three-dimensional pure proportional navigation (PPN) guidance problem is presented using the differential geometric (DG) guidance command. To this end, classical differential geometry theory is introduced, firstly, to transform and modify the DG guidance curvature command so as to facilitate the practical implementation and to avoid singularity of the guidance command. Then, a new gain-varying guidance scheme is developed using the modified DG guidance command, as well as the principle of the PPN guidance law, the new guidance law does not need the evaluation of time-to-go information. Furthermore, the capture analysis of the PPN-type guidance law is qualitatively studied in terms of the DG formulations, and a post-launch capture condition is derived and expressed in geometric terms. Simulation results demonstrate that the proposed guidance algorithm performs better than the conventional PPN guidance law in the case of intercepting maneuvering targets.

关键词： Missiles Acceleration Trajectory Time domain analysis Heuristic algorithms algorithm design and analysis Geometry

来源：评论

学校读者我要写书评

暂无评论

On the performance of the Bayesian optimization algorithm with combined scenarios of search algorithms and scoring metrics

引用

GENETIC PROGRAMMING AND EVOLVABLE MACHINES 2022年第2期23卷 193-223页

作者： Nametala, Ciniro A. L. Faria, Wandry R. Pereira Junior, Benvindo R. Univ Sao Paulo Sao Carlos Sch Engn Sao Paulo Brazil

The Bayesian Optimization algorithm (BOA) is one of the most prominent Estimation of Distribution algorithms. It can detect the correlation between multiple variables and extract knowledge on regular patterns in solutions. Bayesian Networks (BNs) are used in BOA to represent the probability distributions of the best individuals. The BN's construction is challenging since there is a trade-off between acuity and computational cost to generate it. This trade-off is determined by combining a search algorithm (SA) and a scoring metric (SM). The SA is responsible for generating a promising BN and the SM assesses the quality of such networks. Some studies have already analyzed how this relationship affects the learning process of a BN. However, such investigation had not yet been performed to determine the bond linking the selection of SA and SM and the BOA's output quality. Acting on this research gap, a detailed comparative analysis involving two constructive heuristics and four scoring metrics is presented in this work. The classic version of BOA was applied to discrete and continuous optimization problems using binary and floating-point representations. The scenarios were compared through graphical analyses, statistical metrics, and difference detection tests. The results showed that the selection of SA and SM affects the quality of the BOA results since scoring metrics that penalize complex BN models perform better than metrics that do not consider the complexity of the networks. This study contributes to a discussion on this metaheuristic's practical use, assisting users with implementation decisions.

关键词： algorithm design and analysis Bayesian Network models Bayesian Optimization algorithm Metaheuristics Probabilistic model

来源：评论

学校读者我要写书评

暂无评论

Robust Stability and Near-Optimality for Policy Iteration: For Want of Recursive Feasibility, All is Not Lost

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2024年第12期69卷 8247-8262页

作者： Granzotto, Mathieu De Silva, Olivier Lindamulage Postoyan, Romain Nesic, Dragan Jiang, Zhong-Ping Univ Melbourne Dept Elect & Elect Engn Parkville Vic 3010 Australia Univ Lorraine CNRS CRAN F-54000 Nancy France NYU Dept Elect & Comp Engn Brooklyn NY 11021 USA

We consider deterministic nonlinear discrete-time systems whose inputs are generated by policy iteration (PI) for undiscounted cost functions. We first assume that PI is recursively feasible, in the sense that the optimization problems solved at each iteration admit a solution. In this case, we provide novel conditions to establish recursive robust stability properties for a general attractor, meaning that the policies generated at each iteration ensure a robust KL -stability property with respect to a general state measure. We then derive novel explicit bounds on the mismatch between the (suboptimal) value function returned by PI at each iteration and the optimal one. However, we show by a counterexample that PI may fail to be recursively feasible, disallowing the mentioned stability and near-optimality guarantees. We therefore also present a modification of PI so that recursive feasibility is guaranteed a priori under mild conditions. This modified algorithm, called PI+, is shown to preserve the recursive robust stability when the attractor is compact. In addition, PI+ enjoys the same near-optimality properties as its PI counterpart under the same assumptions.

关键词： Costs Stability analysis Robust stability Cost function Convergence Closed loop systems Robustness algorithm design and analysis asymptotic stability cost function control system synthesis dynamic programming Lyapunov methods nonlinear systems optimal control predictive control robustness

来源：评论

学校读者我要写书评

暂无评论

Flight Tests of Error-Bounded Heading and Pitch Determination with Two GPS Receivers

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2012年第1期48卷 388-404页

作者： Lau, Lawrence Cross, Paul Steen, Meiko UCL Dept Civil Environm & Geomat Engn London WC1E 6BT England Tech Univ Carolo Wilhelmina Braunschweig Inst Flight Guidance Braunschweig Germany

This paper describes a heading and pitch determination algorithm using single-epoch measurements from two GPS receivers. The algorithm aims to provide accurate heading and pitch solutions with controlled quality. Since the separation of the two antennas (baseline length) is known, this length has been used in the algorithm to constrain the heading and pitch solutions in the final stage of the estimation process. Moreover, error bounds (EB) of heading and pitch solutions are calculated at each epoch in order to provide statistical bounds for their errors. The proposed algorithm has been tested with high (frequent turns with quick change in pitch angle to +/- 50 degrees and bank angle to +/- 80 degrees) and low dynamic flight test data collected in Germany and the solutions are compared with high-accuracy heading and pitch provided by a high-grade GPS/INS system. Test results of achieved accuracies and success rate of bounds on heading and pitch errors are described. This attitude determination work is part of the ANASTASIA (Airborne New Advanced Satellite techniques & Technologies in A System Integrated Approach) project, which was a 6th Framework programme of European Commission Project that was led by Thales Avionics, France. It has been found that about 96% of accepted solutions in the low dynamic data sets have heading and pitch errors less than the ANASTASIA required accuracy of 0.4 degrees. Moreover, the rms error and error bounding analyses of the results show that the performance of the heading and pitch algorithm on the low dynamic data sets is better than that of the high dynamic data sets. Extensive analysis of the relatively poor performance on the high dynamic data sets is described and the problems/error sources are identified and discussed.

关键词： algorithm design and analysis Antenna measurements Antennas Global Positioning System Position measurement Receivers Satellites

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：