Dianne O'Leary
Professor Emerita
2160 Iribe Center
(301) 405-2678
(301) 405-6707
Education:
Ph.D., Stanford University (Computer Science)
Special Awards/Honors:
ACM Fellow, CMPS Board of Visitors Distinguished Faculty Award, 2011 Norbert Wiener Lecturer
Biography:
Dianne Prost O'Leary is a Distinguished University Professor Emerita of computer science, and also holds joint appointments in UMIACS and in the Applied Mathematics and Statistics and Scientific Computing Program.
O'Leary's research focuses on computational linear algebra and optimization, with applications including solution of ill-posed problems, image deblurring, information retrieval, protein configuration, and quantum computing.
She has authored two books, more than 100 research publications on numerical analysis and computational science, and 30 publications on education and mentoring. Perhaps her most widely-read publication is an online guide called, "Graduate Study in the Computer and Mathematical Sciences: A Survival Manual." Twenty-one students have received doctorates under her direction.
O'Leary is a member of AWM and a Fellow of SIAM and ACM. She was awarded a Doctor of Mathematics degree, honoris causa, from the University of Waterloo in 2005; received the Board of Visitors Distinguished Faculty Award, College of Computer, Mathematical, and Physical Sciences, University of Maryland, in 2007; and was chosen to be the 2008 AWM-SIAM Sonia Kovalevsky Lecturer.
She has chaired the program committees of major conferences and has organized two mentoring workshops. O'Leary is editor-in-chief of the SIAM Journal on Matrix Analysis and Applications, and co-edits the column, "Your Homework Assignment" for Computing in Science and Engineering.
She earned a B.S. in mathematics with a physics minor from Purdue University and a doctorate in computer science from Stanford University.
Go here to view O'Leary's academic publications on Google Scholar.
Publications
2011
2011. A Constraint-Reduced Variant of Mehrotra's Predictor-Corrector Algorithm. Computational Optimization and Applications.
2011. Euclidean distance matrix completion problems. Optimization Methods and Software. :1-23.
2011. Fast approximations of the rotational diffusion tensor and their application to structural assembly of molecular complexes. Proteins: Structure, Function, and Bioinformatics. 79(7):2268-2281.
2011. Nouveau-ROUGE: A Novelty Metric for Update Summarization. Computational Linguistics. 37(1):1-8.
2011. Windowed Spectral Regularization of Inverse Problems. SIAM Journal on Scientific Computing. 33(6)
2011. Designing Optimal Spectral Filters for Inverse Problems. SIAM Journal on Scientific Computing. 33(6)
2010
2010. Modelling Type 1a Supernova Light Curves. Exponential Data Fitting and Its ApplicationsExponential Data Fitting and Its Applications. :169-186.
2010. Portfolio Selection Using Tikhonov Filtering to Estimate the Covariance Matrix. SIAM Journal on Financial Mathematics. 1:932-961.
2010. Adaptive Constraint Reduction for Convex Quadratic Programming. Computational Optimization and Applications.
2009
2009. Locality bounds on hamiltonians for stabilizer codes. Quantum Info. Comput.. 9(5):487-499.
2009. A Polynomial-Time Interior-Point Method for Conic Optimization, with Inexact Barrier Evaluations. SIAM Journal on Optimization. 20:548-571.
2009. CLASSY 2009: Summarization and Metrics. TAC 2009 Workshop ProceedingsTAC 2009 Workshop Proceedings.
2008
2008. Arabic/English Multi-document Summarization with CLASSYThe Past and the Future. Computational Linguistics and Intelligent Text Processing, Lecture Notes in Computer Science Volume 4919Computational Linguistics and Intelligent Text Processing, Lecture Notes in Computer Science Volume 4919. :568-581.
2008. Why Do Hubs in the Yeast Protein Interaction Network Tend To Be Essential: Reexamining the Connection between the Network Topology and Essentiality. PLoS Comput BiolPLoS Comput Biol. 4(8):e1000140-e1000140.
2008. The Adiabatic Theorem in the Presence of Noise. Physical Review A. 77:042319,20pages-042319,20pages.
2008. A Weighted GCV Method for Lanczos Hybrid Regularization. Electronic Transactions on Numerical Analysis. 28:149-167.
2008. Adaptive Constraint Reduction for Training Support Vector Machines. Electronic Transactions on Numerical Analysis. 31:156-177.
2008. Implementing an Interior Point Method for Linear Programs on a CPU-GPU System. Electronic Transactions on Numerical Analysis. 28:174-189.
2008. Residual periodograms for choosing regularization parameters for ill-posed problems. Inverse Problems. 24(3):034005-034005.
2007
2007. Universal Duality in Conic Convex Optimization. Mathematical Programming A. 109(1):69-88.
2007. Modified Cholesky Algorithms: A Catalog with New Approaches. Mathematical Programming.
2007. Fast Robust Regression Algorithms for Problems with Toeplitz Structure. Computational Statistics and Data Analysis. 52:2:1119-1131.
2007. Structural Footprinting in Protein Structure Comparison: The Impact of Structural Fragments. BMC Structural Biology. 7(53)
2007. Bridging the ROUGE/Human Evaluation Gap in Multi-Document Summarization. Document Understanding Conference DUC 2007Document Understanding Conference DUC 2007.
2007. On Sensitivity of Gauss-Christoffel Quadrature. Numerische Mathematik. 107:147-174.
2007. Measuring variability in sentence ordering for news summarization. Proceedings of the Eleventh European Workshop on Natural Language Generation. :81-88.
2006
2006. Algorithms for Structured Total Least Squares Problems with Applications to Blind Image Deblurring. Journal of Research of the National Institute of Standards and Technology. 111(2):113-119.
2006. Secondary Structure Spatial Conformation Footprint: A Novel Method for Fast Protein Structure Comparison and Classification. BMC Structural Biology. 6(12)
2006. Sentence Trimming and Selection: Mixing and Matching. DUC 06 Conference Proceedings.
2006. Topic-focused multi-document summarization using an approximate oracle score. Proceedings of the COLING/ACL on Main conference poster sessions. :152-159.
2006. Stable Factorizations of Symmetric Tridiagonal and Triadic Matrices. SIAM J. on Matrix Analysis and Applications. 28:576-595.
2006. Back to Basics: CLASSY 2006. DUC 06 Conference ProceedingsDUC 06 Conference Proceedings.
2006. Efficient Circuits for Exact-Universal Computation with Qudits. Quantum Information and Computation. 6:436-454.
2006. CLASSYArabic and English Multi-Document Summarization. Multi-Lingual Summarization Evaluation 2006Multi-Lingual Summarization Evaluation 2006.
2005
2005. QR Factorizations Using a Restricted Set of Rotations. Electronic Transactions on Numerical Analysis. 21:20-27.
2005. HOPE: A Homotopy Optimization Method for Protein Structure Prediction. Journal of Computational Biology. 12(10):1275-1288.
2004
2004. Left-Brain/Right-Brain Multi-Document Summarization. DUC 04 Conference ProceedingsDUC 04 Conference Proceedings.
2004. Reconstructing Images of Bar Codes for Construction Site Object Recognition. Automation in Construction (Elsevier). 13:21-35.
2003
2003. Performance of a Three-Stage System for Multi-Document Summarization. DUC 03 Conference ProceedingsDUC 03 Conference Proceedings.
2003. Machine and Human Performance for Single- and Multi-Document Summarization. IEEE Intelligent Systems (special issue on Natural Language Processing). 18(1):46-54.
2003. Blind Deconvolution Using a Regularized Structured Total Least Norm Approach. SIAM J. on Matrix Analysis and Applications. 24:1018-1037.
2003. Complete stagnation of. Linear Algebra and its Applications. 367:165-183.
2003. Clustering and Summarizing Medline Abstracts. BISTI 2003 Symposium on Digital Biology: The Emerging ParadigmBISTI 2003 Symposium on Digital Biology: The Emerging Paradigm.
2002
2002. Understanding Machine Performance in the Context of Human Performance for Multi-document Summarization. DUC 02 Conference ProceedingsDUC 02 Conference Proceedings.
2002. Reconstructing Images of Bar Codes for Construction Site Object Recognition. Proceedings of the 19th International Symposium on Automation and Robotics in Construction.
2002. Image Restoration through Subimages and Confidence Images. Electronic Transactions on Numerical Analysis. 13:22-37.
2002. A multigrid method enhanced by Krylov subspace iteration for discrete Helmholtz equations. SIAM Journal on scientific computing. 23(4):1291-1315.
2000
2000. Symbiosis between Linear Algebra and Optimization. Journal of Computational and Applied Mathematics. 123:447-465.
2000. Chromosome Identification Using Hidden Markov Models: Comparison with Neural Networks, Singular Value Decomposition, Principal Components Analysis, and Fisher Discriminant Analysis. Laboratory Investigation. 80(11):1629-1641.
2000. Adaptive Use of Iterative Methods in Predictor-Corrector Interior Point Methods for Linear Programming. Numerical Algorithms. 25:387-406.
2000. Algorithm 805: computation and uses of the semidiscrete matrix decomposition. ACM Trans. Math. Softw.. 26(3):415-435.
1999
1999. Tikhonov Regularization and Total Least Squares. SIAM Journal on Matrix Analysis and Applications. 21(1):185-194.
1999. Pivoted Cauchy-Like Preconditioners for Regularized Solution of Ill-Posed Problems. SIAM Journal on Scientific Computing. 21:88-110.
1999. Latent Semantic Indexing via a Semi-Discrete Matrix Decomposition. The Mathematics of Information Coding, Extraction and DistributionThe Mathematics of Information Coding, Extraction and Distribution. :73-80.
1999. Eigenanalysis of Some Preconditioned Helmholtz Problems. Numerische Mathematik. 83:231-257.
1999. Latent Semantic Indexing via a Semi-Discrete Matrix Decomposition. The Mathematics of Information Coding, Extraction and DistributionThe Mathematics of Information Coding, Extraction and Distribution. :73-80.
1998
1998. Commentary on Lanczos's `Analytical and Practical Curve Fitting of Equidistant Data'. Cornelius Lanczos Collected Published Papers with CommentariesCornelius Lanczos Collected Published Papers with Commentaries. 5:3-433to3-434-3-433to3-434.
1998. BFGS with Update Skipping and Varying Memory. SIAM Journal on Optimization. 8(4):1060-1083.
1998. A semidiscrete matrix decomposition for latent semantic indexing information retrieval. ACM Trans. Inf. Syst.. 16(4):322-346.
1998. Efficient Iterative Solution of the Three-Dimensional Helmholtz Equation. Journal of Computational Physics. 142(1):163-181.
1998. Overcoming Instability In Computing The Fundamental Matrix For A Markov Chain. SIAM Journal on Matrix Analysis and Applications. 19(2):534-540.
1998. Restoring Images Degraded by Spatially Variant Blur. SIAM Journal on Scientific Computing. 19(4):1063-1082.
1997
1997. Fast iterative image restoration with a spatially varying PSF. Proceedings of SPIE. 3162(1):388-399.
1997. Regularization algorithms based on total least squares. Recent advances in total least squares techniques and errors-in-variables modeling (Leuven, 1996)Recent advances in total least squares techniques and errors-in-variables modeling (Leuven, 1996). :127-137.
1997. Regularization by Truncated Total Least Squares. SIAM Journal on Scientific Computing. 18(4):1223-1241.
1996
1996. A Block-GTH Algorithm for Finding the Stationary Vector of a Markov Chain. SIAM Journal on Matrix Applications. 17:470-488.
1996. Conjugate Gradients and Related KMP Algorithms: The Beginnings. Linear and Nonlinear Conjugate Gradient-Related MethodsLinear and Nonlinear Conjugate Gradient-Related Methods. :1-8.