scholarly journals Scaling Properties of the Mean Multiplicity and Pseudorapidity Density in e−+e+, e±+p, p( p ¯ )+p, p+A and A+A(B) Collisions

Universe ◽  
2018 ◽  
Vol 4 (1) ◽  
pp. 22 ◽  
Author(s):  
Roy Lacey ◽  
Peifeng Liu ◽  
Niseem Magdy ◽  
Máté Csanád ◽  
Benjamin Schweid ◽  
...  
2006 ◽  
Author(s):  
David B. Helmer ◽  
Lester K. Su

This paper presents quantitative imaging measurements of jet fluid mole fraction fields in turbulent buoyant jets of helium issuing into air. The measurements use planar laser Rayleigh scattering. Signal levels are low, necessitating a novel approach to background subtraction in the signal processing. The jet flows considered are classified as momentum-driven, meaning that buoyancy effects are presumed to be confined to the small scales of the flow. We focus here on the near-nozzle, developing region of the jet, which is of particular interest to flows with combustion. The results suggest that buoyancy affects the details of the evolution of the mixing field even while the mean field maintains scaling properties consistent with non-buoyant jets. Specifically, the mean jet fluid mole fraction profiles show a sharper jet/ambient fluid interface relative to non-buoyant jets. The mole fraction fluctuations within the jet are also weaker than those reported in non-buoyant jets. These results will inform ongoing efforts to model the mixing process in flows with density differences, such as combustion systems.


2000 ◽  
Vol 14 (09) ◽  
pp. 983-991
Author(s):  
GUOCE ZHUANG ◽  
JIAFU WANG ◽  
WEI WANG

The reversible cluster–cluster aggregation processes in compact cluster systems are studied via a scaling argument and Monte Carlo simulations. To describe the detail effects of fragmentations from tree-like fractal to compact clusters a relative breakup probability [Formula: see text] with an exponent β is introduced. The mean-field rate equation and numerical simulation results indicate that the critical exponent y, which is defined as <s (k, ∞)> ~ k-y, has a value of (α + ξ - β + 2)-1. It is shown that the scaling properties of the cluster size distributions are determined by the selections of the exponents α, β and ξ.


Fractals ◽  
2018 ◽  
Vol 26 (06) ◽  
pp. 1850095 ◽  
Author(s):  
MEIFENG DAI ◽  
HUIJIA CHI ◽  
XIANBIN WU ◽  
YUE ZONG ◽  
WENJING FENG ◽  
...  

Complex networks are omnipresent in science and in our real life, and have been the focus of intense interest. It is vital to research the impact of their characters on the dynamic progress occurring on complex networks for weight-dependent walk. In this paper, we first consider the weight-dependent walk on one kind of transfractal (or fractal) which is named the weighted transfractal [Formula: see text]-flowers. And we pay attention to the first return time (FRT). We mainly calculate the mean and variance of FRT for a prescribed hub (i.e. the most concerned nodes) in virtue of exact probability generating function and its properties. Then, we obtain the mean and the secondary moment of the first return time. Finally, using the relationship among the variance, mean and the secondary moment, we obtain the variance of FRT and the scaling properties of the mean and variance of FRT on weighted transfractals [Formula: see text]-flowers.


2014 ◽  
Vol 51 (01) ◽  
pp. 106-117
Author(s):  
Antar Bandyopadhyay ◽  
Farkhondeh Sajadi

In this work we consider the mean-field traveling salesman problem, where the intercity distances are taken to be independent and identically distributed with some distribution F. We consider the simplest approximation algorithm, namely, the nearest-neighbor algorithm, where the rule is to move to the nearest nonvisited city. We show that the limiting behavior of the total length of the nearest-neighbor tour depends on the scaling properties of the density of F at 0 and derive the limits for all possible cases of general F.


Stroke ◽  
2019 ◽  
Vol 50 (12) ◽  
pp. 3643-3646 ◽  
Author(s):  
Lisa A. Simpson ◽  
Amanda Mow ◽  
Carlo Menon ◽  
Janice J. Eng

Background and Purpose— A reliable measure of movement repetitions is required to assist in determining the optimal dose for maximizing upper limb recovery after stroke. This study investigated the ability of a new wearable device to capture reach-to-grasp repetitions in individuals with stroke. Methods— Eight individuals with stroke wore an instrumented wrist bracelet while completing 12 upper limb activities. Participants completed 5 and 10 repetitions of each activity on 2 separate sessions (time 1 and time 2) and completed clinical assessments (Fugl-Meyer Upper Extremity Assessment and Action Research Arm Test). Mean reach-to-grasp counts (ie, hand counts) were compared across activities. Scaling properties were assessed by the ratio of 10 repetitions to 5 repetitions for the activities (ie, expected value of 2). Bland-Altman diagrams were used to examine agreement between time 1 and time 2 counts. Results— The wrist bracelet averaged 0 to 0.6 hand counts per repetition for the arm-only and hand-only activities and averaged 1 to 2 counts per repetition of the reach-to-grasp activities. The mean ratio of 10 repetition to 5 repetition counts was ≈2 for all of the reach-to-grasp activities. Mean differences from time 1 to time 2 were <0.3 counts/repetition for all activities except one. Conclusions— These preliminary results provide evidence that the wrist bracelet is able to capture hand counts over a variety of tasks in a consistent manner. This wrist bracelet could be further developed as a tool to record dose of upper limb practice for research or clinical practice, as well as providing motivation and accountability to patients participating in treatments requiring upper limb movement repetitions. Currently, there are limitations in interpreting the impact of impairment and common compensatory movements on hand counts, and it would be valuable for future studies to explore these effects.


