基于云环境的分布式软件接口自动化测试

软件测试是保证软件质量,提供可靠服务的重要技术手段。目前基于Web Service的分布式软件越来越多,其测试技术手段也越来越受到关注。Web Service的分布性和多样性使手工测试变得非常低效,因而需要不断提高Web Service测试的自动化程度。另外,云计算因其计算成本低、可伸缩性强的特点为自动化测试提供了新的支持环境。本文结合Web Service的测试需求,首次提出了基于云环境的Web Service接口自动化测试的技术框架,分析了框架内原子Web Service、组合Web Service测试的关键技术,并研发了基于CloudStack云平台的自动化测试的原型系统。实验结果表明,本文所提出的基于云平台的WebService自动化测试方案可行且提高了测试效率。     

Intracellular Entropy‐Driven Multi‐Bit DNA Computing for Tumor Progression Discrimination

Tumor progressions such as metastasis are complicated events that involve abnormal expression of different miRNAs and enzymes. Monitoring these biomolecules in live cells with computational DNA nanotechnology may enable discrimination of tumor progression via digital outputs. Herein, we report intracellular entropy‐driven multivalent DNA circuits to implement multi‐bit computing for simultaneous analysis of intracellular telomerase and microRNAs including miR‐21 and miR‐31. These three biomolecules can trigger respective DNA strand displacement recycling reactions for signal amplification. They are visualized by fluorescence imaging, and their signal outputs are encoded as multi‐bit binary codes for different cell types. The results can discriminate non‐tumorigenic, malignant and metastatic breast cells as well as respective tumors. This DNA computing circuit is further performed in a microfluidic chip to differentiate rare co‐cultured cells, which holds a potential for the analysis of clinical samples.     

A minimization version of a directed subgraph homeomorphism problem

We consider a special case of the directed subgraph homeomorphism or topological minor problem, where the host graph has a specific regular structure. Given an acyclic directed pattern graph, we are looking for a host graph of minimal height which still allows for an embedding. This problem has applications in compiler design for certain coarse-grain reconfigurable architectures. In this application domain, the task is to simultaneously schedule, bind and route a so-called data-flow graph, where vertices represent operations and arcs stand for data dependencies between the operations, given an orthogonal grid structure of reconfigurable processing elements (PEs) that have restricted communication abilities. We show that the problem of simultaneously scheduling, binding and routing is NP-complete by describing a logic engine reduction from NAE-3-SAT. This result holds even when the input graph is a directed tree with maximum indegree two. We also give a |V|^3/2-approximation algorithm. J. A. Brenner’s research supported by the DFG Research Center Matheon “Mathematics for key technologies”. J. C. van der Veen’s research supported by DFG Focus Program 1148, “Reconfigurable Architectures”, Grants FE 407/8-1 and FE 407/8-2.     

Topological structure preserving numerical simulations of dynamical models

This paper brings together two methods producing numerical solutions with a statement of their quality — the nonstandard finite difference method and the method of validated computing. It deals with the construction and the analysis of reliable numerical discretizations of dynamical systems by employing these two techniques. An epidemiological model is used as a model example for their combined application.     

Parallel preconditioned conjugate gradient algorithm on GPU

We propose a parallel implementation of the Preconditioned Conjugate Gradient algorithm on a GPU platform. The preconditioning matrix is an approximate inverse derived from the SSOR preconditioner. Used through sparse matrix–vector multiplication, the proposed preconditioner is well suited for the massively parallel GPU architecture. As compared to CPU implementation of the conjugate gradient algorithm, our GPU preconditioned conjugate gradient implementation is up to 10 times faster (8 times faster at worst).     

Coupled Navier–Stokes—Molecular dynamics simulations using a multi‐physics flow simulation framework

Simulation of nano‐scale channel flows using a coupled Navier–Stokes/Molecular Dynamics (MD) method is presented. The flow cases serve as examples of the application of a multi‐physics computational framework put forward in this work. The framework employs a set of (partially) overlapping sub‐domains in which different levels of physical modelling are used to describe the flow. This way, numerical simulations based on the Navier–Stokes equations can be extended to flows in which the continuum and/or Newtonian flow assumptions break down in regions of the domain, by locally increasing the level of detail in the model. Then, the use of multiple levels of physical modelling can reduce the overall computational cost for a given level of fidelity. The present work describes the structure of a parallel computational framework for such simulations, including details of a Navier–Stokes/MD coupling, the convergence behaviour of coupled simulations as well as the parallel implementation. For the cases considered here, micro‐scale MD problems are constructed to provide viscous stresses for the Navier–Stokes equations. The first problem is the planar Poiseuille flow, for which the viscous fluxes on each cell face in the finite‐volume discretization are evaluated using MD. The second example deals with fully developed three‐dimensional channel flow, with molecular level modelling of the shear stresses in a group of cells in the domain corners. An important aspect in using shear stresses evaluated with MD in Navier–Stokes simulations is the scatter in the data due to the sampling of a finite ensemble over a limited interval. In the coupled simulations, this prevents the convergence of the system in terms of the reduction of the norm of the residual vector of the finite‐volume discretization of the macro‐domain. Solutions to this problem are discussed in the present work, along with an analysis of the effect of number of realizations and sample duration. The averaging of the apparent viscosity for each cell face, i.e. the ratio of the shear stress predicted from MD and the imposed velocity gradient, over a number of macro‐scale time steps is shown to be a simple but effective method to reach a good level of convergence of the coupled system. Finally, the parallel efficiency of the developed method is demonstrated. Copyright © 2009 John Wiley & Sons, Ltd.     

Solid structures in a highly agitated bed of granular materials

A series of experiments are described in which bubbles and solid structures are produced in a highly agitated bed of vertically shaken granular materials. To identify the physical mechanisms behind bubbling, three-dimensional simulations of the aforementioned systems are performed on a graphics processing unit (GPU). The gas dynamics above and within shaken granular materials is solved using large-eddy simulations (LES) while the dynamics of grains is described through molecular dynamics. Here, the interaction between the grain surfaces is modeled using the generalized form of contact theory developed by Hertz. In addition, the coefficient of kinetic friction is assumed to depend on the relative velocity of slipping. The results show both a qualitative and a quantitative agreement between simulations and experiments. They imply that the instantaneous formation and failure of granular aggregates could play an important role in the nucleation, growth, departure and collapse of bubbles in shaken granular materials. This promising effort in GPU computing may position the GPU as a compelling future alternative to traditional simulation techniques.     

一种A da95分布计算的实现模型

在研究 Ａｄａ９５ 分布计算语义的基础上,提出了一个支持 Ａｄａ９５ 的分布计算的实现模型 并讨论了在该环境下实现 Ａｄａ９５ 分布计算所存在的问题和解决方法,以及如何实现非 Ａｄａ９５ 分布计算语义的 Ａｄａ 程序的分布并行计算的问题对于后者,着重讨论了远程会合的实现问题     

可拆分有调整时间的平行机排序问题的一个算法

考虑有独立调整时间的同型号平行机排序问题,极小化最迟完工时间,产品允许拆分,同一产品被拆分后各部分可以在不同机器上同时加工,该问题是ＮＰ－ｈａｒｄ问题。本文首先给出该问题的一个启发式算法ＭＬ,然后证明了其最坏情况估计不超过７／４－１／ｍ（ｍ≥２）。