Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

John S. Conery

dblp:06/5715 · DBLP profile ↗
← Back
11ranked-venue papers
5as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 1 first-authorTheory of computation · 3 · 1 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

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%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 77% Concurrent programming · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

Topics — the 6 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
computational neuroscience
0.012003
Circuit Optimization Predicts Dynamic Network for Chemosensory Orientation in the Nematode C. elegans · NIPS 2003
Bioinformatics and computational biology
population genetics
0.011999
Genetic Simulation Library · Bioinform. 1999
Bioinformatics and computational biology
bioinformatics workflow
0.012005
Rule-based workflow management for bioinformatics · VLDB J. 2005
Mathematical optimization › combinatorial optimization
network optimization
0.012003
Circuit Optimization Predicts Dynamic Network for Chemosensory Orientation in the Nematode C. elegans · NIPS 2003
Bioinformatics and computational biology
genomics
0.011999
Genetic Simulation Library · Bioinform. 1999
Programming languages and type systems
logic programming
0.011983
AND Parallelism in Logic Programs · IJCAI 1983

Methods — techniques the papers use, named apart from their topics

object-oriented programming · 0.0
YearPublicationVenuePosition
2012 Computation is Symbol Manipulation
abstract
Computation can be seen as symbol manipulation Indeed, a computation is a sequence of simple, well-defined steps that can lead to the solution of a problem. The problem itself must be defined exactly and unambiguously, and each step in the computation that solves the problem must be described in very specific terms.
John S. Conery
Comput. J.1
2006 Clustered Neural Dynamics Identify Motifs for Chemotaxis in Caenorhabditis elegans
abstract
Although anatomical connectivity of the nematode Caenorhabditis elegans has been almost completely described, determination of the neurophysiological basis of behavior is just beginning. Here, we performed a stochastic search to determine neural network parameters sufficient for a model worm to exhibit chemotaxis, a form of spatial orientation behavior in which turning probability is modulated by the rate of change of chemical concentration. To better comprehend network solutions, we developed a novel method (Neural Dynamic Clustering) to identify neural dynamic motifs. We identified two types of motifs, one of which had been previously identified, and validated the behavior generated by the motifs against experimental chemotaxis.
Nathan A. Dunn, Jonathan T. Pierce-Shimomura, John S. Conery, Shawn R. Lockery
IJCNN3
2005 Rule-based workflow management for bioinformatics
John S. Conery, Julian Catchen, Michael Lynch
VLDB J.1
2003 A neural network model for chemotaxis in Caenorhabditis elegans
abstract
In Caenorhabditis elegans, spatial orientation behavior in a chemical gradient (chemotaxis) involves bouts of turning (pirouettes) modulated by the change in concentration of attractant. Ablation of identified neurons has delineated a candidate neural network for chemotaxis in C. elegans. The aim of our research is to generate testable models of how the network computes behavioral state and consequently, turning frequency, in response to changes in concentration. We were able to train neural networks to exhibit known chemotaxis rules using experimental data from chemotaxing C. elegans. The resultant network solutions involved three to five dynamically contributing neurons. Here we have analyzed the three neuron solutions and found three distinguishing features: a fast excitatory and delayed inhibitory connection, which acts as a differentiator; self-connections, which act to regulate neural response speed similar to synaptic time-constants; and recurrent inhibitory connections, which regulate second order network response characteristics. We plan to use this model to predict and interpret the results of laser ablations of neurons and genetic mutation in the C. elegans chemotaxis network.
Nathan A. Dunn, John S. Conery, Shawn R. Lockery
IJCNN2
2003 Circuit Optimization Predicts Dynamic Network for Chemosensory Orientation in the Nematode C. elegans
Nathan A. Dunn, John S. Conery, Shawn R. Lockery
NIPS2
1999 Genetic Simulation Library
abstract
SUMMARY: The Genetic Simulation Library (GSL) is a set of C++ programs and classes that can be used in individual-based simulation models of plant and animal populations. The classes in this library build representations of genes for a wide variety of different types of organisms, from asexually reproducing single-cell organisms to chromosome-structured sexually reproducing species. AVAILABILITY: http://www.csi.uoregon.edu/projects/genetics/GSL . Free for non-commercial applications; others should contact the author.
John S. Conery, Michael Lynch
Bioinform.1
1992 An Abstract Interpretation Scheme for Groundedness, Freeness, and Sharing Analysis of Logic Programs
Renganathan Sundararajan, John S. Conery
FSTTCS2
1990 Architected Failure Handling for AND-Parallel Logic Programs
David M. Meyer, John S. Conery
ICLP2
1987 Implementing Backward Execution in Non-Deterministic AND-Parallel Systems
John S. Conery
ICLP1
1985 Parallelism in AI Programs
Dennis F. Kibler, John S. Conery
IJCAI2
1983 AND Parallelism in Logic Programs
John S. Conery, Dennis F. Kibler
IJCAI1