The value of high-throughput genomic research is dramatically enhanced by association with key patient data. These data are generally available but of disparate quality and not typically directly associated. A system ...
详细信息
The value of high-throughput genomic research is dramatically enhanced by association with key patient data. These data are generally available but of disparate quality and not typically directly associated. A system that could bring these disparate data sources into a common resource connected with functional genomic data would be tremendously advantageous. However, the integration of clinical and accurate interpretation of the generated functional genomic data requires the development of information management systems capable of effectively capturing the data as well as tools to make that data accessible to the laboratory scientist or to the clinician. In this review these challenges and current information technology solutions associated with the management, storage and analysis of high-throughput data are highlighted. It is suggested that the development of a pharmacogenomic data management system which integrates public and proprietary databases, clinical datasets, and data mining tools embedded in a high-performance computing environment should include the following components: parallel processing systems, storage technologies, network technologies, databases and database management systems (DBMS), and application services.
In this paper we describe the application of a parallel implementation of the implicit filtering algorithm to a control problem from hydrology. We seek to control the temperature at a group of drinking water wells by ...
详细信息
In this paper we describe the application of a parallel implementation of the implicit filtering algorithm to a control problem from hydrology. We seek to control the temperature at a group of drinking water wells by placing barrier wells between the drinking water wells and a well that injects heated water from an industrial site.
This paper addresses a modified dynamic programming parallel algorithm, and its associated architecture of temporal and spatial complexity of O(N), with N number of processing elements involved in computation. The mod...
详细信息
ISBN:
(纸本)0780376900
This paper addresses a modified dynamic programming parallel algorithm, and its associated architecture of temporal and spatial complexity of O(N), with N number of processing elements involved in computation. The modification consists of the algorithm adaptation to image interest point matching and architecture optimization. parallel algorithm simulates the designed architecture, validates it functionally, and allows temporal performance prediction. The proposed algorithm of low spatial and temporal complexities suits very well for real time on board applications (autonomous robot guidance, trajectory matching, blinds vision guidance,...).
Interconnection networks of various topologies are used in parallel computing. It is important to study the graph theoretical/combinatorial properties of the underlying networks in order to better understand them and ...
详细信息
ISBN:
(纸本)0769515797
Interconnection networks of various topologies are used in parallel computing. It is important to study the graph theoretical/combinatorial properties of the underlying networks in order to better understand them and develop more efficient parallel algorithms as well as fault-tolerant communication/routing algorithms. In this paper, we approach this problem from a new angle by looking into the spectra (eigenvalues and their multiplicities) of these networks. Eigenvalues of the adjacency matrix of a graph can reveal certain properties of the graph since they are closely related to some of its combinatorial invariants. Specifically, for some of the popular interconnection networks, we study their eigenvalues and multiplicities by (1) summarizing the currently available results;(2) deriving some of these results in a more straight forward way;(3) obtaining new results;and (4) presenting experimental results on several interconnection networks. In addition, we briefly survey the results that relate spectra of graphs to their structural properties. Although much work remains to be done, by looking into the spectra of interconnection networks, we hope to bring about a more unified approcah to studying their topological properties.
The paper describes a new stochastic heuristic algorithm for global optimization. The new optimization algorithm, called Intelligent-Particle Swarm Optimization (IPSO), offers more intelligence to particles by using c...
详细信息
The paper describes a new stochastic heuristic algorithm for global optimization. The new optimization algorithm, called Intelligent-Particle Swarm Optimization (IPSO), offers more intelligence to particles by using concepts such as: group experiences, unpleasant memories (tabu to be avoided), local landscape models based on virtual neighbors, and memetic replication of successful behavior parameters. The new individual complexity is amplified at the group level and consequently generates a more efficient optimization procedure. A simplified version of the IPSO algorithm was implemented and compared with the classical PSO algorithm for a simple test function and for the Loney's solenoid.
An optoelectronic correlator based architecture is proposed for implementing algorithms to compute trigonometric elementary functions such as sine, cosine, and tangent. We utilized the symbolic substitution technique ...
详细信息
ISBN:
(纸本)0780375734
An optoelectronic correlator based architecture is proposed for implementing algorithms to compute trigonometric elementary functions such as sine, cosine, and tangent. We utilized the symbolic substitution technique to reduce the number of the computation rules involved. The modified signed-digit (MSD) number system representation is used for computing these complex elementary functions. An arithmetic unit that performs parallel one-step addition (subtraction), multiplication, division, and square root is proposed to perform the computation of trigonometric elementary functions.
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequence of dags and linear schedules paramet...
详细信息
ISBN:
(纸本)0769515797
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequence of dags and linear schedules parameterized by n, compute a lower bound on the number of processors required by the schedule as a function of n. This problem is formulated so that the number of tasks that are scheduled for execution during any fixed time step is the number of non-negative integer solutions d(n) to a set of parametric linear Diophantine equations. Generating function methods are then used for constructing a formula for the numbers dn. We implemented this algorithm as a Mathematica program. This paper is an overview of the techniques involved and their applications to well-known schedules for Matrix-Vector Product, Triangular Matrix Product, and Gaussian Elimination dags. Some example runs and automatically produced symbolic formulas for processor lower bounds by the algorithm are given.
Observations about an approximate parallel algorithm for the Point Robot Motion Planning problem are presented The algorithm solves not only the original problem, but related problems as well.
ISBN:
(纸本)0769518672
Observations about an approximate parallel algorithm for the Point Robot Motion Planning problem are presented The algorithm solves not only the original problem, but related problems as well.
Many problems require determining the root of a real-valued function of a single variable. Maple and Marletta [6] presented a parallel algorithm that can be used to determine a simple root of such functions. High leve...
详细信息
ISBN:
(纸本)0769517315
Many problems require determining the root of a real-valued function of a single variable. Maple and Marletta [6] presented a parallel algorithm that can be used to determine a simple root of such functions. High levels of efficiency were proved for functions satisfying a set of conditions. In this work we present a framework and subsequently a piece of software to evaluate the performance of their algorithm under various conditions and for functions with varying characteristics. We also consider the effects of implementing the algorithm over a heterogeneous network, presenting results and recommendations.
Scientific, symbolic, and multimedia applications present diverse computing workloads with different types of inherent of what should be highly parallel algorithms. Retargeting to parallel mechanisms is difficult, but...
详细信息
ISBN:
(纸本)0769517994
Scientific, symbolic, and multimedia applications present diverse computing workloads with different types of inherent of what should be highly parallel algorithms. Retargeting to parallel mechanisms is difficult, but can provide significant increases in efficiency. It is desirable to estimate potential parallelism before undertaking the expensive process of reverse engineering and retargeting. This paper presents a lightweight dynamic analysis technique for characterizing the types of parallelism that are inherent in a given program to estimate the potential benefit of retargeting. The technique is validated on Spec95 and MediaBench benchmarks widely used to evaluate processor performance. Results correlate well with previous experience in parallelizing these well-understood applications.
暂无评论