drago rotaru and tim wood
play

Drago Rotaru and Tim Wood University of Bristol, KU Leuven * - PowerPoint PPT Presentation

Oct 12, 2022 •145 likes •758 views

INDOCRYPT 2019 MArBled Circuits: Mixing Arithmetic and Boolean Circuits with Active Security* Drago Rotaru and Tim Wood University of Bristol, KU Leuven * https://ia.cr/2019/207 Drago Rotaru 1 imec-Cosic, Dept. Electrical Engineering What

  1. INDOCRYPT 2019 MArBled Circuits: Mixing Arithmetic and Boolean Circuits with Active Security* Dragoș Rotaru and Tim Wood University of Bristol, KU Leuven * https://ia.cr/2019/207 Dragoș Rotaru 1 imec-Cosic, Dept. Electrical Engineering

  2. What is multiparty computation? a c b Goal : Compute F(a, b, c) Dragos Rotaru 2 Dragoș Rotaru 2 imec-Cosic, Dept. Electrical Engineering

  3. How can we achieve MPC? Secret Sharing Garbled Circuits Fast networks (LAN) Slow Networks (WAN) Arithmetic/Boolean circuits Boolean circuits Low depth, many AND gates* Large depth, few AND gates* Dragoș Rotaru 3 imec-Cosic, Dept. Electrical Engineering

  4. Why switch between? Sint A, x, b y = A * x + b E = argmax(y) Secret Sharing Garbled Circuits Fast networks (LAN) Slow Networks (WAN) Arithmetic/Boolean circuits Boolean circuits Low depth, many AND gates* Large depth, few AND gates* Dragoș Rotaru 4 imec-Cosic, Dept. Electrical Engineering

  5. Why switch between? Sint A, x, b y = A * x + b E = argmax(y) E = argmax(y) Secret Sharing Garbled Circuits Fast networks (LAN) Slow Networks (WAN) Arithmetic/Boolean circuits Boolean circuits Low depth, many AND gates* Large depth, few AND gates* Dragoș Rotaru 5 imec-Cosic, Dept. Electrical Engineering

  6. Can we switch between? A (GMW mod 2 𝑙 ) Yao GC – mod 2 B (GMW mod 2) ABY [DSZ’15] Dragoș Rotaru 6 imec-Cosic, Dept. Electrical Engineering

  7. Can we switch between? A (GMW mod 2 𝑙 ) Yao GC – mod 2 B (GMW mod 2) ABY [DSZ’15] ABY3 [MR’18] Dragoș Rotaru 7 imec-Cosic, Dept. Electrical Engineering

  8. Can we switch between? A (GMW mod 2 𝑙 ) Yao GC – mod 2 B (GMW mod 2) ABY [DSZ’15] ABY3 [MR’18] Dragoș Rotaru 8 imec-Cosic, Dept. Electrical Engineering

  9. What about dishonest majority? Dragoș Rotaru 9 imec-Cosic, Dept. Electrical Engineering

  10. What about dishonest majority? WRK’17 SPDZ Dragoș Rotaru 10 imec-Cosic, Dept. Electrical Engineering

  11. What about dishonest majority? Naive >110K ANDs WRK’17 SPDZ Dragoș Rotaru 11 imec-Cosic, Dept. Electrical Engineering

  12. What about dishonest majority? Naive >110K ANDs WRK’17 SPDZ >110K ANDs Dragoș Rotaru 12 imec-Cosic, Dept. Electrical Engineering

  13. What about dishonest majority? Naive <1K ANDs WRK’17 SPDZ 0 ANDs Dragoș Rotaru 13 imec-Cosic, Dept. Electrical Engineering

  14. How general is this? 𝐆 𝑞 SPDZ SPDZ-BMR WRK’17 HSS’17 𝐚 2 𝑙 SPDZ Dragoș Rotaru 14 imec-Cosic, Dept. Electrical Engineering

  15. How general is this? 𝐆 𝑞 SPDZ SPDZ-BMR WRK’17 HSS’17 𝐚 2 𝑙 SPDZ Very fast using DEFKSV’19 tricks Dragoș Rotaru 15 imec-Cosic, Dept. Electrical Engineering

  16. How general is this? 𝐆 𝑞 SPDZ SPDZ-BMR WRK’17 HSS’17 𝐚 2 𝑙 SPDZ Dragoș Rotaru 16 imec-Cosic, Dept. Electrical Engineering

  17. How general is this? 𝐆 𝑞 SPDZ SPDZ-BMR WRK’17 HSS’17 𝐚 2 𝑙 SPDZ Any honest majority protocol Dragoș Rotaru 17 imec-Cosic, Dept. Electrical Engineering

  18. Our focus 𝐆 𝑞 SPDZ SPDZ-BMR WRK’17 HSS’17 𝐚 2 𝑙 SPDZ Dragoș Rotaru 18 imec-Cosic, Dept. Electrical Engineering

  19. Malicious MPC protocols Preprocessing Online phase phase PKC Inputs SPDZ, TinyOT, BDOZa , MASCOT, WRK’17, HSS’17, … Dragoș Rotaru 19 imec-Cosic, Dept. Electrical Engineering

  20. Let’s talk about 𝐆 𝑞 SPDZ Dragoș Rotaru 20 imec-Cosic, Dept. Electrical Engineering

  21. SPDZ online phase 𝐆 𝑞 SPDZ + + α 1 α 2 α α 3 = 𝑦 3 𝑦 1 𝑦 2 + + = 𝑦 + γ(𝑦) 1 + α 𝑦 γ(𝑦) 2 γ(𝑦) 3 = Dragoș Rotaru 21 imec-Cosic, Dept. Electrical Engineering

  22. SPDZ online phase 𝐆 𝑞 SPDZ + + α 1 α 2 α α 3 = + + 𝑦 1 + 𝑧 1 𝑦 2 + 𝑧 2 𝑦 3 + 𝑧 3 𝑦 + 𝑧 = + + γ x 1 + γ y 1 γ x 2 + γ y 2 γ x 3 + γ y 3 α ( 𝑦 + 𝑧) = Dragoș Rotaru 22 imec-Cosic, Dept. Electrical Engineering

  23. SPDZ online phase 𝐆 𝑞 SPDZ ← X 𝐵 X 𝐵 Retrieve a random mask Input Dragoș Rotaru 23 imec-Cosic, Dept. Electrical Engineering

  24. SPDZ online phase 𝐆 𝑞 SPDZ ← X 𝐵 X 𝐵 Input Dragoș Rotaru 24 imec-Cosic, Dept. Electrical Engineering

  25. SPDZ online phase 𝐆 𝑞 SPDZ ← X 𝐵 X 𝐵 Input ← x x Open Dragoș Rotaru 25 imec-Cosic, Dept. Electrical Engineering

  26. SPDZ online phase 𝐆 𝑞 SPDZ ← X 𝐵 X 𝐵 Input ← x x Open MAC Check Dragoș Rotaru 26 imec-Cosic, Dept. Electrical Engineering

  27. SPDZ online phase 𝐆 𝑞 SPDZ ← X 𝐵 X 𝐵 Input ← x x Open  ← XOR Retrieve a Beaver triple z x y Dragoș Rotaru 27 imec-Cosic, Dept. Electrical Engineering

  28. SPDZ online phase 𝐆 𝑞 SPDZ ← X 𝐵 X 𝐵 Input ← x x Open MAC Check  ← XOR z x y Dragoș Rotaru 28 imec-Cosic, Dept. Electrical Engineering

  29. Let’s talk about 𝐆 2 BMR[MASCOT] Dragoș Rotaru 29 imec-Cosic, Dept. Electrical Engineering

  30. SPDZ online phase BMR 𝐆 2 A B AND AND C A B C Dragoș Rotaru 30 imec-Cosic, Dept. Electrical Engineering

  31. SPDZ online phase SPDZ-BMR BMR 𝐆 2 𝐆 2 A B AND AND C MAC Check Λ 𝑑 ←C + λ 𝑑 Λ 𝐵 ← A + λ 𝑏 Λ 𝐶 ← B + λ 𝑐 Dragoș Rotaru 31 imec-Cosic, Dept. Electrical Engineering

  32. SPDZ online phase BMR 𝐆 2 A B AND AND C MAC Check Λ 𝑑 ←C + λ 𝑑 Λ 𝐵 ← A + λ 𝑏 Λ 𝐶 ← B + λ 𝑐 Inputs - cheap XOR - free Mod p arithmetic - some AND gates Dragoș Rotaru 32 imec-Cosic, Dept. Electrical Engineering

  33. Main idea: 𝐆 𝑞 𝐆 2 SPDZ BMR x x x Dragoș Rotaru 33 imec-Cosic, Dept. Electrical Engineering

  34. Main idea: 𝐆 𝑞 𝐆 2 SPDZ BMR x x x r Dragoș Rotaru 34 imec-Cosic, Dept. Electrical Engineering

  35. Main idea: 𝐆 𝑞 𝐆 2 SPDZ BMR x x - x-r x r Open SPDZ – MAC Check Dragoș Rotaru 35 imec-Cosic, Dept. Electrical Engineering

  36. Main idea: 𝐆 𝑞 𝐆 2 SPDZ BMR x x - + r x x-r x r Dragoș Rotaru 36 imec-Cosic, Dept. Electrical Engineering

  37. Main idea: 𝐆 𝑞 𝐆 2 SPDZ BMR x x - + r x x-r x r We formalize this, plug in any LSSS and GC. Dragoș Rotaru 37 imec-Cosic, Dept. Electrical Engineering

  38. Introducing daBits Dragoș Rotaru 38 imec-Cosic, Dept. Electrical Engineering

  39. Introducing daBits 𝐆 𝑞 SPDZ BMR 𝐆 2 𝒄 𝑩 𝒄 𝑪 𝒄 𝑫 Dragoș Rotaru 39 imec-Cosic, Dept. Electrical Engineering

  40. Introducing daBits 𝐆 𝑞 SPDZ BMR 𝐆 2 SPDZ Input BMR Input 𝒄 𝑩 𝒄 𝑪 𝒄 𝑫 Dragoș Rotaru 40 imec-Cosic, Dept. Electrical Engineering

  41. Introducing daBits 𝐆 𝑞 SPDZ BMR 𝐆 2 SPDZ Input BMR Input 𝒄 𝑩 𝒄 𝑩 𝒄 𝑪 𝒄 𝑪 𝒄 𝑫 𝒄 𝑫 Dragoș Rotaru 41 imec-Cosic, Dept. Electrical Engineering

  42. Introducing daBits 𝐆 𝑞 SPDZ BMR 𝐆 2 SPDZ Open BMR Open 𝒄 𝑩 𝒄 𝑩 𝒄 𝑪 𝒄 𝑪 𝒄 𝑫 𝒄 𝑫 Dragoș Rotaru 42 imec-Cosic, Dept. Electrical Engineering

  43. Introducing daBits 𝐆 𝑞 SPDZ BMR 𝐆 2 SPDZ XOR BMR XOR 𝒄 𝑩  𝒄 𝑪  𝒄 𝑫 𝒄 𝑩  𝒄 𝑪  𝒄 𝑫 Dragoș Rotaru 43 imec-Cosic, Dept. Electrical Engineering

  44. Introducing daBits 𝐆 𝑞 SPDZ BMR 𝐆 2 SPDZ Open BMR Open 𝒄 𝑩  𝒄 𝑪  𝒄 𝑫 𝒄 𝑩  𝒄 𝑪  𝒄 𝑫 Dragoș Rotaru 44 imec-Cosic, Dept. Electrical Engineering

  45. daBit cost BMR[MASCOT] SPDZ Dragoș Rotaru 45 imec-Cosic, Dept. Electrical Engineering

  46. SVM Example in MP-SPDZ Dragoș Rotaru 46 imec-Cosic, Dept. Electrical Engineering

  47. SVM Example in MP-SPDZ Dragoș Rotaru 47 imec-Cosic, Dept. Electrical Engineering

  48. daBit 2.0 Dragoș Rotaru 48 imec-Cosic, Dept. Electrical Engineering

  49. daBit 2.0 ➢ Inspired from DEFKSV’19 𝐚 2 𝑙 𝐆 2 Dragoș Rotaru 49 imec-Cosic, Dept. Electrical Engineering

  50. daBit 2.0 ➢ Inspired from DEFKSV’19 𝐚 2 𝑙 𝐆 2 𝐆 𝑞 𝐆 2 Dragoș Rotaru 50 imec-Cosic, Dept. Electrical Engineering

  51. daBit 2.0 Local mod 2 ➢ Inspired from DEFKSV’19 𝐚 2 𝑙 𝐚 2 𝑙 𝐆 2 𝐆 2 𝐆 𝑞 𝐆 2 Dragoș Rotaru 51 imec-Cosic, Dept. Electrical Engineering

  52. daBit 2.0 𝐆 𝑞 𝐆 2 SPDZ[p].Random() 𝒄 1 𝒄 𝑜 … 𝒔 1 𝒔 𝑡 … 𝑩 𝑩 𝑪 𝑪 𝒄 1 𝒄 𝑜 𝒄 1 𝒄 𝑜 TinyOT.Input() mod 2 mod 2 mod 2 mod 2 … … 𝑩 𝑪 𝑪 𝑩 𝒔 1 … 𝒔 𝑡 𝒔 1 𝒔 𝑡 mod 2 … mod 2 mod 2 mod 2 Dragoș Rotaru 52 imec-Cosic, Dept. Electrical Engineering

  53. daBit 2.0 𝐆 𝑞 𝐆 2 SPDZ[p].Random() 𝒄 1 𝒄 𝑜 … 𝒔 1 𝒔 𝑡 … 𝑩 𝑩 𝑪 𝑪 𝒄 1 𝒄 𝑜 𝒄 1 𝒄 𝑜 TinyOT.Input() mod 2 mod 2 mod 2 mod 2 … … 𝑩 𝑪 𝑪 𝑩 𝒔 1 … 𝒔 𝑡 𝒔 1 𝒔 𝑡 mod 2 … mod 2 mod 2 mod 2 𝑩 mod 2 𝑪 mod 2 𝒄 𝟐 𝒄 1 𝒄 1 xor xor 1 𝒔 𝑗 𝒄 1 𝒄 𝑜 𝒔 𝑗 𝒄 1 𝒄 𝑜 Take s linear combinations and … … Dragoș Rotaru 53 imec-Cosic, Dept. Electrical Engineering

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

