Throughput performance of distributed applications in switched networks in presence of end-system bottlenecks

The steady state throughput performance of distributed applications deployed in switched networks in presence of end-system bottlenecks is studied in this paper. The effect of various limitations at an end-system is modelled as an equivalent transmission capacity limitation. A class of distributed applications is characterised by a static traffic distribution matrix that determines the communication between various components of the application. It is found that uniqueness of steady state throughputs depends only on the traffic distribution matrix and that some applications (e.g., broadcast applications) can yield non-unique values for the steady state component throughputs. For a given switch capacity, with traffic distribution that yield fair unique throughputs, the trade-off between the end-system capacity and the number of application components is brought out. With a proposed distributed rate control, it has been illustrated that it is possible to have unique solution for certain traffic distributions which is otherwise impossible. Also, by proper selection of rate control parameters, various throughput performance objectives can be realised.

Two-timescale Q-learning Algorithms with an Application to Routing in Networks

We propose two variants of the Q-learning algorithm that (both) use two timescales. One of these updates Q-values of all feasible state-action pairs at each instant while the other updates Q-values of states with actions chosen according to the ‘current ’ randomized policy updates. A sketch of convergence of the algorithms is shown. Finally, numerical experiments using the proposed algorithms for routing on different network topologies are presented and performance comparisons with the regular Q-learning algorithm are shown.

Voltage stability : some reflections on Q-V characteristics of loads

Considering voltage stability as a static viability problem, this paper takes a particular concern of Q-V characteristics and reflects on certain notions that do not seem to have been explicitly mentioned or derived in the existing documented literature. The equations of Q-V characteristics are rederived in exactness, some salient points on the curve are discovered and analysed. The results of the analysis are illustrated through a case study

A touch of history and a peep into the future of the lipid-quinone known as coenzyme Q and ubiquinone

Coenzyme Q (ubiquinone), a fully substituted benzoquinone with polyprenyl side chain, participates in many cellular redox activities. Paradoxically it was discovered only in 1957, albeit being ubiquitous. It required a person, F. L. Crane, a place, Enzyme Institute, Madison, USA, and a time when D. E. Green was directing vigorous research on mitochondria. Located at the transition of 2-electron flavoproteins and 1-electron cytochrome carriers, it facilitates electron transfer through the elegant Q-cycle in mitochondria to reduce O-2 to H2O, and to H2O2, now a significant signal-transducing agent, as a minor activity in shunt pathway (animals) and alternative oxidase (plants). The ability to form Q-radical by losing an electron and a proton was ingeniously used by Mitchell to explain the formation of the proton gradient, considered the core of energy transduction, and also in acidification in vacuoles. Known to be a mobile membrane constituent (microsomes, plasma membrane and Golgi apparatus), allowing it to reach multiple sites, coenzyme Q is expected to have other activities. Coenzyme Q protects circulating lipoproteins being a better lipid antioxidant than even vitamin E. Binding to proteins such as QPS, QPN, QPC and uncoupling protein in mitochondria, QA and QB in the reaction centre in R. sphaeroides, and disulfide bond-forming protein in E. coli (possibly also in Golgi), coenzyme Q acquires selective functions. A characteristic of orally dosed coenzyme Q is its exclusive absorption into the liver, but not the other tissues. This enrichment of Q is accompanied by significant decrease of blood pressure and of serum cholesterol. Inhibition of formation of mevalonate, the common precursor in the branched isoprene pathway, by the minor product, coenzyme Q, decreases the major product, cholesterol. Relaxation of contracted arterial smooth muscle by a side-chain truncated product of coenzyme Q explains its effect of decreasing blood pressure. Extensive clinical studies carried out on oral supplements of coenzyine Q, initially by K. Folkers and Y. Yamamura and followed many others, revealed a large number of beneficial effects, significantly in cardiovascular diseases. Such a variety of effects by this lipid quinone cannot depend on redox activity alone. The fat-soluble vitamins (A, D, E and K) that bear structural relationship with coenzyme Q are known to be active in their polar forms. A vignette of modified forms of coenzyme Q taking active role in its multiple effects is emerging.

