Primary design of stochastic cooling in CSRm

Based on several facts of CSRrn, such as the layout of the ring, the lattice parameters, exiting Schottky noise diagnosis equipment and fund, the primary stochastic cooling design of CSRm has been carried out. The optimum cooling time and the optimum cooling bandwidth axe obtained through simulation using the cooling function. The results indicate that the stochastic cooling is quite a powerful cooling method for CSRm. The comparison of the cooling effects of stochastic cooling and electron cooling in CSR are also presented. We can conclude that the combination of the two cooling methods on CSRrn will improve the beam cooling rate and quality beam greatly.

stochastic process algebra based software process simulation modeling

Chinese Acad Sci, ISCAS Lab Internet Software Technologies

Modelling raindrop impact and splash erosion processes within a spatial cell: a stochastic approach

A new approach is proposed to simulate splash erosion on local soil surfaces. Without the effect of wind and other raindrops, the impact of free-falling raindrops was considered as an independent event from the stochastic viewpoint. The erosivity of a single raindrop depending on its kinetic energy was computed by an empirical relationship in which the kinetic energy was expressed as a power function of the equivalent diameter of the raindrop. An empirical linear function combining the kinetic energy and soil shear strength was used to estimate the impacted amount of soil particles by a single raindrop. Considering an ideal local soil surface with size of I m x I m, the expected number of received free-failing raindrops with different diameters per unit time was described by the combination of the raindrop size distribution function and the terminal velocity of raindrops. The total splash amount was seen as the sum of the impact amount by all raindrops in the rainfall event. The total splash amount per unit time was subdivided into three different components, including net splash amount, single impact amount and re-detachment amount. The re-detachment amount was obtained by a spatial geometric probability derived using the Poisson function in which overlapped impacted areas were considered. The net splash amount was defined as the mass of soil particles collected outside the splash dish. It was estimated by another spatial geometric probability in which the average splashed distance related to the median grain size of soil and effects of other impacted soil particles and other free-falling raindrops were considered. Splash experiments in artificial rainfall were carried out to validate the availability and accuracy of the model. Our simulated results suggested that the net splash amount and re-detachment amount were small parts of the total splash amount. Their proportions were 0.15% and 2.6%, respectively. The comparison of simulated data with measured data showed that this model could be applied to simulate the soil-splash process successfully and needed information of the rainfall intensity and original soil properties including initial bulk intensity, water content, median grain size and some empirical constants related to the soil surface shear strength, the raindrop size distribution function and the average splashed distance. Copyright (c) 2007 John Wiley & Sons, Ltd.

Robustness and dissipation of mitogen-activated protein kinases signal transduction network: Underlying funneled landscape against stochastic fluctuations

We uncovered the underlying energy landscape of the mitogen-activated protein kinases signal transduction cellular network by exploring the statistical natures of the Brownian dynamical trajectories. We introduce a dimensionless quantity: The robustness ratio of energy gap versus local roughness to measure the global topography of the underlying landscape. A high robustness ratio implies funneled landscape. The landscape is quite robust against environmental fluctuations and variants of the intrinsic chemical reaction rates.

Studies on three-dimensional quantitative structure-activity relationship of PDE inhibitory activity of imidazopyridines

In recent years there has been a resurgence of interest in inhibitors of cyclic nucleotide phosphodiesterases (PDE) and enzymes responsible for the intracellular hydrolysis of the second messenger cAMP and cGMP. In this study, a series of 2-substituted phenyllimidazo[4,5-b]pyridines have been made to investigate 3D-QSAR of PDE activity using CoMFA. CoMFA resulted in a quantitative description of the major steric and electrostatic field effects, and gave significant new insights to factors governing PDE inhibition activity. The model was used to predict the PDE inhibition activity of imidazopyridines with satisfactory results.

咪唑并吡啶类化合物结构及PDE抑制活性的三维构效关系研究

对咪唑并吡啶类化合物作为环核苷酸磷酸二酯酶（PDE）的抑制剂的抑制活性进行了比较分子力场分析．结果表明，立体效应和静电作用场是描述对PDE仰制活性和进行结构性能关系研究的最重要的结构参数，提出了对该类化合物进行结构修饰的方法，并由新建立的三维定量构效关系模型对该类化合物的PDE抑制活性进行了预报.

Time-dependent Hyperstar algorithm for robust vehicle navigation in time-dependent stochastic road networks.

