948 resultados para loss rate


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The coherent flame model uses the strain rate to predict reaction rate per unit flame surface area and some procedure that solves for the dynamics of flame surfaces to predict species distributions. The strainrate formula for the reaction rate is obtained from the analytical solution for a flame in a laminar, plane stagnation point flow. Here, the formula's effectiveness is examined by comparisons with data from a direct numerical simulation (DNS) of a round jetlike flow that undergoes transition to turbulence. Significant differences due to general flow features can be understood qualitatively: Model predictions are good in the braids between vortex rings, which are present in the near field of round jets, as the strain rate is extensional and reaction surfaces are isolated. In several other regions, the strain rate is compressive or flame surfaces are folded close together. There, the predictions are poor as the local flow no longer resembles the model flow. Quantitative comparisons showed some discrepancies. A modified, consistent application of the strain-rate solution did not show significant changes in the prediction of mean reaction rate distributions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Cardiac autonomic neuropathy is known to occur in alcoholics but the extent of its subclinical form is not usually recognized, Heart Rate Variability (HRV) analysis can detect subclinical autonomic neuropathy. In this study the HRV parameters were compared in 20 neurologically asymptomatic alcoholics, 20 age-matched normals and 16 depressives. All were males, ECG was recorded in a quiet room for four minutes in supine position. Time and Frequency domain parameters of HRV were computed by a researcher blind to clinical details. Alcoholics had significantly smaller Coefficient of Variation of R-R intervals (CVR-R) on time domain analysis and smaller HF band (0.15-0.5 Hz) power on spectral analysis. The decreased Heart Rate Variability indicates cardiac autonomic dysfunction.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A detailed investigation of viscosity dependence of the isomerization rate is carried out for continuous potentials by using a fully microscopic, self-consistent mode-coupling theory calculation of both the friction on the reactant and the viscosity of the medium. In this calculation we avoid approximating the short time response by the Enskog limit, which overestimates the friction at high frequencies. The isomerization rate is obtained by using the Grote-Hynes formula. The viscosity dependence of the rate has been investigated for a large number of thermodynamic state points. Since the activated barrier crossing dynamics probes the high-frequency frictional response of the liquid, the barrier crossing rate is found to be sensitive to the nature of the reactant-solvent interaction potential. When the solute-solvent interaction is modeled by a 6-12 Lennard-Jones potential, we find that over a large variation of viscosity (eta), the rate (k) can indeed be fitted very well to a fractional viscosity dependence: (k similar to eta(-alpha)), with the exponent alpha in the range 1 greater than or equal to alpha >0. The calculated values of the exponent appear to be in very good agreement with many experimental results. In particular, the theory, for the first time, explains the experimentally observed high value of alpha even at the barrier frequency, omega(b). similar or equal to 9 X 10(12) s(-1) for the isomerization reaction of 2-(2'-propenyl)anthracene in liquid eta-alkanes. The present study can also explain the reason for the very low value of vb observed in another study for the isomerization reaction of trans-stilbene in liquid n-alkanes. For omega(b) greater than or equal to 2.0 X 10(13) s(-1), we obtain alpha similar or equal to 0, which implies that the barrier crossing rate becomes identical to the transition-state theory predictions. A careful analysis of isomerization reaction dynamics involving large amplitude motion suggests that the barrier crossing dynamics itself may become irrelevant in highly viscous liquids and the rate might again be coupled directly to the viscosity. This crossover is predicted to be strongly temperature dependent and could be studied by changing the solvent viscosity by the application of pressure. (C) 1999 American Institute of Physics. [S0021-9606(9950514-X].

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the effect of subdividing the potential barrier along the reaction coordinate on Kramer's escape rate for a model potential, Using the known supersymmetric potential approach, we show the existence of an optimal number of subdivisions that maximizes the rate, We cast the problem as a mean first passage time problem of a biased random walker and obtain equivalent results, We briefly summarize the results of our investigation on the increase in the escape rate by placing a blow-torch in the unstable part of one of the potential wells. (C) 1999 Elsevier Science B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, power management algorithms for energy harvesting sensors (EHS) that operate purely based on energy harvested from the environment are proposed. To maintain energy neutrality, EHS nodes schedule their utilization of the harvested power so as to save/draw energy into/from an inefficient battery during peak/low energy harvesting periods, respectively. Under this constraint, one of the key system design goals is to transmit as much data as possible given the energy harvesting profile. For implementational simplicity, it is assumed that the EHS transmits at a constant data rate with power control, when the channel is sufficiently good. By converting the data rate maximization problem into a convex optimization problem, the optimal load scheduling (power management) algorithm that maximizes the average data rate subject to energy neutrality is derived. Also, the energy storage requirements on the battery for implementing the proposed algorithm are calculated. Further, robust schemes that account for the insufficiency of battery storage capacity, or errors in the prediction of the harvested power are proposed. The superior performance of the proposed algorithms over conventional scheduling schemes are demonstrated through computations using numerical data from solar energy harvesting databases.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider a time division duplex multiple-input multiple-output (nt × nr MIMO). Using channel state information (CSI) at the transmitter, singular value decomposition (SVD) of the channel matrix is performed. This transforms the MIMO channel into parallel subchannels, but has a low overall diversity order. Hence, we propose X-Codes which achieve a higher diversity order by pairing the subchannels, prior to SVD preceding. In particular, each pair of information symbols is encoded by a fixed 2 × 2 real rotation matrix. X-Codes can be decoded using nr very low complexity two-dimensional real sphere decoders. Error probability analysis for X-Codes enables us to choose the optimal pairing and the optimal rotation angle for each pair. Finally, we show that our new scheme outperforms other low complexity precoding schemes.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We develop an optimal, distributed, and low feedback timer-based selection scheme to enable next generation rate-adaptive wireless systems to exploit multi-user diversity. In our scheme, each user sets a timer depending on its signal to noise ratio (SNR) and transmits a small packet to identify itself when its timer expires. When the SNR-to-timer mapping is monotone non-decreasing, timers of users with better SNRs expire earlier. Thus, the base station (BS) simply selects the first user whose timer expiry it can detect, and transmits data to it at as high a rate as reliably possible. However, timers that expire too close to one another cannot be detected by the BS due to collisions. We characterize in detail the structure of the SNR-to-timer mapping that optimally handles these collisions to maximize the average data rate. We prove that the optimal timer values take only a discrete set of values, and that the rate adaptation policy strongly influences the optimal scheme's structure. The optimal average rate is very close to that of ideal selection in which the BS always selects highest rate user, and is much higher than that of the popular, but ad hoc, timer schemes considered in the literature.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Some basic results that help in determining the Diversity-Multiplexing Tradeoff (DMT) of cooperative multihop networks are first identified. As examples, the maximum achievable diversity gain is shown to equal the min-cut between source and sink, whereas the maximal multiplexing gain is shown to equal the minimum rank of the matrix characterizing the MIMO channel appearing across a cut in the network. Two multi-hop generalizations of the two-hop network are then considered, namely layered networks as well as a class of networks introduced here and termed as K-parallel-path (KPP) networks. The DMT of KPP networks is characterized for K > 3. It is shown that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for fully-connected, layered networks. Explicit coding schemes achieving the DMT that make use of cyclic-division-algebra-based distributed space-time codes underlie the above results. Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple, amplify-and-forward protocols are often sufficient to attain the optimal DMT.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A scheme to apply the rate-1 real orthogonal designs (RODs) in relay networks with single real-symbol decodability of the symbols at the destination for any arbitrary number of relays is proposed. In the case where the relays do not have any information about the channel gains from the source to themselves, the best known distributed space time block codes (DSTBCs) for k relays with single real-symbol decodability offer an overall rate of complex symbols per channel use. The scheme proposed in this paper offers an overall rate of 2/2+k complex symbol per channel use, which is independent of the number of relays. Furthermore, in the scenario where the relays have partial channel information in the form of channel phase knowledge, the best known DSTBCs with single real-symbol decodability offer an overall rate of 1/3 complex symbols per channel use. In this paper, making use of RODs, a scheme which achieves the same overall rate of 1/3 complex symbols per channel use but with a decoding delay that is 50 percent of that of the best known DSTBCs, is presented. Simulation results of the symbol error rate performance for 10 relays, which show the superiority of the proposed scheme over the best known DSTBC for 10 relays with single real-symbol decodability, are provided.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we consider the problem of learning an n × n kernel matrix from m(1) similarity matrices under general convex loss. Past research have extensively studied the m = 1 case and have derived several algorithms which require sophisticated techniques like ACCP, SOCP, etc. The existing algorithms do not apply if one uses arbitrary losses and often can not handle m > 1 case. We present several provably convergent iterative algorithms, where each iteration requires either an SVM or a Multiple Kernel Learning (MKL) solver for m > 1 case. One of the major contributions of the paper is to extend the well knownMirror Descent(MD) framework to handle Cartesian product of psd matrices. This novel extension leads to an algorithm, called EMKL, which solves the problem in O(m2 log n 2) iterations; in each iteration one solves an MKL involving m kernels and m eigen-decomposition of n × n matrices. By suitably defining a restriction on the objective function, a faster version of EMKL is proposed, called REKL,which avoids the eigen-decomposition. An alternative to both EMKL and REKL is also suggested which requires only an SVMsolver. Experimental results on real world protein data set involving several similarity matrices illustrate the efficacy of the proposed algorithms.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Background: Depression and anxiety have been linked to serious cardiovascular events in patients with preexisting cardiac illness. A decrease in cardiac vagal function as suggested by a decrease in heart rate (HR) variability has been linked to sudden death. Methods: We compared LLE and nonlinearity scores of the unfiltered (UF) and filtered time series (very low, low, and high frequency; VLF, LF and HF) of HR between patients with depression (n = 14) and healthy control subjects (n = 18). Results: We found significantly lower LLE of the unfiltered series in either posture, and HF series in patients with major depression in supine posture (p < .002). LLE (LF/UF), which may indicate relative sympathetic activity was also significantly higher in supine and standing postures in patients (p < .05); LF/HF (LLE) was also higher in patients (p < .05) in either posture. Conclusions: These findings suggest that major depression is associated with decreased cardiac vagal function and a relative increase in sympathetic function, which may be related to the higher risk of cardiovascular mortality, in this group and illustrates the usefulness of nonlinear measures of chaos such as LLE in addition to the commonly used spectral measures.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Depression is associated with increased cardiovascular mortality in patients with preexisting cardiac illness. A decrease in cardiac vagal function as suggested by a decrease in heart rate variability (HRV) or heart period variability has been linked to sudden death in patients with cardiac disease as well as in normal controls. Recent studies have shown decreased vagal function in cardiac patients with depression as well as in depressed patients without cardiac illness. In this study, we compared 20 h awake and sleep heart period nonlinear measures using quantification of nonlinearity and chaos in two groups of patients with major depression and ischemic heart disease (mean age 59-60 years) before and after 6 weeks of treatment with paroxetine or nortriptyline. Patients received paroxetine, 20-30 mg/day or nortriptyline targeted to 190-570 nmol/l for 6 weeks. For HRV analysis, 24 patients were included in the paroxetine treatment study and 20 patients in the nortriptyline study who had at least 20,000 s of awake data. The ages of these groups were 60.4 +/- 10.5 years for paroxetine and 60.8 +/- 13.4 years for nortriptyline. There was a significant decrease in the largest Lyapunov exponent (LLE) after treatment with nortriptyline but not paroxetine. There were also significant decreases in nonlinearity scores on S-netPR and S-netGS after nortriptyline, which may be due to a decrease in cardiac vagal modulation of HRV. S-netGS and awake LLE were the most significant variables that contributed to the discrimination of postparoxetine and postnortriptyline groups even with the inclusion of time and frequency domain measures. These findings suggest that nortriptyline decreases the measures of chaos probably through its stronger vagolytic effects on cardiac autonomic function compared with paroxetine, which is in agreement with previous clinical and preclinical reports. Nortriptyline was also associated with a significant decrease in nonlinearity scores, which may be due to anticholinergic and/or sympatholytic effects. As depression is associated with a strong risk factor for cardiovascular mortality, one should be careful about using any drug that adversely affects cardiac vagal function. Copyright (C) 2002 S. Karger AG, Basel.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dataflow graphs have been widely regarded as a powerful programming model for DSP applications. In this paper we propose a method to minimize buffer storage requirement in constructing rate-optimal compile-time (MBRO) schedules for multi-rate dataflow graphs. We demonstrate that the constraints to minimize buffer storage while executing at the optimal computation rate (i.e. the maximum possible computation rate without storage constraints) can be formulated as a unified linear programming problem in our framework. A novel feature of our method is that in constructing the rate-optimal schedule, it directly minimizes the memory requirement by choosing the schedule time of nodes appropriately. Lastly, a new circular-arc interval graph coloring algorithm has been proposed to further reduce the memory requirement by allowing buffer sharing among the arcs of the multi-rate dataflow graph. We have constructed an experimental testbed which implements our MBRO scheduling algorithm as well as (i) the widely used periodic admissible parallel schedules (also known as block schedules) proposed by Lee and Messerschmitt (IEEE Transactions on Computers, vol. 36, no. 1, 1987, pp. 24-35), (ii) the optimal scheduling buffer allocation (OSBA) algorithm of Ning and Gao (Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, SC, Jan. 10-13, 1993, pp. 29-42), and (iii) the multi-rate software pipelining (MRSP) algorithm (Govindarajan and Gao, in Proceedings of the 1993 International Conference on Application Specific Array Processors, Venice, Italy, Oct. 25-27, 1993, pp. 77-88). Schedules generated for a number of random dataflow graphs and for a set of DSP application programs using the different scheduling methods are compared. The experimental results have demonstrated a significant improvement (10-20%) in buffer requirements for the MBRO schedules compared to the schedules generated by the other three methods, without sacrificing the computation rate. The MBRO method also gives a 20% average improvement in computation rate compared to Lee's Block scheduling method.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Pyruvate conversion to acetyl-CoA by the pyruvate dehydrogenase (PDH) multienzyme complex is known as a key node in affecting the metabolic fluxes of animal cell culture. However, its possible role in causing possible nonlinear dynamic behavior such as oscillations and multiplicity of animal cells has received little attention. In this work, the kinetic and dynamic behavior of PDH of eucaryotic cells has been analyzed by using both in vitro and simplified in vivo models. With the in vitro model the overall reaction rate (v(1)) of PDH is shown to be a nonlinear function of pyruvate concentration, leading to oscillations under certain conditions. All enzyme components affect v, and the nonlinearity of PDH significantly, the protein X and the core enzyme dihydrolipoamide acyltransferase (E2) being mostly predominant. By considering the synthesis rates of pyruvate and PDH components the in vitro model is expanded to emulate in vivo conditions. Analysis using the in vivo model reveals another interesting kinetic feature of the PDH system, namely, multiple steady states. Depending on the pyruvate and enzyme levels or the operation mode, either a steady state with high pyruvate decarboxylation rate or a steady state with significantly lower decarboxylation rate can be achieved under otherwise identical conditions. In general, the more efficient steady state is associated with a lower pyruvate concentration. A possible time delay in the substrate supply and enzyme synthesis can also affect the steady state to be achieved and lead's to oscillations under certain conditions. Overall, the predictions of multiplicity for the PDH system agree qualitatively well with recent experimental observations in animal cell cultures. The model analysis gives some hints for improving pyruavte metabolism in animal cell culture.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we present a differential-geometric approach to analyze the singularities of task space point trajectories of two and three-degree-of-freedom serial and parallel manipulators. At non-singular configurations, the first-order, local properties are characterized by metric coefficients, and, geometrically, by the shape and size of a velocity ellipse or an ellipsoid. At singular configurations, the determinant of the matrix of metric coefficients is zero and the velocity ellipsoid degenerates to an ellipse, a line or a point, and the area or the volume of the velocity ellipse or ellipsoid becomes zero. The degeneracies of the velocity ellipsoid or ellipse gives a simple geometric picture of the possible task space velocities at a singular configuration. To study the second-order properties at a singularity, we use the derivatives of the metric coefficients and the rate of change of area or volume. The derivatives are shown to be related to the possible task space accelerations at a singular configuration. In the case of parallel manipulators, singularities may lead to either loss or gain of one or more degrees-of-freedom. For loss of one or more degrees-of-freedom, ther possible velocities and accelerations are again obtained from a modified metric and derivatives of the metric coefficients. In the case of a gain of one or more degrees-of-freedom, the possible task space velocities can be pictured as growth to lines, ellipses, and ellipsoids. The theoretical results are illustrated with the help of a general spatial 2R manipulator and a three-degree-of-freedom RPSSPR-SPR parallel manipulator.