Models, Notation, Goals

Size: px
Start display at page:

Download "Models, Notation, Goals"

Transcription

1 Scope Ë ÕÙ Ò Ð Ò ÐÝ Ó ÝÒ Ñ ÑÓ Ð Ü Ô Ö Ñ Ö ² Ñ ¹Ú ÖÝ Ò Ú Ö Ð Ö ÒÙÑ Ö Ð ÔÓ Ö ÓÖ ÔÔÖÓÜ Ñ ÓÒ ß À ÓÖ Ð Ô Ö Ô Ú ß Ë ÑÙÐ ÓÒ Ñ Ó ß ËÑÓÓ Ò ² Ö Ò Ö Ò Ô Ö Ñ Ö ÑÔÐ ß Ã ÖÒ Ð Ñ Ó ÚÓÐÙ ÓÒ Ñ Ó ÓÑ Ò Ô Ö Ð Ð Ö Ò Ð ÓÖ Ñ È µ ÅÙÐ ÔÐ ÓÖ ÑÓ Ð Ò Ò Ò ß º º ¼ Ô Ö Ñ Ö ÇÔ Ò ÕÙ ÓÒ Ö ÓÒ

2 Models, Notation, Goals Ý ½ ¾ µ ÁÒ ÓÖÑ ÓÒ Ñ ½ Ý Ë Ú ÓÖ»Ú Ö Ð Ü Ü ÑÓ Ð Ô Ö Ñ Ö Ç ÖÚ ÓÒ ÑÓ Ð Ô Ý Ü µ Å Ö ÓÚ ÚÓÐÙ ÓÒ ÑÓ Ð Ô Ü Ü ½ µ Ó Ð ÕÙ Ò ÐÐÝ ÙÔ ÔÓ Ö ÓÖ Ô Ü µ Ô Ü ½ ½ µ ÆÙÑ Ö Ð ÔÔÖÓÜ Ñ ÓÒ ÔÓ Ò»Û µ Ü µ µ ½ Æ Ò µ ½ Æ

3 Å ÜÙÖ ÑÓ Ð Some History in Statistics Ö Ö Ó Ô Ö Ñ Ö Å ÜÙÖ Ó ÒÓÖÑ Ð»Ñ ÜÙÖ Ó Ã ÐÑ Ò Ð Ö À ÖÖ ÓÒ ½ µ Ð Ô ² ËÓÖ Ò Ò ½ µ ÅÙÐ ¹ÔÖÓ Ï ² À ÖÖ ÓÒ Ôº ½¾µ Ô Ú ÉÙ Ö ÙÖ Ñ Ó ÈÓÐ Ò Ï ¼µ ÓÑ Ò Ô Ö Ñ Ö Ò Ú Ö Ð È Ö Ñ Ö Ö ÚÓÐÚ» Ô Ò Ñ ÜÔÐÓ Å Ö ÓÚ ÚÓÐÙ ÓÒ ÑÓ Ð Ó Ò Ö Ò Û ÔÓ Ò ² Ò ÖÔÓÐ Æ Ò ÒÙÑ Ö Ð Ò Ö ÓÒ ººº Ù Ð Ñ Ó Ñ ÐÐ Ñ Ò ÓÒ Ë ÑÙÐ ÓÒ Ñ Ó Ò ¼ ÄÓÒ Ö ÓÖÝ Ò Ò Ò Ö Ò Æ Û Ö ÓÒ Ò Ô Ö Ð Ð Ö Ò ÓÓ Ö Ô ËÁÊ È ºººµ

4 (Auxiliary Particle Filter) for States Ì ÓÖ Ð ÙÔ È ² Ë Ô Ö µ Ô Ü ½ ½ µ» Ô Ý ½ Ü ½ µô Ü ½ µ Å ÔÔÖÓÜ Ñ ÓÒ Ó ÔÖ ÓÖ Ô Ü ½ µ Æ ½ µ Ô Ü Ü µ ½ µ È ÙÔ ÖÓÑ ½ ÓÖ ß Ñ µ ½ Ü Ü µ ½ µ ß Ò Û µ ½» µ Ô Ý ½ µ ½µ ÑÔÐ Ùܵ Ò ÓÖ Û ÔÖÓ µ ½ Ñ ½ ÑÔÐ Ü µ ½ Ô Ü ½ Ü µ µ Ò Û µ ½µ ½ Ô Ý ½ Ü µ Ô Ý µ ½ ½µ

5 Filtering for Parameters & States Ì ÓÖ Ð ÙÔ Ô Ü ½ ½ µ» Ô Ý ½ Ü ½ µô Ü ½ µ Û Ô Ü ½ µ Ô µ Ô Ü ½ Ü µô Ü µ Ü Û Ö Ô µô Ü µ Ú Ð Ð ÑÔÐ ÔÓ Ò»Û È Ö Ð Ð Ö Ò ÓÒ Ô Ö Ñ Ö ÒÐÙ Ò Ù Ò Ö Ò Û ÓÒ Ü ÔÓ Ò ÜÔÐ Ò ÓÖ Ò Ý ÙÒ ÓÒ Ô µ ß ÙÒ Ú Ð Ð Ò Ö ÕÙ Ò Ð ÓÒ Ü ß Æ Ê Ò Ö ÓÒ»Ò Û ÔÓ Ò ËÑÓÓ Ò» Ò ÖÔÓÐ ÓÒ Ó ÔÖ ÓÖ ÑÔÐ ² Û

6 Treatment of Parameters: AE Ö Ð ÚÓÐÙ ÓÒ ß ÓÖ ÓÒ Ð ÒÓ Ó Ô Ö Ñ Ö Û Ò Ò ½ ß Ô Ö Ñ Ö ÓÑ Ú Ö Ð ß ½ ½ Û ½ Ò Ô Æ ¼ Ï ½ µ Ö ÙÐ Ò Ò Ô ½ µ Æ ½ Ï ½ µ ÁÒÓÖÔÓÖ Ô Ö Ñ Ö Ò Ô Ö Ð Ð Ö Ò ººº Ù º º Æ Ò È Ý ÓÑÔÙ ÓÒ ÐÐÝ ÙÒ Ö ÒÝ Ó Ô Ö Ñ Ö Ñ ÔÓ Ò ÄÓ Ó Ô Ö Ñ Ö Ò ÓÖÑ ÓÒ Ö Ô Ö ÓÖÑ Ò ÓÚ Ö¹ «Ù ÔÓ Ö ÓÖ Ò Ö Ö ÐÐÝ ÅÓ ÖÒ Ñ Ñ ÒÝ Ô Ö Ñ Ö ß ÐÓ Ó Ò ÓÖÑ ÓÒ ÐÓ

