Use of PSO in Parameter Estimation of Robot Dynamics; Part One: No Need for Parameterization
|
|
- Sabrina Morrison
- 5 years ago
- Views:
Transcription
1 Use of PSO in Paraeter Estiation of Robot Dynaics; Part One: No Need for Paraeterization Hossein Jahandideh, Mehrzad Navar Abstract Offline procedures for estiating paraeters of robot dynaics are practically based on the paraeterized inverse dynaic odel. In this paper, we present a novel approach to paraeter estiation of robot dynaics which reoves the necessity of paraeterization (i.e. finding the iniu nuber of paraeters fro which the dynaics can be calculated through a linear odel with respect to these paraeters). This offline approach is based on a siple and powerful swar intelligence tool: the particle swar optiization (PSO). In this paper, we discuss and validate the ethod through siulated experients. In Part Two we analyze our ethod in ters of robustness and copare it to robust analytical ethods of estiation. I. INTRODUCTION The inertial and friction paraeters of a robot are norally needed for exact coputed torque control of the robot. There is a wealth of literature on offline ethods of estiating the paraeters of robots' dynaical odel (e.g. [1-4]). However, ost existing research on this subject is based on paraeterization. Exaples of ethods for obtaining the dynaics of a robot can be found in [5]. The basic forulation of a robot s inverse dynaics has the following for [5]: τ = D ( q) q + C( q, q ) q + g( q) + Fsign( q ) + Fq (1) where τ denotes the vector of forces/torques applied to the robot s joints, D is the anipulator inertia atrix, C is the coriolis/centripetal atrix, g is the gravity vector, F c is the coulob friction and F v is the viscous friction. The vector q contains all configuration variables (displaceent for prisatic joints and joint angles for revolute joints). Paraeterization refers to the linear factorization of (1) as: c τ = Y( qqq,, ) α (2) where Y is the linear regressor and α is the set of base paraeters. The base paraeters are the iniu nuber of paraeters that influence the dynaic behavior of the robot. They ay be cobinations of the ass, inertia, friction, and gravity paraeters. An efficient procedure for reaching this factorization is clearly explained in [6]. Such paraeterization akes it possible for analytical ethods to the paraeters. The Least Squares ethod [2, 4], for exaple, which is the ost widely used Mehrzad Navar is a faculty eber of the control systes group in the Electrical Engineering departent at Sharif University of Technology, Tehran, Iran. He received PhD in Control systes in 2001 fro the Grenoble Institute of Technology (INPG) in France. navar@sharif.ir Hossein Jahandideh is a student in the Electrical Engineering departent at Sharif University of Technology, Tehran, Iran ( ) hs.jahan@gail.co v estiation ethod in the literature, depends on linear paraeterization. The goal of this paper is to present a ethod which can the values of the actual physical paraeters (i.e. center-of-ass, inertia paraeters, etc.) rather than the cobinations of the, without getting involved with the paraeterization procedure. This ethod is based on the particle swar optiization (PSO). Swar and evolutionary algoriths are optiization tools that are inspired by natural phenoena. Exaples of swar and evolutionary algoriths and their various applications have been discussed in an orderly anner in [7]. The PSO, in particular, was otivated by the siulation of bird flocking or fish schooling. PSO was first introduced by Kennedy and Eberhart in [8], and analyzed thoroughly by Clerk and Kennedy in [9]. As an optiization technique, PSO found way into nuerous applications throughout the years. Exaples of the applications of PSO in robotics are discussed in [3, 7]. PSO quickly found way into syste identification probles. [10], for exaple, presented a ethod based on artificial neural networks and PSO for the identification of a general dynaical syste. However, in [10] and siilar papers, identification of a syste requires building a odel to predict the input-output behavior of the syste, while in robots, the exact for of the dynaical odel is obtained fro the kineatics of the robot according to [5]. If the kineatics is uncertain, there are ethods to the kineatics; [11] for exaple, presented a PSO approach to the kineatics estiation. This being said, the exact for of a robot s dynaical odel is known, and strong analytical ethods exist that can the values of the paraeters in the odel. Hence, PSO has rarely been used in estiating the dynaical odel paraeters of a robot. However, [3] applies PSO to estiating the dynaical odel paraeters of the first three links of a Staubli RX-60 Robot and copares the ethod to the conventional least squares ethod. In [3], paraeterization is used as a preliinary step to estiating the paraeters through PSO. In this paper, this preliinary step (paraeterization) is reoved, and siulation results are shown to support our ethod. We have siulated the estiation of all paraeters of the three links of a cylindrical robot to deonstrate the siplicity and efficiency of our approach. It is iportant to note that all offline ethods of dynaic odel paraeter estiation utilize experiental saples, thus the way we obtain these saples (i.e. the way we excite our syste to obtain these saples) plays an iportant role in the accuracy and reliability of our estiation. In this paper, we have used PSO not only in the estiation procedure, but also in our trajectory planning.
2 The rest of this paper is arranged as follows: In section II, the PSO algorith is explained. Section III describes how PSO can be used without the preliinary step of paraeterization and section IV notes the advantages of using this ethod. Section V introduces the cylindrical robot and the paraeters to be d. Section VI explains the application of PSO in planning an acceptable excitation trajectory. Section VII is dedicated to a siulated experient. Finally, section VIII concludes the paper. II. PARTICLE SWARM OPTIMIZATION Let ƒ: R n R be the function to be optiized. Without loss of generality, we ll take our objective to be iniization. Objective: iniize ƒ(x) The PSO algorith assigns a swar of k particles to search for the optial solution in an n-diensional space. The starting position of a particle is randoly set within the range of possible solutions to the proble. The range is deterined based on an intuitive guess of the axiu and iniu possible values of each coponent of x, but doesn t need be accurate. Each particle analyzes the function value (ƒ(p)) of its current position (p), and has a eory of its own best experience (Pbest), which is copared to p in each iteration, and is replaced by p if ƒ(p)<ƒ(pbest). Besides its own best experience, each particle has knowledge of the best experience achieved by the entire swar (the global best experience denoted by Gbest). Based on the data each agent has, its oveent in the i-th iteration is deterined by the following forula: V = w. V + C r( Pbest p ) i i i i 1 + Cr( Gbest p ) 2 2 i 1 where V i, P i, Pbest, and Gbest are n-vectors (or siilar objects, such as atrices with n coponents), r 1 and r 2 are rando nubers between 0 and 1, re-generated at each iteration. C 1 and C 2 are constant positive nubers, C 1 is the cognitive learning rate and C 2 is the social learning rate. w i is the inertia weight. The new position of each particle at the i-th iteration is updated by: i i 1 i (3) p = p + V (4) After certain conditions are et, the iterations stop and the Gbest at the latest iteration is taken as the optial solution to the proble. In this paper, we let the PSO algorith end when the nuber of iterations reaches a certain nuber III. PSO IN PARAMETER ESTIMATION OF ROBOT DYNAMICS Each saple we have of the robot dynaics contains the following data: τ, q, q, q, where τ is the n-vector of ( i ) ( i ) ( i ) ( i ) forces/torques, and q is the state of the n joint variables (n is equal to the degrees of freedo of the robot). The index (i) is used for the i-th saple. For each saple, based on the d paraeters and the inverse dynaics odel, a vector ˆ τ can be calculated. Referring to (1), we have: ˆ τ = D ( q ) q + C ( q, q ) q ( i ) est ( i ) ( i ) est ( i ) ( i ) ( i ) + gq ( ) + F signq ( ) + F q c v ( i ) est ( i ) est ( i ) where D est, C est, F vest, and F cest are calculated according to the d paraeters. Thus, for every set of potential s of the paraeters, we have a τ and a ˆ τ. Define e (i) for the i-th saple: ( i ) ( i ) ( i ) (5) e = τ ˆ τ (6) Now define the atrix e for which the i-th colun is e (i) : [... (1) (2) ( N ) ] E = e e e (7) where N is the nuber of saples available. The cost function for the PSO algorith is defined for the atrix E. An analysis of what function to define in this stage is presented in Part Two. In this paper we define the cost function as: f = E (8) ( e ) 2 The objective of the PSO algorith in our estiation task is to find the set of paraeters that iniizes the cost function ƒ. Software for siulating robot dynaics (both sybolic and nueric) are introduced in [12]. The software used in our siulation, is Robotics Toolbox for Matlab [13]. This software, just as any other robotics software, can nuerically and efficiently calculate the inverse dynaics of a robot; eaning that given the kineatics of the robot links, and a set of potential s for the ass, center of ass, inertia, and frictional paraeters, a odel of the robot is siulated which can perfor the inverse dynaics function of the robot. Thus for every set of potential s of the paraeters, a cost function can be calculated via (6-8). If the position of each particle in the PSO swar is defined as an of the robot paraeters, the PSO algorith can find the which iniizes (8). The algorith was prograed in Matlab software: For each particle, the toolbox siulates the inverse dynaics of the robot and uses it on all saples to calculate ˆ τ ( i ); the function value of the particle is then calculated through (6-8); Pbest and Gbest are updated and the next ove is obtained fro (3). As can be seen, this ethod does not require the paraeterization step. IV. ADVANTAGES When the need for paraeterization is oitted, each particle of the PSO swar can directly represent the ass, center of ass, inertia, and frictional paraeters, rather than cobinations of the. This way, a physical insight is given of the characteristics of the robot. When paraeterization is required, the paraeters becoe very coplicated as the degrees of freedo increase. Even if we use software such as ScrewCalculus
3 [14] to accoplish the sybolic paraeterization task, the user ust organize the sybolic paraeters to prepare the for estiation via nueric algoriths, which can be a frustrating task, considering the coplicated sybolic analysis. To the coponents of α (defined in (2)) via a conventional ethod of estiation, the atrix Y ust be encoded. For ore coplicated robots and higher degrees of freedo, Y and α becoe too coplicated for analysis. After the estiation procedure, the robot odel is ready to be used for control purposes, for either odel based or non-odel based control ethods. For control ethods which require only the prediction of the input-output behavior of the odel, a robot can be siulated in the sae software used for estiation, which siulates the input-output behavior of the robot. The identification procedure results in a siulation odel of the robot fro which the D, C, and g atrices defined in (2) can also be calculated by the robot siulation software, given the state of the syste. Thus, control ethods which require calculation of the entioned atrices can also be ipleented after this siple paraeter estiation procedure is carried out. V. THE CYLINDRICAL ROBOT We have used the cylindrical robot in our siulations for siplicity of presentation. The link paraeters of a cylindrical robot are shown in table 1 [4]. TABLE I. THE LINK PARAMETERS OF THE CYLINDRICAL ROBOT link nuber a (i)() α (i)(rad) d (i)() q (i) (i) θ π/2 0 d d 3 The paraeters that constitute the robot dynaics are as follows: s ia is the coponent of the center of ass of the i-th link along its own a-axis (a could be x, y, or z); i is the ass of the i-th link, and I iab is the ab coponent of the oent of inertia of the i-th link about its center of ass. f c and f v are the coulob and viscous frictions respectively. If the links are treated as one diensional figures and the frictional factors are oitted (as they are in [4], and in section VI of this paper), this robot has only 4 identifiable paraeters ( 2, 3, s 3z, and I 1zz +I 2yy +I 3yy ). For a ore realistic siulation, such assuptions have not been ade in section VII of this paper. VI. EXCITATION TRAJECTORY Defining a proper trajectory by which to excite a dynaical syste for sapling purposes, plays an iportant role in the accuracy of the estiation based on the obtained saples. If part of a syste is not excited, the paraeters pertaining to the dynaics of that part will not be identifiable. Siilarly, if part of a syste is insufficiently excited, sall errors on the easureent saples can cause large errors in the d values of the paraeters pertaining to the insufficiently excited syste variables. The excitation trajectory ust be planned in a way that the physical constraints on the syste are observed (if they are not, the planned trajectory will not be executable) and all state variables are properly excited. Much research has been carried out on planning excitation trajectories for robots. Particularly, [15] uses the genetic algorith to obtain an optial trajectory for excitation. In [15], it is atheatically proven that the larger the deterinant of the square atrix W T R v -1 W, the less is the error of our least squares estiation; where R v is the autocorrelation atrix of the error vector τ sa -τ est, and W is built by cobining all the Y (i) obtained fro easureent saples (Y is the regressor defined in (2)). Y Y W = Y ( q1, q 1, q 1) ( q2, q 2, q 2)... ( qn, qn, qn ) When R v is unknown, it can be replaced by the identity atrix, thus the objective of the genetic algorith becoes axiizing the deterinant of the square atrix W T W. H= W T W (10) Objective: Maxiize H Subject to physical constraints on the joint variables A perceivable explanation of this theore is that in order to axiize H, the coponents of the regressor ust be large as well as properly varied, thus the syste states are well excited. Thus, a cognitive hypothesis is that if W is replaced by Q sa as defined below, the obtained trajectory will reain an efficient excitation. If the hypothesis is correct, we can obtain an efficient trajectory without paraeterization. Q sa q q q q q q... q q q q q q q q q... q q q =... q q q q q q... q q n 1n 1n n 2n 2n N 1 N 1 N 1 N 2 N 2 N 2 Nn Nn (9) (11) where q ij is the j-th joint variable of the i-th saple. We replace the genetic algorith by PSO and ust follow the following procedure for obtaining the desired trajectory: 1- Define: q j =a 1j sin(ω 1j t)+ a 2j sin(ω 2j t)+ a 3j sin(ω 3j t) j=1,2,,n (12) (n is the degrees of freedo of the robot.) 2- Define a kj and ω kj as the paraeters deterined by PSO. (6n variables in total)
4 3- Calculate the saples (defined by (12)) at the ties T i ( i = 1,..., N ) and place the inside Q sa. N (T is the sapling tie and N is the nuber of desires saples.) 4- Define : T 40 = ( ).10 (13) Q sa sa H abs Q Q a where a is a binary value, such that it is 0 if all saples eet the physical constraints, and is 1 if any coponent of any saple fails to eet the physical constraints. The function abs denotes the absolute value function. Note that it is possible that none of the saples break the constraints, while the trajectory does break the constraints at soe point in tie. Thus, we ust progra the constraints slightly above their lower liits and slightly below their higher liits. 5- Use the PSO algorith to axiize H Q and deterine the values of a kj and ω kj. (k=1,2,3 j=1,2,,n) We will test our hypothesis through a siulated experient. Consider the exaple of the cylindrical robot. Consider the following constraints to siplify the exaple: 0 q 1 1 q, q 1 j j j ( j = 1,2,3) (14) The starting point for the joint variables is considered to be: (q 1, q 2, q 3 ) = (0.5, 0.5, 0.5) The PSO paraeters of the trajectory planned by the above procedure and two rando trajectories (which eet the constraints) are given in table 2. These trajectories were used as reference trajectories to obtain easureent saples for each. The three sets of saples were affected by the sae noise disturbance. The PSO algorith for paraeter estiation of the robot s dynaics was run 5 ties for each set of saples and the results are copared in table 3. It is seen in table 3 that the estiation derived fro the saples of the obtained trajectory are very close to the real values, even though the saples had errors. The algorith reached the exact sae s in all its 5 runs. For the rando trajectories, we see a large variance in the d values, and the perturbations have caused relatively large errors on the average d values. Our hypothesis is validated by this siulation. This ethod of trajectory planning is used in the next section of this paper and throughout "part two". TABLE II. THE PLANNED AND RANDOM TRAJECTORY PARAMETERS PSO planned trajectory Rando trajectory 1 Rando trajectory 2 a ω a ω a ω a ω a ω a ω a ω a ω a ω TABLE III. ESTIMATED VALUES BASED ON ONE PLANNED TRAJECTORY AND TWO RANDOM TRAJECTORIES Planned Rando 1 Rando 2 Real values average ax-in average ax-in average -s 3z ax-in - s 3z average I 1zz+I 2yy+I 3yy in-ax I 1zz+I 2yy+I 3yy average cost function VII. SIMULATION RESULTS In order to achieve a realistic siulation, all physical paraeters have been considered and d. The trajectory suggested by the PSO algorith (16) is taken as the reference trajectory in our sapling operation. All sapling data have been given a rando error of up to 10% of their total value. The PSO paraeters used in our siulation and the average coputational tie for each run are suarized in table 4. The algorith was run 10 ties; the results are shown in tables 5-9, and the unidentifiable paraeters have been disclosed. A paraeter is classified as unidentifiable if there is too uch variation in its d value. Note that all real values of the robot paraeters and the physical constraints are dictated to the siulated robot; the siulated robot in our experient is not eant to odel a specific counterpart in the real world. TABLE IV. PSO PARAMETERS USED IN SIMULATION AND AVERAGE CPU TIME swar population nuber of c 1, c 2 w i average CPU tie iterations seconds
5 The physical constraints to be observed by the trajectory planning algorith are assued to be as follows: π θ ( ) π, 4 θ ( ) 4, 3 θ ( ) 3 rad rad rad 1 1 s 1 s 2 2 s 2 s 3 3 s 3 2 s 0 d ( ) 1, 2 d ( ) 2, 2 d ( ) 2 0 d ( ) 1, 1.5 d ( ) 1.5, 1 d ( ) 1 The following trajectory was planned for the experient: 1( t ) 2( t ) 3( t ) (15) θ = 0.97 sin(1.15 t) sin(1.1 t) sin(0.42 t) 2.63 d = 0.96sin(0.57 t) sin(2.05 t)-1.1sin(0.12 t) d = -2.3sin(0.07 t) sin(1.5 t) sin(0.38 t) t 10 (16) It is iportant to note that once the unidentifiable paraeters are recognized, in siulating the robot for control or siilar purposes, we are not free to set the values of the unidentifiable paraeters to arbitrary values. As an exaple, in the cylindrical robot, I 1zz, I 2yy, and I 3yy, all are unidentifiable paraeters. The suation of these paraeters, however, is crucial to the robot dynaics. We will define such paraeters as sei-identifiable (SI). Soe paraeters, such as 1 in this exaple, are not copletely absent in a robot s dynaics, but have such little effect that renders it unidentifiable. We will define such paraeters as nearly unidentifiable (NUI). For siulation purposes after paraeter estiation, all SI and NUI paraeters ust be set in accordance with the suggestion of the PSO algorith. In tables 5-7, SI or NUI paraeters have been recognized by the following procedure: A paraeter classified as not identifiable by the PSO database is classified as SI/NUI if the total cost function is affected by the variation of that specific paraeter while all other paraeters are kept unchanged; otherwise the paraeter is classified as unidentifiable. It is difficult to identify whether a paraeter is SI or NUI, but it can usually be said that a relative variation in the d values for the SI paraeters cause larger variation in the cost function than does the sae relative variation in the d value of an NUI paraeter. For further verification, the ean d values (including of the SI, NUI, and UI paraeters) have been used to siulate a second robot (aside fro the siulation representing the real robot) and the following reference trajectory was given to both robots to copare the resulting force/torques and the results are shown in figures 1 to 3: θ 1( t ) = 1.97sin(0.5 t ) sin(2.2t) sin(0.9t)-2.7 d2( t ) = 0.6sin(1.7 t) 0.3sin(1.45 t) sin(0.7 t)-0.06 d3( t ) = 0.4sin(0.3 t) + 0.4sin(1.3 t) sin(1.2 t) t 10 (17) paraeter TABLE V. SIMULATION RESULTS FOR LINK 1 real ean Coefficient ax-in value of status (I, UI, SI) Variation M NUI -s x NUI -s y NUI -s z UI I xx UI I yy UI I zz SI I xy UI I yz UI I xz UI f c SI/NUI f v SI/NUI TABLE VI. SIMULATION RESULTS FOR LINK 2 paraeter real value ean Coefficient of ax-in status (I, UI, SI) Variation M I -s x NUI -s y NUI -s z NUI I xx UI I yy SI I zz UI I xy UI I yz UI I xz UI f c SI/NUI f v SI/NUI TABLE VII. SIMULATION RESULTS FOR LINK 3 paraeter real value ean Coefficient of ax-in status (I, UI, SI) Variation M I -s x I -s y NUI -s z I I xx UI I yy SI I zz UI I xy UI I yz UI I xz UI f c SI/NUI f v I As seen in tables 5-7, unidentifiable paraeters have been recognized and acceptable s of the identifiable paraeters have been given. The d paraeters are verified for being acceptable by the result of a verification siulation (figures 1 to 3). The sae algorith ay be used to the paraeters of any industrial robot, given the robot s link paraeters and saples obtained fro an acceptable (though not necessarily perfect) excitation trajectory. The perforance of the d robot is verified by figures 1 to 3. It is seen that even though soe of the ean estiations in tables 5-7 differ greatly fro their real values, the behavior of the d robot follows closely the behavior of the real robot. This confirs that the paraeters classified as SI/NUI or UI have been correctly discovered.
6 Figure 1. Torque coparison for the verification trajectory; Joint 1. solid line: real robot; dashed line: d robot VIII. CONCLUSION In this paper, a tie-efficient, cost-effective, easily ipleented, and flexible ethod based on particle swar optiization was applied to the paraeter estiation of robot dynaics. As shown through siulation on a cylindrical robot, this ethod is easily executable on any industrial robot with any nuber of degrees of freedo. With this ethod, any user with access to robot siulation software can identify a robot and prepare it for control or other purposes without getting involved with paraeterization. In order to copletely avoid paraeterization, the excitation trajectory was also planned based on a PSO approach which requires only the link paraeters and the physical constraints of the joint variables. In part 2, this ethod of robot paraeter estiation is copared to least squares, total least squares, and robust least squares ethods in ters of robustness toward relatively large errors in the saple data. Figure 2. Torque coparison for the verification trajectory; Joint 2. solid line: real robot; dashed line: d robot Figure 3. Torque coparison for the verification trajectory; Joint 3. solid line: real robot; dashed line: d robot REFERENCES [1] Basilio B. and Aldo C., Identification of Industrial Robot Paraeters for Advanced Model-Based Controllers Design, IEEE International Conference on Robotics and Autoation, p , April [2] Chan S., An Efficient Algorith for Identification of Robot Paraeters Including Drive Characteristics, Journal of Intelligent and Robotic Systes 32: , [3] Bingul Z. and Karahan O., Dynaic identification of Staubli RX-60 robot using PSO and LS ethods, Expert Systes with Applications, Volue 38, [4] Khosla P. and Kanade T., Paraeter Identification of Robot Dynaics, Proc. 24th Conf. Decision and Control, Deceber [5] De Luca A. and Ferrajoli L., A Modified Newton-Euler Method for Dynaic Coputations in Robot Fault Detection and Control, IEEE Intern. Conf. Robotics and Autoation, Kobe, Japan, May 12-17, [6] Gabiccini M., Bracci A., Artoni A., Direct Derivation of the Dynaic Regressors for Serial Manipulators with Mixed Rigid/Elastic Joints XX Congresso AIMETA, Bologna, Italy (2011). [7] Mostajabi T., Poshtan J., Control and Syste Identification via Swar and Evolutionary Algoriths, International Journal of Scientific and Engineering Research Volue 2, Issue 10, October [8] Kennedy J. and Eberhart R., Particle Swar Optiization, Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ. pp , [9] Clerc M. and Kennedy J. The Particle Swar: Explosion, Stability, and Convergence in a Multi-Diensional Coplex Space, IEEE Transactions on Evolution Coputer, 6(1): 58-73, [10] Okar S. and Mudigere D. Non-Linear Dynaical Syste Identification Using Particle Swar Optiization, Proc. Int. Conf. Advances in Control and Optiization of Dynaical Systes, [11] Barati M., Khoogar A., and Nasirian M., Estiation and Calibration of Robot Link Paraeters with Intelligent Techniques, Iranian J. Electrical and Electronic Eng., Volue 7, No. 4, Dec [12] Toz M., Kucuk S., Dynaics Siulation Toolbox for Industrial Robot Manipulators, Coputer Applications in Engineering Education, Volue 18, Issue 2, pages , June [13] Corke P., Robotics TOOLBOX for MATLAB, CSIRO Manufacturing Science and Technology, [14] Gabiccini M., ScrewCalculus: a Matheatica Package for Robotics, DIMNP, University of Pisa, [15] Calafiore G., Indri M., and Bona B., Robot Dynaic Calibration: Optial Excitation Trajectories and Experiental Paraeter Estiation, J. Robotic Systes, Vol. 18, Issue 2, pp , Feb
Support Vector Machine Classification of Uncertain and Imbalanced data using Robust Optimization
Recent Researches in Coputer Science Support Vector Machine Classification of Uncertain and Ibalanced data using Robust Optiization RAGHAV PAT, THEODORE B. TRAFALIS, KASH BARKER School of Industrial Engineering
More informationThe Algorithms Optimization of Artificial Neural Network Based on Particle Swarm
Send Orders for Reprints to reprints@benthascience.ae The Open Cybernetics & Systeics Journal, 04, 8, 59-54 59 Open Access The Algoriths Optiization of Artificial Neural Network Based on Particle Swar
More informationAnalyzing Simulation Results
Analyzing Siulation Results Dr. John Mellor-Cruey Departent of Coputer Science Rice University johnc@cs.rice.edu COMP 528 Lecture 20 31 March 2005 Topics for Today Model verification Model validation Transient
More informationIntroduction to Robotics (CS223A) (Winter 2006/2007) Homework #5 solutions
Introduction to Robotics (CS3A) Handout (Winter 6/7) Hoework #5 solutions. (a) Derive a forula that transfors an inertia tensor given in soe frae {C} into a new frae {A}. The frae {A} can differ fro frae
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationInteractive Markov Models of Evolutionary Algorithms
Cleveland State University EngagedScholarship@CSU Electrical Engineering & Coputer Science Faculty Publications Electrical Engineering & Coputer Science Departent 2015 Interactive Markov Models of Evolutionary
More informationMSEC MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL SOLUTION FOR MAINTENANCE AND PERFORMANCE
Proceeding of the ASME 9 International Manufacturing Science and Engineering Conference MSEC9 October 4-7, 9, West Lafayette, Indiana, USA MSEC9-8466 MODELING OF DEGRADATION PROCESSES TO OBTAIN AN OPTIMAL
More informationExperimental Design For Model Discrimination And Precise Parameter Estimation In WDS Analysis
City University of New York (CUNY) CUNY Acadeic Works International Conference on Hydroinforatics 8-1-2014 Experiental Design For Model Discriination And Precise Paraeter Estiation In WDS Analysis Giovanna
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lessons 7 20 Dec 2017 Outline Artificial Neural networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationUfuk Demirci* and Feza Kerestecioglu**
1 INDIRECT ADAPTIVE CONTROL OF MISSILES Ufuk Deirci* and Feza Kerestecioglu** *Turkish Navy Guided Missile Test Station, Beykoz, Istanbul, TURKEY **Departent of Electrical and Electronics Engineering,
More informationIntelligent Systems: Reasoning and Recognition. Artificial Neural Networks
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley MOSIG M1 Winter Seester 2018 Lesson 7 1 March 2018 Outline Artificial Neural Networks Notation...2 Introduction...3 Key Equations... 3 Artificial
More informationIN modern society that various systems have become more
Developent of Reliability Function in -Coponent Standby Redundant Syste with Priority Based on Maxiu Entropy Principle Ryosuke Hirata, Ikuo Arizono, Ryosuke Toohiro, Satoshi Oigawa, and Yasuhiko Takeoto
More informationSymbolic Analysis as Universal Tool for Deriving Properties of Non-linear Algorithms Case study of EM Algorithm
Acta Polytechnica Hungarica Vol., No., 04 Sybolic Analysis as Universal Tool for Deriving Properties of Non-linear Algoriths Case study of EM Algorith Vladiir Mladenović, Miroslav Lutovac, Dana Porrat
More informationCh 12: Variations on Backpropagation
Ch 2: Variations on Backpropagation The basic backpropagation algorith is too slow for ost practical applications. It ay take days or weeks of coputer tie. We deonstrate why the backpropagation algorith
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationUsing EM To Estimate A Probablity Density With A Mixture Of Gaussians
Using EM To Estiate A Probablity Density With A Mixture Of Gaussians Aaron A. D Souza adsouza@usc.edu Introduction The proble we are trying to address in this note is siple. Given a set of data points
More informationMulti-Dimensional Hegselmann-Krause Dynamics
Multi-Diensional Hegselann-Krause Dynaics A. Nedić Industrial and Enterprise Systes Engineering Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu B. Touri Coordinated Science Laboratory
More informationPh 20.3 Numerical Solution of Ordinary Differential Equations
Ph 20.3 Nuerical Solution of Ordinary Differential Equations Due: Week 5 -v20170314- This Assignent So far, your assignents have tried to failiarize you with the hardware and software in the Physics Coputing
More informationKernel Methods and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley ENSIAG 2 / osig 1 Second Seester 2012/2013 Lesson 20 2 ay 2013 Kernel ethods and Support Vector achines Contents Kernel Functions...2 Quadratic
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationBayes Decision Rule and Naïve Bayes Classifier
Bayes Decision Rule and Naïve Bayes Classifier Le Song Machine Learning I CSE 6740, Fall 2013 Gaussian Mixture odel A density odel p(x) ay be ulti-odal: odel it as a ixture of uni-odal distributions (e.g.
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationDepartment of Electronic and Optical Engineering, Ordnance Engineering College, Shijiazhuang, , China
6th International Conference on Machinery, Materials, Environent, Biotechnology and Coputer (MMEBC 06) Solving Multi-Sensor Multi-Target Assignent Proble Based on Copositive Cobat Efficiency and QPSO Algorith
More informatione-companion ONLY AVAILABLE IN ELECTRONIC FORM
OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer
More informationESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS. A Thesis. Presented to. The Faculty of the Department of Mathematics
ESTIMATING AND FORMING CONFIDENCE INTERVALS FOR EXTREMA OF RANDOM POLYNOMIALS A Thesis Presented to The Faculty of the Departent of Matheatics San Jose State University In Partial Fulfillent of the Requireents
More informationPattern Recognition and Machine Learning. Artificial Neural networks
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2016 Lessons 7 14 Dec 2016 Outline Artificial Neural networks Notation...2 1. Introduction...3... 3 The Artificial
More informationExplicit Approximate Solution for Finding the. Natural Frequency of the Motion of Pendulum. by Using the HAM
Applied Matheatical Sciences Vol. 3 9 no. 1 13-13 Explicit Approxiate Solution for Finding the Natural Frequency of the Motion of Pendulu by Using the HAM Ahad Doosthoseini * Mechanical Engineering Departent
More informationSPECTRUM sensing is a core concept of cognitive radio
World Acadey of Science, Engineering and Technology International Journal of Electronics and Counication Engineering Vol:6, o:2, 202 Efficient Detection Using Sequential Probability Ratio Test in Mobile
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More information(6) B NN (x, k) = Tp 2 M 1
MMAR 26 12th IEEE International Conference on Methods and Models in Autoation and Robotics 28-31 August 26 Międzyzdroje, Poland Synthesis of Sliding Mode Control of Robot with Neural Networ Model Jaub
More informationREDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION
ISSN 139 14X INFORMATION TECHNOLOGY AND CONTROL, 008, Vol.37, No.3 REDUCTION OF FINITE ELEMENT MODELS BY PARAMETER IDENTIFICATION Riantas Barauskas, Vidantas Riavičius Departent of Syste Analysis, Kaunas
More informationExtension of CSRSM for the Parametric Study of the Face Stability of Pressurized Tunnels
Extension of CSRSM for the Paraetric Study of the Face Stability of Pressurized Tunnels Guilhe Mollon 1, Daniel Dias 2, and Abdul-Haid Soubra 3, M.ASCE 1 LGCIE, INSA Lyon, Université de Lyon, Doaine scientifique
More informationA Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness
A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,
More informationModel Fitting. CURM Background Material, Fall 2014 Dr. Doreen De Leon
Model Fitting CURM Background Material, Fall 014 Dr. Doreen De Leon 1 Introduction Given a set of data points, we often want to fit a selected odel or type to the data (e.g., we suspect an exponential
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationNonmonotonic Networks. a. IRST, I Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I Povo (Trento) Italy
Storage Capacity and Dynaics of Nononotonic Networks Bruno Crespi a and Ignazio Lazzizzera b a. IRST, I-38050 Povo (Trento) Italy, b. Univ. of Trento, Physics Dept., I-38050 Povo (Trento) Italy INFN Gruppo
More informationSharp Time Data Tradeoffs for Linear Inverse Problems
Sharp Tie Data Tradeoffs for Linear Inverse Probles Saet Oyak Benjain Recht Mahdi Soltanolkotabi January 016 Abstract In this paper we characterize sharp tie-data tradeoffs for optiization probles used
More informationProbability Distributions
Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples
More informationPattern Recognition and Machine Learning. Learning and Evaluation for Pattern Recognition
Pattern Recognition and Machine Learning Jaes L. Crowley ENSIMAG 3 - MMIS Fall Seester 2017 Lesson 1 4 October 2017 Outline Learning and Evaluation for Pattern Recognition Notation...2 1. The Pattern Recognition
More informationHybrid System Identification: An SDP Approach
49th IEEE Conference on Decision and Control Deceber 15-17, 2010 Hilton Atlanta Hotel, Atlanta, GA, USA Hybrid Syste Identification: An SDP Approach C Feng, C M Lagoa, N Ozay and M Sznaier Abstract The
More informationAn Approximate Model for the Theoretical Prediction of the Velocity Increase in the Intermediate Ballistics Period
An Approxiate Model for the Theoretical Prediction of the Velocity... 77 Central European Journal of Energetic Materials, 205, 2(), 77-88 ISSN 2353-843 An Approxiate Model for the Theoretical Prediction
More informationAutomatic Calibration of HEC-HMS Model Using Multi-Objective Fuzzy Optimal Models
Civil Engineering Infrastructures Journal, 47(1): 1 12, June 214 ISS: 2322 293 Autoatic Calibration of HEC-HMS Model Using Multi-Objective Fuzzy Optial Models Kaali, B. 1 and Mousavi, S.J. 2* 1 PhD. Student,
More informationOn Constant Power Water-filling
On Constant Power Water-filling Wei Yu and John M. Cioffi Electrical Engineering Departent Stanford University, Stanford, CA94305, U.S.A. eails: {weiyu,cioffi}@stanford.edu Abstract This paper derives
More informationAn Adaptive UKF Algorithm for the State and Parameter Estimations of a Mobile Robot
Vol. 34, No. 1 ACTA AUTOMATICA SINICA January, 2008 An Adaptive UKF Algorith for the State and Paraeter Estiations of a Mobile Robot SONG Qi 1, 2 HAN Jian-Da 1 Abstract For iproving the estiation accuracy
More informationOn the Analysis of the Quantum-inspired Evolutionary Algorithm with a Single Individual
6 IEEE Congress on Evolutionary Coputation Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-1, 6 On the Analysis of the Quantu-inspired Evolutionary Algorith with a Single Individual
More informationACTIVE VIBRATION CONTROL FOR STRUCTURE HAVING NON- LINEAR BEHAVIOR UNDER EARTHQUAKE EXCITATION
International onference on Earthquae Engineering and Disaster itigation, Jaarta, April 14-15, 8 ATIVE VIBRATION ONTROL FOR TRUTURE HAVING NON- LINEAR BEHAVIOR UNDER EARTHQUAE EXITATION Herlien D. etio
More informationGenetic Quantum Algorithm and its Application to Combinatorial Optimization Problem
Genetic Quantu Algorith and its Application to Cobinatorial Optiization Proble Kuk-Hyun Han Dept. of Electrical Engineering, KAIST, 373-, Kusong-dong Yusong-gu Taejon, 305-70, Republic of Korea khhan@vivaldi.kaist.ac.kr
More informationOptical Properties of Plasmas of High-Z Elements
Forschungszentru Karlsruhe Techni und Uwelt Wissenschaftlishe Berichte FZK Optical Properties of Plasas of High-Z Eleents V.Tolach 1, G.Miloshevsy 1, H.Würz Project Kernfusion 1 Heat and Mass Transfer
More informationUsing a De-Convolution Window for Operating Modal Analysis
Using a De-Convolution Window for Operating Modal Analysis Brian Schwarz Vibrant Technology, Inc. Scotts Valley, CA Mark Richardson Vibrant Technology, Inc. Scotts Valley, CA Abstract Operating Modal Analysis
More informationWall Juggling of one Ball by Robot Manipulator with Visual Servo
Juggling of one Ball by obot Manipulator with Visual Servo Akira Nakashia Yosuke Kobayashi Yoshikazu Hayakawa Mechanical Science and Engineering, Graduate School of Engineering, Nagoya University, Furo-cho,
More informationUse of PSO in Parameter Estimation of Robot Dynamics; Part Two: Robustness
Ue of PSO in Paraeter Etiation of Robot Dynaic; Part Two: Robutne Hoein Jahandideh, Mehrzad Navar Abtract In thi paper, we analyze the robutne of the PSO-baed approach to paraeter etiation of robot dynaic
More informationThis model assumes that the probability of a gap has size i is proportional to 1/i. i.e., i log m e. j=1. E[gap size] = i P r(i) = N f t.
CS 493: Algoriths for Massive Data Sets Feb 2, 2002 Local Models, Bloo Filter Scribe: Qin Lv Local Models In global odels, every inverted file entry is copressed with the sae odel. This work wells when
More informationE0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis
E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds
More informationPhysically Based Modeling CS Notes Spring 1997 Particle Collision and Contact
Physically Based Modeling CS 15-863 Notes Spring 1997 Particle Collision and Contact 1 Collisions with Springs Suppose we wanted to ipleent a particle siulator with a floor : a solid horizontal plane which
More informationTEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES
TEST OF HOMOGENEITY OF PARALLEL SAMPLES FROM LOGNORMAL POPULATIONS WITH UNEQUAL VARIANCES S. E. Ahed, R. J. Tokins and A. I. Volodin Departent of Matheatics and Statistics University of Regina Regina,
More informationAnalysis of Impulsive Natural Phenomena through Finite Difference Methods A MATLAB Computational Project-Based Learning
Analysis of Ipulsive Natural Phenoena through Finite Difference Methods A MATLAB Coputational Project-Based Learning Nicholas Kuia, Christopher Chariah, Mechatronics Engineering, Vaughn College of Aeronautics
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationProc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES
Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co
More informationChapter 1: Basics of Vibrations for Simple Mechanical Systems
Chapter 1: Basics of Vibrations for Siple Mechanical Systes Introduction: The fundaentals of Sound and Vibrations are part of the broader field of echanics, with strong connections to classical echanics,
More informationInspection; structural health monitoring; reliability; Bayesian analysis; updating; decision analysis; value of information
Cite as: Straub D. (2014). Value of inforation analysis with structural reliability ethods. Structural Safety, 49: 75-86. Value of Inforation Analysis with Structural Reliability Methods Daniel Straub
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationTHE KALMAN FILTER: A LOOK BEHIND THE SCENE
HE KALMA FILER: A LOOK BEHID HE SCEE R.E. Deain School of Matheatical and Geospatial Sciences, RMI University eail: rod.deain@rit.edu.au Presented at the Victorian Regional Survey Conference, Mildura,
More informationTopic 5a Introduction to Curve Fitting & Linear Regression
/7/08 Course Instructor Dr. Rayond C. Rup Oice: A 337 Phone: (95) 747 6958 E ail: rcrup@utep.edu opic 5a Introduction to Curve Fitting & Linear Regression EE 4386/530 Coputational ethods in EE Outline
More informationAlgorithms for parallel processor scheduling with distinct due windows and unit-time jobs
BULLETIN OF THE POLISH ACADEMY OF SCIENCES TECHNICAL SCIENCES Vol. 57, No. 3, 2009 Algoriths for parallel processor scheduling with distinct due windows and unit-tie obs A. JANIAK 1, W.A. JANIAK 2, and
More informationDESIGN OF THE DIE PROFILE FOR THE INCREMENTAL RADIAL FORGING PROCESS *
IJST, Transactions of Mechanical Engineering, Vol. 39, No. M1, pp 89-100 Printed in The Islaic Republic of Iran, 2015 Shira University DESIGN OF THE DIE PROFILE FOR THE INCREMENTAL RADIAL FORGING PROCESS
More informationASSUME a source over an alphabet size m, from which a sequence of n independent samples are drawn. The classical
IEEE TRANSACTIONS ON INFORMATION THEORY Large Alphabet Source Coding using Independent Coponent Analysis Aichai Painsky, Meber, IEEE, Saharon Rosset and Meir Feder, Fellow, IEEE arxiv:67.7v [cs.it] Jul
More information2.003 Engineering Dynamics Problem Set 2 Solutions
.003 Engineering Dynaics Proble Set Solutions This proble set is priarily eant to give the student practice in describing otion. This is the subject of kineatics. It is strongly recoended that you study
More informationWarning System of Dangerous Chemical Gas in Factory Based on Wireless Sensor Network
565 A publication of CHEMICAL ENGINEERING TRANSACTIONS VOL. 59, 07 Guest Editors: Zhuo Yang, Junie Ba, Jing Pan Copyright 07, AIDIC Servizi S.r.l. ISBN 978-88-95608-49-5; ISSN 83-96 The Italian Association
More informationDetection and Estimation Theory
ESE 54 Detection and Estiation Theory Joseph A. O Sullivan Sauel C. Sachs Professor Electronic Systes and Signals Research Laboratory Electrical and Systes Engineering Washington University 11 Urbauer
More informationare equal to zero, where, q = p 1. For each gene j, the pairwise null and alternative hypotheses are,
Page of 8 Suppleentary Materials: A ultiple testing procedure for ulti-diensional pairwise coparisons with application to gene expression studies Anjana Grandhi, Wenge Guo, Shyaal D. Peddada S Notations
More informationRandomized Recovery for Boolean Compressed Sensing
Randoized Recovery for Boolean Copressed Sensing Mitra Fatei and Martin Vetterli Laboratory of Audiovisual Counication École Polytechnique Fédéral de Lausanne (EPFL) Eail: {itra.fatei, artin.vetterli}@epfl.ch
More informationRobustness Experiments for a Planar Hopping Control System
To appear in International Conference on Clibing and Walking Robots Septeber 22 Robustness Experients for a Planar Hopping Control Syste Kale Harbick and Gaurav S. Sukhate kale gaurav@robotics.usc.edu
More informationThe accelerated expansion of the universe is explained by quantum field theory.
The accelerated expansion of the universe is explained by quantu field theory. Abstract. Forulas describing interactions, in fact, use the liiting speed of inforation transfer, and not the speed of light.
More informationMODIFICATION OF AN ANALYTICAL MODEL FOR CONTAINER LOADING PROBLEMS
MODIFICATIO OF A AALYTICAL MODEL FOR COTAIER LOADIG PROBLEMS Reception date: DEC.99 otification to authors: 04 MAR. 2001 Cevriye GECER Departent of Industrial Engineering, University of Gazi 06570 Maltepe,
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationFigure 1: Equivalent electric (RC) circuit of a neurons membrane
Exercise: Leaky integrate and fire odel of neural spike generation This exercise investigates a siplified odel of how neurons spike in response to current inputs, one of the ost fundaental properties of
More informationAccuracy of the Scaling Law for Experimental Natural Frequencies of Rectangular Thin Plates
The 9th Conference of Mechanical Engineering Network of Thailand 9- October 005, Phuket, Thailand Accuracy of the caling Law for Experiental Natural Frequencies of Rectangular Thin Plates Anawat Na songkhla
More informationCS Lecture 13. More Maximum Likelihood
CS 6347 Lecture 13 More Maxiu Likelihood Recap Last tie: Introduction to axiu likelihood estiation MLE for Bayesian networks Optial CPTs correspond to epirical counts Today: MLE for CRFs 2 Maxiu Likelihood
More informationEstimating Parameters for a Gaussian pdf
Pattern Recognition and achine Learning Jaes L. Crowley ENSIAG 3 IS First Seester 00/0 Lesson 5 7 Noveber 00 Contents Estiating Paraeters for a Gaussian pdf Notation... The Pattern Recognition Proble...3
More informationCOULD A VARIABLE MASS OSCILLATOR EXHIBIT THE LATERAL INSTABILITY?
Kragujevac J. Sci. 3 (8) 3-44. UDC 53.35 3 COULD A VARIABLE MASS OSCILLATOR EXHIBIT THE LATERAL INSTABILITY? Nebojša Danilović, Milan Kovačević and Vukota Babović Institute of Physics, Faculty of Science,
More informationSupplementary Information for Design of Bending Multi-Layer Electroactive Polymer Actuators
Suppleentary Inforation for Design of Bending Multi-Layer Electroactive Polyer Actuators Bavani Balakrisnan, Alek Nacev, and Elisabeth Sela University of Maryland, College Park, Maryland 074 1 Analytical
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More informationEMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS
EMPIRICAL COMPLEXITY ANALYSIS OF A MILP-APPROACH FOR OPTIMIZATION OF HYBRID SYSTEMS Jochen Till, Sebastian Engell, Sebastian Panek, and Olaf Stursberg Process Control Lab (CT-AST), University of Dortund,
More informationActuators & Mechanisms Actuator sizing
Course Code: MDP 454, Course Nae:, Second Seester 2014 Actuators & Mechaniss Actuator sizing Contents - Modelling of Mechanical Syste - Mechaniss and Drives The study of Mechatronics systes can be divided
More informationŞtefan ŞTEFĂNESCU * is the minimum global value for the function h (x)
7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not
More informationSupplementary to Learning Discriminative Bayesian Networks from High-dimensional Continuous Neuroimaging Data
Suppleentary to Learning Discriinative Bayesian Networks fro High-diensional Continuous Neuroiaging Data Luping Zhou, Lei Wang, Lingqiao Liu, Philip Ogunbona, and Dinggang Shen Proposition. Given a sparse
More informationA method to determine relative stroke detection efficiencies from multiplicity distributions
A ethod to deterine relative stroke detection eiciencies ro ultiplicity distributions Schulz W. and Cuins K. 2. Austrian Lightning Detection and Inoration Syste (ALDIS), Kahlenberger Str.2A, 90 Vienna,
More informationData-Driven Imaging in Anisotropic Media
18 th World Conference on Non destructive Testing, 16- April 1, Durban, South Africa Data-Driven Iaging in Anisotropic Media Arno VOLKER 1 and Alan HUNTER 1 TNO Stieltjesweg 1, 6 AD, Delft, The Netherlands
More informationNUMERICAL MODELLING OF THE TYRE/ROAD CONTACT
NUMERICAL MODELLING OF THE TYRE/ROAD CONTACT PACS REFERENCE: 43.5.LJ Krister Larsson Departent of Applied Acoustics Chalers University of Technology SE-412 96 Sweden Tel: +46 ()31 772 22 Fax: +46 ()31
More informationBootstrapping Dependent Data
Bootstrapping Dependent Data One of the key issues confronting bootstrap resapling approxiations is how to deal with dependent data. Consider a sequence fx t g n t= of dependent rando variables. Clearly
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More informationAn Inverse Interpolation Method Utilizing In-Flight Strain Measurements for Determining Loads and Structural Response of Aerospace Vehicles
An Inverse Interpolation Method Utilizing In-Flight Strain Measureents for Deterining Loads and Structural Response of Aerospace Vehicles S. Shkarayev and R. Krashantisa University of Arizona, Tucson,
More informationBIVARIATE NONCENTRAL DISTRIBUTIONS: AN APPROACH VIA THE COMPOUNDING METHOD
South African Statist J 06 50, 03 03 BIVARIATE NONCENTRAL DISTRIBUTIONS: AN APPROACH VIA THE COMPOUNDING METHOD Johan Ferreira Departent of Statistics, Faculty of Natural and Agricultural Sciences, University
More informationBoosting with log-loss
Boosting with log-loss Marco Cusuano-Towner Septeber 2, 202 The proble Suppose we have data exaples {x i, y i ) i =... } for a two-class proble with y i {, }. Let F x) be the predictor function with the
More informationAn improved self-adaptive harmony search algorithm for joint replenishment problems
An iproved self-adaptive harony search algorith for joint replenishent probles Lin Wang School of Manageent, Huazhong University of Science & Technology zhoulearner@gail.co Xiaojian Zhou School of Manageent,
More informationarxiv: v1 [math.na] 10 Oct 2016
GREEDY GAUSS-NEWTON ALGORITHM FOR FINDING SPARSE SOLUTIONS TO NONLINEAR UNDERDETERMINED SYSTEMS OF EQUATIONS MÅRTEN GULLIKSSON AND ANNA OLEYNIK arxiv:6.395v [ath.na] Oct 26 Abstract. We consider the proble
More informationXI PHYSICS M. AFFAN KHAN LECTURER PHYSICS, AKHSS, K. https://promotephysics.wordpress.com
XI PHYSICS M. AFFAN KHAN LECTURER PHYSICS, AKHSS, K affan_414@live.co https://prootephysics.wordpress.co [MOTION] CHAPTER NO. 3 In this chapter we are going to discuss otion in one diension in which we
More informationAsynchronous Gossip Algorithms for Stochastic Optimization
Asynchronous Gossip Algoriths for Stochastic Optiization S. Sundhar Ra ECE Dept. University of Illinois Urbana, IL 680 ssrini@illinois.edu A. Nedić IESE Dept. University of Illinois Urbana, IL 680 angelia@illinois.edu
More informationComparison of null-space and minimal null-space control algorithms Bojan Nemec, Leon Žlajpah and Damir Omrčen
Robotica (27) volue 25, pp. 5 52. 27 Cabridge University Press doi:.7/s26357477342 Printed in the United Kingdo Coparison of null-space and inial null-space control algoriths Bojan Neec, Leon Žlajpah and
More information