Search PubMed⌕ Search

SEARCH · Search PubMed

Results for “computational frameworks”

Search indexed PubMed citations on genomics, clinical trials, systematic reviews and public health. Explore titles, authors and supplied subject terms, then open the PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,513 records · Page 84Linked to original sources

Thresholds as a unifying theme in regulatory toxicology.

The scientific basis for the US Food and Drug Administration (FDA) threshold of regulation is discussed in relation to its toxicological testing recommendations for food contact substances and the existing methods it employs for exposure estimation. A case is made that the FDA's threshold of regulation is a natural extension of its toxicity testing regime. The genetic toxicity tests recommended in the exposure-based toxicological testing framework for food contact substances are examined regarding their ability to predict positively carcinogens of varying potency. In addition, the computational toxicology program MULTICASE v. 3.1 is also examined for its ability to predict positively carcinogens of varying potency. It is concluded that MULTICASE can provide equivalent results to genetic toxicity tests at the lowest dietary concentrations.

Carcinogenicity Tests↗

Distance-driven projection and backprojection in three dimensions.

Projection and backprojection are operations that arise frequently in tomographic imaging. Recently, we proposed a new method for projection and backprojection, which we call distance-driven, and that offers low arithmetic cost and a highly sequential memory access pattern. Furthermore, distance-driven projection and backprojection avoid several artefact-inducing approximations characteristic of some other methods. We have previously demonstrated the application of this method to parallel and fan beam geometries. In this paper, we extend the distance-driven framework to three dimensions and demonstrate its application to cone beam reconstruction. We also present experimental results to demonstrate the computational performance, the artefact characteristics and the noise-resolution characteristics of the distance-driven method in three dimensions.

Algorithms↗

Pairwise alignment of protein interaction networks.

With an ever-increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discovery of conserved patterns in these networks becomes an important problem. Although available data on protein-protein interactions is currently limited, recently developed algorithms have been shown to convey novel biological insights through employment of elegant mathematical models. The main challenge in aligning PPI networks is to define a graph theoretical measure of similarity between graph structures that captures underlying biological phenomena accurately. In this respect, modeling of conservation and divergence of interactions, as well as the interpretation of resulting alignments, are important design parameters. In this paper, we develop a framework for comprehensive alignment of PPI networks, which is inspired by duplication/divergence models that focus on understanding the evolution of protein interactions. We propose a mathematical model that extends the concepts of match, mismatch, and gap in sequence alignment to that of match, mismatch, and duplication in network alignment and evaluates similarity between graph structures through a scoring function that accounts for evolutionary events. By relying on evolutionary models, the proposed framework facilitates interpretation of resulting alignments in terms of not only conservation but also divergence of modularity in PPI networks. Furthermore, as in the case of sequence alignment, our model allows flexibility in adjusting parameters to quantify underlying evolutionary relationships. Based on the proposed model, we formulate PPI network alignment as an optimization problem and present fast algorithms to solve this problem. Detailed experimental results from an implementation of the proposed framework show that our algorithm is able to discover conserved interaction patterns very effectively, in terms of both accuracies and computational cost.

Algorithms↗

The Pathway Tools cellular overview diagram and Omics Viewer.

The Pathway Tools cellular overview diagram is a visual representation of the biochemical network of an organism. The overview is automatically created from a Pathway/Genome Database describing that organism. The cellular overview includes metabolic, transport and signaling pathways, and other membrane and periplasmic proteins. Pathway Tools supports interrogation and exploration of cellular biochemical networks through the overview diagram. Furthermore, a software component called the Omics Viewer provides visual analysis of whole-organism datasets using the overview diagram as an organizing framework. For example, gene expression and metabolomics measurements, alone or in combination, can be painted onto the overview, as can computed whole-organism datasets, such as predicted reaction-flux values. The cellular overview and Omics Viewer provide a mechanism whereby biologists can apply the pattern-recognition capabilities of the human visual system to analyze large-scale datasets in a biologically meaningful context. SRI's BioCyc.org website provides overview diagrams for more than 200 organisms. This article describes enhancements to the overview made since a 1999 publication, including the automatic layout capability, expansion of the cellular machinery that it includes, new semantic zooming and poster-generating capabilities, and extension of the Omics Viewer to support painting of metabolites, animations and zooming to individual pathway diagrams.

Computer Graphics↗

Ten rural women living with fibromyalgia tell it like it is.

