Optimum design of Lanchester damper for a viscously damped single degree of freedom system by using minimum force transmissibility criterion

The problem of optimum design of a Lanchester damper for minimum force transmission from a viscously damped single degree of freedom system subjected to harmonic excitation is investigated. Explicit expressions are developed for determining the optimum absorber parameters. It is shown that for the particular case of the undamped single degree of freedom system the results reduce to the classical ones obtained by using the concept of a fixed point on the transmissibility curves.

An analytical model for performance evaluation of multimedia applications over EDCA in an IEEE 802.11e WLAN

We extend the modeling heuristic of (Harsha et al. 2006. In IEEE IWQoS 06, pp 178 - 187) to evaluate the performance of an IEEE 802.11e infrastructure network carrying packet telephone calls, streaming video sessions and TCP controlled file downloads, using Enhanced Distributed Channel Access (EDCA). We identify the time boundaries of activities on the channel (called channel slot boundaries) and derive a Markov Renewal Process of the contending nodes on these epochs. This is achieved by the use of attempt probabilities of the contending nodes as those obtained from the saturation fixed point analysis of (Ramaiyan et al. 2005. In Proceedings ACM Sigmetrics, `05. Journal version accepted for publication in IEEE TON). Regenerative analysis on this MRP yields the desired steady state performance measures. We then use the MRP model to develop an effective bandwidth approach for obtaining a bound on the size of the buffer required at the video queue of the AP, such that the streaming video packet loss probability is kept to less than 1%. The results obtained match well with simulations using the network simulator, ns-2. We find that, with the default IEEE 802.11e EDCA parameters for access categories AC 1, AC 2 and AC 3, the voice call capacity decreases if even one streaming video session and one TCP file download are initiated by some wireless station. Subsequently, reducing the voice calls increases the video downlink stream throughput by 0.38 Mbps and file download capacity by 0.14 Mbps, for every voice call (for the 11 Mbps PHY). We find that a buffer size of 75KB is sufficient to ensure that the video packet loss probability at the QAP is within 1%.

Analytical models for capacity estimation of IEEE 802.11 WLANs using DCF for internet applications

We provide analytical models for capacity evaluation of an infrastructure IEEE 802.11 based network carrying TCP controlled file downloads or full-duplex packet telephone calls. In each case the analytical models utilize the attempt probabilities from a well known fixed-point based saturation analysis. For TCP controlled file downloads, following Bruno et al. (In Networking '04, LNCS 2042, pp. 626-637), we model the number of wireless stations (STAs) with ACKs as a Markov renewal process embedded at packet success instants. In our work, analysis of the evolution between the embedded instants is done by using saturation analysis to provide state dependent attempt probabilities. We show that in spite of its simplicity, our model works well, by comparing various simulated quantities, such as collision probability, with values predicted from our model. Next we consider N constant bit rate VoIP calls terminating at N STAs. We model the number of STAs that have an up-link voice packet as a Markov renewal process embedded at so called channel slot boundaries. Analysis of the evolution over a channel slot is done using saturation analysis as before. We find that again the AP is the bottleneck, and the system can support (in the sense of a bound on the probability of delay exceeding a given value) a number of calls less than that at which the arrival rate into the AP exceeds the average service rate applied to the AP. Finally, we extend the analytical model for VoIP calls to determine the call capacity of an 802.11b WLAN in a situation where VoIP calls originate from two different types of coders. We consider N-1 calls originating from Type 1 codecs and N-2 calls originating from Type 2 codecs. For G711 and G729 voice coders, we show that the analytical model again provides accurate results in comparison with simulations.

Real Theta Characteristics And Automorphisms Of A Real Curve

Let X be a geometrically irreductble smooth projective cruve defined over R. of genus at least 2. that admits a nontrivial automorphism, sigma. Assume that X does not have any real points. Let tau be the antiholomorphic involution of the complexification lambda(C) of X. We show that if the action of sigma on the set S(X) of all real theta characteristics of X is trivial. then the order of sigma is even, say 2k and the automorphism tau o (sigma) over cap (lambda) of X-C has a fixed point, where (sigma) over cap is the automorphism of X x C-R defined by sigma We then show that there exists X with a real point and admitting a nontrivial automorphism sigma, such that the action of sigma on S(X) is trivial, while X/ not equal P-R(1) We also give an example of X with no real points and admitting a nontrivial automorphisim sigma such that the automorphism tau o (sigma) over cap (lambda) has a fixed point, the action of sigma on S(X) is trivial, and X/ not equal P-R(1)

Stochastic models of IEEE 802.11e wireless net works with multimedia applications

We provide a survey of some of our recent results ([9], [13], [4], [6], [7]) on the analytical performance modeling of IEEE 802.11 wireless local area networks (WLANs). We first present extensions of the decoupling approach of Bianchi ([1]) to the saturation analysis of IEEE 802.11e networks with multiple traffic classes. We have found that even when analysing WLANs with unsaturated nodes the following state dependent service model works well: when a certain set of nodes is nonempty, their channel attempt behaviour is obtained from the corresponding fixed point analysis of the saturated system. We will present our experiences in using this approximation to model multimedia traffic over an IEEE 802.11e network using the enhanced DCF channel access (EDCA) mechanism. We have found that we can model TCP controlled file transfers, VoIP packet telephony, and streaming video in the IEEE802.11e setting by this simple approximation.

An analytical model for the capacity estimation of combined VoIP and TCP file transfers over EDCA in an IEEE 802.11e WLAN

In this paper we develop and numerically explore the modeling heuristic of using saturation attempt probabilities as state dependent attempt probabilities in an IEEE 802.11e infrastructure network carrying packet telephone calls and TCP controlled file downloads, using Enhanced Distributed Channel Access (EDCA). We build upon the fixed point analysis and performance insights in [1]. When there are a certain number of nodes of each class contending for the channel (i.e., have nonempty queues), then their attempt probabilities are taken to be those obtained from saturation analysis for that number of nodes. Then we model the system queue dynamics at the network nodes. With the proposed heuristic, the system evolution at channel slot boundaries becomes a Markov renewal process, and regenerative analysis yields the desired performance measures.The results obtained from this approach match well with ns2 simulations. We find that, with the default IEEE 802.11e EDCA parameters for AC 1 and AC 3, the voice call capacity decreases if even one file download is initiated by some station. Subsequently, reducing the voice calls increases the file download capacity almost linearly (by 1/3 Mbps per voice call for the 11 Mbps PHY).

Effect of primary system damping on the optimum design of an untuned viscous dynamic vibration absorber

Explicit criteria for the optimum design of an untuned viscous dynamic vibration absorber are developed for the case of a viscously damped single degree of freedom springmass system. It is shown that for the particular case of an undamped main system, the results reduce to the classical ones obtained by using the concept of a fixed point on the response curve.

Neural network modeling of associative memory: Beyond the Hopfield model

A number of neural network models, in which fixed-point and limit-cycle attractors of the underlying dynamics are used to store and associatively recall information, are described. In the first class of models, a hierarchical structure is used to store an exponentially large number of strongly correlated memories. The second class of models uses limit cycles to store and retrieve individual memories. A neurobiologically plausible network that generates low-amplitude periodic variations of activity, similar to the oscillations observed in electroencephalographic recordings, is also described. Results obtained from analytic and numerical studies of the properties of these networks are discussed.

Adaptive Filtering Technique and DSP Based Implementation for High-Speed Distance Protection

The paper presents an adaptive Fourier filtering technique and a relaying scheme based on a combination of a digital band-pass filter along with a three-sample algorithm, for applications in high-speed numerical distance protection. To enhance the performance of above-mentioned technique, a high-speed fault detector has been used. MATLAB based simulation studies show that the adaptive Fourier filtering technique provides fast tripping for near faults and security for farther faults. The digital relaying scheme based on a combination of digital band-pass filter along with three-sample data window algorithm also provides accurate and high-speed detection of faults. The paper also proposes a high performance 16-bit fixed point DSP (Texas Instruments TMS320LF2407A) processor based hardware scheme suitable for implementation of the above techniques. To evaluate the performance of the proposed relaying scheme under steady state and transient conditions, PC based menu driven relay test procedures are developed using National Instruments LabVIEW software. The test signals are generated in real time using LabVIEW compatible analog output modules. The results obtained from the simulation studies as well as hardware implementations are also presented.

An analytical model for an IEEE~802.11 WLAN using DCF with two types of VoIP calls

In this paper we develop and numerically explore the modeling heuristic of using saturation attempt probabilities as state dependent attempt probabilities in an IEEE 802.11e infrastructure network carrying packet telephone calls and TCP controlled file downloads, using enhanced distributed channel access (EDCA). We build upon the fixed point analysis and performance insights. When there are a certain number of nodes of each class contending for the channel (i.e., have nonempty queues), then their attempt probabilities are taken to be those obtained from saturation analysis for that number of nodes. Then we model the system queue dynamics at the network nodes. With the proposed heuristic, the system evolution at channel slot boundaries becomes a Markov renewal process, and regenerative analysis yields the desired performance measures. The results obtained from this approach match well with ns2 simulations. We find that, with the default IEEE 802.11e EDCA parameters for AC 1 and AC 3, the voice call capacity decreases if even one file download is initiated by some station. Subsequently, reducing the voice calls increases the file download capacity almost linearly (by 1/3 Mbps per voice call for the 11 Mbps PHY)

In-situ measurements of concentration and temperature during transient solidification of aqueous solution of ammonium chloride using laser interferometry

The variation in temperature and concentration plays a crucial role in predicting the final microstructure during solidification of a binary alloy. Most of the experimental techniques used to measure concentration and temperature are intrusive in nature and affect the flow field. In this paper, the main focus is laid on in-situ, non-intrusive, transient measurement of concentration and temperature during the solidification of a binary mixture of aqueous ammonium chloride solution (a metal-analog system) in a top cooled cavity using laser based Mach-Zehnder Interferometric technique. It was found from the interferogram, that the angular deviation of fringe pattern and the total number of fringes exhibit significant sensitivity to refractive index and hence are functions of the local temperature and concentration of the NH4Cl solution inside the cavity. Using the fringe characteristics, calibration curves were established for the range of temperature and concentration levels expected during the solidification process. In the actual solidification experiment, two hypoeutectic solutions (5% and 15% NH4Cl) were chosen. The calibration curves were used to determine the temperature and concentration of the solution inside the cavity during solidification of 5% and 15% NH4Cl solution at different instants of time. The measurement was carried out at a fixed point in the cavity, and the concentration variation with time was recorded as the solid-liquid interface approached the measurement point. The measurement exhibited distinct zones of concentration distribution caused by solute rejection and Rayleigh Benard convection. Further studies involving flow visualization with laser scattering confirmed the Rayleigh Benard convection. Computational modeling was also performed, which corroborated the experimental findings. (C) 2011 Elsevier Ltd. All rights reserved.

Stability of developing film flow down an inclined surface

Film flows on inclined surfaces are often assumed to be of constant thickness, which ensures that the velocity profile is half-Poiseuille. It is shown here that by shallow water theory, only flows in a portion of Reynolds number-Froude number (Re-Fr) plane can asymptotically attain constant film thickness. In another portion on the plane, the constant thickness solution appears as an unstable fixed point, while in other regions the film thickness seems to asymptote to a positive slope. Our simulations of the Navier-Stokes equations confirm the predictions of shallow water theory at higher Froude numbers, but disagree with them at lower Froude numbers. We show that different regimes of film flow show completely different stability behaviour from that predicted earlier. Supercritical decelerating flows are shown to be always unstable, whereas accelerating flows become unstable below a certain Reynolds number for a given Froude number. Subcritical flows on the other hand are shown to be unstable above a certain Reynolds number. In some range of parameters, two solutions for the base flowexist, and the attached profile is found to be more stable. All flows except those with separation become more stable as they proceed downstream. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4758299]

Bounds on the sum-rate capacity of the Gaussian MIMO X channel

We consider the MIMO X channel (XC), a system consisting of two transmit-receive pairs, where each transmitter communicates with both the receivers. Both the transmitters and receivers are equipped with multiple antennas. First, we derive an upper bound on the sum-rate capacity of the MIMO XC under individual power constraint at each transmitter. The sum-rate capacity of the two-user multiple access channel (MAC) that results when receiver cooperation is assumed forms an upper bound on the sum-rate capacity of the MIMO XC. We tighten this bound by considering noise correlation between the receivers and deriving the worst noise covariance matrix. It is shown that the worst noise covariance matrix is a saddle-point of a zero-sum, two-player convex-concave game, which is solved through a primal-dual interior point method that solves the maximization and the minimization parts of the problem simultaneously. Next, we propose an achievable scheme which employs dirty paper coding at the transmitters and successive decoding at the receivers. We show that the derived upper bound is close to the achievable region of the proposed scheme at low to medium SNRs.

Design and Analysis of an Acknowledgment-Aware Asynchronous MPR MAC Protocol for Distributed WLANs

Multi-packet reception (MPR) promises significant throughput gains in wireless local area networks (WLANs) by allowing nodes to transmit even in the presence of ongoing transmissions in the medium. However, the medium access control (MAC) layer must now be redesigned to facilitate rather than discourage - these overlapping transmissions. We investigate asynchronous MPR MAC protocols, which successfully accomplish this by controlling the node behavior based on the number of ongoing transmissions in the channel. The protocols use the backoff timer mechanism of the distributed coordination function, which makes them practically appealing. We first highlight a unique problem of acknowledgment delays, which arises in asynchronous MPR, and investigate a solution that modifies the medium access rules to reduce these delays and increase system throughput in the single receiver scenario. We develop a general renewal-theoretic fixed-point analysis that leads to expressions for the saturation throughput, packet dropping probability, and average head-of-line packet delay. We also model and analyze the practical scenario in which nodes may incorrectly estimate the number of ongoing transmissions.

Performance analysis of beacon-less IEEE 802.15.4 multi-hop networks

We develop an approximate analytical technique for evaluating the performance of multi-hop networks based on beacon-less CSMA/CA as standardised in IEEE 802.15.4, a popular standard for wireless sensor networks. The network comprises sensor nodes, which generate measurement packets, and relay nodes which only forward packets. We consider a detailed stochastic process at each node, and analyse this process taking into account the interaction with neighbouring nodes via certain unknown variables (e.g., channel sensing rates, collision probabilities, etc.). By coupling these analyses of the various nodes, we obtain fixed point equations that can be solved numerically to obtain the unknown variables, thereby yielding approximations of time average performance measures, such as packet discard probabilities and average queueing delays. Different analyses arise for networks with no hidden nodes and networks with hidden nodes. We apply this approach to the performance analysis of tree networks rooted at a data sink. Finally, we provide a validation of our analysis technique against simulations.