7 Treatment of Parameters: KS à ÖÒ Ð ËÑÓÓ Ò ¹ Ï ¼ º Ö ÔÓÖµ ËÑÓÓ» Ò ÖÔÓÐ Ô Ö Ñ Ö ÑÔÐ ÓÒ ÒÙÓÙ Ö Ù ÓÒ Í Ò Ô Ú ÑÔÓÖ Ò ÑÔÐ Ò Ì Ñ ÑÔÐ»Û µ µ Å Ñ Ò»Ú Ö Ò Ñ Ö Ü Ñ Î Ã ÖÒ Ð Ò Ý Ô µ Æ ½ Ê Ò Ö ÑÔÐ µ Æ Ñ µ ¾ Î µ ß ÑÓÓ Ò Ô Ö Ñ Ö ß Ú ÐÙ Ò Ý Ò ÑÔÓÖ Ò ÑÔÐ Ò µ Ó Ó ÐÓ ÓÒ Ñ Ò ÑÓÓ Ò ÓÖ

8 Treatment of Parameters: KS (cont.) à ÖÒ Ð Û Ë Ö Ò Ï µ Ë Ò Ö ÖÒ Ð ÐÓ ÓÒ Ñ µ µ Ö ÙÐ Ò ÓÚ Ö ÑÓÓ Ò Î µ Î ÓÖÖ Ù Ò ÖÒ Ð ÐÓ ÓÒ Ö Ò Ñ µ µ ½ µñ Û Ö ¾ ½ ¾ Ò Ö ½µ à ÖÒ Ð»Ñ ÜÙÖ ÓÖÖ Å Ñ Ò Ò Ú Ö Ò Ñ Ö Ü Ò µ Ñ Î µ Î

9 Modifying the AE Method ½ ½ Û Ö ½ Æ ¼ Ï ½ µ ÒÓÛ ÓÖÖ Ð Ú ½ µ Ï ½ ¾ Ê ÙÐ ½ µ µ Ñ Ò Î ½ µ Î µ Î ß ÒÓ Ò ÓÖÑ ÓÒ ÐÓ Ò ß Ó» Ô ÓÒ Ó Ï ½ Ë Ò Ö ÓÙÒ ÓÖ Ñ Ó Ï Ò À ÖÖ ÓÒ µ Ï ½ Î ÓÖ Ñ ÐÐ º º ¼º¼½µ Ç Ö ÑÓÖ Ò Ö Ð Ú Ö ÓÒ

10 Modified AE KS ÅÓ ÑÔÐ Û Ô ½ µ Æ ½ ½ µñ ¾ Î µ ½ ¾ ¾ ½ ¾ Ë Ñ ÃË Û Ö Ò ÁÑÔÐ ÔÖ ÓÖ ½ Ô µ Æ ½ µ Æ Ñ µ ¾ Î µ Û Ñ µ µ ½ µñ Ò Ý Ò Ð ÓÙÒ ÓÖ ÖÑ Ò Ò

11 Combined Filtering È Ö Ñ Ö Ü Ò È È µ Ì Ñ Å ÙÑÑ ÖÝ Ü µ µ µ ½ Æ È Ú Ò ÓÖ Ú ÖÝ ÑÔÐ Ò Ñ µ ½ Ü Ü µ ½ Ñ µ Ò Û µ ½» µ µ µ Ó Ü ½ Ó Ô Ý ½ µ ½ Ñ µ µ Ë ÑÔÐ Ùܵ Ò ÓÖ Û ÔÖÓ µ ½ Ò Ò Ñ ½ ÑÔÐ ß µ ½ Æ Ñ µ ¾ Î µ ß Ü µ ½ Ô Ü µ Ò Û µ µ ½µ ½ Ô Ý ½ Ü µ ½ µ ½µ Ô Ý µ ½ ½ Ñ µ µ

12 Simple AR(1) Example ß ÒÓ Ú Ö Ð ÓÒ Ô Ö Ñ Ö ß exact posterior filtering approx ÙÖ ½ ÈÓ Ö ÓÖ ÕÙ Ò Ð ÓÖ Ê ½µ Ô Ö Ñ Ö ¾º ± ¾ ± ¼± ± º ± Ü ¼º ¼º ¼½ ¼º ½ ¼º ¾ ¼º ¾ ÔÔÖÓÜ ¼º ¼º ¼¼ ¼º ½¾ ¼º ¾ ¼º Ì Ð ½ ÉÙ Ò Ð

13 Dynamic Factor Models ß Ö ÓÙ ¼ Ô Ö Ñ Ö Ú Ö Ð ß ÓÖ ÑÓ Ð Ý Õ Ú ÓÖ Ó Ü Ò Ö Ö ÙÖÒ Ðݵ Ú ÓÖ Ó Ð Ò ÓÖ Õ Ñ Ö Ü Ó ÓÖ ÐÓ Ò Ó Æ Ò Ý «Ò Ô Æ ¼ µ Û ½ Õ µ Ä Ò ÓÖ Þ ÖÓ¹Ñ Ò ÒÓÖÑ Ð Û Û Î µ ÜÔ Ü ½ µ ÜÔ Ü µµ Ë ÚÓÐÙ ÓÒ ÑÓ Ð Ë Ú ÓÖ Ü Ü ½ Ü µ ¼ Î ÓÖ Ê ½µ ÑÓ Ð Ü Ü ½ µ Ò Ô Æ ¼ ͵ Û ÓÒ Ð

14 Dynamic Factor Models Ç ÖÚ ÓÒ ÑÓ Ð Ô Ý Ü µ Æ Ý ¼ ÜÔ Ü µ ¼ µ Û Ö ÜÔ Ü µ ÜÔ Ü ½ µ ÜÔ Ü µµ Ë ÚÓÐÙ ÓÒ ÑÓ Ð Ô Ü Ü ½ µ Æ Ü Ü ½ µ ͵ È Ö Ñ Ö Í Õ Ô Ö Ñ Ö

15 Dynamic Factor Model Analysis Ë Ô Ö Ò È ÅÓ Ð Ú Ö ÓÒ Å Å Ò ÐÝ È ÓÒ Ù Ð Ö Ò Ï Å Å ÓÖ Ò ² ÔÓÖ ÓÐ Ó ÓÒ ÖÙ ÓÒ Ù È ÓÒ Ò ÐÝ ÐÝ Ü Ò Ö Ò Ó Õ ÙÖÖ Ò Å Å ÓÚ Ö ¾º Ý Ö Ó ÓÖ Ò ½ ÓÑ Ò Ð Ö Ò Ú È ÓÚ Ö ½ ÓÑÔ Ö ÓÒ Ó È Ö ÙÐ Û ÙÐÐ Å Å Ò ÐÝ ¾ ÏÖ Ò Ð È Ü Í Í ½ µ ¼ ¼ ¼½ ½ ¼ ¼µ Ï Ý ÆÓÖÑ Ð ÖÒ Ð ½ ½ ¼ ¾ µ ¼ ¾ ¼ ¾¼µ ¼ ¼ ¼ ½ µ ¼ ½ ¼ ¾¼µ ½ ¼ ¾ µ ¼ Ô Ö Ñ Ö ººº ½

16 Exchange Rate Time Series.25 DEM.15 JPY 6 x 1 3 CAD time (day) time (day) time (day).25 FRF.15 GBP.2 ESP time (day) time (day) time (day)

