Recursive Estimation of the Preisach Density function for a Smart Actuator
|
|
- Horace Francis
- 5 years ago
- Views:
Transcription
1 Recursive Estimation of the Preisach Density function for a Smart Actuator Ram V. Iyer Deartment of Mathematics and Statistics, Texas Tech University, Lubbock, TX ABSTRACT The Preisach oerator and its variants have been successfully used in the modeling of a hysical system with hysteresis. In an alication, one has to determine the density function describing the Preisach oerator from measurements. In our earlier work, we described a regularization method to obtain an aroximation to the density function with limited measurements. In this aer, we describe methods for recursively comuting the aroximate density function. These methods can be imlemented in real-time controllers for smart actuators. Keywords: Hysteresis, Preisach Oerator, Recursive Estimation, Density function Identification, Magnetostriction, Piezoelectric materials, Smart materials, EAPs. 1. INTRODUCTION The Preisach oerator is a mathematical tool that has been used to model the henomena of hysteresis occurring in ferromagnetism, 1 magnetostriction, 2 shae memory alloys 3 and iezoelectricity 4 for many years. In each henomenon, the constitutive relation between conjugate variables, for examle, magnetic field intensity H and magnetization M in ferromagnetism or electric field intensity E and olarization P in ferroelectricity, is described by a hysteresis oerator, usually the Preisach oerator or a variant. Part of what is needed to describe the Preisach oerator for a articular henomenon is a non-negative and integrable, density function defined on a subset of IR 2 called the Preisach domain. Several researchers starting with Mayergoyz 1 have studied the roblem of identifying the density function. A synosis of the various aroaches can be found in our earlier work. 5, 6 In our earlier work, 6 the identification roblem was systematically studied and it was shown to be an illosed roblem. This was shown using the fact that the Preisach oerator with the density function as the indeendent variable, is a comact oerator and, hence, has an unbounded inverse. The unboundedness of the inverse oerator indicates a need for regularization, so that one obtains a sequence of bounded aroximations. A non-arametric, SVD truncation-based regularization was roosed and numerical results were resented for magnetostrictive actuators and electro-active olymers. 6 Collocation in time and discretization of the inut signal levels were used, along with truncation of singular directions corresonding to very small singular values. It was found that finer discretizations lead to much larger comutation times 6 (which is to be exected). In this aer, we roose iterative methods with a view to (a) reduce comutation times, (b) roduce a sequence of aroximate density functions that can be used in a real-time controller. The second item is more imortant from an imlementation oint of view, and slow changes in the density function can be accommodated by eriodic resetting or using short recurrence sequences. As far as we are aware, adative identification of the Preisach density function and its use in the inverse control of hysteresis has only been studied by Tan and Baras. 7 They roosed a recursive least squares algorithm to identify a discretized density function. They accommodated the non-negativity condition for the density function by a simle rojection at each iteration. It is well-known that a simle rojection into the feasible region does not minimize a convex cost function. Figure 1 shows the level surfaces of a quadratic cost function in two variables - three cases are considered, with the unconstrained minimum in the second, third and fourth quadrants. If the minimum has to satisfy a non-negativity constraint, then it is clear that in each case, the rojection of the unconstrained minimum x into the first quadrant does not yield the desired solution x min. Furthermore, the imlementation of the algorithm requires the inversion of a matrix, which leads to the ersistency of excitation condition in Tan and Baras. The fulfilment of this condition would require an enormous amount of data for fine mesh selections. Our method in this aer is to numerically obtain the best aroximation of the density function
2 at each iteration, even in the absence of ersistency of excitation - or in other words, when only limited data is available. This is achieved by alying a rimal-dual interior oint method after a artial SVD comutation. As the SVD comutation is indeendent of the interior oint method, convergence follows from standard results for each of these methods. (a) Case 1: Unconstrained minimum in second quadrant (b) Case 2: Unconstrained minimum in third quadrant (c) Case 3: Unconstrained minimum in fourth quadrant Figure 1. Examles of simle rojection after unconstrained minimization. 2. PRELIMINARIES In this section, we briefly recall the Preisach oerator and the need for regularization. A detailed treatment on the Preisach oerator can be found in. 1, 8, 9 For a air of thresholds (, ) with, consider a relay R, [, ] (called a Preisach hysteron), as illustrated in Fig. 2. For u C[, T ] 1 if u(t) < v, (t) = 1 if u(t) >, v, (t ) if u(t) where v( ) = ζ and t = lim t ɛ. ɛ>,ɛ R, [u] f +1 d e u a b 1 c Figure 2. Inut-outut relationshi for the relay. To construct the Preisach oerator from the elementary hysterons when the inut is u( ), denote v, ( ) = R, [u]( ). The Preisach oerator s inut is u( ), and the outut is given by 1 :
3 ȳ(t) = µ(, )R, [u](t) dd (1) where µ(, ) L 2 (K) where K is a comact region in the (, ) lane with and suort(µ) = K. Thus for a given µ, we can define a Preisach oerator to be a ma Γ µ : C m [, T ] C m [, T ], where C m [, T ] denotes the sace of iecewise monotone continuous functions on [, T ]. For comatibility with exerimental evidence, we restrict µ(, ) to be a non-negative function. During the identification exeriments, the fixed inut u C m [, T ] usually only affects a ortion of the set K in the Preisach lane. Without loss of generality, we can restrict attention to this ortion. In the following, the set K u is the subset of K affected by the inut u. Define the set of density functions: K u := {µ L 2 (K u ) µ }. (2) Due to the assumtion on K u, the outut at time given by Γ[u]() is the same for all density functions in K u. An imortant class of Preisach oerators from the alications oint of view, are the iecewise, strictly increasing (PSI) Preisach oerators. Definition 2.1. A Preisach oerator is said to be iecewise strictly increasing (PSI) if (Γ µ [u](t ) Γ µ [u]())(u(t ) u()) > for a monotone inut u C[, T ] with u() u(t ).. Under the mild condition that the density function is continuous, and greater than zero along the diagonal =, it is easy to show that the Preisach oerator is PSI. Clearly, the definition of PSI is for a fixed density function and varying monotone increasing inut functions u. However, in the identification roblem the inut function is fixed while the density function is the indeendent variable. For a non-constant u C m [, T ], let = T < T 1 < < T N = T be the standard artition (see Brokate and Srekels 9 ). As u is non-constant, u(t i 1 ) u(t i ) for i = 1 N. Denote i = [T i 1, T i ] for i = 1 N. Define the set of density functions: K u,p SI := {} { µ L 2 (K) µ ; and (Γ[u](t 1 ) Γ[u](t 2 ))(u(t 1 ) u(t 2 )) > for t 1, t 2 i, t 1 t 2 ; i = 1,, N.} (3) The idea is that the density function for a PSI Preisach oerator (that can be identified) should come from this set. The sets K u and K u,p SI are clearly non-emty with K u,p SI K u. To further study their roerties, recall that a convex set C is a subset in a vector sace, such that if x 1, x 2 C, then θ x 1 + (1 θ) x 2 C for θ 1 (Luenberger 1 ). A cone with vertex at the origin is a set C in a vector sace with the roerty that if x C, then θ x C for all θ. A convex cone is defined as a set that is both convex and a cone. Closed convex sets are imortant from the oint of view of numerical methods for constrained otimization roblems. The following lemma was roved in Iyer and Shirley. 6 Lemma 2.2. The set K u is a closed convex cone with vertex at the origin, while the set K u,p SI is a convex cone with vertex at the origin that is not closed. Now, for all µ in K u, the initial outut w = Γ[u]() is fixed. For a given u( ) C m [, T ], define the oerator: Φ u : K u L 2 [, T ] µ(, ) y = Φ u µ( ) = Γ µ [u]( ) w (4) The oerator Φ u is a linear oerator between L 2 (K u ) and L 2 [, T ] which is not true for the Preisach oerator Γ! The key is that Φ u mas the function µ = to the function y =. The following imortant theorem concerning the identification roblem for a PSI Preisach oerator was roved in Iyer and Shirley. 6 Theorem 2.3. Let u be a non-constant function in C m [, T ] and Φ u : K u L 2 [, T ] be as defined in (4). Then, 1. {µ K u Φ u µ(t) = } = {};
4 2. Φ u : K u L 2 [, T ] is injective; 3. Range [Φ u ] L 2 [, T ]; 4. Suose that y Range[Φ u ] and Γ is PSI. Then there exists a unique µ K u,p SI such that Φ u µ = y. Remarks We conclude from the above theorem and Lemma 2.2 that: Even though µ K u,p SI for a PSI Preisach oerator, we have to carry out the identification over the set K u, as K u,p SI is not a closed convex set. The set K u is a closed convex cone, and as Φ u is a linear injective oerator on this set, it is well-suited from a numerical oint of view. However, as the closure of the range of Φ u is not all of L 2 [, T ], we need to construct a regularization scheme to counter-act noise. The following lemma roved in Iyer and Shirley 6 shows that the density identification roblem is an ill-osed one! Lemma 2.4. The oerator Φ u : L 2 (K u ) L 2 [, T ] is a comact linear oerator. Due to this lemma, a regularization scheme based on (i) the SVD of a finite dimensional aroximation of Φ u, and (ii) truncation of singular directions corresonding to small singular values was roosed in Iyer and Shirley, 6 and is described below. Let = t 1 < < t n = T be a discretization of time, so that we have : } (Φ u µ)(t j ) = y(t j ), K R j = 1,, n. (5),[u](t j ) µ(, ) dd = y(t j ), where µ(, ) is unknown, while u( ) and y(t j ) are known. The time instants t 1,, t n are known as collocation oints. Once a set of collocation oints have been determined, one can discretize the inut values so that a uniform grid is established in the region K u in the Preisach lane. Then the equation Φ u µ = y can be written as a linear equation linear equation Y = AX + ɛ, (6) as described in Shirley and Venkataraman. 5 Each element of X (excet the last) denotes the area under the density function for a articular grid element. The last element denotes the initial outut value (at time ). To account for noise, we estimate this value also. We need is a way to solve for X that will best fit the data, but at the same time kee x i, since X reresents the integral of a density function over a grid element. where We would like to minimize the function f(x) = 1 2 AX Y 2 (7) A : IR n IR m, X IR n, Y IR m, with the inequality constraint g(x) = X. Let rank(a) = q min {m, n}. If we erform a singular value decomosition on A T A, then we get: A T A = V SV T, (8) where S is an n n diagonal matrix with rank q < n, and V T V = I n n (see age 54, Bellman 11 ). The n singular values of A T A are the diagonal elements of S and be ordered as σ 1 σ 2 σ n. By the remarks following Picard s theorem, 12 we see that small singular values should be discarded as they contribute to an amlification of the noise in the solution. We erform the following stes:
5 1. Pick a tolerance value ɛ >, and set those singular values that are less than ɛ to. Call the resulting matrix that is obtained from S as S Remove the rows and columns of S 1 that are identically zero, and also remove the corresonding columns of U and V. By this rocedure, we obtain a q q diagonal matrix Ŝ, and a n q matrices ˆV that satisfies ˆV T ˆV = I q q. (9) The oerator norm of the matrix A T A ˆV Ŝ ˆV T can be seen to be: A T A ˆV Ŝ ˆV T = A T A V S 1 V T = V (S S 1 ) V T = S S 1 < ɛ. We seek solutions of the tye X = ˆV Z for the Problem (7). Using Equations (8) and (9), the cost function can be transformed to Z T ŜZ Y T A ˆV Z. Thus we form the constrained otimization roblem: minimize f(z) = 1 2 ZT ŜZ Y T A ˆV Z, (1) subject to g(z) = ˆV Z. (11) Once we have a minimizer Z to the above roblem, then the desired solution is given X = ˆV Z. For a commercial magnetostrictive actuator made by ETREMA Inc., the relation between the average Magnetic field Intensity H and average Magnetization M along the axis of the rod was modeled by a classical Preisach oerator in Shirley and Venkataraman 5 and Iyer and Shirley. 6 Figure 3 reroduces the density functions obtained by the above mentioned rocedure for different discretizations (2 Oe, 1 Oe, 6.25Oe) of the inut magnetic field. Figure 4 shows a lot of the singular values of the A matrix for each discretization level. The discretization level of 2 Oe leads to a matrix A of full rank, while for the other two discretization levels, the matrix A is rank-deficient. Figure 5 comares the density functions obtained for the discretization level of 1 Oe, using two different truncation levels for the singular values: σ 1 3 and σ 2. Unfortunately, using a truncation level of σ 4 (corresonding to 27 singular values) did not yield a good result, which imlies that the roblem is only mildly ill-osed. 3. ITERATIVE COMPUTATION OF THE PREISACH DENSITY FUNCTION In this aer, we consider a iterative version of the rocedure in Section 2. The roblem now is to minimize the function (at time t ) where f (X) = 1 2 A X Y 2 (12) A : IR n IR m, X IR n, Y IR m, with the inequality constraint g(x) = X. In the roblem (12), the row dimension of A and Y increases by one after samling of the inut and outut signals is erformed. We assume that rank(a ) min {m, n}. The solution rocedure outlined in Section 2 is comosed of two arts: (a) singular value decomosition of the matrix A T A and truncation of singular directions corresonding to small singular values; (b) solution of the constrained minimization roblem (11). To construct an iterative scheme, we need iterative methods to accomlish both arts. An iterative method for SVD is the double-bracket flow due to Brockett. 13 This method leads to the comutation of all the singular values of the matrix A, which is not necessary due to truncation. In light of
6 µ(,) 5 µ(,) (a) Discretization = 2 Oe (b) Discretization = 1 Oe µ(,) (c) Discretization = 6.25 Oe Figure 3. Identification exeriments for a commercial magnetostrictive actuator with different magnetic field discretizations the raid decay in the singular values (both for the full-rank and rank-deficient cases) as seen in Figure 4, we only need to carry out a artial SVD by comuting the significant singular values. This can be accomlished in several ways - one of them being the Lanczos iteration method, which seems to require fewer comutations for the same level of accuracy than the subsace-iteration method. 14 Other ossibilities for sequential SVD can be found in Strobach. 15 Note that ideally, one would like to comute only one iteration of the artial SVD algorithm er time-ste. Once the significant singular values and directions have been comuted (resulting in the matrices Ŝ and ˆV ), the next task is to minimize the cost function f(z) in (11). One way to accomlish this is to use a line-search Newton-Rahson algorithm due to Krishnarasad and Barakat. 16 Another method is to use a Primal-Dual 17, 18 Interior oint method. Ideally, one would like to aly only one iteration of (either) solution method at time t. At time t, the Kuhn-Tucker theorem yields the existence of a λ IR n, such that the air (Z, λ ) satisfy the necessary conditions (see Luenberger 1 ): Ŝ Z + ˆV T The solution to this set is found using Newton s method. Let (Z (i) λ ˆV T A T Y = (13) λ T ˆV Z = (14) λ (15), λ (i) ) be the values at the i-th iteration of
7 Discretization level = 2 Oe 35 3 Discretization level = 1 Oe σ 2 σ (a) Discretization= 2 Oe (b) Discretization = 1 Oe Discretization level = 6.25 Oe 3 σ (c) Discretization = 6.25 Oe Figure 4. Plot of singular values of the A matrix the Newton s method. Then, the values at the i + 1-th ste are found using the udate direction (δ Z, δ λ) (i) ) given by the solution to the equation: [ Ŝ The udate is: where (i) (λ (i) ) T ˆV (Z (i) ˆV T ) T ˆV T (Z, λ) (i+1) is chosen to ensure that λ (i+1) (i) = arg min ν ] = = (Z, λ) (i) [ Ŝ Z (i) + ˆV T (λ (i) λ (i) ˆV T ) T ˆV Z (i) A T Y ]. (16) + (i) ) (δ Z, δ λ) (i), (17). Obviously, it has to be chosen to be: λ (i) (k) + ν δ λ (i) (k) k = 1 n. In the above equation, λ (i) (k) denotes the k-th comonent of λ (i). Convergence analysis: We outline the convergence analysis for our method. Note that the SVD comutation is indeendent of the interior oint method, which simlifies the convergence analysis. Furthermore, the rank of the A matrix can only increase with, and that too only in finite stes. As rank(a ) is monotone increasing and bounded
8 Truncation level = 2 Number of singular values used = 33 4 µ(,) (a) Density function using 515 singular values (b) Density function using 33 singular values 8 x 15 8 x Truncation level = Truncation level = 2 Number of singular values used = 515 Number of singular values used = Result of Identification Result of Exeriment x 1 4 Result of identification Result of Exeriment x 1 4 (c) H versus M, using 515 singular values (d) H versus M, using 33 singular values Figure 5. Comarison of different SVD truncation schemes for inut discretization of 1 Oe. above by n, the artial SVD comutation is convergent by Theorem 4.1 of Vogel and Wade 14 assuming that A T A converges to a matrix Σ as. That the interior-oint method is convergent, is a standard result. 18 Numerical results will be addressed in a future ublication. 4. CONCLUSION In this aer, we examined the roblem of recursively determining the Preisach density function given inutoutut data, in a arameter-free manner. This roblem has two features:(a) ill-osedness and (b) a non-negativity constraint on the solution. We address both issues in our recursive imlementation. Ill-osedness of the oerator equation is addressed by a artial SVD iteration, and the non-negativity constraint is addressed by a Primal- Dual interior oint method. As the SVD iteration is indeendent of the Interior oint method comutation, convergence of our roosed method follows from standard results for each of these methods.
9 REFERENCES 1. I. Mayergoyz, Mathematical Models of Hysteresis. Sringer, R. Venkataraman, X. Tan, and P. Krishnarasad, Control of hysteresis: Theory and exerimental results, in Smart Structures and Materials 21: Modeling, Signal Processing, and Control in Smart Structures (V. Rao, ed.), vol. 4326, Mar R. Gorbet, D. Wang, and K. Morris, Preisach model identification of a two-wire SMA actuator, in Proceedings of IEEE International Conference on Robotics and Automation, , W. Galinaitis and R. C. Rogers, Control of a hysteretic actuator using inverse hysteresis comensation, in Mathematics and Control in Smart Structures, Smart Structures and Materials 1998 (V. V. Varadhan, ed.), vol. 3323, , Mar M. Shirley and R. Venkataraman, On the identification of Preisach measures, in Modeling, Signal Processing and Control in Smart Structures and Materials (R. Smith, ed.), vol. 549, , July R. V. Iyer and M. E. Shirley, Hysteresis identification with limited exerimental data. submitted to IEEE Trans. Magnetics, rerint available at htt:// rvenkata, X. Tan, Adative identification and control of hysteresis in smart materials. rerint, A. Visintin, Differential Models of Hysteresis. Alied Mathematical Sciences, Sringer, M. Brokate and J. Srekels, Hysteresis and Phase Transitions. Alied Mathematical Sciences, Sringer Verlag, D. G. Luenberger, Otimization by Vector Sace Methods. Wiley, R. Bellman, Introduction to Matrix Analysis. SIAM, Philadelhia, PA 1914., A. Kirsch, A Mathematical Introduction to the Theory of Inverse Problems. Sringer Verlag, U. Helmke and J. B. Moore, Otimization and Dynamical Systems. Sringer, New York., C. R. Vogel and J. G. Wade, Iterative SVD-based methods for ill-osed roblems, SIAM J. SCI. COM- PUT., vol. 15, no. 3, , P. Strobach, Bi-iteration SVD subsace tracking algorithms, IEEE Transactions on signal rocessing, vol. 45, no. 5, , P. S. Krishnarasad and R. Barakat, A descent aroach to a class of inverse roblems, J. Com. Phys, vol. 24, , S. Wright, Primal-Dual Interior Point Methods. SIAM, Philadelhia, PA, F. A. Potra and S. J. Wright, Interior-oint methods, Journal of Comutational and Alied Mathematics, vol. 124, , 2.
Approximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More informationGeneration of Linear Models using Simulation Results
4. IMACS-Symosium MATHMOD, Wien, 5..003,. 436-443 Generation of Linear Models using Simulation Results Georg Otte, Sven Reitz, Joachim Haase Fraunhofer Institute for Integrated Circuits, Branch Lab Design
More informationEstimation of the large covariance matrix with two-step monotone missing data
Estimation of the large covariance matrix with two-ste monotone missing data Masashi Hyodo, Nobumichi Shutoh 2, Takashi Seo, and Tatjana Pavlenko 3 Deartment of Mathematical Information Science, Tokyo
More informationBest approximation by linear combinations of characteristic functions of half-spaces
Best aroximation by linear combinations of characteristic functions of half-saces Paul C. Kainen Deartment of Mathematics Georgetown University Washington, D.C. 20057-1233, USA Věra Kůrková Institute of
More informationFeedback-error control
Chater 4 Feedback-error control 4.1 Introduction This chater exlains the feedback-error (FBE) control scheme originally described by Kawato [, 87, 8]. FBE is a widely used neural network based controller
More informationRadial Basis Function Networks: Algorithms
Radial Basis Function Networks: Algorithms Introduction to Neural Networks : Lecture 13 John A. Bullinaria, 2004 1. The RBF Maing 2. The RBF Network Architecture 3. Comutational Power of RBF Networks 4.
More informationEfficient algorithms for the smallest enclosing ball problem
Efficient algorithms for the smallest enclosing ball roblem Guanglu Zhou, Kim-Chuan Toh, Jie Sun November 27, 2002; Revised August 4, 2003 Abstract. Consider the roblem of comuting the smallest enclosing
More informationA numerical implementation of a predictor-corrector algorithm for sufcient linear complementarity problem
A numerical imlementation of a redictor-corrector algorithm for sufcient linear comlementarity roblem BENTERKI DJAMEL University Ferhat Abbas of Setif-1 Faculty of science Laboratory of fundamental and
More informationUncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning
TNN-2009-P-1186.R2 1 Uncorrelated Multilinear Princial Comonent Analysis for Unsuervised Multilinear Subsace Learning Haiing Lu, K. N. Plataniotis and A. N. Venetsanooulos The Edward S. Rogers Sr. Deartment
More informationPreconditioning techniques for Newton s method for the incompressible Navier Stokes equations
Preconditioning techniques for Newton s method for the incomressible Navier Stokes equations H. C. ELMAN 1, D. LOGHIN 2 and A. J. WATHEN 3 1 Deartment of Comuter Science, University of Maryland, College
More informationResearch Article An iterative Algorithm for Hemicontractive Mappings in Banach Spaces
Abstract and Alied Analysis Volume 2012, Article ID 264103, 11 ages doi:10.1155/2012/264103 Research Article An iterative Algorithm for Hemicontractive Maings in Banach Saces Youli Yu, 1 Zhitao Wu, 2 and
More informationRobust Predictive Control of Input Constraints and Interference Suppression for Semi-Trailer System
Vol.7, No.7 (4),.37-38 htt://dx.doi.org/.457/ica.4.7.7.3 Robust Predictive Control of Inut Constraints and Interference Suression for Semi-Trailer System Zhao, Yang Electronic and Information Technology
More informationCorrespondence Between Fractal-Wavelet. Transforms and Iterated Function Systems. With Grey Level Maps. F. Mendivil and E.R.
1 Corresondence Between Fractal-Wavelet Transforms and Iterated Function Systems With Grey Level Mas F. Mendivil and E.R. Vrscay Deartment of Alied Mathematics Faculty of Mathematics University of Waterloo
More informationAn Investigation on the Numerical Ill-conditioning of Hybrid State Estimators
An Investigation on the Numerical Ill-conditioning of Hybrid State Estimators S. K. Mallik, Student Member, IEEE, S. Chakrabarti, Senior Member, IEEE, S. N. Singh, Senior Member, IEEE Deartment of Electrical
More information4. Score normalization technical details We now discuss the technical details of the score normalization method.
SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules
More informationSUPER-GEOMETRIC CONVERGENCE OF A SPECTRAL ELEMENT METHOD FOR EIGENVALUE PROBLEMS WITH JUMP COEFFICIENTS *
Journal of Comutational Mathematics Vol.8, No.,, 48 48. htt://www.global-sci.org/jcm doi:.48/jcm.9.-m6 SUPER-GEOMETRIC CONVERGENCE OF A SPECTRAL ELEMENT METHOD FOR EIGENVALUE PROBLEMS WITH JUMP COEFFICIENTS
More informationOn the capacity of the general trapdoor channel with feedback
On the caacity of the general tradoor channel with feedback Jui Wu and Achilleas Anastasooulos Electrical Engineering and Comuter Science Deartment University of Michigan Ann Arbor, MI, 48109-1 email:
More informationDistributed Rule-Based Inference in the Presence of Redundant Information
istribution Statement : roved for ublic release; distribution is unlimited. istributed Rule-ased Inference in the Presence of Redundant Information June 8, 004 William J. Farrell III Lockheed Martin dvanced
More informationNumerical Linear Algebra
Numerical Linear Algebra Numerous alications in statistics, articularly in the fitting of linear models. Notation and conventions: Elements of a matrix A are denoted by a ij, where i indexes the rows and
More informationCombining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO)
Combining Logistic Regression with Kriging for Maing the Risk of Occurrence of Unexloded Ordnance (UXO) H. Saito (), P. Goovaerts (), S. A. McKenna (2) Environmental and Water Resources Engineering, Deartment
More informationState Estimation with ARMarkov Models
Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,
More informationAsymptotically Optimal Simulation Allocation under Dependent Sampling
Asymtotically Otimal Simulation Allocation under Deendent Samling Xiaoing Xiong The Robert H. Smith School of Business, University of Maryland, College Park, MD 20742-1815, USA, xiaoingx@yahoo.com Sandee
More informationNONLINEAR OPTIMIZATION WITH CONVEX CONSTRAINTS. The Goldstein-Levitin-Polyak algorithm
- (23) NLP - NONLINEAR OPTIMIZATION WITH CONVEX CONSTRAINTS The Goldstein-Levitin-Polya algorithm We consider an algorithm for solving the otimization roblem under convex constraints. Although the convexity
More informationVarious Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems
Int. J. Oen Problems Comt. Math., Vol. 3, No. 2, June 2010 ISSN 1998-6262; Coyright c ICSRS Publication, 2010 www.i-csrs.org Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various
More informationLinear diophantine equations for discrete tomography
Journal of X-Ray Science and Technology 10 001 59 66 59 IOS Press Linear diohantine euations for discrete tomograhy Yangbo Ye a,gewang b and Jiehua Zhu a a Deartment of Mathematics, The University of Iowa,
More informationPrincipal Components Analysis and Unsupervised Hebbian Learning
Princial Comonents Analysis and Unsuervised Hebbian Learning Robert Jacobs Deartment of Brain & Cognitive Sciences University of Rochester Rochester, NY 1467, USA August 8, 008 Reference: Much of the material
More informationMultiplicity of weak solutions for a class of nonuniformly elliptic equations of p-laplacian type
Nonlinear Analysis 7 29 536 546 www.elsevier.com/locate/na Multilicity of weak solutions for a class of nonuniformly ellitic equations of -Lalacian tye Hoang Quoc Toan, Quô c-anh Ngô Deartment of Mathematics,
More informationGeneral Linear Model Introduction, Classes of Linear models and Estimation
Stat 740 General Linear Model Introduction, Classes of Linear models and Estimation An aim of scientific enquiry: To describe or to discover relationshis among events (variables) in the controlled (laboratory)
More informationy p 2 p 1 y p Flexible System p 2 y p2 p1 y p u, y 1 -u, y 2 Component Breakdown z 1 w 1 1 y p 1 P 1 P 2 w 2 z 2
ROBUSTNESS OF FLEXIBLE SYSTEMS WITH COMPONENT-LEVEL UNCERTAINTIES Peiman G. Maghami Λ NASA Langley Research Center, Hamton, VA 368 Robustness of flexible systems in the resence of model uncertainties at
More informationControl of hysteresis: theory and experimental results
Control of hysteresis: theory and experimental results Xiaobo Tan, Ram Venkataraman, and P. S. Krishnaprasad Institute for Systems Research and Department of Electrical and Computer Engineering University
More informationProximal methods for the latent group lasso penalty
Proximal methods for the latent grou lasso enalty The MIT Faculty has made this article oenly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Villa,
More informationUncorrelated Multilinear Discriminant Analysis with Regularization and Aggregation for Tensor Object Recognition
Uncorrelated Multilinear Discriminant Analysis with Regularization and Aggregation for Tensor Object Recognition Haiing Lu, K.N. Plataniotis and A.N. Venetsanooulos The Edward S. Rogers Sr. Deartment of
More informationUncorrelated Multilinear Discriminant Analysis with Regularization and Aggregation for Tensor Object Recognition
TNN-2007-P-0332.R1 1 Uncorrelated Multilinear Discriminant Analysis with Regularization and Aggregation for Tensor Object Recognition Haiing Lu, K.N. Plataniotis and A.N. Venetsanooulos The Edward S. Rogers
More informationGeneralized Coiflets: A New Family of Orthonormal Wavelets
Generalized Coiflets A New Family of Orthonormal Wavelets Dong Wei, Alan C Bovik, and Brian L Evans Laboratory for Image and Video Engineering Deartment of Electrical and Comuter Engineering The University
More informationOn Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm
On Line Parameter Estimation of Electric Systems using the Bacterial Foraging Algorithm Gabriel Noriega, José Restreo, Víctor Guzmán, Maribel Giménez and José Aller Universidad Simón Bolívar Valle de Sartenejas,
More informationA Bound on the Error of Cross Validation Using the Approximation and Estimation Rates, with Consequences for the Training-Test Split
A Bound on the Error of Cross Validation Using the Aroximation and Estimation Rates, with Consequences for the Training-Test Slit Michael Kearns AT&T Bell Laboratories Murray Hill, NJ 7974 mkearns@research.att.com
More informationE-companion to A risk- and ambiguity-averse extension of the max-min newsvendor order formula
e-comanion to Han Du and Zuluaga: Etension of Scarf s ma-min order formula ec E-comanion to A risk- and ambiguity-averse etension of the ma-min newsvendor order formula Qiaoming Han School of Mathematics
More informationPositive decomposition of transfer functions with multiple poles
Positive decomosition of transfer functions with multile oles Béla Nagy 1, Máté Matolcsi 2, and Márta Szilvási 1 Deartment of Analysis, Technical University of Budaest (BME), H-1111, Budaest, Egry J. u.
More informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
More informationSystem Reliability Estimation and Confidence Regions from Subsystem and Full System Tests
009 American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June 0-, 009 FrB4. System Reliability Estimation and Confidence Regions from Subsystem and Full System Tests James C. Sall Abstract
More informationFE FORMULATIONS FOR PLASTICITY
G These slides are designed based on the book: Finite Elements in Plasticity Theory and Practice, D.R.J. Owen and E. Hinton, 1970, Pineridge Press Ltd., Swansea, UK. 1 Course Content: A INTRODUCTION AND
More informationLECTURE 7 NOTES. x n. d x if. E [g(x n )] E [g(x)]
LECTURE 7 NOTES 1. Convergence of random variables. Before delving into the large samle roerties of the MLE, we review some concets from large samle theory. 1. Convergence in robability: x n x if, for
More informationMeshless Methods for Scientific Computing Final Project
Meshless Methods for Scientific Comuting Final Project D0051008 洪啟耀 Introduction Floating island becomes an imortant study in recent years, because the lands we can use are limit, so eole start thinking
More informationChater Matrix Norms and Singular Value Decomosition Introduction In this lecture, we introduce the notion of a norm for matrices The singular value de
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A Dahleh George Verghese Deartment of Electrical Engineering and Comuter Science Massachuasetts Institute of Technology c Chater Matrix Norms
More informationPaper C Exact Volume Balance Versus Exact Mass Balance in Compositional Reservoir Simulation
Paer C Exact Volume Balance Versus Exact Mass Balance in Comositional Reservoir Simulation Submitted to Comutational Geosciences, December 2005. Exact Volume Balance Versus Exact Mass Balance in Comositional
More informationESTIMATION OF THE OUTPUT DEVIATION NORM FOR UNCERTAIN, DISCRETE-TIME NONLINEAR SYSTEMS IN A STATE DEPENDENT FORM
Int. J. Al. Math. Comut. Sci. 2007 Vol. 17 No. 4 505 513 DOI: 10.2478/v10006-007-0042-z ESTIMATION OF THE OUTPUT DEVIATION NORM FOR UNCERTAIN DISCRETE-TIME NONLINEAR SYSTEMS IN A STATE DEPENDENT FORM PRZEMYSŁAW
More informationIntroduction to MVC. least common denominator of all non-identical-zero minors of all order of G(s). Example: The minor of order 2: 1 2 ( s 1)
Introduction to MVC Definition---Proerness and strictly roerness A system G(s) is roer if all its elements { gij ( s)} are roer, and strictly roer if all its elements are strictly roer. Definition---Causal
More informationMATH 6210: SOLUTIONS TO PROBLEM SET #3
MATH 6210: SOLUTIONS TO PROBLEM SET #3 Rudin, Chater 4, Problem #3. The sace L (T) is searable since the trigonometric olynomials with comlex coefficients whose real and imaginary arts are rational form
More informationThe Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule
The Grah Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule STEFAN D. BRUDA Deartment of Comuter Science Bisho s University Lennoxville, Quebec J1M 1Z7 CANADA bruda@cs.ubishos.ca
More informationRUN-TO-RUN CONTROL AND PERFORMANCE MONITORING OF OVERLAY IN SEMICONDUCTOR MANUFACTURING. 3 Department of Chemical Engineering
Coyright 2002 IFAC 15th Triennial World Congress, Barcelona, Sain RUN-TO-RUN CONTROL AND PERFORMANCE MONITORING OF OVERLAY IN SEMICONDUCTOR MANUFACTURING C.A. Bode 1, B.S. Ko 2, and T.F. Edgar 3 1 Advanced
More informationA Method of Setting the Penalization Constants in the Suboptimal Linear Quadratic Tracking Method
XXVI. ASR '21 Seminar, Instruments and Control, Ostrava, Aril 26-27, 21 Paer 57 A Method of Setting the Penalization Constants in the Subotimal Linear Quadratic Tracking Method PERŮTKA, Karel Ing., Deartment
More informationConvex Optimization methods for Computing Channel Capacity
Convex Otimization methods for Comuting Channel Caacity Abhishek Sinha Laboratory for Information and Decision Systems (LIDS), MIT sinhaa@mit.edu May 15, 2014 We consider a classical comutational roblem
More informationOne step ahead prediction using Fuzzy Boolean Neural Networks 1
One ste ahead rediction using Fuzzy Boolean eural etworks 1 José A. B. Tomé IESC-ID, IST Rua Alves Redol, 9 1000 Lisboa jose.tome@inesc-id.t João Paulo Carvalho IESC-ID, IST Rua Alves Redol, 9 1000 Lisboa
More informationA Qualitative Event-based Approach to Multiple Fault Diagnosis in Continuous Systems using Structural Model Decomposition
A Qualitative Event-based Aroach to Multile Fault Diagnosis in Continuous Systems using Structural Model Decomosition Matthew J. Daigle a,,, Anibal Bregon b,, Xenofon Koutsoukos c, Gautam Biswas c, Belarmino
More informationAI*IA 2003 Fusion of Multiple Pattern Classifiers PART III
AI*IA 23 Fusion of Multile Pattern Classifiers PART III AI*IA 23 Tutorial on Fusion of Multile Pattern Classifiers by F. Roli 49 Methods for fusing multile classifiers Methods for fusing multile classifiers
More informationUse of Transformations and the Repeated Statement in PROC GLM in SAS Ed Stanek
Use of Transformations and the Reeated Statement in PROC GLM in SAS Ed Stanek Introduction We describe how the Reeated Statement in PROC GLM in SAS transforms the data to rovide tests of hyotheses of interest.
More informationRecent Developments in Multilayer Perceptron Neural Networks
Recent Develoments in Multilayer Percetron eural etworks Walter H. Delashmit Lockheed Martin Missiles and Fire Control Dallas, Texas 75265 walter.delashmit@lmco.com walter.delashmit@verizon.net Michael
More informationarxiv: v1 [math.na] 5 Dec 2018
arxiv:8.0957v [math.na] 5 Dec 08 Residual-tye a osteriori estimators for a singularly erturbed reaction-diffusion variational inequality - reliability, efficiency and robustness Mirjam Walloth Fachbereich
More informationPairwise active appearance model and its application to echocardiography tracking
Pairwise active aearance model and its alication to echocardiograhy tracking S. Kevin Zhou 1, J. Shao 2, B. Georgescu 1, and D. Comaniciu 1 1 Integrated Data Systems, Siemens Cororate Research, Inc., Princeton,
More informationSolved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points.
Solved Problems Solved Problems P Solve the three simle classification roblems shown in Figure P by drawing a decision boundary Find weight and bias values that result in single-neuron ercetrons with the
More informationDamage Identification from Power Spectrum Density Transmissibility
6th Euroean Worksho on Structural Health Monitoring - h.3.d.3 More info about this article: htt://www.ndt.net/?id=14083 Damage Identification from Power Sectrum Density ransmissibility Y. ZHOU, R. PERERA
More informationNotes on duality in second order and -order cone otimization E. D. Andersen Λ, C. Roos y, and T. Terlaky z Aril 6, 000 Abstract Recently, the so-calle
McMaster University Advanced Otimization Laboratory Title: Notes on duality in second order and -order cone otimization Author: Erling D. Andersen, Cornelis Roos and Tamás Terlaky AdvOl-Reort No. 000/8
More informationComputer arithmetic. Intensive Computation. Annalisa Massini 2017/2018
Comuter arithmetic Intensive Comutation Annalisa Massini 7/8 Intensive Comutation - 7/8 References Comuter Architecture - A Quantitative Aroach Hennessy Patterson Aendix J Intensive Comutation - 7/8 3
More information2-D Analysis for Iterative Learning Controller for Discrete-Time Systems With Variable Initial Conditions Yong FANG 1, and Tommy W. S.
-D Analysis for Iterative Learning Controller for Discrete-ime Systems With Variable Initial Conditions Yong FANG, and ommy W. S. Chow Abstract In this aer, an iterative learning controller alying to linear
More informationOn the Chvatál-Complexity of Knapsack Problems
R u t c o r Research R e o r t On the Chvatál-Comlexity of Knasack Problems Gergely Kovács a Béla Vizvári b RRR 5-08, October 008 RUTCOR Rutgers Center for Oerations Research Rutgers University 640 Bartholomew
More informationSTABILITY ANALYSIS TOOL FOR TUNING UNCONSTRAINED DECENTRALIZED MODEL PREDICTIVE CONTROLLERS
STABILITY ANALYSIS TOOL FOR TUNING UNCONSTRAINED DECENTRALIZED MODEL PREDICTIVE CONTROLLERS Massimo Vaccarini Sauro Longhi M. Reza Katebi D.I.I.G.A., Università Politecnica delle Marche, Ancona, Italy
More informationOn Isoperimetric Functions of Probability Measures Having Log-Concave Densities with Respect to the Standard Normal Law
On Isoerimetric Functions of Probability Measures Having Log-Concave Densities with Resect to the Standard Normal Law Sergey G. Bobkov Abstract Isoerimetric inequalities are discussed for one-dimensional
More informationDomain Dynamics in a Ferroelastic Epilayer on a Paraelastic Substrate
Y. F. Gao Z. Suo Mechanical and Aerosace Engineering Deartment and Princeton Materials Institute, Princeton University, Princeton, NJ 08544 Domain Dynamics in a Ferroelastic Eilayer on a Paraelastic Substrate
More informationAR PROCESSES AND SOURCES CAN BE RECONSTRUCTED FROM. Radu Balan, Alexander Jourjine, Justinian Rosca. Siemens Corporation Research
AR PROCESSES AND SOURCES CAN BE RECONSTRUCTED FROM DEGENERATE MIXTURES Radu Balan, Alexander Jourjine, Justinian Rosca Siemens Cororation Research 7 College Road East Princeton, NJ 8 fradu,jourjine,roscag@scr.siemens.com
More informationOn Fractional Predictive PID Controller Design Method Emmanuel Edet*. Reza Katebi.**
On Fractional Predictive PID Controller Design Method Emmanuel Edet*. Reza Katebi.** * echnology and Innovation Centre, Level 4, Deartment of Electronic and Electrical Engineering, University of Strathclyde,
More informationA Recursive Block Incomplete Factorization. Preconditioner for Adaptive Filtering Problem
Alied Mathematical Sciences, Vol. 7, 03, no. 63, 3-3 HIKARI Ltd, www.m-hiari.com A Recursive Bloc Incomlete Factorization Preconditioner for Adative Filtering Problem Shazia Javed School of Mathematical
More informationFigure : An 8 bridge design grid. (a) Run this model using LOQO. What is the otimal comliance? What is the running time?
5.094/SMA53 Systems Otimization: Models and Comutation Assignment 5 (00 o i n ts) Due Aril 7, 004 Some Convex Analysis (0 o i n ts) (a) Given ositive scalars L and E, consider the following set in three-dimensional
More informationCOMPARISON OF VARIOUS OPTIMIZATION TECHNIQUES FOR DESIGN FIR DIGITAL FILTERS
NCCI 1 -National Conference on Comutational Instrumentation CSIO Chandigarh, INDIA, 19- March 1 COMPARISON OF VARIOUS OPIMIZAION ECHNIQUES FOR DESIGN FIR DIGIAL FILERS Amanjeet Panghal 1, Nitin Mittal,Devender
More informationInformation collection on a graph
Information collection on a grah Ilya O. Ryzhov Warren Powell February 10, 2010 Abstract We derive a knowledge gradient olicy for an otimal learning roblem on a grah, in which we use sequential measurements
More informationSome Unitary Space Time Codes From Sphere Packing Theory With Optimal Diversity Product of Code Size
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 5, NO., DECEMBER 4 336 Some Unitary Sace Time Codes From Shere Packing Theory With Otimal Diversity Product of Code Size Haiquan Wang, Genyuan Wang, and Xiang-Gen
More informationOptimal Design of Truss Structures Using a Neutrosophic Number Optimization Model under an Indeterminate Environment
Neutrosohic Sets and Systems Vol 14 016 93 University of New Mexico Otimal Design of Truss Structures Using a Neutrosohic Number Otimization Model under an Indeterminate Environment Wenzhong Jiang & Jun
More informationSingularity Issues in Fixture Fault Diagnosis for Multi-Station Assembly Processes
Yu Ding Abhishek Guta Deartment of Industrial Engineering, Texas A& University, TAU 33 College Station, TX 77843-33 Daniel W. Aley Deartment of Industrial Engineering and anagement Sciences, Northwestern
More informationSYMPLECTIC STRUCTURES: AT THE INTERFACE OF ANALYSIS, GEOMETRY, AND TOPOLOGY
SYMPLECTIC STRUCTURES: AT THE INTERFACE OF ANALYSIS, GEOMETRY, AND TOPOLOGY FEDERICA PASQUOTTO 1. Descrition of the roosed research 1.1. Introduction. Symlectic structures made their first aearance in
More informationPARTIAL FACE RECOGNITION: A SPARSE REPRESENTATION-BASED APPROACH. Luoluo Liu, Trac D. Tran, and Sang Peter Chin
PARTIAL FACE RECOGNITION: A SPARSE REPRESENTATION-BASED APPROACH Luoluo Liu, Trac D. Tran, and Sang Peter Chin Det. of Electrical and Comuter Engineering, Johns Hokins Univ., Baltimore, MD 21218, USA {lliu69,trac,schin11}@jhu.edu
More informationElementary theory of L p spaces
CHAPTER 3 Elementary theory of L saces 3.1 Convexity. Jensen, Hölder, Minkowski inequality. We begin with two definitions. A set A R d is said to be convex if, for any x 0, x 1 2 A x = x 0 + (x 1 x 0 )
More informationThe Fekete Szegő theorem with splitting conditions: Part I
ACTA ARITHMETICA XCIII.2 (2000) The Fekete Szegő theorem with slitting conditions: Part I by Robert Rumely (Athens, GA) A classical theorem of Fekete and Szegő [4] says that if E is a comact set in the
More informationObserver/Kalman Filter Time Varying System Identification
Observer/Kalman Filter Time Varying System Identification Manoranjan Majji Texas A&M University, College Station, Texas, USA Jer-Nan Juang 2 National Cheng Kung University, Tainan, Taiwan and John L. Junins
More informationGOOD MODELS FOR CUBIC SURFACES. 1. Introduction
GOOD MODELS FOR CUBIC SURFACES ANDREAS-STEPHAN ELSENHANS Abstract. This article describes an algorithm for finding a model of a hyersurface with small coefficients. It is shown that the aroach works in
More informationLocation of solutions for quasi-linear elliptic equations with general gradient dependence
Electronic Journal of Qualitative Theory of Differential Equations 217, No. 87, 1 1; htts://doi.org/1.14232/ejqtde.217.1.87 www.math.u-szeged.hu/ejqtde/ Location of solutions for quasi-linear ellitic equations
More informationAge of Information: Whittle Index for Scheduling Stochastic Arrivals
Age of Information: Whittle Index for Scheduling Stochastic Arrivals Yu-Pin Hsu Deartment of Communication Engineering National Taiei University yuinhsu@mail.ntu.edu.tw arxiv:80.03422v2 [math.oc] 7 Ar
More informationMultivariable Generalized Predictive Scheme for Gas Turbine Control in Combined Cycle Power Plant
Multivariable Generalized Predictive Scheme for Gas urbine Control in Combined Cycle Power Plant L.X.Niu and X.J.Liu Deartment of Automation North China Electric Power University Beiing, China, 006 e-mail
More informationarxiv: v1 [physics.data-an] 26 Oct 2012
Constraints on Yield Parameters in Extended Maximum Likelihood Fits Till Moritz Karbach a, Maximilian Schlu b a TU Dortmund, Germany, moritz.karbach@cern.ch b TU Dortmund, Germany, maximilian.schlu@cern.ch
More informationFinding a sparse vector in a subspace: linear sparsity using alternating directions
IEEE TRANSACTION ON INFORMATION THEORY VOL XX NO XX 06 Finding a sarse vector in a subsace: linear sarsity using alternating directions Qing Qu Student Member IEEE Ju Sun Student Member IEEE and John Wright
More informationMODELING THE RELIABILITY OF C4ISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL
Technical Sciences and Alied Mathematics MODELING THE RELIABILITY OF CISR SYSTEMS HARDWARE/SOFTWARE COMPONENTS USING AN IMPROVED MARKOV MODEL Cezar VASILESCU Regional Deartment of Defense Resources Management
More informationConvexification of Generalized Network Flow Problem with Application to Power Systems
1 Convexification of Generalized Network Flow Problem with Alication to Power Systems Somayeh Sojoudi and Javad Lavaei + Deartment of Comuting and Mathematical Sciences, California Institute of Technology
More informationThe Value of Even Distribution for Temporal Resource Partitions
The Value of Even Distribution for Temoral Resource Partitions Yu Li, Albert M. K. Cheng Deartment of Comuter Science University of Houston Houston, TX, 7704, USA htt://www.cs.uh.edu Technical Reort Number
More informationMultiplicative group law on the folium of Descartes
Multilicative grou law on the folium of Descartes Steluţa Pricoie and Constantin Udrişte Abstract. The folium of Descartes is still studied and understood today. Not only did it rovide for the roof of
More informationSome results of convex programming complexity
2012c12 $ Ê Æ Æ 116ò 14Ï Dec., 2012 Oerations Research Transactions Vol.16 No.4 Some results of convex rogramming comlexity LOU Ye 1,2 GAO Yuetian 1 Abstract Recently a number of aers were written that
More informationUniformly best wavenumber approximations by spatial central difference operators: An initial investigation
Uniformly best wavenumber aroximations by satial central difference oerators: An initial investigation Vitor Linders and Jan Nordström Abstract A characterisation theorem for best uniform wavenumber aroximations
More informationDetection Algorithm of Particle Contamination in Reticle Images with Continuous Wavelet Transform
Detection Algorithm of Particle Contamination in Reticle Images with Continuous Wavelet Transform Chaoquan Chen and Guoing Qiu School of Comuter Science and IT Jubilee Camus, University of Nottingham Nottingham
More informationOn parameter estimation in deformable models
Downloaded from orbitdtudk on: Dec 7, 07 On arameter estimation in deformable models Fisker, Rune; Carstensen, Jens Michael Published in: Proceedings of the 4th International Conference on Pattern Recognition
More informationDepartment of Electrical and Computer Systems Engineering
Deartment of Electrical and Comuter Systems Engineering Technical Reort MECSE-- A monomial $\nu$-sv method for Regression A. Shilton, D.Lai and M. Palaniswami A Monomial ν-sv Method For Regression A. Shilton,
More informationModeling Pointing Tasks in Mouse-Based Human-Computer Interactions
Modeling Pointing Tasks in Mouse-Based Human-Comuter Interactions Stanislav Aranovskiy, Rosane Ushirobira, Denis Efimov, Géry Casiez To cite this version: Stanislav Aranovskiy, Rosane Ushirobira, Denis
More informationUsing a Computational Intelligence Hybrid Approach to Recognize the Faults of Variance Shifts for a Manufacturing Process
Journal of Industrial and Intelligent Information Vol. 4, No. 2, March 26 Using a Comutational Intelligence Hybrid Aroach to Recognize the Faults of Variance hifts for a Manufacturing Process Yuehjen E.
More informationDeriving Indicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V.
Deriving ndicator Direct and Cross Variograms from a Normal Scores Variogram Model (bigaus-full) David F. Machuca Mory and Clayton V. Deutsch Centre for Comutational Geostatistics Deartment of Civil &
More information