11/20/01Giovanni Punzi Items for restart of run Unify.gcon and.ifit (gcon V3.0 (fcon?)) –Got more comments/did some format changes –Code written to produce.

Slides:



Advertisements
Similar presentations
Chapter 11 Introduction to Programming in C
Advertisements

Introduction to C Programming
Hash Tables and Sets Lecture 3. Sets A set is simply a collection of elements Unlike lists, elements are not ordered Very abstract, general concept with.
Symbol Table.
Part IV: Memory Management
Liang, Introduction to Java Programming, Ninth Edition, (c) 2013 Pearson Education, Inc. All rights reserved. 1 Chapter 9 Strings.
An Array-Based Algorithm for Simultaneous Multidimensional Aggregates By Yihong Zhao, Prasad M. Desphande and Jeffrey F. Naughton Presented by Kia Hall.
Error Control Code.
1/1/ / faculty of Electrical Engineering eindhoven university of technology Introduction Part 2: Data types and addressing modes dr.ir. A.C. Verschueren.
J. Linnemann, MSU 4/15/ Global L2 Outputs (and inputs) James T. Linnemann Michigan State University NIU Trigger Workshop October 17, 1997.
Query Execution, Concluded Zachary G. Ives University of Pennsylvania CIS 550 – Database & Information Systems November 18, 2003 Some slide content may.
Macro Processor.
1 Simulation Status/Plans Malcolm Ellis Sci Fi Tracker Meeting Imperial College, 10 th September 2004.
Standalone VeloPix Simulation Jianchun Wang 4/30/10.
By Hrishikesh Gadre Session II Department of Mechanical Engineering Louisiana State University Engineering Equation Solver Tutorials.
Chris Rogers, MICE CM16 Wednesday Plenary Progress in Cooling Channel Simulation.
Computer Science 1620 Programming & Problem Solving.
Chapter 6 C Arrays Acknowledgment The notes are adapted from those provided by Deitel & Associates, Inc. and Pearson Education Inc. Arrays are data structures.
SIMULINK Dr. Samir Al-Amer. SIMULINK SIMULINK is a power simulation program that comes with MATLAB Used to simulate wide range of dynamical systems To.
Status of FTK simulation June 16,2005 G. Punzi, Pisa.
Improved results for a memory allocation problem Rob van Stee University of Karlsruhe Germany Leah Epstein University of Haifa Israel WADS 2007 WAOA 2007.
Cryptography and Network Security
Preparing Data for Analysis and Analyzing Spatial Data/ Geoprocessing Class 11 GISG 110.
Process Flowsheet Generation & Design Through a Group Contribution Approach Lo ï c d ’ Anterroches CAPEC Friday Morning Seminar, Spring 2005.
Introduction to Python
1 EMT 101 – Engineering Programming Dr. Farzad Ismail School of Aerospace Engineering Universiti Sains Malaysia Nibong Tebal Pulau Pinang Week 1.
NUMBER REPRESENTATION CHAPTER 3 – part 3. ONE’S COMPLEMENT REPRESENTATION CHAPTER 3 – part 3.
1 CSC 221: Introduction to Programming Fall 2012 Functions & Modules  standard modules: math, random  Python documentation, help  user-defined functions,
Unit III : Introduction To Data Structures and Analysis Of Algorithm 10/8/ Objective : 1.To understand primitive storage structures and types 2.To.
21 st International Unicode Conference Dublin, Ireland, May Folded Trie: Efficient Data Structure for All of Unicode Vladimir Weinstein
Summary of what we learned yesterday Basics of C++ Format of a program Syntax of literals, keywords, symbols, variables Simple data types and arithmetic.
CS 320 Assignment 1 Rewriting the MISC Osystem class to support loading machine language programs at addresses other than 0 1.
1 Compiler Construction (CS-636) Muhammad Bilal Bashir UIIT, Rawalpindi.
The european ITM Task Force data structure F. Imbeaux.
MIMO continued and Error Correction Code. 2 by 2 MIMO Now consider we have two transmitting antennas and two receiving antennas. A simple scheme called.
LAV Software Status Emanuele Leonardi – Tommaso Spadaro Photon Veto WG meeting – 2015/03/24.
Software Status  Last Software Workshop u Held at Fermilab just before Christmas. u Completed reconstruction testing: s MICE trackers and KEK tracker.
Access 2007 ® Use Databases How can Microsoft Access 2007 help you structure your database?
240-Current Research Easily Extensible Systems, Octave, Input Formats, SOA.
Svtsim status Bill Ashmanskas, CDF simulation meeting, Main authors: Ashmanskas, Belforte, Cerri, Nakaya, Punzi Design goals/features: –main.
17-Aug-00 L.RistoriCDF Trigger Workshop1 SVT: current hardware status CRNowFinal Hit Finders64242 Mergers31616 Sequencers2312 AMboards4624 Hit Buffers21212.
AMB HW LOW LEVEL SIMULATION VS HW OUTPUT G. Volpi, INFN Pisa.
Chapter 3 Syntax, Errors, and Debugging Fundamentals of Java.
ECSE Software Engineering 1I HO 4 © HY 2012 Lecture 4 Formal Methods A Library System Specification (Continued) From Specification to Design.
7 May 2009Paul Dauncey1 Tracker alignment issues Paul Dauncey.
Copyright © Curt Hill Formatting Reals Outputs other than normal.
Microsoft Access Database Creation and Management.
Arrays. The array data structure Array is a collection of elements, that have the same data type Integers (int) Floating point numbers (float, double)
The Instruction Set Architecture. Hardware – Software boundary Java Program C Program Ada Program Compiler Instruction Set Architecture Microcode Hardware.
Encoding How is information represented?. Way of looking at techniques Data Medium Digital Analog Digital Analog NRZ Manchester Differential Manchester.
ICOM 4035 – Data Structures Dr. Manuel Rodríguez Martínez Electrical and Computer Engineering Department Lecture 2 – August 23, 2001.
Silberschatz, Galvin and Gagne ©2011 Operating System Concepts Essentials – 8 th Edition Chapter 2: The Linux System Part 2.
CMSC 2021 Software Development. CMSC 2022 Software Development Life Cycle Five phases: –Analysis –Design –Implementation –Testing –Maintenance.
C Programming Day 2. 2 Copyright © 2005, Infosys Technologies Ltd ER/CORP/CRS/LA07/003 Version No. 1.0 Union –mechanism to create user defined data types.
Software Update Takashi HACHIYA RIKEN 2012/2/10RIKEN VTX software meeting1.
Coupling and Cohesion Schach, S, R. Object-Oriented and Classical Software Engineering. McGraw-Hill, 2002.
+ Note On the Use of Different Data Types Use the data type that conserves memory and still accomplishes the desired purpose. For example, depending on.
SVT 4/5 operation CDF meeting 1/16/2003 G. Punzi for the SVT group.
Maitrayee Mukerji. INPUT MEMORY PROCESS OUTPUT DATA INFO.
11 Sep 2007Tracking - Paul Dauncey1 Tracking Code Paul Dauncey, Imperial College London.
Introduction toData structures and Algorithms
Chapter 9: Value-Returning Functions
User-Written Functions
Objectives Identify the built-in data types in C++
HPS Collaboration meeting, JLAB, Nov 16, 2016
Chapter 11 Introduction to Programming in C
Chapter 11 Introduction to Programming in C
CH 9.2 : Hash Tables Acknowledgement: These slides are adapted from slides provided with Data Structures and Algorithms in C++, Goodrich, Tamassia and.
Summary of what we learned yesterday
Wendy Taylor STT Meeting Fermilab September 28, 2001
Presentation transcript:

11/20/01Giovanni Punzi Items for restart of run Unify.gcon and.ifit (gcon V3.0 (fcon?)) –Got more comments/did some format changes –Code written to produce it & convert existing files –0123X_wide.gcon available in new format in cvs –Need to modify mapset format –Cold-start (and all rest) needs to read new format  Integrate slightly modified gconconv inside coldstart More compact pattern files (simple, but not yet) DataBase it ! ? Support for nonlinearity correction –Hooks provided in new gcon –Implement after approval. Mixed-layers support –gcon/patt generation already available New: improve constants by orthogonalization

11/20/01Giovanni Punzi Requirements for new fit constant file: –wedge-oriented, allows to specify up to the 150 constants sets. –allow multiple layer combinations in the same wedge –allow mix&match of different layers in the same file without having to worry about shifts –must be readable and easily interpreted –avoid elements that are too specifically related to details in the TF structure – trasformation from this file to the memory content must be unique (=> no FP) – allows svtsim/svtmon to know the units of what is stored in SVTD.  Remove magic numbers inside code Extra features: –Contains just the right amount of information for each constants: units chosen make exact integers sufficient for the required precision –Allows to see easily where precision is lost

11/20/01Giovanni Punzi // //There is one file per SVT wedge (1/72). Each file can contain several blocks, //one for every supported layer combination (and possibly longhit mask). //EACH block has the format that follows (yes, even the version number is replicated): // Version 3.0 //NPARFIT(always 3, for future expansion) ! Zin, Long cluster info - input in the TF table 013F ! List of *physical* layer numbers (see Their number is referred to as NLAYERS below. // List of NLAYERS step sizes (floats). step1 step2 step3... // List of the widths of bit-fields for each layer w1 w2 w3... // // To convert the input x from CDF units to the units used by the constants stored below // one needs to do: x/(step*2^w). That is, the gcon are in units of total widths of input x, // and specified steps for the output // // 1*(float) + NLAYERS*(int) + 1*(int). Each step converts the output parameter into CDF units cstep Vc Cc dstep Vd Cd fstep Vf Cf //kernel: 1*float+NLAYERS*(int)+1*(int) k0step kern0 kav0 k1step kern1 kav1 k2step kern2 kav2 //This final constant is the conversion factor to get an actual chi-square. chi2step