17 DFM results at 1 steps «µ 5 x 1 4 α[1] 5 x 1 4 α[2] x α[3] 2 x x α[4] x x α[5] 2 2 x x 1 4 α[6] 5 x x x x 1 3 Ψ[1] x 1 3 Ψ[2].5 x Ψ[3] x 1 3 x 1 3 Ψ[4] x 1 3 x Ψ[5] x x 1 3 Ψ[6] x x x 1 3

18 DFM results at 1 steps µ.75 X[2,1] X[3,1].5 X[3,2] X[4,1] X[4,2].2 X[4,3] X[5,1] X[5,2] X[5,3] X[6,1] X[6,2].4.2 X[6,3]

19 DFM results at 1 steps µ 9 1 µ[1] µ[2] µ[3] logit(φ[1]) logit(φ[2]) logit(φ[3]) 5 1

20 DFM results at 5 steps «µ 5 x 1 4 α[1] 5 x 1 4 α[2] x α[3] 2 x x α[4] x x α[5] 2 2 x x 1 4 α[6] 5 x x x 1 4 x Ψ[1] x 1 3 x 1 3 Ψ[4] x Ψ[2] x 1 3 x Ψ[5] x 1 3 Ψ[3] x x 1 3 Ψ[6] x x x 1 3

21 DFM results at 5 steps µ.75 X[2,1] X[3,1].5 X[3,2] X[4,1] X[4,2].2 X[4,3] X[5,1] X[5,2] X[5,3] X[6,1] X[6,2].4.2 X[6,3]

22 DFM results at 5 steps µ 9 1 µ[1] µ[2] µ[3] logit(φ[1]) logit(φ[2]) logit(φ[3])

23 Comments, issues, future Å Ò ÐÝ ËÑ ÐÐ «Ö Ò Û Ò Å Å Ò È Ð Ö Ö Ñ Ô È Ò ÐÝ ÒÓÖ ÙÒ Ö ÒÝ Ò Í ß ÓÖÖ Ð ÑÓ Û ß «Ö Ò ÓÒ Ô Ö Ñ Ö Ù Ð ¹ÙÔ Ó ÖÖÓÖ Ò ÒÝ ÕÙ Ò Ð Ò ÐÝ Ê Ð Ý ÓÒ Ü Ò Ù ß ÕÙ Ò Ð Ò ÐÝ Ô Ö ÐÐ Ð ÑÓ Ð ß ÐÝ ÙÔ ß Å Å Û Ò È Ñ Ñ ÓÒ Ð ÓÜ

24 Comments, issues, future ÅÓ ÓÒ» Ü Ò ÓÒ È ÁÒ Ö Ò ÔÓ Ö ÓÖ ¹ Ú ÖÝ Ò Ð¹Û ÛÒ ÑÙÐ ÔÐ ÑÓ ººº ÓÑÑÓÒ ÖÒ Ð Ô» Ð Ò Æ Ò ÅÙÐ ÔÐ ÑÓ ÚÓ Ö Ò Ó ÐÓ Ð Ñ Ò Î Ö Ð»ÄÓ Ð ÖÒ Ð Ï Ú Ò ² Ê ÖÝ µ Ù ÓÒ ÓÖÝ µ Ò Ä Ù Ò Ï Ê Ö Ò Ä Ù Ò Ï

Ancillary Software Development at GSI. Michael Reese. Outline: Motivation Old Software New Software

Ancillary Software Development at GSI. Michael Reese. Outline: Motivation Old Software New Software Ancillary Software Development at GSI Michael Reese Outline: Motivation Old Software New Software Work supported by BMBF NuSTAR.DA - TP 6, FKZ: BMBF 05P12RDFN8 (TP 6). March 20, 2013 AGATA week 2013 at

More information

³ ÁÒØÖÓÙØÓÒ ½º ÐÙ ØÖ ÜÔÒ ÓÒ Ò ÌÒ ÓÖ ÓÖ ¾º ÌÛÓ¹ÓÝ ÈÖÓÔÖØ Ó ÓÑÔÐÜ ÆÙÐ º ËÙÑÑÖÝ Ò ÓÒÐÙ ÓÒ º ² ± ÇÆÌÆÌË Åº ÐÚÓÐ ¾ Ëʼ

³ ÁÒØÖÓÙØÓÒ ½º ÐÙ ØÖ ÜÔÒ ÓÒ Ò ÌÒ ÓÖ ÓÖ ¾º ÌÛÓ¹ÓÝ ÈÖÓÔÖØ Ó ÓÑÔÐÜ ÆÙÐ º ËÙÑÑÖÝ Ò ÓÒÐÙ ÓÒ º ² ± ÇÆÌÆÌË Åº ÐÚÓÐ ¾ Ëʼ È Ò È Æ ÇÊÊÄÌÁÇÆË È ÅÁÍŹÏÁÀÌ ÆÍÄÁ ÁÆ Åº ÐÚÓÐ ÂÄ ÇØÓÖ ¾¼¼ ½ ³ ÁÒØÖÓÙØÓÒ ½º ÐÙ ØÖ ÜÔÒ ÓÒ Ò ÌÒ ÓÖ ÓÖ ¾º ÌÛÓ¹ÓÝ ÈÖÓÔÖØ Ó ÓÑÔÐÜ ÆÙÐ º ËÙÑÑÖÝ Ò ÓÒÐÙ ÓÒ º ² ± ÇÆÌÆÌË Åº ÐÚÓÐ ¾ Ëʼ À Ò Ò Ò ÛØ À Ç Òµ Ú Ò µ Ç Òµ

More information

Control-Flow Graph and. Local Optimizations

Control-Flow Graph and. Local Optimizations Control-Flow Graph and - Part 2 Department of Computer Science and Automation Indian Institute of Science Bangalore 560 012 NPTEL Course on Principles of Compiler Design Outline of the Lecture What is

More information

This file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version 3.0.

This file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version 3.0. Range: This file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version.. isclaimer The shapes of the reference glyphs used in these code charts

More information

Using USB Hot-Plug For UMTS Short Message Service. Technical Brief from Missing Link Electronics:

Using USB Hot-Plug For UMTS Short Message Service. Technical Brief from Missing Link Electronics: Technical Brief 20100507 from Missing Link Electronics: Using USB Hot-Plug For UMTS Short Message Service This Technical Brief describes how the USB hot-plug capabilities of the MLE Soft Hardware Platform

More information

Graphs (MTAT , 4 AP / 6 ECTS) Lectures: Fri 12-14, hall 405 Exercises: Mon 14-16, hall 315 või N 12-14, aud. 405

Graphs (MTAT , 4 AP / 6 ECTS) Lectures: Fri 12-14, hall 405 Exercises: Mon 14-16, hall 315 või N 12-14, aud. 405 Graphs (MTAT.05.080, 4 AP / 6 ECTS) Lectures: Fri 12-14, hall 405 Exercises: Mon 14-16, hall 315 või N 12-14, aud. 405 homepage: http://www.ut.ee/~peeter_l/teaching/graafid08s (contains slides) For grade:

More information

Concurrent Architectures - Unix: Sockets, Select & Signals

Concurrent Architectures - Unix: Sockets, Select & Signals Concurrent Architectures - Unix: Sockets, Select & Signals Assignment 1: Drop In Labs reminder check compiles in CS labs & you have submitted all your files in StReAMS! formatting your work: why to 80

More information

Concurrent Execution

Concurrent Execution Concurrent Execution Overview: concepts and definitions modelling: parallel composition action interleaving algebraic laws shared actions composite processes process labelling, action relabeling and hiding

More information

THE AUSTRALIAN NATIONAL UNIVERSITY Practice Final Examination, October 2012

THE AUSTRALIAN NATIONAL UNIVERSITY Practice Final Examination, October 2012 THE AUSTRALIAN NATIONAL UNIVERSITY Practice Final Examination, October 2012 COMP2310 / COMP6310 (Concurrent and Distributed Systems ) Writing Period: 3 hours duration Study Period: 15 minutes duration

More information

An Esterel Virtual Machine

An Esterel Virtual Machine An Esterel Virtual Machine Stephen A. Edwards Columbia University Octopi Workshop Chalmers University of Technology Gothenburg, Sweden December 28 An Esterel Virtual Machine Goal: Run big Esterel programs

More information

Probabilistic analysis of algorithms: What s it good for?

Probabilistic analysis of algorithms: What s it good for? Probabilistic analysis of algorithms: What s it good for? Conrado Martínez Univ. Politècnica de Catalunya, Spain February 2008 The goal Given some algorithm taking inputs from some set Á, we would like

More information

Introduction to Scientific Typesetting Lesson 11: Foreign Languages, Columns, and Section Titles

Introduction to Scientific Typesetting Lesson 11: Foreign Languages, Columns, and Section Titles Introduction to Scientific Typesetting Lesson 11: Foreign Languages,, and Ryan Higginbottom January 19, 2012 1 Ð The Package 2 Without Ð What s the Problem? With Ð Using Another Language Typing in Spanish

More information

DSPTricks A Set of Macros for Digital Signal Processing Plots

DSPTricks A Set of Macros for Digital Signal Processing Plots DSPTricks A Set of Macros for Digital Signal Processing Plots Paolo Prandoni The package DSPTricks is a set of L A TEX macros for plotting the kind of graphs and figures that are usually employed in digital

More information

This document has been prepared by Sunder Kidambi with the blessings of

This document has been prepared by Sunder Kidambi with the blessings of Ôß ò ÉßÔß ßÔß ò ÆÐÐß ßÔß Ôß» Ôò Æß Ð ÐÑß Æß ÐÑ ýæßæòþøñ Ôò Ð ÐÌÐÑßÔßÑú Ôò ÞØ ß Ð ÞØ Ð ÞÚ Ôß ÔÐÛß Ôß Ôß ÉßÛ Ñß Ì Ðß Þ òõß Ñß ßÔß õó This document has been prepared by Sunder Kidambi with the blessings of

More information

How to Implement DOTGO Engines. CMRL Version 1.0

How to Implement DOTGO Engines. CMRL Version 1.0 How to Implement DOTGO Engines CMRL Version 1.0 Copyright c 2009 DOTGO. All rights reserved. Contents 1 Introduction 3 2 A Simple Example 3 2.1 The CMRL Document................................ 3 2.2 The

More information

Instruction Scheduling. Software Pipelining - 3

Instruction Scheduling. Software Pipelining - 3 Instruction Scheduling and Software Pipelining - 3 Department of Computer Science and Automation Indian Institute of Science Bangalore 560 012 NPTEL Course on Principles of Compiler Design Instruction

More information

A Comparison of Mesh Smoothing Methods

A Comparison of Mesh Smoothing Methods A Comparison of Mesh Smoothing Methods Alexander Belyaev Yutaka Ohtake Computer Graphics Group, Max-Planck-Institut für Informatik, 66123 Saarbrücken, Germany Phone: [+49](681)9325-408 Fax: [+49](681)9325-499

More information

Using SmartXplorer to achieve timing closure

Using SmartXplorer to achieve timing closure Using SmartXplorer to achieve timing closure The main purpose of Xilinx SmartXplorer is to achieve timing closure where the default place-and-route (PAR) strategy results in a near miss. It can be much

More information

From Clarity to Efficiency for Distributed Algorithms

From Clarity to Efficiency for Distributed Algorithms From Clarity to Efficiency for Distributed Algorithms Yanhong A. Liu Scott D. Stoller Bo Lin Michael Gorbovitski Computer Science Department, State University of New York at Stony Brook, Stony Brook, NY

More information

) $ G}] }O H~U. G yhpgxl. Cong

) $ G}] }O H~U. G yhpgxl. Cong » Þ åî ïî á ë ïý þý ÿ þ ë ú ú F \ Œ Œ Ÿ Ÿ F D D D\ \ F F D F F F D D F D D D F D D D D FD D D D F D D FD F F F F F F F D D F D F F F D D D D F Ÿ Ÿ F D D Œ Ÿ D Ÿ Ÿ FŸ D c ³ ² í ë óô ò ð ¹ í ê ë Œ â ä ã

More information

Lecture 5 C Programming Language

Lecture 5 C Programming Language Lecture 5 C Programming Language Summary of Lecture 5 Pointers Pointers and Arrays Function arguments Dynamic memory allocation Pointers to functions 2D arrays Addresses and Pointers Every object in the

More information

Text and Image Metasearch on the Web

Text and Image Metasearch on the Web Appears in International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 99, CSREA Press, pp. 89 835, 1999. Copyright c CSREA Press. Text and Image Metasearch on the

More information

Mesh Smoothing via Mean and Median Filtering Applied to Face Normals

Mesh Smoothing via Mean and Median Filtering Applied to Face Normals Mesh Smoothing via Mean and ing Applied to Face Normals Ý Hirokazu Yagou Yutaka Ohtake Ý Alexander G. Belyaev Ý Shape Modeling Lab, University of Aizu, Aizu-Wakamatsu 965-8580 Japan Computer Graphics Group,

More information

Banner 8 Using International Characters

Banner 8 Using International Characters College of William and Mary Banner 8 Using International Characters A Reference and Training Guide Banner Support January 23, 2009 Table of Contents Windows XP Keyboard Setup 3 VISTA Keyboard Setup 7 Creating

More information

Lecture 20: Classification and Regression Trees

Lecture 20: Classification and Regression Trees Fall, 2017 Outline Basic Ideas Basic Ideas Tree Construction Algorithm Parameter Tuning Choice of Impurity Measure Missing Values Characteristics of Classification Trees Main Characteristics: very flexible,

More information

Pointers & Arrays. CS2023 Winter 2004

Pointers & Arrays. CS2023 Winter 2004 Pointers & Arrays CS2023 Winter 2004 Outcomes: Pointers & Arrays C for Java Programmers, Chapter 8, section 8.12, and Chapter 10, section 10.2 Other textbooks on C on reserve After the conclusion of this