The vehicle navigation problem studied in Bell (2009) is revisited and a time-dependent reverse Hyperstar algorithm is presented. This minimises the expected time of arrival at the destination, and all intermediate nodes, where expectation is based on a pessimistic (or risk-averse) view of unknown link delays. This may also be regarded as a hyperpath version of the Chabini and Lan (2002) algorithm, which itself is a time-dependent A* algorithm. Links are assigned undelayed travel times and maximum delays, both of which are potentially functions of the time of arrival at the respective link. The driver seeks probabilities for link use that minimise his/her maximum exposure to delay on the approach to each node, leading to the determination of the pessimistic expected time of arrival. Since the context considered is vehicle navigation where the driver is not making repeated trips, the probability of link use may be interpreted as a measure of link attractiveness, so a link with a zero probability of use is unattractive while a link with a probability of use equal to one will have no attractive alternatives. A solution algorithm is presented and proven to solve the problem provided the node potentials are feasible and a FIFO condition applies for undelayed link travel times. The paper concludes with a numerical example.

Quantum Stratonovich Stochastic Calculus and the Quantum Wong-Zakai Theorem

Gough, John, 'Quantum Stratonovich Stochastic Calculus and the Quantum Wong-Zakai Theorem', Journal of Mathematical Physics. 47, 113509, (2006)

Singular perturbation of quantum stochastic differential equations with coupling through an oscillator mode

Gough, John; Van Handel, R., (2007) 'Singular perturbation of quantum stochastic differential equations with coupling through an oscillator mode', Journal of Statistical Physics 127(3) pp.575-607 RAE2008

A stochastic approximation algorithm with step size adaptation

Plakhov, A.Y.; Cruz, P., (2004) 'A stochastic approximation algorithm with step size adaptation', Journal of Mathematical Science 120(1) pp.964-973 RAE2008

Stochastic Mesh-Based Multiview Reconstruction

A method for reconstruction of 3D polygonal models from multiple views is presented. The method uses sampling techniques to construct a texture-mapped semi-regular polygonal mesh of the object in question. Given a set of views and segmentation of the object in each view, constructive solid geometry is used to build a visual hull from silhouette prisms. The resulting polygonal mesh is simplified and subdivided to produce a semi-regular mesh. Regions of model fit inaccuracy are found by projecting the reference images onto the mesh from different views. The resulting error images for each view are used to compute a probability density function, and several points are sampled from it. Along the epipolar lines corresponding to these sampled points, photometric consistency is evaluated. The mesh surface is then pulled towards the regions of higher photometric consistency using free-form deformations. This sampling-based approach produces a photometrically consistent solution in much less time than possible with previous multi-view algorithms given arbitrary camera placement.

Stochastic Refinement of the Visual Hull to Satisfy Photometric and Silhouette Consistency Constraints

An iterative method for reconstructing a 3D polygonal mesh and color texture map from multiple views of an object is presented. In each iteration, the method first estimates a texture map given the current shape estimate. The texture map and its associated residual error image are obtained via maximum a posteriori estimation and reprojection of the multiple views into texture space. Next, the surface shape is adjusted to minimize residual error in texture space. The surface is deformed towards a photometrically-consistent solution via a series of 1D epipolar searches at randomly selected surface points. The texture space formulation has improved computational complexity over standard image-based error approaches, and allows computation of the reprojection error and uncertainty for any point on the surface. Moreover, shape adjustments can be constrained such that the recovered model's silhouette matches those of the input images. Experiments with real world imagery demonstrate the validity of the approach.

MosaicShape: Stochastic Region Grouping with Shape Prior

A novel method that combines shape-based object recognition and image segmentation is proposed for shape retrieval from images. Given a shape prior represented in a multi-scale curvature form, the proposed method identifies the target objects in images by grouping oversegmented image regions. The problem is formulated in a unified probabilistic framework and solved by a stochastic Markov Chain Monte Carlo (MCMC) mechanism. By this means, object segmentation and recognition are accomplished simultaneously. Within each sampling move during the simulation process,probabilistic region grouping operations are influenced by both the image information and the shape similarity constraint. The latter constraint is measured by a partial shape matching process. A generalized parallel algorithm by Barbu and Zhu,combined with a large sampling jump and other implementation improvements, greatly speeds up the overall stochastic process. The proposed method supports the segmentation and recognition of multiple occluded objects in images. Experimental results are provided for both synthetic and real images.