Miron Livny
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Miron Livny has a total of 50 co-authors. Here are the top co-authors by number of shared publications:
D Bradley
University of Wisconsin Madison WI USA
2 shared publications- Ewa Deelman
Information Sciences Institute, University of Southern California, Los Angeles, CA, USA
2 shared publications - Igor Sfiligoi
Fermilab, Batavia, IL 60510, USA
2 shared publications - Rafael Ferreira da Silva
Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
2 shared publications - Sechang Son
Computer Science Department, University of Wisconsin
2 shared publications A Mohapatra
University of Wisconsin Madison WI USA
1 shared publication
Latest Publications
- Open Access
- 12 November 2019
- Published by Sissa Medialab Srl
- Vol. 367, 049
Application of Quantum Machine Learning to High Energy Physics Analysis at LHC using IBM Quantum Computer Simulators and IBM Quantum Computer Hardware
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.
- 12 November 2019
- Published by Sissa Medialab Srl
- Vol. 367, 049
Open AccessApplication of Quantum Machine Learning to High Energy Physics Analysis at LHC using IBM Quantum Computer Simulators and IBM Quantum Computer Hardware
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.
- Open Access
- 12 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 29 (2) , 240-253
A Job Sizing Strategy for High-Throughput Scientific Workflows
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.
- 12 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 29 (2) , 240-253
Open AccessA Job Sizing Strategy for High-Throughput Scientific Workflows
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.
- Open Access
- 5 May 2016
- Published by Springer Nature in Journal of Biomedical Semantics
- Vol. 7 (1) , 1-4
Publication of nuclear magnetic resonance experimental data with semantic web technology and the application thereof to biomedical research of proteins
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.
- 5 May 2016
- Published by Springer Nature in Journal of Biomedical Semantics
- Vol. 7 (1) , 1-4
Open AccessPublication of nuclear magnetic resonance experimental data with semantic web technology and the application thereof to biomedical research of proteins
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.
- Open Access
- 1 January 2015
- Published by Elsevier in Procedia Computer Science
- Vol. 51, 39-48
Characterizing a High Throughput Computing Workload: The Compact Muon Solenoid (CMS) Experiment at LHC
- 1 January 2015
- Published by Elsevier in Procedia Computer Science
- Vol. 51, 39-48
Open AccessCharacterizing a High Throughput Computing Workload: The Compact Muon Solenoid (CMS) Experiment at LHC
- Open Access
- 1 April 2010
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 219 (7) , 072053
Pseudo-interactive monitoring in distributed computing
Distributed computing, and in particular Grid computing, enables physicists to use thousands of CPU days worth of computing every day, by submitting thousands of compute jobs. Unfortunately, a small fraction of such jobs regularly fail; the reasons vary from disk and network problems to bugs in the user code. A subset of these failures result in jobs being stuck for long periods of time. In order to debug such failures, interactive monitoring is highly desirable; users need to browse through the job log files and check the status of the running processes. Batch systems typically don't provide such services; at best, users get job logs at job termination, and even this may not be possible if the job is stuck in an infinite loop. In this paper we present a novel approach of using regular batch system capabilities of Condor to enable users to access the logs and processes of any running job. This does not provide true interactive access, so commands like vi are not viable, but it does allow operations like ls, cat, top, ps, lsof, netstat and dumping the stack of any process owned by the user; we call this pseudo-interactive monitoring. It is worth noting that the same method can be used to monitor Grid jobs in a glidein-based environment. We further believe that the same mechanism could be applied to many other batch systems.
- 1 April 2010
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 219 (7) , 072053
Open AccessPseudo-interactive monitoring in distributed computing
Distributed computing, and in particular Grid computing, enables physicists to use thousands of CPU days worth of computing every day, by submitting thousands of compute jobs. Unfortunately, a small fraction of such jobs regularly fail; the reasons vary from disk and network problems to bugs in the user code. A subset of these failures result in jobs being stuck for long periods of time. In order to debug such failures, interactive monitoring is highly desirable; users need to browse through the job log files and check the status of the running processes. Batch systems typically don't provide such services; at best, users get job logs at job termination, and even this may not be possible if the job is stuck in an infinite loop. In this paper we present a novel approach of using regular batch system capabilities of Condor to enable users to access the logs and processes of any running job. This does not provide true interactive access, so commands like vi are not viable, but it does allow operations like ls, cat, top, ps, lsof, netstat and dumping the stack of any process owned by the user; we call this pseudo-interactive monitoring. It is worth noting that the same method can be used to monitor Grid jobs in a glidein-based environment. We further believe that the same mechanism could be applied to many other batch systems.
- Open Access
- 1 April 2010
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 219 (6) , 062035
Condor enhancements for a rapid-response adaptive computing environment for LHC
- 1 April 2010
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 219 (6) , 062035
Open AccessCondor enhancements for a rapid-response adaptive computing environment for LHC
- Open Access
- 15 August 2007
- Published by Springer Nature in BMC Genomics
- Vol. 8 (1) , 278
Validation of rice genome sequence by optical mapping
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.
- 15 August 2007
- Published by Springer Nature in BMC Genomics
- Vol. 8 (1) , 278
Open AccessValidation of rice genome sequence by optical mapping
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.
- 1 September 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2005 IEEE International Conference on Cluster Computing
- No. 15525244,p. 1-10
A Generic Proxy Mechanism for Secure Middlebox Traversal
Firewalls/NATs have brought significant connectivity problems along with their benefits, causing many applications to break or become inefficient. Due to its bi-directional communication, huge scale, and multi-organizational nature, the grid may be one of the areas damaged most by the connectivity problem. Several ideas to deal with the connectivity problem were investigated and many systems are available. However, many issues still remain unanswered. Most systems are firewall/NAT unfriendly and are considered harmful to network security; the tussle between these devices trying to investigate pay loads and applications trying to protect their content from observation and modification must be reconciled. This paper discusses how a simple relay-based system, called XRAY (middlebox traversal by relaying), deals with these issues and provides other benefits such as flexible traffic control. This paper also discusses how relay-based traversal systems can help applications to communicate over firewalls/NATs and also complement firewall/NAT operations to help network security
- 1 September 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2005 IEEE International Conference on Cluster Computing
- No. 15525244,p. 1-10
A Generic Proxy Mechanism for Secure Middlebox Traversal
Firewalls/NATs have brought significant connectivity problems along with their benefits, causing many applications to break or become inefficient. Due to its bi-directional communication, huge scale, and multi-organizational nature, the grid may be one of the areas damaged most by the connectivity problem. Several ideas to deal with the connectivity problem were investigated and many systems are available. However, many issues still remain unanswered. Most systems are firewall/NAT unfriendly and are considered harmful to network security; the tussle between these devices trying to investigate pay loads and applications trying to protect their content from observation and modification must be reconciled. This paper discusses how a simple relay-based system, called XRAY (middlebox traversal by relaying), deals with these issues and provides other benefits such as flexible traffic control. This paper also discusses how relay-based traversal systems can help applications to communicate over firewalls/NATs and also complement firewall/NAT operations to help network security
- 1 January 2005
- Published by Elsevier in Advances in Parallel Computing
- Vol. 14, 105-128
Data placement in widely distributed environments
- 1 January 2005
- Published by Elsevier in Advances in Parallel Computing
- Vol. 14, 105-128
Data placement in widely distributed environments
- 1 July 1994
- Published by Springer Nature in Journal of Intelligent Information Systems
- Vol. 3 (3-4) , 263-298
Foundations of visual metaphors for schema display
- 1 July 1994
- Published by Springer Nature in Journal of Intelligent Information Systems
- Vol. 3 (3-4) , 263-298
Foundations of visual metaphors for schema display