A universal MPC machine* Drago Rotaru University of Bristol, KU Leuven *MArBled Circuits:

A universal MPC machine* Drago Rotaru University of Bristol, KU Leuven *MArBled Circuits:

DIMACS Workshop 2019 A universal MPC machine* Drago Rotaru University of Bristol, KU Leuven *MArBled Circuits: Mixing Arithmetic and Boolean Circuits with Active Security; Joint work with Tim Wood. https://ia.cr/2019/207 Drago

685 views • 49 slides
MPC-Friendly Symmetric Key Primitives Lorenzo Grassi 1 Christian Rechberger 1 s Rotaru 2 Drago

MPC-Friendly Symmetric Key Primitives Lorenzo Grassi 1 Christian Rechberger 1 s Rotaru 2 Drago

MPC-Friendly Symmetric Key Primitives Lorenzo Grassi 1 Christian Rechberger 1 s Rotaru 2 Drago Peter Scholl 2 Nigel P. Smart 2 1 Graz University of Technology 2 University of Bristol October 25, 2016 What is Multiparty Computation? What is

1.32k views • 64 slides
Introducing Stet the frog &amp; Drago the dragonfly Drago did you know that Rotoruas

Introducing Stet the frog &amp; Drago the dragonfly Drago did you know that Rotoruas

