Demo Data from VLDB 2026 / reviewers in the wild / expert
Joshua Colvin
dblp:25/7066
· DBLP profile ↗
5ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0001-5938-3059ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 4 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
3 papers |
Bioinformatics and computational biology · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
High-performance computing · 50% Cloud and datacenter computing · 50% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
markov chain monte carlo |
0.6 | 1 | 2022 | Implementation of a practical Markov chain Monte Carlo sampling algorithm in PyBioNetFit · Bioinform. 2022 |
Bioinformatics and computational biology › systems biology
parameter estimation |
0.2 | 1 | 2016 | BioNetFit: a fitting tool compatible with BioNetGen, NFsim and distributed computing environments · Bioinform. 2016 |
Cloud and datacenter computing › cluster resource management and scheduling
cluster scheduling |
0.2 | 1 | 2016 | BioNetFit: a fitting tool compatible with BioNetGen, NFsim and distributed computing environments · Bioinform. 2016 |
High-performance computing › scientific computing
distributed scientific computing |
0.2 | 1 | 2016 | BioNetFit: a fitting tool compatible with BioNetGen, NFsim and distributed computing environments · Bioinform. 2016 |
Bioinformatics and computational biology
systems biology |
0.1 | 1 | 2009 | Simulation of large-scale rule-based models · Bioinform. 2009 |
Methods — techniques the papers use, named apart from their topics
markov chain monte carlo · 0.6bayesian inference · 0.6adaptive metropolis · 0.6rule-based simulation · 0.5parameter optimization · 0.5null-event algorithm · 0.1bionetgen language · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Implementation of a practical Markov chain Monte Carlo sampling algorithm in PyBioNetFitabstractSUMMARY: Bayesian inference in biological modeling commonly relies on Markov chain Monte Carlo (MCMC) sampling of a multidimensional and non-Gaussian posterior distribution that is not analytically tractable. Here, we present the implementation of a practical MCMC method in the open-source software package PyBioNetFit (PyBNF), which is designed to support parameterization of mathematical models for biological systems. The new MCMC method, am, incorporates an adaptive move proposal distribution. For warm starts, sampling can be initiated at a specified location in parameter space and with a multivariate Gaussian proposal distribution defined initially by a specified covariance matrix. Multiple chains can be generated in parallel using a computer cluster. We demonstrate that am can be used to successfully solve real-world Bayesian inference problems, including forecasting of new Coronavirus Disease 2019 case detection with Bayesian quantification of forecast uncertainty. AVAILABILITY AND IMPLEMENTATION: PyBNF version 1.1.9, the first stable release with am, is available at PyPI and can be installed using the pip package-management system on platforms that have a working installation of Python 3. PyBNF relies on libRoadRunner and BioNetGen for simulations (e.g. numerical integration of ordinary differential equations defined in SBML or BNGL files) and Dask.Distributed for task scheduling on Linux computer clusters. The Python source code can be freely downloaded/cloned from GitHub and used and modified under terms of the BSD-3 license (https://github.com/lanl/pybnf). Online documentation covering installation/usage is available (https://pybnf.readthedocs.io/en/latest/). A tutorial video is available on YouTube (https://www.youtube.com/watch?v=2aRqpqFOiS4&t=63s). SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Jacob Neumann, Abhishek Mallela, Ely F. Miller, Joshua Colvin, Abell T. Duprat, William S. Hlavacek, Richard G. Posner |
Bioinform. | 5 |
| 2016 | BioNetFit: a fitting tool compatible with BioNetGen, NFsim and distributed computing environmentsabstractUNLABELLED: Rule-based models are analyzed with specialized simulators, such as those provided by the BioNetGen and NFsim open-source software packages. Here, we present BioNetFit, a general-purpose fitting tool that is compatible with BioNetGen and NFsim. BioNetFit is designed to take advantage of distributed computing resources. This feature facilitates fitting (i.e. optimization of parameter values for consistency with data) when simulations are computationally expensive. AVAILABILITY AND IMPLEMENTATION: BioNetFit can be used on stand-alone Mac, Windows/Cygwin, and Linux platforms and on Linux-based clusters running SLURM, Torque/PBS, or SGE. The BioNetFit source code (Perl) is freely available (http://bionetfit.nau.edu). SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. CONTACT: [email protected]. Brandon R. Thomas, Lily A. Chylek, Joshua Colvin, Suman Sirimulla, Andrew H. A. Clayton, William S. Hlavacek, Richard G. Posner |
Bioinform. | 3 |
| 2010 | RuleMonkey: software for stochastic simulation of rule-based modelsabstractBACKGROUND: The system-level dynamics of many molecular interactions, particularly protein-protein interactions, can be conveniently represented using reaction rules, which can be specified using model-specification languages, such as the BioNetGen language (BNGL). A set of rules implicitly defines a (bio)chemical reaction network. The reaction network implied by a set of rules is often very large, and as a result, generation of the network implied by rules tends to be computationally expensive. Moreover, the cost of many commonly used methods for simulating network dynamics is a function of network size. Together these factors have limited application of the rule-based modeling approach. Recently, several methods for simulating rule-based models have been developed that avoid the expensive step of network generation. The cost of these "network-free" simulation methods is independent of the number of reactions implied by rules. Software implementing such methods is now needed for the simulation and analysis of rule-based models of biochemical systems. RESULTS: Here, we present a software tool called RuleMonkey, which implements a network-free method for simulation of rule-based models that is similar to Gillespie's method. The method is suitable for rule-based models that can be encoded in BNGL, including models with rules that have global application conditions, such as rules for intramolecular association reactions. In addition, the method is rejection free, unlike other network-free methods that introduce null events, i.e., steps in the simulation procedure that do not change the state of the reaction system being simulated. We verify that RuleMonkey produces correct simulation results, and we compare its performance against DYNSTOC, another BNGL-compliant tool for network-free simulation of rule-based models. We also compare RuleMonkey against problem-specific codes implementing network-free simulation methods. CONCLUSIONS: RuleMonkey enables the simulation of rule-based models for which the underlying reaction networks are large. It is typically faster than DYNSTOC for benchmark problems that we have examined. RuleMonkey is freely available as a stand-alone application http://public.tgen.org/rulemonkey. It is also available as a simulation engine within GetBonNie, a web-based environment for building, analyzing and sharing rule-based models. Joshua Colvin, Michael I. Monine, Ryan N. Gutenkunst, William S. Hlavacek, Daniel D. Von Hoff, Richard G. Posner |
BMC Bioinform. | 1 |
| 2009 | Simulation of large-scale rule-based modelsabstractMOTIVATION: Interactions of molecules, such as signaling proteins, with multiple binding sites and/or multiple sites of post-translational covalent modification can be modeled using reaction rules. Rules comprehensively, but implicitly, define the individual chemical species and reactions that molecular interactions can potentially generate. Although rules can be automatically processed to define a biochemical reaction network, the network implied by a set of rules is often too large to generate completely or to simulate using conventional procedures. To address this problem, we present DYNSTOC, a general-purpose tool for simulating rule-based models. RESULTS: DYNSTOC implements a null-event algorithm for simulating chemical reactions in a homogenous reaction compartment. The simulation method does not require that a reaction network be specified explicitly in advance, but rather takes advantage of the availability of the reaction rules in a rule-based specification of a network to determine if a randomly selected set of molecular components participates in a reaction during a time step. DYNSTOC reads reaction rules written in the BioNetGen language which is useful for modeling protein-protein interactions involved in signal transduction. The method of DYNSTOC is closely related to that of StochSim. DYNSTOC differs from StochSim by allowing for model specification in terms of BNGL, which extends the range of protein complexes that can be considered in a model. DYNSTOC enables the simulation of rule-based models that cannot be simulated by conventional methods. We demonstrate the ability of DYNSTOC to simulate models accounting for multisite phosphorylation and multivalent binding processes that are characterized by large numbers of reactions. AVAILABILITY: DYNSTOC is free for non-commercial use. The C source code, supporting documentation and example input files are available at http://public.tgen.org/dynstoc/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Joshua Colvin, Michael I. Monine, James R. Faeder, William S. Hlavacek, Daniel D. Von Hoff, Richard G. Posner |
Bioinform. | 1 |
| 1999 | Hardware implementation of a neural network pattern shaper algorithmabstractElectrical stimulation can be used to activate paralyzed muscles for the purpose of restoring motor functions such as stepping in individuals with spinal cord injury. Due to the variability observed in the responses of electrically stimulated muscles, several adaptive control techniques have been developed. The pattern shaper (PS) is an adaptive neural network that has been tested in a software implementation and has been shown to be capable of automatically generating cyclic patterns that are customized for an individual. The results of these tests are encouraging, but implementation of the real-time algorithm currently requires a dedicated PC. The purpose of this research is to develop a hardware implementation of a digital PS neural network to generate the electrical signals to stimulate muscles in individuals with spinal cord injury. We have implemented the pattern shaper algorithm in hardware by mapping the digital logic circuit to a field programmable gate array (FPGA), developed a user interface to input data to the FPGA from a computer, and constructed a wire-wrapped board to implement the PS in hardware for use in clinical tests. This hardware implementation is a step towards the development of low-power, portable, adaptive controller that can be used in electrical stimulation systems. Elizabeth J. Brauer, James J. Abbas, Brian Callaway, Joshua Colvin, John Farris |
IJCNN | 4 |