68 resultados para Linear time invariants
em CentAUR: Central Archive University of Reading - UK
Resumo:
A characterization of observability for linear time-varying descriptor systemsE(t)x(t)+F(t)x(t)=B(t)u(t), y(t)=C(t)x(t) was recently developed. NeitherE norC were required to have constant rank. This paper defines a dual system, and a type of controllability so that observability of the original system is equivalent to controllability of the dual system. Criteria for observability and controllability are given in terms of arrays of derivatives of the original coefficients. In addition, the duality results of this paper lead to an improvement on a previous fundamental structure result for solvable systems of the formE(t)x(t)+F(t)x(t)=f(tt).
Resumo:
Associative memory networks such as Radial Basis Functions, Neurofuzzy and Fuzzy Logic used for modelling nonlinear processes suffer from the curse of dimensionality (COD), in that as the input dimension increases the parameterization, computation cost, training data requirements, etc. increase exponentially. Here a new algorithm is introduced for the construction of a Delaunay input space partitioned optimal piecewise locally linear models to overcome the COD as well as generate locally linear models directly amenable to linear control and estimation algorithms. The training of the model is configured as a new mixture of experts network with a new fast decision rule derived using convex set theory. A very fast simulated reannealing (VFSR) algorithm is utilized to search a global optimal solution of the Delaunay input space partition. A benchmark non-linear time series is used to demonstrate the new approach.
Resumo:
The Stochastic Diffusion Search algorithm -an integral part of Stochastic Search Networks is investigated. Stochastic Diffusion Search is an alternative solution for invariant pattern recognition and focus of attention. It has been shown that the algorithm can be modelled as an ergodic, finite state Markov Chain under some non-restrictive assumptions. Sub-linear time complexity for some settings of parameters has been formulated and proved. Some properties of the algorithm are then characterised and numerical examples illustrating some features of the algorithm are presented.
Resumo:
An information processing paradigm in the brain is proposed, instantiated in an artificial neural network using biologically motivated temporal encoding. The network will locate within the external world stimulus, the target memory, defined by a specific pattern of micro-features. The proposed network is robust and efficient. Akin in operation to the swarm intelligence paradigm, stochastic diffusion search, it will find the best-fit to the memory with linear time complexity. information multiplexing enables neurons to process knowledge as 'tokens' rather than 'types'. The network illustrates possible emergence of cognitive processing from low level interactions such as memory retrieval based on partial matching. (C) 2007 Elsevier B.V. All rights reserved.
Resumo:
Higher order cumulant analysis is applied to the blind equalization of linear time-invariant (LTI) nonminimum-phase channels. The channel model is moving-average based. To identify the moving average parameters of channels, a higher-order cumulant fitting approach is adopted in which a novel relay algorithm is proposed to obtain the global solution. In addition, the technique incorporates model order determination. The transmitted data are considered as independently identically distributed random variables over some discrete finite set (e.g., set {±1, ±3}). A transformation scheme is suggested so that third-order cumulant analysis can be applied to this type of data. Simulation examples verify the feasibility and potential of the algorithm. Performance is compared with that of the noncumulant-based Sato scheme in terms of the steady state MSE and convergence rate.
Resumo:
This paper introduces a new blind equalisation algorithm for the pulse amplitude modulation (PAM) data transmitted through nonminimum phase (NMP) channels. The algorithm itself is based on a noncausal AR model of communication channels and the second- and fourth-order cumulants of the received data series, where only the diagonal slices of cumulants are used. The AR parameters are adjusted at each sample by using a successive over-relaxation (SOR) scheme, a variety of the ordinary LMS scheme, but with a faster convergence rate and a greater robustness to the selection of the ‘step-size’ in iterations. Computer simulations are implemented for both linear time-invariant (LTI) and linear time-variant (LTV) NMP channels, and the results show that the algorithm proposed in this paper has a fast convergence rate and a potential capability to track the LTV NMP channels.
Resumo:
Utopia Ltd. explores the relationship between utopian ideas and commodification, bringing together artwork by Blaise Drummond, Brendan Earley, Pil and Galia Kollectiv, David Mabb, Lizi Sanchez and Mary-Ruth Walsh. The seven artists’ work opens up a debate on the utopian within painting, sculpture, architecture, design and video.The works in Utopia Ltd. represent modernist architecture and design in its various mutations within a spectacularised, commodified 20th century consumer society. In these works, the utopian dream seems to burst through again and again, despite rather than because of the permutations of commodity culture. By picturing the past, present and possible future, the works destabilize fixed linear time. By rescuing, reclaiming and re-picturing, Utopia Ltd. suggests that utopian ideas persist in contemporary art, making a provocative demand on the viewer’s capacity to produce utopian dreams of their own. The exhibition’s title Utopia Ltd. is a satirical echo of an operetta by Gilbert and Sullivan, Utopia (Limited) or, The Flowers of Progress (1893), in which a utopian colony is turned into a joint stock company.
Resumo:
Using previously published data from the whisker barrel cortex of anesthetized rodents (Berwick et al 2008 J. Neurophysiol. 99 787–98) we investigated whether highly spatially localized stimulus-evoked cortical hemodynamics responses displayed a linear time-invariant (LTI) relationship with neural activity. Presentation of stimuli to individual whiskers of 2 s and 16 s durations produced hemodynamics and neural activity spatially localized to individual cortical columns. Two-dimensional optical imaging spectroscopy (2D-OIS) measured hemoglobin responses, while multi-laminar electrophysiology recorded neural activity. Hemoglobin responses to 2 s stimuli were deconvolved with underlying evoked neural activity to estimate impulse response functions which were then convolved with neural activity evoked by 16 s stimuli to generate predictions of hemodynamic responses. An LTI system more adequately described the temporal neuro-hemodynamics coupling relationship for these spatially localized sensory stimuli than in previous studies that activated the entire whisker cortex. An inability to predict the magnitude of an initial 'peak' in the total and oxy- hemoglobin responses was alleviated when excluding responses influenced by overlying arterial components. However, this did not improve estimation of the hemodynamic responses return to baseline post-stimulus cessation.
Resumo:
Implicit dynamic-algebraic equations, known in control theory as descriptor systems, arise naturally in many applications. Such systems may not be regular (often referred to as singular). In that case the equations may not have unique solutions for consistent initial conditions and arbitrary inputs and the system may not be controllable or observable. Many control systems can be regularized by proportional and/or derivative feedback.We present an overview of mathematical theory and numerical techniques for regularizing descriptor systems using feedback controls. The aim is to provide stable numerical techniques for analyzing and constructing regular control and state estimation systems and for ensuring that these systems are robust. State and output feedback designs for regularizing linear time-invariant systems are described, including methods for disturbance decoupling and mixed output problems. Extensions of these techniques to time-varying linear and nonlinear systems are discussed in the final section.
Resumo:
We present the extension of a methodology to solve moving boundary value problems from the second-order case to the case of the third-order linear evolution PDE qt + qxxx = 0. This extension is the crucial step needed to generalize this methodology to PDEs of arbitrary order. The methodology is based on the derivation of inversion formulae for a class of integral transforms that generalize the Fourier transform and on the analysis of the global relation associated with the PDE. The study of this relation and its inversion using the appropriate generalized transform are the main elements of the proof of our results.
Resumo:
The contributions of different time scales to extratropical teleconnections are examined. By applying empirical orthogonal functions and correlation analyses to reanalysis data, it is shown that eddies with periods shorter than 10 days have no linear contribution to teleconnectivity. Instead, synoptic variability follows wavelike patterns along the storm tracks, interpreted as propagating baroclinic disturbances. In agreement with preceding studies, it is found that teleconnections such as the North Atlantic Oscillation (NAO) and the Pacific–North America (PNA) pattern occur only at low frequencies, typically for periods more than 20 days. Low-frequency potential vorticity variability is shown to follow patterns analogous to known teleconnections but with shapes that differ considerably from them. It is concluded that the role, if any, of synoptic eddies in determining and forcing teleconnections needs to be sought in nonlinear interactions with the slower transients. The present results demonstrate that daily variability of teleconnection indices cannot be interpreted in terms of the teleconnection patterns, only the slow part of the variability.
Resumo:
This paper discusses the use of multi-layer perceptron networks for linear or linearizable, adaptive feedback.control schemes in a discrete-time environment. A close look is taken at the model structure selected and the extent of the resulting parametrization. A comparison is made with standard, non-perceptron algorithms, e.g. self-tuning control, and it is shown how gross over-parametrization can occur in the neural network case. Because of the resultant heavy computational burden and poor controller convergence, a strong case is made against the use of neural networks for discrete-time linear control.
Resumo:
In this paper we discuss the current state-of-the-art in estimating, evaluating, and selecting among non-linear forecasting models for economic and financial time series. We review theoretical and empirical issues, including predictive density, interval and point evaluation and model selection, loss functions, data-mining, and aggregation. In addition, we argue that although the evidence in favor of constructing forecasts using non-linear models is rather sparse, there is reason to be optimistic. However, much remains to be done. Finally, we outline a variety of topics for future research, and discuss a number of areas which have received considerable attention in the recent literature, but where many questions remain.