More information

Administrivia. Lab 1 will be up by tomorrow, Due Oct. 11

Administrivia. Lab 1 will be up by tomorrow, Due Oct. 11 p.1/45 Administrivia Lab 1 will be up by tomorrow, Due Oct. 11 - Due at start of lecture 4:15pm - Free extension to midnight if you come to lecture - Or for SCPD students only if you watch lecture live

More information

The CImg Library and G MIC

The CImg Library and G MIC The CImg Library and G MIC Open-Source Toolboxes for Image Processing at Different Levels David Tschumperlé { Image Team - GREYC Laboratory (CNRS UMR 6072) - Caen / France} Séminaire LRDE, Paris / France,

More information

On the Complexity of List Scheduling Algorithms for Distributed-Memory Systems.

On the Complexity of List Scheduling Algorithms for Distributed-Memory Systems. On the Complexity of List Scheduling Algorithms for Distributed-Memory Systems. Andrei Rădulescu Arjan J.C. van Gemund Faculty of Information Technology and Systems Delft University of Technology P.O.Box

More information

Design and Implementation of Generics for the.net Common Language Runtime

Design and Implementation of Generics for the.net Common Language Runtime Design and Implementation of Generics for the NET Common Language Runtime Andrew Kennedy Don Syme Microsoft Research, Cambridge, UK ÒÒ ÝÑ Ñ ÖÓ Ó ØºÓÑ Abstract The Microsoft NET Common Language Runtime

More information

RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È.

RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. Let Ò Ô Õ. Pick ¾ ½ ³ Òµ ½ so, that ³ Òµµ ½. Let ½ ÑÓ ³ Òµµ. Public key: Ò µ. Secret key Ò µ.

More information

Appendix C. Numeric and Character Entity Reference

Appendix C. Numeric and Character Entity Reference Appendix C Numeric and Character Entity Reference 2 How to Do Everything with HTML & XHTML As you design Web pages, there may be occasions when you want to insert characters that are not available on your

More information

Component Adaptation and Assembly Using Interface Relations

Component Adaptation and Assembly Using Interface Relations Component Adaptation and Assembly Using Interface Relations Stephen Kell Computer Laboratory, University of Cambridge 15 JJ Thomson Avenue Cambridge CB3 0FD United Kingdom Ö ØÒ Ñ ºÐ ØÒ Ñ Ðº Ѻ ºÙ Abstract

More information

Personal Conference Manager (PCM)

Personal Conference Manager (PCM) Chapter 3-Basic Operation Personal Conference Manager (PCM) Guidelines The Personal Conference Manager (PCM) interface enables the conference chairperson to control various conference features using his/her

More information

Pointers. CS2023 Winter 2004

Pointers. CS2023 Winter 2004 Pointers CS2023 Winter 2004 Outcomes: Introduction to Pointers C for Java Programmers, Chapter 8, sections 8.1-8.8 Other textbooks on C on reserve After the conclusion of this section you should be able

More information

SFU CMPT Lecture: Week 9

SFU CMPT Lecture: Week 9 SFU CMPT-307 2008-2 1 Lecture: Week 9 SFU CMPT-307 2008-2 Lecture: Week 9 Ján Maňuch E-mail: jmanuch@sfu.ca Lecture on July 8, 2008, 5.30pm-8.20pm SFU CMPT-307 2008-2 2 Lecture: Week 9 Binary search trees

More information

RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È.

RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. Let Ò Ô Õ. Pick ¾ ½ ³ Òµ ½ so, that ³ Òµµ ½. Let ½ ÑÓ ³ Òµµ. Public key: Ò µ. Secret key Ò µ.

More information

Cartons (PCCs) Management

Cartons (PCCs) Management Final Report Project code: 2015 EE04 Post-Consumer Tetra Pak Cartons (PCCs) Management Prepared for Tetra Pak India Pvt. Ltd. Post Consumer Tetra Pak Cartons (PCCs) Management! " # $ " $ % & ' ( ) * +,

More information

Blocking System Calls in KRoC/Linux

Blocking System Calls in KRoC/Linux Communicating Process Architectures 2 P.H. Welch and A.W.P. Bakkers (Eds.) IOS Press, 2 155 Blocking System Calls in KRoC/Linux Frederick R.M. Barnes Computing Laboratory, University of Kent, Canterbury,

More information

Communication and processing of text in the Kildin Sámi, Komi, and Nenets, and Russian languages.

Communication and processing of text in the Kildin Sámi, Komi, and Nenets, and Russian languages. TYPE: 96 Character Graphic Character Set REGISTRATION NUMBER: 200 DATE OF REGISTRATION: 1998-05-01 ESCAPE SEQUENCE G0: -- G1: ESC 02/13 06/00 G2: ESC 02/14 06/00 G3: ESC 02/15 06/00 C0: -- C1: -- NAME:

More information

Team Practice October 2012: 1:00 6:00 PM Contest Problem Set

Team Practice October 2012: 1:00 6:00 PM Contest Problem Set Team Practice 1 14 October 2012: 1:00 6:00 PM Contest Problem Set The ten problems on this contest are referred to, in order, by the following names: stones, birdtree, money, duke1, dull, maze, howbig,

More information

54 5 Vol.54 No ACTA ASTRONOMICA SINICA Sep., ASIC (Application Specific Integrated Circuit) Á Ü Ö Êº Æ 4 pixel

54 5 Vol.54 No ACTA ASTRONOMICA SINICA Sep., ASIC (Application Specific Integrated Circuit) Á Ü Ö Êº Æ 4 pixel 54 5 Vol.54 No.5 2013 9 ACTA ASTRONOMICA SINICA Sep., 2013 Ó Å Í Â Ú½ 1,2 1,2 1,2,3 1,2,3 (1 Ê Å µ 210008) (2 Ê µï Å ÇÕ µ 210008) (3 Ê µ 100049) ß Ä (CdZnTe) ±ÆÁ Ú ÜÇÌ Ò Ð Å Ð ½ ¾ ÜÜ Ä ³ Ü Æ Ü Æ ¾ Ñ Ä

More information

Formal Specification of an Asynchronous On-Chip Bus

Formal Specification of an Asynchronous On-Chip Bus Formal Specification of an Asynchronous On-Chip Bus Juha Plosila Tiberiu Seceleanu Turku Centre for Computer Science TUCS Technical Reports No 461, 14th June 2002 Formal Specification of an Asynchronous

More information

Communication and processing of text in the Chuvash, Erzya Mordvin, Komi, Hill Mari, Meadow Mari, Moksha Mordvin, Russian, and Udmurt languages.

Communication and processing of text in the Chuvash, Erzya Mordvin, Komi, Hill Mari, Meadow Mari, Moksha Mordvin, Russian, and Udmurt languages. TYPE: 96 Character Graphic Character Set REGISTRATION NUMBER: 201 DATE OF REGISTRATION: 1998-05-01 ESCAPE SEQUENCE G0: -- G1: ESC 02/13 06/01 G2: ESC 02/14 06/01 G3: ESC 02/15 06/01 C0: -- C1: -- NAME:

More information

Cassandra: Distributed Access Control Policies with Tunable Expressiveness

Cassandra: Distributed Access Control Policies with Tunable Expressiveness Cassandra: Distributed Access Control Policies with Tunable Expressiveness p. 1/12 Cassandra: Distributed Access Control Policies with Tunable Expressiveness Moritz Y. Becker and Peter Sewell Computer

More information

Using Aspect-GAMMA in the Design of Embedded Systems

Using Aspect-GAMMA in the Design of Embedded Systems Using Aspect-GAMMA in the Design of Embedded Systems (Extended Abstract) MohammadReza Mousavi, Giovanni Russello, Michel Chaudron, Michel Reniers, Twan Basten Technische Universiteit Eindhoven (TU/e) P.O.

More information

Constraint Logic Programming (CLP): a short tutorial

Constraint Logic Programming (CLP): a short tutorial Constraint Logic Programming (CLP): a short tutorial What is CLP? the use of a rich and powerful language to model optimization problems modelling based on variables, domains and constraints DCC/FCUP Inês

More information

Contents. Bibliography 43. Index 44

Contents. Bibliography 43. Index 44 Contents 3 Basic Data Types page 2 3.1 Stacks and Queues 2 3.2 Lists 5 3.3 Arrays 17 3.4 Compressed Boolean Arrays (Type int set) 21 3.5 Random Sources 23 3.6 Pairs, Triples, and such 38 3.7 Strings 39

More information

SFU CMPT Lecture: Week 8

SFU CMPT Lecture: Week 8 SFU CMPT-307 2008-2 1 Lecture: Week 8 SFU CMPT-307 2008-2 Lecture: Week 8 Ján Maňuch E-mail: jmanuch@sfu.ca Lecture on June 24, 2008, 5.30pm-8.20pm SFU CMPT-307 2008-2 2 Lecture: Week 8 Universal hashing

More information

124 DISTO pro 4 / pro 4 a-1.0.0zh

124 DISTO pro 4 / pro 4 a-1.0.0zh 0 30 40 50 DISTO PD-Z01 14 DISTO pro 4 / pro 4 a-1.0.0 DISTO pro 4 / pro 4 a-1.0.0 15 16 DISTO pro 4 / pro 4 a-1.0.0 DISTO pro 4 / pro 4 a-1.0.0 17 1 PD-Z03 3 7 4 5 6 10 9 8 18 DISTO pro 4 / pro 4 a-1.0.0

More information

ESCAPE SEQUENCE G0: ESC 02/08 04/13 C0: C1: NAME Extended African Latin alphabet coded character set for bibliographic information interchange

ESCAPE SEQUENCE G0: ESC 02/08 04/13 C0: C1: NAME Extended African Latin alphabet coded character set for bibliographic information interchange TYPE: 9-character graphic character set REGISTRATION NUMBER: 9 DATE OF REGISTRATION: ESCAPE SEQUENCE G: ESC /8 / G: ESC /9 / G: ESC / / G: ESC / / C: C: NAME Extended African Latin alphabet coded character

More information

APPLESHARE PC UPDATE INTERNATIONAL SUPPORT IN APPLESHARE PC

APPLESHARE PC UPDATE INTERNATIONAL SUPPORT IN APPLESHARE PC APPLESHARE PC UPDATE INTERNATIONAL SUPPORT IN APPLESHARE PC This update to the AppleShare PC User's Guide discusses AppleShare PC support for the use of international character sets, paper sizes, and date

More information

INTERVAL ANALYSIS FOR CERTIFIED NUMERICAL SOLUTION OF PROBLEMS IN ROBOTICS

INTERVAL ANALYSIS FOR CERTIFIED NUMERICAL SOLUTION OF PROBLEMS IN ROBOTICS Int. J. Appl. Math. Comput. Sci., 2008, Vol., No., DOI: INTERVAL ANALYSIS FOR CERTIFIED NUMERICAL SOLUTION OF PROBLEMS IN ROBOTICS J-P. MERLET INRIA,2004 Route des Lucioles, 06902 Sophia-Antipolis,France

More information

Propagating XML Constraints to Relations

Propagating XML Constraints to Relations Propagating XML Constraints to Relations Susan Davidson U. of Pennsylvania Wenfei Fan Ý Bell Labs Carmem Hara U. Federal do Parana, Brazil Jing Qin Temple U. Abstract We present a technique for refining

More information

T E C H N I C A L R E P O R T. Disjunctive Logic Programs with Inheritance INSTITUT FÜR INFORMATIONSSYSTEME DBAI-TR-99-30

T E C H N I C A L R E P O R T. Disjunctive Logic Programs with Inheritance INSTITUT FÜR INFORMATIONSSYSTEME DBAI-TR-99-30 T E C H N I C A L R E P O R T INSTITUT FÜR INFORMATIONSSYSTEME ABTEILUNG DATENBANKEN UND ARTIFICIAL INTELLIGENCE Disjunctive Logic Programs with Inheritance DBAI-TR-99-30 Francesco Buccafurri 1 Wolfgang

More information

Algorithms Design for the Parallelization of Nested Loops

Algorithms Design for the Parallelization of Nested Loops NATIONAL TECHNICAL UNIVERSITY OF ATHENS SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT OF INFORMATICS AND COMPUTER TECHNOLOGY COMPUTING SYSTEMS LABORATORY Algorithms Design for the Parallelization

More information

at MODELS 2008 (Proceedings) Edited by

at MODELS 2008 (Proceedings) Edited by 3 rd Workshop on Models@run.time at MODELS 2008 (Proceedings) Edited by Nelly Bencomo Gordon Blair Lancaster University Robert France Colorado State University Freddy Muñoz INRIA, France Cedric Jeanneret

More information

Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms

Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms Roni Khardon Tufts University Medford, MA 02155 roni@eecs.tufts.edu Dan Roth University of Illinois Urbana, IL 61801 danr@cs.uiuc.edu

More information

Directed Single Source Shortest Paths in Linear Average Case Time

Directed Single Source Shortest Paths in Linear Average Case Time Directed Single Source Shortest Paths in inear Average Case Time Ulrich Meyer MPI I 2001 1-002 May 2001 Author s Address ÍÐÖ ÅÝÖ ÅܹÈÐÒ¹ÁÒ ØØÙØ ĐÙÖ ÁÒÓÖÑØ ËØÙÐ ØÞÒÙ Û ½¾ ËÖÖĐÙÒ umeyer@mpi-sb.mpg.de www.uli-meyer.de

More information

Why? The classical inverse ECG problem. The Bidomain model. Outside the heart

Why? The classical inverse ECG problem. The Bidomain model. Outside the heart Ú Áion Úµ Ö Å ÖÚµ Ö Å ÖÙ µ Ñ Ø ¾»» The classical inverse ECG problem Is it possible to compute the electrical potential at the surface of the heart from body surface measurements? Why? Improve traditional