The purpose of this qualitative study was to gain an understanding of the personal experiences of 10 rural women dealing with fibromyalgia based on the theoretical frameworks of adaptation to chronic illness and social support. The data were gathered from a nursing intervention that provided computer-based peer support and encouragement. The women described themes of pain, fatigue, depression, and sleep disturbances; expressed views on the experience of rural isolation; and shared positive philosophies of dealing with this disease. With this understanding, professionals and significant others can compassionately respond to the needs of sufferers of fibromyalgia.

Adaptation, Psychological↗

Does a single zealot affect an infinite group of voters?

A method for studying the exact properties of a class of inhomogeneous stochastic many-body systems is developed and presented in the framework of a voter model perturbed by the presence of a "zealot," an individual allowed to favor an "opinion." We compute exactly the magnetization of this model and find that in one (1D) and two dimensions (2D) it evolves, algebraically ( approximately t(-1/2)) in 1D and much slower ( approximately 1/ln(t) in 2D, towards the unanimity state chosen by the zealot. In higher dimensions the stationary magnetization is no longer uniform: the zealot cannot influence all the individuals. The implications to other physical problems are also pointed out.

Behavior↗

N-(6-Amino-3,4-dihydro-3-methyl-5-nitroso-4-oxopyrimidin-2-yl) derivatives of glycine, valine, serine, threonine and methionine: interplay of molecular, molecular-electronic and supramolecular structures.

In each of N-(6-amino-3, 4-dihydro-3-methyl-5-nitroso-4-oxopyrimidin-2-yl)valine, C(10)H(15)N(5)O(4) (3) (orthorhombic, P2(1)2(1)2(1)), N-(6-amino-3, 4-dihydro-3-methyl-5-nitroso-4-oxopyrimidin-2-yl)serine monohydrate, C(8)H(11)N(5)O(5).H(2)O (4) (orthorhombic, P2(1)2(1)2(1)), and N-(6-amino-3, 4-dihydro-3-methyl-5-nitroso-4-oxopyrimidin-2-yl)threonine, C(9)H(13)N(5)O(5)(5) (monoclinic, P2(1)), the C-nitroso fragments exhibit almost equal C-N and N-O bond lengths: the C-N range is 1. 315 (3)-1.329 (3) A and the N-O range is 1.293 (3)-1.326 (3) A. In each compound there are also very short intermolecular O-H.O hydrogen bonds, in which carboxyl groups act as hydrogen-bond donors to the nitrosyl O atoms: the O.O distances range from 2.440 (2) to 2. 504 (4) A and the O-H.O angles lie between 161 and 163 degrees. An interpretation of the relationship between the unusual intramolecular bond lengths and the very short intermolecular hydrogen bonds has been developed based on database analysis and computational modelling. In each of (3)-(5) there is an extensive network of intermolecular hydrogen bonds, generating three-dimensional frameworks in (3) and (5), and two-dimensional sheets in (4).

Journal Article↗

Nonlinear system identification by m-pulse sequences: application to brainstem auditory evoked responses.

The purpose of this paper is to introduce a method for characterizing the nonlinear behavior of the auditory system. The method uses an m-pulse sequence as the stimulus and employs a general nonlinear framework for the auditory system. Like Sutter's binary m-sequence approach, the m-pulse sequence approach is computationally efficient since calculation of the first-order input-output cross-correlation function is all that is necessary for obtaining the nonlinear characteristics of the system. The nonlinear system characteristics are reflected in pulse kernels in contrast to binary kernels associated with the binary m-sequence approach. By assuming the system under study is a third-order nonlinear system, binary and pulse kernels are shown to be related to Volterra kernels. The results suggest that the m-pulse sequence can be used to study the system nonlinear effects of varying the stimulus repetition rate more effectively than conventional methods. Preliminary physiological data obtained by applying m-pulse sequences to the brainstem auditory evoked response (BAER) clearly illustrates the feasibility of obtaining replicable evoked responses using this method.

Evoked Potentials, Auditory, Brain Stem↗

Regularized reconstruction in electrical impedance tomography using a variance uniformization constraint.

This paper describes a new approach to reconstruction of the conductivity field in electrical impedance tomography. Our goal is to improve the tradeoff between the quality of the images and the numerical complexity of the reconstruction method. In order to reduce the computational load, we adopt a linearized approximation to the forward problem that describes the relationship between the unknown conductivity and the measurements. In this framework, we focus on finding a proper way to cope with the ill-posed nature of the problem, mainly caused by strong attenuation phenomena; this is done by devising regularization techniques well suited to this particular problem. First, we propose a solution which is based on Tikhonov regularization of the problem. Second, we introduce an original regularized reconstruction method in which the regularization matrix is determined by space-uniformization of the variance of the reconstructed condictivities. Both methods are nonsupervised, i.e., all tuning parameters are automatically determined from the measured data. Tests performed on simulated and real data indicate that Tikhonov regularization provides results similar to those obtained with iterative methods, but with a much smaller amount of computations. Regularization using a variance uniformization constraint yields further improvements, particularly in the central region of the unknown object where attenuation is most severe. We anticipate that the variance uniformization approach could be adapted to iterative methods that preserve the nonlinearity of the forward problem. More generally, it appears as a useful tool for solving other severely ill-posed reconstruction problems such as eddy current tomography.

Algorithms↗

Direct reconstruction of kinetic parameter images from dynamic PET data.

Our goal in this paper is the estimation of kinetic model parameters for each voxel corresponding to a dense three-dimensional (3-D) positron emission tomography (PET) image. Typically, the activity images are first reconstructed from PET sinogram frames at each measurement time, and then the kinetic parameters are estimated by fitting a model to the reconstructed time-activity response of each voxel. However, this "indirect" approach to kinetic parameter estimation tends to reduce signal-to-noise ratio (SNR) because of the requirement that the sinogram data be divided into individual time frames. In 1985, Carson and Lange proposed, but did not implement, a method based on the expectation-maximization (EM) algorithm for direct parametric reconstruction. The approach is "direct" because it estimates the optimal kinetic parameters directly from the sinogram data, without an intermediate reconstruction step. However, direct voxel-wise parametric reconstruction remained a challenge due to the unsolved complexities of inversion and spatial regularization. In this paper, we demonstrate and evaluate a new and efficient method for direct voxel-wise reconstruction of kinetic parameter images using all frames of the PET data. The direct parametric image reconstruction is formulated in a Bayesian framework, and uses the parametric iterative coordinate descent (PICD) algorithm to solve the resulting optimization problem. The PICD algorithm is computationally efficient and is implemented with spatial regularization in the domain of the physiologically relevant parameters. Our experimental simulations of a rat head imaged in a working small animal scanner indicate that direct parametric reconstruction can substantially reduce root-mean-squared error (RMSE) in the estimation of kinetic parameters, as compared to indirect methods, without appreciably increasing computation.

Algorithms↗

Data fusion and multicue data matching by diffusion maps.

Data fusion and multicue data matching are fundamental tasks of high-dimensional data analysis. In this paper, we apply the recently introduced diffusion framework to address these tasks. Our contribution is three-fold: First, we present the Laplace-Beltrami approach for computing density invariant embeddings which are essential for integrating different sources of data. Second, we describe a refinement of the Nyström extension algorithm called "geometric harmonics." We also explain how to use this tool for data assimilation. Finally, we introduce a multicue data matching scheme based on nonlinear spectral graphs alignment. The effectiveness of the presented schemes is validated by applying it to the problems of lipreading and image sequence alignment.

Algorithms↗

Anatomically based modelling of the human skull and jaw.

We present here an anatomically based model of the human masticatory system that provides a framework for simulating the complex chewing process. The initial motivation for creating this model was the desire to have a computational model of the human jaw that can be used to simulate the action of simple bites, and to calculate the stresses and forces on the teeth that are involved. The model created also provides a platform that can be used to investigate other features of the masticatory system. To construct this global model, individual models of the bones of the skull and jaw were created from generic data sets. Geometric models of the muscles of mastication were also created and attached to the appropriate bones. To complete this initial model, representations of the crowns of the teeth were created and a basic model of the temporomandibular joint (TMJ) was included. The finite element method was used to solve for the stresses and strains created by the loading conditions during a clenching simulation involving the mandible bone. The model presented here is also discussed in relation to a model of the entire musculo-skeletal system being developed as part of the Physiome Project.

Computer Simulation↗

A general probability estimation approach for neural comp.

We describe an analytical framework for the adaptations of neural systems that adapt its internal structure on the basis of subjective probabilities constructed by computation of randomly received input signals. A principled approach is provided with the key property that it defines a probability density model that allows studying the convergence of the adaptation process. In particular, the derived algorithm can be applied for approximation problems such as the estimation of probability densities or the recognition of regression functions. These approximation algorithms can be easily extended to higher-dimensional cases. Certain neural network models can be derived from our approach (e.g., topological feature maps and associative networks).

Algorithms↗

A category theoretical argument against the possibility of artificial life: Robert Rosen's central proof revisited.

One of Robert Rosen's main contributions to the scientific community is summarized in his book Life itself. There Rosen presents a theoretical framework to define living systems; given this definition, he goes on to show that living systems are not realizable in computational universes. Despite being well known and often cited, Rosen's central proof has so far not been evaluated by the scientific community. In this article we review the essence of Rosen's ideas leading up to his rejection of the possibility of real artificial life in silico. We also evaluate his arguments and point out that some of Rosen's central notions are ill defined. The conclusion of this article is that Rosen's central proof is wrong.

Artificial Intelligence↗

Canonical modeling: review of concepts with emphasis on environmental health.

The article reviews concepts of canonical modeling in the context of environmental health. Based on biochemical systems theory, the canonical approach was developed over the past thirty years and applied to complex systems primarily in biochemistry and the regulation of gene expression. Canonical modeling is based on nonlinear ordinary differential equations whose right-hand sides consist of products of power-law functions. This structure results from the linearization of complex processes in logarithmic space. The canonical structure has many intriguing features. First, almost any system of smooth functions or ordinary differential equations can be recast equivalently in a canonical model, which demonstrates that the model structure is rich enough to deal with all relevant nonlinearities. Second, a large body of successful applications suggests that canonical models are often valid and accurate representations of quite complex, real-world systems. Third, a set of guidelines supports the modeler in all phases of analysis. These guidelines address model design, algebraic and numerical analysis, and the interpretation of results. Fourth, the structure of canonical models, especially those in S-system form, facilitates algebraic and numerical analyses. Of particular importance is the derivation of steady-state solutions in an explicit symbolic or numerical form, which allows further assessments of stability and robustness. The homogeneous structure of canonical models has also led to the development of very efficient, customized computer algorithms for all steps of a typical analysis. Fifth, a surprising number of models currently used in environmental health research are special cases of canonical models. The traditional models are thus subsumed in one modeling framework, which offers new avenues of analysis and interpretation.

Algorithms↗

Methods for improving the repeatability of automated ECG analysis.

Statistically-based smoothing techniques are described which have been applied to the existing framework of the Glasgow ECG Analysis program. These methods have been designed with the aim of improving repeatability in the computer interpretation of ECGs which have been recorded either several minutes or 24 hours apart from patients in a clinically stable condition. With respect to the ECG diagnosis of Left Ventricular Hypertrophy (LVH), these flexible methods have the effect to reducing the number of inconsistent day-to-day interpretations by 36% from 33 to 21 in 330 pairs of ECGs recorded one day apart. Similarly, when comparing agreement in the diagnosis of LVH in 249 pairs of ECGs which were recorded several minutes apart, the number of discordant computer interpretations was 6 using the new methodology, compared with 13 using conventional criteria, i.e. there was a 54% reduction in disagreements.

Computer Graphics↗

A method to evaluate human spatial coordination interfaces for computer-assisted surgery.

Computer assistance for breast conserving surgery requires a guidance method to assist a surgeon in locating tumor margin accurately. A wide array of guidance methods can be considered ranging from various pictorial representations, symbolic graphical interfaces as well as those based on other sensory cues such as sound. In this study, we present an experimental framework for testing candidate guidance methods in isolation or in combination. A total of 22 guidance approaches, based on stereographic, non-stereographic, symbolic and auditory cues were tested in a simulation of breast conserving surgery. Observers were asked to circumscribe a virtual tumor with a magnetically tracked scalpel while measuring the spatial accuracy, time and the frequency with which the tumor margin was intersected. A total of 110 studies were performed with 5 volunteers. Based on these findings, we demonstrated that a single view of the tumor with a stereo presentation in conjunction with an auditory guidance cue provided the best balance of accuracy, speed and surgical integrity. This study demonstrates a practical and helpful framework for testing guidance methods in a context dependent manner.

Breast Neoplasms↗

An intelligent system for automatic detection of gastrointestinal adenomas in video endoscopy.

Today 95% of all gastrointestinal carcinomas are believed to arise from adenomas. The early detection of adenomas could prevent their evolution to cancer. A novel system for the support of the detection of adenomas in gastrointestinal video endoscopy is presented. Unlike other systems, it accepts standard low-resolution video input thus requiring less computational resources and facilitating both portability and the potential to be used in telemedicine applications. It combines intelligent processing techniques of SVMs and color-texture analysis methodologies into a sound pattern recognition framework. Concerning the system's accuracy this was measured using ROC analysis and found to exceed 94%.

Adenoma↗