933 resultados para Critical Points
Resumo:
We examine the exclusion limits set by the CDF and D0 experiments on the Standard Model Higgs boson mass from their searches at the Tevatron in the light of large theoretical uncertainties on the signal and background cross sections. We show that when these uncertainties are consistently taken into account, the sensitivity of the experiments becomes significantly lower and the currently excluded mass range M-H = 158-175 GeV could be entirely reopened. The necessary luminosity required to recover the current sensitivity is found to be a factor of two higher than the present one. (C) 2011 Elsevier B.V. All rights reserved.
Resumo:
Vibrational phase relaxation near gas-liquid and liquid-solid phase coexistence has been studied by molecular dynamics simulations of N-N stretch in N-2. Experimentally observed pronounced insensitivity of phase relaxation from the triple point to beyond the boiling point is found to originate from a competition between density relaxation and resonant-energy transfer terms. The sharp rise in relaxation rate near the critical point (CP) can be attributed at least partly to the sharp, rise in vibration-rotation coupling contribution. Substantial subquadratic quantum number dependence of overtone dephasing rate is found near the CP and in supercritical fluids. [S0031-9007 (99)09318-7].
Resumo:
Finite element analyses of a long hollow cylinder having an axisymmetric circumferential internal edge crack, subjected to convective cooling on the inner surface are performed. The transient thermal stress intensity factor is estimated using a domain version of the J-integral method. The effect of the thickness of the cylinder, crack length, and heat transfer coefficient on the stress intensity factor history are studied. The variations of critical normalized stress intensity factor with crack length-to-thickness ratio for different parameters are presented. The results show that if a small inner surface crack begins to grow, its stress intensity factor will increase with increase in crack length, reach a maximum, and then begin to drop. Based on the results, a fracture-based design methodology for cracked hollow pipes under transient thermal loads is discussed.
Resumo:
The stability of fluid flow past a membrane of infinitesimal thickness is analysed in the limit of zero Reynolds number using linear and weakly nonlinear analyses. The system consists of two Newtonian fluids of thickness R* and H R*, separated by an infinitesimally thick membrane, which is flat in the unperturbed state. The dynamics of the membrane is described by its normal displacement from the flat state, as well as a surface displacement field which provides the displacement of material points from their steady-state positions due to the tangential stress exerted by the fluid flow. The surface stress in the membrane (force per unit length) contains an elastic component proportional to the strain along the surface of the membrane, and a viscous component proportional to the strain rate. The linear analysis reveals that the fluctuations become unstable in the long-wave (alpha --> 0) limit when the non-dimensional strain rate in the fluid exceeds a critical value Lambda(t), and this critical value increases proportional to alpha(2) in this limit. Here, alpha is the dimensionless wavenumber of the perturbations scaled by the inverse of the fluid thickness R*(-1), and the dimensionless strain rate is given by Lambda(t) = ((gamma) over dot* R*eta*/Gamma*), where eta* is the fluid viscosity, Gamma* is the tension of the membrane and (gamma) over dot* is the strain rate in the fluid. The weakly nonlinear stability analysis shows that perturbations are supercritically stable in the alpha --> 0 limit.
Resumo:
In this paper, a method of tracking the peak power in a wind energy conversion system (WECS) is proposed, which is independent of the turbine parameters and air density. The algorithm searches for the peak power by varying the speed in the desired direction. The generator is operated in the speed control mode with the speed reference being dynamically modified in accordance with the magnitude and direction of change of active power. The peak power points in the P-omega curve correspond to dP/domega = 0. This fact is made use of in the optimum point search algorithm. The generator considered is a wound rotor induction machine whose stator is connected directly to the grid and the rotor is fed through back-to-back pulse-width-modulation (PWM) converters. Stator flux-oriented vector control is applied to control the active and reactive current loops independently. The turbine characteristics are generated by a dc motor fed from a commercial dc drive. All of the control loops are executed by a single-chip digital signal processor (DSP) controller TMS320F240. Experimental results show that the performance of the control algorithm compares well with the conventional torque control method.
Resumo:
Results of a study of dc magnetization M(T,H), performed on a Nd(0.6)Pb(0.4)MnO(3) single crystal in the temperature range around T(C) (Curie temperature) which embraces the supposed critical region \epsilon\=\T-T(C)\/T(C)less than or equal to0.05 are reported. The magnetic data analyzed in the critical region using the Kouvel-Fisher method give the values for the T(C)=156.47+/-0.06 K and the critical exponents beta=0.374+/-0.006 (from the temperature dependence of magnetization) and gamma=1.329+/-0.003 (from the temperature dependence of initial susceptibility). The critical isotherm M(T(C),H) gives delta=4.54+/-0.10. Thus the scaling law gamma+beta=deltabeta is fulfilled. The critical exponents obey the single scaling equation of state M(H,epsilon)=epsilon(beta)f(+/-)(H/epsilon(beta+gamma)), where f(+) for T>T(C) and f(-) for T
Resumo:
The critical micelle concentration (CMC) of several surfactants that contain an NLO chromophore, either at the hydrocarbon tail, or at the hydrophilic headgroup, or even as a counterion, was determined by hyper-Rayleigh scattering (HRS). In all cases, the HRS signal exhibited a similar variation with surfactant concentration, wherein the CMC is inferred from a rather unprecedented drop in the signal intensity. This drop is attributed to the formation of small pre-micellar aggregates, whose concentrations become negligible above CMC. In addition, a probe molecule, which upon protonation yielded a species with significantly enhanced HRS intensity, was developed and its utility for the determination of the CIVIC of simple fatty acids was demonstrated.
Resumo:
In Saccharomyces cerevisiae, Prp17p is required for the efficient completion of the second step of pre-mRNA splicing. The function and interacting factors for this protein have not been elucidated. We have performed a mutational analysis of yPrp17p to identify protein domains critical for function. A series of deletions were made throughout the region spanning the N-terminal 158 amino acids of the protein, which do not contain any identified structural motifs. The C-terminal portion (amino acids 160–455) contains a WD domain containing seven WD repeats. We determined that a minimal functional Prp17p consists of the WD domain and 40 amino acids N-terminal to it. We generated a three-dimensional model of the WD repeats in Prp17p based on the crystal structure of the [beta]-transducin WD domain. This model was used to identify potentially important amino acids for in vivo functional characterization. Through analysis of mutations in four different loops of Prp17p that lie between [beta] strands in the WD repeats, we have identified four amino acids, 235TETG238, that are critical for function. These amino acids are predicted to be surface exposed and may be involved in interactions that are important for splicing. Temperature-sensitive prp17 alleles with mutations of these four amino acids are defective for the second step of splicing and are synthetically lethal with a U5 snRNA loop I mutation, which is also required for the second step of splicing. These data reinforce the functional significance of this region within the WD domain of Prp17p in the second step of splicing.
Resumo:
Given two independent Poisson point processes ©(1);©(2) in Rd, the AB Poisson Boolean model is the graph with points of ©(1) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centred at these points contains at least one point of ©(2). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d ¸ 2 and derive bounds for a critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and cn in the unit cube. The AB random geometric graph is de¯ned as above but with balls of radius r. We derive a weak law result for the largest nearest neighbour distance and almost sure asymptotic bounds for the connectivity threshold.
Resumo:
Current-voltage (I-V) characteristics of quench condensed, superconducting, ultrathin Bi films in a magnetic field are reported. These I-V's show hysteresis for all films, grown both with and without thin Ge underlayers. Films on Ge underlayers, close to superconductor-insulator transition, show a peak in the critical current, indicating a structural transformation of the vortex solid. These underlayers, used to make the films more homogeneous, are found to be more effective in pinning the vortices. The upper critical fields (B-c2) of these films are determined from the resistive transitions in perpendicular magnetic field. The temperature dependence of the upper critical field is found to differ significantly from Ginzburg-Landau theory, after modifications for disorder.
Resumo:
Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and lower energy consumption. The memory architecture of the embedded system strongly influences critical system design objectives like area, power and performance. Hence the embedded system designer performs a complete memory architecture exploration to custom design a memory architecture for a given set of applications. Further, the designer would be interested in multiple optimal design points to address various market segments. However, tight time-to-market constraints enforces short design cycle time. In this paper we address the multi-level multi-objective memory architecture exploration problem through a combination of exhaustive-search based memory exploration at the outer level and a two step based integrated data layout for SPRAM-Cache based architectures at the inner level. We present a two step integrated approach for data layout for SPRAM-Cache based hybrid architectures with the first step as data-partitioning that partitions data between SPRAM and Cache, and the second step is the cache conscious data layout. We formulate the cache-conscious data layout as a graph partitioning problem and show that our approach gives up to 34% improvement over an existing approach and also optimizes the off-chip memory address space. We experimented our approach with 3 embedded multimedia applications and our approach explores several hundred memory configurations for each application, yielding several optimal design points in a few hours of computation on a standard desktop.
Resumo:
Compiler optimizations need precise and scalable analyses to discover program properties. We propose a partially flow-sensitive framework that tries to draw on the scalability of flow-insensitive algorithms while providing more precision at some specific program points. Provided with a set of critical nodes — basic blocks at which more precise information is desired — our partially flow-sensitive algorithm computes a reduced control-flow graph by collapsing some sets of non-critical nodes. The algorithm is more scalable than a fully flow-sensitive one as, assuming that the number of critical nodes is small, the reduced flow-graph is much smaller than the original flow-graph. At the same time, a much more precise information is obtained at certain program points than would had been obtained from a flow-insensitive algorithm.
Resumo:
A geometric and non parametric procedure for testing if two finite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that determines if a strictly positive point h > 0 exists in the range of a matrix A (related to the points in the two finite sets). The algorithm proposed in the paper iteratively checks if a strictly positive point exists in a subspace by projecting a strictly positive vector with equal co-ordinates (p), on the subspace. At the end of each iteration, the subspace is reduced to a lower dimensional subspace. The test is completed within r ≤ min(n, d + 1) steps, for both linearly separable and non separable problems (r is the rank of A, n is the number of points and d is the dimension of the space containing the points). The worst case time complexity of the algorithm is O(nr3) and space complexity of the algorithm is O(nd). A small review of some of the prominent algorithms and their time complexities is included. The worst case computational complexity of our algorithm is lower than the worst case computational complexity of Simplex, Perceptron, Support Vector Machine and Convex Hull Algorithms, if d