More information

Designing Networks Incrementally

Designing Networks Incrementally Designing Networks Incrementally Adam Meyerson Kamesh Munagala Ý Serge Plotkin Þ Abstract We consider the problem of incrementally designing a network to route demand to a single sink on an underlying

More information

1 System Overview Event Link Data Global Time Distribution... 5

1 System Overview Event Link Data Global Time Distribution... 5 ÎÊ Í Ù Å Ð Ú Ú Ö Ñ Ú Ú Ö Òк ÓÚ Ù Ù Øº ¾¼½ Ê Úº ÓÒØ ÒØ 1 System Overview 3 1.1 Event Link Data........................... 4 1.2 Global Time Distribution...................... 5 2 Receiver Functions 6 2.1

More information

Graph Traversal. 1 Breadth First Search. Correctness. find all nodes reachable from some source node s

Graph Traversal. 1 Breadth First Search. Correctness. find all nodes reachable from some source node s 1 Graph Traversal 1 Breadth First Search visit all nodes and edges in a graph systematically gathering global information find all nodes reachable from some source node s Prove this by giving a minimum

More information

You 2 Software

You 2 Software PrismaCards Enter text for languages with exotic fonts You 2 Software http://www.you2.de info@you2.de Introduction To work in PrismaCards and other programs with complex fonts for different languages you

More information

CERIAS Tech Report

CERIAS Tech Report CERIAS Tech Report 2002-43 AN EXTENSION OF THE DICKMAN FUNCTION AND ITS APPLICATION by Chaogui Zhang Center for Education and Research in Information Assurance and Security, Purdue University, West Lafayette,

More information

BUCKLEY. User s Guide

BUCKLEY. User s Guide BUCKLEY User s Guide O P E N T Y P E FAQ : For information on how to access the swashes and alternates, visit LauraWorthingtonType.com/faqs All operating systems come equipped with a utility that make

More information

Turbulence et Génération de Bruit Equipe de recherche du Centre Acoustique LMFA, UMR CNRS 5509, Ecole Centrale de Lyon Simulation Numérique en Aéroacoustique Institut Henri Poincaré - 16 novembre 2006

More information

State of Connecticut Workers Compensation Commission

State of Connecticut Workers Compensation Commission State of Connecticut Workers Compensation Commission Notice to Employees Workers Compensation Act Chapter 568 of the Connecticut General Statutes (the Workers Compensation Act) requires your employer,

More information

The role of the parser

The role of the parser The role of the parser source code tokens scanner parser IR errors Parser performs context-free syntax analysis guides context-sensitive analysis constructs an intermediate representation produces meaningful

More information

ERNST. Environment for Redaction of News Sub-Titles

ERNST. Environment for Redaction of News Sub-Titles ERNST Environment for Redaction of News Sub-Titles Introduction ERNST (Environment for Redaction of News Sub-Titles) is a software intended for preparation, airing and sequencing subtitles for news or

More information

Overview: Concurrent Architectures - Unix: Forks and Pipes

Overview: Concurrent Architectures - Unix: Forks and Pipes Overview: Concurrent Architectures - Unix: Forks and Pipes Other Matters: TuteLab-5 solutions and the proof of Peterson s Algorithm Ref: [Coulouris&al Ch 4] history architecture: monolithic vs microkernels,

More information

Analysis and Optimisation of Active Database Rules Using Abstract Interpretation and Partial Evaluation

Analysis and Optimisation of Active Database Rules Using Abstract Interpretation and Partial Evaluation Analysis and Optimisation of Active Database Rules Using Abstract Interpretation and Partial Evaluation ¾ ½ James Bailey ½ and Alexandra Poulovassilis ¾ Dept. of Computer Science, King s College London,

More information

KbdKaz 500 layout tables

KbdKaz 500 layout tables a ao a ao a o o o o o a a oo A o a a o a a oa ao oo A o a a o oa ao A a o a oa oa ao o a a a a o a A a a A ˆ a a A ˇ ao a a A a a A o Ao a a A Ao a o a a A ao a o a a A α a A a a a A o o a a A A a a A

More information

GPGPU programming on example of CUDA

GPGPU programming on example of CUDA GPGPU programming onexampleofcuda Institute of Theoretical Physics University of Wrocław Outline CPU CPU Architecture GPU GPU Architecture CUDA Architecture Existing GPGPU frameworks GPU programming Data

More information

View-Based 3D Object Recognition Using SNoW

View-Based 3D Object Recognition Using SNoW View-Based 3D Object Recognition Using SNoW Ming-Hsuan Yang Narendra Ahuja Dan Roth Department of Computer Science and Beckman Institute University of Illinois at Urbana-Champaign, Urbana, IL 61801 mhyang@vison.ai.uiuc.edu

More information

Calligraphic Packing. Craig S. Kaplan. Computer Graphics Lab David R. Cheriton School of Computer Science University of Waterloo. GI'07 May 28, 2007

Calligraphic Packing. Craig S. Kaplan. Computer Graphics Lab David R. Cheriton School of Computer Science University of Waterloo. GI'07 May 28, 2007 Calligraphic Packing Jie Xu Craig S. Kaplan Computer Graphics Lab David R. Cheriton School of Computer Science University of Waterloo GI'07 May 28, 2007 Outline 1 Background of NPR Packing Artistic Packing

More information

On the Analysis of Interacting Pushdown Systems

On the Analysis of Interacting Pushdown Systems On the Analysis of Interacting Pushdown Systems Vineet Kahlon NEC Labs America, Princeton, NJ 08540, USA. ÐÓÒҹРºÓÑ Aarti Gupta NEC Labs America, Princeton, NJ 08540, USA. ÙÔØҹРºÓÑ Abstract Pushdown

More information

tranx86 an Optimising ETC to IA32 Translator

tranx86 an Optimising ETC to IA32 Translator Communicating Process Architectures 2001 Alan Chalmers, Majid Mirmehdi and Henk Muller (Eds.) IOS Press, 2001 265 tranx86 an Optimising ETC to IA32 Translator Frederick R.M. Barnes Computing Laboratory,

More information

Agglomerative Information Bottleneck

Agglomerative Information Bottleneck Agglomerative Information Bottleneck Noam Slonim Naftali Tishby Institute of Computer Science and Center for Neural Computation The Hebrew University Jerusalem, 91904 Israel email: noamm,tishby@cs.huji.ac.il

More information

ConMan. A Web based Conference Manager for Asterisk. How I Managed to get Con'd into skipping my summer vacation by building this thing

ConMan. A Web based Conference Manager for Asterisk. How I Managed to get Con'd into skipping my summer vacation by building this thing ConMan A Web based Conference Manager for Asterisk -or- How I Managed to get Con'd into skipping my summer vacation by building this thing $90503&07 $:3.74889028,-47,94708 $90503&078:3.42 Sun Labs, slide

More information

Scan Scheduling Specification and Analysis

Scan Scheduling Specification and Analysis Scan Scheduling Specification and Analysis Bruno Dutertre System Design Laboratory SRI International Menlo Park, CA 94025 May 24, 2000 This work was partially funded by DARPA/AFRL under BAE System subcontract