A Compliant End-Effector to Passively Limit the Force in Tele-Operated Tissue-Cutting

This paper presents a compliant end-effector that cuts soft tissues and senses the cutting forces. The end-effector is designed to have an upper threshold on cutting forces to facilitate safe handling of tissue during automated cutting. This is demonstrated with nonlinear finite element analysis and experimental results obtained by cutting inhomogeneous phantom tissue. The cutting forces are estimated using a vision-based technique that uses amplified elastic deformation of the compliant end-effector. We also demonstrate an immersive tele-operated tissue-cutting system together with a haptic device that gives real-time force feedback to the user. DOI: 10.1115/1.4007638]

q-Gaussian based Smoothed Functional Algorithms for Stochastic Optimization

The q-Gaussian distribution results from maximizing certain generalizations of Shannon entropy under some constraints. The importance of q-Gaussian distributions stems from the fact that they exhibit power-law behavior, and also generalize Gaussian distributions. In this paper, we propose a Smoothed Functional (SF) scheme for gradient estimation using q-Gaussian distribution, and also propose an algorithm for optimization based on the above scheme. Convergence results of the algorithm are presented. Performance of the proposed algorithm is shown by simulation results on a queuing model.

A novel Q-learning algorithm with function approximation for constrained Markov decision processes

We present a novel multi-timescale Q-learning algorithm for average cost control in a Markov decision process subject to multiple inequality constraints. We formulate a relaxed version of this problem through the Lagrange multiplier method. Our algorithm is different from Q-learning in that it updates two parameters - a Q-value parameter and a policy parameter. The Q-value parameter is updated on a slower time scale as compared to the policy parameter. Whereas Q-learning with function approximation can diverge in some cases, our algorithm is seen to be convergent as a result of the aforementioned timescale separation. We show the results of experiments on a problem of constrained routing in a multistage queueing network. Our algorithm is seen to exhibit good performance and the various inequality constraints are seen to be satisfied upon convergence of the algorithm.

Comparison of OpAmp based and comparator based switched capacitor filter

Comparator based switched capacitor circuits provide an excellent opportunity to design sampled data systems where the virtual ground condition is detected rather than being continuously forced with negative feedback in Opamp based circuits. This work is an application of this concept to design a 1 st order 330 KHz cutoff frequency Lowpass filter operating at 10 MHz sampling frequency in 0.13μm technology and 1.2 V supply voltage. The Comparator Based Switched Capacitor (CBSC) filter is compared with conventional Two stage Miller compensated Operational amplifier based switched capacitor filter. It is shown that CBSC filter relaxes the constraints like speed ,linearity, gain, stability which would otherwise be hard to satisfy in scaled technologies in Opamp based circuits. The designed CBSC based lowpass filter provides significant power savings compared to traditional Opamp based switched capacitor filter.

Effective Q Criterion for Disk Stability in an External Potential

The standard Q criterion (with Q > 1) describes the stability against local, axisymmetric perturbations in a disk supported by rotation and random motion. Most astrophysical disks, however, are under the influence of an external gravitational potential, which can significantly affect their stability. A typical example is a galactic disk embedded in a dark matter halo. Here, we do a linear perturbation analysis for a disk in an external potential and obtain a generalized dispersion relation and the effective stability criterion. An external potential, such as that due to the dark matter halo concentric with the disk, contributes to the unperturbed rotational field and significantly increases its stability. We obtain the values for the effective Q parameter for the Milky Way and for a low surface brightness galaxy, UGC 7321. We find that in each case the stellar disk by itself is barely stable and it is the dark matter halo that stabilizes the disk against local, axisymmetric gravitational instabilities. Thus, the dark matter halo is necessary to ensure local disk stability. This result has been largely missed so far because in practice the Q parameter for a galactic disk is obtained using the observed rotational field that already includes the effect of the halo