1990 ◽  
Vol 05 (06) ◽  
pp. 1093-1121 ◽  
Author(s):  
JACQUES DISTLER ◽  
ZVONIMIR HLOUSEK ◽  
HIKARU KAWAI

In this paper we compute exactly, using the scaling properties of the Liouville theory, the Hausdorff dimension of the continuous random surfaces of Polyakov for D≤1. We find that for D<1, the mean square size of the surface grows as a logarithm of the area of the surface as well as the area of the surface raised to a power, the power being minus the string susceptibility. For D=1 the behavior changes, as expected, because the model undergoes a phase transition. In that case we find that the mean square size of the surface behaves as a combination of terms that grow as a logarithm of the area as well as its square, in qualitative agreement with the results of numerical experiments in discrete models.


2014 ◽  
Vol 51 (1) ◽  
pp. 106-117
Author(s):  
Antar Bandyopadhyay ◽  
Farkhondeh Sajadi

In this work we consider the mean-field traveling salesman problem, where the intercity distances are taken to be independent and identically distributed with some distribution F. We consider the simplest approximation algorithm, namely, the nearest-neighbor algorithm, where the rule is to move to the nearest nonvisited city. We show that the limiting behavior of the total length of the nearest-neighbor tour depends on the scaling properties of the density of F at 0 and derive the limits for all possible cases of general F.


2007 ◽  
Vol 16 (06) ◽  
pp. 1765-1771
Author(s):  
B. K. SINGH ◽  
FU-HU LIU ◽  
G. SINGH

Pseudorapidity density distributions of relativistic charged particles produced in 28 Si -induced interactions in nuclear emulsion at JINR Synchrophasotron have been measured. The particle distributions in minimum-bias events exhibit a pronounced forward asymmetry with respect to the peak in the pseudorapidity spectra. The effect of intranuclear collisions on the mean pseudorapidity distribution versus the shower particles (ns) or the grey particles is discussed and compared with similar studies of 28 Si and 32 S at BNL AGS and CERN SPS energies respectively.


1994 ◽  
Vol 1 (2/3) ◽  
pp. 156-167 ◽  
Author(s):  
R. F. Cahalan

Abstract. If climate models produced clouds having liquid water amounts close to those observed, they would compute a mean albedo that is often much too large, due to the treatment of clouds as plane-parallel. An approximate lower-bound for this "plane-parallel albedo bias" may be obtained from a fractal model having a range of optical thicknesses similar to those observed in marine stratocumulus, since they are more nearly plane-parallel than most other cloud types. We review and extend results from a model which produces a distribution of liquid water path having a lognormal-like probability density and a power-law wavenumber spectrum, with parameters determined by stratocumulus observations. As the spectral exponent approaches -1, the simulated cloud approaches a well-known multifractal, referred to as the "singular model", but when the exponent is -5/3, similar to what is observed, the cloud exhibits qualitatively different scaling properties, the socalled "bounded model". The mean albedo for bounded cascade clouds is a function of a fractal parameter, 0 << 1, as well as the usual plane-parallel parameters such as single scattering albedo, asymmetry, solar zenith angle, and mean vertical optical thickness. A simple expression is derived to determine from the variance of the logarithm of the vertically-integrated liquid water. The albedo is shown to be approximated well by the plane-parallel albedo of a cloud having an "effective" vertical optical thickness, smaller than the mean thickness by a factor χ(f), which is given as an analytic function of f. California stratocumulus have a mean fractal parameter (f) ≈ 0.5, relative albedo bias of 15%, and an effective thickness 30% smaller than the mean thickness (χ ≈ 0.7). For typical observed values of mean liquid water and (f), the effective thickness approximation gives a plane-parallel albedo within 3% of the mean albedo.


2014 ◽  
Vol 51 (01) ◽  
pp. 106-117
Author(s):  
Antar Bandyopadhyay ◽  
Farkhondeh Sajadi

In this work we consider the mean-field traveling salesman problem, where the intercity distances are taken to be independent and identically distributed with some distribution F. We consider the simplest approximation algorithm, namely, the nearest-neighbor algorithm, where the rule is to move to the nearest nonvisited city. We show that the limiting behavior of the total length of the nearest-neighbor tour depends on the scaling properties of the density of F at 0 and derive the limits for all possible cases of general F.


Sign in / Sign up

Export Citation Format

Share Document