Why? The classical inverse ECG problem. The Bidomain model. Outside the heart
|
|
- Daniel Ford
- 6 years ago
- Views:
Transcription
1 Ú Á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 ECG recordings Better qualitative and quantitative understanding of the heart Detect diseases and malfunctions... H T H T ½» The Bidomain model H T Outside the heart In Ì (torso): H T Ö ÅÖÙµ ¼ in Ì Ò ¼ along Ì ÅÖÙµ (Not a closed problem!) Ö Å ÖÚµ Ö Å Å µöù µ ¼ Ö Å ÖÙ ¼ in Ì in À in À H H T T Á ÓÒ :ioniccurrent Å Å :conductivitytensors Ú Ù Ù :membranepotential»
2 »» ECG (electrocardiogram) ECGrecording صalong Ì Ø Ø Focusononetimeinstance, Ø µ Briefly about the time dependent problem Outside the heart ECG Ì In (torso): ÅÖÙµ ¼ in Ì Ö Ò ¼ along Ì ÅÖÙµ ECGrecordingof Ì Ùalong H T Ù ÐÓÒ À H T» The Challenge, cont. Operator Ê µ Ù µ,where Ù Ù µsolves Properties Solve ÅÖÙµ ¼ in Ì Ö Ò ¼ along Ì ÅÖÙµ along À Ù Find suchthat for. Êisalinearoperator () is ill-posed ¾ ÊÒ Êµ If Ê µ ½µ Ê µ where isthedatafromtheecgrecording ÑÒ Ê µ ¾»
3 ½¼» ½¾» This lecture Fourier analysis on the unit square, stationary The general case, stationary The time dependent problem Numerical results Fourier analysis Unit square y u=g? δn δu = u = δu δn = δu δn = x u=d» Fourier analysis Unit square y The direct problem Find Ù Ù µsatisfying δh Ù ¼ in Ì ÖÙ Ò ¼ along Ì Ù along À δt x Γ ½½»
4 Ù µ Ü Ýµ Ù Ü Ýµ ½ ¼ Ô Ó Üµ ½ ½ ¼ Ó Üµ Ó Ýµ ½ ¼ Ô Ó Üµ ½» ½» The direct problem, cont. Separation of variables: The direct problem, cont. Linearity: ¼ ½ Æ Ü Ýµ Ó Üµ Ó Ýµ satisfies Ù Ü Ýµ ½ where areconstants,satisfies Ù ¼ in Ì Ù ¼ in Ì ÖÙ Ò ¼ along Ì ÖÙ Ò ¼ along Ì ½» The direct problem, cont. Fouriercosineseriesof : The direct problem, cont. Ê:heartsurface bodysurface Ê µ Ê Üµ Ù µ Ü ¼µ Solution formula for the direct problem Ô Ó Üµ Ó µ ¼ Ô Ó Üµ Ó Ýµ Ó µ ¼ ½»
5 ½ Ô Ó µ Ô ¼ Ô Ó Üµ ½ Ê Ó Üµµ ½» ¾¼» The direct problem, cont. Fouriercoeff.: Ô The direct problem, cont. δ= δ=.5 Large u u Ô Ó µ strong damping effect Ê has a strong smoothing effect y x y x.4.2 δ= δ= u 2 3 u y x y x.4.2 ½» The inverse problem Ê:heartsurface bodysurface ForagivenECGrecording,find suchthat The inverse problem, cont Consequently ½ Ó Üµ Ó µ Recall that Eigenvalues Ê µ ½ Ô Ó Üµ Ó µ ½ ¾ Ó µ Ê Zeroisaclusterpointfor Ênotcontinuouslyinvertible, Ê ½ not well-behaved ¼ ½»
6 ½ ¼ Ó Üµ ¼ Ó Üµ Ê ½ Æ µ Ê ½ µ Ä ½ Ç ½¼ µ ½ ¼ Ó µ Ó Üµ ½ Ê and ½ Ê ½ ¾ Ê ½ Ê ¾¾» The inverse problem, cont. Fourier expansion The inverse problem, cont. Consequently ܵ Ê ½ ܵµ Ê ½ ½ ¼ Ó Üµ ܵ Ê µ CanEasysolve ½ for ¼ Ô Ó Üµ: È yields ¼ Ô Ó µ for ¼ ½ Fouriercoeff.: Ó µ Evenforsmall, Ó µislarge,e.g. Ó µ ¾ ½¼ Ê µ ½ Ô Ó Üµ Ó µ ½ ¾½» Example Exactdata, ܵ Ó ½ µ Ó Üµ Error-pronedata, ܵ Æ Ó Üµ Æ Üµ Then Regularization Output least squares, minimize Ê µ ¾ Ä ¾ µ  µ Tikhonov regularization Ê ½ Æ µ Ê ½ µ ¾ ½¼ Æ Ó Üµ Forexample, Æ Ä ½ Ç ½¼ µimpliesthat  µ Ê µ ¾ Ä ¾ µ ¾ Ä ¾ Àµ Second order Tikhonov regularization ¾ µ Ê µ ¾ Ä ¾ µ ÜÜ ¾ Ä ¾ Àµ  Approximations (derivedfrom Ö ¼and Ö ¾ ¼) ¾» ¾»
7 ½ Ê ½ ¾ Ê ½ ¼ Ó Üµ ½ ¼ Ó Üµ ½ ½ ¼ Ó µ Ó Üµ ½ Ó ¾ µ Ó Üµ Ƶ Ê ½ µ Ê ½ Æ µ ¾ Ä ¾ Àµ ¾» ¾» Regularization, cont. Ê:heartsurface bodysurface No regularization ½ ½ Ó Üµ Ê ¼ ½ Regularization, cont. Forthelowfrequencycomponentsofthedata,the actionof Ê, and isalmostidentical, ½ Ê ½ ½ Ê ¾ providedthat issmall Thehighfrequencycomponentsof aredamped efficientlyby and ½ Ê ½ ¾ Ê Tikhonov Ó µ ¼ Second order Tikhonov Ó µ ½ µ Ó ¾ µ Ó Üµ ¾» ¼ Example, revisited Exactdata, ܵ Ó ½ µ Ó Üµ Error-pronedata, ܵ Æ Ó Üµ Æ Üµ Tikhonov, error Example, revisited - cont. errorontheheartsurface Ä No ¾ regularization ¾ ½¼ Æ Æµ Tikhonov(optimal regularization) 4 x 5 3 δ= δ= 2 δ= 3 Ƶ ¼ ½¼ Æ Second order Tikhonov(optimal regularization) 2 ¾ Ƶ ½¼ Æ 2 x 5 ¾»
8 ¼» ¾» Example, revisited - cont. Second order works better than plain Tikhonov regularization Ingeneral,difficulttofindanoptimalvalueforthe regularization parameter The general case Ê:heartsurface (partofthe)bodysurface Complex geometry Non-constant Å conductivity Fourier analysis impossible H T H T ¾» The general case, cont. Operator Ê µ Ù µ,where Ù Ù µsolves Linearity Êisalinearoperator: Ò ¼ along Ì ÅÖÙµ along À Ù and À. Find suchthat Ê ½ ½ ¾ ¾ µ ½ Ê ½ µ ¾ Ê ¾ µ foranyscalars ½ and ¾ andfunctions ½ and ¾ defined on À. We will use this fact to discretize our inverse problem Ö ÅÖÙµ ¼ in Ì Ê µ ½»
9 ¾ ÊÒ Ê Ò µ Ê Ò Ê Î Ò ÑÒ Ê Ò µ ¾ Ä ¾ µ ¾ÎÒ Ò Ê Ò µ ¾ Ä ¾ µ ¾ Ä ¾ Àµ Ó ÑÒ ¾ÎÒ Ê Ò µ Ò Ò Ê Ò µ ¾ Ä ¾ µ ¾ Ä ¾ Àµ Ò»» Discretization Linearly independent functions Discretization, cont. ¾ Î Ò : ½ Ò À ÁÊ and where Ô arescalars. Consequently, if ½ Ô for ½ Ò Î Ò ÔÒ ½ Ò Ê Ò µ Ö Ê thenthelinearityof Ò impliesthat Ô Ö ½» Discretization, cont. Original problem Discretization, cont. È Ò ½ Ô,thus Ê Ò µ  µ Â Ô ½ Ô Ò µ Tikhonov where ½ Ö Ê Ò µ Ô Ö ¾ Ä ¾ µ Ò ½ for ½ Ò Ô ¾ Ä ¾ Àµ»
10 Ò» ¼» Discretization, cont. The condition Discretization, cont. Whichmaybewrittenontheform  ¼ Ô givesthe Ò Òsystem for ½ Ò where Ô Ö Ö Ü Ü Ô for ½ Ò ¾ Ê Ò Ò Ö Ö Ü À Ü Ö Ü Ô Ô ½ Ô Ò µ Ì ¾ Ê Ò À ½ Ö ½ Ü Ö Ò Ü Ì ¾ Ê Ò» An algorithm a) Pick Ò linearly independent functions An algorithm, cont. d)computethematrix e)computetherighthandside definedatthesurface Àoftheheart À b)for ½ Ò,set inthedirectproblemand solveitfor Ù Ù µ c) Compute f)solvethelinearsystem Ô for Ô g)computethepotential attheheartsurfaceby Ò ½ Ô ½ Ò À ÁÊ Ö Ù µ ½ Ò For each newobservation, onlysteps e)-g) have to be carried out.(important for the time dependent problem)»
11 SecondorderTikhonov, ½¼ ¾»» Example 2 Example 2, cont. Tikhonov, ½¼ s at the heart surface cm Estimated s at the torso surface Computed s at the heart surface Estimated Epicardial node number s at the torso surface Computed Body surface node number Epicardial node number Body surface node number ½» Example 2, cont. SecondorderTikhonov, ½±noise, ½ The time dependent problem Timeinstances Ø ¼ Ø Å withdata s at the heart surface Estimated s at the torso surface Computed ¼ Å ¾ Ä ¾ µ defined at the body surface Compute the corresponding potentials at the heart surface 2 4 ¼ Å Epicardial node number Body surface node number Brute force: Solve Ô for ¼ Å»
12 ÑÒ Ê Ò µ ¾ Ä ¾ µ ¾ÎÒ ÑÒ Ê Ò µ ¾ Ä ¾ µ ¾ÎÒ ÑÒ Ê Ò µ ¾ Ä ¾ µ ¾ÎÒ ½ ¾ Ä ¾ Àµ ½ ¾ Ä ¾ Àµ À ¾ Ä ¾ À ¼¼½ ÑÒ Ê Ò µ ¾ Ä ¾ µ ¾ÎÒ»» The time dependent problem, cont. Ensure that the change in the epicardial potential is smallfromonetimesteptothenext Example 3 ½ ¾ Ä ¾ Àµ 3 s at the heart surface Estimated ½ Å for Hybrid scheme À ÙÖÐ À ÙÖÐ À -Laplace-Beltrami ( operator) More advanced schemes(f. Greensite) Epicardial node number» Example 3, cont. ¼¼½and ½ s at the heart surface Epicardial node number ½ ¾ Ä ¾ Àµ À ¾ Ä ¾ Àµ Estimated Summary Aim: To compute the potential at the heart surface from body surface measurements(ecgs) Leadstoalinearproblem Ê µ Ill-posed From a mathematical point of view, fairly simple Second order Tikhonov regularization works well Main practical problems: Noisy ECG data High quality geometrical models of the body required»
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 informationProbabilistic 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 informationA General Greedy Approximation Algorithm with Applications
A General Greedy Approximation Algorithm with Applications Tong Zhang IBM T.J. Watson Research Center Yorktown Heights, NY 10598 tzhang@watson.ibm.com Abstract Greedy approximation algorithms have been
More informationScan 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 informationSFU 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 informationApproximation by NURBS curves with free knots
Approximation by NURBS curves with free knots M Randrianarivony G Brunnett Technical University of Chemnitz, Faculty of Computer Science Computer Graphics and Visualization Straße der Nationen 6, 97 Chemnitz,
More informationEfficiency 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 informationRSA (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 informationModels, Notation, Goals
Scope Ë ÕÙ Ò Ð Ò ÐÝ Ó ÝÒ Ñ ÑÓ Ð Ü Ô Ö Ñ Ö ² Ñ ¹Ú ÖÝ Ò Ú Ö Ð Ö ÒÙÑ Ö Ð ÔÓ Ö ÓÖ ÔÔÖÓÜ Ñ ÓÒ ß À ÓÖ Ð Ô Ö Ô Ú ß Ë ÑÙÐ ÓÒ Ñ Ó ß ËÑÓÓ Ò ² Ö Ò Ö Ò Ô Ö Ñ Ö ÑÔÐ ß Ã ÖÒ Ð Ñ Ó ÚÓÐÙ ÓÒ Ñ Ó ÓÑ Ò Ô Ö Ð Ð Ö Ò Ð ÓÖ Ñ
More informationGraphs (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 informationRSA (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 informationBanner 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 informationLecture 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 informationA 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 informationOptimal Static Range Reporting in One Dimension
of Optimal Static Range Reporting in One Dimension Stephen Alstrup Gerth Stølting Brodal Theis Rauhe ITU Technical Report Series 2000-3 ISSN 1600 6100 November 2000 Copyright c 2000, Stephen Alstrup Gerth
More informationRelating Strands and Multiset Rewriting for Security Protocol Analysis Revised Extended Abstract Ý
Relating Strands and Multiset Rewriting for Security Protocol Analysis Revised Extended Abstract Ý I. Cervesato ITT Industries iliano@itd.nrl.navy.mil N. Durgin, J. Mitchell Stanford University nad, jcm@cs.stanford.edu
More informationThe Online Median Problem
The Online Median Problem Ramgopal R. Mettu C. Greg Plaxton November 1999 Abstract We introduce a natural variant of the (metric uncapacitated) -median problem that we call the online median problem. Whereas
More informationTurbulence 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 informationA Computational Analysis of the Needham-Schröeder-(Lowe) Protocol
A Computational Analysis of the Needham-Schröeder-(Lowe) Protocol BOGDAN WARINSCHI Department of Computer Science and Engineering, University of California, San Diego 9500 Gilman Drive, CA 92093 bogdan@cs.ucsd.edu
More informationFrom Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols Christian Scheideler Ý Berthold Vöcking Þ Abstract We investigate how static store-and-forward routing algorithms
More informationAppendix 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 informationA 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 informationOn 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 informationLocality Preserving Projections (LPP) Abstract
Locality Preserving Projections (LPP) Xiaofei He Partha Niyogi Computer Science Department Computer Science Department The University of Chicago The University of Chicago Chicago, IL 60615 Chicago, IL
More informationAdaptive techniques for spline collocation
Adaptive techniques for spline collocation Christina C. Christara and Kit Sun Ng Department of Computer Science University of Toronto Toronto, Ontario M5S 3G4, Canada ccc,ngkit @cs.utoronto.ca July 18,
More informationAdaptive and Incremental Processing for Distance Join Queries
Adaptive and Incremental Processing for Distance Join Queries Hyoseop Shin Ý Bongki Moon Þ Sukho Lee Ý Ý Þ School of Computer Engineering Department of Computer Science Seoul National University University
More informationSFU 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 informationWavefront-based models for inverse electrocardiography. Alireza Ghodrati (Draeger Medical) Dana Brooks, Gilead Tadmor (Northeastern University)
Wavefront-based models for inverse electrocardiography Alireza Ghodrati (Draeger Medical) Dana Brooks, Gilead Tadmor (Northeastern University) Rob MacLeod (University of Utah) Inverse ECG Basics Problem
More informationComputing 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
More information124 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 informationDesigning 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 informationMonotonicity testing over general poset domains
Monotonicity testing over general poset domains [Extended Abstract] Eldar Fischer Technion Haifa, Israel eldar@cs.technion.ac.il Sofya Raskhodnikova Ý LCS, MIT Cambridge, MA 02139 sofya@mit.edu Eric Lehman
More informationOptimal Time Bounds for Approximate Clustering
Optimal Time Bounds for Approximate Clustering Ramgopal R. Mettu C. Greg Plaxton Department of Computer Science University of Texas at Austin Austin, TX 78712, U.S.A. ramgopal, plaxton@cs.utexas.edu Abstract
More informationExpander-based Constructions of Efficiently Decodable Codes
Expander-based Constructions of Efficiently Decodable Codes (Extended Abstract) Venkatesan Guruswami Piotr Indyk Abstract We present several novel constructions of codes which share the common thread of
More information³ ÁÒØÖÓÙØÓÒ ½º ÐÙ ØÖ ÜÔÒ ÓÒ Ò ÌÒ ÓÖ ÓÖ ¾º ÌÛÓ¹ÓÝ ÈÖÓÔÖØ Ó ÓÑÔÐÜ ÆÙÐ º ËÙÑÑÖÝ Ò ÓÒÐÙ ÓÒ º ² ± ÇÆÌÆÌË Åº ÐÚÓÐ ¾ Ëʼ
È Ò È Æ ÇÊÊÄÌÁÇÆË È ÅÁÍŹÏÁÀÌ ÆÍÄÁ ÁÆ Åº ÐÚÓÐ ÂÄ ÇØÓÖ ¾¼¼ ½ ³ ÁÒØÖÓÙØÓÒ ½º ÐÙ ØÖ ÜÔÒ ÓÒ Ò ÌÒ ÓÖ ÓÖ ¾º ÌÛÓ¹ÓÝ ÈÖÓÔÖØ Ó ÓÑÔÐÜ ÆÙÐ º ËÙÑÑÖÝ Ò ÓÒÐÙ ÓÒ º ² ± ÇÆÌÆÌË Åº ÐÚÓÐ ¾ Ëʼ À Ò Ò Ò ÛØ À Ç Òµ Ú Ò µ Ç Òµ
More informationTransformations Review
Transformations Review 1. Plot the original figure then graph the image of Rotate 90 counterclockwise about the origin. 2. Plot the original figure then graph the image of Translate 3 units left and 4
More informationA Hybrid Indexing Method for Approximate String Matching
A Hybrid Indexing Method for Approximate String Matching GONZALO NAVARRO 1, Dept. of Computer Science, University of Chile. Blanco Encalada 212, Santiago, Chile. gnavarro@dcc.uchile.cl RICARDO BAEZA-YATES
More informationOn 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 informationThe Tractability of Global Constraints
The Tractability of Global Constraints Christian Bessiere ½, Emmanuel Hebrard ¾, Brahim Hnich ¾, and Toby Walsh ¾ ¾ ½ LIRMM-CNRS, Montpelier, France. bessiere@lirmm.fr Cork Constraint Computation Center,
More informationResponse 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 informationTime-space tradeoff lower bounds for randomized computation of decision problems
Time-space tradeoff lower bounds for randomized computation of decision problems Paul Beame Ý Computer Science and Engineering University of Washington Seattle, WA 98195-2350 beame@cs.washington.edu Xiaodong
More informationA Proposal for the Implementation of a Parallel Watershed Algorithm
A Proposal for the Implementation of a Parallel Watershed Algorithm A. Meijster and J.B.T.M. Roerdink University of Groningen, Institute for Mathematics and Computing Science P.O. Box 800, 9700 AV Groningen,
More informationCalligraphic 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 informationPlanar graphs, negative weight edges, shortest paths, and near linear time
Planar graphs, negative weight edges, shortest paths, and near linear time Jittat Fakcharoenphol Satish Rao Ý Abstract In this paper, we present an Ç Ò ÐÓ Òµ time algorithm for finding shortest paths in
More informationGraph 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 informationMaximum Number of Users Which Can Be Served by TETRA Systems
Maximum Number of Users Which Can Be Served by TETRA Systems Martin Steppler Aachen University of Technology Communication Networks Prof. Dr.-Ing. Bernhard Walke Kopernikusstr. 16 D-52074 Aachen Germany
More informationPointers. 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 informationComputation of the multivariate Oja median
Metrika manuscript No. (will be inserted by the editor) Computation of the multivariate Oja median T. Ronkainen, H. Oja, P. Orponen University of Jyväskylä, Department of Mathematics and Statistics, Finland
More informationExponentiated 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
More informationComparing Data Compression in Web-based Animation Models using Kolmogorov Complexity
Comparing Data Compression in Web-based Animation Models using Kolmogorov Complexity Carlos A. P. Campani, Fernando Accorsi, Paulo Blauth Menezes and Luciana Porcher Nedel Abstract In the last few years,
More informationPersonal 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 informationOptimal Realizations of Floating-Point Implemented Digital Controllers with Finite Word Length Considerations
Optimal Realizations of Floating-Point Implemented Digital Controllers with Finite Word Length Considerations Jun Wu Ý, Sheng Chen Þ, James F. Whidborne Ü and Jian Chu Ý Ý Þ Ü National Key Laboratory of
More informationTime-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems
Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems Paul Beame Computer Science and Engineering University of Washington Seattle, WA 98195-2350 beame@cs.washington.edu
More informationTexture Mapping using Surface Flattening via Multi-Dimensional Scaling
Texture Mapping using Surface Flattening via Multi-Dimensional Scaling Gil Zigelman Ron Kimmel Department of Computer Science, Technion, Haifa 32000, Israel and Nahum Kiryati Department of Electrical Engineering
More informationLearning to Align Sequences: A Maximum-Margin Approach
Learning to Align Sequences: A Maximum-Margin Approach Thorsten Joachims Department of Computer Science Cornell University Ithaca, NY 14853 tj@cs.cornell.edu August 28, 2003 Abstract We propose a discriminative
More informationOn-line multiplication in real and complex base
On-line multiplication in real complex base Christiane Frougny LIAFA, CNRS UMR 7089 2 place Jussieu, 75251 Paris Cedex 05, France Université Paris 8 Christiane.Frougny@liafa.jussieu.fr Athasit Surarerks
More informationThe linear transformation X À Ä given by XÐBÑ œ EB is invertible À that is, there
What do we know about an invertible ( 8 8) matrix E? E is invertible Í E rref ÐEÑ œ M 8 X is invertible X À Ä (where XÐBÑ œ EB) is onto for every, in 8, EB œ, has at least " solution The columns of E span
More informationTo SMS Technical Guide
Email To SMS Technical Guide Table of Content 1 Document information 3 1.1 Purpose 3 1.2 Change history 3 1.3 Release notes 3 1.4 Contact 3 2 Introduction 4 2.1 Overview 4 2.2 Main features 4 2.3 Email
More informationExtending 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
More informationMesh Smoothing by Adaptive and Anisotropic Gaussian Filter Applied to Mesh Normals
Mesh Smoothing by Adaptive and Anisotropic Gaussian Filter Applied to Mesh Normals Yutaka Ohtake Alexander Belyaev Hans-Peter Seidel Computer Graphics Group, Max-Planck-Institut für Informatik Stuhlsatzenhausweg
More informationBayesian source separation with mixture of Gaussians prior for sources and Gaussian prior for mixture coefficients
Bayesian source separation with mixture of Gaussians prior for sources and Gaussian prior for mixture coefficients Hichem Snoussi and Ali Mohammad-Djafari Laboratoire des Signaux et Systèmes (LS), Supélec,
More informationCYCLIC DIRECTED FORMATIONS OF MULTI-AGENT SYSTEMS
CYCLIC DIRECTED FORMATIONS OF MULTI-AGENT SYSTEMS Paulo Tabuada George J. Pappas Pedro Lima Instituto de Sistemas e Robótica Department of EE Instituto Superior Técnico University of Pennsylvania 1049-001
More informationYou 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 informationConstructive floorplanning with a yield objective
Constructive floorplanning with a yield objective Rajnish Prasad and Israel Koren Department of Electrical and Computer Engineering University of Massachusetts, Amherst, MA 13 E-mail: rprasad,koren@ecs.umass.edu
More informationA Linear Dual-Space Approach to 3D Surface Reconstruction from Occluding Contours using Algebraic Surfaces
A Linear Dual-Space Approach to 3D Surface Reconstruction from Occluding Contours using Algebraic Surfaces Kongbin Kang Jean-Philippe Tarel Richard Fishman David Cooper Div. of Eng. LIVIC (INRETS-LCPC)
More informationMulti-currency Influence Diagrams
Søren Holbech Nielsen holbech@cs.aau.dk Multi-currency Influence Diagrams Thomas D. Nielsen tdn@cs.aau.dk Abstract Finn Verner Jensen fvj@cs.aau.dk When using the influence diagrams framework for solving
More informationMachine Learning for Signal Processing Lecture 4: Optimization
Machine Learning for Signal Processing Lecture 4: Optimization 13 Sep 2015 Instructor: Bhiksha Raj (slides largely by Najim Dehak, JHU) 11-755/18-797 1 Index 1. The problem of optimization 2. Direct optimization
More informationDatabase 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,
More informationLecture 5 Epipolar Geometry
Lecture 5 Epipolar Geometry Professor Silvio Savarese Computational Vision and Geometry Lab Silvio Savarese Lecture 5-24-Jan-18 Lecture 5 Epipolar Geometry Why is stereo useful? Epipolar constraints Essential
More information) $ 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 informationFuzzy Hamming Distance in a Content-Based Image Retrieval System
Fuzzy Hamming Distance in a Content-Based Image Retrieval System Mircea Ionescu Department of ECECS, University of Cincinnati, Cincinnati, OH 51-3, USA ionescmm@ececs.uc.edu Anca Ralescu Department of
More informationr 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 informationDisjoint, Partition and Intersection Constraints for Set and Multiset Variables
Disjoint, Partition and Intersection Constraints for Set and Multiset Variables Christian Bessiere ½, Emmanuel Hebrard ¾, Brahim Hnich ¾, and Toby Walsh ¾ ¾ ½ LIRMM, Montpelier, France. Ö Ð ÖÑÑ Ö Cork
More informationTRAVELTIME TOMOGRAPHY (CONT)
30 March 005 MODE UNIQUENESS The forward model TRAVETIME TOMOGRAPHY (CONT di = A ik m k d = Am (1 Data vecto r Sensitivit y matrix Model vector states the linearized relationship between data and model
More informationEfficient Construction of (Distributed) Verifiable Random Functions
Efficient Construction of (Distributed) Verifiable Random Functions Yevgeniy Dodis August 29, 2002 Abstract We give the first simple and efficient construction of verifiable random functions (VRFs). VRFs,
More informationCommunication 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 informationFUNERAL HOMES SYSTEM ADMINISTRATOR MAINTENANCE TOOLS
FUNERAL HOMES SYSTEM ADMINISTRATOR MAINTENANCE TOOLS Table of Content Version 2 REV 08/2018 How to Log Into TxEVER 5 Library Maintenance 5 Common Navigation Buttons 6 Death Module 7 Funeral Homes & Local
More informationARTIO VM SMS Documentation
ARTIO VM SMS Documentation David Jozefov Michal Unzeitig Copyright 2013 - ARTIO International Co. ARTIO VM SMS Documentation ARTIO Publication date: 19.8.2013 Version: 1.0.0 Abstract This document describes
More informationEvent 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
More informationBlack-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations Ueli Maurer and Dominik Raub ETH Zurich, Department of Computer Science, CH-8092 Zurich, Switzerland maurer, raubd@inf.ethz.ch
More informationHomogeneous Coordinates. Lecture18: Camera Models. Representation of Line and Point in 2D. Cross Product. Overall scaling is NOT important.
Homogeneous Coordinates Overall scaling is NOT important. CSED44:Introduction to Computer Vision (207F) Lecture8: Camera Models Bohyung Han CSE, POSTECH bhhan@postech.ac.kr (",, ) ()", ), )) ) 0 It is
More informationAppART + Growing Neural Gas = high performance hybrid neural network for function approximation
1 AppART + Growing Neural Gas = high performance hybrid neural network for function approximation Luis Martí Ý Þ, Alberto Policriti Ý, Luciano García Þ and Raynel Lazo Þ Ý DIMI, Università degli Studi
More informationEdge-Shifted Decision Diagrams for Multiple-Valued Logic
Edge-Shifted Decision Diagrams for ultiple-valued Logic Benet Devereux arsha Chechik Department of Computer Science University of oronto October 29, 2001 Abstract Symbolic data structures for multi-valued
More informationMobile Agent Rendezvous in a Ring
Mobile Agent Rendezvous in a Ring Evangelos Kranakis Danny Krizanc Ý Nicola Santoro Cindy Sawchuk Abstract In the rendezvous search problem, two mobile agents must move along the Ò nodes of a network so
More informationAPPLESHARE 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 informationIndexing Mobile Objects Using Dual Transformations
Indexing Mobile Objects Using Dual Transformations George Kollios Boston University gkollios@cs.bu.edu Dimitris Papadopoulos UC Riverside tsotras@cs.ucr.edu Dimitrios Gunopulos Ý UC Riverside dg@cs.ucr.edu
More informationImproved Algorithm for Minimum Flows in Bipartite Networks with Unit Capacities
Improved Algorithm for Minimum Flows in Bipartite Networks with Unit Capacities ELEONOR CIUREA Transilvania University of Braşov Theoretical Computer Science Departement Braşov, Iuliu Maniu 50, cod 500091
More informationARTIO SMS Services HTTP API Documentation
ARTIO SMS Services HTTP API Documentation David Jozefov Michal Unzeitig Copyright 2013 - ARTIO International Co. ARTIO SMS Services HTTP API Documentation ARTIO Publication date: 4.9.2013 Version: 1.0.1
More informationA 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 informationSIMULTANEOUS PERTURBATION STOCHASTIC APPROXIMATION FOR REAL-TIME OPTIMIZATION OF MODEL PREDICTIVE CONTROL
SIMULTANEOUS PERTURBATION STOCHASTIC APPROXIMATION FOR REAL-TIME OPTIMIZATION OF MODEL PREDICTIVE CONTROL Irina Baltcheva Felisa J.Vázquez-Abad ½ (member of GERAD) Université de Montréal DIRO, CP 6128
More informationA Comparison of Structural CSP Decomposition Methods
A Comparison of Structural CSP Decomposition Methods Georg Gottlob Institut für Informationssysteme, Technische Universität Wien, A-1040 Vienna, Austria. E-mail: gottlob@dbai.tuwien.ac.at Nicola Leone
More informationLecture Notes on GRAPH THEORY Tero Harju
Lecture Notes on GRAPH THEORY Tero Harju Department of Mathematics University of Turku FIN-20014 Turku, Finland e-mail: harju@utu.fi 2007 Contents 1 Introduction 2 1.1 Graphs and their plane figures.........................................
More informationComputing the Detour and Spanning Ratio of Paths, Trees and Cycles in 2D and 3D Ý
Computing the Detour and Spanning Ratio of Paths, Trees and Cycles in 2D and 3D Ý Pankaj K. Agarwal Þ Rolf Klein Ü Christian Knauer ß Stefan Langerman Pat Morin Micha Sharir ÝÝ Michael Soss ÞÞ April 18,
More informationMAT 22B-001: Differential Equations
MAT 22B-001: Differential Equations Final Exam Solutions Note: There is a table of the Laplace transform in the last page Name: SSN: Total Score: Problem 1 (5 pts) Solve the following initial value problem
More informationPropagating 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 informationCommunication 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 informationDerivatives. Day 8 - Tangents and Linearizations
Derivatives Day 8 - Tangents and Linearizations Learning Objectives Write an equation for the tangent line to a graph Write an equation for the normal line to a graph Find the locations of horizontal and
More informationCartons (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 informationESCAPE 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 informationDistrict 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