Introducing Stet the frog &amp; Drago the dragonfly Drago did you know that Rotoruas Water Supply is from springs? Wow thats why its so clean! Then what happens after people use it? PUMP STATION &amp; TREATMENT Well Drago.

364 views • 13 slides
MPC across the wire: There is something you require Dragos Rotaru KU Leuven, University of

MPC across the wire: There is something you require Dragos Rotaru KU Leuven, University of

TPMPC 2018 MPC across the wire: There is something you require Dragos Rotaru KU Leuven, University of Bristol 1 Dragos Rotaru imec-Cosic, Dept. Electrical Engineering $6.3M question Brandeis program Enc( K , ) K 2 Dragos Rotaru

581 views • 35 slides
Reducing Communication Channels in MPC Marcel Keller 1,2 Dragos Rotaru 1,3 Nigel Smart 1,3 T im

Reducing Communication Channels in MPC Marcel Keller 1,2 Dragos Rotaru 1,3 Nigel Smart 1,3 T im

Reducing Communication Channels in MPC Marcel Keller 1,2 Dragos Rotaru 1,3 Nigel Smart 1,3 T im Wood 1,3 1 University of Bristol 2 Data61 3 KU Leuven/COSIC ESAT 1/35 Outline Goal Generalising MPC Tools Performing MPC 2/35 Outline Goal

