Greedy Scheduling in Multihop Wireless Networks

We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. Analytical bounds on performance are provided and simulations indicate that the greedy heuristic performs well in practice.

Modified Greedy Pursuits for Improving Sparse Recovery

Compressive Sensing (CS) theory combines the signal sampling and compression for sparse signals resulting in reduction in sampling rate. In recent years, many recovery algorithms have been proposed to reconstruct the signal efficiently. Subspace Pursuit and Compressive Sampling Matching Pursuit are some of the popular greedy methods. Also, Fusion of Algorithms for Compressed Sensing is a recently proposed method where several CS reconstruction algorithms participate and the final estimate of the underlying sparse signal is determined by fusing the estimates obtained from the participating algorithms. All these methods involve solving a least squares problem which may be ill-conditioned, especially in the low dimension measurement regime. In this paper, we propose a step prior to least squares to ensure the well-conditioning of the least squares problem. Using Monte Carlo simulations, we show that in low dimension measurement scenario, this modification improves the reconstruction capability of the algorithm in clean as well as noisy measurement cases.

Enhanced sensitivity in detection of Kerr rotation by double modulation and time averaging based on Allan variance

Experiments in spintronics necessarily involve the detection of spin polarization. The sensitivity of this detection becomes an important factor to consider when extending the low temperature studies on semiconductor spintronic devices to room temperature, where the spin signal is weaker. In pump-probe experiments, which optically inject and detect spins, the sensitivity is often improved by using a photoelastic modulator (PEM) for lock-in detection. However, spurious signals can arise if diode lasers are used as optical sources in such experiments, along with a PEM. In this work, we eliminated the spurious electromagnetic coupling of the PEM onto the probe diode laser, by the double modulation technique. We also developed a test for spurious modulated interference in the pump-probe signal, due to the PEM. Besides, an order of magnitude enhancement in the sensitivity of detection of spin polarization by Kerr rotation, to 3x10(-8) rad was obtained by using the concept of Allan variance to optimally average the time series data over a period of 416 s. With these improvements, we are able to experimentally demonstrate at room temperature, photoinduced steady-state spin polarization in bulk GaAs. Thus, the advances reported here facilitate the use of diode lasers with a PEM for sensitive pump-probe experiments. They also constitute a step toward detection of spin-injection in Si at room temperature.

A frame-invariant scheme for the geometrically exact beam using rotation vector parametrization

While frame-invariant solutions for arbitrarily large rotational deformations have been reported through the orthogonal matrix parametrization, derivation of such solutions purely through a rotation vector parametrization, which uses only three parameters and provides a parsimonious storage of rotations, is novel and constitutes the subject of this paper. In particular, we employ interpolations of relative rotations and a new rotation vector update for a strain-objective finite element formulation in the material framework. We show that the update provides either the desired rotation vector or its complement. This rules out an additive interpolation of total rotation vectors at the nodes. Hence, interpolations of relative rotation vectors are used. Through numerical examples, we show that combining the proposed update with interpolations of relative rotations yields frame-invariant and path-independent numerical solutions. Advantages of the present approach vis-a-vis the updated Lagrangian formulation are also analyzed.

A Global Constraint On Relative Rotation To Avoid Lumped Compliant Mechanisms In Topology Optimization

Some of the well known formulations for topology optimization of compliant mechanisms could lead to lumped compliant mechanisms. In lumped compliance, most of the elastic deformation in a mechanism occurs at few points, while rest of the mechanism remains more or less rigid. Such points are referred to as point-flexures. It has been noted in literature that high relative rotation is associated with point-flexures. In literature we also find a formulation of local constraint on relative rotations to avoid lumped compliance. However it is well known that a global constraint is easier to handle than a local constraint, by a numerical optimization algorithm. The current work presents a way of putting global constraint on relative rotations. This constraint is also simpler to implement since it uses linearized rotation at the center of finite-elements, to compute relative rotations. I show the results obtained by using this constraint oil the following benchmark problems - displacement inverter and gripper.

NMR spectra of oriented biologically important molecules - The structure of and the internal rotation in N,N'-dimethyluracil

From the proton NMR spectra of Nfl-dimethyluracil oriented in two different nematic solvents, the internal rotation of the methyl groups about the N-C bonds is studied. It has been observed that the preferred conformation of the methyl group having one carbonyl in the vicinity is the one where a C-H bond is in the ring plane pointing toward the carbonyl group. The results are not sensitive to the mode of rotation of the other methyl group. These data are interpreted in terms of the bond polarizations.

Infrared spectroscopic study of the rotation of the NH 4+ ion in ammonium halides

