1 / 11

LEGO: A Modular Approach to Accelerator Alignment Data Analysis

This work by Catherine Le Cocq discusses a modular framework for data analysis and alignment in accelerator systems. It highlights key aspects including maintainability, portability, and scalability of data structures used in accelerator alignment processes. By employing a system-independent and input/output-independent approach, the study showcases innovative methods, strengths, and weaknesses related to the management of various observation types and resolution techniques. Future directions include integration with advanced imaging and new data formats.

taji
Télécharger la présentation

LEGO: A Modular Approach to Accelerator Alignment Data Analysis

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. LEGO: A Modular Approach to Accelerator Alignment Data Analysis Catherine Le Cocq Stanford Linear Accelerator Center, Stanford University, Stanford, CA, USA

  2. You wrote a bundle? • Maintainability • modular approach • input/output independent • Portability • system independent • scalability • Expandability • observation types • resolution techniques Catherine Le Cocq IWAA97

  3. Description Catherine Le Cocq IWAA97

  4. typedef struct { int typ; char nam[9]; int sel; double x[8], sx[8]; int d[8]; int ilump; int iprimary; } edit_sta; typedef struct { char nam[9]; int sel; double x[3], sx[3]; int d[3]; int ilump; int iprimary; } edit_tar; typedef struct { int sel; char nam1[9]; double h1; char nam2[9]; double h2; double val, sval; int itime; } edit_mes; typedef struct { int typ; double r; double xO[3]; double hO; } model; Input Stage: Data Format Catherine Le Cocq IWAA97

  5. Competitive Analysis • Strengths • data protection • portability • expandability • blunder detection • unusual features • Weaknesses • memory size • limited earth model Catherine Le Cocq IWAA97

  6. Real Life Examples Catherine Le Cocq IWAA97

  7. How long for 1 iteration? Catherine Le Cocq IWAA97

  8. Future Directions • Photogrammetry • thorough testing • integration with image acquisition • New types of observations • point transfer • coordinates differences • New integrations Catherine Le Cocq IWAA97

  9. Acknowledgments • Cary Salsberg • Mike Gaydosh • Robert Ruland • and the whole gang... FOR MORE INFO... lecocq@slac.stanford.edu Catherine Le Cocq IWAA97

  10. SIMS: Plan View Catherine Le Cocq IWAA97

  11. typedef struct { char namept[9]; int typ; double xpt[3], x0[3], sxpt[3]; double h; int n0[3]; double xex[5], e0[5], sxex[5]; int n1[5]; int defdatum[8]; int ntie; int ilump; double major[3], minor[3], phi[3]; } stru_pt; typedef struct { int typ; stru_pt *pt1, *pt2; double hpt1, hpt2; double val, sval; double res, sres; int itime; } measure; typedef struct { int indx, ntime, tref; int *n1, *epoch; double *t1, *t2, *t3; double *r1, *r2, *r3; double *m, *sm; double *st1, *st2, *st3; double *sr1, *sr2, *sr3; } lump; Lego Stage: Data Format Catherine Le Cocq IWAA97

More Related