123 resultados para asymptotically hyperbolic
Resumo:
A pair of semi-linear hyperbolic partial differential equations governing the slow variations in amplitude and phase of a quasi-monochromatic finite-amplitude Love-wave on an isotropic layered half-space is derived using the method of multiple-scales. The analysis of the exact solution of these equations for a signalling problem reveals that the amplitude of the wave remains constant along its characteristic and that the phase of the wave increases linearly behind the wave-front.
Resumo:
A residual-based strategy to estimate the local truncation error in a finite volume framework for steady compressible flows is proposed. This estimator, referred to as the -parameter, is derived from the imbalance arising from the use of an exact operator on the numerical solution for conservation laws. The behaviour of the residual estimator for linear and non-linear hyperbolic problems is systematically analysed. The relationship of the residual to the global error is also studied. The -parameter is used to derive a target length scale and consequently devise a suitable criterion for refinement/derefinement. This strategy, devoid of any user-defined parameters, is validated using two standard test cases involving smooth flows. A hybrid adaptive strategy based on both the error indicators and the -parameter, for flows involving shocks is also developed. Numerical studies on several compressible flow cases show that the adaptive algorithm performs excellently well in both two and three dimensions.
Resumo:
In this paper the kinematics of a weak shock front governed by a hyperbolic system of conservation laws is studied. This is used to develop a method for solving problems, involving the propagation of nonlinear unimodal waves. It consists of first solving the nonlinear wave problem by moving along the bicharacteristics of the system and then fitting the shock into this solution field, so that it satisfies the necessary jump conditions. The kinematics of the shock leads in a natural way to the definition of ldquoshock-raysrdquo, which play the same role as the ldquoraysrdquo in a continuous flow. A special case of a circular cylinder introduced suddenly in a constant streaming flow is studied in detail. The shock fitted in the upstream region propagates with a velocity which is the mean of the velocities of the linear and the nonlinear wave fronts. In the downstream the solution is given by an expansion wave.
Resumo:
Serine hydroxymethyltransferase, the first enzyme in the pathway for the interconversion of one carbon compounds was purified from mung bean seedlings by ammonium sulfate fractionation, DEAE-Sephadex, Blue Sepharose CL-6B affinity chromatography and gel filteration on Sephacryl S-200. The specific activity of the enzyme, 0.73 (u mol HCHO formed/min/mg protein) was 104 times larger than the highest value reported hitherto. Saturation of tetrahydrofolate was sigmoid, whereas with serine was hyperbolic, with nH values of 1.9 and 1.0 respectively. Reduced nicotinamide adenine dinucleotide, lysine and methionine decreased, whereas nicotinamide adenine dinucleotide, adenosine 5′-monophosphate and adenosine 5′-triphosphate increased the sigmoidicity. These results suggest that serine hydroxymethyltransferase from mung bean is a regulatory enzyme. H4folate; (±)-L-tetrahydrofolate
Resumo:
The purpose of this paper is to develop a sufficiently accurate analysis, which is much simpler than exact three-dimensional analysis, for statics and dynamics of composite laminates. The governing differential equations and boundary conditions are derived by following a variational approach. The displacements are assumed piecewise linear across the thickness and the effects of transverse shear deformations and rotary inertia are included. A procedure for obtaining the general solution of the above governing differential equations in the form of hyperbolic-trigonometric series is given. The accuracy of the present theory is assessed by obtaining results for free vibrations and flexure of simply supported rectangular laminates and comparing them with results from exact three-dimensional analysis.
Resumo:
The motion due to an oscillatory point source in a rotating stratified fluid has been studied by Sarma & Naidu (1972) by using threefold Fourier transforms. The solution obtained by them in the hyperbolic case is wrong since they did not make use of any radiation condition, which is always necessary to get the correct solution. Whenever the motion is created by a source, the condition of radiation is that the sources must remain sources, not sinks of energy and no energy may be radiated from infinity into the prescribed singularities of the field. The purpose of the present note is to explain how Lighthill's (1960) radiation condition can be applied in the hyperbolic case to pick the correct solution. Further, the solution thus obtained is reiterated by an alternative procedure using Sommerfeld's (1964) radiation condition.
Resumo:
5,10-Methylenetetrahydrofolate reductase (EC 1.1.1.68) was purified from the cytosolic fraction of sheep liver by (NH4)2 SO4 fractionation, acid precipitation, DEAE-Sephacel chromatography and Blue Sepharose affinity chromatography. The homogeneity of the enzyme was established by sodium dodecyl sulphate-polyacrylamide gel electrophoresis, ultracentrifugation and Ouchterlony immunodiffusion test. The enzyme was a dimer of molecular weight 1,66,000 ± 5,000 with a subunit molecular weight of 87,000 ±5,000. The enzyme showed hyperbolic saturation pattern with 5-methyltetrahydrofolate.K 0.5 values for 5-methyltetrahydrofolate menadione and NADPH were determined to be 132 ΜM, 2.45 ΜM and 16 ΜM. The parallel set of lines in the Lineweaver-Burk plot, when either NADPH or menadione was varied at different fixed concentrations of the other substrate; non-competitive inhibition, when NADPH was varied at different fixed concentrations of NADP; competitive inhibition, when menadione was varied at different fixed concentrations of NADP and the absence of inhibition by NADP at saturating concentration of menadione, clearly established that the kinetic mechanism of the reaction catalyzed by this enzyme was ping-pong.
Resumo:
The nonlinear mode coupling between two co-directional quasi-harmonic Rayleigh surface waves on an isotropic solid is analysed using the method of multiple scales. This procedure yields a system of six semi-linear hyperbolic partial differential equations with the same principal part governing the slow variations in the (complex) amplitudes of the two fundamental, the two second harmonic and the two combination frequency waves at the second stage of the perturbation expansion. A numerical solution of these equations for excitation by monochromatic signals at two arbitrary frequencies, indicates that there is a continuous transfer of energy back and forth among the fundamental, second harmonic and combination frequency waves due to mode coupling. The mode coupling tends to be more pronounced as the frequencies of the interacting waves approach each other.
Resumo:
A systematic derivation of the approximate coupled amplitude equations governing the propagation of a quasi-monochromatic Rayleigh surface wave on an isotropic solid is presented, starting from the non-linear governing differential equations and the non-linear free-surface boundary conditions, using the method of mulitple scales. An explicit solution of these equations for a signalling problem is obtained in terms of hyperbolic functions. In the case of monochromatic excitation, it is shown that the second harmonic amplitude grows initially at the expense of the fundamental and that the amplitudes of the fundamental and second harmonic remain bounded for all time.
Resumo:
The coexistence curve of the binary liquid mixture n-heptane-acetic anhydride has been determined by the observation of the transition temperatures of 76 samples over the range of compositions. The functional form of the difference in order parameter, in terms of either the mole fraction or the volume fraction, is consistent with theoretical predictions invoking the concept of universality at critical points. The average value of the order parameter, the diameter of the coexistence curve, shows an anomaly which can be described by either an exponent 1 - a, as predicted by various theories (where a is the critical exponent of the specific heat), or by an exponent 20 (where P is the coexistence curve exponent), as expected when the order parameter used is not the one the diameter of which diverges asymptotically as 1 - a.
Resumo:
In this article, we propose a denoising algorithm to denoise a time series y(i) = x(i) + e(i), where {x(i)} is a time series obtained from a time- T map of a uniformly hyperbolic or Anosov flow, and {e(i)} a uniformly bounded sequence of independent and identically distributed (i.i.d.) random variables. Making use of observations up to time n, we create an estimate of x(i) for i<n. We show under typical limiting behaviours of the orbit and the recurrence properties of x(i), the estimation error converges to zero as n tends to infinity with probability 1.
Resumo:
A construction for a family of sequences over the 8-ary AM-PSK constellation that has maximum nontrivial correlation magnitude bounded as theta(max) less than or similar to root N is presented here. The famfly is asymptotically optimal with respect to the Welch bound on maximum magnitude of correlation. The 8-ary AM-PSK constellation is a subset of the 16-QAM constellation. We also construct two families of sequences over 16-QAM with theta(max) less than or similar to root 2 root N. These families are constructed by interleaving sets of sequences. A construction for a famBy of low-correlation sequences over QAM alphabet of size 2(2m) is presented with maximum nontrivial normalized correlation parameter bounded above by less than or similar to a root N, where N is the period of the sequences in the family and where a ranges from 1.61 in the case of 16-QAM modulation to 2.76 for large m. When used in a CDMA setting, the family will permit each user to modulate the code sequence with 2m bits of data. Interestingly, the construction permits users on the reverse link of the CDMA channel to communicate using varying data rates by switching between sequence famflies; associated to different values of the parameter m. Other features of the sequence families are improved Euclidean distance between different data symbols in comparison with PSK signaling and compatibility of the QAM sequence families with sequences belonging to the large quaternary sequence families {S(p)}.
Resumo:
The Hadwiger number eta(G) of a graph G is the largest integer n for which the complete graph K-n on n vertices is a minor of G. Hadwiger conjectured that for every graph G, eta(G) >= chi(G), where chi(G) is the chromatic number of G. In this paper, we study the Hadwiger number of the Cartesian product G square H of graphs. As the main result of this paper, we prove that eta(G(1) square G(2)) >= h root 1 (1 - o(1)) for any two graphs G(1) and G(2) with eta(G(1)) = h and eta(G(2)) = l. We show that the above lower bound is asymptotically best possible when h >= l. This asymptotically settles a question of Z. Miller (1978). As consequences of our main result, we show the following: 1. Let G be a connected graph. Let G = G(1) square G(2) square ... square G(k) be the ( unique) prime factorization of G. Then G satisfies Hadwiger's conjecture if k >= 2 log log chi(G) + c', where c' is a constant. This improves the 2 log chi(G) + 3 bound in [2] 2. Let G(1) and G(2) be two graphs such that chi(G1) >= chi(G2) >= clog(1.5)(chi(G(1))), where c is a constant. Then G1 square G2 satisfies Hadwiger's conjecture. 3. Hadwiger's conjecture is true for G(d) (Cartesian product of G taken d times) for every graph G and every d >= 2. This settles a question by Chandran and Sivadasan [2]. ( They had shown that the Hadiwger's conjecture is true for G(d) if d >= 3).
Resumo:
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.
Resumo:
We consider a multicommodity flow problem on a complete graph whose edges have random, independent, and identically distributed capacities. We show that, as the number of nodes tends to infinity, the maximumutility, given by the average of a concave function of each commodity How, has an almost-sure limit. Furthermore, the asymptotically optimal flow uses only direct and two-hop paths, and can be obtained in a distributed manner.