Ancillary Software Development at GSI. Michael Reese. Outline: Motivation Old Software New Software
|
|
|
- Osborne Mathews
- 5 years ago
- Views:
Transcription
1 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 GANIL Michael Reese 1
2 Motivation My experiences [ approx. number of analog channels ] HORUS (Cologne) Plunger (Cologne) March 20, 2013 AGATA week 2013 at GANIL Michael Reese 2
3 Motivation My experiences [ approx. number of analog channels ] HORUS (Cologne) Plunger (Cologne) g-factors (GSI) DSAM (Legnaro) March 20, 2013 AGATA week 2013 at GANIL Michael Reese 2
4 Motivation My experiences [ approx. number of analog channels ] HORUS (Cologne) Plunger (Cologne) g-factors (GSI) DSAM (Legnaro) PRISMA (Legnaro) March 20, 2013 AGATA week 2013 at GANIL Michael Reese 2
5 Motivation My experiences [ approx. number of analog channels ] HORUS (Cologne) Plunger (Cologne) g-factors (GSI) DSAM (Legnaro) PRISMA (Legnaro) PreSPEC (GSI) March 20, 2013 AGATA week 2013 at GANIL Michael Reese 2
6 Motivation My experiences [ approx. number of analog channels ] HORUS (Cologne) Plunger (Cologne) g-factors (GSI) DSAM (Legnaro) PRISMA (Legnaro) PreSPEC (GSI) Repetitive Tasks copy data display data histograms define gates include software modules March 20, 2013 AGATA week 2013 at GANIL Michael Reese 2
7 Recently Used Ancillary Data Analysis Software March 20, 2013 AGATA week 2013 at GANIL Michael Reese 3
8 Recently Used Ancillary Data Analysis Software new_prespec_go4 plugin for Go4, split into a library and a Go4 part based on 16k lines of "grown code" has now 33k lines of C++ no use of C++-STL March 20, 2013 AGATA week 2013 at GANIL Michael Reese 3
9 Recently Used Ancillary Data Analysis Software new_prespec_go4 plugin for Go4, split into a library and a Go4 part based on 16k lines of "grown code" has now 33k lines of C++ no use of C++-STL 33k lines of code are much too difficult to maintain/extend/debug! March 20, 2013 AGATA week 2013 at GANIL Michael Reese 3
10 Recently Used Ancillary Data Analysis Software new_prespec_go4 plugin for Go4, split into a library and a Go4 part based on 16k lines of "grown code" has now 33k lines of C++ no use of C++-STL 33k lines of code are much too difficult to maintain/extend/debug! The intended simplification/clarification of the code goes into the wrong direction - at least in terms of codesize March 20, 2013 AGATA week 2013 at GANIL Michael Reese 3
11 Analysis software - structure of the problem (simplified) schematics of the problem s structure LyccaCrate LyccaTargetCrate LyccaWallDSSD_1 LyccaWallDSSD_i LyccaWallDSSD_16 FrsTpcCrate FrsCrate PsaFrame LyccaTargetDSSD LyccaWall Tpc Music Tof AgataGammaTracking ParticleTrackingIn ParticleTrackingOut S4TrackingIn ParticleIdOut HectorCrate ParticleIdIn DopplerCorrection ScatteringAngle Hector FinalEventData March 20, 2013 AGATA week 2013 at GANIL Michael Reese 4
12 Analysis software - structure of the problem (simplified) schematics of the problem s structure LyccaCrate LyccaTargetCrate LyccaWallDSSD_1 LyccaWallDSSD_i LyccaWallDSSD_16 FrsTpcCrate FrsCrate PsaFrame LyccaTargetDSSD LyccaWall Tpc Music Tof AgataGammaTracking ParticleTrackingIn ParticleTrackingOut S4TrackingIn ParticleIdOut HectorCrate ParticleIdIn DopplerCorrection ScatteringAngle Hector FinalEventData Analysis structure adapted to the problem s structure processing nodes are objects (in the OOP sense) the graph structure is easy to define (configuration files) main work cycle: call the processing units and move data along the graph March 20, 2013 AGATA week 2013 at GANIL Michael Reese 4
13 Forwarding Data Processing Unit (source) one double (value) one bool (valid) Processing Unit (destination) channel channel channel value value... value Processing Unit (source) Processing Unit (destination) list of channel value pairs Single value forwarding a value always goes together with a valid-flag this avoids any kind of default-value related problem Sparse/Multihit array data variable sized list of channel-value pairs used for multihit- and multichannel data not optimized for dense multichannel data only encountered in Lycca tof March 20, 2013 AGATA week 2013 at GANIL Michael Reese 5
14 Analysis Software - a new approach Different layers of complexity 0 configuration algorithm implementation C++ skills core system March 20, 2013 AGATA week 2013 at GANIL Michael Reese 6
15 Analysis Software - a new approach Different layers of complexity configuration 0 algorithm implementation C++ skills core system Writing a library independence flexibility extensibility completeness simplicity efficiency reusability March 20, 2013 AGATA week 2013 at GANIL Michael Reese 6
16 Differences to the previous analysis old approach new approach Go4 Gammaware Go4 Gammaware histograms (C++) conditions (C++) analysis histograms (C++) conditions (C++) analysis analysis analysis old library analysis (C++) new library data flow(c++) config parser(c++) frs TPC C++... C++ C++ DSSD C++ C++ config script definition of the analysis and all histograms and conditions in a high level special purpose language March 20, 2013 AGATA week 2013 at GANIL Michael Reese 7
17 Target DSSD analysis Ö Ø ÄÝ Ì Ö ØÌÓ Ö Ø ÔÖÓ ¼ ØÖ Ö ÐÐ ÑÓ ÙÐ ¼ ÆÚ ÑÓ ÙÐ ½ ÆÚ ÑÓ ÙÐ Ø ÆÚ ººº Ò ÔÖÓ ÓÖ ÄÝ»Ì Ö Ø ÄÝ ËË ÑÔÐ ØÙ Ô ½ ¼ ¹ ÄÝ Ì Ö ØÌÓ Ö Ø º ¼ ¼ ½ ÑÔÐ ØÙ Ô ¾ ½ ¹ ÄÝ Ì Ö ØÌÓ Ö Ø º ¼ ¾ ½ ÑÔÐ ØÙ Ò ¼ ½ ¹ ÄÝ Ì Ö ØÌÓ Ö Ø º ½ ¼ ½ ÔÐ Ý Ü Ù Ý Ù ¹ ¼ ¼ ¹ ¼ ¼ ÔÐ Ý ½¼¾ ¼ ¼¼¼ Ò March 20, 2013 AGATA week 2013 at GANIL Michael Reese 8
18 Lycca DSSD algorithm documentation ÒÐÙ ÔÖ Ô»ÔÖÓ»ÈÖÓ ÓÖº ÔÔ Ð ÄÝ ËË ÔÙ Ð ÈÖÓ ÓÖ ß ÔÙ Ð ÄÝ ËË ÓÒ Ø Ø ØÖ Ò ²ÓÒ Ö ÓÒ Ø Ø ØÖ Ò ²Ò Ñ ÓÒ Ø Ø Ú ØÓÖ ÒØ ØÖ Ö Ø Ú ØÓÖ ÒØ µµ ÄÝ ËË µ Ú ÖØÙ Ð ÚÓ ÔÖÓ Ú ÓÒ ÁÒØ Ö ²Ú ÓÒ ÒØ Ö ÒØ ØÖ Öµ ÒÙÑ ÁÒÔÙØ ÖÖ Ý ß ÑÔÐ ØÙ Ô»» ÑÔÐ ØÙ Ó Ô¹ ÒÒ Ð ÑÔÐ ØÙ Ò»» ÑÔÐ ØÙ Ó Ò¹ ÒÒ Ð Ð ÒÙÑ ÇÙØÔÙØ ß Ü Ù»» ܹÔÓ Ø ÓÒ Ù ØÖ Ô Ö ÓÐÙØ ÓÒ Ý Ù»» ݹÔÓ Ø ÓÒ Ù ØÖ Ô Ö ÓÐÙØ ÓÒ»» Ò Ö Ý ÐÓ Ô»Ò Ú Ö Ð ÒÙÑ È Ö Ñ Ø Ö ß ØÖ Ô ÒÙÑ Ô»» ÒÙÑ Ö Ó Ô¹ ØÖ Ô Ø Ö ÓÐ Ô»» ÙÔÔ Ö Ò ÐÓÛ Ö Ø Ö ÓÐ Ó Ô¹ Ò Ö Ý»» ººº Ð ÒÙÑ Ð Ö Ø ÓÒ ß Ð Ô»» Ò Ö Ý Ð Ö Ø ÓÒ ÓÖ Ô¹ Ð Ò»» Ò Ö Ý Ð Ö Ø ÓÒ ÓÖ Ò¹ Ð Ð March 20, 2013 AGATA week 2013 at GANIL Michael Reese 9
19 Lycca time-of-flight stop detector ÔÖÓ ÓÖ ÄÝ»ÌÓ ËØÓÔÈÖ ÔÖÓ Å Ì ÈÖ ÔÖÓ ÓÖ Ö Ö Ò ¹ ÄÝ Ì Ö ØÌÓ Ö Ø ºÑ Ø ¼ ½ ÒÔÙØ ¼ ½ ¹ ÄÝ Ì Ö ØÌÓ Ö Ø ºÑ Ø ½ ¼ ½ ÒÔÙØ ½ ½ ¹ ÄÝ Ì Ö ØÌÓ Ö Ø ºÑ Ø ¾ ½ ½ ÔÐ Ý ½ ¼º½ ¼ ¾¼¼ Ø ÔÐ Ý ÓÙØÔÙØ ½ ¼º½ ¼ ¾¼¼ Ò ÔÖÓ ÓÖ ÄÝ»ÌÓ ËØÓÔ ÖÙÐ ÖÅ Ñ Ö Ò Ë ÒØ ÐÐ ØÓÖ ÔÑØ Ø Ñ ¼ ½ ¹ ÄÝ»ÌÓ ËØÓÔÈÖ ÔÖÓºÓÙØÔÙØ ½ ¼ Ü Ø ¹ ÄÝ»Ï ÐÐºÜ Ý Ø ¹ ÄÝ»Ï ÐÐºÝ ÔÐ Ý Ü Ý ¾ ¹½ ¼ ½ ¼ ¾ ¹½ ¼ ½ ¼ Ò March 20, 2013 AGATA week 2013 at GANIL Michael Reese 10
20 Wall DSSD analysis Ö Ø ÄÝ Ï ÐÐ Ö Ø ½ ÔÖÓ ¼ ÑÓ ÙÐ ¼½ ÆÚ ººº ººº ººº Ò Ö Ø ÄÝ Ï ÐÐ Ö Ø ¾ ÔÖÓ ¼ ÑÓ ÙÐ ½ ÆÚ ººº ººº ººº Ò ÓÖ Ò ¼½ ¼¾ ¼ ¼ ¼ ¼ ½½ ½¾ ÔÖÓ ÓÖ ÄÝ»Ï ÐÐ ÄÝ ËË ÑÔÐ ØÙ Ô ¼ ½ ¹ ÄÝ Ï ÐÐ Ö Ø ½º ¼ ½ ÑÔÐ ØÙ Ò ¼ ½ ¹ ÄÝ Ï ÐÐ Ö Ø ½º ½ ½ Ò Ò ÓÖ Ò ½ ½ ½ ½ ½ ¾¼ ¾ ¾ ÔÖÓ ÓÖ ÄÝ»Ï ÐÐ ÄÝ ËË ÑÔÐ ØÙ Ô ¼ ½ ¹ ÄÝ Ï ÐÐ Ö Ø ¾º ¼ ½ ÑÔÐ ØÙ Ò ¼ ½ ¹ ÄÝ Ï ÐÐ Ö Ø ¾º ½ ½ Ò Ò ÔÖÓ ÓÖ ÄÝ»Ï ÐÐ ÄÝ Ï ÐÐ ÓÖ Ï ÄÄ ÅÇ ÍÄ Ò ¼½ ¼¾ ¼ ¼ ¼ ¼ ½½ ½¾ ½ ½ ½ ½ ½ ¾¼ ¾ ¾ Ü Ï ÄÄ ÅÇ ÍÄ ¹ ÄÝ»Ï ÐÐ Ï ÄÄ ÅÇ ÍÄ ºÜ Ù Ý Ï ÄÄ ÅÇ ÍÄ ¹ ÄÝ»Ï ÐÐ Ï ÄÄ ÅÇ ÍÄ ºÝ Ù Ï ÄÄ ÅÇ ÍÄ ¹ ÄÝ»Ï ÐÐ Ï ÄÄ ÅÇ ÍÄ º Ò ÔÐ Ý Ü Ý ¾ ¹½ ¼ ½ ¼ ¾ ¹½ ¼ ½ ¼ Ò March 20, 2013 AGATA week 2013 at GANIL Michael Reese 11
21 Advantages Conceptual advantages Everything that is no algorithm is outside C++ Algorithms have a clear interface definition There is a unique and intuitive place for each parameter The set of configuration files is complete documentation of the setup (daq, modules, cabling,...) 1 except parts of boost which are now in the C++11 standard March 20, 2013 AGATA week 2013 at GANIL Michael Reese 12
22 Advantages Conceptual advantages Everything that is no algorithm is outside C++ Algorithms have a clear interface definition There is a unique and intuitive place for each parameter The set of configuration files is complete documentation of the setup (daq, modules, cabling,...) Technical advantages Independent of any GUI program. Can be used with Go4, Gammaware,..., without any change independent of any external library 1, in particular ROOT No recompiling if configuration is changed 1 except parts of boost which are now in the C++11 standard March 20, 2013 AGATA week 2013 at GANIL Michael Reese 12
23 Implementation Technical details complete library with everything a programmer expects (nowadays) unique interface for unpacker/processing classes config file parser with helpful error messages using C++ with STL and boost (only parts of boost that are inside C++11 standard by now) March 20, 2013 AGATA week 2013 at GANIL Michael Reese 13
24 Implementation Technical details complete library with everything a programmer expects (nowadays) unique interface for unpacker/processing classes config file parser with helpful error messages using C++ with STL and boost (only parts of boost that are inside C++11 standard by now) approximately 2-3 weeks of work for implementation of the graph framework approximately 1 week of implementing PreSpec processing units and defining the graph March 20, 2013 AGATA week 2013 at GANIL Michael Reese 13
25 Implementation Technical details complete library with everything a programmer expects (nowadays) unique interface for unpacker/processing classes config file parser with helpful error messages using C++ with STL and boost (only parts of boost that are inside C++11 standard by now) approximately 2-3 weeks of work for implementation of the graph framework approximately 1 week of implementing PreSpec processing units and defining the graph adapted for the analsysis of perfomance commissioning data (ready) How to get it Ø ÐÓÒ Ø ÐܹÔÓÓк º Ø»ÔÖ Ô March 20, 2013 AGATA week 2013 at GANIL Michael Reese 13
26 Community M. Reese (TU-Darmstadt): initiation of the project M. L. Cortes (TU-Darmstadt): first addidtional user and developer, adding Processors for FRS-ID and simpler Gating L. G. Sarmiento (Lund University): adding CMake support, potential core developer March 20, 2013 AGATA week 2013 at GANIL Michael Reese 14
27 Community M. Reese (TU-Darmstadt): initiation of the project M. L. Cortes (TU-Darmstadt): first addidtional user and developer, adding Processors for FRS-ID and simpler Gating L. G. Sarmiento (Lund University): adding CMake support, potential core developer Thank you! March 20, 2013 AGATA week 2013 at GANIL Michael Reese 14
Models, Notation, Goals
Scope Ë ÕÙ Ò Ð Ò ÐÝ Ó ÝÒ Ñ ÑÓ Ð Ü Ô Ö Ñ Ö ² Ñ ¹Ú ÖÝ Ò Ú Ö Ð Ö ÒÙÑ Ö Ð ÔÓ Ö ÓÖ ÔÔÖÓÜ Ñ ÓÒ ß À ÓÖ Ð Ô Ö Ô Ú ß Ë ÑÙÐ ÓÒ Ñ Ó ß ËÑÓÓ Ò ² Ö Ò Ö Ò Ô Ö Ñ Ö ÑÔÐ ß Ã ÖÒ Ð Ñ Ó ÚÓÐÙ ÓÒ Ñ Ó ÓÑ Ò Ô Ö Ð Ð Ö Ò Ð ÓÖ Ñ
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
³ ÁÒØÖÓÙØÓÒ ½º ÐÙ ØÖ ÜÔÒ ÓÒ Ò ÌÒ ÓÖ ÓÖ ¾º ÌÛÓ¹ÓÝ ÈÖÓÔÖØ Ó ÓÑÔÐÜ ÆÙÐ º ËÙÑÑÖÝ Ò ÓÒÐÙ ÓÒ º ² ± ÇÆÌÆÌË Åº ÐÚÓÐ ¾ Ëʼ
È Ò È Æ ÇÊÊÄÌÁÇÆË È ÅÁÍŹÏÁÀÌ ÆÍÄÁ ÁÆ Åº ÐÚÓÐ ÂÄ ÇØÓÖ ¾¼¼ ½ ³ ÁÒØÖÓÙØÓÒ ½º ÐÙ ØÖ ÜÔÒ ÓÒ Ò ÌÒ ÓÖ ÓÖ ¾º ÌÛÓ¹ÓÝ ÈÖÓÔÖØ Ó ÓÑÔÐÜ ÆÙÐ º ËÙÑÑÖÝ Ò ÓÒÐÙ ÓÒ º ² ± ÇÆÌÆÌË Åº ÐÚÓÐ ¾ Ëʼ À Ò Ò Ò ÛØ À Ç Òµ Ú Ò µ Ç Òµ
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
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
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
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,
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
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
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:
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
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
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
) $ G}] }O H~U. G yhpgxl. Cong
![) $ G}] }O H~U. G yhpgxl. Cong](/thumbs/92/110345154.jpg ") $ 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 ³ ² í ë óô ò ð ¹ í ê ë Œ â ä ã
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
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
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,
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
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
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
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
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
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
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
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,
This document has been prepared by Sunder Kidambi with the blessings of
Ôß ò ÉßÔß ßÔß ò ÆÐÐß ßÔß Ôß» Ôò Æß Ð ÐÑß Æß ÐÑ ýæßæòþøñ Ôò Ð ÐÌÐÑßÔßÑú Ôò ÞØ ß Ð ÞØ Ð ÞÚ Ôß ÔÐÛß Ôß Ôß ÉßÛ Ñß Ì Ðß Þ òõß Ñß ßÔß õó This document has been prepared by Sunder Kidambi with the blessings of
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 Ò µ.
Parallel Functional Reactive Programming
Parallel Functional Reactive Programming John Peterson, Valery Trifonov, and Andrei Serjantov Yale University Ô Ø Ö ÓÒ¹ Ó Ò ºÝ Ð º Ù ØÖ ÓÒÓÚ¹Ú Ð ÖÝ ºÝ Ð º Ù Ò Ö º Ö ÒØÓÚÝ Ð º Ù Abstract In this paper,
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,
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 Ò µ.
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,
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,
An Experimental CLP Platform for Integrity Constraints and Abduction
An Experimental CLP Platform for Integrity Constraints and Abduction Slim Abdennadher ½ and Henning Christiansen ¾ ½ ¾ Computer Science Department, University of Munich Oettingenstr. 67, 80538 München,
InterWorx Control Panel Installation Guide. by InterWorx LLC
InterWorx Control Panel Installation Guide by InterWorx LLC Contents I Installing InterWorx Control Panel 3 1 InterWorx Installation Requirements 4 1.1 Operating System Support........................................
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
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
TCP Non-Renegable Selective Acknowledgments (NR-SACKs) and benefits for space and satellite communications
November 3, 07, ISAE SUPAERO Toulouse, France TCP Non-Renegable Selective Acknowledgments (NR-SACKs) and benefits for space and satellite communications Fan Yang, Paul D. Amer, Si Quoc Viet Trang, and
Networks. Other Matters: draft Assignment 2 up (Labs 7 & 8 v. important!!) Ref: [Coulouris&al Ch 3, 4] network performance and principles
![Networks. Other Matters: draft Assignment 2 up (Labs 7 & 8 v. important!!) Ref: [Coulouris&al Ch 3, 4] network performance and principles](/thumbs/86/94947115.jpg "Networks. Other Matters: draft Assignment 2 up (Labs 7 & 8 v. important!!) Ref: [Coulouris&al Ch 3, 4] network performance and principles")
Networks Other Matters: draft Assignment 2 up (Labs 7 & 8 v. important!!) Ref: [Coulouris&al Ch 3, 4] network performance and principles OSI protocol; routing TCP/IP layers and packet organization IP addresses
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
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,
Step 0 How to install VirtualBox on Windows operating system?
Written and cooked by Janusz R. Getta, School of Computing and Information Technology, University of Wollongong Building 3, room 2120, ext 4339, jrg@uow.edu.au, http://www.uow.edu.au/ jrg ËÁ̽½ Ø Å Ò Ñ
Ticc: A Tool for Interface Compatibility and Composition
ÒØÖ Ö Ò Î Ö Ø ÓÒ Ì Ò Ð Ê ÔÓÖØ ÒÙÑ Ö ¾¼¼ º Ì ÌÓÓÐ ÓÖ ÁÒØ Ö ÓÑÔ Ø Ð ØÝ Ò ÓÑÔÓ Ø ÓÒº Ð Ö º Ì ÓÑ Å ÖÓ ÐÐ ÄÙ Ð ÖÓ Äº Ë ÐÚ Ü Ð Ä Ý Î Û Ò Ø Ê Ñ Ò Èº Ê ÓÝ Ì ÛÓÖ Û Ô ÖØ ÐÐÝ ÙÔÔÓÖØ Ý Ê Ö ÒØ ¾º ¼º¼¾ ØØÔ»»ÛÛÛºÙÐ º
Computing optimal linear layouts of trees in linear time
Computing optimal linear layouts of trees in linear time Konstantin Skodinis University of Passau, 94030 Passau, Germany, e-mail: skodinis@fmi.uni-passau.de Abstract. We present a linear time algorithm
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.
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
SYNTHESIS, a Tool for Synthesizing Correct and Protocol-Enhanced Adaptors
SYNTHESIS, a Tool for Synthesizing Correct and Protocol-Enhanced Adaptors Massimo Tivoli Marco Autili University of L Aquila Dip. Informatica via Vetoio 1, 67100 L Aquila {tivoli,marco.autili}@di.univaq.it
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
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
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
PHANTOM TYPES AND SUBTYPING
PHANTOM TYPES AND SUBTYPING Matthew Fluet and Riccardo Pucella Department of Computer Science Cornell University ßfluet,riccardoÐ@cs.cornell.edu Abstract We investigate a technique from the literature,
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) ±ÆÁ Ú ÜÇÌ Ò Ð Å Ð ½ ¾ ÜÜ Ä ³ Ü Æ Ü Æ ¾ Ñ Ä
AGATA at GSI Mechanics 23/11/2010. John Strachan
AGATA at GSI Mechanics 23/11/2010 John Strachan 1 Structure Beam Geometry AGATA doubles Target Types AGATA main structure HECTOR Detectors Overall layout at GSI/cabling Timescales 2 Beam Geometry 1.5 opening
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
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
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
Virtual Stationary Automata for Mobile Networks
1 Virtual Stationary Automata for Mobile Networks Shlomi Dolev, Seth Gilbert, Ý Limor Lahiani, Nancy Lynch, Ý Tina Nolte Ý Abstract We define a programming abstraction for mobile networks called the Virtual
Step 0 How to begin and what you need to do before you start?
Written and cooked by Janusz R. Getta, School of Computing and Information Technology, University of Wollongong Building 3, room 2120, ext 4339, jrg@uow.edu.au, http://www.uow.edu.au/ jrg ËÁ̽½ Ø Å Ò Ñ
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,
An Object-Oriented Metamodel for Bunge-Wand-Weber Ontology
An Object-Oriented Metamodel for Bunge-Wand-Weber Ontology Arvind W. Kiwelekar, Rushikesh K. Joshi Department of Computer Science and Engineering Indian Institute of Technology Bombay Powai, Mumbai-400
The Object Contraint Language by Example
Formal Specification of Software The Object Contraint Language by Example Bernhard Beckert UNIVERSITÄT KOBLENZ-LANDAU B. Beckert: Formal Specification of Software p.1 The Classifier Context inv ( c :)?
Unified Configuration Knowledge Representation Using Weight Constraint Rules
Unified Configuration Knowledge Representation Using Weight Constraint Rules Timo Soininen ½ and Ilkka Niemelä ¾ and Juha Tiihonen ½ and Reijo Sulonen ½ Abstract. In this paper we present an approach to
1 Swing 2006A 5 B? 18. Swing Sun Microsystems AWT. 3.1 JFrame JFrame GHI
' þ ³ š ³ œ ³ 2006 1 Swing! " # &%' ()+-,./0 1 2 45-6 &8% 9 : ; < = >@? 2006A 5 B? 18 C@D E F : G HJILK-M!NPO-Q R S-I!T R!U V-W X Y!Z[N GUI\ ] ^ O-Q R S _a` b-w!c dje!f g Swing Wh i Z j k l m n N VisualEditor
CMPT 470 Based on lecture notes by Woshun Luk
* ) ( & 2XWOLQH &RPSRQHQ 2EMHF 0RGXOHV CMPT 470 ased on lecture notes by Woshun Luk What is a DLL? What is a COM object? Linking two COM objects Client-Server relationships between two COM objects COM
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
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
A Hybrid Multicast Scheduling Algorithm for Single-Hop WDM Networks
A Hybrid Multicast Scheduling Algorithm for Single-Hop WDM Networks Hwa-Chun Lin and Chun-Hsin Wang Abstract This paper shows that, for single-hop WDM networks, a multicast scheduling algorithm which always
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
Review: Test-and-set spinlock
p. 1/3 Review: Test-and-set spinlock struct var { int lock; int val; ; void atomic_inc (var *v) { while (test_and_set (&v->lock)) ; v->val++; v->lock = 0; void atomic_dec (var *v) { while (test_and_set
Towards service-oriented continuous queries in pervasive systems
Towards service-oriented continuous queries in pervasive systems Yann Gripay * Frédérique Laforest * Jean-Marc Petit * * Université de Lyon, INSA-Lyon, LIRIS UMR 5205 CNRS 7 avenue Jean Capelle, F-69621
Intelligence Analysis Using Quantitative Preferences
Intelligence Analysis Using Quantitative Preferences Davy Van Nieuwenborgh, Stijn Heymans, and Dirk Vermeir Dept. of Computer Science Vrije Universiteit Brussel, VUB Pleinlaan 2, B1050 Brussels, Belgium
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
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
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
Event List Management In Distributed Simulation
Event List Management In Distributed Simulation Jörgen Dahl ½, Malolan Chetlur ¾, and Philip A Wilsey ½ ½ Experimental Computing Laboratory, Dept of ECECS, PO Box 20030, Cincinnati, OH 522 0030, philipwilsey@ieeeorg
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
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
º
ý ý ¾¼¼ º ý º º º ººº º º º ýº ýº º ý º ý ¾¼¼ ¾¼¼ È ÒÓ À Ð Ö º ÐÐ Ö Ø Ö ÖÚ º º º º º ¹ º ¹ ¹ µ µ º ý ¹ µº ý º ¹ º ÓÒÐ Ò µ ¹ ¹ º ý ¹ º ¹ ½ i i 1 º ô µº ¹ ¹ º º ØÖ Øº Ï ØÙ Ý Ú Ö Ð Ú ÖØ Ü ÓÐÓÖ Ò ÔÖÓ Ð Ñ ÓÖ
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
Mechanical Verification of Transaction Processing Systems
Mechanical Verification of Transaction Processing Systems Dmitri Chkliaev Ý Jozef Hooman Þ Ý Dept. of Computing Science Eindhoven University of Technology The Netherlands e-mail: dmitri,wsstok @win.tue.nl
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
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
Online Aggregation over Trees
Online Aggregation over Trees C. Greg Plaxton, Mitul Tiwari University of Texas at Austin Praveen Yalagandula HP Labs Abstract Consider a distributed network with nodes arranged in a tree, and each node
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! " # $ " $ % & ' ( ) * +,
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
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
Step 0 How to begin and what you need to do before you start?
Written and cooked by Janusz R. Getta, School of Computing and Information Technology, University of Wollongong Building 3, room 2120, ext 4339, jrg@uow.edu.au, http://www.uow.edu.au/ jrg ËÁ̽½ Ø Å Ò Ñ
Maximizing Sharing of Protected Information 1
Maximizing Sharing of Protected Information 1 Steven Dawson ½, Sabrina De Capitani di Vimercati ¾, Patrick Lincoln ½, Pierangela Samarati (1) SRI International, Menlo Park, CA 94025, USA (2) Dipartimento
THE XML QUERY EXECUTION ENGINE (XEE)
THE XML QUERY EXECUTION ENGINE (XEE) Dieter Scheffner Humboldt-Universität zu Berlin, Dept of Computer Science, 199 Berlin, Germany scheffne@dbis.informatik.hu-berlin.de Johann-Christoph Freytag Humboldt-Universität
Hierarchical Framework for Shape Correspondence
Numer. Math. Theor. Meth. Appl. Vol. 6, No. 1, pp. 245-261 doi: 10.4208/nmtma.2013.mssvm13 February 2013 Hierarchical Framework for Shape Correspondence Dan Raviv, Anastasia Dubrovina and Ron Kimmel Technion,
Database Languages and their Compilers
Database Languages and their Compilers Prof. Dr. Torsten Grust Database Systems Research Group U Tübingen Winter 2010 2010 T. Grust Database Languages and their Compilers 4 Query Normalization Finally,
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
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
Exponentiated Gradient Algorithms for Large-margin Structured Classification
Exponentiated Gradient Algorithms for Large-margin Structured Classification Peter L. Bartlett U.C.Berkeley bartlett@stat.berkeley.edu Ben Taskar Stanford University btaskar@cs.stanford.edu Michael Collins
Extending Conceptual Logic Programs with Arbitrary Rules
Extending Conceptual Logic Programs with Arbitrary Rules Stijn Heymans, Davy Van Nieuwenborgh, and Dirk Vermeir Dept. of Computer Science Vrije Universiteit Brussel, VUB Pleinlaan 2, B1050 Brussels, Belgium
Reverse Engineering Assembler Code
Reverse Engineering Assembler Code Martin Ward martin@gkc.org.uk http://www.cse.dmu.ac.uk/ mward Software Technology Research Lab De Montfort University Leicester, UK Outline Program Transformation Theory
To provide state and district level PARCC assessment data for the administration of Grades 3-8 Math and English Language Arts.
200 West Baltimore Street Baltimore, MD 21201 410-767-0100 410-333-6442 TTY/TDD msde.maryland.gov TO: FROM: Members of the Maryland State Board of Education Jack R. Smith, Ph.D. DATE: December 8, 2015
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 :
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,
Structure and Complexity in Planning with Unary Operators
Structure and Complexity in Planning with Unary Operators Carmel Domshlak and Ronen I Brafman ½ Abstract In this paper we study the complexity of STRIPS planning when operators have a single effect In
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