753 views • 72 slides
Modes of operations for computing on encrypted data Dragos Rotaru, N.P. Smart, and Martijn Stam

Modes of operations for computing on encrypted data Dragos Rotaru, N.P. Smart, and Martijn Stam

FSE 2018 Modes of operations for computing on encrypted data Dragos Rotaru, N.P. Smart, and Martijn Stam KU Leuven, University of Bristol 1 Dragos Rotaru , N.P. Smart, M. Stam imec-Cosic, Dept. Electrical Engineering Multiparty computation

471 views • 44 slides
Overdrive: Making SPDZ Great Again Marcel Keller, Valerio Pastro, and Dragos Rotaru University of

Overdrive: Making SPDZ Great Again Marcel Keller, Valerio Pastro, and Dragos Rotaru University of

Eurocrypt 2018 Overdrive: Making SPDZ Great Again Marcel Keller, Valerio Pastro, and Dragos Rotaru University of Bristol, Yale University, KU Leuven 1 M. Keller, V. Pastro, Dragos Rotaru imec-Cosic, Dept. Electrical Engineering Whats all

776 views • 38 slides
Self-similar point vortices and confinement of vorticity Drago s Iftimie Institut Camille

Self-similar point vortices and confinement of vorticity Drago s Iftimie Institut Camille

