Decentralized Control of Petri Nets
|
|
- Noel Simmons
- 5 years ago
- Views:
Transcription
1 Decenralized Conrol of Peri Nes Marian V. Iordache and Panos J. Ansaklis Dearmen of Elecrical Engineering Universiy of Nore Dame Nore Dame, IN 6556 June, 00 M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
2 Ouline The goal of he aer is o exend he suervision based on lace invarians (SBPI) o a decenralized seing >. Overview of he SBPI. The Decenralized Seing. Decenralized Admissibiliy. Enforcing D-Admissible Consrains 5. Enforcing D-Inadmissible Consrains (a) Enforcemen Wih Communicaion (b) Enforcemen Wihou Communicaion (c) Enforcemen Wih Resriced Communicaion M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
3 Overview of he Suervision Based on Place Invarians Suervision Based on Place Invarians: inroduced by several researchers (Giua, Yamalidou, Moody, and ohers). The secificaion of he SBPI is Lµ b. Case I: All ransiions are conrollable and observable. Le D be he incidence marix of he lan Peri ne. The suervisor can be designed as a Peri ne of incidence marix D s = LD If µ 0 is he iniial marking of he lan, he iniial marking of he suervisor is µ s0 = b Lµ 0 The laces of he suervisor are called conrol laces. The closed-loo is a Peri ne of incidence marix [ ] D D c = LD M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
4 Overview of he Suervision Based on Place Invarians Examle The se of consrains µ( )+µ( ) Targe Peri ne µ( )+µ( ) is described by Lµ b wih: [ 0 L = 0 ] b = [ ] The incidence marix is: D = 0 0 Suervised Peri ne The suervisor has wo conrol laces (as L has wo rows): D s = LD = [ 0 0 ] C C M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
5 Overview of he Suervision Based on Place Invarians Examle The iniial marking of he suervisor is µ s0 = b Lµ 0 = Noe ha for all reachable markings µ s = b Lµ [ ] Targe Peri ne This aroach is called suervision based on lace invarians, as i creaes for each row of L a lace invarian. In aricular: Suervised Peri ne µ( )+µ( ) µ(c )= µ( )+µ( ) µ(c )= C C M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 5
6 Overview of he Suervision Based on Place Invarians Case II: No all ransiions are conrollable and observable. A suervisor should no inhibi unconrollable ransiions or observe firings of unobservable ransiions. Then, he suervisory aroach of Case I can sill be used if (bu no only if) LD uo =0and LD uc 0 () where D uc and D uo are he resricions of he incidence marix D o he columns of he unconrollable and unobservable ransiions, resecively. To enforce Lµ b we can roceed as follows:. If L saisfies (), find he suervisor as in Case I. Oherwise:. Transform Lµ b o L a µ b a such ha L a µ b a Lµ b and L a saisfies (). Then he suervised PN is obained as in Case I by enforcing L a µ b a insead of Lµ b. M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 6
7 Overview of he Suervision Based on Place Invarians Examle Assume unobservable and he same secificaion: µ( )+µ( ) µ( )+µ( ) 0 As D = 0 [ ] Noe ha LD uo = ( L = [ 0 0, D uo = 0. ] b = [ and D uc is emy. ]) Therefore, he consrains are ransformed o Targe Peri ne Suervised Peri ne µ( )+µ( ) µ( )+µ( ) and enforced by he conrol laces C and C. is unobservable C C M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 7
8 Ouline The goal of he aer is o exend he suervision based on lace invarians (SBPI) o a decenralized seing. Overview of he SBPI >. The Decenralized Seing. Decenralized Admissibiliy. Enforcing D-Admissible Consrains 5. Enforcing D-Inadmissible Consrains (a) Enforcemen Wih Communicaion (b) Enforcemen Wihou Communicaion (c) Enforcemen Wih Resriced Communicaion M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 8
9 Cenralized vs Decenralized SUPERVISOR Nework Connecion PLANT PLANT... PLANT Nework Connecion SUPERVISOR SUPERVISOR... SUPERVISOR PLANT PLANT PLANT M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 9
10 Decenralized Suervision Examle Pars bin Assembly area Pars bin Comuer Comuer Nework Connecion T c, = T o, = {, } T c, = T o, = {, } Secificaion: µ + µ M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 0
11 Decenralized Suervision Examle Pars bin Assembly area Pars bin T c, = T o, = {, } T c, = T o, = {, } Comuer Comuer Comuer T c, = { 5 } Nework Connecion T o, = {,,,, 5 } 5 6 Secificaion: 5 µ + µ µ 5 µ 6 M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
12 Decenralized Suervision Given: he Peri ne model of he sysem he ses of conrollable and observable T c,i and T o,i, i =... he secificaion Lµ b. Problem : Find he suervisors S... S such ha. The join oeraion of S... S ensures he lan saisfies Lµ b.. Each S i conrols only ransiions in T c,i and observes only ransiions in T o,i. M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
13 Decenralized Suervision wih Communicaion Problem : Solve Problem when communicaion is allowed. Communicaion can be used o enable S i o conrol T c,j, / T c,i. j i observe T o,j, / T o,i. j i Remark: Cenralized suervision assumes: T c = T c,j and T o = ha is, full (maximum) communicaion! Oimaliy crieria: minimum communicaion. maximally ermissive design. j=... j=... T o,j M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
14 Ouline The goal of he aer is o exend he suervision based on lace invarians (SBPI) o a decenralized seing. Overview of he SBPI. The Decenralized Seing >. Decenralized Admissibiliy. Enforcing D-Admissible Consrains 5. Enforcing D-Inadmissible Consrains (a) Enforcemen Wih Communicaion (b) Enforcemen Wihou Communicaion (c) Enforcemen Wih Resriced Communicaion M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
15 Decenralized Admissibiliy In cenralized suervision: i is (comuaionally) easy o enforce consrains Lµ b on fully conrollable and observable PNs. in arially conrollable and observable PNs, we say ha Lµ b is c-admissible if i can be enforced as if he PN were fully conrollable and observable. consrains Lµ b ha are no c-admissible are ransformed o a c-admissible form L a µ b a such ha L a µ b a Lµ b. In decenralized suervision: we exend c-admissibiliy o d-admissibiliy, such ha d-admissible consrains Lµ b are (comuaionally) easy o enforce. checking wheher a se of consrains is d-admissible is (comuaionally) racable. he definiion we roose allows us o ransform consrains Lµ b ha are no d-admissible o d-admissible consrains L a µ b a such ha L a µ b a Lµ b. enforce consrains ha are no d-admissible by enabling communicaion M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 5
16 Decenralized Admissibiliy Definiion Le Lµ b, L Z m P and b Z m be a se of consrains. A consrain of Lµ b is denoed by lµ c, l Z P and c Z. lµ c is d-admissible wih resec o (N,µ 0,T c,...t c,n,t o,...t o,n ),ifhere is C {,,...n}, C =, such ha lµ c is c-admissible wih resec o (N,µ 0,T c,t o ),wheret c = T c,i and T o = T o,i. i C i C Lµ b is d-admissible if each of is consrains lµ c is d-admissible. c-admissibiliy is a secial case of d-admissibiliy, in he sense ha if lµ c is c-admissible w.r.. (N,T c,i,t o,i ), lµ c is d-admissible (se C = {i}). lµ c d-admissible imlies If firing a lan-enabled ransiion violaes lµ c hen i C: T c,i. All suervisors S i wih i Care able o know he value of c lµ. an algorihm checking wheher a se of consrains is d-admissible is in he aer. M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 6
17 Ouline The goal of he aer is o exend he suervision based on lace invarians (SBPI) o a decenralized seing. Overview of he SBPI. The Decenralized Seing. Decenralized Admissibiliy >. Enforcing D-Admissible Consrains 5. Enforcing D-Inadmissible Consrains (a) Enforcemen Wih Communicaion (b) Enforcemen Wihou Communicaion (c) Enforcemen Wih Resriced Communicaion M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 7
18 Enforcemen of D-admissible Consrains Le D and µ 0 be he incidence marix and he iniial marking of a PN N. Recall he cenralized enforcemen of a c-admissible consrain lµ c on (N,µ 0 ): A conrol lace C is generaed such ha for all :. If ld(,) > 0, henc and he weigh is W (C, ) =ld(,).. If ld(,) < 0, henc and he weigh is W (, C) = ld(,). The iniial marking of C is c lµ 0. In he decenralized enforcemen of a d-admissible consrain lµ c, for all i C: Define x i N, as he sae variable of S i. Iniialize x i o c lµ 0. S i disables a ransiion if T c,i and x i <ld(,). If T o,i fires and ld(,) 0,henx i = x i ld(,). I can be roved ha he decenralized suervisor i C S i enforces lµ c andhaiis equally ermissive o he cenralized suervisor S enforcing lµ c in he fully conrollable and observable version of N. M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 8
19 Enforcemen of D-Admissible Consrains Examle Desired consrain: µ + µ. Iniial marking µ 0 =[0,,, 0] T. Decenralized seing: T c, = {, }, T c, = {, }, T o, = T o, = {,,, }. The suervisor S : iniializes x o 0. disables if x =0 incremens x if or fires. decremens x if or fires. The suervisor S : iniializes x o 0. disables if x =0 incremens x if or fires. decremens x if or fires. A grahical reresenaion is ossible, however i may be boh helful and misleading. C Cenralized conrol C Subsysem Decenralized conrol Subsysem C M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 9
20 Ouline The goal of he aer is o exend he suervision based on lace invarians (SBPI) o a decenralized seing. Overview of he SBPI. The Decenralized Seing. Decenralized Admissibiliy. Enforcing D-Admissible Consrains 5. Enforcing D-Inadmissible Consrains > (a) Enforcemen Wih Communicaion (b) Enforcemen Wihou Communicaion (c) Enforcemen Wih Resriced Communicaion M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 0
21 Enforcemen of D-Inadmissible Consrains via Communicaion µ + µ is d-inadmissible for T c, = T o, = {, } and T c, = T o, = {, }. Global sysem Subsysem Subsysem The consrain becomes d-admissible if he ransiions and are communicaed o subsysem and he ransiions and o subsysem. Then T o, = T o, = {,,, }, T c, = {, } and T c, = {, }. Global sysem Subsysem Subsysem M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
22 Enforcemen of D-Inadmissible Consrains via Communicaion D-inadmissible consrains can be made admissible by communicaion:. Le T c,l = i=...n T c,i and T o,l = i=...n T o,i.. Is he secificaion c-admissible wih resec o (N,T c,l,t o,l )? If no, ransform i o be c-admissible.. Le S be he cenralized SBPI suervisor enforcing he secificaion. Le T c be he se of ransiions conrolled by S and T o he se of ransiions deeced by S.. Find a se C such ha T c,i T c. i C 5. The communicaion can be designed as follows: for all T o \( T o,i ), a subsysem j such ha T o,j ransmis he firings of o all suervisors S k wih / T o,k and k C. 6. Design he decenralized suervisor according o he algorihm for d-admissible consrains. i C M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
23 Enforcemen of D-Inadmissible Consrains via Communicaion In he algorihm No communicaion resricions considered. These are considered laer. The suervisor is equally ermissive o he cenralized suervisor. In he communicaion olicy roosed in he algorihm: The conrol decisions are aken locally (no conrol decisions are communicaed). Assuming broadcas, here is less communicaion raffic han in he cenralized soluion, which remoely observes and conrols he ransiions in T o and T c, resecively. Beer communicaion olicies may be ossible. (The oimal olicy can be obained by solving an ineger rogram.) M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
24 Enforcemen of D-Inadmissible Consrains via Communicaion µ + µ is d-inadmissible for T c, = T o, = {, } and T c, = T o, = {, }. Global sysem Subsysem Subsysem T c,l = T o,l = {,,, }; µ + µ is c-admissible w.r.. (N,T c,l,t o,l ). T c and T o found from he cenralized SBPI: C T c = {, } T o = {,,, } C = {, } M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
25 Enforcemen of D-Inadmissible Consrains via Communicaion C SUPERVISOR Nework Connecion PLANT PLANT CENTRALIZED Broadcas:,,,and. Remoely conrol: and. SUPERVISOR PLANT DECENTRALIZED Nework Connecion SUPERVISOR PLANT C Broadcas: and. Remoely conrol: C Broadcas: and. Remoely conrol: M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 5
26 Enforcemen of D-Inadmissible Consrains via Communicaion C C Sill anoher soluion... Broadcas: Remoely conrol:. Broadcas: and. Remoely conrol: In general, several equally ermissive and decenralized soluions are ossible. The oimal soluion deends on he relaive cos of broadcas/remoe conrol. M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 6
27 Ouline The goal of he aer is o exend he suervision based on lace invarians (SBPI) o a decenralized seing. Overview of he SBPI. The Decenralized Seing. Decenralized Admissibiliy. Enforcing D-Admissible Consrains 5. Enforcing D-Inadmissible Consrains (a) Enforcemen Wih Communicaion > (b) Enforcemen Wihou Communicaion (c) Enforcemen Wih Resriced Communicaion M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 7
28 Enforcemen of D-Inadmissible Consrains via Transformaions Secificaion: Lµ b (d-inadmissible) Goal: Find L µ b... L m µ b m ha are d-admissible such ha Remarks: (L µ b L µ b...l m µ b m ) Lµ b () - Each L i µ b i has a differen se C i. - The ses C i are given. - Any soluion can be found if all ses C i are given. If so, m = n. - However, we could discard he ses C i wih T (i) o = T o,i =. i C i - In racice, we exec mos ses C i o have T (i) o =. We roose o simlify () o: [(L + L +...L m )µ (b + b +...b m )] Lµ b () M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 8
29 Enforcemen of D-Inadmissible Consrains via Transformaions The following aramerizaion is used: L + L +...L m = R + R L () b + b +...b m = R (b + ) (5) for R N m P, R N m m such ha R > 0 and R is diagonal. Admissibiliy consrains where T (i) uc = T uc,i and T (i) uo i C i L i D(,T (i) uc ) 0 (6) L i D(,T (i) uo ) = 0 (7) = T uo,i. i C i Then he roblem is o find a feasibile soluion of ( 7). The unknowns are R, R, L i, and b i, and ineger rogramming can be used o find hem. Drawbacks: The comuaional comlexiy of ILP and he fac ha a ermissiviy requiremen seems raher hard o be encoded as linear consrains. M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 9
30 Examle Secificaion: µ + µ ; T c, = T o, = {, } and T c, = T o, = {, }. Subsysem Subsysem Global sysem Take m =, C = {} and C = {}. Decenralized soluion: µ (as L µ b )andµ (as L µ b ). C C M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 0
31 Ouline The goal of he aer is o exend he suervision based on lace invarians (SBPI) o a decenralized seing. Overview of he SBPI. The Decenralized Seing. Decenralized Admissibiliy. Enforcing D-Admissible Consrains 5. Enforcing D-Inadmissible Consrains (a) Enforcemen Wih Communicaion (b) Enforcemen Wihou Communicaion > (c) Enforcemen Wih Resriced Communicaion M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
32 Resriced Communicaion The revious ILP aroach can be used wih communicaion exensions. Noe ha: - Communicaion allows imroving ermissiviy. - Some consrains are no enforcible wihou communicaion. Exensions: The binary variables α ij and ε ij are inroduced. α ij =iff he firing of j is announced o he suervisors of C i. ε ij =iff a suervisor from C i remoely conrols j. In aricular, in he broadcas case α ij = α j i =...m (α j = iff each firing of j is broadcas, i.e., all suervisors are announced when j fires). ε ij = ε j i =...m (ε j =iff all suervisors are allowed o remoely conrol j ). Communicaion consrains can be incororaed as exressions of α ij and ε ij. M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
33 Resriced Communicaion Define B i U and Bi L as uer and lower bounds of L id. Le A =[α ij ] and E =[ε ij ]. The admissibiliy consrains L i D(,T (i) uc ) 0 and L id(,t (i) uo )=0are relaced by: L i D(,T (i) uo ) [Bi U diag(a(i, ))] T (i) uo L i D(,T (i) uo ) [Bi L diag(a(i, ))] T (i) uo L i D(,T (i) uc ) [Bi U diag(e(i, ))] T (i) uc (8) (9) (0) Given he weigh marices C and F, he objecive of he ILP can be se o o minimize communicaion. min A,E,L i,b i,r,r Trace(CA + FE) () C/F may reflec saisics on how ofen he ransiions j are fired/require conrol. M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
34 Manufacuring Examle (Adaed from [Lin, 990]) Machines: M and M. Buffers: B... B. Robos: H... H. Two ossible manufacuring sequences: - γ τ π α τ π α η - γ τ π α τ π α η B and B share common buffer sace. B and B share also common sace. γ η τ π α H B τ π α H B M M [ η ] [ M ] [ α ] [ B ] [ π ] [ H ] [ τ ] [ M ] [ α ] [ B ] [ π ] [ H ] [ τ ] [ M ] [ γ ] [ M ] B H α π τ B H α π τ γ η 5 [ M ] [ γ ] [ M ] [ τ ] [ H ] [ π ] [ B ] [ α ] [ M ] [ τ ] [ H ] [ π ] [ B ] [ α ] [ M ] [ η ] M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes.
35 Decenralized Suervision T c, = { } T o, = {,, } T c, = { 5 } T o, = { 5, 6, 7, 8 } T c, = { 0 } T o, = { 0,, } T c, = {, 6 } T o, = {,, 5, 6 } Avoid buffer overflow: µ + µ and µ 6 + µ 0. C [ η ] [ α ] [ π ] [ τ ] [ α ] [ π ] [ τ ] [ γ ] Take m =and C i = {i}, i =... C [ γ ] [ τ ] [ π ] [ α ] [ τ ] [ π ] [ α ] [ η ] Soluion wihou communicaion: µ + µ (sub-) µ 5 + µ 6 (sub-) µ 9 + µ 0 (sub-) µ + µ (sub-) C C M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 5
36 Decenralized Suervision T c, = { } T o, = {,, } T c, = { 5 } T o, = { 5, 6, 7, 8 } T c, = { 0 } T o, = { 0,, } T c, = {, 6 } T o, = {,, 5, 6 } Fairness: v 8 v 6 and v 6 v 8. (v i : he number of firings of i.) [ η ] [ α ] [ π ] [ τ ] [ α ] [ π ] [ τ ] [ γ ] No acceable soluion wihou communicaion! 6 C 5 C [ γ ] [ τ ] [ ] [ ] [ ] [ ] [ ] [ ] π α τ η π α Resul: subsysem : broadcas 8 and enforce µ 5 +µ 6 +µ 7 +v 8 v 6 subsysem : broadcas 6 and enforce v 6 v 8 M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 6
37 Conclusion This aer exends he SBPI o he decenralized seing. The suervisors can be designed by consrain ransformaion for: - no communicaion - resriced communicaion - minimal communicaion This work shows ha he decenralized suervision of PNs can be racable. On he negaive side: - Our ILP aroach is suboimal. - Difficul o include ermissiviy requiremens in he ILP. M.V. Iordache and P.J. Ansaklis, Decenralized Conrol of Peri Nes. 7
Reduction of the Supervisor Design Problem with Firing Vector Constraints
wih Firing Vecor Consrains Marian V. Iordache School of Engineering and Eng. Tech. LeTourneau Universiy Longview, TX 75607-700 Panos J. Ansaklis Dearmen of Elecrical Engineering Universiy of Nore Dame
More informationDecentralized Control of Petri Nets
Marian Iordache, Panos J.Ansaklis, Decenralized onrol of Peri Nes, ISIS Technical Reor ISIS-00-005, Ocober 00. Decenralized onrol of Peri Nes Technical Reor of he ISIS Grou a he Universiy of Nore Dame
More informationDecentralized Control of Petri Nets
Marian Iordache, Panos J. Ansaklis, Decenralized Conrol of Peri Nes, Proceedings of he Worksho on Discree Even Sysems Conrol a he h Inernaional Conference on Alicaion and Theory of Peri Nes (ATPN 00),.-58,
More informationA Method for Deadlock Prevention in Discrete Event Systems Using Petri Nets
M.V. Iordache, J.O. Moody and P.J. Ansaklis, "A Mehod for Deadlock Prevenion in Discree Even Sysems Using Peri Nes," Technical Reor isis-99-006, De. of Elecrical Engr., Univ. of Nore Dame, July 999. A
More informationAutomated Synthesis of Liveness Enforcing Supervisors Using Petri Nets
Auomaed Synhesis of Liveness Enforcing Suervisors Using Peri Nes Technical Reor of he ISIS Grou a he Universiy of Nore Dame ISIS-00-00 Ocober, 000 Revised in January 00 and May 00 Marian V. Iordache John
More informationA Method for Deadlock Prevention in Discrete Event Systems Using Petri Nets
A Mehod for Deadlock Prevenion in Discree Even Sysems Using Peri Nes Technical Reor of he ISIS Grou a he Universiy of Nore Dame ISIS-99-006 July, 999 Marian V. Iordache John O. Moody Panos J. Ansaklis
More informationSynthesis of Supervisors Enforcing General Linear Vector Constraints in Petri Nets
The 00 Aerican onrol onference, May -0, Anchorage, Alaska. Synhesis of Suervisors Enforcing General Linear Vecor onsrains in Peri Nes Marian V. Iordache and Panos J. Ansaklis Absrac This aer considers
More informationSynthesis of Concurrent Programs Based on Supervisory Control
Synhesis of Concurren Programs Based on Suervisory Conrol Marian V. Iordache School of Engineering and Eng. Tech. LeTourneau Universiy Longview, TX 75607, USA E-mail: MarianIordache@leu.edu Panos J. Ansaklis
More informationEmbedded Systems 4. Petri nets. Introduced in 1962 by Carl Adam Petri in his PhD thesis. Different Types of Petri nets known
Embedded Sysems 4 - - Peri nes Inroduced in 962 by Carl Adam Peri in his PhD hesis. Differen Tyes of Peri nes known Condiion/even nes Place/ransiion nes Predicae/ransiion nes Hierachical Peri nes, - 2
More informationfakultät für informatik informatik 12 technische universität dortmund Petri Nets Peter Marwedel TU Dortmund, Informatik /10/10
2 Peri Nes Peer Marwedel TU Dormund, Informaik 2 2008/0/0 Grahics: Alexandra Nole, Gesine Marwedel, 2003 Generalizaion of daa flow: Comuaional grahs Examle: Peri nes Inroduced in 962 by Carl Adam Peri
More informationfakultät für informatik informatik 12 technische universität dortmund Petri Nets Peter Marwedel TU Dortmund, Informatik /11/09
2 Peri Nes Peer Marwedel TU Dormund, Informaik 2 2009//09 Grahics: Alexandra Nole, Gesine Marwedel, 2003 Models of comuaion considered in his course Communicaion/ local comuaions Undefined comonens Communicaing
More informationSoftware Tools for the Supervisory Control of Petri Nets Based on Place Invariants
Sofware Tools for he Suervisory Conrol of Peri Nes Based on Place Invarians Marian V. Iordache and Panos J. Ansaklis This documen describes a Malab oolbox for he suervisory conrol of Peri nes based on
More informationPetri Nets. Peter Marwedel TU Dortmund, Informatik /05/13 These slides use Microsoft clip arts. Microsoft copyright restrictions apply.
2 Peri Nes Peer Marwedel TU Dormund, Informaik 2 Grahics: Alexandra Nole, Gesine Marwedel, 2003 20/05/3 These slides use Microsof cli ars. Microsof coyrigh resricions aly. Models of comuaion considered
More informationEmbedded Systems 5 BF - ES - 1 -
Embedded Sysems 5 - - REVIEW: Peri Nes Def.: N=C,E,F) is called a Peri ne, iff he following holds. C and E are disjoin ses 2. F C E) E C); is binary relaion, flow relaion ) Def.: Le N be a ne and le x
More informationPetri Nets. Peter Marwedel TU Dortmund, Informatik 年 10 月 31 日. technische universität dortmund. fakultät für informatik informatik 12
Sringer, 2 2 Peri Nes Peer Marwedel TU Dormund, Informaik 2 22 年 月 3 日 These slides use Microsof cli ars. Microsof coyrigh resricions aly. Models of comuaion considered in his course Communicaion/ local
More information10. State Space Methods
. Sae Space Mehods. Inroducion Sae space modelling was briefly inroduced in chaper. Here more coverage is provided of sae space mehods before some of heir uses in conrol sysem design are covered in he
More informationEmbedded Systems CS - ES
Embedded Sysems - - REVIEW Peri Nes - 2 - Comuing changes of markings REVIEW Firing ransiions generae new markings on each of he laces according o he following rules: When a ransiion fires from a marking
More informationEmbedded Systems 5. Midterm, Thursday December 18, 2008, Final, Thursday February 12, 2009, 16-19
Embedded Sysems 5 - - Exam Daes / egisraion Miderm, Thursday December 8, 8, 6-8 Final, Thursday February, 9, 6-9 egisraion hrough HISPOS oen in arox. week If HISPOS no alicable Non-CS, Erasmus, ec send
More informationEmbedded Systems CS - ES
Embedded Sysems - - Overview of embedded sysems design REVIEW - 2 - REVIEW - 3 - REVIEW - 4 - REVIEW - 5 - Scheduling rocesses in ES: Differences in goals REVIEW In classical OS, qualiy of scheduling is
More informationOn a problem of Graham By E. ERDŐS and E. SZEMERÉDI (Budapest) GRAHAM stated the following conjecture : Let p be a prime and a 1,..., ap p non-zero re
On a roblem of Graham By E. ERDŐS and E. SZEMERÉDI (Budaes) GRAHAM saed he following conjecure : Le be a rime and a 1,..., a non-zero residues (mod ). Assume ha if ' a i a i, ei=0 or 1 (no all e i=0) is
More informationPattern Classification (VI) 杜俊
Paern lassificaion VI 杜俊 jundu@usc.edu.cn Ouline Bayesian Decision Theory How o make he oimal decision? Maximum a oserior MAP decision rule Generaive Models Join disribuion of observaion and label sequences
More informationTimed Circuits. Asynchronous Circuit Design. Timing Relationships. A Simple Example. Timed States. Timing Sequences. ({r 6 },t6 = 1.
Timed Circuis Asynchronous Circui Design Chris J. Myers Lecure 7: Timed Circuis Chaper 7 Previous mehods only use limied knowledge of delays. Very robus sysems, bu exremely conservaive. Large funcional
More informationFault Tolerant Computing CS 530 Reliability Analysis. Yashwant K. Malaiya Colorado State University
CS 53 eliabiliy Analysis Yashwan K. Malaiya Colorado Sae Universiy February 6, 27 eliabiliy Analysis: Ouline eliabiliy measures: eliabiliy, availabiliy, Transacion eliabiliy, MTTF and (, MTBF Basic Cases
More informationA 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales
A 2-Aroximaion Algorihm for Sochasic Invenory Conrol Models wih Los Sales Resef Levi Sloan School of Managemen, MIT, Cambridge, MA, 02139, USA email: resef@mi.edu Ganesh Janakiraman IOMS-OM Grou, Sern
More informationModel Reduction for Dynamical Systems Lecture 6
Oo-von-Guericke Universiä Magdeburg Faculy of Mahemaics Summer erm 07 Model Reducion for Dynamical Sysems ecure 6 v eer enner and ihong Feng Max lanck Insiue for Dynamics of Complex echnical Sysems Compuaional
More informationMath 334 Fall 2011 Homework 11 Solutions
Dec. 2, 2 Mah 334 Fall 2 Homework Soluions Basic Problem. Transform he following iniial value problem ino an iniial value problem for a sysem: u + p()u + q() u g(), u() u, u () v. () Soluion. Le v u. Then
More informationChapter 2. First Order Scalar Equations
Chaper. Firs Order Scalar Equaions We sar our sudy of differenial equaions in he same way he pioneers in his field did. We show paricular echniques o solve paricular ypes of firs order differenial equaions.
More information3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon
3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of
More informationVerification of Coprognosability in Decentralized Fault Prognosis of Labeled Petri Nets
28 IEEE Conference on Decision and Conrol (CDC Miami Beach, FL, USA, Dec. 7-9, 28 Verificaion of Corognosabiliy in Decenralized Faul Prognosis of Labeled Peri es Wenqing Wu, Xiang Yin and Shaoyuan Li Absrac
More informationInventory Analysis and Management. Multi-Period Stochastic Models: Optimality of (s, S) Policy for K-Convex Objective Functions
Muli-Period Sochasic Models: Opimali of (s, S) Polic for -Convex Objecive Funcions Consider a seing similar o he N-sage newsvendor problem excep ha now here is a fixed re-ordering cos (> 0) for each (re-)order.
More informationA Structural Approach to the Enforcement of Language and Disjunctive Constraints
A Srucurl Aroch o he Enforcemen of Lnguge nd Disjuncive Consrins Mrin V. Iordche School of Engineering nd Eng. Tech. LeTourneu Universiy Longview, TX 7607-700 Pnos J. Ansklis Dermen of Elecricl Engineering
More informationLecture 2-1 Kinematics in One Dimension Displacement, Velocity and Acceleration Everything in the world is moving. Nothing stays still.
Lecure - Kinemaics in One Dimension Displacemen, Velociy and Acceleraion Everyhing in he world is moving. Nohing says sill. Moion occurs a all scales of he universe, saring from he moion of elecrons in
More informationExercises: Similarity Transformation
Exercises: Similariy Transformaion Problem. Diagonalize he following marix: A [ 2 4 Soluion. Marix A has wo eigenvalues λ 3 and λ 2 2. Since (i) A is a 2 2 marix and (ii) i has 2 disinc eigenvalues, we
More informationApplication of Wang s Recurrent Neural Network to solve the Transportation problem
50 IJCSNS Inernaional Journal of Comuer Science and Nework Securiy, VOL.2 No.7, July 202 Alicaion of Wang s Recurren Neural Nework o solve he Transoraion roblem Paulo Henrique Siqueira, Federal Universiy
More informationStopping Brownian Motion without Anticipation as Close as Possible to its Ultimate Maximum
Theory Probab. Al. Vol. 45, No.,, (5-36) Research Reor No. 45, 999, De. Theore. Sais. Aarhus Soing Brownian Moion wihou Aniciaion as Close as Possible o is Ulimae Maximum S. E. GRAVERSEN 3, G. PESKIR 3,
More informationLecture 20: Riccati Equations and Least Squares Feedback Control
34-5 LINEAR SYSTEMS Lecure : Riccai Equaions and Leas Squares Feedback Conrol 5.6.4 Sae Feedback via Riccai Equaions A recursive approach in generaing he marix-valued funcion W ( ) equaion for i for he
More informationA One Line Derivation of DCC: Application of a Vector Random Coefficient Moving Average Process*
A One Line Derivaion of DCC: Alicaion of a Vecor Random Coefficien Moving Average Process* Chrisian M. Hafner Insiu de saisique, biosaisique e sciences acuarielles Universié caholique de Louvain Michael
More informationNotes for Lecture 17-18
U.C. Berkeley CS278: Compuaional Complexiy Handou N7-8 Professor Luca Trevisan April 3-8, 2008 Noes for Lecure 7-8 In hese wo lecures we prove he firs half of he PCP Theorem, he Amplificaion Lemma, up
More informationh[n] is the impulse response of the discrete-time system:
Definiion Examples Properies Memory Inveribiliy Causaliy Sabiliy Time Invariance Lineariy Sysems Fundamenals Overview Definiion of a Sysem x() h() y() x[n] h[n] Sysem: a process in which inpu signals are
More informationSpring Ammar Abu-Hudrouss Islamic University Gaza
Chaper 7 Reed-Solomon Code Spring 9 Ammar Abu-Hudrouss Islamic Universiy Gaza ١ Inroducion A Reed Solomon code is a special case of a BCH code in which he lengh of he code is one less han he size of he
More informationAn introduction to the theory of SDDP algorithm
An inroducion o he heory of SDDP algorihm V. Leclère (ENPC) Augus 1, 2014 V. Leclère Inroducion o SDDP Augus 1, 2014 1 / 21 Inroducion Large scale sochasic problem are hard o solve. Two ways of aacking
More informationLecture 1 Overview. course mechanics. outline & topics. what is a linear dynamical system? why study linear systems? some examples
EE263 Auumn 27-8 Sephen Boyd Lecure 1 Overview course mechanics ouline & opics wha is a linear dynamical sysem? why sudy linear sysems? some examples 1 1 Course mechanics all class info, lecures, homeworks,
More informationDescription of the MS-Regress R package (Rmetrics)
Descriion of he MS-Regress R ackage (Rmerics) Auhor: Marcelo Perlin PhD Suden / ICMA Reading Universiy Email: marceloerlin@gmail.com / m.erlin@icmacenre.ac.uk The urose of his documen is o show he general
More informationHamilton- J acobi Equation: Weak S olution We continue the study of the Hamilton-Jacobi equation:
M ah 5 7 Fall 9 L ecure O c. 4, 9 ) Hamilon- J acobi Equaion: Weak S oluion We coninue he sudy of he Hamilon-Jacobi equaion: We have shown ha u + H D u) = R n, ) ; u = g R n { = }. ). In general we canno
More informationChapter 3 Common Families of Distributions
Chaer 3 Common Families of Disribuions Secion 31 - Inroducion Purose of his Chaer: Caalog many of common saisical disribuions (families of disribuions ha are indeed by one or more arameers) Wha we should
More information5. Stochastic processes (1)
Lec05.pp S-38.45 - Inroducion o Teleraffic Theory Spring 2005 Conens Basic conceps Poisson process 2 Sochasic processes () Consider some quaniy in a eleraffic (or any) sysem I ypically evolves in ime randomly
More informationLet us start with a two dimensional case. We consider a vector ( x,
Roaion marices We consider now roaion marices in wo and hree dimensions. We sar wih wo dimensions since wo dimensions are easier han hree o undersand, and one dimension is a lile oo simple. However, our
More informationKEY. Math 334 Midterm III Winter 2008 section 002 Instructor: Scott Glasgow
KEY Mah 334 Miderm III Winer 008 secion 00 Insrucor: Sco Glasgow Please do NOT wrie on his exam. No credi will be given for such work. Raher wrie in a blue book, or on your own paper, preferably engineering
More informationON DETERMINATION OF SOME CHARACTERISTICS OF SEMI-MARKOV PROCESS FOR DIFFERENT DISTRIBUTIONS OF TRANSIENT PROBABILITIES ABSTRACT
Zajac, Budny ON DETERMINATION O SOME CHARACTERISTICS O SEMI MARKOV PROCESS OR DIERENT DISTRIBUTIONS O R&RATA # 2(3 ar 2 (Vol. 2 29, June ON DETERMINATION O SOME CHARACTERISTICS O SEMI-MARKOV PROCESS OR
More informationLecture 6 - Testing Restrictions on the Disturbance Process (References Sections 2.7 and 2.10, Hayashi)
Lecure 6 - esing Resricions on he Disurbance Process (References Secions 2.7 an 2.0, Hayashi) We have eveloe sufficien coniions for he consisency an asymoic normaliy of he OLS esimaor ha allow for coniionally
More informationf(t) dt, x > 0, is the best value and it is the norm of the
MATEMATIQKI VESNIK 66, 1 (214), 19 32 March 214 originalni nauqni rad research aer GENERALIZED HAUSDORFF OPERATORS ON WEIGHTED HERZ SPACES Kuang Jichang Absrac. In his aer, we inroduce new generalized
More informationCrossing the Bridge between Similar Games
Crossing he Bridge beween Similar Games Jan-David Quesel, Marin Fränzle, and Werner Damm Universiy of Oldenburg, Deparmen of Compuing Science, Germany CMACS Seminar CMU, Pisburgh, PA, USA 2nd December
More informationInventory-Based Empty Container Repositioning in a Multi-Port System
Invenory-Based Emy Conainer Reosiioning in a Muli-Por ysem Loo Hay Lee Ek Peng Chew Yi Luo earmen of Indusrial & ysems Engineering Naional Universiy of ingaore ingaore 119260 E-mails: {iseleelh isece iseluoy}@nus.edu.sg
More informationODEs II, Lecture 1: Homogeneous Linear Systems - I. Mike Raugh 1. March 8, 2004
ODEs II, Lecure : Homogeneous Linear Sysems - I Mike Raugh March 8, 4 Inroducion. In he firs lecure we discussed a sysem of linear ODEs for modeling he excreion of lead from he human body, saw how o ransform
More informationGuest Lectures for Dr. MacFarlane s EE3350 Part Deux
Gues Lecures for Dr. MacFarlane s EE3350 Par Deux Michael Plane Mon., 08-30-2010 Wrie name in corner. Poin ou his is a review, so I will go faser. Remind hem o go lisen o online lecure abou geing an A
More informationO.R. Theory and it s Application Multi-Component Commercial Bank Branch Progress and Regress: An Application of Data Envelopment Analysis
Inernaional Mahemaical Forum, 1, 2006, no. 33, 1635-1644 O.R. Theory and i s Alicaion Muli-Comonen Commercial Bank Branch Progress and Regress: An Alicaion of Daa Envelomen Analysis A. Divandari Dearmen
More informationLinear Cryptanalysis
Linear Crypanalysis T-79.550 Crypology Lecure 5 February 6, 008 Kaisa Nyberg Linear Crypanalysis /36 SPN A Small Example Linear Crypanalysis /36 Linear Approximaion of S-boxes Linear Crypanalysis 3/36
More informationLinear Response Theory: The connection between QFT and experiments
Phys540.nb 39 3 Linear Response Theory: The connecion beween QFT and experimens 3.1. Basic conceps and ideas Q: How do we measure he conduciviy of a meal? A: we firs inroduce a weak elecric field E, and
More informationSOLUTIONS TO ECE 3084
SOLUTIONS TO ECE 384 PROBLEM 2.. For each sysem below, specify wheher or no i is: (i) memoryless; (ii) causal; (iii) inverible; (iv) linear; (v) ime invarian; Explain your reasoning. If he propery is no
More information11!Hí MATHEMATICS : ERDŐS AND ULAM PROC. N. A. S. of decomposiion, properly speaking) conradics he possibiliy of defining a counably addiive real-valu
ON EQUATIONS WITH SETS AS UNKNOWNS BY PAUL ERDŐS AND S. ULAM DEPARTMENT OF MATHEMATICS, UNIVERSITY OF COLORADO, BOULDER Communicaed May 27, 1968 We shall presen here a number of resuls in se heory concerning
More informationOrientation. Connections between network coding and stochastic network theory. Outline. Bruce Hajek. Multicast with lost packets
Connecions beween nework coding and sochasic nework heory Bruce Hajek Orienaion On Thursday, Ralf Koeer discussed nework coding: coding wihin he nework Absrac: Randomly generaed coded informaion blocks
More informationSpeaker Adaptation Techniques For Continuous Speech Using Medium and Small Adaptation Data Sets. Constantinos Boulis
Speaker Adapaion Techniques For Coninuous Speech Using Medium and Small Adapaion Daa Ses Consaninos Boulis Ouline of he Presenaion Inroducion o he speaker adapaion problem Maximum Likelihood Sochasic Transformaions
More informationScheduling of Crude Oil Movements at Refinery Front-end
Scheduling of Crude Oil Movemens a Refinery Fron-end Ramkumar Karuppiah and Ignacio Grossmann Carnegie Mellon Universiy ExxonMobil Case Sudy: Dr. Kevin Furman Enerprise-wide Opimizaion Projec March 15,
More informationRobotics I. April 11, The kinematics of a 3R spatial robot is specified by the Denavit-Hartenberg parameters in Tab. 1.
Roboics I April 11, 017 Exercise 1 he kinemaics of a 3R spaial robo is specified by he Denavi-Harenberg parameers in ab 1 i α i d i a i θ i 1 π/ L 1 0 1 0 0 L 3 0 0 L 3 3 able 1: able of DH parameers of
More informationOn the Existence, Uniqueness and Stability Behavior of a Random Solution to a Non local Perturbed Stochastic Fractional Integro-Differential Equation
On he Exisence, Uniqueness and Sabiliy ehavior of a Random Soluion o a Non local Perurbed Sochasic Fracional Inegro-Differenial Equaion Mahmoud M. El-orai,*, M.A.Abdou, Mohamed Ibrahim M. Youssef Dearmen
More informationPhysics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle
Chaper 2 Newonian Mechanics Single Paricle In his Chaper we will review wha Newon s laws of mechanics ell us abou he moion of a single paricle. Newon s laws are only valid in suiable reference frames,
More informationMODELLING DISTRIBUTED MANUFACTURING SYSTEMS VIA FIRST ORDER HYBRID PETRI NETS. Mariagrazia Dotoli, Maria Pia Fanti, Agostino Marcello Mangini
MODELLING DISTRIBUTED MANUFACTURING SYSTEMS VIA FIRST ORDER HYBRID PETRI NETS Mariagrazia Dooli, Maria Pia Fani, Agosino Marcello Mangini Diarimeno di Eleroecnica ed Eleronica, Poliecnico di Bari, Ialy
More informationEnsamble methods: Bagging and Boosting
Lecure 21 Ensamble mehods: Bagging and Boosing Milos Hauskrech milos@cs.pi.edu 5329 Senno Square Ensemble mehods Mixure of expers Muliple base models (classifiers, regressors), each covers a differen par
More informationOnline Learning with Partial Feedback. 1 Online Mirror Descent with Estimated Gradient
Avance Course in Machine Learning Spring 2010 Online Learning wih Parial Feeback Hanous are joinly prepare by Shie Mannor an Shai Shalev-Shwarz In previous lecures we alke abou he general framework of
More informationPresentation Overview
Acion Refinemen in Reinforcemen Learning by Probabiliy Smoohing By Thomas G. Dieerich & Didac Busques Speaer: Kai Xu Presenaion Overview Bacground The Probabiliy Smoohing Mehod Experimenal Sudy of Acion
More informationOnline Learning Applications
Online Learning Applicaions Sepember 19, 2016 In he las lecure we saw he following guaranee for minimizing misakes wih Randomized Weighed Majoriy (RWM). Theorem 1 Le M be misakes of RWM and M i he misakes
More informationThe Arcsine Distribution
The Arcsine Disribuion Chris H. Rycrof Ocober 6, 006 A common heme of he class has been ha he saisics of single walker are ofen very differen from hose of an ensemble of walkers. On he firs homework, we
More information23.2. Representing Periodic Functions by Fourier Series. Introduction. Prerequisites. Learning Outcomes
Represening Periodic Funcions by Fourier Series 3. Inroducion In his Secion we show how a periodic funcion can be expressed as a series of sines and cosines. We begin by obaining some sandard inegrals
More informationMath 315: Linear Algebra Solutions to Assignment 6
Mah 35: Linear Algebra s o Assignmen 6 # Which of he following ses of vecors are bases for R 2? {2,, 3, }, {4,, 7, 8}, {,,, 3}, {3, 9, 4, 2}. Explain your answer. To generae he whole R 2, wo linearly independen
More informationStability analysis of semiconductor manufacturing process with EWMA run-to-run controllers
Sabiliy analysis of semiconducor manufacuring rocess wih EWMA run-o-run conrollers Bing Ai a, David Shan-Hill Wong b, Shi-Shang Jang b a Dearmen of Comuer Science, Universiy of exas a Ausin, exas, USA
More informationLongest Common Prefixes
Longes Common Prefixes The sandard ordering for srings is he lexicographical order. I is induced by an order over he alphabe. We will use he same symbols (,
More informationFORECASTS GENERATING FOR ARCH-GARCH PROCESSES USING THE MATLAB PROCEDURES
FORECASS GENERAING FOR ARCH-GARCH PROCESSES USING HE MALAB PROCEDURES Dušan Marček, Insiue of Comuer Science, Faculy of Philosohy and Science, he Silesian Universiy Oava he Faculy of Managemen Science
More informationnon -negative cone Population dynamics motivates the study of linear models whose coefficient matrices are non-negative or positive.
LECTURE 3 Linear/Nonnegaive Marix Models x ( = Px ( A= m m marix, x= m vecor Linear sysems of difference equaions arise in several difference conexs: Linear approximaions (linearizaion Perurbaion analysis
More informationResource Allocation in Visible Light Communication Networks NOMA vs. OFDMA Transmission Techniques
Resource Allocaion in Visible Ligh Communicaion Neworks NOMA vs. OFDMA Transmission Techniques Eirini Eleni Tsiropoulou, Iakovos Gialagkolidis, Panagiois Vamvakas, and Symeon Papavassiliou Insiue of Communicaions
More informationL07. KALMAN FILTERING FOR NON-LINEAR SYSTEMS. NA568 Mobile Robotics: Methods & Algorithms
L07. KALMAN FILTERING FOR NON-LINEAR SYSTEMS NA568 Mobile Roboics: Mehods & Algorihms Today s Topic Quick review on (Linear) Kalman Filer Kalman Filering for Non-Linear Sysems Exended Kalman Filer (EKF)
More informationApplication of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing
Applicaion of a Sochasic-Fuzzy Approach o Modeling Opimal Discree Time Dynamical Sysems by Using Large Scale Daa Processing AA WALASZE-BABISZEWSA Deparmen of Compuer Engineering Opole Universiy of Technology
More informationSolutions for Assignment 2
Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218 Soluions for ssignmen 2 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how Go-ack n RQ can be
More informationContinuous Time Markov Chain (Markov Process)
Coninuous Time Markov Chain (Markov Process) The sae sace is a se of all non-negaive inegers The sysem can change is sae a any ime ( ) denoes he sae of he sysem a ime The random rocess ( ) forms a coninuous-ime
More informationThis document was generated at 1:04 PM, 09/10/13 Copyright 2013 Richard T. Woodward. 4. End points and transversality conditions AGEC
his documen was generaed a 1:4 PM, 9/1/13 Copyrigh 213 Richard. Woodward 4. End poins and ransversaliy condiions AGEC 637-213 F z d Recall from Lecure 3 ha a ypical opimal conrol problem is o maimize (,,
More informationEnsamble methods: Boosting
Lecure 21 Ensamble mehods: Boosing Milos Hauskrech milos@cs.pi.edu 5329 Senno Square Schedule Final exam: April 18: 1:00-2:15pm, in-class Term projecs April 23 & April 25: a 1:00-2:30pm in CS seminar room
More informationSome Ramsey results for the n-cube
Some Ramsey resuls for he n-cube Ron Graham Universiy of California, San Diego Jozsef Solymosi Universiy of Briish Columbia, Vancouver, Canada Absrac In his noe we esablish a Ramsey-ype resul for cerain
More informationDirac s hole theory and the Pauli principle: clearing up the confusion.
Dirac s hole heory and he Pauli rincile: clearing u he conusion. Dan Solomon Rauland-Borg Cororaion 8 W. Cenral Road Moun Prosec IL 656 USA Email: dan.solomon@rauland.com Absrac. In Dirac s hole heory
More informationUNIVERSITY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences EECS 121 FINAL EXAM
Name: UNIVERSIY OF CALIFORNIA College of Engineering Deparmen of Elecrical Engineering and Compuer Sciences Professor David se EECS 121 FINAL EXAM 21 May 1997, 5:00-8:00 p.m. Please wrie answers on blank
More informationAppendix to Online l 1 -Dictionary Learning with Application to Novel Document Detection
Appendix o Online l -Dicionary Learning wih Applicaion o Novel Documen Deecion Shiva Prasad Kasiviswanahan Huahua Wang Arindam Banerjee Prem Melville A Background abou ADMM In his secion, we give a brief
More informationChapter Floating Point Representation
Chaper 01.05 Floaing Poin Represenaion Afer reading his chaper, you should be able o: 1. conver a base- number o a binary floaing poin represenaion,. conver a binary floaing poin number o is equivalen
More informationOperators related to the Jacobi setting, for all admissible parameter values
Operaors relaed o he Jacobi seing, for all admissible parameer values Peer Sjögren Universiy of Gohenburg Join work wih A. Nowak and T. Szarek Alba, June 2013 () 1 / 18 Le Pn α,β be he classical Jacobi
More informationSpeech and Language Processing
Speech and Language rocessing Lecure 4 Variaional inference and sampling Informaion and Communicaions Engineering Course Takahiro Shinozaki 08//5 Lecure lan (Shinozaki s par) I gives he firs 6 lecures
More informationTwo Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017
Two Popular Bayesian Esimaors: Paricle and Kalman Filers McGill COMP 765 Sep 14 h, 2017 1 1 1, dx x Bel x u x P x z P Recall: Bayes Filers,,,,,,, 1 1 1 1 u z u x P u z u x z P Bayes z = observaion u =
More informationThe stable manifold approach for optimal swing up and stabilization of an inverted pendulum with input saturation
Conrol Sysems Enineerin Aerosace Enineerin UNIERSIY he sable manifold aroach for oimal swin u and sabilizaion of an invered endulum wih inu sauraion Ryu Fujimoo and Noboru Saamoo Naoya Universiy IFAC World
More informationcontrol properties under both Gaussian and burst noise conditions. In the ~isappointing in comparison with convolutional code systems designed
535 SOFT-DECSON THRESHOLD DECODNG OF CONVOLUTONAL CODES R.M.F. Goodman*, B.Sc., Ph.D. W.H. Ng*, M.S.E.E. Sunnnary Exising majoriy-decision hreshold decoders have so far been limied o his paper a new mehod
More informationAdaptation and Synchronization over a Network: stabilization without a reference model
Adapaion and Synchronizaion over a Nework: sabilizaion wihou a reference model Travis E. Gibson (gibson@mi.edu) Harvard Medical School Deparmen of Pahology, Brigham and Women s Hospial 55 h Conference
More informationDecentralized Large-Scale Power Balancing
Decenralized Large-Scale Balancing Rasmus Halvgaard, John B. Jørgensen, Niels K. Poulsen, and Henri Madsen Dearmen of Alied Mahemaics and Comuer Science Technical Universiy of Denmar, DK-28 Kgs. Lyngby,
More informationLecture Notes 2. The Hilbert Space Approach to Time Series
Time Series Seven N. Durlauf Universiy of Wisconsin. Basic ideas Lecure Noes. The Hilber Space Approach o Time Series The Hilber space framework provides a very powerful language for discussing he relaionship
More informationProblem Set 5. Graduate Macro II, Spring 2017 The University of Notre Dame Professor Sims
Problem Se 5 Graduae Macro II, Spring 2017 The Universiy of Nore Dame Professor Sims Insrucions: You may consul wih oher members of he class, bu please make sure o urn in your own work. Where applicable,
More informationFast Approximate Energy Minimization via Graph Cuts
Proceedings of Inernaion Conference on Comuer Vision, Kerkyra, Greece, Seember 1999 vol.i,.377 Fas Aroximae Energy Minimizaion via Grah Cus Yuri Boykov Olga Veksler Ramin Zabih Comuer Science Dearmen Cornell
More information