11/20/01Giovanni Punzi Version 3! File format version number //NPAR 3 //Zin, longhit_mask 0 00 //Layers 1234F e e e e e e e e e //Kernel 5.000e e e e+00 Version 3! NEW BLOCK STARTS HERE //NPAR 3 //Zin, longhit_mask 0 01 //Layers 1235F ……

11/20/01Giovanni Punzi Orthogonalization The parameters and the constraints often come out coupled. Can be tracked down to the “Bayesian character” of the parameter linearization procedure. Can remove by orthogonalizing  Better resolution.  Remove nonlinearity from cross-talk.  Stability/convergence

11/20/01Giovanni Punzi Version 3! File format version number //NPAR 3 //Zin, longhit_mask 0 00 //Layers 1234F e e e e e e e e e //Kernel 5.000e e e e+00 Version 3! File format version number //NPAR 3 //Zin, longhit_mask 0 00 //Layers 1234F e e e e e e e e e //Kernel 5.000e e e e+00 Effect of orthogonalization

11/20/01Giovanni Punzi Things to understand (list from last time) Efficiency (wide vs. narrow patterns ?) Lots of progress (not from myself) –Fixes ? Some small strange effects remaining Coupling between parameters and  2 –Solved by orthogonalization Timing/TF combinatoric: are ‘narrow roads’ narrow enough for 20kHz rate ? –Anybody looking at this ? Give up barrel-crossers ? (mech. only ?) –Let’s vote ! Start looking towards 4/5 –Can accommodate all constants in `fcon’ SVT-Offline parameters match well; still want to cross-check gcon/patt gen. simple model to full simulation for small biases.

11/20/01Giovanni Punzi Plan for startup Start over with 0123x_wide (new format) Go to orthogonalized constants Find beam position - make new gcon and patterns (~ 1 day) Reduce residual beam tilt If beam offset > 1mm, add nonlinearity corrections Add internal corrections to gain extra ~micron and narrow  2