Gene library based Resource Allocation in Time Sensitive Large Scale Networked Control Systems. Preliminary Exam Presentation Unnati Ojha
|
|
- Merilyn Stafford
- 6 years ago
- Views:
Transcription
1 Gene lbrary based Resource Allocaton n Tme Senstve Large Scale Networked Control Systems Prelmnary Exam Presentaton Unnat Ojha ADAC Lab, NCSU
2 Outlne Objectves, Motvaton System Descrpton Gene Lbrary Bologcal Background Formulaton Adaptve Bandwdth Management Formulaton Analytcal Soluton usng Lagrange Multplers Results Case Study Gene Lbrary based Bandwdth Allocaton for Intellgent Transportaton System Concluson and Future Work
3 Objectve and Motvaton Objectve: To develop a real-tme resource allocaton algorthm based on a gene lbrary for large scale networked control system such as the ntellgent transportaton system To ntroduce Artfcal Immune System based update algorthms n order to tune the gene lbrary Motvaton In large scale network control systems wth hard real-tme constrants, such as the ntellgent transportaton system, bandwdth s a lmted resource that should be allocated effcently accordng to the need of the vehcles, thus t s necessary to develop a real tme bandwdth allocaton algorthm Study on extracton of relevant features that ndcate the rsk/abnormal behavor n large scale systems can reduce the dmensonalty of the problem ADAC Lab, NCSU 3
4 System Descrpton Local Agents Envronment Sensor Agents Supervsory Agent wth Bandwdth Constrant ADAC Lab, NCSU 4
5 System Descrpton d Local Agents x ( x u ) f ( ) x u f ( ) th,, Dynamcs for of agent,,, n,,, m d = f t + = th = Dsturbance on agent T T = x x x = T th State varables of agent = u u u = T T T x = x x xn = y U ( y y ) th Input varables for agent State varables from every agent th = hx ( x, u ) = Measurement vector from agent ψ Envronmental Sensor Agents l L th :, ref, u = Local controller for agent T th j =,,,..., j j j, L = State varables of envronmental agent E E E E j j T T T T E = E, E..., E N = State varables from all envronmental agents E q th j = he ( E j ) = Measurements from j envronmental agent ADAC Lab, NCSU 5
6 System Descrpton Bandwdth constrant expressed as a samplng rate assgnment problem max Supervsory Agent F ( t)( samples / sec) = ς B ( t)( bts / sec), ς = D( samples / packet) Q ( bts / packet) total supervsory agent wll use a mult-rate samplng technque to perform smart samplng n order to conserve bandwdth T T T T T T Yk = y, k, y, k,..., y N, k, q, k, q, k..., q N, Data from local agents E k = Z = f, = Selectve samplng of avalable data τ ( τ Y ) k + k k = τ, τ,.. τ = Samplng rates for each agent E k, k, k N + N, k T max T ADAC Lab, NCSU 6
7 System Descrpton Relevant measurement for each agent Z N th ( N Z ), k, k k, k = f, = Measurement vector assocated wth agent = th Neghborhood of agent Decsons from supervsory agent ( Z L) G : ψ, τ = samplng rate assgnment τ k L = Gene Lbrary k ADAC Lab, NCSU 7
8 Outlne Objectves, Motvaton System Descrpton Gene Lbrary Bologcal Background Formulaton Optmal Adaptve Bandwdth Management Formulaton Analytcal Soluton usng Lagrange Multplers Results Case Study Gene Lbrary based Bandwdth Allocaton for Intellgent Transportaton System Concluson and Future Work 8
9 Bologcal Background Gene a locatable regon of genomc sequence, correspondng to a unt of nhertance, whch s assocated wth regulatory regons, transcrbed regons, and or other functonal sequence regons Phenotype: The set of observable characterstcs of an ndvdual resultng from the nteracton of ts genotype wth envronment. E.g. eye color, blood type, har type, Genotype: The genetc code carred by all lvng organsms, that holds the crtcal nstructons that are used and nterpreted by the cellular machnery to produce the or Phenotype of the ndvdual. ADAC Lab, NCSU 9
10 Bologcal Background For every phenotypc trat, there s a specfc genotype that encodes t. A genotype may contan the transcrbed regon from one or more genes Genotypes FfBb Ffbb ffbb ffbb ffbb FFBb FFbb FfBB FFBB Proten Phenotypes Dark Blue Dark Blue Lght Blue Lght Blue Pale blue Brown Brown Brown Dark brown Sturm, R.A. & Frudaks, T.N. Eye colour: portals nto pgmentaton genes and ancestry. Trends n Genet., (4) ADAC Lab, NCSU
11 Bologcal Background Allele: An allele s a vable DNA (deoxyrbonuclec acd) codng that occupes a gven poston (gene) on a chromosome. It s one of two or more versons of a gene(s) *Image from ADAC Lab, NCSU
12 Bologcal Background Gene Expresson: process by whch nformaton from a gene s used n the synthess of a functonal gene product whch results n some phenotypc trat. Lbrary of genes wth actvaton nstructons Mappng from genetc code to proten Transcrpton: Process of actvaton of a gene and creaton a complmentary copy of a the DNA sequence n the transcrbed porton of the gene. Translaton: Process of decodng the transcrbed genetc code to create protens ADAC Lab, NCSU
13 What s a gene lbrary? Database, mappng Set that contans the genotypes that map the relevant varatons n a phenotypc trat Phenotypc trat system behavor of nterest (e.g. facal expresson) Genotypes Genes: lp shape, eyebrow shape 9 genotypes to represent 9 dfferent scenaros Relevant varatons Happy, sad, angry, others 3
14 Formaton of Gene Lbrary Input Space (Y): Data avalable to the system Y = {y, y, y 3,, y N } = Gene Pool Allele (λ ): The value of a th gene n the Gene Pool for an agent Genome of an ndvdual (Λ): The values of all genes for an ndvdual = [λ, λ λ N ] T Domnant genes (G d ) For specfc phenotypc trat, Φ G d = {g d,, g d,, g d,nd } G d Y Selecton of features usng PCA, kernel-pca, expert system etc Genotype (for Φ) Vector of actual values for domnant genes of Φ = [λ d,, λ d, λ d,nd ] T ADAC Lab, NCSU 4
15 Formaton of Gene Lbrary Genotype Phenotype Map (GP-Map): A -tuple that contans actvator protens to express the genotype and maps the genotype to the phenotypc trat assocated wth t ζ = ( π,m ), π = Actvator/Supressor protens T [ π, π, π,..., π ], π {, } = 3 M = mappng from transcrbed genes λ ρ d, j j N to smple protens ( M, M,..., M ), M : f ( λ, ) = = = d th An Allele of domnant gene N j j d j j j Smple proten produced by the mappng Output of the GP-Map s a complex proten that partly/fully expresses the phenotypc trat ϒ = complex proten produced by the mappng = ρ ρ j ADAC Lab, NCSU 5
16 Formaton of Gene Lbrary If a phenotype needs to be expressed usng m protens Φ = w ϒ + wϒ wmϒm, w = normalzaton weght for each proten Gene Lbrary: Collecton of GP-Maps L = { ζ }, ζ..., ζ SL ADAC Lab, NCSU 6
17 Smple Example sn( x) sn( x) cos( y) cos ( y) y ([ ],sn( gd )) ([ ],sn( gd ),cos( gd )) Let Gene Pool = (w, x, y, z), and Φ = + + ζ = ζ, =,, cos ( g,) d ζ 3 = [ ], g d, ADAC Lab, NCSU 7
18 Outlne Objectves, Motvaton System Descrpton Gene Lbrary Bologcal Background Formulaton Optmal Adaptve Bandwdth Allocaton Formulaton Analytcal Soluton usng Lagrange Multplers Results Case Study Gene Lbrary based Bandwdth Allocaton for Intellgent Transportaton System Concluson and Future Work 8
19 Optmal Adaptve Samplng N Total number of vehcles τ τ mn τ max Samplng tme for vehcle,τ mn τ τ max Mnmum allowable samplng tme. Maxmum allowable samplng tme. Data from each vehcle should be sampled at least once wthn τ max α L BW BW T τ w αn The actual rsk measure for vehcle Length of the data packet sent from the vehcle to the supervsor Bandwdth allocated for vehcle Total bandwdth avalable for the network Samplng wndow: The samplng rates are updated every seconds The number of samples of vehcle n the update nterval The average rsk of vehcle over samplng wndow ADAC Lab, NCSU 9
20 Objectve To selectvely sample data from the vehcles under the bandwdth constrant such that the changes n the rsk s accurately captured n order to reconstruct the rsk sgnal ADAC Lab, NCSU
21 Objectve Mathematcally, Prortzaton by rsk Bandwdth Constrant = ( k + ) τ J = α α ( t) α ( kτ ) dt s. t. N N n = k = kτ BW where, BW BW T L τ w =, n = τ τ Error between the reconstructed and orgnal sgnal Samplng tme to bandwdth converson Select the samplng tmes τ to mnmze the cost J ADAC Lab, NCSU
22 Objectve Functon Smplfcaton by usng Taylor Seres Expanson N n ( k + ) τ J = α α( kτ ) + α( kτ )( t kτ ) + H. OT. α( kτ ) dt = k = kτ N n ( k + ) τ N n ( k + ) τ J α α( kτ )( t kτ ) dt = α α( kτ ) ( t kτ ) dt = k = kτ = k = kτ N n ( k + ) τ N n 3 τ α ( α( τ )) ( τ ) α ( α( τ )) = k = kττ 3 = k = J k t k dt = k J k = J 3 N n 3 α τ ( α( τ )) approx = k = dα = dα =6 dα = 3 Cost (J approx ) Cost (J approx ) Cost (J approx ) Rsk (α) samplng tme (τ) (s) Rsk (α).5.5 samplng tme (τ) (s).5 Rsk (α).5.5 samplng tme (τ) (s) ADAC Lab, NCSU
23 Solvng Optmzaton usng Lagrange Multplers n By replacng ( ) wth and notcng that s the n α ( kτ ) ( n n ( k ) ) k = n α τ ( ( k ) ) k = n α τ k = average of α ( t) over τ w : Consderng n τ w, τ J N 3 approx = α τ n α 3 = Thus we can represent our optmzaton problem as: J τ α τ α N approx = w 3 = mn J s. t. N L w = = BW BW BW, BW = BW mn T = where, L BW =, w = α α N τ ADAC Lab, NCSU 3
24 Usng Lagrange Multplers Changng nequaltes to equaltes where, N N L w ' 3 =,.. ' = T mn = ( BW ) = mn J s t BW BW N BW BW = BW + BW mn ' The lagrangan thus becomes To fnd the optmal pont, we have L BW L w ' ' 3 ( BW ) = + λ = L = = N ' ( BW ) ( BWT N BWmn ) λ = λ = L N 3 ( BW N BW ) Thus, optmal bandwdth s gven as 3 * ( BW ) = BWmn + ( BWT N BWmn ) N 3 w = where w = α α w T = = N N L w λ ' = ( BW ) = ' L = + BW ( BWT N BWmn ) 3 mn 3 w ' BW = ( BWT N BWmn ) N 3 w w α BW (porton of total bandwdth) 5 5 dα 5 α α dα dα BW = - BW 3 4 ADAC Lab, NCSU 4
25 Smple Case Study: Results 8 6 Adaptve Bandwdth Allocaton: Vehcle Scenaro 8 6 Reconstructed Sgnal Agent Agent 4 α α Rsk Tme (s) 5-5 dα dα Comparson between Constant Samplng and Adaptve Samplng BW BW Cost (J approx ) Usng Optmal Adaptve Samplng Usng Constant Samplng Tme (s) ADAC Lab, NCSU 5
26 Connectng the Dots Wthn the Supervsory Agent Overall structure ADAC Lab, NCSU 6
27 Outlne Objectves, Motvaton System Descrpton Gene Lbrary Adaptve Bandwdth Management Formulaton Analytcal Soluton usng Lagrange Multplers Results Case Study Gene Lbrary based Bandwdth Allocaton for Intellgent Transportaton System Gene Lbrary for Rollover Resource Allocaton Concluson and Future Work 7
28 Gene Lbrary n ITS ADAC Lab, NCSU 8
29 Gene Lbrary for Rollover Rsk RI = a y = h a cosϕ + h snϕ R y R L g cosϕ w θ n π.3739 v sn ( ) ( 4L ) w I + mh ϕ = ma h cosϕ + mgh snϕ xx R y R R kls cosϕ snϕ cls ( cos ϕ ) ϕ m, mass (kg) 5 I xx (kg m ) 55 h R, Heght of c.g. (m).7 L w, Wheel base (m).75 k, Sprng Stffness (N/m) c, Dampng coeffcent (Ns/m) 39 l s (m).5 R. Rajaman, et al., "Real-tme estmaton of roll angle and CG heght for actve rollover preventon applcatons," n Amercan Control Conference, 9. ACC '9., 9, pp Y. Jangyeol and Y. Kyongsu, "A rollover mtgaton control scheme based on rollover ndex," n Amercan Control Conference, 6, 6, p. 6 pp. ADAC Lab, NCSU 9
30 Step : Domnant genes Phenotype, Φ = Rollover Probablty Rollover Index (RI) can be expressed as hra y hr snϕ RI = a + b, a =, b = L g L g cosϕ Canddate Complex protens, ϒ = a, ϒ w w = b, such that Φ = w ϒ + w ϒ Velocty (m/s) Steerng Angle (deg) [ 43] ( mph) [-7 7] ADAC Lab, NCSU 3
31 Step : Domnant genes NC STATE UNIVERSITY RI RI a Rollover Probablty vs. a (The relatonshp s almost lnear) b.5 b Rollover Probablty vs. b RI - b / RI RI - a /RI a Error when usng a to represent rollover phenotype Error when usng b to represent the rollover phenotype ADAC Lab, NCSU a has almost lnear relatonshp to Φ Error s small at low values of a If we use a to represent rollover rsk, then we can save computaton tme 3
32 Step : Create GP-Map G = { h, a, L } d R y w g, d ζ = [ ], gd,,, 9.8 g d,3 ADAC Lab, NCSU 3
33 Evaluatng Gene Lbrary Case : Step velocty nput (from v = 5m/s to v =3m/s)..5 x -3 Error when usng GL.9 35 Sgnal Rollover Probablty Actual Estmated usng GL Tme (s) Tme (s) Case : Step theta nput (from θ =. to θ = 5. rad).4.35 Error when usng GL Sgnal Rollover Probablty.8.6 Actual Estmated usng GL Tme (s) Tme (s) ADAC Lab, NCSU 33
34 Evaluatng Gene Lbrary Case 3: Ramp Velocty nput (-4m/s n 5 secs) 45 4 Sgnal Actual Estmated usng GL 3.5 x -3 Error when usng GL Rollover Probablty Case 4: Sne wth Dwell Tme (s) Tme (s) 3 SD.6.5 Actual Estmated usng GL 6 x -3 Error when usng GL Tme (sec) Rollover Probablty Tme (s) Tme (s) ADAC Lab, NCSU 34
35 Improvng Performance NC STATE UNIVERSITY Assgnng weght for a.35 Φ = w ϒ + w ϒ wm ϒ m,.3 RI - a /RI w = normalzaton weght w =.385 (usng lnear regresson) Φ = w a Prevously a Actual Usng Gene Lbrary Error RI a ADAC Lab, NCSU a
36 Improvng Performance - Results Rollover Probablty Actual Estmated usng GL Tme (s).5. Error when usng GL Rollover Probablty Tme (s).4 x -3 Error when usng GL. Actual Estmated usng GL Rollover Probablty Actual Estmated usng GL Tme (s) x -3 Error when usng GL Rollover Probablty Actual Estmated usng GL Tme (s) Error when usng GL Tme (s).35 Error when usng GL Tme (s).5 x -3 Error when usng GL Tme (s) 3.5 x -3 Error when usng GL Tme (s) 6 x -3 Error when usng GL Tme (s) Tme (s) Tme (s) Tme (s) ADAC Lab, NCSU 36
37 Resource Allocaton usng Gene Lbrary Recall Total Bandwdth (bytes/sec) Data Packet Sze (bytes) 5 3 * w BW max 9% = mn + ( T mn ), N BW mn % 3 w τ mn (secs).5 = τ w.5s BW BW BW N BW where, w = α α α = Φ (calculated usng Gene Lbrary).5 Bandwdth Allocated to each vehcle, BWmax = bytes/s Vehcle Vehcle Vehcle Vehcle v = m/s, Delayed Sne wth dwell (s) v = m/s, Delayed Sne wth dwell (s) Estmated and Actual RI for Vehcle.5 RI RI hat Estmated and Actual RI for Vehcle.5 RI RI hat.8.6 Samplng Tme for each Vehcle, ts mn =.5s Vehcle Vehcle ADAC Lab, NCSU 37
38 Resource Allocaton - Comparson Vehcle Vehcle v = m/s, Delayed Sne wth dwell (s) v = m/s, Delayed Sne wth dwell (s) Estmated and Actual RI for Vehcle.5 RI RI hat Estmated and Actual RI for Vehcle.5 RI RI hat Estmated and Actual RI for Vehcle.5 RI RI hat Estmated and Actual RI for Vehcle.5 RI RI hat MSE =.38e-5.4 MSE =.756e-5.3 MSE =9.975e-6.3 MSE =9.7395e-6 Approxmaton Error tme Approxmaton Error tme Approxmaton Error.. 5 tme Approxmaton Error.. 5 tme Usng Constant Bandwdth Usng Adaptve Bandwdth ADAC Lab, NCSU 38
39 Resource Allocaton - Comparson BW T (bts/s) Constant Bandwdth Adaptve Bandwdth Percent Improvement Vehcle Vehcle Vehcle Vehcle Vehcle Vehcle 5 3.e-5.56e-5.98e-5.66e e-5.76e e e e e e-6 6.8e e e e e e e-6.76e e e-6.95e-6.37e-6.5e ADAC Lab, NCSU 39
40 Concluson A formulaton for gene lbrary was ntroduced. The gene lbrary store the genotype-phenotype maps. An optmal adaptve bandwdth scheme was presented that mnmzed the error n sgnal reconstructon Prelmnary results on developng a gene lbrary for ntellgent transportaton system were shown. The dmensonalty and the computaton tme to calculate the rollover rsk was reduced by usng Gene Lbrary. The Gene Lbrary was used for resource allocaton n an ntellgent transportaton montorng system. The mprovement over the statc (equal) bandwdth allocaton scheme was as hgh as 4% ADAC Lab, NCSU 4
41 What Next? Formulaton of Gene Lbrary Formulaton of Optmal Adaptve Resource Allocaton Gene Lbrary based Resource Allocaton Senstvty Analyss of Gene Lbrary n Network Control Systems (NCS) Adaptve Gene Lbrares Senstvty Analyss: Determne performance degradaton after ntroducng delays, packet loss n the communcaton process of the NCS and ntroduce methods to allevate the performance loss Adaptve Gene Lbrary: Use Artfcal Immune Systems to adaptvely update gene lbrary ADAC Lab, NCSU 4
42 Thank You Questons? ADAC Lab, NCSU 4
En Route Traffic Optimization to Reduce Environmental Impact
En Route Traffc Optmzaton to Reduce Envronmental Impact John-Paul Clarke Assocate Professor of Aerospace Engneerng Drector of the Ar Transportaton Laboratory Georga Insttute of Technology Outlne 1. Introducton
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationrisk and uncertainty assessment
Optmal forecastng of atmospherc qualty n ndustral regons: rsk and uncertanty assessment Vladmr Penenko Insttute of Computatonal Mathematcs and Mathematcal Geophyscs SD RAS Goal Development of theoretcal
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationLecture 12: Classification
Lecture : Classfcaton g Dscrmnant functons g The optmal Bayes classfer g Quadratc classfers g Eucldean and Mahalanobs metrcs g K Nearest Neghbor Classfers Intellgent Sensor Systems Rcardo Guterrez-Osuna
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationNatural Language Processing and Information Retrieval
Natural Language Processng and Informaton Retreval Support Vector Machnes Alessandro Moschtt Department of nformaton and communcaton technology Unversty of Trento Emal: moschtt@ds.untn.t Summary Support
More informationAn Integrated Asset Allocation and Path Planning Method to to Search for a Moving Target in in a Dynamic Environment
An Integrated Asset Allocaton and Path Plannng Method to to Search for a Movng Target n n a Dynamc Envronment Woosun An Mansha Mshra Chulwoo Park Prof. Krshna R. Pattpat Dept. of Electrcal and Computer
More informationUsing Immune Genetic Algorithm to Optimize BP Neural Network and Its Application Peng-fei LIU1,Qun-tai SHEN1 and Jun ZHI2,*
Advances n Computer Scence Research (ACRS), volume 54 Internatonal Conference on Computer Networks and Communcaton Technology (CNCT206) Usng Immune Genetc Algorthm to Optmze BP Neural Network and Its Applcaton
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationOn Epigenomic Privacy: Tracking Personal MicroRNA Expression Profiles over Time
On Epgenomc Prvacy: Trackng Personal McroRNA Expresson Profles over Tme Mchael Backes, Pascal Berrang, Anne Hecksteden, Mathas Humbert, Andreas Keller and Tm Meyer 21st February 2016 On Epgenomc Prvacy:
More informationMACHINE APPLIED MACHINE LEARNING LEARNING. Gaussian Mixture Regression
11 MACHINE APPLIED MACHINE LEARNING LEARNING MACHINE LEARNING Gaussan Mture Regresson 22 MACHINE APPLIED MACHINE LEARNING LEARNING Bref summary of last week s lecture 33 MACHINE APPLIED MACHINE LEARNING
More informationDepartment of Quantitative Methods & Information Systems. Time Series and Their Components QMIS 320. Chapter 6
Department of Quanttatve Methods & Informaton Systems Tme Seres and Ther Components QMIS 30 Chapter 6 Fall 00 Dr. Mohammad Zanal These sldes were modfed from ther orgnal source for educatonal purpose only.
More informationTemperature. Chapter Heat Engine
Chapter 3 Temperature In prevous chapters of these notes we ntroduced the Prncple of Maxmum ntropy as a technque for estmatng probablty dstrbutons consstent wth constrants. In Chapter 9 we dscussed the
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More information4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA
4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationRecall that quantitative genetics is based on the extension of Mendelian principles to polygenic traits.
BIOSTT/STT551, Statstcal enetcs II: Quanttatve Trats Wnter 004 Sources of varaton for multlocus trats and Handout Readng: Chapter 5 and 6. Extensons to Multlocus trats Recall that quanttatve genetcs s
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationA LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS. Dr. Derald E. Wentzien, Wesley College, (302) ,
A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS Dr. Derald E. Wentzen, Wesley College, (302) 736-2574, wentzde@wesley.edu ABSTRACT A lnear programmng model s developed and used to compare
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
More informationStatistics MINITAB - Lab 2
Statstcs 20080 MINITAB - Lab 2 1. Smple Lnear Regresson In smple lnear regresson we attempt to model a lnear relatonshp between two varables wth a straght lne and make statstcal nferences concernng that
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More information1 Derivation of Point-to-Plane Minimization
1 Dervaton of Pont-to-Plane Mnmzaton Consder the Chen-Medon (pont-to-plane) framework for ICP. Assume we have a collecton of ponts (p, q ) wth normals n. We want to determne the optmal rotaton and translaton
More informationChapter 8 SCALAR QUANTIZATION
Outlne Chapter 8 SCALAR QUANTIZATION Yeuan-Kuen Lee [ CU, CSIE ] 8.1 Overvew 8. Introducton 8.4 Unform Quantzer 8.5 Adaptve Quantzaton 8.6 Nonunform Quantzaton 8.7 Entropy-Coded Quantzaton Ch 8 Scalar
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationBasic concepts and definitions in multienvironment
Basc concepts and defntons n multenvronment data: G, E, and GxE Marcos Malosett, Danela Bustos-Korts, Fred van Eeuwk, Pter Bma, Han Mulder Contents The basc concepts: ntroducton and defntons Phenotype,
More informationContinuous vs. Discrete Goods
CE 651 Transportaton Economcs Charsma Choudhury Lecture 3-4 Analyss of Demand Contnuous vs. Dscrete Goods Contnuous Goods Dscrete Goods x auto 1 Indfference u curves 3 u u 1 x 1 0 1 bus Outlne Data Modelng
More informationAn Admission Control Algorithm in Cloud Computing Systems
An Admsson Control Algorthm n Cloud Computng Systems Authors: Frank Yeong-Sung Ln Department of Informaton Management Natonal Tawan Unversty Tape, Tawan, R.O.C. ysln@m.ntu.edu.tw Yngje Lan Management Scence
More informationChapter 7 Channel Capacity and Coding
Chapter 7 Channel Capacty and Codng Contents 7. Channel models and channel capacty 7.. Channel models Bnary symmetrc channel Dscrete memoryless channels Dscrete-nput, contnuous-output channel Waveform
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationCoarse-Grain MTCMOS Sleep
Coarse-Gran MTCMOS Sleep Transstor Szng Usng Delay Budgetng Ehsan Pakbazna and Massoud Pedram Unversty of Southern Calforna Dept. of Electrcal Engneerng DATE-08 Munch, Germany Leakage n CMOS Technology
More informationT E C O L O T E R E S E A R C H, I N C.
T E C O L O T E R E S E A R C H, I N C. B rdg n g En g neern g a nd Econo mcs S nce 1973 THE MINIMUM-UNBIASED-PERCENTAGE ERROR (MUPE) METHOD IN CER DEVELOPMENT Thrd Jont Annual ISPA/SCEA Internatonal Conference
More informationBasic Statistical Analysis and Yield Calculations
October 17, 007 Basc Statstcal Analyss and Yeld Calculatons Dr. José Ernesto Rayas Sánchez 1 Outlne Sources of desgn-performance uncertanty Desgn and development processes Desgn for manufacturablty A general
More informationECONOMICS 351*-A Mid-Term Exam -- Fall Term 2000 Page 1 of 13 pages. QUEEN'S UNIVERSITY AT KINGSTON Department of Economics
ECOOMICS 35*-A Md-Term Exam -- Fall Term 000 Page of 3 pages QUEE'S UIVERSITY AT KIGSTO Department of Economcs ECOOMICS 35* - Secton A Introductory Econometrcs Fall Term 000 MID-TERM EAM ASWERS MG Abbott
More informationADVANCED MACHINE LEARNING ADVANCED MACHINE LEARNING
1 ADVANCED ACHINE LEARNING ADVANCED ACHINE LEARNING Non-lnear regresson technques 2 ADVANCED ACHINE LEARNING Regresson: Prncple N ap N-dm. nput x to a contnuous output y. Learn a functon of the type: N
More informationSGNoise and AGDas - tools for processing of superconducting and absolute gravity data Vojtech Pálinkáš and Miloš Vaľko
SGNose and AGDas - tools for processng of superconductng and absolute gravty data Vojtech Pálnkáš and Mloš Vaľko 1 Research Insttute of Geodesy, Topography and Cartography, Czech Republc SGNose Web tool
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationChapter 9: Statistical Inference and the Relationship between Two Variables
Chapter 9: Statstcal Inference and the Relatonshp between Two Varables Key Words The Regresson Model The Sample Regresson Equaton The Pearson Correlaton Coeffcent Learnng Outcomes After studyng ths chapter,
More informationSTAT 511 FINAL EXAM NAME Spring 2001
STAT 5 FINAL EXAM NAME Sprng Instructons: Ths s a closed book exam. No notes or books are allowed. ou may use a calculator but you are not allowed to store notes or formulas n the calculator. Please wrte
More informationWhich Separator? Spring 1
Whch Separator? 6.034 - Sprng 1 Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng Whch Separator? Mamze the margn to closest ponts 6.034 - Sprng 3 Margn of a pont " # y (w $ + b) proportonal
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationStatistics II Final Exam 26/6/18
Statstcs II Fnal Exam 26/6/18 Academc Year 2017/18 Solutons Exam duraton: 2 h 30 mn 1. (3 ponts) A town hall s conductng a study to determne the amount of leftover food produced by the restaurants n the
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationSupport Vector Machines. Vibhav Gogate The University of Texas at dallas
Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest
More informationTracking with Kalman Filter
Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,
More informationI529: Machine Learning in Bioinformatics (Spring 2017) Markov Models
I529: Machne Learnng n Bonformatcs (Sprng 217) Markov Models Yuzhen Ye School of Informatcs and Computng Indana Unversty, Bloomngton Sprng 217 Outlne Smple model (frequency & profle) revew Markov chan
More informationThermal-Fluids I. Chapter 18 Transient heat conduction. Dr. Primal Fernando Ph: (850)
hermal-fluds I Chapter 18 ransent heat conducton Dr. Prmal Fernando prmal@eng.fsu.edu Ph: (850) 410-6323 1 ransent heat conducton In general, he temperature of a body vares wth tme as well as poston. In
More informationSTATIC OPTIMIZATION: BASICS
STATIC OPTIMIZATION: BASICS 7A- Lecture Overvew What s optmzaton? What applcatons? How can optmzaton be mplemented? How can optmzaton problems be solved? Why should optmzaton apply n human movement? How
More information1. Inference on Regression Parameters a. Finding Mean, s.d and covariance amongst estimates. 2. Confidence Intervals and Working Hotelling Bands
Content. Inference on Regresson Parameters a. Fndng Mean, s.d and covarance amongst estmates.. Confdence Intervals and Workng Hotellng Bands 3. Cochran s Theorem 4. General Lnear Testng 5. Measures of
More informationNON-LINEAR CONVOLUTION: A NEW APPROACH FOR THE AURALIZATION OF DISTORTING SYSTEMS
NON-LINEAR CONVOLUTION: A NEW APPROAC FOR TE AURALIZATION OF DISTORTING SYSTEMS Angelo Farna, Alberto Belln and Enrco Armellon Industral Engneerng Dept., Unversty of Parma, Va delle Scenze 8/A Parma, 00
More informationSDMML HT MSc Problem Sheet 4
SDMML HT 06 - MSc Problem Sheet 4. The recever operatng characterstc ROC curve plots the senstvty aganst the specfcty of a bnary classfer as the threshold for dscrmnaton s vared. Let the data space be
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationStatistics for Managers Using Microsoft Excel/SPSS Chapter 14 Multiple Regression Models
Statstcs for Managers Usng Mcrosoft Excel/SPSS Chapter 14 Multple Regresson Models 1999 Prentce-Hall, Inc. Chap. 14-1 Chapter Topcs The Multple Regresson Model Contrbuton of Indvdual Independent Varables
More informationSome basic statistics and curve fitting techniques
Some basc statstcs and curve fttng technques Statstcs s the dscplne concerned wth the study of varablty, wth the study of uncertanty, and wth the study of decsonmakng n the face of uncertanty (Lndsay et
More informationCS4495/6495 Introduction to Computer Vision. 3C-L3 Calibrating cameras
CS4495/6495 Introducton to Computer Vson 3C-L3 Calbratng cameras Fnally (last tme): Camera parameters Projecton equaton the cumulatve effect of all parameters: M (3x4) f s x ' 1 0 0 0 c R 0 I T 3 3 3 x1
More informationLogistic Regression. CAP 5610: Machine Learning Instructor: Guo-Jun QI
Logstc Regresson CAP 561: achne Learnng Instructor: Guo-Jun QI Bayes Classfer: A Generatve model odel the posteror dstrbuton P(Y X) Estmate class-condtonal dstrbuton P(X Y) for each Y Estmate pror dstrbuton
More informationA FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS
Shervn Haamn A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS INTRODUCTION Increasng computatons n applcatons has led to faster processng. o Use more cores n a chp
More informationStatistical Circuit Optimization Considering Device and Interconnect Process Variations
Statstcal Crcut Optmzaton Consderng Devce and Interconnect Process Varatons I-Jye Ln, Tsu-Yee Lng, and Yao-Wen Chang The Electronc Desgn Automaton Laboratory Department of Electrcal Engneerng Natonal Tawan
More information( ) = ( ) + ( 0) ) ( )
EETOMAGNETI OMPATIBIITY HANDBOOK 1 hapter 9: Transent Behavor n the Tme Doman 9.1 Desgn a crcut usng reasonable values for the components that s capable of provdng a tme delay of 100 ms to a dgtal sgnal.
More informationChapter 7 Channel Capacity and Coding
Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 31 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 6. Rdge regresson The OLSE s the best lnear unbased
More informationDe-noising Method Based on Kernel Adaptive Filtering for Telemetry Vibration Signal of the Vehicle Test Kejun ZENG
6th Internatonal Conference on Mechatroncs, Materals, Botechnology and Envronment (ICMMBE 6) De-nosng Method Based on Kernel Adaptve Flterng for elemetry Vbraton Sgnal of the Vehcle est Kejun ZEG PLA 955
More informationAmiri s Supply Chain Model. System Engineering b Department of Mathematics and Statistics c Odette School of Business
Amr s Supply Chan Model by S. Ashtab a,, R.J. Caron b E. Selvarajah c a Department of Industral Manufacturng System Engneerng b Department of Mathematcs Statstcs c Odette School of Busness Unversty of
More informationStatistics for Economics & Business
Statstcs for Economcs & Busness Smple Lnear Regresson Learnng Objectves In ths chapter, you learn: How to use regresson analyss to predct the value of a dependent varable based on an ndependent varable
More information29th Monitoring Research Review: Ground-Based Nuclear Explosion Monitoring Technologies
TESTING THE SPECTRAL DECONVOLUTION ALGORITHM TOOL (SDAT) WITH XE SPECTRA Steven R. Begalsk, Kendra M. Foltz Begalsk, and Derek A. Haas The Unversty of Texas at Austn Sponsored by Army Space and Mssle Defense
More informationChapter 3 Describing Data Using Numerical Measures
Chapter 3 Student Lecture Notes 3-1 Chapter 3 Descrbng Data Usng Numercal Measures Fall 2006 Fundamentals of Busness Statstcs 1 Chapter Goals To establsh the usefulness of summary measures of data. The
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationModeling of Dynamic Systems
Modelng of Dynamc Systems Ref: Control System Engneerng Norman Nse : Chapters & 3 Chapter objectves : Revew the Laplace transform Learn how to fnd a mathematcal model, called a transfer functon Learn how
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
More informationPARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY
POZNAN UNIVE RSITY OF TE CHNOLOGY ACADE MIC JOURNALS No 86 Electrcal Engneerng 6 Volodymyr KONOVAL* Roman PRYTULA** PARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY Ths paper provdes a
More information829. An adaptive method for inertia force identification in cantilever under moving mass
89. An adaptve method for nerta force dentfcaton n cantlever under movng mass Qang Chen 1, Mnzhuo Wang, Hao Yan 3, Haonan Ye 4, Guola Yang 5 1,, 3, 4 Department of Control and System Engneerng, Nanng Unversty,
More informationPhase I Monitoring of Nonlinear Profiles
Phase I Montorng of Nonlnear Profles James D. Wllams Wllam H. Woodall Jeffrey B. Brch May, 003 J.D. Wllams, Bll Woodall, Jeff Brch, Vrgna Tech 003 Qualty & Productvty Research Conference, Yorktown Heghts,
More informationLecture 6: Introduction to Linear Regression
Lecture 6: Introducton to Lnear Regresson An Manchakul amancha@jhsph.edu 24 Aprl 27 Lnear regresson: man dea Lnear regresson can be used to study an outcome as a lnear functon of a predctor Example: 6
More informationStatistics Chapter 4
Statstcs Chapter 4 "There are three knds of les: les, damned les, and statstcs." Benjamn Dsrael, 1895 (Brtsh statesman) Gaussan Dstrbuton, 4-1 If a measurement s repeated many tmes a statstcal treatment
More informationResearch on Route guidance of logistic scheduling problem under fuzzy time window
Advanced Scence and Technology Letters, pp.21-30 http://dx.do.org/10.14257/astl.2014.78.05 Research on Route gudance of logstc schedulng problem under fuzzy tme wndow Yuqang Chen 1, Janlan Guo 2 * Department
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
More informationPredictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore
Sesson Outlne Introducton to classfcaton problems and dscrete choce models. Introducton to Logstcs Regresson. Logstc functon and Logt functon. Maxmum Lkelhood Estmator (MLE) for estmaton of LR parameters.
More information10-701/ Machine Learning, Fall 2005 Homework 3
10-701/15-781 Machne Learnng, Fall 2005 Homework 3 Out: 10/20/05 Due: begnnng of the class 11/01/05 Instructons Contact questons-10701@autonlaborg for queston Problem 1 Regresson and Cross-valdaton [40
More informationLecture 9: Linear regression: centering, hypothesis testing, multiple covariates, and confounding
Recall: man dea of lnear regresson Lecture 9: Lnear regresson: centerng, hypothess testng, multple covarates, and confoundng Sandy Eckel seckel@jhsph.edu 6 May 8 Lnear regresson can be used to study an
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationThe strict priority scheduler
6. SP and GPS schedulers Pag. The strct prorty scheduler The strct prorty scheduler s very smple and effcent In the followng, we wll carry out the analyss of ths scheduler to determne the formulas for
More informationLecture 9: Linear regression: centering, hypothesis testing, multiple covariates, and confounding
Lecture 9: Lnear regresson: centerng, hypothess testng, multple covarates, and confoundng Sandy Eckel seckel@jhsph.edu 6 May 008 Recall: man dea of lnear regresson Lnear regresson can be used to study
More informationAn Interactive Optimisation Tool for Allocation Problems
An Interactve Optmsaton ool for Allocaton Problems Fredr Bonäs, Joam Westerlund and apo Westerlund Process Desgn Laboratory, Faculty of echnology, Åbo Aadem Unversty, uru 20500, Fnland hs paper presents
More informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
More informationStudy on Active Micro-vibration Isolation System with Linear Motor Actuator. Gong-yu PAN, Wen-yan GU and Dong LI
2017 2nd Internatonal Conference on Electrcal and Electroncs: echnques and Applcatons (EEA 2017) ISBN: 978-1-60595-416-5 Study on Actve Mcro-vbraton Isolaton System wth Lnear Motor Actuator Gong-yu PAN,
More informationPREDICTIVE CONTROL BY DISTRIBUTED PARAMETER SYSTEMS BLOCKSET FOR MATLAB & SIMULINK
PREDICTIVE CONTROL BY DISTRIBUTED PARAMETER SYSTEMS BLOCKSET FOR MATLAB & SIMULINK G. Hulkó, C. Belavý, P. Buček, P. Noga Insttute of automaton, measurement and appled nformatcs, Faculty of Mechancal Engneerng,
More information18.1 Introduction and Recap
CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng
More information