Switched (hybrid) systems have been the subject of numerous studies in modern control theory This paper introduces the notion of switched Discrete Event Systems (s-DES) and investigates its representational and comput...
详细信息
With the exponential growth in the application of the HILIC technique, there has been a significant progress in understanding the fundamental aspects of hydrophilic interaction chromatography. The experimental studies...
详细信息
With the exponential growth in the application of the HILIC technique, there has been a significant progress in understanding the fundamental aspects of hydrophilic interaction chromatography. The experimental studies tend to be more extensive in terms of the number of stationary phases investigated and the number of probe compounds employed in comparison with the earlier studies;and more theoretical studies in quantitative structure retention relationship (QSRR) and molecular dynamics simulations have also been published and provide molecular-level insights into the retention mechanism. This review focuses on the recent progress in understanding the retention mechanism, retention models, selectivity, and the kinetic performance of HILIC. A better understanding of these fundamental aspects will undoubtedly facilitate more applications of this chromatographic technique in a wider range of fields.
IN this paper we present a parallel algorithm for FIR (Finite Impulse Response) filter computation based on Engineering and Scientific Computation Accelerator (ESCA) System. ESCA is a heterogeneous multi-core architec...
详细信息
In the single-source shortest path (SSSP) problem, we have to find the shortest paths from a source vertex v to all other vertices in a graph. In this paper, we introduce a novel parallel algorithm, derived from the B...
详细信息
ISBN:
(纸本)9780769552071
In the single-source shortest path (SSSP) problem, we have to find the shortest paths from a source vertex v to all other vertices in a graph. In this paper, we introduce a novel parallel algorithm, derived from the Bellman-Ford and Delta-stepping algorithms. We employ various pruning techniques, such as edge classification and direction-optimization, to dramatically reduce inter-node communication traffic, and we propose load balancing strategies to handle higher-degree vertices. The extensive performance analysis shows that our algorithms work well on scale-free and real-world graphs. In the largest tested configuration, an R-MAT graph with 2(38) vertices and 2(42) edges on 32, 768 Blue Gene/Q nodes, we have achieved a processing rate of three Trillion Edges Per Second (TTEPS), a four orders of magnitude improvement over the best published results.
Results of the numerical simulation of mechanical processes occurring in biological tissues under dynamic actions are presented. The grid-characteristic method on unstructured grids is used to solve the system of equa...
详细信息
Results of the numerical simulation of mechanical processes occurring in biological tissues under dynamic actions are presented. The grid-characteristic method on unstructured grids is used to solve the system of equations of mechanics of deformable solids;this method takes into account the characteristic properties of the constitutive system of partial differential equations and produces adequate algorithms on interfaces between media and on the boundaries of integration domains.
To describe the dynamics of the relaxation process of convective diffusion under conditions of planned filtration, the authors propose a mathematical model based on the fractional derivative equation with respect to t...
详细信息
To describe the dynamics of the relaxation process of convective diffusion under conditions of planned filtration, the authors propose a mathematical model based on the fractional derivative equation with respect to time. The boundary-value problem corresponding to this model is formulated. A parallel computing algorithm based on the locally one-dimensional scheme is developed. The results of numerical implementation of the solution are presented.
Automatic result verification is an important tool to guarantee that completely inaccurate results cannot be used for decisions without getting remarked during a numerical computation. Mathematical rigor provided by v...
详细信息
Automatic result verification is an important tool to guarantee that completely inaccurate results cannot be used for decisions without getting remarked during a numerical computation. Mathematical rigor provided by verified computing allows the computation of an enclosure containing the exact solution of a given problem. Particularly, the computation of linear systems can strongly benefit from this technique in terms of reliability of results. However, in order to compute an enclosure of the exact result of a linear system, more floating-point operations are necessary, consequently increasing the execution time. In this context, parallelism appears as a good alternative to improve the solver performance. In this paper, we present an approach to solve very large dense linear systems with verified computing on clusters. This approach enabled our parallel solver to compute huge linear systems with point or interval input matrices with dimensions up to 100,000. Numerical experiments show that the new version of our parallel solver introduced in this paper provides good relative speedups and delivers a reliable enclosure of the exact results. Copyright (c) 2014 John Wiley & Sons, Ltd.
Cost estimation is crucial for optimizing the performance of parallel algorithms on distributed systems. This paper performs load analysis and cost estimation of constrained producer-consumer (CPC) parallel algorithms...
详细信息
ISBN:
(纸本)9781479955480
Cost estimation is crucial for optimizing the performance of parallel algorithms on distributed systems. This paper performs load analysis and cost estimation of constrained producer-consumer (CPC) parallel algorithms. In CPC algorithms, the computation is performed by classes of nodes (tasks), separated in time. For any given CPC problem, the cost can be modelled as a linear combination of computational imbalance components and a communication load. These components can be determined from analysis of the inter-task communication of the algorithm.
We develop the theory of 2-quivers and quiver 2-categories to run in parallel with the classical theory of quiver algebras. A quiver 2-category is always finitary, and, conversely, every finitary 2-category will be bi...
详细信息
We develop the theory of 2-quivers and quiver 2-categories to run in parallel with the classical theory of quiver algebras. A quiver 2-category is always finitary, and, conversely, every finitary 2-category will be bi-equivalent with a quiver 2-category for a unique underlying reduced 2-quiver. As an application, we produce an example of a fiat 2-category, one of whose Duflo involutions is not self-adjoint.
My research focuses on methods to analyze and mine large datasets as well as their practical realizations and applications. The key question of interest to me is: How can we effectively and efficiently distill useful ...
详细信息
My research focuses on methods to analyze and mine large datasets as well as their practical realizations and applications. The key question of interest to me is: How can we effectively and efficiently distill useful information from large, complex, and potentially noisy datasets? To approach this question, we are developing systems for scalable data analysis and data mining, for working with incomplete and noisy data, for data-intensive optimization, as well as for extracting structured information from natural-language text. This article highlights some of my work in these areas.
暂无评论