EFFECTIVE Q CRITERION FOR DISK STABILITY IN AN EXTERNAL POTENTIAL

standard Q criterion (with Q > 1) describes the stability against local, axisymmetric perturbations in a disk supported by rotation and random motion. Most astrophysical disks, however, are under the influence of an external gravitational potential, which can significantly affect their stability. A typical example is a galactic disk embedded in a dark matter halo. Here, we do a linear perturbation analysis for a disk in an external potential and obtain a generalized dispersion relation and the effective stability criterion. An external potential, such as that due to the dark matter halo concentric with the disk, contributes to the unperturbed rotational field and significantly increases its stability. We obtain the values for the effective Q parameter for the Milky Way and for a low surface brightness galaxy, UGC 7321. We find that in each case the stellar disk by itself is barely stable and it is the dark matter halo that stabilizes the disk against local, axisymmetric gravitational instabilities. Thus, the dark matter halo is necessary to ensure local disk stability. This result has been largely missed so far because in practice the Q parameter for a galactic disk is obtained using the observed rotational field that already includes the effect of the halo.

Smoothed Functional Algorithms for Stochastic Optimization Using q-Gaussian Distributions

Smoothed functional (SF) schemes for gradient estimation are known to be efficient in stochastic optimization algorithms, especially when the objective is to improve the performance of a stochastic system However, the performance of these methods depends on several parameters, such as the choice of a suitable smoothing kernel. Different kernels have been studied in the literature, which include Gaussian, Cauchy, and uniform distributions, among others. This article studies a new class of kernels based on the q-Gaussian distribution, which has gained popularity in statistical physics over the last decade. Though the importance of this family of distributions is attributed to its ability to generalize the Gaussian distribution, we observe that this class encompasses almost all existing smoothing kernels. This motivates us to study SF schemes for gradient estimation using the q-Gaussian distribution. Using the derived gradient estimates, we propose two-timescale algorithms for optimization of a stochastic objective function in a constrained setting with a projected gradient search approach. We prove the convergence of our algorithms to the set of stationary points of an associated ODE. We also demonstrate their performance numerically through simulations on a queuing model.

Two timescale convergent Q-learning for sleep-scheduling in wireless sensor networks

In this paper, we consider an intrusion detection application for Wireless Sensor Networks. We study the problem of scheduling the sleep times of the individual sensors, where the objective is to maximize the network lifetime while keeping the tracking error to a minimum. We formulate this problem as a partially-observable Markov decision process (POMDP) with continuous stateaction spaces, in a manner similar to Fuemmeler and Veeravalli (IEEE Trans Signal Process 56(5), 2091-2101, 2008). However, unlike their formulation, we consider infinite horizon discounted and average cost objectives as performance criteria. For each criterion, we propose a convergent on-policy Q-learning algorithm that operates on two timescales, while employing function approximation. Feature-based representations and function approximation is necessary to handle the curse of dimensionality associated with the underlying POMDP. Our proposed algorithm incorporates a policy gradient update using a one-simulation simultaneous perturbation stochastic approximation estimate on the faster timescale, while the Q-value parameter (arising from a linear function approximation architecture for the Q-values) is updated in an on-policy temporal difference algorithm-like fashion on the slower timescale. The feature selection scheme employed in each of our algorithms manages the energy and tracking components in a manner that assists the search for the optimal sleep-scheduling policy. For the sake of comparison, in both discounted and average settings, we also develop a function approximation analogue of the Q-learning algorithm. This algorithm, unlike the two-timescale variant, does not possess theoretical convergence guarantees. Finally, we also adapt our algorithms to include a stochastic iterative estimation scheme for the intruder's mobility model and this is useful in settings where the latter is not known. Our simulation results on a synthetic 2-dimensional network setting suggest that our algorithms result in better tracking accuracy at the cost of only a few additional sensors, in comparison to a recent prior work.