Adaptive quasi-likelihood estimate in generalized linear models
CHEN Xia; CHEN Xiru
2005-01-01
This paper gives a thorough theoretical treatment on the adaptive quasilikelihood estimate of the parameters in the generalized linear models. The unknown covariance matrix of the response variable is estimated by the sample. It is shown that the adaptive estimator defined in this paper is asymptotically most efficient in the sense that it is asymptotic normal, and the covariance matrix of the limit distribution coincides with the one for the quasi-likelihood estimator for the case that the covariance matrix of the response variable is completely known.
Biohybrid control of general linear systems using the adaptive filter model of cerebellum
Emma D. Wilson
2015-07-01
Full Text Available The adaptive filter model of the cerebellar microcircuit has been successfully applied to biological motor control problems such as the vestibulo-ocular reflex (VOR and to sensory processing problems such as the adaptive cancellation of reafferent noise. It has also been successfully applied to problems in robotics such as adaptive camera stabilisation and sensor noise cancellation. In previous applications to inverse control problems the algorithm was applied to the velocity control of a plant dominated by viscous and elastic elements. Naive application of the adaptive filter model to the displacement (as opposed to velocity control of this plant results in unstable learning and control. To be more generally useful in engineering problems it is essential to remove this restriction to enable the stable control of plants of any order. We address this problem here by developing a biohybrid model reference adaptive control (MRAC scheme, which stabilises the control algorithm for strictly proper plants. We evaluate the performance of this novel cerebellar inspired algorithm with MRAC scheme in the experimental control of a dielectric electroactive polymer, a class of artificial muscle. The results show that the augmented cerebellar algorithm is able to accurately control the displacement response of the artificial muscle. The proposed solution not only greatly extends the practical applicability of the cerebellar-inspired algorithm, but may also shed light on cerebellar involvement in a wider range of biological control tasks.
Generalized Linear Orthomorphisms
Haiqing Han
2013-05-01
Full Text Available In this study, we generalize the conception of orthomorphisms and obtain a counting formula on the generalized linear orthomorphisms over the Galois field with the arbitrary prime number p as the characteristic. Thus the partial generation algorithm of generalized linear orthomorphisms is achieved. The counting formula of the linear orthomorphisms over the finite field with characteristic 2 is the special case in our results. Furthermore, the generalized linear orthomorphisms generated and discussed in this study can gain the maximum branch number when they are designed as P-permutations.
Adaptive functional linear regression
Comte, Fabienne
2011-01-01
We consider the estimation of the slope function in functional linear regression, where scalar responses are modeled in dependence of random functions. Cardot and Johannes [2010] have shown that a thresholded projection estimator can attain up to a constant minimax-rates of convergence in a general framework which allows to cover the prediction problem with respect to the mean squared prediction error as well as the estimation of the slope function and its derivatives. This estimation procedure, however, requires an optimal choice of a tuning parameter with regard to certain characteristics of the slope function and the covariance operator associated with the functional regressor. As this information is usually inaccessible in practice, we investigate a fully data-driven choice of the tuning parameter which combines model selection and Lepski's method. It is inspired by the recent work of Goldenshluger and Lepski [2011]. The tuning parameter is selected as minimizer of a stochastic penalized contrast function...
Adaptive Local Linear Quantile Regression
Yu-nan Su; Mao-zai Tian
2011-01-01
In this paper we propose a new method of local linear adaptive smoothing for nonparametric conditional quantile regression. Some theoretical properties of the procedure are investigated. Then we demonstrate the performance of the method on a simulated example and compare it with other methods. The simulation results demonstrate a reasonable performance of our method proposed especially in situations when the underlying image is piecewise linear or can be approximated by such images. Generally speaking, our method outperforms most other existing methods in the sense of the mean square estimation (MSE) and mean absolute estimation (MAE) criteria. The procedure is very stable with respect to increasing noise level and the algorithm can be easily applied to higher dimensional situations.
Adaptive Sticky Generalized Metropolis
Fabrizio Leisen; Roberto Casarin; David Luengo; Luca Martino
2013-01-01
We introduce a new class of adaptive Metropolis algorithms called adaptive sticky algorithms for efficient general-purpose simulation from a target probability distribution. The transition of the Metropolis chain is based on a multiple-try scheme and the different proposals are generated by adaptive nonparametric distributions. Our adaptation strategy uses the interpolation of support points from the past history of the chain as in the adaptive rejection Metropolis. The algorithm efficiency i...
General linear chirplet transform
Yu, Gang; Zhou, Yiqi
2016-03-01
Time-frequency (TF) analysis (TFA) method is an effective tool to characterize the time-varying feature of a signal, which has drawn many attentions in a fairly long period. With the development of TFA, many advanced methods are proposed, which can provide more precise TF results. However, some restrictions are introduced inevitably. In this paper, we introduce a novel TFA method, termed as general linear chirplet transform (GLCT), which can overcome some limitations existed in current TFA methods. In numerical and experimental validations, by comparing with current TFA methods, some advantages of GLCT are demonstrated, which consist of well-characterizing the signal of multi-component with distinct non-linear features, being independent to the mathematical model and initial TFA method, allowing for the reconstruction of the interested component, and being non-sensitivity to noise.
Generalized Linear Covariance Analysis
Carpenter, James R.; Markley, F. Landis
2014-01-01
This talk presents a comprehensive approach to filter modeling for generalized covariance analysis of both batch least-squares and sequential estimators. We review and extend in two directions the results of prior work that allowed for partitioning of the state space into solve-for'' and consider'' parameters, accounted for differences between the formal values and the true values of the measurement noise, process noise, and textita priori solve-for and consider covariances, and explicitly partitioned the errors into subspaces containing only the influence of the measurement noise, process noise, and solve-for and consider covariances. In this work, we explicitly add sensitivity analysis to this prior work, and relax an implicit assumption that the batch estimator's epoch time occurs prior to the definitive span. We also apply the method to an integrated orbit and attitude problem, in which gyro and accelerometer errors, though not estimated, influence the orbit determination performance. We illustrate our results using two graphical presentations, which we call the variance sandpile'' and the sensitivity mosaic,'' and we compare the linear covariance results to confidence intervals associated with ensemble statistics from a Monte Carlo analysis.
Foundations of linear and generalized linear models
Agresti, Alan
2015-01-01
A valuable overview of the most important ideas and results in statistical analysis Written by a highly-experienced author, Foundations of Linear and Generalized Linear Models is a clear and comprehensive guide to the key concepts and results of linear statistical models. The book presents a broad, in-depth overview of the most commonly used statistical models by discussing the theory underlying the models, R software applications, and examples with crafted models to elucidate key ideas and promote practical model building. The book begins by illustrating the fundamentals of linear models,
Introduction to general and generalized linear models
Madsen, Henrik
2010-01-01
IntroductionExamples of types of data Motivating examples A first view on the modelsThe Likelihood PrincipleIntroduction Point estimation theory The likelihood function The score function The information matrix Alternative parameterizations of the likelihood The maximum likelihood estimate (MLE) Distribution of the ML estimator Generalized loss-function and deviance Quadratic approximation of the log-likelihood Likelihood ratio tests Successive testing in hypothesis chains Dealing with nuisance parameters General Linear ModelsIntroduction The multivariate normal distribution General linear mod
Generalized, Linear, and Mixed Models
McCulloch, Charles E; Neuhaus, John M
2011-01-01
An accessible and self-contained introduction to statistical models-now in a modernized new editionGeneralized, Linear, and Mixed Models, Second Edition provides an up-to-date treatment of the essential techniques for developing and applying a wide variety of statistical models. The book presents thorough and unified coverage of the theory behind generalized, linear, and mixed models and highlights their similarities and differences in various construction, application, and computational aspects.A clear introduction to the basic ideas of fixed effects models, random effects models, and mixed m
Adaptive feedback linearization of nonlinear SISO systems
Gonzales, R. I.; Duarte-Mermoud, M. A.; Zagalak, Petr
New Haven : Yale University, 2003, s. 160-169. [Workshop on Adaptive and Learning Systems /12./. Yale (US), 28.05.2003-30.05.2003] R&D Projects: GA ČR GA102/02/0204 Institutional research plan: CEZ:AV0Z1075907 Keywords : adaptive linearization * nonlinear systems * feedback linearization Subject RIV: BC - Control Systems Theory
Generalization of Prism Adaptation
Redding, Gordon M.; Wallace, Benjamin
2006-01-01
Prism exposure produces 2 kinds of adaptive response. Recalibration is ordinary strategic remapping of spatially coded movement commands to rapidly reduce performance error. Realignment is the extraordinary process of transforming spatial maps to bring the origins of coordinate systems into correspondence. Realignment occurs when spatial…
Actuarial statistics with generalized linear mixed models
K. Antonio; J. Beirlant
2007-01-01
Over the last decade the use of generalized linear models (GLMs) in actuarial statistics has received a lot of attention, starting from the actuarial illustrations in the standard text by McCullagh and Nelder [McCullagh, P., Nelder, J.A., 1989. Generalized linear models. In: Monographs on Statistics
Adaptive dynamic programming for linear impulse systems
Xiao-hua WANG; Juan-juan YU; Yao HUANG; Hua WANG; Zhong-hua MIAO
2014-01-01
We investigate the optimization of linear impulse systems with the reinforcement learning based adaptive dynamic programming (ADP) method. For linear impulse systems, the optimal objective function is shown to be a quadric form of the pre-impulse states. The ADP method provides solutions that iteratively converge to the optimal objective function. If an initial guess of the pre-impulse objective function is selected as a quadratic form of the pre-impulse states, the objective function iteratively converges to the optimal one through ADP. Though direct use of the quadratic objective function of the states within the ADP method is theoretically possible, the numerical singularity problem may occur due to the matrix inversion therein when the system dimensionality increases. A neural network based ADP method can circumvent this problem. A neural network with polynomial activation functions is selected to approximate the pre-impulse objective function and trained iteratively using the ADP method to achieve optimal control. After a successful training, optimal impulse control can be derived. Simulations are presented for illustrative purposes.
STABILITY OF GENERAL LINEAR METHODS FOR SYSTEMS OF FUNCTIONAL-DIFFERENTIAL AND FUNCTIONAL EQUATIONS
Si-qing Gan; Wei-min Zheng
2005-01-01
This paper is concerned with the numerical solution of functional-differential and functional equations which include functional-differential equations of neutral type as special cases. The adaptation of general linear methods is considered. It is proved that A-stable general linear methods can inherit the asymptotic stability of underlying linear systems.Some general results of numerical stability are also given.
Generalized Cross-Gramian for Linear Systems
Shaker, Hamid Reza
2012-01-01
The cross-gramian is a well-known matrix with embedded controllability and observability information. The cross-gramian is related to the Hankel operator and the Hankel singular values of a linear square system and it has several interesting properties. These properties make the cross......-gramian popular in several applications including model reduction, control configuration selection and sensitivity analysis. The ordinary cross-gramian which has been defined in the literature is the solution of a Sylvester equation. This Sylvester equation is not always solvable and therefore for some linear...... square symmetric systems, the ordinary cross-gramian does not exist. To cope with this problem, a new generalized cross-gramian is introduced in this paper. In contrast to the ordinary cross-gramian, the generalized cross-gramian can be easily obtained for general linear systems and therefore can be used...
Linear generalized synchronization of chaotic systems with uncertain parameters
Jia Zhen
2008-01-01
A more general form of projective synchronization,so called linear generalized synchronization(LGS)is proposed,which includes the generalized projective synchronization(GPS)and the hybrid projective synchronization(HPS)as its special cases.Based on the adaptive technique and Lyapunov stability theory,a general method for achieving the LGS between two chaotic or hyperchaotic systems with uncertain parameters in any scaling matrix is presented.Some numerical simulations are provided to show the effectiveness and feasibility of the proposed synchronization method.
Adaptive position controller for double armature brushless dc linear motor
Demirci, R. [Abant Izzet Baysal Univ., Technical Education Faculty, Electrical Dept., Dunez (Turkey); Dursun, M. [Gazi University, Technical Education Faculty, Electrical Dept., Ankara (Turkey)
2000-08-01
An adaptive position controller has been proposed for double armature brushless DC linear motor. The proposed position control system comprises an inner model reference adaptive velocity control loop and an outer position control loop. The parameters of the adaptive controller have been adjusted by using modified gradient type parameter adaptation algorithm. (orig.)
Detailed Decompositions in Generalized Linear Models
Kaiser, Boris
2013-01-01
We propose a new approach for performing detailed decompositions of average outcome differentials, which can be applied to all types of generalized linear models. A simulation exercise demonstrates that our method produces more convincing results than existing methods. An empirical application to the immigrant-native wage differential in Switzerland is presented.
Lower bounds for adaptive linearity tests
Lovett, Shachar
2008-01-01
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions which are far from linear. Linearity tests were first introduced by (Blum, Luby and Rubenfeld, 1993), and were later used in the PCP theorem, among other applications. The quality of a linearity test is described by its correctness c - the probability it accepts linear functions, its soundness s - the probability it accepts functions far from linear, and its query complexity q - the number of queries it makes. Linearity tests were studied in order to decrease the soundness of linearity tests, while keeping the query complexity small (for one reason, to improve PCP constructions). Samorodnitsky and Trevisan (Samorodnitsky and Trevisan 2000) constructed the Complete Graph Test, and prove that no Hyper Graph Test can perform better than the Complete Graph Test. Later in (Samorodnitsky and Trevisan 2006) they prove, among other results, th...
Generalized Adaptive Artificial Neural Networks
Tawel, Raoul
1993-01-01
Mathematical model of supervised learning by artificial neural network provides for simultaneous adjustments of both temperatures of neurons and synaptic weights, and includes feedback as well as feedforward synaptic connections. Extension of mathematical model described in "Adaptive Neurons For Artificial Neural Networks" (NPO-17803). Dynamics of neural network represented in new model by less-restrictive continuous formalism.
Generalized non-linear Schroedinger hierarchy
The importance in studying the completely integrable models have became evident in the last years due to the fact that those models present an algebraic structure extremely rich, providing the natural scenery for solitons description. Those models can be described through non-linear differential equations, pseudo-linear operators (Lax formulation), or a matrix formulation. The integrability implies in the existence of a conservation law associated to each of degree of freedom. Each conserved charge Qi can be associated to a Hamiltonian, defining a time evolution related to to a time ti through the Hamilton equation ∂A/∂ti=[A,Qi]. Particularly, for a two-dimensions field theory, infinite degree of freedom exist, and consequently infinite conservation laws describing the time evolution in space of infinite times. The Hamilton equation defines a hierarchy of models which present a infinite set of conservation laws. This paper studies the generalized non-linear Schroedinger hierarchy
General Linearized Polynomial Interpolation and Its Applications
Xie, Hongmei; Suter, Bruce W
2011-01-01
In this paper, we first propose a general interpolation algorithm in a free module of a linearized polynomial ring, and then apply this algorithm to decode several important families of codes, Gabidulin codes, KK codes and MV codes. Our decoding algorithm for Gabidulin codes is different from the polynomial reconstruction algorithm by Loidreau. When applied to decode KK codes, our interpolation algorithm is equivalent to the Sudan-style list-1 decoding algorithm proposed by K/"otter and Kschischang for KK codes. The general interpolation approach is also capable of solving the interpolation problem for the list decoding of MV codes proposed by Mahdavifar and Vardy, and has a lower complexity than solving linear equations.
GENERALIZED DERIVATIONS ON PARABOLIC SUBALGEBRAS OF GENERAL LINEAR LIE ALGEBRAS
陈正新
2014-01-01
Let P be a parabolic subalgebra of a general linear Lie algebra gl(n, F) over a field F, where n ≥ 3, F contains at least n different elements, and char(F) 6= 2. In this article, we prove that generalized derivations, quasiderivations, and product zero derivations of P coincide, and any generalized derivation of P is a sum of an inner derivation, a central quasiderivation, and a scalar multiplication map of P. We also show that any commuting automorphism of P is a central automorphism, and any commuting derivation of P is a central derivation.
Adaptive Output Regulation of Unknown Linear Systems with Unknown Exosystems
Mizumoto, Ikuro; Iwai, Zenta
2009-01-01
In this paper, the adaptive regulation problem for unknown controlled systems with unknown exosystems was considered. An adaptive output feedback controller with an adaptive internal model was proposed for single input/single output linear minimum phase systems. In the proposed method, a controller with an adaptive internal model was designed through an expanded backstepping strategy of only one step with a parallel feedforward compensator (PFC).
A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION
MAZIAR SALAHI; TAMÁS TERLAKY
2009-01-01
Recently, using the framework of self-regularity, Salahi in his Ph.D. thesis proposed an adaptive single step algorithm which takes advantage of the current iterate information to find an appropriate barrier parameter rather than using a fixed fraction of the current duality gap. However, his algorithm might do at most one bad step after each good step in order to keep the iterate in a certain neighborhood of the central path. In this paper, using the same framework, we propose a hybrid adapt...
ADAPTIVE GENERALIZED PREDICTIVE CONTROL OF SWITCHED SYSTEMS
WANG Yi-jing; WANG Long
2005-01-01
The problem of adaptive generalized predictive control which consists of output prediction errors for a class of switched systems is studied. The switching law is determined by the output predictive errors of a finite number of subsystems. For the single subsystem and multiple subsystems cases, it is proved that the given direct algorithm of generalized predictive control guarantees the global convergence of the system. This algorithm overcomes the inherent drawbacks of the slow convergence and large transient errors for the conventional adaptive control.
Indirect techniques for adaptive input-output linearization of non-linear systems
Teel, Andrew; Kadiyala, Raja; Kokotovic, Peter; Sastry, Shankar
1991-01-01
A technique of indirect adaptive control based on certainty equivalence for input output linearization of nonlinear systems is proven convergent. It does not suffer from the overparameterization drawbacks of the direct adaptive control techniques on the same plant. This paper also contains a semiindirect adaptive controller which has several attractive features of both the direct and indirect schemes.
Adaptive H∞ synchronization of chaotic systems via linear and nonlinear feedback control
Adaptive H∞ synchronization of chaotic systems via linear and nonlinear feedback control is investigated. The chaotic systems are redesigned by using the generalized Hamiltonian systems and observer approach. Based on Lyapunov's stability theory, linear and nonlinear feedback control of adaptive H∞ synchronization is established in order to not only guarantee stable synchronization of both master and slave systems but also reduce the effect of external disturbance on an H∞-norm constraint. Adaptive H∞ synchronization of chaotic systems via three kinds of control is investigated with applications to Lorenz and Chen systems. Numerical simulations are also given to identify the effectiveness of the theoretical analysis. (general)
Non-linear Fields in Generalized Cosmologies
Fasiello, Matteo
2016-01-01
The perturbative approach to structure formation has recently received a lot of attention in the literature. In such setups the final predictions for observables like the power spectrum is often derived under additional approximations such as a simplified time dependence. Here we provide all-order perturbative integral solutions for density and velocity fields in generalized cosmologies. We go beyond the standard results based on extending the EdS-like approximations. As an illustrative example, we apply our findings to the calculation of the one-loop power spectrum. We find corrections close to $1\\%$ in the mildly non-linear regime of $\\Lambda$CDM cosmologies for the density power spectrum, while in the case of the density-momentum power spectrum effects can reach up to $1.5\\%$ for $k\\sim 0.2h/$Mpc.
A new adaptive scheme for the adaptive linearizing control of bioprocesses
Ferreira, E. C.; Azevedo, S. Feyo de
1996-01-01
This work deals with the development of model-based adaptive control algorithms for bioprocess operation. Non-linear adaptive control laws are proposed for single input single output regulation. Parameters are continuously adapted following a new adaptive scheme which ensures second-order dynamics of the parameter error system. A computational study is presented of the application of this theory to baker’s yeast fermentation. Results put in evidence the efficient performance both of ...
Rapid, generalized adaptation to asynchronous audiovisual speech.
Van der Burg, Erik; Goodbourn, Patrick T
2015-04-01
The brain is adaptive. The speed of propagation through air, and of low-level sensory processing, differs markedly between auditory and visual stimuli; yet the brain can adapt to compensate for the resulting cross-modal delays. Studies investigating temporal recalibration to audiovisual speech have used prolonged adaptation procedures, suggesting that adaptation is sluggish. Here, we show that adaptation to asynchronous audiovisual speech occurs rapidly. Participants viewed a brief clip of an actor pronouncing a single syllable. The voice was either advanced or delayed relative to the corresponding lip movements, and participants were asked to make a synchrony judgement. Although we did not use an explicit adaptation procedure, we demonstrate rapid recalibration based on a single audiovisual event. We find that the point of subjective simultaneity on each trial is highly contingent upon the modality order of the preceding trial. We find compelling evidence that rapid recalibration generalizes across different stimuli, and different actors. Finally, we demonstrate that rapid recalibration occurs even when auditory and visual events clearly belong to different actors. These results suggest that rapid temporal recalibration to audiovisual speech is primarily mediated by basic temporal factors, rather than higher-order factors such as perceived simultaneity and source identity. PMID:25716790
Linear Perturbation Adaptive Control of Hydraulically Driven Manipulators
Andersen, T.O.; Hansen, M.R.; Conrad, Finn
control.Using the Lyapunov approach, under slowly time-varying assumptions, it is shown that the tracking error and the parameter error remain bounded. This bound is a function of the ideal parameters and a bounded disturbance. The control algorithm decouples and linearizes the manipulator so that each......A method for synthesis of a robust adaptive scheme for a hydraulically driven manipulator, that takes full advantage of any known system dynamics to simplify the adaptive control problem for the unknown portion of the dynamics is presented. The control method is based on adaptive perturbation...
Linear Perturbation Adaptive Control of Hydraulically Driven Manipulators
Andersen, T.O.; Hansen, M.R.; Conrad, Finn
2004-01-01
A method for synthesis of a robust adaptive scheme for a hydraulically driven manipulator, that takes full advantage of any known system dynamics to simplify the adaptive control problem for the unknown portion of the dynamics is presented. The control method is based on adaptive perturbation...... control.Using the Lyapunov approach, under slowly time-varying assumptions, it is shown that the tracking error and the parameter error remain bounded. This bound is a function of the ideal parameters and a bounded disturbance. The control algorithm decouples and linearizes the manipulator so that each...... joint behaves as an independent second-order system with fixed dynamics....
Bootstraping the general linear hypothesis test
Delicado, Pedro; Río, Manuel del, 1690-1766
1993-01-01
We discuss the use of bootstrap methodology in hypothesis testing, focusing on the classical F-test for linear hypotheses in the linear model. A modification of the F-statistics which allows for resampling under the null hypothesis is proposed. This approach is specifically considered in the one-way analysis of variance model. A simulation study illustrating the behaviour of our proposal is presented.
Self-characterization of linear and nonlinear adaptive optics systems.
Hampton, Peter J; Conan, Rodolphe; Keskin, Onur; Bradley, Colin; Agathoklis, Pan
2008-01-10
We present methods used to determine the linear or nonlinear static response and the linear dynamic response of an adaptive optics (AO) system. This AO system consists of a nonlinear microelectromechanical systems deformable mirror (DM), a linear tip-tilt mirror (TTM), a control computer, and a Shack-Hartmann wavefront sensor. The system is modeled using a single-input-single-output structure to determine the one-dimensional transfer function of the dynamic response of the chain of system hardware. An AO system has been shown to be able to characterize its own response without additional instrumentation. Experimentally determined models are given for a TTM and a DM. PMID:18188192
Discrete Time Optimal Adaptive Control for Linear Stochastic Systems
JIANG Rui; LUO Guiming
2007-01-01
The least-squares(LS)algorithm has been used for system modeling for a long time. Without any excitation conditions, only the convergence rate of the common LS algorithm can be obtained. This paper analyzed the weighted least-squares(WLS)algorithm and described the good properties of the WLS algorithm. The WLS algorithm was then used for daptive control of linear stochastic systems to show that the linear closed-loop system was globally stable and that the system identification was consistent. Compared to the past optimal adaptive controller,this controller does not impose restricted conditions on the coefficients of the system, such as knowing the first coefficient before the controller. Without any persistent excitation conditions, the analysis shows that, with the regulation of the adaptive control, the closed-loop system was globally stable and the adaptive controller converged to the one-step-ahead optimal controller in some sense.
Coded Adaptive Linear Precoded Discrete Multitone Over PLC Channel
Muhammad, Fahad Syed; Hélard, Jean-François; Crussière, Matthieu
2008-01-01
Discrete multitone modulation (DMT) systems exploit the capabilities of orthogonal subcarriers to cope efficiently with narrowband interference, high frequency attenuations and multipath fadings with the help of simple equalization filters. Adaptive linear precoded discrete multitone (LP-DMT) system is based on classical DMT, combined with a linear precoding component. In this paper, we investigate the bit and energy allocation algorithm of an adaptive LP-DMT system taking into account the channel coding scheme. A coded adaptive LPDMT system is presented in the power line communication (PLC) context with a loading algorithm which accommodates the channel coding gains in bit and energy calculations. The performance of a concatenated channel coding scheme, consisting of an inner Wei's 4-dimensional 16-states trellis code and an outer Reed-Solomon code, in combination with the proposed algorithm is analyzed. Theoretical coding gains are derived and simulation results are presented for a fixed target bit error ra...
Linear Superposition of Minimal Surfaces: Generalized Helicoids and Minimal Cones
Hoppe, Jens
2016-01-01
Observing a linear superposition principle, a family of new minimal hypersurfaces in Euclidean space is found, as well as that linear combinations of generalized helicoids induce new algebraic minimal cones of arbitrarily high degree.
General linear methods for integrated circuit design
Voigtmann, Steffen
2006-01-01
Bei der Modellierung elektrischer Schaltungen ergeben sich Algebro-Differentialgleichungen (DAEs) mit proper formuliertem Hauptterm. Diese Gleichungen müssen z.B. bei der transienten Schaltungssimulation numerisch gelöst werden. Bei den klassischen Ansätzen der Linearen Mehrschrittverfahren oder der Runge-Kutta Verfahren ergeben sich Nachteile, die durch Verwendung von Allgemeinen Linearen Verfahren vermieden werden können. Sowohl Lineare Mehrschrittverfahren als auch Runge-Kutta Ver...
Adaptive feedback linearization applied to steering of ships
Thor I. Fossen
1993-10-01
Full Text Available This paper describes the application of feedback linearization to automatic steering of ships. The flexibility of the design procedure allows the autopilot to be optimized for both course-keeping and course-changing manoeuvres. Direct adaptive versions of both the course-keeping and turning controller are derived. The advantages of the adaptive controllers are improved performance and reduced fuel consumption. The application of nonlinear control theory also allows the designer in a systematic manner to compensate for nonlinearities in the control design.
Generalized local homology and cohomology for linearly compact modules
We study generalized local homology for linearly compact modules. By duality, we get some properties of generalized local cohomology modules and extend well-known properties of local cohomology of A. Grothendieck. (author)
Adaptive Gaussian Mixture Filter Based on Statistical Linearization
Huber, Marco F.
2012-01-01
Gaussian mixtures are a common density representation in nonlinear, non-Gaussian Bayesian state estimation. Selecting an appropriate number of Gaussian components, however, is difficult as one has to trade of computational complexity against estimation accuracy. In this paper, an adaptive Gaussian mixture filter based on statistical linearization is proposed. Depending on the nonlinearity of the considered estimation problem, this filter dynamically increases the number of components via spli...
Adaptive spectral identification techniques in presence of undetected non linearities
Cella, G; Guidi, G M
2002-01-01
The standard procedure for detection of gravitational wave coalescing binaries signals is based on Wiener filtering with an appropriate bank of template filters. This is the optimal procedure in the hypothesis of addictive Gaussian and stationary noise. We study the possibility of improving the detection efficiency with a class of adaptive spectral identification techniques, analyzing their effect in presence of non stationarities and undetected non linearities in the noise
Flexible Satellite Attitude Control via Adaptive Fuzzy Linearization
GUAN Ping; LIU Xiang-dong; CHEN Jia-bin; LIU Xiao-he
2005-01-01
The adaptive fuzzy control is combined with input-output linearization control to constitute the hybrid controller. The control method is then applied to the attitude maneuver control of the flexible satellite.The basic control structure is given. The rules of the controller parameter selection, which guarantee the attitude stabilization of the satellite with parameter uncertainties, have been analyzed. Simulation results show that the precise attitude control is accomplished in spite of the uncertainty in the system.
QUADRATIC INVARIANTS AND SYMPLECTIC STRUCTURE OF GENERAL LINEAR METHODS
Ai-guo Xiao; Shou-fu Li; Min Yang
2001-01-01
In this paper, we present some invariants and conservation laws of general linear methods applied to differential equation systems. We show that the quadratic invariants and symplecticity of the systems can be extended to general linear methods by a tensor product, and show that general linear methods with the matrix M=0 inherit in an extended sense the quadratic invariants possessed by the differential equation systems being integrated and preserve in an extended sense the symplectic structure of the phase space in the integration of Hamiltonian systems. These unify and extend existing relevant results on Runge-Kutta methods, linear multistep methods and one-leg methods. Finally, as special cases of general linear methods, we examine multistep Runge-Kutta methods, one-leg methods and linear two-step methods in detail.
Linear generalized synchronization of continuous-time chaotic systems
This paper develops a general approach for constructing a response system to implement linear generalized synchronization (GS) with the drive continuous-time chaotic system. Some sufficient conditions of global asymptotic linear GS between the drive and response continuous-time chaotic systems are attained from rigorously modern control theory. Finally, we take Chua's circuit as an example for illustration and verification
Linear generalized synchronization of continuous-time chaotic systems
Lu Jun
2003-01-01
This paper develops a general approach for constructing a response system to implement linear generalized synchronization (GS) with the drive continuous-time chaotic system. Some sufficient conditions of global asymptotic linear GS between the drive and response continuous-time chaotic systems are attained from rigorously modern control theory. Finally, we take Chua's circuit as an example for illustration and verification.
Adaptive set-point tracking of the Lorenz chaotic system using non-linear feedback
In this paper, an adaptive control method for set-point tracking of the Lorenz chaotic system by using non-linear feedback is proposed. The design procedure of the proposed controller is accomplished in two steps. At the first step, using Lyapunov's direct method, a non-linear state feedback is selected so that without any need to apply identification techniques, in despite of the uncertain parameters existence in the system state equations, the asymptotic stability of the general Lorenz system is guaranteed in a stochastic point of the manifold containing general system equilibrium points. At the second step, a linear state feedback with adaptive gain is added to the prior controller to eliminate the tracking error. In order to guarantee the system asymptotic stability at desired set-point, the indirect Lyapunov's method is used. Finally, to show the effectiveness of the proposed methodology, the simulation results of different experiments including system parameters changes and set-point variation are provided.
An adaptive genetic algorithm for solving bilevel linear programming problem
无
2007-01-01
Bilevel linear programming, which consists of the objective functions of the upper level and lower level, is a useful tool for modeling decentralized decision problems.Various methods are proposed for solving this problem. Of all the algorithms, the genetic algorithm is an alternative to conventional approaches to find the solution of the bilevel linear programming. In this paper, we describe an adaptive genetic algorithm for solving the bilevel linear programming problem to overcome the difficulty of determining the probabilities of crossover and mutation. In addition, some techniques are adopted not only to deal with the difficulty that most of the chromosomes may be infeasible in solving constrained optimization problem with genetic algorithm but also to improve the efficiency of the algorithm. The performance of this proposed algorithm is illustrated by the examples from references.
Cheong, Yuk Fai; Kamata, Akihito
2013-01-01
In this article, we discuss and illustrate two centering and anchoring options available in differential item functioning (DIF) detection studies based on the hierarchical generalized linear and generalized linear mixed modeling frameworks. We compared and contrasted the assumptions of the two options, and examined the properties of their DIF…
Rapid, generalized adaptation to asynchronous audiovisual speech
Van der Burg, Erik; Goodbourn, Patrick T.
2015-01-01
The brain is adaptive. The speed of propagation through air, and of low-level sensory processing, differs markedly between auditory and visual stimuli; yet the brain can adapt to compensate for the resulting cross-modal delays. Studies investigating temporal recalibration to audiovisual speech have used prolonged adaptation procedures, suggesting that adaptation is sluggish. Here, we show that adaptation to asynchronous audiovisual speech occurs rapidly. Participants viewed a brief clip of an...
Linearly and Quadratically Separable Classifiers Using Adaptive Approach
Mohamed Abdel-Kawy Mohamed Ali Soliman; Rasha M. Abo-Bakr
2011-01-01
This paper presents a fast adaptive iterative algorithm to solve linearly separable classification problems in Rn.In each iteration,a subset of the sampling data (n-points,where n is the number of features) is adaptively chosen and a hyperplane is constructed such that it separates the chosen n-points at a margin e and best classifies the remaining points.The classification problem is formulated and the details of the algorithm are presented.Further,the algorithm is extended to solving quadratically separable classification problems.The basic idea is based on mapping the physical space to another larger one where the problem becomes linearly separable.Numerical illustrations show that few iteration steps are sufficient for convergence when classes are linearly separable.For nonlinearly separable data,given a specified maximum number of iteration steps,the algorithm returns the best hyperplane that minimizes the number of misclassified points occurring through these steps.Comparisons with other machine learning algorithms on practical and benchmark datasets are also presented,showing the performance of the proposed algorithm.
Generalized Linear Models with Applications in Engineering and the Sciences
Myers, Raymond H; Vining, G Geoffrey; Robinson, Timothy J
2012-01-01
Praise for the First Edition "The obvious enthusiasm of Myers, Montgomery, and Vining and their reliance on their many examples as a major focus of their pedagogy make Generalized Linear Models a joy to read. Every statistician working in any area of applied science should buy it and experience the excitement of these new approaches to familiar activities."-Technometrics Generalized Linear Models: With Applications in Engineering and the Sciences, Second Edition continues to provide a clear introduction to the theoretical foundations and key applications of generalized linear models (GLMs). Ma
Adaptive Semi-linear Inversion of Strong Gravitational Lens Imaging
Nightingale, James
2014-01-01
We present a new pixelized method for the inversion of gravitationally lensed extended source images which we term adaptive semi-linear inversion (SLI). At the heart of the method is an h-means clustering algorithm which is used to derive a source plane pixelization that adapts to the lens model magnification. The distinguishing feature of adaptive SLI is that every pixelization is derived from a random initialization, ensuring that data discretization is performed in a completely different and unique way for every lens model parameter set. We compare standard SLI on a fixed source pixel grid with the new method and demonstrate the shortcomings of the former when modeling singular power law ellipsoid (SPLE) lens profiles. In particular, we demonstrate the superior reliability and efficiency of adaptive SLI which, by design, fixes the number of degrees of freedom (NDOF) of the optimization and thereby removes biases present with other methods that allow the NDOF to vary. In addition, we highlight the importanc...
Adaptive distributed parameter and input estimation in linear parabolic PDEs
Mechhoud, Sarra
2016-01-01
In this paper, we discuss the on-line estimation of distributed source term, diffusion, and reaction coefficients of a linear parabolic partial differential equation using both distributed and interior-point measurements. First, new sufficient identifiability conditions of the input and the parameter simultaneous estimation are stated. Then, by means of Lyapunov-based design, an adaptive estimator is derived in the infinite-dimensional framework. It consists of a state observer and gradient-based parameter and input adaptation laws. The parameter convergence depends on the plant signal richness assumption, whereas the state convergence is established using a Lyapunov approach. The results of the paper are illustrated by simulation on tokamak plasma heat transport model using simulated data.
Adaptive Unified Biased Estimators of Parameters in Linear Model
Hu Yang; Li-xing Zhu
2004-01-01
To tackle multi collinearity or ill-conditioned design matrices in linear models,adaptive biased estimators such as the time-honored Stein estimator,the ridge and the principal component estimators have been studied intensively.To study when a biased estimator uniformly outperforms the least squares estimator,some suficient conditions are proposed in the literature.In this paper,we propose a unified framework to formulate a class of adaptive biased estimators.This class includes all existing biased estimators and some new ones.A suficient condition for outperforming the least squares estimator is proposed.In terms of selecting parameters in the condition,we can obtain all double-type conditions in the literature.
Generalizing a Categorization of Students' Interpretations of Linear Kinematics Graphs
Bollen, Laurens; De Cock, Mieke; Zuza, Kristina; Guisasola, Jenaro; van Kampen, Paul
2016-01-01
We have investigated whether and how a categorization of responses to questions on linear distance-time graphs, based on a study of Irish students enrolled in an algebra-based course, could be adopted and adapted to responses from students enrolled in calculus-based physics courses at universities in Flanders, Belgium (KU Leuven) and the Basque…
A New Method for Solving General Dual Fuzzy Linear Systems
M. Otadi
2013-09-01
Full Text Available . According to fuzzy arithmetic, general dual fuzzy linear system (GDFLS cannot be replaced by a fuzzy linear system (FLS. In this paper, we use new notation of fuzzy numbers and convert a GDFLS to two linear systems in crisp case, then we discuss complexity of the proposed method. Conditions for the existence of a unique fuzzy solution to n × n GDFLS are derived
Minimal solution of general dual fuzzy linear systems
Fuzzy linear systems of equations, play a major role in several applications in various area such as engineering, physics and economics. In this paper, we investigate the existence of a minimal solution of general dual fuzzy linear equation systems. Two necessary and sufficient conditions for the minimal solution existence are given. Also, some examples in engineering and economic are considered
Testing Parametric versus Semiparametric Modelling in Generalized Linear Models
Härdle, W.K.; Mammen, E.; Müller, M.D.
1996-01-01
We consider a generalized partially linear model E(Y|X,T) = G{X'b + m(T)} where G is a known function, b is an unknown parameter vector, and m is an unknown function.The paper introduces a test statistic which allows to decide between a parametric and a semiparametric model: (i) m is linear, i.e. m(
Linear generalized synchronization of continuous-time chaotic systems
Lu Junguo E-mail: jglu@sjtu.edu.cn; Xi Yugeng
2003-08-01
This paper develops a general approach for constructing a response system to implement linear generalized synchronization (GS) with the drive continuous-time chaotic system. Some sufficient conditions of global asymptotic linear GS between the drive and response continuous-time chaotic systems are attained from rigorously modern control theory. Finally, we take Chua's circuit as an example for illustration and verification.
Adaptive linear rank tests for eQTL studies.
Szymczak, Silke; Scheinhardt, Markus O; Zeller, Tanja; Wild, Philipp S; Blankenberg, Stefan; Ziegler, Andreas
2013-02-10
Expression quantitative trait loci (eQTL) studies are performed to identify single-nucleotide polymorphisms that modify average expression values of genes, proteins, or metabolites, depending on the genotype. As expression values are often not normally distributed, statistical methods for eQTL studies should be valid and powerful in these situations. Adaptive tests are promising alternatives to standard approaches, such as the analysis of variance or the Kruskal-Wallis test. In a two-stage procedure, skewness and tail length of the distributions are estimated and used to select one of several linear rank tests. In this study, we compare two adaptive tests that were proposed in the literature using extensive Monte Carlo simulations of a wide range of different symmetric and skewed distributions. We derive a new adaptive test that combines the advantages of both literature-based approaches. The new test does not require the user to specify a distribution. It is slightly less powerful than the locally most powerful rank test for the correct distribution and at least as powerful as the maximin efficiency robust rank test. We illustrate the application of all tests using two examples from different eQTL studies. PMID:22933317
Adaptive fuzzy bilinear observer based synchronization design for generalized Lorenz system
This Letter proposes an adaptive fuzzy bilinear observer (FBO) based synchronization design for generalized Lorenz system (GLS). The GLS can be described to TS fuzzy bilinear generalized Lorenz model (FBGLM) with their states immeasurable and their parameters unknown. We design an adaptive FBO based on TS FBGLM for synchronization. Lyapunov theory is employed to guarantee the stability of error dynamic system via linear matrix equalities (LMIs) and to derive the adaptive laws to estimate unknown parameters. Numerical example is given to demonstrate the validity of our proposed adaptive FBO approach for synchronization.
Adaptation in Cones: A General Model
Dawis, Stevan M.; Purple, Richard L.
1982-01-01
Three features appear to characterize steady-state light adaptation in vertebrate cone photoreceptors: (a) the shape of the “log intensity-response” curve at different levels of adaptation is the same, the only change with adaptation is in the position of the point on the curve about which the cones operate; (b) at high adapting intensities the operating point becomes fixed in position; (c) this fixed position is at the steepest point of the log intensity-response curve. These three features ...
Faraway, Julian J
2005-01-01
Linear models are central to the practice of statistics and form the foundation of a vast range of statistical methodologies. Julian J. Faraway''s critically acclaimed Linear Models with R examined regression and analysis of variance, demonstrated the different methods available, and showed in which situations each one applies. Following in those footsteps, Extending the Linear Model with R surveys the techniques that grow from the regression model, presenting three extensions to that framework: generalized linear models (GLMs), mixed effect models, and nonparametric regression models. The author''s treatment is thoroughly modern and covers topics that include GLM diagnostics, generalized linear mixed models, trees, and even the use of neural networks in statistics. To demonstrate the interplay of theory and practice, throughout the book the author weaves the use of the R software environment to analyze the data of real examples, providing all of the R commands necessary to reproduce the analyses. All of the ...
Linearly Bounded Liars, Adaptive Covering Codes, and Deterministic Random Walks
Cooper, Joshua N
2009-01-01
We analyze a deterministic form of the random walk on the integer line called the {\\em liar machine}, similar to the rotor-router model, finding asymptotically tight pointwise and interval discrepancy bounds versus random walk. This provides an improvement in the best-known winning strategies in the binary symmetric pathological liar game with a linear fraction of responses allowed to be lies. Equivalently, this proves the existence of adaptive binary block covering codes with block length $n$, covering radius $\\leq fn$ for $f\\in(0,1/2)$, and cardinality $O(\\sqrt{\\log \\log n}/(1-2f))$ times the sphere bound $2^n/\\binom{n}{\\leq \\lfloor fn\\rfloor}$.
Adaptive discontinuous Galerkin methods for non-linear reactive flows
Uzunca, Murat
2016-01-01
The focus of this monograph is the development of space-time adaptive methods to solve the convection/reaction dominated non-stationary semi-linear advection diffusion reaction (ADR) equations with internal/boundary layers in an accurate and efficient way. After introducing the ADR equations and discontinuous Galerkin discretization, robust residual-based a posteriori error estimators in space and time are derived. The elliptic reconstruction technique is then utilized to derive the a posteriori error bounds for the fully discrete system and to obtain optimal orders of convergence. As coupled surface and subsurface flow over large space and time scales is described by (ADR) equation the methods described in this book are of high importance in many areas of Geosciences including oil and gas recovery, groundwater contamination and sustainable use of groundwater resources, storing greenhouse gases or radioactive waste in the subsurface.
Testing for one Generalized Linear Single Order Parameter
Ellegaard, Niels Langager; Christensen, Tage Emil; Dyre, Jeppe;
We examine a linear single order parameter model for thermoviscoelastic relaxation in viscous liquids, allowing for a distribution of relaxation times. In this model the relaxation of volume and entalpy is completely described by the relaxation of one internal order parameter. In contrast to prior...... work the order parameter may be chosen to have a non-exponential relaxation. The model predictions contradict the general consensus of the properties of viscous liquids in two ways: (i) The model predicts that following a linear isobaric temperature step, the normalized volume and entalpy relaxation...... functions are identical. This assumption conflicts with some (but not all) reports, utilizing the Tool-Narayanaswamy formalism to extrapolate from non-linear measurements to the linear regime. (ii) The model predicts that the theoretical "linear Prigogine-Defay" ratio is one. This ratio has never been...
Estimation and variable selection for generalized additive partial linear models
Wang, Li
2011-08-01
We study generalized additive partial linear models, proposing the use of polynomial spline smoothing for estimation of nonparametric functions, and deriving quasi-likelihood based estimators for the linear parameters. We establish asymptotic normality for the estimators of the parametric components. The procedure avoids solving large systems of equations as in kernel-based procedures and thus results in gains in computational simplicity. We further develop a class of variable selection procedures for the linear parameters by employing a nonconcave penalized quasi-likelihood, which is shown to have an asymptotic oracle property. Monte Carlo simulations and an empirical example are presented for illustration. © Institute of Mathematical Statistics, 2011.
An implicit spectral formula for generalized linear Schroedinger equations
We generalize the semiclassical Bohr–Sommerfeld quantization rule to an exact, implicit spectral formula for linear, generalized Schroedinger equations admitting a discrete spectrum. Special cases include the position-dependent mass Schroedinger equation or the Schroedinger equation for weighted energy. Requiring knowledge of the potential and the solution associated with the lowest spectral value, our formula predicts the complete spectrum in its exact form. (author)
The linear model and hypothesis a general unifying theory
Seber, George
2015-01-01
This book provides a concise and integrated overview of hypothesis testing in four important subject areas, namely linear and nonlinear models, multivariate analysis, and large sample theory. The approach used is a geometrical one based on the concept of projections and their associated idempotent matrices, thus largely avoiding the need to involve matrix ranks. It is shown that all the hypotheses encountered are either linear or asymptotically linear, and that all the underlying models used are either exactly or asymptotically linear normal models. This equivalence can be used, for example, to extend the concept of orthogonality in the analysis of variance to other models, and to show that the asymptotic equivalence of the likelihood ratio, Wald, and Score (Lagrange Multiplier) hypothesis tests generally applies.
Beam envelope calculations in general linear coupled lattices
Chung, Moses, E-mail: mchung@unist.ac.kr [Department of Physics, Ulsan National Institute of Science and Technology, Ulsan 689-798 (Korea, Republic of); Qin, Hong [Plasma Physics Laboratory, Princeton University, Princeton, New Jersey 08543 (United States); Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui 230026 (China); Groening, Lars; Xiao, Chen [GSI Helmholtzzentrum für Schwerionenforschung GmbH, Planckstrasse 1, D-64291 Darmstadt (Germany); Davidson, Ronald C. [Plasma Physics Laboratory, Princeton University, Princeton, New Jersey 08543 (United States)
2015-01-15
The envelope equations and Twiss parameters (β and α) provide important bases for uncoupled linear beam dynamics. For sophisticated beam manipulations, however, coupling elements between two transverse planes are intentionally introduced. The recently developed generalized Courant-Snyder theory offers an effective way of describing the linear beam dynamics in such coupled systems with a remarkably similar mathematical structure to the original Courant-Snyder theory. In this work, we present numerical solutions to the symmetrized matrix envelope equation for β which removes the gauge freedom in the matrix envelope equation for w. Furthermore, we construct the transfer and beam matrices in terms of the generalized Twiss parameters, which enables calculation of the beam envelopes in arbitrary linear coupled systems.
Neural Generalized Predictive Control of a non-linear Process
Sørensen, Paul Haase; Nørgård, Peter Magnus; Ravn, Ole; Poulsen, Niels Kjølstad
1998-01-01
qualities. The controller is a non-linear version of the well-known generalized predictive controller developed in linear control theory. It involves minimization of a cost function which in the present case has to be done numerically. Therefore, we develop the numerical algorithms necessary in substantial......The use of neural network in non-linear control is made difficult by the fact the stability and robustness is not guaranteed and that the implementation in real time is non-trivial. In this paper we introduce a predictive controller based on a neural network model which has promising stability...... detail and discuss the implementation difficulties. The neural generalized predictive controller is tested on a pneumatic servo sys-tem....
A random effects generalized linear model for reliability compositive evaluation
无
2009-01-01
This paper first proposes a random effects generalized linear model to evaluate the storage life of one kind of high reliable and small sample-sized products by combining multi-sources information of products coming from the same population but stored at different environments. The relevant algorithms are also provided. Simulation results manifest the soundness and effectiveness of the proposed model.
Witten's perturbation on strata with general adapted metrics
López, Jesús A. Álvarez; Calaza, Manuel
2015-01-01
Let $M$ be a stratum of a compact stratified space $A$. It is equipped with a general adapted metric $g$, which is slightly more general than the adapted metrics of Nagase and Brasselet-Hector-Saralegi. In particular, $g$ has a general type, which is an extension of the type of an adapted metric. A restriction on this general type is assumed, and then $g$ is called good. We consider the maximum/minimun ideal boundary condition, $d_{\\text{max/min}}$, of the compactly supported de~Rham complex ...
A twisted generalization of linear Poisson brackets of hydrodynamic type
We study a twisted generalization of linear Poisson brackets of hydrodynamic type, in which the Lie bracket is replaced by a Hom-Lie bracket. With some natural additional conditions, such structures correspond to the Hom-Novikov algebras introduced by Yau, which is the twisted version of Balinsky-Novikov's approach of constructing a Lie algebra from a Novikov algebra. Certain central extensions of this twisted generalization of linear Poisson brackets of hydrodynamic type are obtained from the bilinear forms on their corresponding Hom-Novikov algebras satisfying some invariance conditions. Finally, we give some examples of the infinite-dimensional Hom-Lie algebras constructed from the Hom-Novikov algebras. In particular, there is an interesting twisted generalization of the Virasoro algebra.
Regularization Paths for Generalized Linear Models via Coordinate Descent
Jerome Friedman
2010-02-01
Full Text Available We develop fast algorithms for estimation of generalized linear models with convex penalties. The models include linear regression, two-class logistic regression, and multi- nomial regression problems while the penalties include ℓ1 (the lasso, ℓ2 (ridge regression and mixtures of the two (the elastic net. The algorithms use cyclical coordinate descent, computed along a regularization path. The methods can handle large problems and can also deal efficiently with sparse features. In comparative timings we find that the new algorithms are considerably faster than competing methods.
A new heuristic algorithm for general integer linear programming problems
GAO Pei-wang; CAI Ying
2006-01-01
A new heuristic algorithm is proposed for solving general integer linear programming problems.In the algorithm,the objective function hyperplane is used as a cutting plane,and then by introducing a special set of assistant sets,an efficient heuristic search for the solution to the integer linear program is carried out in the sets on the objective function hyperplane.A simple numerical example shows that the algorithm is efficient for some problems,and therefore,of practical interest.
Local Linear Embedding Algorithm with Adaptively Determining Neighborhood
Zhenduo Wang
2014-06-01
Full Text Available Local linear embedding is a kind of very competitive nonlinear dimensionality reduction technique with good representational capacity for a broader range of manifolds and high computational efficiency. However, it is based on the assumption that the whole data manifolds are evenly distributed so that it determines the neighborhood for all points with the same neighborhood size. Accordingly, it fails to nicely deal with most real problems that are unevenly distributed. This paper presents a new approach that takes the general conceptual framework of Hessian locally linear embedding so as to guarantee its correctness in the setting of local isometry for an open connected subset, but dynamically determines the local neighborhood size for each point. This approach estimates the approximate geodesic distance between any two points by the shortest path in the local neighborhood graph, and then determines the neighborhood size for each point by using the relationship between its local estimated geodesic distance matrix and local Euclidean distance matrix. This approach has clear geometry intuition as well as the better performance and stability. It deals with the sparsely sampled or noise contaminated data sets that are often unevenly distributed. The conducted experiments on benchmark data sets validate the proposed approach
Computation of Optimal Monotonicity Preserving General Linear Methods
Ketcheson, David I.
2009-07-01
Monotonicity preserving numerical methods for ordinary differential equations prevent the growth of propagated errors and preserve convex boundedness properties of the solution. We formulate the problem of finding optimal monotonicity preserving general linear methods for linear autonomous equations, and propose an efficient algorithm for its solution. This algorithm reliably finds optimal methods even among classes involving very high order accuracy and that use many steps and/or stages. The optimality of some recently proposed methods is verified, and many more efficient methods are found. We use similar algorithms to find optimal strong stability preserving linear multistep methods of both explicit and implicit type, including methods for hyperbolic PDEs that use downwind-biased operators.
The generalized sidelobe canceller based on quaternion widely linear processing.
Tao, Jian-wu; Chang, Wen-xiu
2014-01-01
We investigate the problem of quaternion beamforming based on widely linear processing. First, a quaternion model of linear symmetric array with two-component electromagnetic (EM) vector sensors is presented. Based on array's quaternion model, we propose the general expression of a quaternion semiwidely linear (QSWL) beamformer. Unlike the complex widely linear beamformer, the QSWL beamformer is based on the simultaneous operation on the quaternion vector, which is composed of two jointly proper complex vectors, and its involution counterpart. Second, we propose a useful implementation of QSWL beamformer, that is, QSWL generalized sidelobe canceller (GSC), and derive the simple expressions of the weight vectors. The QSWL GSC consists of two-stage beamformers. By designing the weight vectors of two-stage beamformers, the interference is completely canceled in the output of QSWL GSC and the desired signal is not distorted. We derive the array's gain expression and analyze the performance of the QSWL GSC in the presence of one type of interference. The advantage of QSWL GSC is that the main beam can always point to the desired signal's direction and the robustness to DOA mismatch is improved. Finally, simulations are used to verify the performance of the proposed QSWL GSC. PMID:24955425
The Generalized Sidelobe Canceller Based on Quaternion Widely Linear Processing
Jian-wu Tao
2014-01-01
Full Text Available We investigate the problem of quaternion beamforming based on widely linear processing. First, a quaternion model of linear symmetric array with two-component electromagnetic (EM vector sensors is presented. Based on array’s quaternion model, we propose the general expression of a quaternion semiwidely linear (QSWL beamformer. Unlike the complex widely linear beamformer, the QSWL beamformer is based on the simultaneous operation on the quaternion vector, which is composed of two jointly proper complex vectors, and its involution counterpart. Second, we propose a useful implementation of QSWL beamformer, that is, QSWL generalized sidelobe canceller (GSC, and derive the simple expressions of the weight vectors. The QSWL GSC consists of two-stage beamformers. By designing the weight vectors of two-stage beamformers, the interference is completely canceled in the output of QSWL GSC and the desired signal is not distorted. We derive the array’s gain expression and analyze the performance of the QSWL GSC in the presence of one type of interference. The advantage of QSWL GSC is that the main beam can always point to the desired signal’s direction and the robustness to DOA mismatch is improved. Finally, simulations are used to verify the performance of the proposed QSWL GSC.
A Non-Gaussian Spatial Generalized Linear Latent Variable Model
Irincheeva, Irina
2012-08-03
We consider a spatial generalized linear latent variable model with and without normality distributional assumption on the latent variables. When the latent variables are assumed to be multivariate normal, we apply a Laplace approximation. To relax the assumption of marginal normality in favor of a mixture of normals, we construct a multivariate density with Gaussian spatial dependence and given multivariate margins. We use the pairwise likelihood to estimate the corresponding spatial generalized linear latent variable model. The properties of the resulting estimators are explored by simulations. In the analysis of an air pollution data set the proposed methodology uncovers weather conditions to be a more important source of variability than air pollution in explaining all the causes of non-accidental mortality excluding accidents. © 2012 International Biometric Society.
Probability method for cryptanalysis of general multivariate modular linear equation
ZHOU HaiJian; LUO Ping; WANG DaoShun; DAI YiQi
2009-01-01
Finding the solution to a general multivariate modular linear equation plays an important role in crypt-analysis field. Earlier results show that obtaining a relatively short solution is possible in polynomial time. However, one problem arises here that if the equation has a short solution in given bounded range, the results outputted by earlier algorithms are often not the ones we are interested in. In this paper, we present a probability method based on lattice basis reduction to solve the problem. For a general multivariate modular linear equation with short solution in the given bounded range, the new method outputs this short solution in polynomial time, with a high probability. When the number of unknowns is not too large (smaller than 68), the probability is approximating 1. Experimental results show that Knapsack systems and Lu-Lee type systems are easily broken in polynomial time with this new method.
Parametrizing linear generalized Langevin dynamics from explicit molecular dynamics simulations
Gottwald, Fabian; Ivanov, Sergei D; Kühn, Oliver
2015-01-01
Fundamental understanding of complex dynamics in many-particle systems on the atomistic level is of utmost importance. Often the systems of interest are of macroscopic size but can be partitioned into few important degrees of freedom which are treated most accurately and others which constitute a thermal bath. Particular attention in this respect attracts the linear generalized Langevin equation (GLE), which can be rigorously derived by means of a linear projection (LP) technique. Within this framework a complicated interaction with the bath can be reduced to a single memory kernel. This memory kernel in turn is parametrized for a particular system studied, usually by means of time-domain methods based on explicit molecular dynamics data. Here we discuss that this task is most naturally achieved in frequency domain and develop a Fourier-based parametrization method that outperforms its time-domain analogues. Very surprisingly, the widely used rigid bond method turns out to be inappropriate in general. Importa...
Optimal Scaling of Interaction Effects in Generalized Linear Models
2007-01-01
Multiplicative interaction models, such as Goodman's RC(M) association models, can be a useful tool for analyzing the content of interaction effects. However, most models for interaction effects are only suitable for data sets with two or three predictor variables. Here, we discuss an optimal scaling model for analyzing the content of interaction effects in generalized linear models with any number of categorical predictor variables. This model, which we call the optimal scaling of interactio...
Optimal Scaling of Interaction Effects in Generalized Linear Models
van Rosmalen, Joost; Koning, Alex; Groenen, Patrick
2007-01-01
textabstractMultiplicative interaction models, such as Goodman's RC(M) association models, can be a useful tool for analyzing the content of interaction effects. However, most models for interaction effects are only suitable for data sets with two or three predictor variables. Here, we discuss an optimal scaling model for analyzing the content of interaction effects in generalized linear models with any number of categorical predictor variables. This model, which we call the optimal scaling o...
General treatment of a non-linear gauge condition
A non linear gauge condition is presented in the frame of a non abelian gauge theory broken with the Higgs mechanism. It is shown that this condition already introduced for the standard SU(2) x U(1) model can be generalized for any gauge model with the same type of simplification, namely the suppression of any coupling of the form: massless gauge boson, massive gauge boson, unphysical Higgs
Polymorphic Uncertain Linear Programming for Generalized Production Planning Problems
Xinbo Zhang; Feng Zhang; Xiaohong Chen; Zhong Wan
2014-01-01
A polymorphic uncertain linear programming (PULP) model is constructed to formulate a class of generalized production planning problems. In accordance with the practical environment, some factors such as the consumption of raw material, the limitation of resource and the demand of product are incorporated into the model as parameters of interval and fuzzy subsets, respectively. Based on the theory of fuzzy interval program and the modified possibility degree for the order of interval numbers,...
A generalized linear Hubble law for an inhomogeneous barotropic Universe
Pascual-Sánchez, J. -F.
2000-01-01
In this work, I present a generalized linear Hubble law for a barotropic spherically symmetric inhomogeneous spacetime, which is in principle compatible with the acceleration of the cosmic expansion obtained as a result of high redshift Supernovae data. The new Hubble function, defined by this law, has two additional terms besides an expansion one, similar to the usual volume expansion one of the FLRW models, but now due to an angular expansion. The first additional term is dipolar and is a c...
A general method for enclosing solutions of interval linear equations
Rohn, Jiří
2012-01-01
Roč. 6, č. 4 (2012), s. 709-717. ISSN 1862-4472 R&D Projects: GA ČR GA201/09/1957; GA ČR GC201/08/J020 Institutional research plan: CEZ:AV0Z10300504 Keywords : interval linear equations * solution set * enclosure * absolute value inequality Subject RIV: BA - General Mathematics Impact factor: 1.654, year: 2012
Genetic parameters for racing records in trotters using linear and generalized linear models.
Suontama, M; van der Werf, J H J; Juga, J; Ojala, M
2012-09-01
Heritability and repeatability and genetic and phenotypic correlations were estimated for trotting race records with linear and generalized linear models using 510,519 records on 17,792 Finnhorses and 513,161 records on 25,536 Standardbred trotters. Heritability and repeatability were estimated for single racing time and earnings traits with linear models, and logarithmic scale was used for racing time and fourth-root scale for earnings to correct for nonnormality. Generalized linear models with a gamma distribution were applied for single racing time and with a multinomial distribution for single earnings traits. In addition, genetic parameters for annual earnings were estimated with linear models on the observed and fourth-root scales. Racing success traits of single placings, winnings, breaking stride, and disqualifications were analyzed using generalized linear models with a binomial distribution. Estimates of heritability were greatest for racing time, which ranged from 0.32 to 0.34. Estimates of heritability were low for single earnings with all distributions, ranging from 0.01 to 0.09. Annual earnings were closer to normal distribution than single earnings. Heritability estimates were moderate for annual earnings on the fourth-root scale, 0.19 for Finnhorses and 0.27 for Standardbred trotters. Heritability estimates for binomial racing success variables ranged from 0.04 to 0.12, being greatest for winnings and least for breaking stride. Genetic correlations among racing traits were high, whereas phenotypic correlations were mainly low to moderate, except correlations between racing time and earnings were high. On the basis of a moderate heritability and moderate to high repeatability for racing time and annual earnings, selection of horses for these traits is effective when based on a few repeated records. Because of high genetic correlations, direct selection for racing time and annual earnings would also result in good genetic response in racing success
Linear spin-2 fields in most general backgrounds
Bernard, Laura; Deffayet, Cédric; Schmidt-May, Angnis; von Strauss, Mikael
2016-04-01
We derive the full perturbative equations of motion for the most general background solutions in ghost-free bimetric theory in its metric formulation. Clever field redefinitions at the level of fluctuations enable us to circumvent the problem of varying a square-root matrix appearing in the theory. This greatly simplifies the expressions for the linear variation of the bimetric interaction terms. We show that these field redefinitions exist and are uniquely invertible if and only if the variation of the square-root matrix itself has a unique solution, which is a requirement for the linearized theory to be well defined. As an application of our results we examine the constraint structure of ghost-free bimetric theory at the level of linear equations of motion for the first time. We identify a scalar combination of equations which is responsible for the absence of the Boulware-Deser ghost mode in the theory. The bimetric scalar constraint is in general not manifestly covariant in its nature. However, in the massive gravity limit the constraint assumes a covariant form when one of the interaction parameters is set to zero. For that case our analysis provides an alternative and almost trivial proof of the absence of the Boulware-Deser ghost. Our findings generalize previous results in the metric formulation of massive gravity and also agree with studies of its vielbein version.
Adaptive Linear Parameter Varying Control for Aeroservoelastic Suppression Project
National Aeronautics and Space Administration — Adaptive control offers an opportunity to fulfill present and future aircraft safety objectives though automated vehicle recovery while maintaining performance and...
Adaptive Linear Parameter Varying Control for Aeroservoelastic Suppression Project
National Aeronautics and Space Administration — Adaptive control offers an opportunity to fulfill aircraft safety objectives though automated vehicle recovery while maintaining performance and stability...
Speaker adaptation of HMMs using evolutionary strategy-based linear regression
Selouani, Sid-Ahmed; O'Shaughnessy, Douglas
2002-05-01
A new framework for speaker adaptation of continuous-density hidden Markov models (HMMs) is introduced. It aims to improve the robustness of speech recognizers by adapting HMM parameters to new conditions (e.g., from new speakers). It describes an optimization technique using an evolutionary strategy for linear regression-based spectral transformation. In classical iterative maximum likelihood linear regression (MLLR), a global transform matrix is estimated to make a general model better match particular target conditions. To permit adaptation on a small amount of data, a regression tree classification is performed. However, an important drawback of MLLR is that the number of regression classes is fixed. The new approach allows the degree of freedom of the global transform to be implicitly variable, as the evolutionary optimization permits the survival of only active classes. The fitness function is evaluated by the phoneme correctness through the evolution steps. The implementation requirements such as chromosome representation, selection function, genetic operators, and evaluation function have been chosen in order to lend more reliability to the global transformation matrix. Triphone experiments used the TIMIT and ARPA-RM1 databases. For new speakers, the new technique achieves 8 percent fewer word errors than the basic MLLR method.
Comparative Study of Algorithms for Automated Generalization of Linear Objects
Azimjon, S.; Gupta, P. K.; Sukhmani, R. S. G. S.
2014-11-01
Automated generalization, rooted from conventional cartography, has become an increasing concern in both geographic information system (GIS) and mapping fields. All geographic phenomenon and the processes are bound to the scale, as it is impossible for human being to observe the Earth and the processes in it without decreasing its scale. To get optimal results, cartographers and map-making agencies develop set of rules and constraints, however these rules are under consideration and topic for many researches up until recent days. Reducing map generating time and giving objectivity is possible by developing automated map generalization algorithms (McMaster and Shea, 1988). Modification of the scale traditionally is a manual process, which requires knowledge of the expert cartographer, and it depends on the experience of the user, which makes the process very subjective as every user may generate different map with same requirements. However, automating generalization based on the cartographic rules and constrains can give consistent result. Also, developing automated system for map generation is the demand of this rapid changing world. The research that we have conveyed considers only generalization of the roads, as it is one of the indispensable parts of a map. Dehradun city, Uttarakhand state of India was selected as a study area. The study carried out comparative study of the generalization software sets, operations and algorithms available currently, also considers advantages and drawbacks of the existing software used worldwide. Research concludes with the development of road network generalization tool and with the final generalized road map of the study area, which explores the use of open source python programming language and attempts to compare different road network generalization algorithms. Thus, the paper discusses the alternative solutions for automated generalization of linear objects using GIS-technologies. Research made on automated of road network
Parametrizing linear generalized Langevin dynamics from explicit molecular dynamics simulations
Fundamental understanding of complex dynamics in many-particle systems on the atomistic level is of utmost importance. Often the systems of interest are of macroscopic size but can be partitioned into a few important degrees of freedom which are treated most accurately and others which constitute a thermal bath. Particular attention in this respect attracts the linear generalized Langevin equation, which can be rigorously derived by means of a linear projection technique. Within this framework, a complicated interaction with the bath can be reduced to a single memory kernel. This memory kernel in turn is parametrized for a particular system studied, usually by means of time-domain methods based on explicit molecular dynamics data. Here, we discuss that this task is more naturally achieved in frequency domain and develop a Fourier-based parametrization method that outperforms its time-domain analogues. Very surprisingly, the widely used rigid bond method turns out to be inappropriate in general. Importantly, we show that the rigid bond approach leads to a systematic overestimation of relaxation times, unless the system under study consists of a harmonic bath bi-linearly coupled to the relevant degrees of freedom
Confidence Intervals of Variance Functions in Generalized Linear Model
Yong Zhou; Dao-ji Li
2006-01-01
In this paper we introduce an appealing nonparametric method for estimating variance and conditional variance functions in generalized linear models (GLMs), when designs are fixed points and random variables respectively. Bias-corrected confidence bands are proposed for the (conditional) variance by local linear smoothers. Nonparametric techniques are developed in deriving the bias-corrected confidence intervals of the (conditional) variance. The asymptotic distribution of the proposed estimator is established and show that the bias-corrected confidence bands asymptotically have the correct coverage properties. A small simulation is performed when unknown regression parameter is estimated by nonparametric quasi-likelihood. The results are also applicable to nonparametric autoregressive times series model with heteroscedastic conditional variance.
Adaptive Kronrod-Patterson integration of non-linear finite-element matrices
Janssen, Hans
2010-01-01
inappropriate discretization. In response, this article develops adaptive integration, based on nested Kronrod-Patterson-Gauss integration schemes: basically, the integration order is adapted to the locally observed grade of non-linearity. Adaptive integration is developed based on a standard infiltration...
Yulong Lei; Ke Liu; Yuanxia Zhang; Yao Fu; Hongbo Liu; Ge Lin; Hui Tang
2015-01-01
Recognizing various driving conditions in real time and adjusting control strategy accordingly in automatic transmission vehicles are important to improve their adaptability to the external environment. This study defines a generalized load concept which can comprehensively reflect driving condition information. The principle of a gearshift strategy based on generalized load is deduced theoretically, adopting linear interpolation between the shift lines on flat and on the largest gradient roa...
On unipotent Specht modules of finite general linear groups
Brandt, Marco
2004-01-01
Many outstanding problems in representation theory can be solved with a proper understanding of the irreducible unipotent modules for the finite general linear group GL_n(q). For each partition lambda of n there is a Specht module S^lambda for GL_n(q), defined over a field F in terms of the intersection of the kernels of certain homomorphisms. If F is a field of characteristic zero, then S^lambda is irreducible and {S^lambda | lambda is a partition of n} is a complete set of pairwise non-...
A Graphical User Interface to Generalized Linear Models in MATLAB
Peter Dunn
1999-07-01
Full Text Available Generalized linear models unite a wide variety of statistical models in a common theoretical framework. This paper discusses GLMLAB-software that enables such models to be fitted in the popular mathematical package MATLAB. It provides a graphical user interface to the powerful MATLAB computational engine to produce a program that is easy to use but with many features, including offsets, prior weights and user-defined distributions and link functions. MATLAB's graphical capacities are also utilized in providing a number of simple residual diagnostic plots.
Patilea, Valentin; Raïssi, Hamdi
2010-01-01
Linear Vector AutoRegressive (VAR) models where the innovations could be unconditionally heteroscedastic and serially dependent are considered. The volatility structure is deterministic and quite general, including breaks or trending variances as special cases. In this framework we propose Ordinary Least Squares (OLS), Generalized Least Squares (GLS) and Adaptive Least Squares (ALS) procedures. The GLS estimator requires the knowledge of the time-varying variance structure while in the ALS ap...
Adaptive Non-linear Control of Hydraulic Actuator Systems
Hansen, Poul Erik; Conrad, Finn
1998-01-01
Presentation of two new developed adaptive non-liner controllers for hydraulic actuator systems to give stable operation and improved performance.Results from the IMCIA project supported by the Danish Technical Research Council (STVF).......Presentation of two new developed adaptive non-liner controllers for hydraulic actuator systems to give stable operation and improved performance.Results from the IMCIA project supported by the Danish Technical Research Council (STVF)....
Adaptive Non-linear Control of Hydraulic Actuator Systems
Hansen, Poul Erik; Conrad, Finn
Presentation of two new developed adaptive non-liner controllers for hydraulic actuator systems to give stable operation and improved performance.Results from the IMCIA project supported by the Danish Technical Research Council (STVF).......Presentation of two new developed adaptive non-liner controllers for hydraulic actuator systems to give stable operation and improved performance.Results from the IMCIA project supported by the Danish Technical Research Council (STVF)....
Extracting HI cosmological signal with Generalized Needlet Internal Linear Combination
Olivari, L C; Dickinson, C
2015-01-01
HI intensity mapping is a new observational technique to map fluctuations in the large-scale structure of matter using the 21 cm emission line of atomic hydrogen (HI). Sensitive radio surveys have the potential to detect Baryon Acoustic Oscillations (BAO) at low redshifts (z < 1) in order to constrain the properties of dark energy. Observations of the HI signal will be contaminated by instrumental noise and, more significantly, by astrophysical foregrounds, such as Galactic synchrotron emission, which is at least four orders of magnitude brighter than the HI signal. Foreground cleaning is recognised as one of the key challenges for future radio astronomy surveys. We study the ability of the Generalized Needlet Internal Linear Combination (GNILC) method to subtract radio foregrounds and to recover the cosmological HI signal for a general HI intensity mapping experiment. The GNILC method is a new technique that uses both frequency and spatial information to separate the components of the observed data. Our r...
Linear spin-2 fields in most general backgrounds
Bernard, Laura; Schmidt-May, Angnis; von Strauss, Mikael
2015-01-01
We derive the full perturbative equations of motion for the most general background solutions in ghost-free bimetric theory in its metric formulation. Clever field redefinitions at the level of fluctuations enable us to circumvent the problem of varying a square-root matrix appearing in the theory. This greatly simplifies the expressions for the linear variation of the bimetric interaction terms. We show that these field redefinitions exist and are uniquely invertible if and only if the variation of the square-root matrix itself has a unique solution, which is a requirement for the linearised theory to be well-defined. As an application of our results we examine the constraint structure of ghost-free bimetric theory at the level of linear equations of motion for the first time. We identify a scalar combination of equations which is responsible for the absence of the Boulware-Deser ghost mode in the theory. The bimetric scalar constraint is in general not manifestly covariant in its nature. However, in the mas...
Kesavan.E; Rakesh kumar.S
2013-01-01
This paper suggests an idea to design an adaptive PID controller for Non-linear liquid tank System and is implemented in PLC. Online estimation of linear parameters (Time constant and Gain) brings an exact model of the process to take perfect control action. Based on these estimated values, the controller parameters will be well tuned by internal model control. Internal model control is an unremarkably used technique and provides well tuned controller in order to have a good controlling proce...
An adaptive fuzzy sliding mode strategy is developed for the generalized projective synchronization of a fractional-order chaotic system, where the slave system is not necessarily known in advance. Based on the designed adaptive update laws and the linear feedback method, the adaptive fuzzy sliding controllers are proposed via the fuzzy design, and the strength of the designed controllers can be adaptively adjusted according to the external disturbances. Based on the Lyapunov stability theorem, the stability and the robustness of the controlled system are proved theoretically. Numerical simulations further support the theoretical results of the paper and demonstrate the efficiency of the proposed method. Moreover, it is revealed that the proposed method allows us to manipulate arbitrarily the response dynamics of the slave system by adjusting the desired scaling factor λi and the desired translating factor ηi, which may be used in a channel-independent chaotic secure communication. (general)
Bounded Linear Stability Analysis - A Time Delay Margin Estimation Approach for Adaptive Control
Nguyen, Nhan T.; Ishihara, Abraham K.; Krishnakumar, Kalmanje Srinlvas; Bakhtiari-Nejad, Maryam
2009-01-01
This paper presents a method for estimating time delay margin for model-reference adaptive control of systems with almost linear structured uncertainty. The bounded linear stability analysis method seeks to represent the conventional model-reference adaptive law by a locally bounded linear approximation within a small time window using the comparison lemma. The locally bounded linear approximation of the combined adaptive system is cast in a form of an input-time-delay differential equation over a small time window. The time delay margin of this system represents a local stability measure and is computed analytically by a matrix measure method, which provides a simple analytical technique for estimating an upper bound of time delay margin. Based on simulation results for a scalar model-reference adaptive control system, both the bounded linear stability method and the matrix measure method are seen to provide a reasonably accurate and yet not too conservative time delay margin estimation.
Synchronization of general complex networks via adaptive control schemes
Ping He; Chun-Guo Jing; Chang-Zhong Chen; Tao Fan; Hassan Saberi Nik
2014-03-01
In this paper, the synchronization problem of general complex networks is investigated by using adaptive control schemes. Time-delay coupling, derivative coupling, nonlinear coupling etc. exist universally in real-world complex networks. The adaptive synchronization scheme is designed for the complex network with multiple class of coupling terms. A criterion guaranteeing synchronization of such complex networks is established by employing the Lyapunov stability theorem and adaptive control schemes. Finally, an illustrative example with numerical simulation is given to show the feasibility and efficiency of theoretical results.
Bayesian Subset Modeling for High-Dimensional Generalized Linear Models
Liang, Faming
2013-06-01
This article presents a new prior setting for high-dimensional generalized linear models, which leads to a Bayesian subset regression (BSR) with the maximum a posteriori model approximately equivalent to the minimum extended Bayesian information criterion model. The consistency of the resulting posterior is established under mild conditions. Further, a variable screening procedure is proposed based on the marginal inclusion probability, which shares the same properties of sure screening and consistency with the existing sure independence screening (SIS) and iterative sure independence screening (ISIS) procedures. However, since the proposed procedure makes use of joint information from all predictors, it generally outperforms SIS and ISIS in real applications. This article also makes extensive comparisons of BSR with the popular penalized likelihood methods, including Lasso, elastic net, SIS, and ISIS. The numerical results indicate that BSR can generally outperform the penalized likelihood methods. The models selected by BSR tend to be sparser and, more importantly, of higher prediction ability. In addition, the performance of the penalized likelihood methods tends to deteriorate as the number of predictors increases, while this is not significant for BSR. Supplementary materials for this article are available online. © 2013 American Statistical Association.
Optimization in generalized linear models: A case study
Silva, Eliana Costa e.; Correia, Aldina; Lopes, Isabel Cristina
2016-06-01
The maximum likelihood method is usually chosen to estimate the regression parameters of Generalized Linear Models (GLM) and also for hypothesis testing and goodness of fit tests. The classical method for estimating GLM parameters is the Fisher scores. In this work we propose to compute the estimates of the parameters with two alternative methods: a derivative-based optimization method, namely the BFGS method which is one of the most popular of the quasi-Newton algorithms, and the PSwarm derivative-free optimization method that combines features of a pattern search optimization method with a global Particle Swarm scheme. As a case study we use a dataset of biological parameters (phytoplankton) and chemical and environmental parameters of the water column of a Portuguese reservoir. The results show that, for this dataset, BFGS and PSwarm methods provided a better fit, than Fisher scores method, and can be good alternatives for finding the estimates for the parameters of a GLM.
Explicit estimating equations for semiparametric generalized linear latent variable models
Ma, Yanyuan
2010-07-05
We study generalized linear latent variable models without requiring a distributional assumption of the latent variables. Using a geometric approach, we derive consistent semiparametric estimators. We demonstrate that these models have a property which is similar to that of a sufficient complete statistic, which enables us to simplify the estimating procedure and explicitly to formulate the semiparametric estimating equations. We further show that the explicit estimators have the usual root n consistency and asymptotic normality. We explain the computational implementation of our method and illustrate the numerical performance of the estimators in finite sample situations via extensive simulation studies. The advantage of our estimators over the existing likelihood approach is also shown via numerical comparison. We employ the method to analyse a real data example from economics. © 2010 Royal Statistical Society.
dglars: An R Package to Estimate Sparse Generalized Linear Models
Luigi Augugliaro
2014-09-01
Full Text Available dglars is a publicly available R package that implements the method proposed in Augugliaro, Mineo, and Wit (2013, developed to study the sparse structure of a generalized linear model. This method, called dgLARS, is based on a differential geometrical extension of the least angle regression method proposed in Efron, Hastie, Johnstone, and Tibshirani (2004. The core of the dglars package consists of two algorithms implemented in Fortran 90 to efficiently compute the solution curve: a predictor-corrector algorithm, proposed in Augugliaro et al. (2013, and a cyclic coordinate descent algorithm, proposed in Augugliaro, Mineo, and Wit (2012. The latter algorithm, as shown here, is significantly faster than the predictor-corrector algorithm. For comparison purposes, we have implemented both algorithms.
Holst, René; Jørgensen, Bent
2015-01-01
The paper proposes a versatile class of multiplicative generalized linear longitudinal mixed models (GLLMM) with additive dispersion components, based on explicit modelling of the covariance structure. The class incorporates a longitudinal structure into the random effects models and retains a ma...... multidimensional integral of the conventional GLMM likelihood and allows an extension of the robust empirical sandwich estimator for use with both association and regression parameters. The method is applied to a set of otholit data, used for age determination of fish.......The paper proposes a versatile class of multiplicative generalized linear longitudinal mixed models (GLLMM) with additive dispersion components, based on explicit modelling of the covariance structure. The class incorporates a longitudinal structure into the random effects models and retains a...... marginal as well as a conditional interpretation. The estimation procedure is based on a computationally efficient quasi-score method for the regression parameters combined with a REML-like bias-corrected Pearson estimating function for the dispersion and correlation parameters. This avoids the...
Adaptive Generation and Diagnostics of Linear Few-Cycle Light Bullets
Martin Bock
2013-02-01
Full Text Available Recently we introduced the class of highly localized wavepackets (HLWs as a generalization of optical Bessel-like needle beams. Here we report on the progress in this field. In contrast to pulsed Bessel beams and Airy beams, ultrashort-pulsed HLWs propagate with high stability in both spatial and temporal domain, are nearly paraxial (supercollimated, have fringe-less spatial profiles and thus represent the best possible approximation to linear “light bullets”. Like Bessel beams and Airy beams, HLWs show self-reconstructing behavior. Adaptive HLWs can be shaped by ultraflat three-dimensional phase profiles (generalized axicons which are programmed via calibrated grayscale maps of liquid-crystal-on-silicon spatial light modulators (LCoS-SLMs. Light bullets of even higher complexity can either be freely formed from quasi-continuous phase maps or discretely composed from addressable arrays of identical nondiffracting beams. The characterization of few-cycle light bullets requires spatially resolved measuring techniques. In our experiments, wavefront, pulse and phase were detected with a Shack-Hartmann wavefront sensor, 2D-autocorrelation and spectral phase interferometry for direct electric-field reconstruction (SPIDER. The combination of the unique propagation properties of light bullets with the flexibility of adaptive optics opens new prospects for applications of structured light like optical tweezers, microscopy, data transfer and storage, laser fusion, plasmon control or nonlinear spectroscopy.
Dyja, Robert; van der Zee, Kristoffer G
2016-01-01
We present an adaptive methodology for the solution of (linear and) non-linear time dependent problems that is especially tailored for massively parallel computations. The basic concept is to solve for large blocks of space-time unknowns instead of marching sequentially in time. The methodology is a combination of a computationally efficient implementation of a parallel-in-space-time finite element solver coupled with a posteriori space-time error estimates and a parallel mesh generator. This methodology enables, in principle, simultaneous adaptivity in both space and time (within the block) domains. We explore this basic concept in the context of a variety of time-steppers including $\\Theta$-schemes and Backward Differentiate Formulas. We specifically illustrate this framework with applications involving time dependent linear, quasi-linear and semi-linear diffusion equations. We focus on investigating how the coupled space-time refinement indicators for this class of problems affect spatial adaptivity. Final...
Non-linear and adaptive control of a refrigeration system
Rasmussen, Henrik; Larsen, Lars F. S.
2011-01-01
capacities ensures a high energy efficiency. The level of liquid filling is indirectly measured by the superheat. Introduction of variable speed compressors and electronic expansion valves enables the use of more sophisticated control algorithms, giving a higher degree of performance and just as important...... and used in a backstepping design of a nonlinear adaptive controller. The stability of the proposed method is validated theoretically by Lyapunov analysis and experimental results show the performance of the system for a wide range of operating points. The method is compared to a conventional method based...
Generalized projective synchronization of chaotic systems via adaptive learning control
In this paper, a learning control approach is applied to the generalized projective synchronisation (GPS) of different chaotic systems with unknown periodically time-varying parameters. Using the Lyapunov–Krasovskii functional stability theory, a differential-difference mixed parametric learning law and an adaptive learning control law are constructed to make the states of two different chaotic systems asymptotically synchronised. The scheme is successfully applied to the generalized projective synchronisation between the Lorenz system and Chen system. Moreover, numerical simulations results are used to verify the effectiveness of the proposed scheme. (general)
Lee, Chang-Hun; Seo, Min-Guk; Tahk, Min-Jea; Lee, Jin-Ik; Jun, Byung-Eul
2012-01-01
A straight forward application of feedback linearization to the missile autopilot design for acceleration control may be limited due to the nonminimum characteristics and the model uncertainties. As a remedy, this paper presents a cascade structure of an acceleration controller based on approximate feedback linearization methodology with a time-delay adaptation scheme. The inner loop controller is constructed by applying feedback linearization to the approximate system which is a minimum phas...
Multivariate statistical modelling based on generalized linear models
Fahrmeir, Ludwig
1994-01-01
This book is concerned with the use of generalized linear models for univariate and multivariate regression analysis. Its emphasis is to provide a detailed introductory survey of the subject based on the analysis of real data drawn from a variety of subjects including the biological sciences, economics, and the social sciences. Where possible, technical details and proofs are deferred to an appendix in order to provide an accessible account for non-experts. Topics covered include: models for multi-categorical responses, model checking, time series and longitudinal data, random effects models, and state-space models. Throughout, the authors have taken great pains to discuss the underlying theoretical ideas in ways that relate well to the data at hand. As a result, numerous researchers whose work relies on the use of these models will find this an invaluable account to have on their desks. "The basic aim of the authors is to bring together and review a large part of recent advances in statistical modelling of m...
Generalized Functional Linear Models With Semiparametric Single-Index Interactions
Li, Yehua
2010-06-01
We introduce a new class of functional generalized linear models, where the response is a scalar and some of the covariates are functional. We assume that the response depends on multiple covariates, a finite number of latent features in the functional predictor, and interaction between the two. To achieve parsimony, the interaction between the multiple covariates and the functional predictor is modeled semiparametrically with a single-index structure. We propose a two step estimation procedure based on local estimating equations, and investigate two situations: (a) when the basis functions are pre-determined, e.g., Fourier or wavelet basis functions and the functional features of interest are known; and (b) when the basis functions are data driven, such as with functional principal components. Asymptotic properties are developed. Notably, we show that when the functional features are data driven, the parameter estimates have an increased asymptotic variance, due to the estimation error of the basis functions. Our methods are illustrated with a simulation study and applied to an empirical data set, where a previously unknown interaction is detected. Technical proofs of our theoretical results are provided in the online supplemental materials.
Adaptive Input-Output Linearization Technique for Robust Speed Control of Brush less DC Motor
Kim, Kyeong Hwa; Baik, In Cheol; Kim, Hyun Soo; Youn, Myung Joong [Korea Advance Institute of Science and Technology, Taejon (Korea, Republic of)
1997-06-01
An adaptive input-output linearization technique for a robust speed control of a brush less DC (BLDC) motor is presented. By using this technique, the nonlinear motor model can be effectively linearized in Brunovski canonical form, and the desired speed dynamics can be obtained based on the linearized model. This control technique, however, gives an undesirable output performance under the mismatch of the system parameters and load conditions caused by the incomplete linearization. For the robust output response, the controller parameters will be estimated by a model reference adaptive technique where the disturbance torque and flux linkage are estimated. The adaptation laws are derived by the Popov`s hyper stability theory and positivity concept. The proposed control scheme is implemented on a BLDC motor using the software of DSP TMS320C30 and the effectiveness is verified through the comparative simulations and experiments. (author). 14 refs., 12 figs., 1 tab.
Generalization in adaptation to stable and unstable dynamics.
Abdelhamid Kadiallah
Full Text Available Humans skillfully manipulate objects and tools despite the inherent instability. In order to succeed at these tasks, the sensorimotor control system must build an internal representation of both the force and mechanical impedance. As it is not practical to either learn or store motor commands for every possible future action, the sensorimotor control system generalizes a control strategy for a range of movements based on learning performed over a set of movements. Here, we introduce a computational model for this learning and generalization, which specifies how to learn feedforward muscle activity in a function of the state space. Specifically, by incorporating co-activation as a function of error into the feedback command, we are able to derive an algorithm from a gradient descent minimization of motion error and effort, subject to maintaining a stability margin. This algorithm can be used to learn to coordinate any of a variety of motor primitives such as force fields, muscle synergies, physical models or artificial neural networks. This model for human learning and generalization is able to adapt to both stable and unstable dynamics, and provides a controller for generating efficient adaptive motor behavior in robots. Simulation results exhibit predictions consistent with all experiments on learning of novel dynamics requiring adaptation of force and impedance, and enable us to re-examine some of the previous interpretations of experiments on generalization.
Domingues M. O.
2013-12-01
Full Text Available We present a new adaptive multiresoltion method for the numerical simulation of ideal magnetohydrodynamics. The governing equations, i.e., the compressible Euler equations coupled with the Maxwell equations are discretized using a finite volume scheme on a two-dimensional Cartesian mesh. Adaptivity in space is obtained via Harten’s cell average multiresolution analysis, which allows the reliable introduction of a locally refined mesh while controlling the error. The explicit time discretization uses a compact Runge–Kutta method for local time stepping and an embedded Runge-Kutta scheme for automatic time step control. An extended generalized Lagrangian multiplier approach with the mixed hyperbolic-parabolic correction type is used to control the incompressibility of the magnetic field. Applications to a two-dimensional problem illustrate the properties of the method. Memory savings and numerical divergences of magnetic field are reported and the accuracy of the adaptive computations is assessed by comparing with the available exact solution.
Complex Environmental Data Modelling Using Adaptive General Regression Neural Networks
Kanevski, Mikhail
2015-04-01
The research deals with an adaptation and application of Adaptive General Regression Neural Networks (GRNN) to high dimensional environmental data. GRNN [1,2,3] are efficient modelling tools both for spatial and temporal data and are based on nonparametric kernel methods closely related to classical Nadaraya-Watson estimator. Adaptive GRNN, using anisotropic kernels, can be also applied for features selection tasks when working with high dimensional data [1,3]. In the present research Adaptive GRNN are used to study geospatial data predictability and relevant feature selection using both simulated and real data case studies. The original raw data were either three dimensional monthly precipitation data or monthly wind speeds embedded into 13 dimensional space constructed by geographical coordinates and geo-features calculated from digital elevation model. GRNN were applied in two different ways: 1) adaptive GRNN with the resulting list of features ordered according to their relevancy; and 2) adaptive GRNN applied to evaluate all possible models N [in case of wind fields N=(2^13 -1)=8191] and rank them according to the cross-validation error. In both cases training were carried out applying leave-one-out procedure. An important result of the study is that the set of the most relevant features depends on the month (strong seasonal effect) and year. The predictabilities of precipitation and wind field patterns, estimated using the cross-validation and testing errors of raw and shuffled data, were studied in detail. The results of both approaches were qualitatively and quantitatively compared. In conclusion, Adaptive GRNN with their ability to select features and efficient modelling of complex high dimensional data can be widely used in automatic/on-line mapping and as an integrated part of environmental decision support systems. 1. Kanevski M., Pozdnoukhov A., Timonin V. Machine Learning for Spatial Environmental Data. Theory, applications and software. EPFL Press
Adaptive fault-tolerant control of linear systems with actuator saturation and L2-disturbances
Wei GUAN; Guanghong YANG
2009-01-01
This paper studies the problem of designing adaptive fault-tolerant H-infinity controllers for linear timeinvariant systems with actuator saturation. The disturbance tolerance ability of the closed-loop system is measured by an optimal index. The notion of an adaptive H-infinity performance index is proposed to describe the disturbance attenuation performances of closed-loop systems. New methods for designing indirect adaptive fault-tolerant controllers via state feedback are presented for actuator fault compensations. Based on the on-line estimation of eventual faults, the adaptive fault-tolerant controller parameters are updated automatically to compensate for the fault effects on systems. The designs are developed in the framework of the linear matrix inequality (LMI) approach, which can guarantee the disturbance tolerance ability and adaptive H-infinity performances of closed-loop systems in the cases of actuator saturation and actuator failures. An example is given to illustrate the efficiency of the design method.
Serial and parallel dynamic adaptation of general hybrid meshes
Kavouklis, Christos
The Navier-Stokes equations are a standard mathematical representation of viscous fluid flow. Their numerical solution in three dimensions remains a computationally intensive and challenging task, despite recent advances in computer speed and memory. A strategy to increase accuracy of Navier-Stokes simulations, while maintaining computing resources to a minimum, is local refinement of the associated computational mesh in regions of large solution gradients and coarsening in regions where the solution does not vary appreciably. In this work we consider adaptation of general hybrid meshes for Computational Fluid Dynamics (CFD) applications. Hybrid meshes are composed of four types of elements; hexahedra, prisms, pyramids and tetrahedra, and have been proven a promising technology in accurately resolving fluid flow for complex geometries. The first part of this dissertation is concerned with the design and implementation of a serial scheme for the adaptation of general three dimensional hybrid meshes. We have defined 29 refinement types, for all four kinds of elements. The core of the present adaptation scheme is an iterative algorithm that flags mesh edges for refinement, so that the adapted mesh is conformal. Of primary importance is considered the design of a suitable dynamic data structure that facilitates refinement and coarsening operations and furthermore minimizes memory requirements. A special dynamic list is defined for mesh elements, in contrast with the usual tree structures. It contains only elements of the current adaptation step and minimal information that is utilized to reconstruct parent elements when the mesh is coarsened. In the second part of this work, a new parallel dynamic mesh adaptation and load balancing algorithm for general hybrid meshes is presented. Partitioning of a hybrid mesh reduces to partitioning of the corresponding dual graph. Communication among processors is based on the faces of the interpartition boundary. The distributed
丛玉豪
2001-01-01
The stability analysis of linear multistep methods for the numerical solutions of the systems of generalized neutral delay differential equations is discussed. The stability behaviour of linear multistep methods was analysed for the solution of the generalized system of linear neutral test equations. After the establishment of a sufficient condition for asymptotic stability of the solutions of the generalized system, it is shown that a linear multistep method is NGPG-stable if and only if it is A-stable.
Cavity characterization for general use in linear electron accelerators
The main objective of this work is to is to develop measurement techniques for the characterization of microwave cavities used in linear electron accelerators. Methods are developed for the measurement of parameters that are essential to the design of an accelerator structure using conventional techniques of resonant cavities at low power. Disk-loaded cavities were designed and built, similar to those in most existing linear electron accelerators. As a result, the methods developed and the estimated accuracy were compared with those from other investigators. The results of this work are relevant for the design of cavities with the objective of developing linear electron accelerators. (author)
General Thoughts about Tracking for a Linear Collider Detector
Schumm, Bruce A.
2005-01-01
Basic scaling laws are used to compare the relative capabilities of gaseous and solid-state tracking. Conclusions are drawn in the context of physics processes expected to be at the focus of studies at the International Linear Collider.
Multiscale adaptive generalized estimating equations for longitudinal neuroimaging data.
Li, Yimei; Gilmore, John H; Shen, Dinggang; Styner, Martin; Lin, Weili; Zhu, Hongtu
2013-05-15
Many large-scale longitudinal imaging studies have been or are being widely conducted to better understand the progress of neuropsychiatric and neurodegenerative disorders and normal brain development. The goal of this article is to develop a multiscale adaptive generalized estimation equation (MAGEE) method for spatial and adaptive analysis of neuroimaging data from longitudinal studies. MAGEE is applicable to making statistical inference on regression coefficients in both balanced and unbalanced longitudinal designs and even in twin and familial studies, whereas standard software platforms have several major limitations in handling these complex studies. Specifically, conventional voxel-based analyses in these software platforms involve Gaussian smoothing imaging data and then independently fitting a statistical model at each voxel. However, the conventional smoothing methods suffer from the lack of spatial adaptivity to the shape and spatial extent of region of interest and the arbitrary choice of smoothing extent, while independently fitting statistical models across voxels does not account for the spatial properties of imaging observations and noise distribution. To address such drawbacks, we adapt a powerful propagation-separation (PS) procedure to sequentially incorporate the neighboring information of each voxel and develop a new novel strategy to solely update a set of parameters of interest, while fixing other nuisance parameters at their initial estimators. Simulation studies and real data analysis show that MAGEE significantly outperforms voxel-based analysis. PMID:23357075
GENERALIZED RICCATI TRANSFORMATION AND OSCILLATION FOR LINEAR DIFFERENTIAL EQUATIONS WITH DAMPING
ZhengZhaowen; LiuJingzhao
2005-01-01
Using generalized Riccati transformation, some new oscillation criteria for damped linear differential equations are established. These results improve and generalize some known oscillation criteria due to A.Wintner [8], I.V.Kamenev [10] for the undamped linear differential equations, and Sobol [3], J.S.W.Wong [1] for the damped linear differential equations.
Testing linear forms of variance components by generalized fixed-level tests
Weimann, Boris
1998-01-01
This report extends the technique of testing single variance components with generalized fixed-level tests - in situations when nuisance parameters make exact testing impossible - to the more general way of testing hypotheses on linear forms of variance components. An extension of the definition of a generalized test variable leads to a generalized fixed-level test for arbitrary linear hypotheses on variance components in balanced mixed linear models of the ANOVA-type. For point null hypothes...
Mjalli, F. S.
2006-01-01
Nonlinearity of the extraction process is addressed via the application of instantaneous linearization to control the extract and raffinate concentrations. Two feed-forward neural networks with delayed inputs and outputs were trained and validated to capture the dynamics of the extraction process. These nonlinear models were then adopted in an instantaneous linearization algorithm into two control algorithms. The self-tuning adaptive control strategy was compared to an approximate model predi...
Intelligent control of non-linear dynamical system based on the adaptive neurocontroller
Engel, E.; Kovalev, I. V.; Kobezhicov, V.
2015-10-01
This paper presents an adaptive neuro-controller for intelligent control of non-linear dynamical system. The formed as the fuzzy selective neural net the adaptive neuro-controller on the base of system's state, creates the effective control signal under random perturbations. The validity and advantages of the proposed adaptive neuro-controller are demonstrated by numerical simulations. The simulation results show that the proposed controller scheme achieves real-time control speed and the competitive performance, as compared to PID, fuzzy logic controllers.
STAR adaptation of QR algorithm. [program for solving over-determined systems of linear equations
Shah, S. N.
1981-01-01
The QR algorithm used on a serial computer and executed on the Control Data Corporation 6000 Computer was adapted to execute efficiently on the Control Data STAR-100 computer. How the scalar program was adapted for the STAR-100 and why these adaptations yielded an efficient STAR program is described. Program listings of the old scalar version and the vectorized SL/1 version are presented in the appendices. Execution times for the two versions applied to the same system of linear equations, are compared.
Nguyen, Nhan
2013-01-01
This paper presents the optimal control modification for linear uncertain plants. The Lyapunov analysis shows that the modification parameter has a limiting value depending on the nature of the uncertainty. The optimal control modification exhibits a linear asymptotic property that enables it to be analyzed in a linear time invariant framework for linear uncertain plants. The linear asymptotic property shows that the closed-loop plants in the limit possess a scaled input-output mapping. Using this property, we can derive an analytical closed-loop transfer function in the limit as the adaptive gain tends to infinity. The paper revisits the Rohrs counterexample problem that illustrates the nature of non-robustness of model-reference adaptive control in the presence of unmodeled dynamics. An analytical approach is developed to compute exactly the modification parameter for the optimal control modification that stabilizes the plant in the Rohrs counterexample. The linear asymptotic property is also used to address output feedback adaptive control for non-minimum phase plants with a relative degree 1.
Decentralized adaptive generalized predictive control for structural vibration
LU Minyue; GU Zhongquan
2005-01-01
A decentralized generalized predictive control (GPC) algorithm is developed for strongly coupled multi-input multi-output systems with parallel computation. The algorithm is applied to adaptive control of structural vibration. The key steps in this algorithm are to group the actuators and the sensors and then to pair these groups into subsystems. It is important that the on-line identification and the control law design can be a parallel process for all these subsystems. It avoids the high computation cost in ordinary predictive control,and is of great advantage especially for large-scale systems.
Non-linear sigma models with generalized geometry
In this paper it is shown that the bosonic non-linear sigma model with algebraically extended world-sheet geometry is locally equivalent to the usual theory, but differs from the latter globally in that world-sheet instantons do not destabilize axions and in that it has a different critical dimension
Alternating prism exposure causes dual adaptation and generalization to a novel displacement
Welch, Robert B.; Bridgeman, Bruce; Anand, Sulekha; Browman, Kaitlin E.
1993-01-01
In two experiments, we examined the hypothesis that repeatedly adapting and readapting to two mutually conflicting sensory environments fosters the development of a separate adaptation to each situation (dual adaptation) as well as an increased ability to adapt to a novel displacement (adaptive generalization). In the preliminary study, subjects alternated between adapting their visuomotor coordination to 30-diopter prismatic displacement and readapting to normal vision. Dual adaptation was observed by the end of 10 alternation cycles. However, an unconfounded test of adaptive generalization was prevented by an unexpected prism-adaptive shift in preexposure baselines for the dual-adapted subjects. In the primary experiment, the subjects adapted and readapted to opposite 15-diopter displacements for a total of 12 cycles. Both dual adaptation and adaptive generalization to a 30-diopter displacement were obtained. These findings may be understood in terms of serial reversal learning and 'learning to learn'.
Adaptive neural network error control for generalized perturbation theory
This paper addresses the issue of adaptive error control within generalized perturbation theory (GPT). The strategy herein assessed considers an artificial neural network (ANN) error estimator. The underlying tool facilitating this research is the FORMOSA-P code, a pressurized water reactor (PWR) nuclear fuel management optimization package, which combines simulated annealing and nodal GPT. A number of applications exist where traditional GPT may be limited by the magnitude of perturbations, which it can accurately handle. In fact, other alternative such as supervariational techniques (i.e., n'th-order GPT) and/or multireference strategies (i.e., rodded adjoints) are being sought for boiling water reactor and rodded applications. A perhaps not-so-obvious alternative could be to employ a neural network for adaptive error control within GPT. This study presents the results of two ANN models. The first model constitutes an intensively well-trained ANN used to contrast its global core parameter (i.e., keff) prediction capability versus that of a GPT model. The second model is a similar ANN intended for adaptive GPT error correction. In other words, the latter ANN is trained on-the-fly within the scope of a standard FORMOSA-P calculation
Parallel adaptation of general three-dimensional hybrid meshes
A new parallel dynamic mesh adaptation and load balancing algorithm for general hybrid grids has been developed. The meshes considered in this work are composed of four kinds of elements; tetrahedra, prisms, hexahedra and pyramids, which poses a challenge to parallel mesh adaptation. Additional complexity imposed by the presence of multiple types of elements affects especially data migration, updates of local data structures and interpartition data structures. Efficient partition of hybrid meshes has been accomplished by transforming them to suitable graphs and using serial graph partitioning algorithms. Communication among processors is based on the faces of the interpartition boundary and the termination detection algorithm of Dijkstra is employed to ensure proper flagging of edges for refinement. An inexpensive dynamic load balancing strategy is introduced to redistribute work load among processors after adaptation. In particular, only the initial coarse mesh, with proper weighting, is balanced which yields savings in computation time and relatively simple implementation of mesh quality preservation rules, while facilitating coarsening of refined elements. Special algorithms are employed for (i) data migration and dynamic updates of the local data structures, (ii) determination of the resulting interpartition boundary and (iii) identification of the communication pattern of processors. Several representative applications are included to evaluate the method.
Parallel adaptation of general three-dimensional hybrid meshes
Kavouklis, Christos; Kallinderis, Yannis
2010-05-01
A new parallel dynamic mesh adaptation and load balancing algorithm for general hybrid grids has been developed. The meshes considered in this work are composed of four kinds of elements; tetrahedra, prisms, hexahedra and pyramids, which poses a challenge to parallel mesh adaptation. Additional complexity imposed by the presence of multiple types of elements affects especially data migration, updates of local data structures and interpartition data structures. Efficient partition of hybrid meshes has been accomplished by transforming them to suitable graphs and using serial graph partitioning algorithms. Communication among processors is based on the faces of the interpartition boundary and the termination detection algorithm of Dijkstra is employed to ensure proper flagging of edges for refinement. An inexpensive dynamic load balancing strategy is introduced to redistribute work load among processors after adaptation. In particular, only the initial coarse mesh, with proper weighting, is balanced which yields savings in computation time and relatively simple implementation of mesh quality preservation rules, while facilitating coarsening of refined elements. Special algorithms are employed for (i) data migration and dynamic updates of the local data structures, (ii) determination of the resulting interpartition boundary and (iii) identification of the communication pattern of processors. Several representative applications are included to evaluate the method.
Dark energy cosmology with generalized linear equation of state
Dark energy with the usually used equation of state p = wρ, where w const 0), where the constants α and ρ0 are free parameters. This non-homogeneous linear equation of state provides the description of both hydrodynamically stable (α > 0) and unstable (α < 0) fluids. In particular, the considered cosmological model describes the hydrodynamically stable dark (and phantom) energy. The possible types of cosmological scenarios in this model are determined and classified in terms of attractors and unstable points by using phase trajectories analysis. For the dark energy case, some distinctive types of cosmological scenarios are possible: (i) the universe with the de Sitter attractor at late times, (ii) the bouncing universe, (iii) the universe with the big rip and with the anti-big rip. In the framework of a linear equation of state the universe filled with a phantom energy, w < -1, may have either the de Sitter attractor or the big rip
Inference of High-dimensional Autoregressive Generalized Linear Models
Hall, Eric C.; Raskutti, Garvesh; Willett, Rebecca
2016-01-01
Vector autoregressive models characterize a variety of time series in which linear combinations of current and past observations can be used to accurately predict future observations. For instance, each element of an observation vector could correspond to a different node in a network, and the parameters of an autoregressive model would correspond to the impact of the network structure on the time series evolution. Often these models are used successfully in practice to learn the structure of...
The Complexity of Generalized Satisfiability for Linear Temporal Logic
Bauland, Michael; Schneider, Thomas; Schnoor, Henning; Schnoor, Ilka; Vollmer, Heribert
2008-01-01
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set of propositional operators is restricted, the complexity may decrease. This paper undertakes a systematic study of satisfiability for LTL formulae over restricted sets of propositional and temporal operators. Since every propositional operator corresponds to a Boolean funct...
Generalized inner bending continua for linear fiber reinforced materials
Boutin, Claude; Soubestre, Jean
2011-01-01
This paper deals with the effective behaviour of elastic materials periodically reinforced by linear slender elastic inclusions. Assuming a small scale ratio ε between the cell size and the characteristic size of the macroscopic deformation, the macro-behaviour at the leading order is derived by the homogenization method of periodic media. Different orders of magnitude of the contrast between the shear modulus of the material μm and of the reinforcement μp are considered. A contrast μm/μp of ...
Generalized linear mixed models modern concepts, methods and applications
Stroup, Walter W
2012-01-01
PART I The Big PictureModeling BasicsWhat Is a Model?Two Model Forms: Model Equation and Probability DistributionTypes of Model EffectsWriting Models in Matrix FormSummary: Essential Elements for a Complete Statement of the ModelDesign MattersIntroductory Ideas for Translating Design and Objectives into ModelsDescribing ""Data Architecture"" to Facilitate Model SpecificationFrom Plot Plan to Linear PredictorDistribution MattersMore Complex Example: Multiple Factors with Different Units of ReplicationSetting the StageGoals for Inference with Models: OverviewBasic Tools of InferenceIssue I: Data
Variable Selection for Marginal Longitudinal Generalized Linear Models
Eva Cantoni; Joanna Mills Flemming; Elvezio Ronchetti
2003-01-01
Variable selection is an essential part of any statistical analysis and yet has been somewhat neglected in the context of longitudinal data analysis. In this paper we propose a generalized version of Mallows's Cp (GCp) suitable for use with both parametric and nonparametric models. GCp provides an estimate of a measure of model's adequacy for prediction. We examine its performance with popular marginal longitudinal models (fitted using GEE) and contrast results with what is typically done in ...
An adaptive hybrid stress transition quadrilateral finite element method for linear elasticity
Huang, Feiteng; Xie, Xiaoping; Zhang, Chen-Song
2014-01-01
In this paper, we discuss an adaptive hybrid stress finite element method on quadrilateral meshes for linear elasticity problems. To deal with hanging nodes arising in the adaptive mesh refinement, we propose new transition types of hybrid stress quadrilateral elements with 5 to 7 nodes. In particular, we derive a priori error estimation for the 5-node transition hybrid stress element to show that it is free from Poisson-locking, in the sense that the error bound in the a priori estimate is i...
Rudy, Ashley C. A.; Lamoureux, Scott F.; Treitz, Paul; van Ewijk, Karin Y.
2016-07-01
To effectively assess and mitigate risk of permafrost disturbance, disturbance-prone areas can be predicted through the application of susceptibility models. In this study we developed regional susceptibility models for permafrost disturbances using a field disturbance inventory to test the transferability of the model to a broader region in the Canadian High Arctic. Resulting maps of susceptibility were then used to explore the effect of terrain variables on the occurrence of disturbances within this region. To account for a large range of landscape characteristics, the model was calibrated using two locations: Sabine Peninsula, Melville Island, NU, and Fosheim Peninsula, Ellesmere Island, NU. Spatial patterns of disturbance were predicted with a generalized linear model (GLM) and generalized additive model (GAM), each calibrated using disturbed and randomized undisturbed locations from both locations and GIS-derived terrain predictor variables including slope, potential incoming solar radiation, wetness index, topographic position index, elevation, and distance to water. Each model was validated for the Sabine and Fosheim Peninsulas using independent data sets while the transferability of the model to an independent site was assessed at Cape Bounty, Melville Island, NU. The regional GLM and GAM validated well for both calibration sites (Sabine and Fosheim) with the area under the receiver operating curves (AUROC) > 0.79. Both models were applied directly to Cape Bounty without calibration and validated equally with AUROC's of 0.76; however, each model predicted disturbed and undisturbed samples differently. Additionally, the sensitivity of the transferred model was assessed using data sets with different sample sizes. Results indicated that models based on larger sample sizes transferred more consistently and captured the variability within the terrain attributes in the respective study areas. Terrain attributes associated with the initiation of disturbances were
The generalization of some trellis properties of linear codes to group codes
KAN HaiBin; LI XueFei; SHEN Hong
2009-01-01
In this paper, we discuss some trellis properties for codes over a finite Abelian group, which are the generalization of the corresponding trellis properties for linear codes over a field. Also, we also inves-tigate difficulties when we try to generalize a property of a tail-biting trellis for a linear code over a field to a group code.
Computer analysis of general linear networks using digraphs.
Mcclenahan, J. O.; Chan, S.-P.
1972-01-01
Investigation of the application of digraphs in analyzing general electronic networks, and development of a computer program based on a particular digraph method developed by Chen. The Chen digraph method is a topological method for solution of networks and serves as a shortcut when hand calculations are required. The advantage offered by this method of analysis is that the results are in symbolic form. It is limited, however, by the size of network that may be handled. Usually hand calculations become too tedious for networks larger than about five nodes, depending on how many elements the network contains. Direct determinant expansion for a five-node network is a very tedious process also.
LI, ZHONGKUI; Duan, Zhisheng
2014-01-01
This paper addresses the distributed consensus design problem for linear multi-agent systems with directed communication graphs and external disturbances. Both the cases with strongly connected communication graphs and leader-follower graphs containing a directed spanning tree with the leader as the root are discussed. Distributed adaptive consensus protocols based on the relative states of neighboring agents are designed, which can ensure the ultimate boundedness of the consensus error and a...
Abbaszadeh, Masoud
2015-01-01
A sequential trajectory linearized adaptive model based predictive controller is designed using the DMC algorithm to control the temperature of a batch MMA polymerization process. Using the mechanistic model of the polymerization, a parametric transfer function is derived to relate the reactor temperature to the power of the heaters. Then, a multiple model predictive control approach is taken in to track a desired temperature trajectory.The coefficients of the multiple transfer functions are ...
Manjula Devi Ramasamy; Kuppuswami Subbaraya Gounder
2014-01-01
Multilayer Feed Forward Neural Network (MFNN) has been successfully administered architectures for solving a wide range of supervised pattern recognition tasks. The most problematic task of MFNN is training phase which consumes very long training time on very huge training datasets. An enhanced linear adaptive skipping training algorithm for MFNN called Half of Threshold (HOT) is proposed in this research paper. The core idea of this study is to reduce the training time through random present...
Fast Linear Adaptive Skipping Training Algorithm for Training Artificial Neural Network
Manjula Devi, R.; R. C. Suganthe; S. KUPPUSWAMI
2013-01-01
Artificial neural network has been extensively consumed training model for solving pattern recognition tasks. However, training a very huge training data set using complex neural network necessitates excessively high training time. In this correspondence, a new fast Linear Adaptive Skipping Training (LAST) algorithm for training artificial neural network (ANN) is instituted. The core essence of this paper is to ameliorate the training speed of ANN by exhibiting only the input samples that do ...
Sample based 3D face reconstruction from a single frontal image by adaptive locally linear embedding
ZHANG Jian; ZHUANG Yue-ting
2007-01-01
In this paper, we propose a highly automatic approach for 3D photorealistic face reconstruction from a single frontal image. The key point of our work is the implementation of adaptive manifold learning approach. Beforehand, an active appearance model (AAM) is trained for automatic feature extraction and adaptive locally linear embedding (ALLE) algorithm is utilized to reduce the dimensionality of the 3D database. Then, given an input frontal face image, the corresponding weights between 3D samples and the image are synthesized adaptively according to the AAM selected facial features. Finally, geometry reconstruction is achieved by linear weighted combination of adaptively selected samples. Radial basis function (RBF) is adopted to map facial texture from the frontal image to the reconstructed face geometry. The texture of invisible regions between the face and the ears is interpolated by sampling from the frontal image. This approach has several advantages: (1) Only a single frontal face image is needed for highly automatic face reconstruction; (2) Compared with former works, our reconstruction approach provides higher accuracy; (3) Constraint based RBF texture mapping provides natural appearance for reconstructed face.
Erlicher, Silvano; Point, Nelly
2006-01-01
International audience A simple way to define the flow rules of plasticity models is the assumption of generalized normality associated with a suitable pseudo-potential function. This approach, however, is not usually employed to formulate endochronic theory and non-linear kinematic (NLK) hardening rules as well as generalized plasticity models. In this paper, generalized normality is used to give a new formulation of these classes of models. As a result, a suited pseudo-potential is intro...
Design of Attitude Control System for UAV Based on Feedback Linearization and Adaptive Control
Wenya Zhou
2014-01-01
Full Text Available Attitude dynamic model of unmanned aerial vehicles (UAVs is multi-input multioutput (MIMO, strong coupling, and nonlinear. Model uncertainties and external gust disturbances should be considered during designing the attitude control system for UAVs. In this paper, feedback linearization and model reference adaptive control (MRAC are integrated to design the attitude control system for a fixed wing UAV. First of all, the complicated attitude dynamic model is decoupled into three single-input single-output (SISO channels by input-output feedback linearization. Secondly, the reference models are determined, respectively, according to the performance indexes of each channel. Subsequently, the adaptive control law is obtained using MRAC theory. In order to demonstrate the performance of attitude control system, the adaptive control law and the proportional-integral-derivative (PID control law are, respectively, used in the coupling nonlinear simulation model. Simulation results indicate that the system performance indexes including maximum overshoot, settling time (2% error range, and rise time obtained by MRAC are better than those by PID. Moreover, MRAC system has stronger robustness with respect to the model uncertainties and gust disturbance.
Finite element model for linear-elastic mixed mode loading using adaptive mesh strategy
无
2008-01-01
An adaptive mesh finite element model has been developed to predict the crack propagation direction as well as to calculate the stress intensity factors (SIFs), under linear-elastic assumption for mixed mode loading application. The finite element mesh is generated using the advancing front method. In order to suit the requirements of the fracture analysis, the generation of the background mesh and the construction of singular elements have been added to the developed program. The adaptive remeshing process is carried out based on the posteriori stress error norm scheme to obtain an optimal mesh. Previous works of the authors have proposed techniques for adaptive mesh generation of 2D cracked models. Facilitated by the singular elements, the displacement extrapolation technique is employed to calculate the SIF. The fracture is modeled by the splitting node approach and the trajectory follows the successive linear extensions of each crack increment. The SIFs values for two different case studies were estimated and validated by direct comparisons with other researchers work.
Zhang, Ruikun; Hou, Zhongsheng; Ji, Honghai; Yin, Chenkun
2016-04-01
In this paper, an adaptive iterative learning control scheme is proposed for a class of non-linearly parameterised systems with unknown time-varying parameters and input saturations. By incorporating a saturation function, a new iterative learning control mechanism is presented which includes a feedback term and a parameter updating term. Through the use of parameter separation technique, the non-linear parameters are separated from the non-linear function and then a saturated difference updating law is designed in iteration domain by combining the unknown parametric term of the local Lipschitz continuous function and the unknown time-varying gain into an unknown time-varying function. The analysis of convergence is based on a time-weighted Lyapunov-Krasovskii-like composite energy function which consists of time-weighted input, state and parameter estimation information. The proposed learning control mechanism warrants a L2[0, T] convergence of the tracking error sequence along the iteration axis. Simulation results are provided to illustrate the effectiveness of the adaptive iterative learning control scheme.
Auxiliary space preconditioners for linear elasticity based on generalized finite element methods
Brannick, James; Cho, Durkbin
2010-01-01
We construct and analyze a preconditioner of the linear elastiity system discretized by conforming linear finite elements in the framework of the auxiliary space method. The auxiliary space preconditioner is based on discretization of a scalar elliptic equation with Generalized Finite Element Method.
Linearized solution of isentropic motions of a perfect fluid in general relativity
Isentropic motions of a perfect fluid are studied by using comoving coordinates in the framework of general relativity without assuming any symmetry in the line element and a linearized solution is obtained by dealing with the Cauchy problem. (author)
Variable Selection for Generalized Linear Mixed Models by L1-Penalized Estimation
Groll, Andreas
2011-01-01
Generalized linear mixed models are a widely used tool for modeling longitudinal data. However, their use is typically restricted to few covariates, because the presence of many predictors yields unstable estimates. The presented approach to the fitting of generalized linear mixed models includes an L1-penalty term that enforces variable selection and shrinkage simultaneously. A gradient ascent algorithm is proposed that allows to maximize the penalized loglikelihood yielding models with r...
General linearization formulae for products of continuous hypergeometric-type polynomials
Sánchez-Ruiz, Jorge; López Artés, Pedro; Martínez-Finkelshtein, Andrei; Sánchez Dehesa, Jesús
1999-01-01
The linearization of products of wavefunctions of exactly solvable potentials often reduces to the generalized linearization problem for hypergeometric polynomials (HPs) of a continuous variable, which consists of the expansion of the product of two arbitrary HPs in series of an orthogonal HP set. Here, this problem is algebraically solved directly in terms of the coefficients of the second-order differential equations satisfied by the involved polynomials. General expressions for the expansi...
Adaptive H∞ nonlinear velocity tracking using RBFNN for linear DC brushless motor
Tsai, Ching-Chih; Chan, Cheng-Kain; Li, Yi Yu
2012-01-01
This article presents an adaptive H ∞ nonlinear velocity control for a linear DC brushless motor. A simplified model of this motor with friction is briefly recalled. The friction dynamics is described by the Lu Gre model and the online tuning radial basis function neural network (RBFNN) is used to parameterise the nonlinear friction function and un-modelled errors. An adaptive nonlinear H ∞ control method is then proposed to achieve velocity tracking, by assuming that the upper bounds of the ripple force, the changeable load and the nonlinear friction can be learned by the RBFNN. The closed-loop system is proven to be uniformly bounded using the Lyapunov stability theory. The feasibility and the efficacy of the proposed control are exemplified by conducting two velocity tracking experiments.
Research of robust adaptive trajectory linearization control based on T-S fuzzy system
Jiang Changsheng; Zhang Chunyu; Zhu Liang
2008-01-01
A robust adaptive trajectory linearization control (RATLC) algorithm for a class of nonlinear systems with uncertainty and disturbance based on the T-S fuzzy system is presented. The unknown disturbance and uncertainty are estimated by the T-S fuzzy system, and a robust adaptive control law is designed by the Lyapunov theory. Irrespective of whether the dimensions of the system and the rules of the fuzzy system are large or small, there is only one parameter adjusting on line. Uniformly ultimately boundedness of all signals of the composite closed-loop system are proved by theory analysis. Finally, a numerical example is studied based on the proposed method. The simulation results demonstrate the effectiveness and robustness of the control scheme.
Yunfeng Wu
2014-01-01
Full Text Available This paper presents a novel adaptive linear and normalized combination (ALNC method that can be used to combine the component radial basis function networks (RBFNs to implement better function approximation and regression tasks. The optimization of the fusion weights is obtained by solving a constrained quadratic programming problem. According to the instantaneous errors generated by the component RBFNs, the ALNC is able to perform the selective ensemble of multiple leaners by adaptively adjusting the fusion weights from one instance to another. The results of the experiments on eight synthetic function approximation and six benchmark regression data sets show that the ALNC method can effectively help the ensemble system achieve a higher accuracy (measured in terms of mean-squared error and the better fidelity (characterized by normalized correlation coefficient of approximation, in relation to the popular simple average, weighted average, and the Bagging methods.
Maps for general open quantum systems and a theory of linear quantum error correction
We show that quantum subdynamics of an open quantum system can always be described by a linear, Hermitian map irrespective of the form of the initial total system state. Since the theory of quantum error correction was developed based on the assumption of completely positive (CP) maps, we present a generalized theory of linear quantum error correction, which applies to any linear map describing the open system evolution. In the physically relevant setting of Hermitian maps, we show that the CP-map-based version of quantum error correction theory applies without modifications. However, we show that a more general scenario is also possible, where the recovery map is Hermitian but not CP. Since non-CP maps have nonpositive matrices in their range, we provide a geometric characterization of the positivity domain of general linear maps. In particular, we show that this domain is convex and that this implies a simple algorithm for finding its boundary.
Niche adaptation by expansion and reprogramming of general transcription factors
Turkarslan, Serdar; Reiss, David J; Gibbins, Goodwin; Su, Wan Lin; Pan, Min; Bare, J Christopher; Plaisier, Christopher L.; Baliga, Nitin S
2011-01-01
The evolutionary success of an organism depends on its ability to continually adapt to changes in the patterns of constant, periodic, and transient challenges within its environment. This process of ‘niche adaptation' requires reprogramming of the organism's environmental response networks by reorganizing interactions among diverse parts including environmental sensors, signal transducers, and transcriptional and post-transcriptional regulators. Gene duplications have been discovered to be on...
Tsarev, Sergey P.
2005-01-01
We give a new procedure for generalized factorization and construction of the complete solution of strictly hyperbolic linear partial differential equations or strictly hyperbolic systems of such equations in the plane. This procedure generalizes the classical theory of Laplace transformations of second-order equations in the plane.
Univariate and multivariate general linear models theory and applications with SAS
Kim, Kevin
2006-01-01
Reviewing the theory of the general linear model (GLM) using a general framework, Univariate and Multivariate General Linear Models: Theory and Applications with SAS, Second Edition presents analyses of simple and complex models, both univariate and multivariate, that employ data sets from a variety of disciplines, such as the social and behavioral sciences.With revised examples that include options available using SAS 9.0, this expanded edition divides theory from applications within each chapter. Following an overview of the GLM, the book introduces unrestricted GLMs to analyze multiple regr
Evaluation of Lyapunov exponent in generalized linear dynamical models of queueing networks
Krivulin, N. K.
2012-01-01
The problem of evaluation of Lyapunov exponent in queueing network analysis is considered based on models and methods of idempotent algebra. General existence conditions for Lyapunov exponent to exist in generalized linear stochastic dynamic systems are given, and examples of evaluation of the exponent for systems with matrices of particular types are presented. A method which allow one to get the exponent is proposed based on some appropriate decomposition of the system matrix. A general app...
Manjula Devi Ramasamy
2014-01-01
Full Text Available Multilayer Feed Forward Neural Network (MFNN has been successfully administered architectures for solving a wide range of supervised pattern recognition tasks. The most problematic task of MFNN is training phase which consumes very long training time on very huge training datasets. An enhanced linear adaptive skipping training algorithm for MFNN called Half of Threshold (HOT is proposed in this research paper. The core idea of this study is to reduce the training time through random presentation of training input samples without affecting the network’s accuracy. The random presentation is done by partitioning the training dataset into two distinct classes, classified and misclassified class, based on the comparison result of the calculated error measure with half of threshold value. Only the input samples in the misclassified class are presented to the next epoch for training, whereas the correctly classified class is skipped linearly which dynamically reducing the number of input samples exhibited at every single epoch without affecting the network’s accuracy. Thus decreasing the size of the training dataset linearly can reduce the total training time, thereby speeding up the training process. This HOT algorithm can be implemented with any training algorithm used for supervised pattern classification and its implementation is very simple and easy. Simulation study results proved that HOT training algorithm achieves faster training than the other standard training algorithm.
The Solution Structure and Error Estimation for The Generalized Linear Complementarity Problem
Tingfa Yan
2014-07-01
Full Text Available In this paper, we consider the generalized linear complementarity problem (GLCP. Firstly, we develop some equivalent reformulations of the problem under milder conditions, and then characterize the solution of the GLCP. Secondly, we also establish the global error estimation for the GLCP by weakening the assumption. These results obtained in this paper can be taken as an extension for the classical linear complementarity problems.
Bounded Real Lemma for Generalized Linear System with Finite Discrete Jumps
无
2006-01-01
The strict bounded real lemma for linear system with finite discrete jumps was considered. Especially,the case where D matrices in the system are not assumed to be zero was dealt. Several versions of the bounded real lemma are presented in terms of solution to Riccati differential equations or inequalities with finite discrete jumps.Both the finite and infinite horizon cases are considered. These results generalize the existed bounded real lemma for linear systems.
Linear-scaling symmetry-adapted perturbation theory with scaled dispersion
We present a linear-scaling symmetry-adapted perturbation theory (SAPT) method that is based on an atomic orbital (AO) formulation of zeroth-order SAPT (SAPT0). The non-dispersive terms are realized with linear-scaling cost using both the continuous fast multipole method (CFMM) and the linear exchange (LinK) approach for integral contractions as well as our efficient Laplace-based coupled-perturbed self-consistent field method (DL-CPSCF) for evaluating response densities. The reformulation of the dispersion term is based on our linear-scaling AO Møller-Plesset second-order perturbation theory (AO-MP2) method, that uses our recently introduced QQR-type screening [S. A. Maurer, D. S. Lambrecht, J. Kussmann, and C. Ochsenfeld, J. Chem. Phys. 138, 014101 (2013)] for preselecting numerically significant energy contributions. Similar to scaled opposite-spin MP2, we neglect the exchange-dispersion term in SAPT and introduce a scaling factor for the dispersion term, which compensates for the error and at the same time accounts for basis set incompleteness effects and intramonomer correlation. We show in extensive benchmark calculations that the new scaled-dispersion (sd-)SAPT0 approach provides reliable results for small and large interacting systems where the results with a small 6-31G** basis are roughly comparable to supermolecular MP2 calculations in a triple-zeta basis. The performance of our method is demonstrated with timings on cellulose fragments, DNA systems, and cutouts of a protein-ligand complex with up to 1100 atoms on a single computer core
An adaptive input-output feedback linearization controller for doubly-fed induction machine drives
Payam Farrokh Amir
2008-01-01
Full Text Available In this paper a nonlinear controller is presented for Doubly-Fed Induction Machine (DFIM drives. The nonlinear controller is designed based on the adaptive input-output feedback linearization control technique, using the fifth order model of induction machine in fixed stator d, q axis reference frames with stator currents and rotor flux components as state variables. The nonlinear controller can perfectly track the torque and flux reference signals in spite of stator and rotor resistance variations. Two level SVM-PWM back-to-back voltage source inverters are employed in the rotor circuit, in order to make the drive system capable of operating in the motoring and generating modes below and above the synchronous speed. Computer simulation results obtained, confirm the effectiveness and validity of the proposed control approach.
Unified Einstein-Virasoro Master Equation in the General Non-Linear Sigma Model
de Boer, J
2009-01-01
The Virasoro master equation (VME) describes the general affine-Virasoro construction $T=L^abJ_aJ_b+iD^a \\dif J_a$ in the operator algebra of the WZW model, where $L^ab$ is the inverse inertia tensor and $D^a $ is the improvement vector. In this paper, we generalize this construction to find the general (one-loop) Virasoro construction in the operator algebra of the general non-linear sigma model. The result is a unified Einstein-Virasoro master equation which couples the spacetime spin-two f...
Unified Einstein-Virasoro Master Equation in the General Non-Linear Sigma Model
de Boer, J; Halpern, M. B.
1996-01-01
The Virasoro master equation (VME) describes the general affine-Virasoro construction $T=L^{ab}J_aJ_b+iD^a \\dif J_a$ in the operator algebra of the WZW model, where $L^{ab}$ is the inverse inertia tensor and $D^a $ is the improvement vector. In this paper, we generalize this construction to find the general (one-loop) Virasoro construction in the operator algebra of the general non-linear sigma model. The result is a unified Einstein-Virasoro master equation which couples the spacetime spin-t...
Erlicher, Silvano; 10.1016/j.ijsolstr.2005.03.022
2008-01-01
A simple way to define the flow rules of plasticity models is the assumption of generalized normality associated with a suitable pseudo-potential function. This approach, however, is not usually employed to formulate endochronic theory and non-linear kinematic (NLK) hardening rules as well as generalized plasticity models. In this paper, generalized normality is used to give a new formulation of these classes of models. As a result, a suited pseudo-potential is introduced for endochronic models and a non-standard description of NLK hardening and generalized plasticity models is also provided. This new formulation allows for an effective investigation of the relationships between these three classes of plasticity models.
Novel Adaptive Learning Control of Linear Systems with Completely Unknown Time Delays
Wei-Sheng Chen
2009-01-01
A novel output-feedback adaptive learning control approach is developed for a class of linear time-delay systems. Three kinds of uncertainties: time delays, number of time delays, and system parameters are all assumed to be completely unknown, which is different from the previous work. The design procedure includes two steps. First, according to the given periodic desired reference output and the allowed bound of tracking error, a suitable finite Fourier series expansion (FSE) is chosen as a practical reference output to he tracked. Second, by expressing the delayed practical reference output as a known time-varying vector multiplied by an unknown constant vector, we combine three kinds of uncertainties into an unknown constant vector and then estimate the vector by designing an adaptive law. By constructing a Lyapunov-Krasovskii functional, it is proved that the system output can asymptotically track the practical reference signal An example is provided to illustrate the effectiveness of the control scheme developed in this paper.
Linearity enhancement of TVGA based on adaptive sweep optimisation in monostatic radar receiver
Almslmany, Amir; Wang, Caiyun; Cao, Qunsheng
2016-08-01
The limited input dynamic power range of the radar receiver and the power loss due to the targets' ranges are two potential problems in the radar receivers. This paper proposes a model based on the time-varying gain amplifier (TVGA) to compensate the power loss from the targets' ranges, and using the negative impedance compensation technique to enhance the TVGA linearity based on Volterra series. The simulation has been done based on adaptive sweep optimisation (ASO) using advanced design system (ADS) and Matlab. It shows that the suppression of the third-order intermodulation products (IMR3) was carried out for two-tone test, the high-gain accuracy improved by 3 dB, and the high linearity IMR3 improved by 14 dB. The monostatic radar system was tested to detect three targets at different ranges and to compare its probability of detection with the prior models; the results show that the probability of detection has been increased for ASO/TVGA.
LaChapelle, J.
2004-01-01
A path integral is presented that solves a general class of linear second order partial differential equations with Dirichlet/Neumann boundary conditions. Elementary kernels are constructed for both Dirichlet and Neumann boundary conditions. The general solution can be specialized to solve elliptic, parabolic, and hyperbolic partial differential equations with boundary conditions. This extends the well-known path integral solution of the Schr\\"{o}dinger/diffusion equation in unbounded space. ...
General-relativistic rotation laws in rotating fluid bodies: constant linear velocity
Knopik, Jerzy; Malec, Edward
2015-01-01
New rotation laws have been recently found for general-relativistic self-gravitating stationary fluids. It was not clear whether they apply to systems rotating with a constant linear velocity. In this paper we fill this gap. The answer is positive. That means, in particular, that these systems should exhibit the recently discovered general-relativistic weak-field effects within rotating tori: the dynamic anti-dragging and the deviation from the Keplerian motion induced by the fluid selfgravity.
We study many particle systems in the context of mean field forces, concentration-dependent diffusion coefficients, generalized equilibrium distributions, and quantum statistics. Using kinetic transport theory and linear nonequilibrium thermodynamics we derive for these systems a generalized multivariate Fokker-Planck equation. It is shown that this Fokker-Planck equation describes relaxation processes, has stationary maximum entropy distributions, can have multiple stationary solutions and stationary solutions that differ from Boltzmann distributions
A general non-linear optimization algorithm for lower bound limit analysis
Krabbenhøft, Kristian; Damkilde, Lars
2003-01-01
The non-linear programming problem associated with the discrete lower bound limit analysis problem is treated by means of an algorithm where the need to linearize the yield criteria is avoided. The algorithm is an interior point method and is completely general in the sense that no particular...... load optimization problem. and finally the efficiency and accuracy of the method is demonstrated by means of examples of plate and slab structures obeying different non-linear yield criteria. Copyright (C) 2002 John Wiley Sons. Ltd....... finite element discretization or yield criterion is required. As with interior point methods for linear programming the number of iterations is affected only little by the problem size. Some practical implementation issues are discussed with reference to the special structure of the common lower bound...
SELECTION OF THE LINEAR COMBINING VECTOR G OF THE GENERALIZED SELF-SHRINKING GENERATORS
Dong Lihua; Zeng Yong; Hu Yupu
2006-01-01
Given an m-sequence, the main factor influencing the least period of the Generalized Self-Shrinking (GSS) sequence is the selection of the linear combining vector G. Based on the calculation of the minimalpolynomial ofL GSS sequences and the comparison of their degrees, an algorithm for selecting the linear combining vector G is presented, which is simple to understand, to implement and to prove. By using this method,much more than 2L-1 linear combining vectors G of the desired properties will be resulted. Thus in the practical application the linear combining vector G can be chosen with great arbitrariness. Additionally, this algorithm can be extended to any finite field easily.
Robust speech perception: recognize the familiar, generalize to the similar, and adapt to the novel.
Kleinschmidt, Dave F; Jaeger, T Florian
2015-04-01
Successful speech perception requires that listeners map the acoustic signal to linguistic categories. These mappings are not only probabilistic, but change depending on the situation. For example, one talker's /p/ might be physically indistinguishable from another talker's /b/ (cf. lack of invariance). We characterize the computational problem posed by such a subjectively nonstationary world and propose that the speech perception system overcomes this challenge by (a) recognizing previously encountered situations, (b) generalizing to other situations based on previous similar experience, and (c) adapting to novel situations. We formalize this proposal in the ideal adapter framework: (a) to (c) can be understood as inference under uncertainty about the appropriate generative model for the current talker, thereby facilitating robust speech perception despite the lack of invariance. We focus on 2 critical aspects of the ideal adapter. First, in situations that clearly deviate from previous experience, listeners need to adapt. We develop a distributional (belief-updating) learning model of incremental adaptation. The model provides a good fit against known and novel phonetic adaptation data, including perceptual recalibration and selective adaptation. Second, robust speech recognition requires that listeners learn to represent the structured component of cross-situation variability in the speech signal. We discuss how these 2 aspects of the ideal adapter provide a unifying explanation for adaptation, talker-specificity, and generalization across talkers and groups of talkers (e.g., accents and dialects). The ideal adapter provides a guiding framework for future investigations into speech perception and adaptation, and more broadly language comprehension. PMID:25844873
Regression Is a Univariate General Linear Model Subsuming Other Parametric Methods as Special Cases.
Vidal, Sherry
Although the concept of the general linear model (GLM) has existed since the 1960s, other univariate analyses such as the t-test and the analysis of variance models have remained popular. The GLM produces an equation that minimizes the mean differences of independent variables as they are related to a dependent variable. From a computer printout…
A Note on an R^2 Measure for Fixed Effects in the Generalized Linear Mixed Model
Edwards, Lloyd J.
2010-01-01
Using the LRT statistic, a model R^2 is proposed for the generalized linear mixed model for assessing the association between the correlated outcomes and fixed effects. The R^2 compares the full model to a null model with all fixed effects deleted.
ON THE SOLVABILITY OF GENERAL LINEAR METHODS FOR DISSIPATIVE DYNAMICAL SYSTEMS
Ai-guo Xiao
2000-01-01
The main purpose of the present paper is to examine the existence and local uniqueness of solutions of the implicit equations arising in the application of a weakly algebraically stable general linear methods to dissipative dynamical systems, and to extend the existing relevant results of Runge-Kutta methods by Humphries and Stuart(1994).
Large-Sample Theory for Generalized Linear Models with Non-natural Link and Random Variates
Jie-li Ding; Xi-ru Chen
2006-01-01
For generalized linear models (GLM), in the case that the regressors are stochastic and have different distributions and the observations of the responses may have different dimensionality, the asymptotic theory of the maximum likelihood estimate (MLE) of the parameters are studied under the assumption of a non-natural link function.
Modelling the score of the sport match via dynamic generalized linear models
Volf, Petr; Hejdušek, M.
Lisabon: ISI International Statistical Institute, 2007, s. 1-4. [ISI 2007. Session of the International Statistical Institute /56./. Lisboa (PT), 22.08.2007-29.08.2007] R&D Projects: GA MŠk(CZ) 1M06047 Institutional research plan: CEZ:AV0Z10750506 Keywords : generalized linear model * Poisson distribution * sport statistics Subject RIV: BB - Applied Statistics, Operational Research
Henson, Robin K.
In General Linear Model (GLM) analyses, it is important to interpret structure coefficients, along with standardized weights, when evaluating variable contribution to observed effects. Although often used in canonical correlation analysis, structure coefficients are less frequently used in multiple regression and several other multivariate…
Bayesian prediction of spatial count data using generalized linear mixed models
Christensen, Ole Fredslund; Waagepetersen, Rasmus Plenge
2002-01-01
Spatial weed count data are modeled and predicted using a generalized linear mixed model combined with a Bayesian approach and Markov chain Monte Carlo. Informative priors for a data set with sparse sampling are elicited using a previously collected data set with extensive sampling. Furthermore, ...
Rate of strong consistency of quasi maximum likelihood estimate in generalized linear models
无
2004-01-01
［1］McCullagh, P., Nelder, J. A., Generalized Linear Models, New York: Chapman and Hall, 1989.［2］Wedderbum, R. W. M., Quasi-likelihood functions, generalized linear models and Gauss-Newton method,Biometrika, 1974, 61:439-447.［3］Fahrmeir, L., Maximum likelihood estimation in misspecified generalized linear models, Statistics, 1990, 21:487-502.［4］Fahrmeir, L., Kaufmann, H., Consistency and asymptotic normality of the maximum likelihood estimator in generalized linear models, Ann. Statist., 1985, 13: 342-368.［5］Melder, J. A., Pregibon, D., An extended quasi-likelihood function, Biometrika, 1987, 74: 221-232.［6］Bennet, G., Probability inequalities for the sum of independent random variables, JASA, 1962, 57: 33-45.［7］Stout, W. F., Almost Sure Convergence, New York:Academic Press, 1974.［8］Petrov, V, V., Sums of Independent Random Variables, Berlin, New York: Springer-Verlag, 1975.
The theory of a general quantum system interacting with a linear dissipative system
A formalism has been developed, using Feynman's space-time formulation of nonrelativistic quantum mechanics whereby the behavior of a system of interest, which is coupled to other external quantum systems, may be calculated in terms of its own variables only. It is shown that the effect of the external systems in such a formalism can always be included in a general class of functionals (influence functionals) of the coordinates of the system only. The properties of influence functionals for general systems are examined. Then, specific forms of influence functionals representing the effect of definite and random classical forces, linear dissipative systems at finite temperatures, and combinations of these are analyzed in detail. The linear system analysis is first done for perfectly linear systems composed of combinations of harmonic oscillators, loss being introduced by continuous distributions of oscillators. Then approximately linear systems and restrictions necessary for the linear behavior are considered. Influence functionals for all linear systems are shown to have the same form in terms of their classical response functions. In addition, a fluctuation-dissipation theorem is derived relating temperature and dissipation of the linear system to a fluctuating classical potential acting on the system of interest which reduces to the Nyquist-Johnson relation for noise in the case of electric circuits. Sample calculations of transition probabilities for the spontaneous emission of an atom in free space and in a cavity are made. Finally, a theorem is proved showing that within the requirements of linearity all sources of noise or quantum fluctuation introduced by maser-type amplification devices are accounted for by a classical calculation of the characteristics of the maser
General introduction to altitude adaptation and mountain sickness
Bartsch, P.; Saltin, B.
2008-01-01
over 24-48 h to improve the oxygen-carrying capacity of the blood, and is further improved during a prolonged sojourn at altitude through an enhanced erythropoiesis and larger Hb mass, allowing for a partial or full restoration of the blood volume and arterial oxygen content. Most of these adaptations......-30% of subjects at altitudes between 2500 and 3000 m a.s.l. Pulmonary edema is rarely seen below 3000 m a.s.l. and brain edema is not seen below 4000 m a.s.l. It is possible to travel to altitudes of 2500-3000 m a.s.l., wait for 2 days, and then gradually start to train. At higher altitudes, one should...... modalities using hypoxia and altitude for improvement of performance Udgivelsesdato: 2008/8...
Generalized linear models with random effects unified analysis via H-likelihood
Lee, Youngjo; Pawitan, Yudi
2006-01-01
Since their introduction in 1972, generalized linear models (GLMs) have proven useful in the generalization of classical normal models. Presenting methods for fitting GLMs with random effects to data, Generalized Linear Models with Random Effects: Unified Analysis via H-likelihood explores a wide range of applications, including combining information over trials (meta-analysis), analysis of frailty models for survival data, genetic epidemiology, and analysis of spatial and temporal models with correlated errors.Written by pioneering authorities in the field, this reference provides an introduction to various theories and examines likelihood inference and GLMs. The authors show how to extend the class of GLMs while retaining as much simplicity as possible. By maximizing and deriving other quantities from h-likelihood, they also demonstrate how to use a single algorithm for all members of the class, resulting in a faster algorithm as compared to existing alternatives. Complementing theory with examples, many of...
The computational capability of efficiently and accurately evaluate reactor core attributes (i.e., keff and power distributions as a function of cycle burnup) utilizing a second-order accurate advanced nodal Generalized Perturbation Theory (GPT) model has been developed. The GPT model is derived from the forward non-linear iterative Nodal Expansion Method (NEM) strategy, thereby extending its inherent savings in memory storage and high computational efficiency to also encompass GPT via the preservation of the finite-difference matrix structure. The above development was easily implemented into the existing coarse-mesh finite-difference GPT-based in-core fuel management optimization code FORMOSA-P, thus combining the proven robustness of its adaptive Simulated Annealing (SA) multiple-objective optimization algorithm with a high-fidelity NEM GPT neutronics model to produce a powerful computational tool used to generate families of near-optimum loading patterns for PWRs. (orig.)
Consensus of Continuous-Time Multiagent Systems with General Linear Dynamics and Nonuniform Sampling
Yanping Gao
2013-01-01
Full Text Available This paper studies the consensus problem of multiple agents with general linear continuous-time dynamics. It is assumed that the information transmission among agents is intermittent; namely, each agent can only obtain the information of other agents at some discrete times, where the discrete time intervals may not be equal. Some sufficient conditions for consensus in the cases of state feedback and static output feedback are established, and it is shown that if the controller gain and the upper bound of discrete time intervals satisfy certain linear matrix inequality, then consensus can be reached. Simulations are performed to validate the theoretical results.
Generalization of Hindi OCR Using Adaptive Segmentation and Font Files
Agrawal, Mudit; Ma, Huanfeng; Doermann, David
In this chapter, we describe an adaptive Indic OCR system implemented as part of a rapidly retargetable language tool effort and extend work found in [20, 2]. The system includes script identification, character segmentation, training sample creation, and character recognition. For script identification, Hindi words are identified in bilingual or multilingual document images using features of the Devanagari script and support vector machine (SVM). Identified words are then segmented into individual characters, using a font-model-based intelligent character segmentation and recognition system. Using characteristics of structurally similar TrueType fonts, our system automatically builds a model to be used for the segmentation and recognition of the new script, independent of glyph composition. The key is a reliance on known font attributes. In our recognition system three feature extraction methods are used to demonstrate the importance of appropriate features for classification. The methods are tested on both Latin and non-Latin scripts. Results show that the character-level recognition accuracy exceeds 92% for non-Latin and 96% for Latin text on degraded documents. This work is a step toward the recognition of scripts of low-density languages which typically do not warrant the development of commercial OCR, yet often have complete TrueType font descriptions.
Niche adaptation by expansion and reprogramming of general transcription factors.
Turkarslan, Serdar; Reiss, David J; Gibbins, Goodwin; Su, Wan Lin; Pan, Min; Bare, J Christopher; Plaisier, Christopher L; Baliga, Nitin S
2011-01-01
Numerous lineage-specific expansions of the transcription factor B (TFB) family in archaea suggests an important role for expanded TFBs in encoding environment-specific gene regulatory programs. Given the characteristics of hypersaline lakes, the unusually large numbers of TFBs in halophilic archaea further suggests that they might be especially important in rapid adaptation to the challenges of a dynamically changing environment. Motivated by these observations, we have investigated the implications of TFB expansions by correlating sequence variations, regulation, and physical interactions of all seven TFBs in Halobacterium salinarum NRC-1 to their fitness landscapes, functional hierarchies, and genetic interactions across 2488 experiments covering combinatorial variations in salt, pH, temperature, and Cu stress. This systems analysis has revealed an elegant scheme in which completely novel fitness landscapes are generated by gene conversion events that introduce subtle changes to the regulation or physical interactions of duplicated TFBs. Based on these insights, we have introduced a synthetically redesigned TFB and altered the regulation of existing TFBs to illustrate how archaea can rapidly generate novel phenotypes by simply reprogramming their TFB regulatory network. PMID:22108796
McTaggart Cowan, H.M.; Tsuchiya, A.; O'Cathain, A; Brazier, J. E.
2010-01-01
Economic evaluation of healthcare technologies uses values for hypothetical health states elicited from the general population rather than patients. However, they may not consider adaptation. This study explored the extent to which the general population changes their initial values, and the factors that influenced this change, after being informed about adaptation. Three rheumatoid arthritis (RA) states were used for illustration. Two respondent groups were interviewed. The Initially Uninfor...
Kun, David William
Unmanned aircraft systems (UASs) are gaining popularity in civil and commercial applications as their lightweight on-board computers become more powerful and affordable, their power storage devices improve, and the Federal Aviation Administration addresses the legal and safety concerns of integrating UASs in the national airspace. Consequently, many researchers are pursuing novel methods to control UASs in order to improve their capabilities, dependability, and safety assurance. The nonlinear control approach is a common choice as it offers several benefits for these highly nonlinear aerospace systems (e.g., the quadrotor). First, the controller design is physically intuitive and is derived from well known dynamic equations. Second, the final control law is valid in a larger region of operation, including far from the equilibrium states. And third, the procedure is largely methodical, requiring less expertise with gain tuning, which can be arduous for a novice engineer. Considering these facts, this thesis proposes a nonlinear controller design method that combines the advantages of adaptive robust control (ARC) with the powerful design tools of linear matrix inequalities (LMI). The ARC-LMI controller is designed with a discontinuous projection-based adaptation law, and guarantees a prescribed transient and steady state tracking performance for uncertain systems in the presence of matched disturbances. The norm of the tracking error is bounded by a known function that depends on the controller design parameters in a known form. Furthermore, the LMI-based part of the controller ensures the stability of the system while overcoming polytopic uncertainties, and minimizes the control effort. This can reduce the number of parameters that require adaptation, and helps to avoid control input saturation. These desirable characteristics make the ARC-LMI control algorithm well suited for the quadrotor UAS, which may have unknown parameters and may encounter external
Adaptive set-membership identification in 0(m) time for linear-in-parameters models
Deller, J. R., Jr.; Odehl, S. F.
1992-04-01
This paper describes some fundamental contributions to the theory and applicability of optimal bounding ellipsoid (OBE) algorithms for signal processing. AU reported OBE algorithms are placed in a general framework which fruitfully demonstrates the relationship between the set-membership principles and least square error identification. Within this framework, flexible measures for adding explicit adaptation capability are formulated and demonstrated through simulation. Computational complexity analysis of OBE algorithms reveals that they are of O(m2) complexity per data sample with m the number of parameters identified, in spite of their well-known propensity toward highly-selective updating. Two very different approaches are described for rendering a specific OBE algorithm, the set-membership weighted recursive least squares algorithm, of 0(m) complexity. The first approach involves an algorithmic solution in which a suboptimal test for innovation is employed. The performance is demonstrated through simulation. The second method is an architectural approach in which complexity is reduced through parallel computation.
Linear and nonlinear associations between general intelligence and personality in Project TALENT.
Major, Jason T; Johnson, Wendy; Deary, Ian J
2014-04-01
Research on the relations of personality traits to intelligence has primarily been concerned with linear associations. Yet, there are no a priori reasons why linear relations should be expected over nonlinear ones, which represent a much larger set of all possible associations. Using 2 techniques, quadratic and generalized additive models, we tested for linear and nonlinear associations of general intelligence (g) with 10 personality scales from Project TALENT (PT), a nationally representative sample of approximately 400,000 American high school students from 1960, divided into 4 grade samples (Flanagan et al., 1962). We departed from previous studies, including one with PT (Reeve, Meyer, & Bonaccio, 2006), by modeling latent quadratic effects directly, controlling the influence of the common factor in the personality scales, and assuming a direction of effect from g to personality. On the basis of the literature, we made 17 directional hypotheses for the linear and quadratic associations. Of these, 53% were supported in all 4 male grades and 58% in all 4 female grades. Quadratic associations explained substantive variance above and beyond linear effects (mean R² between 1.8% and 3.6%) for Sociability, Maturity, Vigor, and Leadership in males and Sociability, Maturity, and Tidiness in females; linear associations were predominant for other traits. We discuss how suited current theories of the personality-intelligence interface are to explain these associations, and how research on intellectually gifted samples may provide a unique way of understanding them. We conclude that nonlinear models can provide incremental detail regarding personality and intelligence associations. PMID:24660993
Generalization of force-field adaptation in proprioceptively-deafferented subjects.
Lefumat, Hannah Z; Miall, R Chris; Cole, Jonathan D; Bringoux, Lionel; Bourdin, Christophe; Vercher, Jean-Louis; Sarlegna, Fabrice R
2016-03-11
Humans have the remarkable ability to adapt their motor behaviour to changes in body properties and/or environmental conditions, based on sensory feedback such as vision and proprioception. The role of proprioception has been highlighted for the adaptation to new upper-limb dynamics, which is known to generalize to the opposite, non-adapted limb in healthy individuals. Such interlimb transfer seems to depend on sensory feedback, and the present study assessed whether the chronic loss of proprioception precludes interlimb transfer of dynamic adaptation by testing two well-characterized proprioceptively-deafferented subjects. These had to reach toward visual targets with vision of the limb. For both deafferented subjects, we observed adaptation of the dominant arm to Coriolis forces and after-effects on non-dominant arm movements in different movement directions, thus indicating interlimb transfer. Overall, our findings show that motor learning can generalize across limbs and movement directions despite the loss of proprioceptive afferents. PMID:26826606
U-Quantile Processes and Generalized Linear Statistics of Dependent Data
Wendler, Martin
2010-01-01
Generalized linear statistics are a unifying class that contains U-statistics, U-quantiles, L-statistics as well as trimmed and winsorized U-statistics. For example, many commonly used estimators of scale fall into this class. GL-statistics only have been studied under independence; in this paper, we establish the central limit theorem (CLT) and the law of the iterated logarithm (LIL) for GL-statistics of sequences which are strongly mixing or L^1 near epoch dependent on an absolutely regular process. We first investigate the empirical U-process. With the help of a generalized Bahadur representation, the CLT and the LIL for the empirical U-quantile process follow. As GL-statistics are linear functionals of the U-quantile process, the CLT and the LIL for GL-statistics are straightforward corollaries.
A cautionary note on generalized linear models for covariance of unbalanced longitudinal data
Huang, Jianhua Z.
2012-03-01
Missing data in longitudinal studies can create enormous challenges in data analysis when coupled with the positive-definiteness constraint on a covariance matrix. For complete balanced data, the Cholesky decomposition of a covariance matrix makes it possible to remove the positive-definiteness constraint and use a generalized linear model setup to jointly model the mean and covariance using covariates (Pourahmadi, 2000). However, this approach may not be directly applicable when the longitudinal data are unbalanced, as coherent regression models for the dependence across all times and subjects may not exist. Within the existing generalized linear model framework, we show how to overcome this and other challenges by embedding the covariance matrix of the observed data for each subject in a larger covariance matrix and employing the familiar EM algorithm to compute the maximum likelihood estimates of the parameters and their standard errors. We illustrate and assess the methodology using real data sets and simulations. © 2011 Elsevier B.V.
Linear relations in microbial reaction systems: a general overview of their origin, form, and use.
Noorman, H J; Heijnen, J J; Ch A M Luyben, K
1991-09-01
In microbial reaction systems, there are a number of linear relations among net conversion rates. These can be very useful in the analysis of experimental data. This article provides a general approach for the formation and application of the linear relations. Two type of system descriptions, one considering the biomass as a black box and the other based on metabolic pathways, are encountered. These are defined in a linear vector and matrix algebra framework. A correct a priori description can be obtained by three useful tests: the independency, consistency, and observability tests. The independency are different. The black box approach provides only conservations relations. They are derived from element, electrical charge, energy, and Gibbs energy balances. The metabolic approach provides, in addition to the conservation relations, metabolic and reaction relations. These result from component, energy, and Gibbs energy balances. Thus it is more attractive to use the metabolic description than the black box approach. A number of different types of linear relations given in the literature are reviewed. They are classified according to the different categories that result from the black box or the metabolic system description. Validation of hypotheses related to metabolic pathways can be supported by experimental validation of the linear metabolic relations. However, definite proof from biochemical evidence remains indispensable. PMID:18604879
Goyal, S; Goyal, G. K.
2012-01-01
This paper highlights the significance of computational intelligence models for predicting shelf life of processed cheese stored at 7-8 g.C. Linear Layer and Generalized Regression models were developed with input parameters: Soluble nitrogen, pH, Standard plate count, Yeast & mould count, Spores, and sensory score as output parameter. Mean Square Error, Root Mean Square Error, Coefficient of Determination and Nash - Sutcliffo Coefficient were used in order to compare the prediction ability o...
R. E. Chandler; Wheater, H. S.
2002-01-01
In the early 1990s a cluster of extreme flood events occurred in the south Galway region of western Ireland, and this led to speculation of changing rainfall patterns in the area. In this paper we illustrate the use of generalized linear models (GLMs) to test for such changes and quantify their structure. GLMs, long established in the statistical literature, provide a flexible and rigorous formal framework within which to distinguish between possible climate change scenarios and are able to d...
A generalized linear Boltzmann equation for non-classical particle transport
This paper presents a derivation and initial study of a new generalized linear Boltzmann equation (GLBE), which describes particle transport for random statistically homogeneous systems in which the distribution function for chord lengths between scattering centers is non-exponential. Such problems have recently been proposed for the description of photon transport in atmospheric clouds; this paper is a first attempt to develop a Boltzmann-like equation for these and other related applications.
Bivariate Random Effects Meta-analysis of Diagnostic Studies Using Generalized Linear Mixed Models
Chu, Haitao; Guo, Hongfei; Zhou, Yijie
2009-01-01
Bivariate random effect models are currently one of the main methods recommended to synthesize diagnostic test accuracy studies. However, only the logit-transformation on sensitivity and specificity has been previously considered in the literature. In this paper, we consider a bivariate generalized linear mixed model to jointly model the sensitivities and specificities, and discuss the estimation of the summary receiver operating characteristic curve (ROC) and the area under the ROC curve (AU...
d'Eon, Eugene
2013-01-01
We derive new diffusion solutions to the monoenergetic generalized linear Boltzmann transport equation (GLBE) for the stationary collision density and scalar flux about an isotropic point source in an infinite $d$-dimensional absorbing medium with isotropic scattering. We consider both classical transport theory with exponentially-distributed free paths in arbitrary dimensions as well as a number of non-classical transport theories (non-exponential random flights) that describe a broader clas...
Convergence analysis for general linear methods applied to stiff delay differential equations
无
2002-01-01
For Runge-Kutta methods applied to stiff delay differential equations (DDEs), the concept of D-convergence was proposed, which is an extension to that of B-convergence in ordinary differential equations (ODEs). In this paper, D-convergence of general linear methods is discussed and the previous related results are improved. Some order results to determine D-convergence of the methods are obtained.
Feng, Jian-Ying; Zhang, Jin; Zhang, Wen-Jie; Wang, Shi-Bo; Han, Shi-Feng; Zhang, Yuan-Ming
2013-01-01
Many important phenotypic traits in plants are ordinal. However, relatively little is known about the methodologies for ordinal trait association studies. In this study, we proposed a hierarchical generalized linear mixed model for mapping quantitative trait locus (QTL) of ordinal traits in crop cultivars. In this model, all the main-effect QTL and QTL-by-environment interaction were treated as random, while population mean, environmental effect and population structure were fixed. In the est...
The general solution of a mixed integer linear programme over a cone
Williams, H. P.
2013-01-01
We give a general method of finding the optimal objective, and solution, values of a Mixed Integer Linear Programme over a Cone (MILPC) as a function of the coefficients (objective, matrix and right- hand side). In order to do this we first convert the matrix of constraint coefficients to a Normal Form (Modified Hermite Normal Form (MHNF)). Then we project out all the variables leaving an (attainable) bound on the optimal objective value. For (M)IPs, including MILPC, projection is more comple...
In this paper, we study chaos (lag) synchronization of a new LC chaotic system, which can exhibit not only a two-scroll attractor but also two double-scroll attractors for different parameter values, via three types of state feedback controls: (i) linear feedback control; (ii) adaptive feedback control; and (iii) a combination of linear feedback and adaptive feedback controls. As a consequence, ten families of new feedback control laws are designed to obtain global chaos lag synchronization for τ < 0 and global chaos synchronization for τ = 0 of the LC system. Numerical simulations are used to illustrate these theoretical results. Each family of these obtained feedback control laws, including two linear (adaptive) functions or one linear function and one adaptive function, is added to two equations of the LC system. This is simpler than the known synchronization controllers, which apply controllers to all equations of the LC system. Moreover, based on the obtained results of the LC system, we also derive the control laws for chaos (lag) synchronization of another new type of chaotic system
General Relativity coupled with Non-Linear Electrodynamics: results and limitations
Chinaglia, Stefano
2015-01-01
We discuss how to generate a black hole solution of the Einstein Equations (EE) via non-linear electrodynamics (NED). We discuss the thermodynamical properties of a general NED solution, recovering the First Law. Then we illustrate the general mechanism and discuss some specific cases, showing that finding a generating Lagrangian (for a specific solution) only requires solving an algebraic equation (we study some analytical cases). Finally, we argue that NED paradigm, though self-consistent, is not the best tool for studying regular black holes.
S. Goyal
2012-03-01
Full Text Available This paper highlights the significance of computational intelligence models for predicting shelf life of processed cheese stored at 7-8 g.C. Linear Layer and Generalized Regression models were developed with input parameters: Soluble nitrogen, pH, Standard plate count, Yeast & mould count, Spores, and sensory score as output parameter. Mean Square Error, Root Mean Square Error, Coefficient of Determination and Nash - Sutcliffo Coefficient were used in order to compare the prediction ability of the models. The study revealed that Generalized Regression computational intelligence models are quite effective in predicting the shelf life of processed cheese stored at 7-8 g.C.
Second degree generalized Jacobi iteration method for solving system of linear equations
Tesfaye Kebede Enyew
2016-05-01
Full Text Available In this paper, a Second degree generalized Jacobi Iteration method for solving system of linear equations, $Ax=b$ and discuss about the optimal values $a_{1}$ and $b_{1}$ in terms of spectral radius about for the convergence of SDGJ method of $x^{(n+1}=b_{1}[D_{m}^{-1}(L_{m}+U_{m}x^{(n}+k_{1m}]-a_{1}x^{(n-1}.$ Few numerical examples are considered to show that the effective of the Second degree Generalized Jacobi Iteration method (SDGJ in comparison with FDJ, FDGJ, SDJ.
Pro-reductive groups attached to irreducible representations of the General Linear Supergroup
Heidersdorf, Thorsten
2013-01-01
We study tensor product decompositions of representations of the General Linear Supergroup Gl(m|n). We show that the quotient of Rep(Gl(m|n),\\epsilon)$ by the tensor ideal of negligible representations is the representation category of a pro-reductive supergroup G red. In the Gl(m|1)-case we show G red = Gl(m-1) \\times Gl(1) \\times Gl(1). In the general case we study the image of the canonical tensor functor Fmn from Deligne's interpolating category Rep (Gl m-n) to Rep(Gl(m|n),\\epsilon). We d...
Extending Local Canonical Correlation Analysis to Handle General Linear Contrasts for fMRI Data
Mingwu Jin
2012-01-01
Full Text Available Local canonical correlation analysis (CCA is a multivariate method that has been proposed to more accurately determine activation patterns in fMRI data. In its conventional formulation, CCA has several drawbacks that limit its usefulness in fMRI. A major drawback is that, unlike the general linear model (GLM, a test of general linear contrasts of the temporal regressors has not been incorporated into the CCA formalism. To overcome this drawback, a novel directional test statistic was derived using the equivalence of multivariate multiple regression (MVMR and CCA. This extension will allow CCA to be used for inference of general linear contrasts in more complicated fMRI designs without reparameterization of the design matrix and without reestimating the CCA solutions for each particular contrast of interest. With the proper constraints on the spatial coefficients of CCA, this test statistic can yield a more powerful test on the inference of evoked brain regional activations from noisy fMRI data than the conventional t-test in the GLM. The quantitative results from simulated and pseudoreal data and activation maps from fMRI data were used to demonstrate the advantage of this novel test statistic.
Application of the Hyper-Poisson Generalized Linear Model for Analyzing Motor Vehicle Crashes.
Khazraee, S Hadi; Sáez-Castillo, Antonio Jose; Geedipally, Srinivas Reddy; Lord, Dominique
2015-05-01
The hyper-Poisson distribution can handle both over- and underdispersion, and its generalized linear model formulation allows the dispersion of the distribution to be observation-specific and dependent on model covariates. This study's objective is to examine the potential applicability of a newly proposed generalized linear model framework for the hyper-Poisson distribution in analyzing motor vehicle crash count data. The hyper-Poisson generalized linear model was first fitted to intersection crash data from Toronto, characterized by overdispersion, and then to crash data from railway-highway crossings in Korea, characterized by underdispersion. The results of this study are promising. When fitted to the Toronto data set, the goodness-of-fit measures indicated that the hyper-Poisson model with a variable dispersion parameter provided a statistical fit as good as the traditional negative binomial model. The hyper-Poisson model was also successful in handling the underdispersed data from Korea; the model performed as well as the gamma probability model and the Conway-Maxwell-Poisson model previously developed for the same data set. The advantages of the hyper-Poisson model studied in this article are noteworthy. Unlike the negative binomial model, which has difficulties in handling underdispersed data, the hyper-Poisson model can handle both over- and underdispersed crash data. Although not a major issue for the Conway-Maxwell-Poisson model, the effect of each variable on the expected mean of crashes is easily interpretable in the case of this new model. PMID:25385093
Grayver, Alexander V.; Kuvshinov, Alexey V.
2016-02-01
This paper presents a methodology to sample equivalence domain (ED) in non-linear PDE-constrained inverse problems. For this purpose, we first applied state-of-the-art stochastic optimization algorithm called Covariance Matrix Adaptation Evolution Strategy (CMAES) to identify low misfit regions of the model space. These regions were then randomly sampled to create an ensemble of equivalent models and quantify uncertainty. CMAES is aimed at exploring model space globally and is robust on very ill-conditioned problems. We show that the number of iterations required to converge grows at a moderate rate with respect to number of unknowns and the algorithm is embarrassingly parallel. We formulated the problem by using the generalized Gaussian distribution. This enabled us to seamlessly use arbitrary norms for residual and regularization terms. We show that various regularization norms facilitate studying different classes of equivalent solutions. We further show how performance of the standard Metropolis-Hastings Markov chain Monte Carlo (MCMC) algorithm can be substantially improved by using information CMAES provides. This methodology was tested by using individual and joint inversions of Magneotelluric, Controlled-source Electromagnetic (EM) and Global EM induction data.
The linear stability of parallel shear flows for an inviscid generalized two-dimensional (2D) fluid system, the so-called α turbulence system, is studied. This system is characterized by the relation q = −( − Δ)α/2ψ between the advected scalar q and the stream function ψ. Here, α is a real number not exceeding 3 and q is referred to as the generalized vorticity. In this study, a sufficient condition for linear stability of parallel shear flows is derived using the conservation of wave activity. A stability analysis is then performed for a sheet vortex that violates the stability condition. The instability of a sheet vortex in the 2D Euler system (α = 2) is referred to as a Kelvin–Helmholtz (KH) instability; such an instability for the generalized 2D fluid system is investigated for 0 3−α for 1 < α < 3, where k is the wavenumber of the perturbation. In contrast, for 0 < α ⩽ 1, the growth rate is infinite. In other words, a transition of the growth rate of the perturbation occurs at α = 1. A physical model for KH instability in the generalized 2D fluid system, which can explain the transition of the growth rate of the perturbation at α = 1, is proposed. (paper)
Cressman, Erin K; Henriques, Denise Y P
2015-07-01
Visuomotor learning results in changes in both motor and sensory systems (Cressman EK, Henriques DY. J Neurophysiol 102: 3505-3518, 2009), such that reaches are adapted and sense of felt hand position recalibrated after reaching with altered visual feedback of the hand. Moreover, visuomotor learning has been shown to generalize such that reach adaptation achieved at a trained target location can influence reaches to novel target directions (Krakauer JW, Pine ZM, Ghilardi MF, Ghez C. J Neurosci 20: 8916-8924, 2000). We looked to determine whether proprioceptive recalibration also generalizes to novel locations. Moreover, we looked to establish the relationship between reach adaptation and changes in sense of felt hand position by determining whether proprioceptive recalibration generalizes to novel targets in a similar manner as reach adaptation. On training trials, subjects reached to a single target with aligned or misaligned cursor-hand feedback, in which the cursor was either rotated or scaled in extent relative to hand movement. After reach training, subjects reached to the training target and novel targets (including targets from a second start position) without visual feedback to assess generalization of reach adaptation. Subjects then performed a proprioceptive estimation task, in which they indicated the position of their hand relative to visual reference markers placed at similar locations as the trained and novel reach targets. Results indicated that shifts in hand position generalized across novel locations, independent of reach adaptation. Thus these distinct sensory and motor generalization patterns suggest that reach adaptation and proprioceptive recalibration arise from independent error signals and that changes in one system cannot guide adjustments in the other. PMID:25972587
A general theory of linear cosmological perturbations: scalar-tensor and vector-tensor theories
Lagos, Macarena; Ferreira, Pedro G; Noller, Johannes
2016-01-01
We present a method for parametrizing linear cosmological perturbations of theories of gravity, around homogeneous and isotropic backgrounds. The method is sufficiently general and systematic that it can be applied to theories with any degrees of freedom (DoFs) and arbitrary gauge symmetries. In this paper, we focus on scalar-tensor and vector-tensor theories, invariant under linear coordinate transformations. In the case of scalar-tensor theories, we use our framework to recover the simple parametrizations of linearized Horndeski and "Beyond Horndeski" theories, and also find higher-derivative corrections. In the case of vector-tensor theories, we first construct the most general quadratic action for perturbations that leads to second-order equations of motion, which propagates two scalar DoFs. Then we specialize to the case in which the vector field is time-like (\\`a la Einstein-Aether gravity), where the theory only propagates one scalar DoF. As a result, we identify the complete forms of the quadratic act...
The quantum general linear supergroup, canonical bases and Kazhdan-Lusztig polynomials
无
2009-01-01
Canonical bases of the tensor powers of the natural Uq(glm|n)-module V are constructed by adapting the work of Frenkel, Khovanov and Kirrilov to the quantum supergroup setting. This result is generalized in several directions. We first construct the canonical bases of the Z2-graded symmetric algebra of V and tensor powers of this superalgebra; then construct canonical bases for the superalgebra Oq(Mm|n) of a quantum (m, n) × (m, n)-supermatrix; and finally deduce from the latter result the canonical basis of every irreducible tensor module for Uq(glm|n) by applying a quantum analogue of the Borel-Weil construction.
Zhang Ruo-Xun; Yang Shi-Ping
2008-01-01
This paper presents a general method of the generalized projective synchronization and the parameter identification between two different chaotic systems with unknown parameters.This approach is based on Lyapunov stability theory,and employs a combination of feedback control and adaptive control.With this method one can achieve the generalized projective synchronization and realize the parameter identifications between almost all chaotic (hyperchaotic) systems with unknown parameters.Numerical simulations results are presented to demonstrate the effectiveness of the method.
The exact solutions of the Cauchy problem for two equations which are slight generalization of the so-called linear vectorial Fokker-Planck equation are found using the disentangling techniques of Feynman and algebraic (operational) methods. This approach may be considered as a generalization of the Suzuki's method for solving the one-dimensional linear Pokker-Planck equation
Zhen Jia; Guangming Deng
2012-01-01
The generalized projective synchronization (GPS) of chaotic systems with uncertain parameter noise and external disturbance is discussed. Based on the adaptive technique, a response system is constructed, and a novel adaptive controller is designed to guarantee the GPS between the drive-response systems, and to eliminate the effect of external disturbance and parameters noise on GPS. The conclusion is proved theoretically, and corresponding numerical simulations are provided to verify the eff...
Generalized linear sampling method for elastic-wave sensing of heterogeneous fractures
Pourahmadian, Fatemeh; Haddar, Houssem
2016-01-01
A theoretical foundation is developed for active seismic reconstruction of fractures endowed with spatially-varying interfacial condition (e.g.~partially-closed fractures, hydraulic fractures). The proposed indicator functional carries a superior localization property with no significant sensitivity to the fracture's contact condition, measurement errors, and illumination frequency. This is accomplished through the paradigm of the $F_\\sharp$-factorization technique and the recently developed Generalized Linear Sampling Method (GLSM) applied to elastodynamics. The direct scattering problem is formulated in the frequency domain where the fracture surface is illuminated by a set of incident plane waves, while monitoring the induced scattered field in the form of (elastic) far-field patterns. The analysis of the well-posedness of the forward problem leads to an admissibility condition on the fracture's (linearized) contact parameters. This in turn contributes toward establishing the applicability of the $F_\\sharp...
Analysis of dental caries using generalized linear and count regression models
Javali M. Phil
2013-11-01
Full Text Available Generalized linear models (GLM are generalization of linear regression models, which allow fitting regression models to response data in all the sciences especially medical and dental sciences that follow a general exponential family. These are flexible and widely used class of such models that can accommodate response variables. Count data are frequently characterized by overdispersion and excess zeros. Zero-inflated count models provide a parsimonious yet powerful way to model this type of situation. Such models assume that the data are a mixture of two separate data generation processes: one generates only zeros, and the other is either a Poisson or a negative binomial data-generating process. Zero inflated count regression models such as the zero-inflated Poisson (ZIP, zero-inflated negative binomial (ZINB regression models have been used to handle dental caries count data with many zeros. We present an evaluation framework to the suitability of applying the GLM, Poisson, NB, ZIP and ZINB to dental caries data set where the count data may exhibit evidence of many zeros and over-dispersion. Estimation of the model parameters using the method of maximum likelihood is provided. Based on the Vuong test statistic and the goodness of fit measure for dental caries data, the NB and ZINB regression models perform better than other count regression models.
A General Method for Solving Systems of Non-Linear Equations
Nachtsheim, Philip R.; Deiss, Ron (Technical Monitor)
1995-01-01
The method of steepest descent is modified so that accelerated convergence is achieved near a root. It is assumed that the function of interest can be approximated near a root by a quadratic form. An eigenvector of the quadratic form is found by evaluating the function and its gradient at an arbitrary point and another suitably selected point. The terminal point of the eigenvector is chosen to lie on the line segment joining the two points. The terminal point found lies on an axis of the quadratic form. The selection of a suitable step size at this point leads directly to the root in the direction of steepest descent in a single step. Newton's root finding method not infrequently diverges if the starting point is far from the root. However, the current method in these regions merely reverts to the method of steepest descent with an adaptive step size. The current method's performance should match that of the Levenberg-Marquardt root finding method since they both share the ability to converge from a starting point far from the root and both exhibit quadratic convergence near a root. The Levenberg-Marquardt method requires storage for coefficients of linear equations. The current method which does not require the solution of linear equations requires more time for additional function and gradient evaluations. The classic trade off of time for space separates the two methods.
A generalization of Dirac non-linear electrodynamics, and spinning charged particles
The Dirac non-linear electrodynamics is generalized by introducing two potentials (namely, the vector potential a and the pseudo-vector potential γ 5 B of the electromagnetic theory with charges and magnetic monopoles), and by imposing the pseudoscalar part of the product W W* to BE zero, with W = A + γ 5 B. Also, is demonstrated that the field equations of such a theory posses a soliton-like solution which can represent a priori a charged particle. (L.C.J.A.)
Standard errors for EM estimates in generalized linear models with random effects.
Friedl, H; Kauermann, G
2000-09-01
A procedure is derived for computing standard errors of EM estimates in generalized linear models with random effects. Quadrature formulas are used to approximate the integrals in the EM algorithm, where two different approaches are pursued, i.e., Gauss-Hermite quadrature in the case of Gaussian random effects and nonparametric maximum likelihood estimation for an unspecified random effect distribution. An approximation of the expected Fisher information matrix is derived from an expansion of the EM estimating equations. This allows for inferential arguments based on EM estimates, as demonstrated by an example and simulations. PMID:10985213
Estimation in the General Linear Model when the Accuracy is Specified Before Data Collection
Finster, Mark
1985-01-01
An estimator $\\hat{\\beta}$ of $\\beta$ is accurate with accuracy $A$ and confidence $\\gamma, 0 < \\gamma < 1,$ if $P(\\hat{\\beta} - \\beta \\in A) \\geq \\gamma$ for all $\\beta.$ Given a sequence $Y_1, Y_2, \\cdots$ of independent vector-valued homoscedastic normally-distributed random variables generated via the general linear model $Y_i = X_i\\beta + \\varepsilon,$ the $k$-dimensional parameter $\\beta$ is accurately estimated using a sequential version of the maximum probability estimator developed b...
Thi Thao Phuong, HOANG; Duc Cam Hai, VO; Thanh Hai, ONG
2016-01-01
The paper is concerned with a low-order finite element method, namely the staggered cell-centered finite element method (SC-FEM), which has been proposed and analyzed in [1] for two-dimensional compressible and nearly incompressible linear elasticity problems. In this work, we extend the results to the three-dimensional case and focus on the creating of the meshes, including a dual mesh and its tetrahedral submesh from a general primal mesh. The displacement is approximated by piecewise trili...
Robust root clustering for linear uncertain systems using generalized Lyapunov theory
Yedavalli, R. K.
1993-01-01
Consideration is given to the problem of matrix root clustering in subregions of a complex plane for linear state space models with real parameter uncertainty. The nominal matrix root clustering theory of Gutman & Jury (1981) using the generalized Liapunov equation is extended to the perturbed matrix case, and bounds are derived on the perturbation to maintain root clustering inside a given region. The theory makes it possible to obtain an explicit relationship between the parameters of the root clustering region and the uncertainty range of the parameter space.
Supersymmetry of Generalized Linear Schrödinger Equations in (1+1 Dimensions
Axel Schulze-Halberg
2009-10-01
Full Text Available We review recent results on how to extend the supersymmetry SUSY normalism in Quantum Mechanics to linear generalizations of the time-dependent Schrödinger equation in (1+1 dimensions. The class of equations we consider contains many known cases, such as the Schrödinger equation for position-dependent mass. By evaluating intertwining relations, we obtain explicit formulas for the interrelations between the supersymmetric partner potentials and their corresponding solutions. We review reality conditions for the partner potentials and show how our SUSY formalism can be extended to the Fokker-Planck and thenonhomogeneous Burgers equation.