More information

HoneyBee User s Guide

HoneyBee User s Guide HoneyBee User s Guide font faq HOW TO INSTALL YOUR FONT You will receive your files as a zipped folder. For instructions on how to unzip your folder, visit LauraWorthingtonType.com/faqs/. Your font is

More information

VRF SYSTEM CENTRAL CONTROLLER ("Smart manager") WIRING

VRF SYSTEM CENTRAL CONTROLLER (Smart manager) WIRING VRF SYSTEM CENTRAL CONTROLLER ("Smart manager") WIRING Carrier provided ͳ ³ ² ¹» Û» ²» Ó±² ± ñý±² ± ñí» ²¹ ² ²» Carrier provided б» «² Ó ïîè ²¼±± Ü ¹ ññ ¹² Ó ²í ññ«î Ó±²» ± ½» ±² ±º» Ó ì ÐÝ ³«²»±«½½»

More information

III. CLAIMS ADMINISTRATION

III. CLAIMS ADMINISTRATION III. CLAIMS ADMINISTRATION Insurance Providers: Liability Insurance: Greenwich Insurance Company American Specialty Claims Representative: Mark Thompson 142 N. Main Street, Roanoke, IN 46783 Phone: 260-672-8800

More information

District Institute of Education and Training Lawspet, Puducherry.

District Institute of Education and Training Lawspet, Puducherry. District Institute of Education and Training Lawspet, Puducherry. Educational Computing Record work done by with the Register Number. Submitted for the Internal Assessment examination, April / May 2011,

More information

Version /10/2015. Type specimen. Bw STRETCH

Version /10/2015. Type specimen. Bw STRETCH Version 1.00 08/10/2015 Bw STRETCH type specimen 2 Description Bw Stretch is a compressed grotesque designed by Alberto Romanos, suited for display but also body text purposes. It started in 2013 as a

More information

Adorn. Serif. Smooth. v22622x

Adorn. Serif. Smooth. v22622x s u Adorn f Serif Smooth 9 0 t v22622x user s guide PART OF THE ADORN POMANDER SMOOTH COLLECTION v O P E N T Y P E FAQ : For information on how to access the swashes and alternates, visit LauraWorthingtonType.com/faqs

More information

Adorn. Serif. Smooth. v22622x. user s guide PART OF THE ADORN POMANDER SMOOTH COLLECTION

Adorn. Serif. Smooth. v22622x. user s guide PART OF THE ADORN POMANDER SMOOTH COLLECTION s u Adorn f Serif Smooth 9 0 t v22622x user s guide PART OF THE ADORN POMANDER SMOOTH COLLECTION v font faq HOW TO INSTALL YOUR FONT You will receive your files as a zipped folder. For instructions on

More information

A sharp threshold in proof complexity yields lower bounds for satisfiability search

A sharp threshold in proof complexity yields lower bounds for satisfiability search A sharp threshold in proof complexity yields lower bounds for satisfiability search Dimitris Achlioptas Microsoft Research One Microsoft Way Redmond, WA 98052 optas@microsoft.com Michael Molloy Ý Department

More information

A Modality for Recursion

A Modality for Recursion A Modality for Recursion (Technical Report) March 31, 2001 Hiroshi Nakano Ryukoku University, Japan nakano@mathryukokuacjp Abstract We propose a modal logic that enables us to handle self-referential formulae,

More information

Sheila. Regular Bold. User s Guide

Sheila. Regular Bold. User s Guide Sheila Regular Bold User s Guide font faq HOW TO INSTALL YOUR FONT You will receive your files as a zipped folder. For instructions on how to unzip your folder, visit LauraWorthingtonType.com/faqs/. Your

More information

High-Level Reformulation of Constraint Programs

High-Level Reformulation of Constraint Programs High-Level Reformulation of Constraint Programs Brahim Hnich Pierre Flener Computer Science Division Department of Information Science Uppsala University Box 513 S 751 20 Uppsala Sweden Brahim.Hnich, Pierre.Flener

More information

On Clusterings Good, Bad and Spectral

On Clusterings Good, Bad and Spectral On Clusterings Good, Bad and Spectral Ravi Kannan Computer Science, Yale University. kannan@cs.yale.edu Santosh Vempala Ý Mathematics, M.I.T. vempala@math.mit.edu Adrian Vetta Þ Mathematics, M.I.T. avetta@math.mit.edu

More information

Response Time Analysis of Asynchronous Real-Time Systems

Response Time Analysis of Asynchronous Real-Time Systems Response Time Analysis of Asynchronous Real-Time Systems Guillem Bernat Real-Time Systems Research Group Department of Computer Science University of York York, YO10 5DD, UK Technical Report: YCS-2002-340

More information

A Theory of Inductive Query Answering

A Theory of Inductive Query Answering In Proceedings of ICDM 02 1 A Theory of Inductive Query Answering Luc DE RAEDT Ý Manfred JAEGER Ý Þ Sau Dan LEE Ý Heikki MANNILA Þ Ý Inst. für Informatik University of Freiburg Georges Koehler Allee 79

More information

Modules. CS2023 Winter 2004

Modules. CS2023 Winter 2004 Modules CS2023 Winter 2004 Outcomes: Modules C for Java Programmers, Chapter 7, sections 7.4.1-7.4.6 Code Complete, Chapter 6 After the conclusion of this section you should be able to Understand why modules

More information

r v i e w o f s o m e r e c e n t d e v e l o p m

r v i e w o f s o m e r e c e n t d e v e l o p m O A D O 4 7 8 O - O O A D OA 4 7 8 / D O O 3 A 4 7 8 / S P O 3 A A S P - * A S P - S - P - A S P - - - - L S UM 5 8 - - 4 3 8 -F 69 - V - F U 98F L 69V S U L S UM58 P L- SA L 43 ˆ UéL;S;UéL;SAL; - - -

More information

Contrast. user s guide

Contrast. user s guide N Contrast chu U77777777V user s guide c P font faq HOW TO INSTALL YOUR FONT You will receive your files as a zipped folder. For instructions on how to unzip your folder, visit LauraWorthingtonType.com/faqs/.

More information

Second Year March 2017

Second Year March 2017 Reg. No. :... Code No. 5052 Name :... Second Year March 2017 Time : 2 Hours Cool-off time : 15 Minutes Part III COMPUTER APPLICATION (Commerce) Maximum : 60 Scores General Instructions to Candidates :

More information

7DONSODQ. ƒ We called our platform 9 D-II TG: Distributed Internet Traffic Generator

7DONSODQ. ƒ We called our platform 9 D-II TG: Distributed Internet Traffic Generator ',7*'LVWULEXWHG,QWHUQHW7UDIILF *HQHUDWRU Antonio Pescapè,, Donato Emma, Stefano Avallone,, Alessio Botta, and Giorgio Ventre { pescape@unina.it @unina.it} Dipartimento Informatica e Sistemistica Università

More information