Self-similar point vortices and confinement of vorticity Drago s Iftimie Institut Camille Jordan Universit e Lyon 1 June 23, 2016 Dynamics and Differential Equations Minneapolis Dedicated to the memory of George Sell 1 / 22

488 views • 22 slides
On Degree Properties of Crossing-critical Families of Graphs Drago Bokal 1 , Mojca Bra c 1 ,

On Degree Properties of Crossing-critical Families of Graphs Drago Bokal 1 , Mojca Bra c 1 ,

Definitions and tools Results On Degree Properties of Crossing-critical Families of Graphs Drago Bokal 1 , Mojca Bra c 1 , Marek Der nr 2 , Petr Hlin en 2 ci 1 Faculty of Natural Sciences and Mathematics, University of Maribor,

362 views • 23 slides
Finding All Maximal Subsequences with Hereditary Properties Drago Bokal, Sergio Cabello, and David

Finding All Maximal Subsequences with Hereditary Properties Drago Bokal, Sergio Cabello, and David

Finding All Maximal Subsequences with Hereditary Properties Drago Bokal, Sergio Cabello, and David Eppstein 31st International Symposium on Computational Geometry Eindhoven, Netherlands, June 2015 Trajectory analysis Data: sequence of points

146 views • 10 slides
AV1 Image File Format (AVIF) Cyril Concolato, Jan De Cock, Joe Drago Netflix Outline

AV1 Image File Format (AVIF) Cyril Concolato, Jan De Cock, Joe Drago Netflix Outline

AV1 Image File Format (AVIF) Cyril Concolato, Jan De Cock, Joe Drago Netflix Outline Overview of the format Compression and decoding speed evaluations Conclusions Technology stack (1) ISOBMFF Base elements ISO/IEC 14496-12

470 views • 29 slides
LAKE CHAMPLAIN BASIN OF VERMONT Julyanice Cruz 1,3 , Stephanie Drago 2 , Rebecca Diehl 2 , Don

LAKE CHAMPLAIN BASIN OF VERMONT Julyanice Cruz 1,3 , Stephanie Drago 2 , Rebecca Diehl 2 , Don

A SPATIAL INVESTIGATION OF FLOODPLAIN DEPOSITION IN THE LAKE CHAMPLAIN BASIN OF VERMONT Julyanice Cruz 1,3 , Stephanie Drago 2 , Rebecca Diehl 2 , Don Ross 2,3 , Beverley Wemple 2,3 1 St. Michaels College, Colchester, Vermont 2 University of

357 views • 13 slides
Mitigating Attacks in Unstructured Multicast Overlay Networks Cristina Nita-Rotaru,Aaron Walters,

Mitigating Attacks in Unstructured Multicast Overlay Networks Cristina Nita-Rotaru,Aaron Walters,

Mitigating Attacks in Unstructured Multicast Overlay Networks Cristina Nita-Rotaru,Aaron Walters, David Zage Dependable and Secure Distributed Systems Lab ((DS) 2 ) Department of Computer Science and CERIAS Purdue University Dependable and

781 views • 56 slides
Wood anatomy - the role of macroscopic and microscopic wood identification against illegal

Wood anatomy - the role of macroscopic and microscopic wood identification against illegal

Wood anatomy - the role of macroscopic and microscopic wood identification against illegal logging PD Dr. habil. Gerald Koch Thnen Institute of Wood Research Hardwood Conference Sopron_2018 Name des Wissenschaftlers European Timber

380 views • 20 slides
CS603: Distributed Systems Lecture 1: Basic Communication Services Cristina Nita-Rotaru Lecture

