Statistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem
|
|
- Hugo Rudolph Hensley
- 6 years ago
- Views:
Transcription
1 Statistical Methods in fnctional MRI Lectre 7: Mltiple Comparisons 04/3/13 Martin Lindqist Department of Biostatistics Johns Hopkins University Data Processing Pipeline Standard Analysis Data Acqisition Reconstrction Experimental Design Preprocessing Slice-time Correction Data Analysis Localizing Brain Activity 1. Fit a statistical model (e.g., the GLM) to a certain voxel in the brain.. Use the estimated model parameters to test for an effect of interest, i.e. H 0 : 1- =0. 3. Repeat steps 1 and for each voxel. 4. Smmarize the reslts in a statistical image. Motion Correction, Co-registration & Normalization Spatial Smoothing Connectivity Prediction 5. Determine which voxels show a statistically significant effect, i.e. threshold the image. Mltiple Comparisons Problem Choosing an appropriate threshold is complicated by the fact we are dealing with a family of tests. If more than one hypothesis test is performed, the risk of making at least one Type I error is greater than the vale for a single test. Mltiple Comparisons Problem Which of 100,000 voxels are significant? =0.05 5,000 false positive voxels Choosing a threshold is a balance between sensitivity (tre positive rate) and specificity (tre negative rate). t > 0.5 t > 1.5 t >.5 t > 3.5 t > 4.5 t > 5.5 t > 6.5 t > 0.5 t > 1.5 t >.5 t > 3.5 t > 4.5 t > 5.5 t > 6.5 The more tests one performs, the greater the likelihood of getting at least one false positive. 1
2 Measres of False Positives There exist several ways of qantifying the likelihood of obtaining false positives. Family-Wise Error Rate (FWER) Probability of any false positives False Discovery Rate (FDR) Proportion of false positives among rejected tests Family-Wise Error Rate The family-wise error rate (FWER) is the probability of making one or more Type I errors in a family of tests, nder the nll hypothesis. FWER controlling methods: Bonferroni correction Random Field Theory Permtation Tests Problem Formlation Let H 0i be the hypothesis that there is no activation in voxel i, where i V ={1,.m}. Let T i be the vale of the test statistic at voxel i. The family-wise nll hypothesis, H 0, states that there is no activation in any of the m voxels. H 0 H 0i i V If we reject a single voxel nll hypothesis, H 0i, we will reject the family-wise nll hypothesis. A false positive at any voxel gives a Family-Wise Error (FWE) Assming H 0 is tre, we want the probability of falsely rejecting H 0 to be controlled by, i.e. Bonferroni Correction Choose the threshold so that Example Generate voxels from an iid N(0,1) distribtion Hence, P T i H 0 m Threshold at =1.645 i P Ti H0 Boole s Ineqality i m Approximately 500 false positives.
3 Bonferroni Correction To control for a FWE of 0.05, the Bonferroni correction is 0.05/10,000. The Bonferroni correction is very conservative, i.e. it reslts in very strict significance levels. This corresponds to =4.4. On average only 5 ot of every 100 generated in this fashion will have one or more vales above. It decreases the power of the test (probability of correctly rejecting a false nll hypothesis) and greatly increases the chance of false negatives. It is not optimal for correlated data, and most fmri data has significant spatial correlation. No false positives Spatial Correlation We may be able to choose a more appropriate threshold by sing information abot the spatial correlation in the data. Random field theory allows one to incorporate the correlation into the calclation of the appropriate threshold. Maximm Statistic Link between FWER and max statistic. FWER = P(FWE) = P( i {T i } H o ) P(any t-vale exceeds nder nll) = P( max i T i H o ) P(max t-vale exceeds nder nll) It is based on approximating the distribtion of the maximm statistic over the whole image. Choose the threshold sch that the max only exceeds it % of the time Random Field Theory A random field is a set of random variables defined at every point in D-dimensional space. A Gassian random field has a Gassian distribtion at every point and every collection of points. A Gassian random field is defined by its mean fnction and covariance fnction. Random Field Theory Consider a statistical image to be a lattice representation of a continos random field. Random field methods are able to: approximate the pper tail of the maximm distribtion, which is the part needed to find appropriate thresholds, and accont for the spatial dependence in the data. 3
4 Random Field Theory Eler Characteristic Consider a random field Z(s) defined on s D R where D is the dimension of the process. Eler Characteristic A property of an image after it has been thresholded. Conts #blobs - #holes At high thresholds, jst conts #blobs = =.75 1 = 3.5 Random Field Threshold Controlling the FWER Link between FWER and Eler Characteristic. FWER = P(max i T i H o ) = P(One or more blobs H o ) P( 1 H o ) E( H o ) no holes exist never more than 1 blob Closed form reslts exist for E( ) for Z, t, F and continos random fields. 3D Gassian Random Fields For large search regions: where E( R R(4log) Here V is the volme of the search region and the fll width at half maximm (FWHM) represents the smoothness of the image estimated from the data. R = Resoltion Element (Resel) ) x 3/ V FWHM FWHM ( y 1) e FWHM z Controlling the FWER RFT Assmptions For large : where FWER R R(4log) V FWHM FWHM x 3/ y ( 1) e FWHM z The entire image is either mltivariate Gassian or derived from mltivariate Gassian images. The statistical image mst be sfficiently smooth to approximate a continos random field. FWHM smoothness 3-4 voxel size. Properties: - As increases, FWER decreases (Note large). - As V increases, FWER increases. - As smoothness increases, FWER decreases. The amont of smoothness is assmed known. Estimate is biased when images not sfficiently smooth. Several layers of approximations. 4
5 Levels of Inference A statistical map has many topological attribtes that can be sed to categorize it. Height of a peak Nmber of peaks The volme or extent of an excrsion set Voxel-level Inference Retain voxels above -level threshold We can perform corrections on several levels. Voxel-level Clster-level Significant Voxels space No significant Voxels Clster-level Inference Two step-process Define clsters by arbitrary threshold cls Retain clsters larger than -level threshold k Clster-level Inference Can se RFT to perform clster level inference. Assme clsters behave like a mltidimensional Poisson point process. The probability of getting one or more clsters of volme k is given by: p 1 exp{ E( ) P( n k)} Clster not significant cls k k space Clster significant Here E( ) is the expected Eler Characteristic and n represents the volme of a clster. SnPM Illstration Statistical nonparametric mapping (Nichols & Holmes) is a nonparametric eqivalent to SPM. It ses a permtation test, rather than random field theory, to correct for mltiple comparisons. It allows one to avoid the assmptions needed for sing random field theory. Data from V1 voxel in visal stimls experiment A: Active, flashing checkerboard B: Baseline, fixation 6 blocks, ABABAB Jst consider block averages. A B A B A B Nll hypothesis H 0 No experimental effect, i.e. the A and B labels are arbitrary. Statistic Mean difference between conditions. Nichols & Holmes 5
6 Under H o Consider all eqivalent re-labelings. Assme exchangeability, i.e. the distribtion of the statistic is the same whatever the relabeling. Compte all possible statistic vales. Determine the permtation distribtion. Each relabeling is eqally likely. Hence, each statistic has eqal probability. Permtation distribtion P-vale = 0.05 AAABBB 4.8 ABABAB 9.45 BAAABB BABBAA AABABB -3.5 ABABBA 6.97 BAABAB 1.10 BBAAAB 3.15 AABBAB ABBAAB 1.38 BAABBA BBAABA 0.67 AABBBA ABBABA BABAAB BBABAA 3.5 ABAABB 6.86 ABBBAA 1.48 BABABA BBBAAA Actal vale = 9.45 Permtation test don t work very well with small sample sizes, as they tend to be conservative. Comments Reqires only the assmption of exchangeability Under H 0, the distribtion is nchanged by permtation. This allows s to bild the permtation distribtion. Sbjects are exchangeable Under H 0, each sbject s A/B labels can be flipped. Permtation tests sefl for nd level analysis. Isses Sample size If there are N possible relabelings, the smallest attainable p- vale is 1/N which can be problematic at small N. If there are too many possible relabelings it may not be feasible to compte the statistic images for all of them. Randomly sample from the poplation of relabelings. Each relabeling shold be eqally likely to be chosen. fmri scans not exchangeable nder H 0 The problem is temporal atocorrelation. Be carefl performing permtation tests on individal sbjects. Flexibility The permtation approach is free to consider any statistic and is not bond to those that have a known distribtional form. Isses Comptational Intensity Analysis needs to be repeated for each relabeling Implementation Each experimental design type needs niqe code to generate permtations Power and Validity Nonparametric procedres are less powerfl than their parametric conterparts when the assmptions of the latter hold. If assmptions not met, nonparametric procedres more valid. Mltiple Comparisons Permtation tests can be sed to control for mltiple comparisons. To do so all voxels need to be considered simltaneosly. Argments can be extended to image-level inference by considering an appropriate max statistic. Permtations carried ot on the image level, i.e. entire images are relabeled. 6
7 Illstration A B A B A B Controlling FWER A single threshold test thresholds the statistic image at a critical vale and voxels exceeding the threshold are deemed active. Max statistic A-B By repeatedly permting the image labels and compting the max statistic we obtain the permtation distribtion needed for correcting the FWER. Procedre: Re-label the images. Compte the statistic for each voxel. Compte the maximm statistic over the whole image. Repeat to constrct the permtation distribtion of the max statistic. Controlling FWER A sprathreshold clster test thresholds the statistic image at a primary threshold, and then stdies the extent of activation in a second level. Procedre: Re-label the images. Compte the statistic for each voxel. Threshold at a primary threshold. Compte the size of the largest clster above the threshold. Repeat to constrct the permtation distribtion. d = d = 1 Power Bonferroni and SPM s GRF correction do not accont accrately for spatial smoothness with the sample sizes and smoothness vales typical in imaging experiments. Nonparametric tests more accrate and more sensitive. d = 0.5 d = d = 1 d = 0.5 Wager et al. Isses with FWER Methods that control the FWER (Bonferroni, RFT, Permtation Tests) provide a strong control over the nmber of false positives. While this is appealing the reslting thresholds often lead to tests that sffer from low power. Power is critical in fmri applications becase the most interesting effects are sally at the edge of detection. False Discovery Rate The false discovery rate (FDR) is a recent development in mltiple comparison problems de to Benjamini and Hochberg (1995). While the FWER controls the probability of any false positives, the FDR controls the proportion of false positives among all rejected tests. 7
8 p-vale 0 1 Notation Sppose we perform tests on m voxels. Declared Inactive Declared Active Trly inactive U V m 0 Trly active T S m-m 0 m-r R m In this notation: FWER False discovery rate: FDR Definitions P V V E R 1 U, V, T and S are nobservable random variables. The FDR is defined to be 0 if R=0. R is an observable random variable. Properties A procedre controlling the FDR ensres that on average the FDR is no bigger than a prespecified rate q which lies between 0 and 1. However, for any given data set the FDR need not be below the bond. BH Procedre 1. Select desired limit q on FDR (e.g., 0.05). Rank p-vales, p (1) p ()... p (m) 3. Let r be largest i sch that p (i) i/m q p (i) An FDR-controlling techniqe garantee controls of the FDR in the sense that FDR q. 4. Reject all hypotheses corresponding to p (1),..., p (r). i/m 0 1 q Comments The BH procedre is adaptive in the sense that the larger the signal, the lower the threshold. If all nll hypothesis are tre, the FDR is eqivalent to the FWER. Low signal High signal Any procedre that controls the FWER also controls the FDR. A procedre that controls the FDR only can be less stringent and lead to a gain in power. q m q Since FDR controlling procedres work only on the p-vales and not on the actal test statistics, it can be applied to any valid statistical test. 8
9 Example =0.10, No correction Signal FWER control at 10% Percentage of false positives + Noise = FDR control at 10% Occrrence of false positive FWER Signal + Noise Percentage of active voxels that are false positives Uncorrected Thresholds Most pblished PET and fmri stdies se arbitrary ncorrected thresholds (e.g., p<0.001). A likely reason is that with the available sample sizes, corrected thresholds are so stringent that power is extremely low. Using ncorrected thresholds is problematic when interpreting conclsions from individal stdies, as many of the activated regions may be false positives. Nll findings are hard to disseminate, hence it is difficlt to refte false positives established in the literatre. Extent Threshold Sometimes an arbitrary extent threshold is sed when reporting reslts. Here a voxel is only deemed trly active if it belongs to a clster of k contigos active voxels (e.g., p<0.001, 10 contingent voxels). Unfortnately, this does not necessarily correct the problem becase imaging data are spatially smooth and therefore false positives may appear in clsters. Example Activation maps with spatially correlated noise thresholded at three different significance levels. De to the smoothness, the false-positive activation are contigos regions of mltiple voxels. =0.10 =0.01 =0.001 Example Similar activation maps sing nll data. =0.10 =0.01 =0.001 Note: All images smoothed with FWHM=1mm Note: All images smoothed with FWHM=1mm 9
10 10
Multiple Testing and Thresholding
Multiple Testing and Thresholding UCLA Advanced NeuroImaging Summer School, 2007 Thanks for the slides Tom Nichols! Overview Multiple Testing Problem Which of my 100,000 voxels are active? Two methods
More informationMultiple Testing and Thresholding
Multiple Testing and Thresholding NITP, 2010 Thanks for the slides Tom Nichols! Overview Multiple Testing Problem Which of my 100,000 voxels are active? Two methods for controlling false positives Familywise
More informationMultiple Testing and Thresholding
Multiple Testing and Thresholding NITP, 2009 Thanks for the slides Tom Nichols! Overview Multiple Testing Problem Which of my 100,000 voxels are active? Two methods for controlling false positives Familywise
More informationControlling for multiple comparisons in imaging analysis. Wednesday, Lecture 2 Jeanette Mumford University of Wisconsin - Madison
Controlling for multiple comparisons in imaging analysis Wednesday, Lecture 2 Jeanette Mumford University of Wisconsin - Madison Motivation Run 100 hypothesis tests on null data using p
More informationControlling for mul2ple comparisons in imaging analysis. Where we re going. Where we re going 8/15/16
Controlling for mul2ple comparisons in imaging analysis Wednesday, Lecture 2 Jeane?e Mumford University of Wisconsin - Madison Where we re going Review of hypothesis tes2ng introduce mul2ple tes2ng problem
More informationControlling for mul-ple comparisons in imaging analysis. Wednesday, Lecture 2 Jeane:e Mumford University of Wisconsin - Madison
Controlling for mul-ple comparisons in imaging analysis Wednesday, Lecture 2 Jeane:e Mumford University of Wisconsin - Madison Where we re going Review of hypothesis tes-ng introduce mul-ple tes-ng problem
More informationContents. comparison. Multiple comparison problem. Recap & Introduction Inference & multiple. «Take home» message. DISCOS SPM course, CRC, Liège, 2009
DISCOS SPM course, CRC, Liège, 2009 Contents Multiple comparison problem Recap & Introduction Inference & multiple comparison «Take home» message C. Phillips, Centre de Recherches du Cyclotron, ULg, Belgium
More informationMultiple comparisons problem and solutions
Multiple comparisons problem and solutions James M. Kilner http://sites.google.com/site/kilnerlab/home What is the multiple comparisons problem How can it be avoided Ways to correct for the multiple comparisons
More informationNew and best-practice approaches to thresholding
New and best-practice approaches to thresholding Thomas Nichols, Ph.D. Department of Statistics & Warwick Manufacturing Group University of Warwick FIL SPM Course 17 May, 2012 1 Overview Why threshold?
More informationCorrection for multiple comparisons. Cyril Pernet, PhD SBIRC/SINAPSE University of Edinburgh
Correction for multiple comparisons Cyril Pernet, PhD SBIRC/SINAPSE University of Edinburgh Overview Multiple comparisons correction procedures Levels of inferences (set, cluster, voxel) Circularity issues
More informationIntroductory Concepts for Voxel-Based Statistical Analysis
Introductory Concepts for Voxel-Based Statistical Analysis John Kornak University of California, San Francisco Department of Radiology and Biomedical Imaging Department of Epidemiology and Biostatistics
More informationLinear Models in Medical Imaging. John Kornak MI square February 22, 2011
Linear Models in Medical Imaging John Kornak MI square February 22, 2011 Acknowledgement / Disclaimer Many of the slides in this lecture have been adapted from slides available in talks available on the
More informationExtending the GLM. Outline. Mixed effects motivation Evaluating mixed effects methods Three methods. Conclusions. Overview
Extending the GLM So far, we have considered the GLM for one run in one subject The same logic can be applied to multiple runs and multiple subjects GLM Stats For any given region, we can evaluate the
More informationMedical Image Analysis
Medical Image Analysis Instructor: Moo K. Chung mchung@stat.wisc.edu Lecture 10. Multiple Comparisons March 06, 2007 This lecture will show you how to construct P-value maps fmri Multiple Comparisons 4-Dimensional
More informationStatistical Methods in functional MRI. False Discovery Rate. Issues with FWER. Lecture 7.2: Multiple Comparisons ( ) 04/25/13
Statistical Methods in functional MRI Lecture 7.2: Multiple Comparisons 04/25/13 Martin Lindquist Department of iostatistics Johns Hopkins University Issues with FWER Methods that control the FWER (onferroni,
More informationLinear Models in Medical Imaging. John Kornak MI square February 19, 2013
Linear Models in Medical Imaging John Kornak MI square February 19, 2013 Acknowledgement / Disclaimer Many of the slides in this lecture have been adapted from slides available in talks available on the
More informationOn the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing
1 On the Comptational Complexity and Effectiveness of N-hb Shortest-Path Roting Reven Cohen Gabi Nakibli Dept. of Compter Sciences Technion Israel Abstract In this paper we stdy the comptational complexity
More informationNonparametric Permutation Tests For Functional Neuroimaging: APrimer with Examples
Human Brain Mapping 15:1 25(2001) Nonparametric Permutation Tests For Functional Neuroimaging: APrimer with Examples Thomas E. Nichols 1 and Andrew P. Holmes 2,3 * 1 Department of Biostatistics, University
More informationOptimal Sampling in Compressed Sensing
Optimal Sampling in Compressed Sensing Joyita Dtta Introdction Compressed sensing allows s to recover objects reasonably well from highly ndersampled data, in spite of violating the Nyqist criterion. In
More informationLinear Models in Medical Imaging. John Kornak MI square February 23, 2010
Linear Models in Medical Imaging John Kornak MI square February 23, 2010 Acknowledgement / Disclaimer Many of the slides in this lecture have been adapted from slides available in talks available on the
More informationUncertainty Determination for Dimensional Measurements with Computed Tomography
Uncertainty Determination for Dimensional Measrements with Compted Tomography Kim Kiekens 1,, Tan Ye 1,, Frank Welkenhyzen, Jean-Pierre Krth, Wim Dewlf 1, 1 Grop T even University College, KU even Association
More informationFinite Domain Cuts for Minimum Bandwidth
Finite Domain Cts for Minimm Bandwidth J. N. Hooker Carnegie Mellon University, USA Joint work with Alexandre Friere, Cid de Soza State University of Campinas, Brazil INFORMS 2013 Two Related Problems
More informationMinimal Edge Addition for Network Controllability
This article has been accepted for pblication in a ftre isse of this jornal, bt has not been flly edited. Content may change prior to final pblication. Citation information: DOI 10.1109/TCNS.2018.2814841,
More informationFault Tolerance in Hypercubes
Falt Tolerance in Hypercbes Shobana Balakrishnan, Füsn Özgüner, and Baback A. Izadi Department of Electrical Engineering, The Ohio State University, Colmbs, OH 40, USA Abstract: This paper describes different
More informationBias of Higher Order Predictive Interpolation for Sub-pixel Registration
Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz
More informationOPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018
OPTI-502 Optical Design and Instrmentation I John E. Greivenkamp Assigned: 10/31/18 Lectre 21 De: 11/7/18 Lectre 23 Note that in man 502 homework and exam problems (as in the real world!!), onl the magnitde
More informationPOWER-OF-2 BOUNDARIES
Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of
More informationQoS-driven Runtime Adaptation of Service Oriented Architectures
Qo-driven Rntime Adaptation of ervice Oriented Architectres Valeria ardellini 1 Emiliano asalicchio 1 Vincenzo Grassi 1 Francesco Lo Presti 1 Raffaela Mirandola 2 1 Dipartimento di Informatica, istemi
More informationConstructing and Comparing User Mobility Profiles for Location-based Services
Constrcting and Comparing User Mobility Profiles for Location-based Services Xihi Chen Interdisciplinary Centre for Secrity, Reliability and Trst, University of Lxemborg Jn Pang Compter Science and Commnications,
More informationNetworks An introduction to microcomputer networking concepts
Behavior Research Methods& Instrmentation 1978, Vol 10 (4),522-526 Networks An introdction to microcompter networking concepts RALPH WALLACE and RICHARD N. JOHNSON GA TX, Chicago, Illinois60648 and JAMES
More informationEvaluating Influence Diagrams
Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will
More informationEMC ViPR. User Guide. Version
EMC ViPR Version 1.1.0 User Gide 302-000-481 01 Copyright 2013-2014 EMC Corporation. All rights reserved. Pblished in USA. Pblished Febrary, 2014 EMC believes the information in this pblication is accrate
More informationMultiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET
Mltiple-Choice Test Chapter 09.0 Golden Section Search Method Optimization COMPLETE SOLUTION SET. Which o the ollowing statements is incorrect regarding the Eqal Interval Search and Golden Section Search
More informationAdvances in FDR for fmri -p.1
Advances in FDR for fmri Ruth Heller Department of Statistics, University of Pennsylvania Joint work with: Yoav Benjamini, Nava Rubin, Damian Stanley, Daniel Yekutieli, Yulia Golland, Rafael Malach Advances
More informationCOMPOSITION OF STABLE SET POLYHEDRA
COMPOSITION OF STABLE SET POLYHEDRA Benjamin McClosky and Illya V. Hicks Department of Comptational and Applied Mathematics Rice University November 30, 2007 Abstract Barahona and Mahjob fond a defining
More informationA sufficient condition for spiral cone beam long object imaging via backprojection
A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral
More informationReview Multicycle: What is Happening. Controlling The Multicycle Design
Review lticycle: What is Happening Reslt Zero Op SrcA SrcB Registers Reg Address emory em Data Sign etend Shift left Sorce A B Ot [-6] [5-] [-6] [5-] [5-] Instrction emory IR RegDst emtoreg IorD em em
More informationSnPM is an SPM toolbox developed by Andrew Holmes & Tom Nichols
1 of 14 3/30/2005 9:24 PM SnPM A Worked fmri Example SnPM is an SPM toolbox developed by Andrew Holmes & Tom Nichols This page... introduction example data background design setup computation viewing results
More informationAn Adaptive Strategy for Maximizing Throughput in MAC layer Wireless Multicast
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering May 24 An Adaptive Strategy for Maximizing Throghpt in MAC layer Wireless Mlticast Prasanna
More informationIsilon InsightIQ. Version 2.5. User Guide
Isilon InsightIQ Version 2.5 User Gide Pblished March, 2014 Copyright 2010-2014 EMC Corporation. All rights reserved. EMC believes the information in this pblication is accrate as of its pblication date.
More informationDIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES
DIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES Binh-Son Ha 1 Imari Sato 2 Kok-Lim Low 1 1 National University of Singapore 2 National Institte of Informatics, Tokyo, Japan ABSTRACT Dal
More informationCS 153 Design of Operating Systems Spring 18
CS 153 Design of Operating Systems Spring 18 Lectre 11: Semaphores Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Last time Worked throgh software implementation
More informationLinear Models in Medical Imaging. John Kornak MI square February 21, 2012
Linear Models in Medical Imaging John Kornak MI square February 21, 2012 Acknowledgement / Disclaimer Many of the slides in this lecture have been adapted from slides available in talks available on the
More informationREPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips
REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS M. Melpolder, D.H.J. Epema, H.J. Sips Parallel and Distribted Systems Grop Department of Compter Science, Delft University of Technology, the Netherlands
More informationTowards Understanding Bilevel Multi-objective Optimization with Deterministic Lower Level Decisions
Towards Understanding Bilevel Mlti-objective Optimization with Deterministic Lower Level Decisions Ankr Sinha Ankr.Sinha@aalto.fi Department of Information and Service Economy, Aalto University School
More informationTopic Continuity for Web Document Categorization and Ranking
Topic Continity for Web ocment Categorization and Ranking B. L. Narayan, C. A. Mrthy and Sankar. Pal Machine Intelligence Unit, Indian Statistical Institte, 03, B. T. Road, olkata - 70008, India. E-mail:
More informationPicking and Curves Week 6
CS 48/68 INTERACTIVE COMPUTER GRAPHICS Picking and Crves Week 6 David Breen Department of Compter Science Drexel University Based on material from Ed Angel, University of New Mexico Objectives Picking
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY On the Analysis of the Bluetooth Time Division Duplex Mechanism
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 5, MAY 2007 1 On the Analysis of the Bletooth Time Division Dplex Mechanism Gil Zssman Member, IEEE, Adrian Segall Fellow, IEEE, and Uri Yechiali
More informationSZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error- Controlled Quantization
SZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Mltidimensional Prediction and Error- Controlled Qantization Dingwen Tao (University of California, Riverside) Sheng
More informationAlliances and Bisection Width for Planar Graphs
Alliances and Bisection Width for Planar Graphs Martin Olsen 1 and Morten Revsbæk 1 AU Herning Aarhs University, Denmark. martino@hih.a.dk MADAGO, Department of Compter Science Aarhs University, Denmark.
More informationCS 4204 Computer Graphics
CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types
More informationImage Enhancement in the Frequency Domain Periodicity and the need for Padding:
Prepared B: Dr. Hasan Demirel PhD Image Enhancement in the Freqenc Domain Periodicit and the need for Padding: Periodicit propert of the DFT: The discrete Forier Transform and the inverse Forier transforms
More informationA choice relation framework for supporting category-partition test case generation
Title A choice relation framework for spporting category-partition test case generation Athor(s) Chen, TY; Poon, PL; Tse, TH Citation Ieee Transactions On Software Engineering, 2003, v. 29 n. 7, p. 577-593
More informationPavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003
From: AAAI-84 Proceedings. Copyright 1984, AAAI (www.aaai.org). All rights reserved. SELECTIVE ABSTRACTION OF AI SYSTEM ACTIVITY Jasmina Pavlin and Daniel D. Corkill Department of Compter and Information
More informationDate: December 5, 1999 Dist'n: T1E1.4
12/4/99 1 T1E14/99-559 Project: T1E14: VDSL Title: Vectored VDSL (99-559) Contact: J Cioffi, G Ginis, W Y Dept of EE, Stanford U, Stanford, CA 945 Cioffi@stanforded, 1-65-723-215, F: 1-65-724-3652 Date:
More informationDiscretized Approximations for POMDP with Average Cost
Discretized Approximations for POMDP with Average Cost Hizhen Y Lab for Information and Decisions EECS Dept., MIT Cambridge, MA 0239 Dimitri P. Bertsekas Lab for Information and Decisions EECS Dept., MIT
More informationTu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization
T P7 15 First-arrival Traveltime Tomography with Modified Total Variation Reglarization W. Jiang* (University of Science and Technology of China) & J. Zhang (University of Science and Technology of China)
More informationA Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks
Open Access Library Jornal A Hybrid Weight-Based Clstering Algorithm for Wireless Sensor Networks Cheikh Sidy Mohamed Cisse, Cheikh Sarr * Faclty of Science and Technology, University of Thies, Thies,
More informationIllumina LIMS. Software Guide. For Research Use Only. Not for use in diagnostic procedures. Document # June 2017 ILLUMINA PROPRIETARY
Illmina LIMS Software Gide Jne 2017 ILLUMINA PROPRIETARY This docment and its contents are proprietary to Illmina, Inc. and its affiliates ("Illmina"), and are intended solely for the contractal se of
More informationCS 153 Design of Operating Systems
CS 53 Design of Operating Systems Spring 8 Lectre 6: Paging Instrctor: Chengy Song Slide contribtions from Nael Ab-Ghazaleh, Harsha Madhyvasta and Zhiyn Qian Some slides modified from originals by Dave
More informationMa Lesson 18 Section 1.7
Ma 15200 Lesson 18 Section 1.7 I Representing an Ineqality There are 3 ways to represent an ineqality. (1) Using the ineqality symbol (sometime within set-bilder notation), (2) sing interval notation,
More informationREDUCED-REFERENCE ASSESSMENT OF PERCEIVED QUALITY BY EXPLOITING COLOR INFORMATION
REDUCED-REFERENCE ASSESSMENT OF PERCEIVED QUALITY BY EXPLOITING COLOR INFORMATION Jdith Redi, Paolo Gastaldo, Rodolfo Znino, and Ingrid Heyndericx (+) University of Genoa, DIBE, Via Opera Pia a - 645 Genova
More informationInvestigation of turbulence measurements with a continuous wave, conically scanning LiDAR Abstract 1. Introduction
Investigation of trblence measrements with a continos wave, conically scanning LiDAR Rozenn Wagner 1, Torben Mikkelsen 1, Michael Cortney Risø DTU, PO Box 49,DK4000 Roskilde, Denmark rozn@risoe.dt.dk Abstract
More informationCollision Avoidance and Resolution Multiple Access: First-Success Protocols
Collision Avoidance and Resoltion Mltiple Access: First-Sccess Protocols Rodrigo Garcés and J.J. Garcia-Lna-Aceves askin Center for Compter Engineering and Information Sciences University of California
More information7/15/2016 ARE YOUR ANALYSES TOO WHY IS YOUR ANALYSIS PARAMETRIC? PARAMETRIC? That s not Normal!
ARE YOUR ANALYSES TOO PARAMETRIC? That s not Normal! Martin M Monti http://montilab.psych.ucla.edu WHY IS YOUR ANALYSIS PARAMETRIC? i. Optimal power (defined as the probability to detect a real difference)
More informationLecture 10. Diffraction. incident
1 Introdction Lectre 1 Diffraction It is qite often the case that no line-of-sight path exists between a cell phone and a basestation. In other words there are no basestations that the cstomer can see
More informationSecure Biometric-Based Authentication for Cloud Computing
Secre Biometric-Based Athentication for Clod Compting Kok-Seng Wong * and Myng Ho Kim School of Compter Science and Engineering, Soongsil University, Sangdo-Dong Dongjak-G, 156-743 Seol Korea {kswong,kmh}@ss.ac.kr
More informationThis chapter is based on the following sources, which are all recommended reading:
Bioinformatics I, WS 09-10, D. Hson, December 7, 2009 105 6 Fast String Matching This chapter is based on the following sorces, which are all recommended reading: 1. An earlier version of this chapter
More informationStaCo: Stackelberg-based Coverage Approach in Robotic Swarms
Maastricht University Department of Knowledge Engineering Technical Report No.:... : Stackelberg-based Coverage Approach in Robotic Swarms Kateřina Staňková, Bijan Ranjbar-Sahraei, Gerhard Weiss, Karl
More informationOffline and Online Scheduling of Concurrent Bags-of-Tasks on Heterogeneous Platforms
Offline and Online Schedling of Concrrent Bags-of-Tasks on Heterogeneos Platforms Anne Benoit, Loris Marchal, Jean-François Pinea, Yves Robert, Frédéric Vivien To cite this version: Anne Benoit, Loris
More informationDiscrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods
Annals of Operations Research 106, 19 46, 2001 2002 Klwer Academic Pblishers. Manfactred in The Netherlands. Discrete Cost Mlticommodity Network Optimization Problems and Exact Soltion Methods MICHEL MINOUX
More informationTriangle-Free Planar Graphs as Segments Intersection Graphs
Triangle-ree Planar Graphs as Segments Intersection Graphs N. de Castro 1,.J.Cobos 1, J.C. Dana 1,A.Márqez 1, and M. Noy 2 1 Departamento de Matemática Aplicada I Universidad de Sevilla, Spain {natalia,cobos,dana,almar}@cica.es
More informationMultiView: Improving Trust in Group Video Conferencing Through Spatial Faithfulness David T. Nguyen, John F. Canny
MltiView: Improving Trst in Grop Video Conferencing Throgh Spatial Faithflness David T. Ngyen, John F. Canny CHI 2007, April 28 May 3, 2007, San Jose, California, USA Presented by: Stefan Stojanoski 1529445
More informationPipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
This fll text paper was peer reviewed at the direction of IEEE Commnications Society sbject matter experts for pblication in the IEEE INFOCOM 007 proceedings Pipelined van Emde Boas Tree: Algorithms, Analysis,
More informationThe extra single-cycle adders
lticycle Datapath As an added bons, we can eliminate some of the etra hardware from the single-cycle path. We will restrict orselves to sing each fnctional nit once per cycle, jst like before. Bt since
More informationObject Pose from a Single Image
Object Pose from a Single Image How Do We See Objects in Depth? Stereo Use differences between images in or left and right eye How mch is this difference for a car at 00 m? Moe or head sideways Or, the
More informationEstimating Model Parameters and Boundaries By Minimizing a Joint, Robust Objective Function
Proceedings 999 IEEE Conf. on Compter Vision and Pattern Recognition, pp. 87-9 Estimating Model Parameters and Bondaries By Minimiing a Joint, Robst Objective Fnction Charles V. Stewart Kishore Bbna Amitha
More informationThe multicycle datapath. Lecture 10 (Wed 10/15/2008) Finite-state machine for the control unit. Implementing the FSM
Lectre (Wed /5/28) Lab # Hardware De Fri Oct 7 HW #2 IPS programming, de Wed Oct 22 idterm Fri Oct 2 IorD The mlticycle path SrcA Today s objectives: icroprogramming Etending the mlti-cycle path lti-cycle
More informationCHAPTER 2. Morphometry on rodent brains. A.E.H. Scheenstra J. Dijkstra L. van der Weerd
CHAPTER 2 Morphometry on rodent brains A.E.H. Scheenstra J. Dijkstra L. van der Weerd This chapter was adapted from: Volumetry and other quantitative measurements to assess the rodent brain, In vivo NMR
More informationImage Compression Compression Fundamentals
Compression Fndamentals Data compression refers to the process of redcing the amont of data reqired to represent given qantity of information. Note that data and information are not the same. Data refers
More informationPERFORMANCE EVALUATION AND HILS TEST OF CONTROL ALLOCATION METHODS FOR RECONFIGURATION CONTROL
6 TH INTENATIONA CONGESS OF THE AEONAUTICA SCIENCES Abstract PEFOMANCE EVAUATION AND HIS TEST OF CONTO AOCATION METHODS FO ECONFIGUATION CONTO Byong-Mn Min*, Bong-J Kim**, Eng-Tai Kim***, and Min-Jea Tahk*
More informationCombined cine- and tagged-mri for tracking landmarks on the tongue surface
INTERSPEECH 2015 Combined cine- and tagged-mri for tracking landmarks on the tonge srface Honghao Bao 1, Wenhan L 1, Kiyoshi Honda 2,*, Jiango Wei 1, Qiang Fang 3, Jianw Dang 2, 4 1 School of Compter Software,
More informationPipelining. Chapter 4
Pipelining Chapter 4 ake processor rns faster Pipelining is an implementation techniqe in which mltiple instrctions are overlapped in eection Key of making processor fast Pipelining Single cycle path we
More informationDr Paolo Guagliardo. Fall 2018
The NULL vale Dr Paolo Gagliardo dbs-lectrer@ed.ac.k Fall 2018 NULL: all-prpose marker to represent incomplete information Main sorce of problems and inconsistencies... this topic cannot be described in
More informationResolving Linkage Anomalies in Extracted Software System Models
Resolving Linkage Anomalies in Extracted Software System Models Jingwei W and Richard C. Holt School of Compter Science University of Waterloo Waterloo, Canada j25w, holt @plg.waterloo.ca Abstract Program
More informationarxiv: v1 [cs.si] 12 Dec 2016
Connection Discovery sing Shared Images by Gassian Relational Topic Model Xiaopeng Li, Ming Cheng, James She HKUST-NIE Social Media Lab, Hong Kong University of Science & Technology, Hong Kong xlibo@connect.st.hk,
More informationp 1 p 2 p 3 S u( ) θ
Preprint of a paper pblished in inimal Srfaces, Geometric Analysis and Symplectic Geometry Adv. Std. Pre ath, 34 (2002) 129 142. SOLUTION TO THE SHADOW PROBLE IN 3-SPACE OHAAD GHOI Abstract. If a convex
More informationMethod to build an initial adaptive Neuro-Fuzzy controller for joints control of a legged robot
Method to bild an initial adaptive Nero-Fzzy controller for joints control of a legged robot J-C Habmremyi, P. ool and Y. Badoin Royal Military Academy-Free University of Brssels 08 Hobbema str, box:mrm,
More informationSparse online self-organizing maps for large relational data
Sparse online self-organizing maps for large relational data Madalina Oltean, Nathalie Villa-Vialaneix To cite this version: Madalina Oltean, Nathalie Villa-Vialaneix. Sparse online self-organizing maps
More informationEXAMINATIONS 2010 END OF YEAR NWEN 242 COMPUTER ORGANIZATION
EXAINATIONS 2010 END OF YEAR COPUTER ORGANIZATION Time Allowed: 3 Hors (180 mintes) Instrctions: Answer all qestions. ake sre yor answers are clear and to the point. Calclators and paper foreign langage
More informationIdentification of the Symmetries of Linear Systems with Polytopic Constraints
2014 American Control Conference (ACC) Jne 4-6, 2014. Portland, Oregon, USA Identification of the Symmetries of Linear Systems with Polytopic Constraints Clas Danielson and Francesco Borrelli Abstract
More informationASSESSMENT OF DIGITAL IMAGE CORRELATION PERFORMANCES
ASSESSMENT OF DIGITAL IMAGE CORRELATION PERFORMANCES Workgrop Metrology of CNRS research network 2519 a MCIMS, Presented by Larent Robert and Jean-José Orte b a http://www.ifma.fr/lami/gdr2519/ b CROMeP,
More informationImage Restoration Image Degradation and Restoration
Image Degradation and Restoration hxy Image Degradation Model: Spatial domain representation can be modeled by: g x y h x y f x y x y Freqency domain representation can be modeled by: G F N Prepared By:
More informationFast Obstacle Detection using Flow/Depth Constraint
Fast Obstacle etection sing Flow/epth Constraint S. Heinrich aimlerchrylser AG P.O.Box 2360, -89013 Ulm, Germany Stefan.Heinrich@aimlerChrysler.com Abstract The early recognition of potentially harmfl
More informationA Non-Parametric Approach
Andrew P. Holmes. Ph.D., 1994. Chapter Six A Non-Parametric Approach In this chapter, a non-parametric approach to assessing functional mapping experiments is presented. A multiple comparisons randomisation
More informationCongestion-adaptive Data Collection with Accuracy Guarantee in Cyber-Physical Systems
Congestion-adaptive Data Collection with Accracy Garantee in Cyber-Physical Systems Nematollah Iri, Lei Y, Haiying Shen, Gregori Calfield Department of Electrical and Compter Engineering, Clemson University,
More informationTutte Embeddings of Planar Graphs
Spectral Graph Theory and its Applications Lectre 21 Ttte Embeddings o Planar Graphs Lectrer: Daniel A. Spielman November 30, 2004 21.1 Ttte s Theorem We sally think o graphs as being speciied by vertices
More informationThe final datapath. M u x. Add. 4 Add. Shift left 2. PCSrc. RegWrite. MemToR. MemWrite. Read data 1 I [25-21] Instruction. Read. register 1 Read.
The final path PC 4 Add Reg Shift left 2 Add PCSrc Instrction [3-] Instrction I [25-2] I [2-6] I [5 - ] register register 2 register 2 Registers ALU Zero Reslt ALUOp em Data emtor RegDst ALUSrc em I [5
More informationContent Content Introduction
Content Content Introdction...................................................................... 3 Roles in the provisioning process............................................................... 4 Server
More informationCS 557 Lecture IX. Drexel University Dept. of Computer Science
CS 7 Lectre IX Dreel Uniersity Dept. of Compter Science Fall 00 Shortest Paths Finding the Shortest Paths in a graph arises in many different application: Transportation Problems: Finding the cheapest
More information