A Tour of Modeling Techniques
|
|
- Imogene Shaw
- 5 years ago
- Views:
Transcription
1 A Tour of Modelng Technques John Hooker Carnege Mellon Unversy EWO Semnar February 8 Slde
2 Oulne Med neger lnear (MILP) modelng Dsuncve modelng Knapsack modelng Consran programmng models Inegraed Models Slde
3 Med Ineger/Lnear Modelng MILP Models Dsuncve Modelng Knapsack Modelng Slde 3
4 MILP models An med neger lnear programmng (MILP) model has he form mn c + dy A + by b, y y neger Slde 4
5 A prncpled approach o MILP modelng MILP modelng combnes wo dsnc knds of modelng. Modelng of subses of connuous space, usng - aulary varables. Knapsack modelng, usng general neger varables. MILP can model subses of connuous space ha are unons of polyhedra. ha s, represened by dsuncons of lnear sysems. So a prncpled approach s o analyze he problem as dsuncons neger of lnear + knapsack sysems nequales Slde 5
6 Dsuncve Modelng Theorem. A subse of connuous space can be represened by an MILP model f and only f s he unon of fnely many polyhedra havng he same recesson cone. Recesson cone of polyhedron Polyhedron Unon of polyhedra wh he same recesson cone (n hs case, he orgn) Slde 6
7 Modelng a unon of polyhedra Sar wh a dsuncon of lnear sysems o represen he unon of polyhedra. The kh polyhedron s { A k b} mn c ( k k A b ) k Inroduce a - varable y k ha s when s n polyhedron k. Dsaggregae o creae an k for each k. mn c k k k A b y, all k k k y = y k k = k {,} k Slde 7
8 Tgh Relaaons Basc fac: The connuous relaaon of he dsuncve MILP model provdes a conve hull relaaon of he dsuncon. Ths s he ghes possble lnear model for he dsuncon. Unon of polyhedra Conve hull relaaon (ghes lnear relaaon) Slde 8
9 Eample: Fed charge funcon Mnmze a fed charge funcon: mn f = f + c f > Slde 9
10 Fed charge problem Mnmze a fed charge funcon: mn f = f + c f > Feasble se Slde
11 Fed charge problem Mnmze a fed charge funcon: mn f = f + c f > Unon of wo polyhedra P, P P Slde
12 Fed charge problem Mnmze a fed charge funcon: mn f = f + c f > Unon of wo polyhedra P, P P P Slde
13 Fed charge problem Mnmze a fed charge funcon: mn f = f + c f > The polyhedra have dfferen recesson cones. P P Slde 3 P recesson cone P recesson cone
14 Fed charge problem Mnmze a fed charge funcon: Add an upper bound on mn f = f + c f > M The polyhedra have he same recesson cone. P P Slde 4 M P recesson cone P recesson cone
15 Fed charge problem Sar wh a dsuncon of lnear sysems o represen he unon of polyhedra mn = M f + c P P Slde 5 M
16 Fed charge problem Sar wh a dsuncon of lnear sysems o represen he unon of polyhedra Inroduce a - varable y k ha s when s n polyhedron k. Dsaggregae o creae an k for each k. mn = M f + c mn = My + c fy { } y + y =, y, k = +, = + Slde 6
17 To smplfy, replace wh snce = mn = My + c fy { } y + y =, y, k = +, = + Slde 7
18 To smplfy, replace wh snce = mn + = + { } y + y =, y, k My c fy Slde 8
19 Replace wh because plays no role n he model mn + = + { } y + y =, y, k My c fy Slde 9
20 Replace wh Because plays no role n he model mn { } y + y =, y, k My c + fy Slde
21 Replace y wh y Because y plays no role n he model mn { } y + y =, y, k My c + fy Slde
22 Replace y wh y Because y plays no role n he model mn My y c + fy {, } or mn c + fy y My {,} Bg M Slde
23 Eample: Uncapacaed facly locaon m possble facory locaons n markes Locae facores o serve markes so as o mnmze oal fed cos and ranspor cos. No lm on producon capacy of each facory. Fed cos f c Transpor cos Slde 3
24 Uncapacaed facly locaon m possble facory locaons n markes Dsuncve model: mn z + c, all =, all, all z f z = =, all Fracon of marke s demand sasfed from locaon Fed cos f c Transpor cos Facory a locaon No facory a locaon Slde 4
25 Uncapacaed facly locaon Dsuncve model: mn z + c MILP formulaon: Slde 5 mn, all, =, all, z f y, all z =, all = + z = z + z y, all =, all, all z f z = =, all z + c y =, all { },,,
26 Uncapacaed facly locaon = Le snce z = z Le snce = z = MILP formulaon: Slde 6 mn, all, =, all, z f y, all z =, all = + z = z + z y z + c y =, all { },,,
27 Uncapacaed facly locaon Le snce z = = z Le snce = z = MILP formulaon: Slde 7 mn y, all, z y, all {,} z + c f y =, all
28 Uncapacaed facly locaon Le snce z = = z Le snce = z = MILP formulaon: Slde 8 mn y, all, z y, all {,} z + c f y =, all or mn {,} f y + c y, all, y =, all
29 Uncapacaed facly locaon Mamum oupu from locaon MILP formulaon: mn y, all, y {,} f y + c =, all Begnner s model: mn y ny, all {,} f y + c =, all Based on capacaed locaon model. I has a weaker connuous relaaon Slde 9 Ths begnner s msake can be avoded by sarng wh dsuncve formulaon.
30 Eample: Lo szng wh seup coss Ma producon level Seup cos ncurred = Demand = D D D D 3 D 4 D 5 D 6 Deermne lo sze n each perod o mnmze oal producon, nvenory, and seup coss. Slde 3
31 Fed-cos varable Fed cos Producon capacy Producon level v f v v C C = () Sar producon (ncurs seup cos) Logcal condons: () Connue producon (no seup cos) (3) Produce nohng (no producon cos) () In perod () or () n perod () In perod neher () nor () n perod Slde 3
32 () Sar producon () Connue producon (3) Produce nohng v f v v C C = Conve hull MILP model of dsuncon: v f y Cy v Cy v 3 3 = k k =, =, = k k = k = k = v v y y y k {,}, k =,,3 Slde 3
33 To smplfy, defne z = y y = y Conve hull MILP model of dsuncon: v f y Cy v Cy v 3 3 = k k =, =, = k k = k = k = v v y y y k {,}, k =,,3 Slde 33
34 To smplfy, defne z = y y = y Conve hull MILP model of dsuncon: v f z C z v Cy v 3 3 = 3 3 k k =, =, z + y k = k = v v z, y {,}, k =,,3 Slde 34 = for sarup = for connued producon
35 Snce = se 3 = + Conve hull MILP model of dsuncon: v f z Cz v Cy v 3 3 = 3 3 k k k = k = v = v, =, z + y z, y {,}, k =,,3 Slde 35
36 Snce = se 3 = + Conve hull MILP model of dsuncon: C ( z + y ) v f z v v 3 3 k k = v = v, z + y z, y {,}, k =,,3 Slde 36
37 Snce v occurs posvely n he obecve funcon, 3 and v, v do no play a role, le v = v Conve hull MILP model of dsuncon: v f z C ( z + y ) v v 3 3 k k = v = v, z + y z, y {,}, k =,,3 Slde 37
38 Snce v occurs posvely n he obecve funcon, 3 and v, v do no play a role, le v = v Conve hull MILP model of dsuncon: v f z C ( z + y ) + y z, y {,}, k =,,3 z Slde 38
39 Formulae logcal condons: () In perod () or () n perod () In perod neher () nor () n perod v f z C ( z + y ) z y z, y {,}, k =,,3 z + y z + y z y Slde 39
40 Add obecve funcon Un producon cos Un holdng cos n mn ( p + h s + v ) = v f z C ( z + y ) + y z, y {,}, k =,,3 z y z + y z z y Slde 4
41 Knapsack Models Ineger varables can also be used o epress counng deas. Ths s oally dfferen from he use of - varables o epress unons of polyhedra. Slde 4
42 Eample: Fregh Transfer Transpor 4 ons of fregh usng 8 rucks, whch come n 4 szes Truck sze Number avalable Capacy (ons) Cos per ruck Slde
43 Number of rucks of ype Knapsack packng consran mn {,,,3} 8 Knapsack coverng consran Truck ype Number avalable Capacy (ons) Cos per ruck Slde
44 Eample: Fregh Packng and Transfer Transpor packages usng n rucks Each package has sze a. Each ruck has capacy Q. Slde 44
45 Knapsack componen The rucks seleced mus have enough capacy o carry he load. n = Q y a = f ruck s seleced Slde 45
46 Dsuncve componen (wh embedded knapsack consran) Cos varable Slde 46 Truck seleced Truck no seleced z c z a Q =, all Use connuous relaaon because we wan a dsuncon of lnear sysems Cos of operang ruck = f package s loaded on ruck
47 Dsuncve componen (wh embedded knapsack consran) Truck seleced Truck no seleced z c z a Q =, all Conve hull MILP formulaon z a c y Q y y Slde 47
48 The resulng model = = mn n = a Q y, all y, all, n n Q y =, all, y {,} c y a Dsuncve componen Logcal condon (each package mus be shpped) Knapsack componen Slde 48
49 The resulng model = = mn n = a Q y, all y, all, n n Q y =, all, y {,} c y a The y s redundan bu makes he connuous relaaon gher. Ths s a modelng rck, par of he folklore of modelng. Slde 49
50 The resulng model = Slde 5 = mn n = a Q y, all y, all, n n Q y =, all, y {,} c y a The y s redundan bu makes he connuous relaaon gher. Ths s a modelng rck, par of he folklore of modelng. Convenonal modelng wsdom would no use hs consran, because s he sum of he frs consran over. Bu radcally reduces soluon me, because generaes knapsack cus. Ths argues for a prncpled approach o modelng.
51 Consran Programmng Models Global Consrans Employee Schedulng Slde 5
52 Global consrans A global consran represens a se of consrans wh specal srucure. The srucure s eploed by flerng algorhms n he CP solver. Slde 5
53 Some general-purpose global consrans Alldff - Requres ha all he lsed varables ake dfferen values. Among - Bounds he number of lsed varables ha ake one of he values n a ls. Cardnaly - Bounds he number of lsed varables ha ake each of he values n a ls. Elemen - Requres ha a gven varable ake he yh value n a ls, where y s an neger varable. Pah - Requres ha a gven graph conan a pah of a mos a gven lengh. Slde 53
54 Some global consrans for schedulng Dsuncve - Requres ha no wo obs overlap n me. Cumulave - Lms he resources consumed by obs runnng a any one me. In parcular, can lm he number of obs runnng a any one me. Srech - Bounds he lengh of a srech of conguous perods assgned he same ob. Sequence A se of overlappng among consrans. Regular Generalzes srech and sequence. Dffn - Requres ha no wo boes n a se of muldmensonal boes overlap. Used for space or space-me packng. Slde 54
55 Eample: Employee Schedulng Schedule four nurses n 8-hour shfs. A nurse works a mos one shf a day, a leas 5 days a week. Same schedule every week. No shf saffed by more han wo dfferen nurses n a week. A nurse canno work dfferen shfs on wo consecuve days. A nurse who works shf or 3 mus do so a leas wo days n a row. Slde 55
56 Two ways o vew he problem Assgn nurses o shfs Sun Mon Tue Wed Thu Fr Sa Shf A B A A A A A Shf C C C B B B B Shf 3 D D D D C C D Assgn shfs o nurses Sun Mon Tue Wed Thu Fr Sa Nurse A Nurse B Nurse C 3 3 Nurse D Slde 56 = day off
57 Use boh formulaons n he same model! Frs, assgn nurses o shfs. Le w sd = nurse assgned o shf s on day d alldff( w, w, w ), all d The varables w d, w d, d d 3d w 3d ake dfferen values Tha s, schedule 3 dfferen nurses on each day Slde 57
58 Use boh formulaons n he same model! Frs, assgn nurses o shfs. Le w sd = nurse assgned o shf s on day d alldff( w, w, w ), all d d 3d ( w A B C D ) cardnaly (,,, ),(5,5,5,5),(6,6,6,6) d A occurs a leas 5 and a mos 6 mes n he array w, and smlarly for B, C, D. Tha s, each nurse works a leas 5 and a mos 6 days a week Slde 58
59 Use boh formulaons n he same model! Frs, assgn nurses o shfs. Le w sd = nurse assgned o shf s on day d ( w d wd w3d ) d ( w A B C D ) alldff,,, all cardnaly (,,, ),(5,5,5,5),(6,6,6,6) ( ) nvalues w,..., w,, all s s,sun s,sa The varables w s,sun,, w s,sa ake a leas and a mos dfferen values. Slde 59 Tha s, a leas and a mos nurses work any gven shf.
60 Remanng consrans are no easly epressed n hs noaon. So, assgn shfs o nurses. Le y d = nurse assgned o shf s on day d alldff (,, ) y y y, all d d d 3d Assgn a dfferen nurse o each shf on each day. Slde 6 Ths consran s redundan of prevous consrans, bu redundan consrans speed soluon.
61 Remanng consrans are no easly epressed n hs noaon. So, assgn shfs o nurses. Le y d = nurse assgned o shf s on day d alldff ( y, y, y ) d d 3d ( y y P ),Sun, all srech,, (,3),(,),(6,6),, all,sa d Every srech of s has lengh beween and 6. Every srech of 3 s has lengh beween and 6. So a nurse who works shf or 3 mus do so a leas wo days n a row. Slde 6
62 Remanng consrans are no easly epressed n hs noaon. So, assgn shfs o nurses. Le y d = nurse assgned o shf s on day d alldff ( y, y, y ) d d 3d ( y y P ),Sun, all srech,, (,3),(,),(6,6),, all,sa d Here P = {(s,),(,s) s =,,3} Whenever a srech of a s mmedaely precedes a srech of b s, (a,b) mus be one of he pars n P. So a nurse canno swch shfs whou akng a leas one day off. Slde 6
63 Now we mus connec he w sd varables o he y d varables. Use channelng consrans: w =, all y d d y = s, all s w sd d Channelng consrans ncrease propagaon and make he problem easer o solve. Slde 63
64 The complee model s: ( w d wd w3d ) d ( w A B C D ) alldff,,, all cardnaly (,,, ),(5,5,5,5),(6,6,6,6) ( ) nvalues w,..., w,, all s alldff s,sun ( y, y, y ) d d 3d s,sa ( y y P ),Sun, all srech,, (,3),(,),(6,6),, all,sa d w =, all y d d y = s, all s w sd d Slde 64
65 Inegraed Models Produc Confguraon Machne Assgnmen and Schedulng Slde 65
66 Eample: Produc Confguraon Ths eample combnes MILP modelng wh varable ndces, used n consran programmng. I can be solved by combnng MILP and CP echnques. Slde 66
67 The problem Choose wha ype of each componen, and how many Memory Memory Memory Memory Memory Memory Personal compuer Power supply Dsk drve Dsk drve Dsk drve Dsk drve Dsk drve Power supply Power supply Power supply Slde 67
68 Inegraed model Un cos of producng arbue Amoun of arbue produced (< f consumed): memory, hea, power, wegh, ec. mn c v v = q A, all k L v U, all Amoun of arbue produced by ype of componen Quany of componen nsalled Slde 68
69 Inegraed model Ths s reformulaed mn c v v = q A, all k L v U, all s a varable nde v z, all = ( n ) elemen,( q, A,, q A ), z, all, Slde 69
70 Inegraed model Ths s reformulaed mn c v v = q A, all k L v U, all s a varable nde v z, all = (,, n z ) elemen,( q A q A ),, all, Slde 7 Se z equal o he h em n he red ls.
71 Machne Assgnmen and Schedulng Assgn obs o machnes and schedule he machnes assgned o each machne whn me wndows. The obecve s o mnmze makespan. Tme lapse beween sar of frs ob and end of las ob. Combne MILP and CP modelng Slde 7
72 Machne Schedulng The model s Sar me varable for ob mn M M s + p, all r s d p, all Processng me of ob on machne Machne assgned o ob ( = = ) dsuncve ( s ),( p ), all Makespan Slde 7
73 Machne Schedulng The model s Release me for ob mn M M s + p, all r s d p, all ( = = ) dsuncve ( s ),( p ), all Tme wndows Deadlne for ob Slde 73
74 Machne Schedulng The model s mn M M s + p, all r s d p, all ( = = ) dsuncve ( s ),( p ), all Sar mes of obs assgned o machne Dsuncve global consran requres ha Jobs do no overlap Slde 74
75 Machne Schedulng The problem can be solved by logc-based Benders decomposon. mn M M s + p, all r s d p, all ( = = ) dsuncve ( s ),( p ), all Maser problem s hs plus Benders cus, solved as an MILP Slde 75
76 Machne Schedulng The problem can be solved by logc-based Benders decomposon. mn M M s + p, all r s d p, all ( = = ) dsuncve ( s ),( p ), all Maser problem s hs plus Benders cus, solved as an MILP Subproblem s hs, solved by CP Slde 76
A Principled Approach to MILP Modeling
A Prncpled Approach o MILP Modelng John Hooer Carnege Mellon Unvers Augus 008 Slde Proposal MILP modelng s an ar, bu need no be unprncpled. Slde Proposal MILP modelng s an ar, bu need no be unprncpled.
More informationGraduate Macroeconomics 2 Problem set 5. - Solutions
Graduae Macroeconomcs 2 Problem se. - Soluons Queson 1 To answer hs queson we need he frms frs order condons and he equaon ha deermnes he number of frms n equlbrum. The frms frs order condons are: F K
More informationSolution in semi infinite diffusion couples (error function analysis)
Soluon n sem nfne dffuson couples (error funcon analyss) Le us consder now he sem nfne dffuson couple of wo blocks wh concenraon of and I means ha, n a A- bnary sysem, s bondng beween wo blocks made of
More informationNotes on the stability of dynamic systems and the use of Eigen Values.
Noes on he sabl of dnamc ssems and he use of Egen Values. Source: Macro II course noes, Dr. Davd Bessler s Tme Seres course noes, zarads (999) Ineremporal Macroeconomcs chaper 4 & Techncal ppend, and Hamlon
More informationDynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005
Dynamc Team Decson Theory EECS 558 Proec Shruvandana Sharma and Davd Shuman December 0, 005 Oulne Inroducon o Team Decson Theory Decomposon of he Dynamc Team Decson Problem Equvalence of Sac and Dynamc
More informationCombining Optimization and Constraint Programming
Combnng Opmzaon and Consran Programmng J. N. Hooker Carnege Mellon Unvers 4 h Inernaonal Conference on Operaons Research March Havana Some work s jon wh Ignaco Grossmann Carnege Mellon Unvers Hak-Jn Km
More informationHIERARCHICAL DECISIONS FOR LINEAR/NON-LINEAR DISJUNCTIVE PROBLEMS
2 nd Mercosur Congress on Chemcal Engneerng 4 h Mercosur Congress on Process Sysems Engneerng HIERARCHICAL DECISIONS FOR LINEAR/NON-LINEAR DISJUNCTIVE PROLEMS Jorge M. Monagna and Aldo R. Vecche * INGAR
More informationSingle-Facility Scheduling over Long Time Horizons by Logic-based Benders Decomposition
Sngle-Faclty Schedulng over Long Tme Horzons by Logc-based Benders Decomposton Elvn Coban and J. N. Hooker Tepper School of Busness, Carnege Mellon Unversty ecoban@andrew.cmu.edu, john@hooker.tepper.cmu.edu
More informationMechanics Physics 151
Mechancs Physcs 5 Lecure 0 Canoncal Transformaons (Chaper 9) Wha We Dd Las Tme Hamlon s Prncple n he Hamlonan formalsm Dervaon was smple δi δ Addonal end-pon consrans pq H( q, p, ) d 0 δ q ( ) δq ( ) δ
More informationCS286.2 Lecture 14: Quantum de Finetti Theorems II
CS286.2 Lecure 14: Quanum de Fne Theorems II Scrbe: Mara Okounkova 1 Saemen of he heorem Recall he las saemen of he quanum de Fne heorem from he prevous lecure. Theorem 1 Quanum de Fne). Le ρ Dens C 2
More informationEEL 6266 Power System Operation and Control. Chapter 5 Unit Commitment
EEL 6266 Power Sysem Operaon and Conrol Chaper 5 Un Commmen Dynamc programmng chef advanage over enumeraon schemes s he reducon n he dmensonaly of he problem n a src prory order scheme, here are only N
More informationModeling and Solving of Multi-Product Inventory Lot-Sizing with Supplier Selection under Quantity Discounts
nernaonal ournal of Appled Engneerng Research SSN 0973-4562 Volume 13, Number 10 (2018) pp. 8708-8713 Modelng and Solvng of Mul-Produc nvenory Lo-Szng wh Suppler Selecon under Quany Dscouns Naapa anchanaruangrong
More informationON THE LINEAR PROGRAMMING AND GROUP RELAXATIONS OF THE UNCAPACITATED FACILITY LOCATION PROBLEM
ON THE LINEAR PROGRAMMING AND GROUP RELAXATIONS O THE UNAPAITATED AILITY LOATION PROLEM MOHAMMAD KHALIL A THESIS PRESENTED TO THE GRADUATE SHOOL O THE UNIVERSITY O LORIDA IN PARTIAL ULILLMENT O THE REQUIREMENTS
More informationAdvanced Machine Learning & Perception
Advanced Machne Learnng & Percepon Insrucor: Tony Jebara SVM Feaure & Kernel Selecon SVM Eensons Feaure Selecon (Flerng and Wrappng) SVM Feaure Selecon SVM Kernel Selecon SVM Eensons Classfcaon Feaure/Kernel
More informationUNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 2017 EXAMINATION
INTERNATIONAL TRADE T. J. KEHOE UNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 27 EXAMINATION Please answer wo of he hree quesons. You can consul class noes, workng papers, and arcles whle you are workng on he
More informationCS 268: Packet Scheduling
Pace Schedulng Decde when and wha pace o send on oupu ln - Usually mplemened a oupu nerface CS 68: Pace Schedulng flow Ion Soca March 9, 004 Classfer flow flow n Buffer managemen Scheduler soca@cs.bereley.edu
More informationCHAPTER 10: LINEAR DISCRIMINATION
CHAPER : LINEAR DISCRIMINAION Dscrmnan-based Classfcaon 3 In classfcaon h K classes (C,C,, C k ) We defned dscrmnan funcon g j (), j=,,,k hen gven an es eample, e chose (predced) s class label as C f g
More informationOnline Supplement for Dynamic Multi-Technology. Production-Inventory Problem with Emissions Trading
Onlne Supplemen for Dynamc Mul-Technology Producon-Invenory Problem wh Emssons Tradng by We Zhang Zhongsheng Hua Yu Xa and Baofeng Huo Proof of Lemma For any ( qr ) Θ s easy o verfy ha he lnear programmng
More informationAn Integrated OR/CP Method for Planning and Scheduling
An Integrated OR/CP Method for Plannng and Schedulng John Hooer Carnege Mellon Unversty IT Unversty of Copenhagen June 2005 The Problem Allocate tass to facltes. Schedule tass assgned to each faclty. Subect
More informationReactive Methods to Solve the Berth AllocationProblem with Stochastic Arrival and Handling Times
Reacve Mehods o Solve he Berh AllocaonProblem wh Sochasc Arrval and Handlng Tmes Nsh Umang* Mchel Berlare* * TRANSP-OR, Ecole Polyechnque Fédérale de Lausanne Frs Workshop on Large Scale Opmzaon November
More informationComb Filters. Comb Filters
The smple flers dscussed so far are characered eher by a sngle passband and/or a sngle sopband There are applcaons where flers wh mulple passbands and sopbands are requred Thecomb fler s an example of
More informationIn the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!
ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL The frs hng o es n wo-way ANOVA: Is here neracon? "No neracon" means: The man effecs model would f. Ths n urn means: In he neracon plo (wh A on he horzonal
More information[ ] 2. [ ]3 + (Δx i + Δx i 1 ) / 2. Δx i-1 Δx i Δx i+1. TPG4160 Reservoir Simulation 2018 Lecture note 3. page 1 of 5
TPG460 Reservor Smulaon 08 page of 5 DISCRETIZATIO OF THE FOW EQUATIOS As we already have seen, fne dfference appromaons of he paral dervaves appearng n he flow equaons may be obaned from Taylor seres
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4
CS434a/54a: Paern Recognon Prof. Olga Veksler Lecure 4 Oulne Normal Random Varable Properes Dscrmnan funcons Why Normal Random Varables? Analycally racable Works well when observaon comes form a corruped
More informationComputational results on new staff scheduling benchmark instances
TECHNICAL REPORT Compuaonal resuls on new saff shedulng enhmark nsanes Tm Curos Rong Qu ASAP Researh Group Shool of Compuer Sene Unersy of Nongham NG8 1BB Nongham UK Frs pulshed onlne: 19-Sep-2014 las
More informationJohn Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany
Herarchcal Markov Normal Mxure models wh Applcaons o Fnancal Asse Reurns Appendx: Proofs of Theorems and Condonal Poseror Dsrbuons John Geweke a and Gann Amsano b a Deparmens of Economcs and Sascs, Unversy
More informationABSTRACT. KEYWORDS Hybrid, Genetic Algorithm, Shipping, Dispatching, Vehicle, Time Windows INTRODUCTION
A HYBRID GENETIC ALGORITH FOR A DYNAIC INBOUND ORDERING AND SHIPPING AND OUTBOUND DISPATCHING PROBLE WITH HETEROGENEOUS VEHICLE TYPES AND DELIVERY TIE WINDOWS by Byung Soo Km, Woon-Seek Lee, and Young-Seok
More informationOutline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model
Probablsc Model for Tme-seres Daa: Hdden Markov Model Hrosh Mamsuka Bonformacs Cener Kyoo Unversy Oulne Three Problems for probablsc models n machne learnng. Compung lkelhood 2. Learnng 3. Parsng (predcon
More informationLinear Response Theory: The connection between QFT and experiments
Phys540.nb 39 3 Lnear Response Theory: The connecon beween QFT and expermens 3.1. Basc conceps and deas Q: ow do we measure he conducvy of a meal? A: we frs nroduce a weak elecrc feld E, and hen measure
More informationV.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS
R&RATA # Vol.) 8, March FURTHER AALYSIS OF COFIDECE ITERVALS FOR LARGE CLIET/SERVER COMPUTER ETWORKS Vyacheslav Abramov School of Mahemacal Scences, Monash Unversy, Buldng 8, Level 4, Clayon Campus, Wellngon
More informationRobustness Experiments with Two Variance Components
Naonal Insue of Sandards and Technology (NIST) Informaon Technology Laboraory (ITL) Sascal Engneerng Dvson (SED) Robusness Expermens wh Two Varance Componens by Ana Ivelsse Avlés avles@ns.gov Conference
More informationClustering (Bishop ch 9)
Cluserng (Bshop ch 9) Reference: Daa Mnng by Margare Dunham (a slde source) 1 Cluserng Cluserng s unsupervsed learnng, here are no class labels Wan o fnd groups of smlar nsances Ofen use a dsance measure
More informationUsing Aggregation to Construct Periodic Policies for Routing Jobs to Parallel Servers with Deterministic Service Times
Usng Aggregaon o Consruc Perodc Polces for Roung Jobs o Parallel Servers wh Deermnsc Servce Tmes Jeffrey W. errmann A. James Clark School of Engneerng 2181 Marn all Unversy of Maryland College Park, MD
More information. The geometric multiplicity is dim[ker( λi. number of linearly independent eigenvectors associated with this eigenvalue.
Lnear Algebra Lecure # Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons
More informationChapter 6: AC Circuits
Chaper 6: AC Crcus Chaper 6: Oulne Phasors and he AC Seady Sae AC Crcus A sable, lnear crcu operang n he seady sae wh snusodal excaon (.e., snusodal seady sae. Complee response forced response naural response.
More information. The geometric multiplicity is dim[ker( λi. A )], i.e. the number of linearly independent eigenvectors associated with this eigenvalue.
Mah E-b Lecure #0 Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons are
More informationMechanics Physics 151
Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm H ( q, p, ) = q p L( q, q, ) H p = q H q = p H = L Equvalen o Lagrangan formalsm Smpler, bu
More informationMechanics Physics 151
Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm Hqp (,,) = qp Lqq (,,) H p = q H q = p H L = Equvalen o Lagrangan formalsm Smpler, bu wce as
More informationMulti-Fuel and Mixed-Mode IC Engine Combustion Simulation with a Detailed Chemistry Based Progress Variable Library Approach
Mul-Fuel and Med-Mode IC Engne Combuson Smulaon wh a Dealed Chemsry Based Progress Varable Lbrary Approach Conens Inroducon Approach Resuls Conclusons 2 Inroducon New Combuson Model- PVM-MF New Legslaons
More informationTSS = SST + SSE An orthogonal partition of the total SS
ANOVA: Topc 4. Orhogonal conrass [ST&D p. 183] H 0 : µ 1 = µ =... = µ H 1 : The mean of a leas one reamen group s dfferen To es hs hypohess, a basc ANOVA allocaes he varaon among reamen means (SST) equally
More informationPlanning and Scheduling to Minimize Makespan & Tardiness. John Hooker Carnegie Mellon University September 2006
Plannng and Schedulng to Mnmze Makespan & ardness John Hooker Carnege Mellon Unversty September 2006 he Problem Gven a set of tasks, each wth a deadlne 2 he Problem Gven a set of tasks, each wth a deadlne
More informationDiscrete Markov Process. Introduction. Example: Balls and Urns. Stochastic Automaton. INTRODUCTION TO Machine Learning 3rd Edition
EHEM ALPAYDI he MI Press, 04 Lecure Sldes for IRODUCIO O Machne Learnng 3rd Edon alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/ml3e Sldes from exboo resource page. Slghly eded and wh addonal examples
More informationDepartment of Economics University of Toronto
Deparmen of Economcs Unversy of Torono ECO408F M.A. Economercs Lecure Noes on Heeroskedascy Heeroskedascy o Ths lecure nvolves lookng a modfcaons we need o make o deal wh he regresson model when some of
More informationHow about the more general "linear" scalar functions of scalars (i.e., a 1st degree polynomial of the following form with a constant term )?
lmcd Lnear ransformaon of a vecor he deas presened here are que general hey go beyond he radonal mar-vecor ype seen n lnear algebra Furhermore, hey do no deal wh bass and are equally vald for any se of
More information2/20/2013. EE 101 Midterm 2 Review
//3 EE Mderm eew //3 Volage-mplfer Model The npu ressance s he equalen ressance see when lookng no he npu ermnals of he amplfer. o s he oupu ressance. I causes he oupu olage o decrease as he load ressance
More informationCH.3. COMPATIBILITY EQUATIONS. Continuum Mechanics Course (MMC) - ETSECCPB - UPC
CH.3. COMPATIBILITY EQUATIONS Connuum Mechancs Course (MMC) - ETSECCPB - UPC Overvew Compably Condons Compably Equaons of a Poenal Vecor Feld Compably Condons for Infnesmal Srans Inegraon of he Infnesmal
More informationSingle-Allocation Hub Network Design Model with Consolidated Traffic Flows
See dscussons, sas, and auhor profles for hs publcaon a: hps://www.researchgae.ne/publcaon/235733752 Sngle-Allocaon Hub Nework Desgn Model wh Consoldaed Traffc Flows ARTICLE n TRANSPORTATION RESEARCH RECORD
More informationGENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS. Youngwoo Ahn and Kitae Kim
Korean J. Mah. 19 (2011), No. 3, pp. 263 272 GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS Youngwoo Ahn and Kae Km Absrac. In he paper [1], an explc correspondence beween ceran
More informationFTCS Solution to the Heat Equation
FTCS Soluon o he Hea Equaon ME 448/548 Noes Gerald Reckenwald Porland Sae Unversy Deparmen of Mechancal Engneerng gerry@pdxedu ME 448/548: FTCS Soluon o he Hea Equaon Overvew Use he forward fne d erence
More informationAPOC #232 Capacity Planning for Fault-Tolerant All-Optical Network
APOC #232 Capacy Plannng for Faul-Toleran All-Opcal Nework Mchael Kwok-Shng Ho and Kwok-wa Cheung Deparmen of Informaon ngneerng The Chnese Unversy of Hong Kong Shan, N.T., Hong Kong SAR, Chna -mal: kwcheung@e.cuhk.edu.hk
More informationAn introduction to Support Vector Machine
An nroducon o Suppor Vecor Machne 報告者 : 黃立德 References: Smon Haykn, "Neural Neworks: a comprehensve foundaon, second edon, 999, Chaper 2,6 Nello Chrsann, John Shawe-Tayer, An Inroducon o Suppor Vecor Machnes,
More informationScattering at an Interface: Oblique Incidence
Course Insrucor Dr. Raymond C. Rumpf Offce: A 337 Phone: (915) 747 6958 E Mal: rcrumpf@uep.edu EE 4347 Appled Elecromagnecs Topc 3g Scaerng a an Inerface: Oblque Incdence Scaerng These Oblque noes may
More informationHidden Markov Models Following a lecture by Andrew W. Moore Carnegie Mellon University
Hdden Markov Models Followng a lecure by Andrew W. Moore Carnege Mellon Unversy www.cs.cmu.edu/~awm/uorals A Markov Sysem Has N saes, called s, s 2.. s N s 2 There are dscree meseps, 0,, s s 3 N 3 0 Hdden
More information( t) Outline of program: BGC1: Survival and event history analysis Oslo, March-May Recapitulation. The additive regression model
BGC1: Survval and even hsory analyss Oslo, March-May 212 Monday May 7h and Tuesday May 8h The addve regresson model Ørnulf Borgan Deparmen of Mahemacs Unversy of Oslo Oulne of program: Recapulaon Counng
More informationTHERMODYNAMICS 1. The First Law and Other Basic Concepts (part 2)
Company LOGO THERMODYNAMICS The Frs Law and Oher Basc Conceps (par ) Deparmen of Chemcal Engneerng, Semarang Sae Unversy Dhon Harano S.T., M.T., M.Sc. Have you ever cooked? Equlbrum Equlbrum (con.) Equlbrum
More informationThe Dynamic Programming Models for Inventory Control System with Time-varying Demand
The Dynamc Programmng Models for Invenory Conrol Sysem wh Tme-varyng Demand Truong Hong Trnh (Correspondng auhor) The Unversy of Danang, Unversy of Economcs, Venam Tel: 84-236-352-5459 E-mal: rnh.h@due.edu.vn
More informationLi An-Ping. Beijing , P.R.China
A New Type of Cpher: DICING_csb L An-Png Bejng 100085, P.R.Chna apl0001@sna.com Absrac: In hs paper, we wll propose a new ype of cpher named DICING_csb, whch s derved from our prevous sream cpher DICING.
More informationPlanar truss bridge optimization by dynamic programming and linear programming
IABSE-JSCE Jon Conference on Advances n Brdge Engneerng-III, Augus 1-, 015, Dhaka, Bangladesh. ISBN: 978-984-33-9313-5 Amn, Oku, Bhuyan, Ueda (eds.) www.abse-bd.org Planar russ brdge opmzaon by dynamc
More informationEfficient Asynchronous Channel Hopping Design for Cognitive Radio Networks
Effcen Asynchronous Channel Hoppng Desgn for Cognve Rado Neworks Chh-Mn Chao, Chen-Yu Hsu, and Yun-ng Lng Absrac In a cognve rado nework (CRN), a necessary condon for nodes o communcae wh each oher s ha
More informationNormal Random Variable and its discriminant functions
Noral Rando Varable and s dscrnan funcons Oulne Noral Rando Varable Properes Dscrnan funcons Why Noral Rando Varables? Analycally racable Works well when observaon coes for a corruped snle prooype 3 The
More informationLecture 18: The Laplace Transform (See Sections and 14.7 in Boas)
Lecure 8: The Lalace Transform (See Secons 88- and 47 n Boas) Recall ha our bg-cure goal s he analyss of he dfferenal equaon, ax bx cx F, where we emloy varous exansons for he drvng funcon F deendng on
More informationCubic Bezier Homotopy Function for Solving Exponential Equations
Penerb Journal of Advanced Research n Compung and Applcaons ISSN (onlne: 46-97 Vol. 4, No.. Pages -8, 6 omoopy Funcon for Solvng Eponenal Equaons S. S. Raml *,,. Mohamad Nor,a, N. S. Saharzan,b and M.
More informationOrdinary Differential Equations in Neuroscience with Matlab examples. Aim 1- Gain understanding of how to set up and solve ODE s
Ordnary Dfferenal Equaons n Neuroscence wh Malab eamples. Am - Gan undersandng of how o se up and solve ODE s Am Undersand how o se up an solve a smple eample of he Hebb rule n D Our goal a end of class
More information(,,, ) (,,, ). In addition, there are three other consumers, -2, -1, and 0. Consumer -2 has the utility function
MACROECONOMIC THEORY T J KEHOE ECON 87 SPRING 5 PROBLEM SET # Conder an overlappng generaon economy le ha n queon 5 on problem e n whch conumer lve for perod The uly funcon of he conumer born n perod,
More information( ) [ ] MAP Decision Rule
Announcemens Bayes Decson Theory wh Normal Dsrbuons HW0 due oday HW o be assgned soon Proec descrpon posed Bomercs CSE 90 Lecure 4 CSE90, Sprng 04 CSE90, Sprng 04 Key Probables 4 ω class label X feaure
More informationA Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
A Deermnsc Algorhm for Summarzng Asynchronous Sreams over a Sldng ndow Cosas Busch Rensselaer Polyechnc Insue Srkana Trhapura Iowa Sae Unversy Oulne of Talk Inroducon Algorhm Analyss Tme C Daa sream: 3
More informationSingle-loop System Reliability-Based Design & Topology Optimization (SRBDO/SRBTO): A Matrix-based System Reliability (MSR) Method
10 h US Naonal Congress on Compuaonal Mechancs Columbus, Oho 16-19, 2009 Sngle-loop Sysem Relably-Based Desgn & Topology Opmzaon (SRBDO/SRBTO): A Marx-based Sysem Relably (MSR) Mehod Tam Nguyen, Junho
More informationExample: MOSFET Amplifier Distortion
4/25/2011 Example MSFET Amplfer Dsoron 1/9 Example: MSFET Amplfer Dsoron Recall hs crcu from a prevous handou: ( ) = I ( ) D D d 15.0 V RD = 5K v ( ) = V v ( ) D o v( ) - K = 2 0.25 ma/v V = 2.0 V 40V.
More informationTight results for Next Fit and Worst Fit with resource augmentation
Tgh resuls for Nex F and Wors F wh resource augmenaon Joan Boyar Leah Epsen Asaf Levn Asrac I s well known ha he wo smple algorhms for he classc n packng prolem, NF and WF oh have an approxmaon rao of
More information( ) () we define the interaction representation by the unitary transformation () = ()
Hgher Order Perurbaon Theory Mchael Fowler 3/7/6 The neracon Represenaon Recall ha n he frs par of hs course sequence, we dscussed he chrödnger and Hesenberg represenaons of quanum mechancs here n he chrödnger
More informationLecture 9: Dynamic Properties
Shor Course on Molecular Dynamcs Smulaon Lecure 9: Dynamc Properes Professor A. Marn Purdue Unversy Hgh Level Course Oulne 1. MD Bascs. Poenal Energy Funcons 3. Inegraon Algorhms 4. Temperaure Conrol 5.
More informationPHYS 705: Classical Mechanics. Canonical Transformation
PHYS 705: Classcal Mechancs Canoncal Transformaon Canoncal Varables and Hamlonan Formalsm As we have seen, n he Hamlonan Formulaon of Mechancs,, are ndeenden varables n hase sace on eual foong The Hamlon
More information10. A.C CIRCUITS. Theoretically current grows to maximum value after infinite time. But practically it grows to maximum after 5τ. Decay of current :
. A. IUITS Synopss : GOWTH OF UNT IN IUIT : d. When swch S s closed a =; = d. A me, curren = e 3. The consan / has dmensons of me and s called he nducve me consan ( τ ) of he crcu. 4. = τ; =.63, n one
More information2.1 Constitutive Theory
Secon.. Consuve Theory.. Consuve Equaons Governng Equaons The equaons governng he behavour of maerals are (n he spaal form) dρ v & ρ + ρdv v = + ρ = Conservaon of Mass (..a) d x σ j dv dvσ + b = ρ v& +
More informationLecture 2 L n i e n a e r a M od o e d l e s
Lecure Lnear Models Las lecure You have learned abou ha s machne learnng Supervsed learnng Unsupervsed learnng Renforcemen learnng You have seen an eample learnng problem and he general process ha one
More informationChapter 6 DETECTION AND ESTIMATION: Model of digital communication system. Fundamental issues in digital communications are
Chaper 6 DEECIO AD EIMAIO: Fundamenal ssues n dgal communcaons are. Deecon and. Esmaon Deecon heory: I deals wh he desgn and evaluaon of decson makng processor ha observes he receved sgnal and guesses
More informationTesting a new idea to solve the P = NP problem with mathematical induction
Tesng a new dea o solve he P = NP problem wh mahemacal nducon Bacground P and NP are wo classes (ses) of languages n Compuer Scence An open problem s wheher P = NP Ths paper ess a new dea o compare he
More informationEpistemic Game Theory: Online Appendix
Epsemc Game Theory: Onlne Appendx Edde Dekel Lucano Pomao Marcano Snscalch July 18, 2014 Prelmnares Fx a fne ype srucure T I, S, T, β I and a probably µ S T. Le T µ I, S, T µ, βµ I be a ype srucure ha
More informationSolving the multi-period fixed cost transportation problem using LINGO solver
Inernaonal Journal of Pure and Appled Mahemacs Volume 119 No. 12 2018, 2151-2157 ISSN: 1314-3395 (on-lne verson) url: hp://www.pam.eu Specal Issue pam.eu Solvng he mul-perod fxed cos ransporaon problem
More informationA Modeling System to Combine Optimization and Constraint. Programming. INFORMS, November Carnegie Mellon University.
A Modelng Sstem to Combne Optmzaton and Constrant Programmng John Hooker Carnege Mellon Unverst INFORMS November 000 Based on ont work wth Ignaco Grossmann Hak-Jn Km Mara Axlo Osoro Greger Ottosson Erlendr
More informationCS 536: Machine Learning. Nonparametric Density Estimation Unsupervised Learning - Clustering
CS 536: Machne Learnng Nonparamerc Densy Esmaon Unsupervsed Learnng - Cluserng Fall 2005 Ahmed Elgammal Dep of Compuer Scence Rugers Unversy CS 536 Densy Esmaon - Cluserng - 1 Oulnes Densy esmaon Nonparamerc
More informationCollege of William & Mary Department of Computer Science
1 Techncal Repor WM-CS-2012-01 College of Wllam & Mary Deparmen of Compuer Scence WM-CS-2012-01 Onlne Vecor Schedulng and Generalzed Load Balancng Xaojun Zhu, Qun L, Wezhen Mao, Guha Chen March 5, 2012
More informationA Search-Infer-and-Relax Framework for. Integrating Solution Methods. Carnegie Mellon University CPAIOR, May John Hooker
A Search-Infer-and-Rela Framework for Integratng Soluton Methods John Hooker Carnege Mellon Unversty CPAIOR, May 005 CPAIOR 005 Why ntegrate soluton methods? One-stop shoppng. One solver does t all. CPAIOR
More informationPARTICLE SWARM OPTIMIZATION BASED ON BOTTLENECK MACHINE FOR JOBSHOP SCHEDULING
Proceedng 7 h Inernaonal Semnar on Indusral Engneerng and Managemen PARTICLE SWARM OPTIMIZATION BASED ON BOTTLENECK MACHINE FOR JOBSHOP SCHEDULING Rahm Mauldya Indusral Engneerng Deparmen, Indusral Engneerng
More informationEP2200 Queuing theory and teletraffic systems. 3rd lecture Markov chains Birth-death process - Poisson process. Viktoria Fodor KTH EES
EP Queung heory and eleraffc sysems 3rd lecure Marov chans Brh-deah rocess - Posson rocess Vora Fodor KTH EES Oulne for oday Marov rocesses Connuous-me Marov-chans Grah and marx reresenaon Transen and
More informationVolatility Interpolation
Volaly Inerpolaon Prelmnary Verson March 00 Jesper Andreasen and Bran Huge Danse Mares, Copenhagen wan.daddy@danseban.com brno@danseban.com Elecronc copy avalable a: hp://ssrn.com/absrac=69497 Inro Local
More informationChapters 2 Kinematics. Position, Distance, Displacement
Chapers Knemacs Poson, Dsance, Dsplacemen Mechancs: Knemacs and Dynamcs. Knemacs deals wh moon, bu s no concerned wh he cause o moon. Dynamcs deals wh he relaonshp beween orce and moon. The word dsplacemen
More informationMath 128b Project. Jude Yuen
Mah 8b Proec Jude Yuen . Inroducon Le { Z } be a sequence of observed ndependen vecor varables. If he elemens of Z have a on normal dsrbuon hen { Z } has a mean vecor Z and a varancecovarance marx z. Geomercally
More informationThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Journal of Indusral Engneerng 1 (008) 35-39 The preempve resource-consraned projec schedulng problem subjec o due daes and preempon penales An neger programmng approach B. Afshar Nadjaf Deparmen of Indusral
More informationLecture 11 SVM cont
Lecure SVM con. 0 008 Wha we have done so far We have esalshed ha we wan o fnd a lnear decson oundary whose margn s he larges We know how o measure he margn of a lnear decson oundary Tha s: he mnmum geomerc
More informationDensity Matrix Description of NMR BCMB/CHEM 8190
Densy Marx Descrpon of NMR BCMBCHEM 89 Operaors n Marx Noaon Alernae approach o second order specra: ask abou x magnezaon nsead of energes and ranson probables. If we say wh one bass se, properes vary
More informationFall 2009 Social Sciences 7418 University of Wisconsin-Madison. Problem Set 2 Answers (4) (6) di = D (10)
Publc Affars 974 Menze D. Chnn Fall 2009 Socal Scences 7418 Unversy of Wsconsn-Madson Problem Se 2 Answers Due n lecure on Thursday, November 12. " Box n" your answers o he algebrac quesons. 1. Consder
More informationLecture VI Regression
Lecure VI Regresson (Lnear Mehods for Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure VI: MLSC - Dr. Sehu Vjayakumar Lnear Regresson Model M
More informationDEVELOPMENT OF SIMULATION-BASED ENVIRONMENT FOR MULTI-ECHELON CYCLIC PLANNING AND OPTIMISATION
From he SelecedWorks of Lana Napalkova Sepember, 2007 DEVELOPMENT OF SIMULATION-BASED ENVIRONMENT FOR MULTI-ECHELON CYCLIC PLANNING AND OPTIMISATION Galna Merkuryeva Lana Napalkova Avalable a: hps://works.bepress.com/lana_napalkova/2/
More informationDual Approximate Dynamic Programming for Large Scale Hydro Valleys
Dual Approxmae Dynamc Programmng for Large Scale Hydro Valleys Perre Carpener and Jean-Phlppe Chanceler 1 ENSTA ParsTech and ENPC ParsTech CMM Workshop, January 2016 1 Jon work wh J.-C. Alas, suppored
More informationCHAPTER 5: MULTIVARIATE METHODS
CHAPER 5: MULIVARIAE MEHODS Mulvarae Daa 3 Mulple measuremens (sensors) npus/feaures/arbues: -varae N nsances/observaons/eamples Each row s an eample Each column represens a feaure X a b correspons o he
More informationRelative controllability of nonlinear systems with delays in control
Relave conrollably o nonlnear sysems wh delays n conrol Jerzy Klamka Insue o Conrol Engneerng, Slesan Techncal Unversy, 44- Glwce, Poland. phone/ax : 48 32 37227, {jklamka}@a.polsl.glwce.pl Keywor: Conrollably.
More informationComputing Relevance, Similarity: The Vector Space Model
Compung Relevance, Smlary: The Vecor Space Model Based on Larson and Hears s sldes a UC-Bereley hp://.sms.bereley.edu/courses/s0/f00/ aabase Managemen Sysems, R. Ramarshnan ocumen Vecors v ocumens are
More informationSOME NOISELESS CODING THEOREMS OF INACCURACY MEASURE OF ORDER α AND TYPE β
SARAJEVO JOURNAL OF MATHEMATICS Vol.3 (15) (2007), 137 143 SOME NOISELESS CODING THEOREMS OF INACCURACY MEASURE OF ORDER α AND TYPE β M. A. K. BAIG AND RAYEES AHMAD DAR Absrac. In hs paper, we propose
More informationPHYS 1443 Section 001 Lecture #4
PHYS 1443 Secon 001 Lecure #4 Monda, June 5, 006 Moon n Two Dmensons Moon under consan acceleraon Projecle Moon Mamum ranges and heghs Reerence Frames and relae moon Newon s Laws o Moon Force Newon s Law
More information