CS603: Distributed Systems Lecture 1: Basic Communication Services Cristina Nita-Rotaru Lecture

CS603: Distributed Systems Lecture 1: Basic Communication Services Cristina Nita-Rotaru Lecture 1/ Spring 2006 1 Reference Material l Textbooks Ken Birman: Reliable Distributed Systems l Recommended reading Research papers that will be

982 views • 39 slides
The WWA Standard for manufacturing wood windows and window performance Kevin Underwood Wood

The WWA Standard for manufacturing wood windows and window performance Kevin Underwood Wood

Wood Knowledge Wales and Bron Afron Community Housing The Case For Wood Windows The WWA Standard for manufacturing wood windows and window performance Kevin Underwood Wood Window Alliance Introduction Requirements for WWA timber windows

581 views • 46 slides
TinyKeys: A New Approach to Efficient Multi-Party Computation Carmit Hazay , Emmanuela Orsini,

TinyKeys: A New Approach to Efficient Multi-Party Computation Carmit Hazay , Emmanuela Orsini,

TinyKeys: A New Approach to Efficient Multi-Party Computation Carmit Hazay , Emmanuela Orsini, Peter Scholl and Eduardo Soria-Vazquez Based on slides prepared by Peter Scholl and Eduardo Soria-Vazquez Secure Multi-Party Computation (MPC)

756 views • 36 slides
A new approach to efficient multi-party computation Carmit Hazay, Emmanuela Orsini, Peter Scholl

A new approach to efficient multi-party computation Carmit Hazay, Emmanuela Orsini, Peter Scholl

Tin inyKeys: : A new approach to efficient multi-party computation Carmit Hazay, Emmanuela Orsini, Peter Scholl and Eduardo Soria-Vazquez Motivation Large number of users want to conduct surveys, auctions, statistical analysis, measure

1.62k views • 30 slides
Model Checking with Maximal Causality Reduction Jeff Huang Assistant Professor A Real Bug

Model Checking with Maximal Causality Reduction Jeff Huang Assistant Professor A Real Bug

Model Checking with Maximal Causality Reduction Jeff Huang Assistant Professor A Real Bug $12 million loss of equipment

823 views • 71 slides
SAT-based verification (BMC, temporal induction) Mary Sheeran, Chalmers SAT-based verification

SAT-based verification (BMC, temporal induction) Mary Sheeran, Chalmers SAT-based verification

SAT-based verification (BMC, temporal induction) Mary Sheeran, Chalmers SAT-based verification now hot Used here in Sweden since 1989 mostly in safety critical applications (railway control program verification) Bounded Model Checking a

468 views • 25 slides
Order Recursion Introduction Introduction Rc = d Order versus Time Updates There are

Order Recursion Introduction Introduction Rc = d Order versus Time Updates There are

Order Recursion Introduction Introduction Rc = d Order versus Time Updates There are many ways to solve the normal equations Matrix Inversion by Partitioning Lemma Solutions are mathematically equivalent Levinson Algorithm

99 views • 7 slides
Power Development Plan 2015 on air quality from 2016 to 2036 using GAINS and CAMx Jared Allard,

Power Development Plan 2015 on air quality from 2016 to 2036 using GAINS and CAMx Jared Allard,

Analysis of the effects of the Thai Power Development Plan 2015 on air quality from 2016 to 2036 using GAINS and CAMx Jared Allard, Michael Alleyne, Daniel Day, Robert Gourley, Thao Pham, Thanonphat Boonman, Sebastien Bonnet, Savitri Garivait

533 views • 32 slides
Adaptive Control - A Perspective K. J. strm Department of Automatic Control, LTH Lund

Adaptive Control - A Perspective K. J. strm Department of Automatic Control, LTH Lund

Adaptive Control - A Perspective K. J. strm Department of Automatic Control, LTH Lund University October 26, 2018 Adaptive Control - A Perspective 1. Introduction 2. Model Reference Adaptive Control 3. Self-Tuning Regulators 4. Dual

635 views • 48 slides
Algebraic groups and complete reducibility Groups St Andrews, 8 August 2013 Ben Martin

Algebraic groups and complete reducibility Groups St Andrews, 8 August 2013 Ben Martin

Algebraic groups and complete reducibility Groups St Andrews, 8 August 2013 Ben Martin University of Auckland Michael Bate, Sebastian Herpel, Gerhard R ohrle, Rudolf Tange, Tomohiro Uchiyama 1 Idea: Generalise notion of complete

261 views • 12 slides

More recommend