Single real-symbol decodable, high-rate, distributed space-time block codes

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.

Constraint loss under dynamic loading in rate independent plastic solids

The objectives of this paper are to examine the loss of crack tip constraint in dynamically loaded fracture specimens and to assess whether it can lead to enhancement in the fracture toughness at high loading rates which has been observed in several experimental studies. To this end, 2-D plane strain finite element analyses of single edge notched (tension) specimen and three point bend specimen subjected to time varying loads are performed. The material is assumed to obey the small strain J(2) flow theory of plasticity with rate independent behaviour. The results demonstrate that a valid J-Q field exists under dynamic loading irrespective of the crack length and specimen geometry. Further, the constraint parameter Q becomes strongly negative at high loading rates, particularly in deeply cracked specimens. The variation of dynamic fracture toughness K-dc with stress intensity rate K for cleavage cracking is predicted using a simple critical stress criterion. It is found that inertia-driven constraint loss can substantially enhance K-dc for (K) over dot > 10(5) MPa rootm/s.

Diminished chaos of heart rate time series in patients with major depression

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.

Identification of delamination in composite beams using spectral estimation and a genetic algorithm

An efficient strategy for identification of delamination in composite beams and connected structures is presented. A spectral finite-element model consisting of a damaged spectral element is used for model-based prediction of the damaged structural response in the frequency domain. A genetic algorithm (GA) specially tailored for damage identification is derived and is integrated with finite-element code for automation. For best application of the GA, sensitivities of various objective functions with respect to delamination parameters are studied and important conclusions are presented. Model-based simulations of increasing complexity illustrate some of the attractive features of the strategy in terms of accuracy as well as computational cost. This shows the possibility of using such strategies for the development of smart structural health monitoring softwares and systems.

Machine-tool selection and operation allocation in FMS: solving a fuzzy goal-programming model using a genetic algorithm

The decision-making process for machine-tool selection and operation allocation in a flexible manufacturing system (FMS) usually involves multiple conflicting objectives. Thus, a fuzzy goal-programming model can be effectively applied to this decision problem. The paper addresses application of a fuzzy goal-programming concept to model the problem of machine-tool selection and operation allocation with explicit considerations given to objectives of minimizing the total cost of machining operation, material handling and set-up. The constraints pertaining to the capacity of machines, tool magazine and tool life are included in the model. A genetic algorithm (GA)-based approach is adopted to optimize this fuzzy goal-programming model. An illustrative example is provided and some results of computational experiments are reported.

Major depression with ischemic heart disease: Effects of paroxetine and nortriptyline on measures of nonlinearity and chaos of heart rate

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.

Neural network based optimal routing algorithm for communication networks

This paper presents the capability of the neural networks as a computational tool for solving constrained optimization problem, arising in routing algorithms for the present day communication networks. The application of neural networks in the optimum routing problem, in case of packet switched computer networks, where the goal is to minimize the average delays in the communication have been addressed. The effectiveness of neural network is shown by the results of simulation of a neural design to solve the shortest path problem. Simulation model of neural network is shown to be utilized in an optimum routing algorithm known as flow deviation algorithm. It is also shown that the model will enable the routing algorithm to be implemented in real time and also to be adaptive to changes in link costs and network topology. (C) 2002 Elsevier Science Ltd. All rights reserved.

Nonlinear dynamics of eucaryotic pyruvate dehydrogenase multienzyme complex: Decarboxylation rate, oscillations, and multiplicity

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.

Performance analysis of the random early detection algorithm

In this article we consider a finite queue with its arrivals controlled by the random early detection algorithm. This is one of the most prominent congestion avoidance schemes in the Internet routers. The aggregate arrival stream from the population of transmission control protocol sources is locally considered stationary renewal or Markov modulated Poisson process with general packet length distribution. We study the exact dynamics of this queue and provide the stability and the rates of convergence to the stationary distribution and obtain the packet loss probability and the waiting time distribution. Then we extend these results to a two traffic class case with each arrival stream renewal. However, computing the performance indices for this system becomes computationally prohibitive. Thus, in the latter half of the article, we approximate the dynamics of the average queue length process asymptotically via an ordinary differential equation. We estimate the error term via a diffusion approximation. We use these results to obtain approximate transient and stationary performance of the system. Finally, we provide some computational examples to show the accuracy of these approximations.

Stability of fluid flow past a membrane

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.

Two timescale analysis of the Alopex algorithm for optimization

Alopex is a correlation-based gradient-free optimization technique useful in many learning problems. However, there are no analytical results on the asymptotic behavior of this algorithm. This article presents a new version of Alopex that can be analyzed using techniques of two timescale stochastic approximation method. It is shown that the algorithm asymptotically behaves like a gradient-descent method, though it does not need (or estimate) any gradient information. It is also shown, through simulations, that the algorithm is quite effective.