Infrared correlation functions, have been obtained from the analysis of band shapes of the 1400 cm−1 bending mode of NH4Cl, NH4Br and NH4I in both the Pm3m and Fm3m phases. The NH 4 + ion seems to undergo relatively free rotation in the high temperature Fm3m phases of these halides.

NMR relaxation study of disorder in the mixed system BP x GPI(1-x) and the low temperature transition from classical to quantum rotation

1H NMR spin-lattice relaxation time (T1) studies have been carried out in the temperature range 100 K to 4 K, at two Larmor frequencies 11.4 and 23.3 MHz, in the mixed system of betaine phosphate and glycine phosphite (BPxGPI(1-x)), to study the effects of disorder on the proton group dynamics. Analysis of T1 data indicates the presence of a number of inequivalent methyl groups and a gradual transition from classical reorientations to quantum tunneling rotations. At lower temperatures, microstructural disorder in the local environments of the methyl groups, result in a distribution in the activation energy (Ea) and the torsional energy gap (E01). For certain values of x, the magnetisation recovery shows biexponential behaviour at lower temperatures.

The possible influence of curvature and rotation on ocean currents

Recent laboratory investigations have shown that rotation and (streamwise) curvature can have spectacular effects on momentum transport in turbulent shear flows. A simple model that takes account of these effects (based on an analogy with buoyant flows) utilises counterparts of the Richardson number Rg and the Monin-Oboukhov length. Estimates of Rg for meanders in ocean currents like the Gulf Stream show it to be of order 1 or more, while laboratory investigations reveal strong effects even at |Rg|∼0·1. These considerations lead to the conclusion that at a cyclonic bend in the Gulf Stream, a highly unstable flow in the outer half of the jet rides over a highly stable flow in the inner half. It is conjectured that the discrepancies noticed between observation and the various theories of Gulf Stream meanders, and such phenomena as the observed detachment of eddies from the Gulf Stream, may be due to the effects of curvature and rotation on turbulent transport.

Comprehensive Path-sensitive Data-flow Analysis

Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex control-flow. W initially perform data-flow analysis to determine those control-flow merges which cause the loss in data-flow analysis precision. The control-flow graph of the program is then restructured such that performing data-flow analysis on the resulting restructured graph gives more precise results. The proposed framework is both simple, involving the familiar notion of product automata, and also general, since it is applicable to any forward data-flow analysis. Apart from proving that our restructuring process is correct, we also show that restructuring is effective in that it necessarily leads to more optimization opportunities. Furthermore, the framework handles the trade-off between the increase in data-flow precision and the code size increase inherent in the restructuring. We show that determining an optimal restructuring is NP-hard, and propose and evaluate a greedy strategy. The framework has been implemented in the Scale research compiler, and instantiated for the specific problem of Constant Propagation. On the SPECINT 2000 benchmark suite we observe an average speedup of 4% in the running times over Wegman-Zadeck conditional constant propagation algorithm and 2% over a purely path profile guided approach.

Distributed Scheduling for Multi-Hop Wireless Networks

We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. We suggest how the greedy heuristic can be implemented in a distributed manner. We evaluate an analytical bound in detail, for the special case of a line graph and also provide a loose bound on the greedy heuristic for the case of an arbitrary graph.

Nuclear Magnetic-Resonance Spectra Of Oriented Biologically Important Molecules - The Structure Of And The Internal-Rotation In N,N-Dimethyluracil

From the proton NMR spectra of Nfl-dimethyluracil oriented in two different nematic solvents, the internal rotation of the methyl groups about the N-C bonds is studied. It has been observed that the preferred conformation of the methyl group having one carbonyl in the vicinity is the one where a C-H bond is in the ring plane pointing toward the carbonyl group. The results are not sensitive to the mode of rotation of the other methyl group. These data are interpreted in terms of the bond polarizations.

Distribution of the angle of rotation plane random walks

We study the probability distribution of the angle by which the tangent to the trajectory rotates in the course of a plane random walk. It is shown that the determination of this distribution function can be reduced to an integral equation, which can be rigorously transformed into a differential equation of Hill's type. We derive the asymptotic distribution for very long walks.

Efficient Energy Management Policies for Networks with Energy Harvesting Sensor Nodes

We study sensor networks with energy harvesting nodes. The generated energy at a node can be stored in a buffer. A sensor node periodically senses a random field and generates a packet. These packets are stored in a queue and transmitted using the energy available at that time at the node. For such networks we develop efficient energy management policies. First, for a single node, we obtain policies that are throughput optimal, i.e., the data queue stays stable for the largest possible data rate. Next we obtain energy management policies which minimize the mean delay in the queue. We also compare performance of several easily implementable suboptimal policies. A greedy policy is identified which, in low SNR regime, is throughput optimal and also minimizes mean delay. Next using the results for a single node, we develop efficient MAC policies.