Abstract The study aimed to explore the correlation of diameter and blood flow velocity internal jugular vein with preoperative volume in elderly patients providence for rapid evaluation ultrasound patients. Thirty over 65 years old were recruited study. Patient’s central venous pressure (CVP) was recorded before anesthesia. maximum (Dmax) minimum (Dmin) left measured by M type respiratory vari...

I give three different arguments for an upper critical dimension dmax > 3 above which the 1941 Kolmogorov mean field theory becomes essentially exact, and anomalous scaling vanishes. The first argument concerns the number of degrees of freedom in a turbulent flow and indicates that dmax = 4. The second argument is a naive estimate of dangerous fluctuations, and also suggests that dmax = 4. The ...

Two experiments are described that are designed to investigate what determines the maximum spatial displacement detectable sdmaxd for spatially broadband patterns exposed in a two-frame motion sequence. In experiment 1, dmax was found to be 1.63 times greater for a two-dimensional (2-D) broadband random pattern with a 1yf Fourier amplitude spectrum (equal contrast in each octave) than for a 2-D...

The star valency of a graph G is the minimum, over all star decompositions , of the maximum number of elements in incident with a vertex. The maximum average degree of G, denoted by dmax-ave(G), is the maximum average degree of all subgraphs of G. In this paper, we prove that the star valency of G is either dmax-ave(G)=2 or dmax-ave(G)=2 +1, and provide a polynomial time algorithm for determini...

Two-frame random-element kinematograms were used to study the matching algorithm employed by the visual system to keep track of moving elements. Previous data have shown that the maximum spatial displacement detectable (dmax) for random-dot kinematogram stimuli increases both with increasing dot size and with decreasing centre frequency for spatially band-pass kinematograms. Both of these findi...

In this paper, we propose a new algorithm for computing recursive closures. The main idea behind this algorithm is tree labeling and graph decomposition, based on which the transitive closure of a directed graph can be computed in O(e⋅dmax⋅dout) time and in O(n⋅dmax⋅dout) space, where n is the number of the nodes of the graph, e is the numbers of the edges, dmax is the maximal indegree of the n...

The determination of shear strength parameters for coarse granular materials such as rockfill and waste rocks is challenging due to their oversized particles the minimum required ratio 10 between specimen width (W) maximum particle size (dmax) tested samples direct tests. To overcome this problem, a common practice prepare test by excluding particles. This method called scalping scaling down te...

We study a variant of quantum hypothesis testing wherein an additional ‘inconclusive’ measurement outcome is added, allowing one to abstain from attempting discriminate the hypotheses. The error probabilities are then conditioned on successful attempt, with inconclusive trials disregarded. completely characterise this task in both single-shot and asymptotic regimes, providing exact formulas for...