Miron Livny

Miron Livny

Auto-generated profile, based on publicly available information

Miron Livny

Computer Sciences Department University of Wisconsin-Madison US

Research Focus & Metrics

Academic Career Length

33Years (1994-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 August 2007 in BMC Genomics
Verified
Journal Article
Open access
PDF file
SZShiguo Zhou
Shiguo Zhou
MBMichael C Bechner
Michael C Bechner
MPMichael Place
Michael Place
CCChris P Churas
Chris P Churas
LPLouise Pape
Louise Pape
DSDavid C Schwartz
David C Schwartz
Background: Rice feeds much of the world, and possesses the simplest genome analyzed to date within the grass family, making it an economically relevant model system for other cereal crops. Although the rice genome is sequenced, validation and gap closing efforts require purely independent means for accurate finishing of sequence build data.Results: To facilitate ongoing sequencing finishing and validation efforts, we have constructed a whole-genome SwaI optical restriction map of the rice genome. The physical map consists of 14 contigs, covering 12 chromosomes, with a total genome size of 382.17 Mb; this value is about 11% smaller than original estimates. 9 of the 14 optical map contigs are without gaps, covering chromosomes 1, 2, 3, 4, 5, 7, 8 10, and 12 in their entirety – including centromeres and telomeres. Alignments between optical andin silicorestriction maps constructed from IRGSP (International Rice Genome Sequencing Project) and TIGR (The Institute for Genomic Research) genome sequence sources are comprehensive and informative, evidenced by map coverage across virtually all published gaps, discovery of new ones, and characterization of sequence misassemblies; all totalling ~14 Mb. Furthermore, since optical maps are ordered restriction maps, identified discordances are pinpointed on a reliable physical scaffold providing an independent resource for closure of gaps and rectification of misassemblies.Conclusion: Analysis of sequence and optical mapping data effectively validates genome sequence assemblies constructed from large, repeat-rich genomes. Given this conclusion we envision new applications of such single molecule analysis that will merge advantages offered by high-resolution optical maps with inexpensive, but short sequence reads generated by emerging sequencing platforms. Lastly, map construction techniques presented here points the way to new types of comparative genome analysis that would focus on discernment of structural differences revealed by optical maps constructed from a broad range of rice subspecies and varieties.

12 October 2017 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
BTBenjamin Tovar
Benjamin Tovar
RSRafael Ferreira Da Silva
Rafael Ferreira Da Silva
GJGideon Juve
Gideon Juve
EDEwa Deelman
Ewa Deelman
WAWilliam Allcock
William Allcock
MLMiron Livny
Miron Livny
The user of a computing facility must make a critical decision when submitting jobs for execution: how many resources (such as cores, memory, and disk) should be requested for each job If the request is too small, the job may fail due to resource exhaustion; if the request is too big, the job may succeed, but resources will be wasted. This decision is especially important when running hundreds of thousands of jobs in a high throughput workflow, which may exhibit complex, long tailed distributions of resource consumption. In this paper, we present a strategy for solving the job sizing problem: (1) applications are monitored and measured in user-space as they run; (2) the resource usage is collected into an online archive; and (3) jobs are automatically sized according to historical data in order to maximize throughput or minimize waste. We evaluate the solution analytically, and present case studies of applying the technique to high throughput physics and bioinformatics workflows consisting of hundreds of thousands of jobs, demonstrating an increase in throughput of 10-400 percent compared to naive approaches.

1 July 1994 in Journal of Intelligent Information Systems
Verified
Journal Article
Closed access
PDF file
EHEben M. Haber
Eben M. Haber
YIYannis E. Ioannidis
Yannis E. Ioannidis
MLMiron Livny
Miron Livny

5 May 2016 in Journal of Biomedical Semantics
Verified
Journal Article
Open access
PDF file
MYMasashi Yokochi
Masashi Yokochi
NKNaohiro Kobayashi
Naohiro Kobayashi
EUEldon L. Ulrich
Eldon L. Ulrich
AKAkira R. Kinjo
Akira R. Kinjo
TITakeshi Iwata
Takeshi Iwata
TFToshimichi Fujiwara
Toshimichi Fujiwara
The nuclear magnetic resonance (NMR) spectroscopic data for biological macromolecules archived at the BioMagResBank (BMRB) provide a rich resource of biophysical information at atomic resolution. The NMR data archived in NMR-STAR ASCII format have been implemented in a relational database. However, it is still fairly difficult for users to retrieve data from the NMR-STAR files or the relational database in association with data from other biological databases. To enhance the interoperability of the BMRB database, we present a full conversion of BMRB entries to two standard structured data formats, XML and RDF, as common open representations of the NMR-STAR data. Moreover, a SPARQL endpoint has been deployed. The described case study demonstrates that a simple query of the SPARQL endpoints of the BMRB, UniProt, and Online Mendelian Inheritance in Man (OMIM), can be used in NMR and structure-based analysis of proteins combined with information of single nucleotide polymorphisms (SNPs) and their phenotypes. We have developed BMRB/XML and BMRB/RDF and demonstrate their use in performing a federated SPARQL query linking the BMRB to other databases through standard semantic web technologies. This will facilitate data exchange across diverse information resources.

1 January 2015 in Procedia Computer Science
Verified
Journal Article
Open access
RSRafael Ferreira Da Silva
Rafael Ferreira Da Silva
MRMats Rynge
Mats Rynge
GJGideon Juve
Gideon Juve
ISIgor Sfiligoi
Igor Sfiligoi
EDEwa Deelman
Ewa Deelman
MLMiron Livny
Miron Livny
High throughput computing (HTC) has aided the scientific community in the analysis of vast amounts of data and computational jobs in distributed environments. To manage these large workloads, several systems have been developed to efficiently allocate and provide access to distributed resources. Many of these systems rely on job characteristics estimates (e.g., job runtime) to characterize the workload behavior, which in practice is hard to obtain. In this work, we perform an exploratory analysis of the CMS experiment workload using the statistical recursive partitioning method and conditional inference trees to identify patterns that characterize particular behaviors of the workload. We then propose an estimation process to predict job characteristics based on the collected data. Experimental results show that our process es-timates job runtime with 75% of accuracy on average, and produces nearly optimal predictions for disk and memory consumption

12 November 2019
Verified
Conference Paper
Open access
PDF file
AWAlex Zeng Wang
Alex Zeng Wang
JCJay Chan
Jay Chan
WGWen Guan
Wen Guan
SSShaojun Sun
Shaojun Sun
SWSau Lan Wu
Sau Lan Wu
AMAlberto Di Meglio
Alberto Di Meglio
The ambitious HL-LHC program will require enormous computing resources in the next two decades. A burning question is whether quantum computer can solve the ever growing demand of computing resources in High Energy Physics in general and physics at LHC in particular.Using IBM Quantum Computer Simulators and Quantum Computer Hardware, we have successfully employed the Quantum Support Vector Machine Method (QSVM) for a ttH (H to two photons), Higgs coupling to top quarks analysis at LHC.