Optimal capacity relay node placement in a multi-hop network on a line

We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of optimal placement of relay nodes along the straight line joining a source node and a destination node. The achievable rate formulas that we utilize are for full-duplex radios at the relays and decode-and-forward relaying. For the single relay case, and individual power constraints at the source node and the relay node, we provide explicit formulas for the optimal relay location and the optimal power allocation to the source-relay channel, for the exponential and the power-law path-loss channel models. For the multiple relay case, we consider exponential path-loss and a total power constraint over the source and the relays, and derive an optimization problem, the solution of which provides the optimal relay locations. Numerical results suggest that at low attenuation the relays are mostly clustered close to the source in order to be able to cooperate among themselves, whereas at high attenuation they are uniformly placed and work as repeaters. We also prove that a constant rate independent of the attenuation in the network can be achieved by placing a large enough number of relay nodes uniformly between the source and the destination, under the exponential path-loss model with total power constraint.

Simultaneous attitude control and trajectory tracking of a micro quadrotor: a SNAC aided nonlinear dynamic inversion approach

This paper presents an advanced single network adaptive critic (SNAC) aided nonlinear dynamic inversion (NDI) approach for simultaneous attitude control and trajectory tracking of a micro-quadrotor. Control of micro-quadrotors is a challenging problem due to its small size, strong coupling in pitch-yaw-roll and aerodynamic effects that often need to be ignored in the control design process to avoid mathematical complexities. In the proposed SNAC aided NDI approach, the gains of the dynamic inversion design are selected in such a way that the resulting controller behaves closely to a pre-synthesized SNAC controller for the output regulation problem. However, since SNAC is based on optimal control theory, it makes the dynamic inversion controller to operate near optimal and enhances its robustness property as well. More important, it retains two major benefits of dynamic inversion: (i) closed form expression of the controller and (ii) easy scalability to command tracking application even without any apriori knowledge of the reference command. Effectiveness of the proposed controller is demonstrated from six degree-of-freedom simulation studies of a micro-quadrotor. It has also been observed that the proposed SNAC aided NDI approach is more robust to modeling inaccuracies, as compared to the NDI controller designed independently from time domain specifications.

IRES mediated translational regulation of p53 isoforms

p53 is a well known tumor suppressor protein that plays a critical role in cell cycle arrest and apoptosis. It has several isoforms which are produced by transcriptional and posttranscriptional regulatory mechanisms. p53 mRNA has been demonstrated to be translated into two isoforms, full-length p53 (FL-p53) and a truncated isoform N-p53 by the use of alternative translation initiation sites. The mechanism of translation regulation of these two isoforms was further elucidated by the discovery of IRES elements in the p53 mRNA. These two IRESs were shown to regulate the translation of p53 and N-p53 in a distinct cell-cycle phase-dependent manner. This review focuses on the current understanding of the regulation of p53 IRES mediated translation and the role of cis and trans acting factors that influence expression of p53 isoforms. (C) 2013 John Wiley & Sons, Ltd.

Power and delay optimal policies for wireless systems

In this paper we consider a single discrete time queue with infinite buffer. The channel may experience fading. The transmission rate is a linear function of power used for transmission. In this scenario we explicitly obtain power control policies which minimize mean power and/or mean delay. There may also be peak power constraint.

Protumorigenic actions of S100A2 involve regulation of PI3/Akt signaling and functional interaction with Smad3

S100 family of calcium-binding proteins is commonly upregulated in a variety of tumor types and is often associated with tumor progression. Among several S100 members, altered expression of S100A2 is a potential diagnostic and prognostic marker in cancer. Several reports suggest a role for S100A2 in metastasis. Earlier, our studies established regulation of S100A2 by transforming growth factor- (TGF-) and its involvement in TGF--mediated cancer cell invasion and migration. However, the molecular mechanisms of S100A2 protumorigenic actions remain unexplored. In the present study, we demonstrate that overexpression of S100A2 in A549 lung cancer cells induced epithelialmesenchymal transition (EMT) followed by increased invasion, loose colony morphology in soft agar and enhanced Akt phosphorylation (Ser-473). Furthermore, overexpression of S100A2 led to increased tumor growth in immunocompromised mice. In agreement, immunohistochemical examination of resected xenograft tumors established inverse correlation between S100A2 and E-cadherin expression together with activated Akt signaling. Interestingly, our study demonstrates a strong dependence of S100A2 and Smad3 in TGF--induced Hep3B cell EMT and invasion. Most importantly, we demonstrate that these effects of S100A2 are manifested through functional interaction with Smad3, which is enhanced in the presence of high calcium and TGF-. S100A2 stabilizes Smad3 and binds to its C-terminal MH2 domain. Additionally, loss of S100A2 attenuates the transcription of TGF-/Smad3 target genes involved in tumor promotion, such as PA1-1 and vimentin. Collectively, our findings present the first mechanistic details of S100A2 protumorigenic actions and its involvement in TGF--mediated cancer cell invasion and EMT.

Drosophila Erect wing (Ewg) controls mitochondrial fusion during muscle growth and maintenance by regulation of the Opa1-like gene

Mitochondrial biogenesis and morphological changes are associated with tissue-specific functional demand, but the factors and pathways that regulate these processes have not been completely identified. A lack of mitochondrial fusion has been implicated in various developmental and pathological defects. The spatiotemporal regulation of mitochondrial fusion in a tissue such as muscle is not well understood. Here, we show in Drosophila indirect flight muscles (IFMs) that the nuclear-encoded mitochondrial inner membrane fusion gene, Opa1-like, is regulated in a spatiotemporal fashion by the transcription factor/co-activator Erect wing (Ewg). In IFMs null for Ewg, mitochondria undergo mitophagy and/or autophagy accompanied by reduced mitochondrial functioning and muscle degeneration. By following the dynamics of mitochondrial growth and shape in IFMs, we found that mitochondria grow extensively and fuse during late pupal development to form the large tubular mitochondria. Our evidence shows that Ewg expression during early IFM development is sufficient to upregulate Opa1-like, which itself is a requisite for both late pupal mitochondrial fusion and muscle maintenance. Concomitantly, by knocking down Opa1-like during early muscle development, we show that it is important for mitochondrial fusion, muscle differentiation and muscle organization. However, knocking down Opa1-like, after the expression window of Ewg did not cause mitochondrial or muscle defects. This study identifies a mechanism by which mitochondrial fusion is regulated spatiotemporally by Ewg through Opa1-like during IFM differentiation and growth.

SEP-Optimal Transmit Power Policy for Peak Power and Interference Outage Probability Constrained Underlay Cognitive Radios

In underlay cognitive radio (CR), a secondary user (SU) can transmit concurrently with a primary user (PU) provided that it does not cause excessive interference at the primary receiver (PRx). The interference constraint fundamentally changes how the SU transmits, and makes link adaptation in underlay CR systems different from that in conventional wireless systems. In this paper, we develop a novel, symbol error probability (SEP)-optimal transmit power adaptation policy for an underlay CR system that is subject to two practically motivated constraints, namely, a peak transmit power constraint and an interference outage probability constraint. For the optimal policy, we derive its SEP and a tight upper bound for MPSK and MQAM constellations when the links from the secondary transmitter (STx) to its receiver and to the PRx follow the versatile Nakagami-m fading model. We also characterize the impact of imperfectly estimating the STx-PRx link on the SEP and the interference. Extensive simulation results are presented to validate the analysis and evaluate the impact of the constraints, fading parameters, and imperfect estimates.

A novel MCMC algorithm for near-optimal detection in large-scale uplink mulituser MIMO systems

In this paper, we propose a low-complexity algorithm based on Markov chain Monte Carlo (MCMC) technique for signal detection on the uplink in large scale multiuser multiple input multiple output (MIMO) systems with tens to hundreds of antennas at the base station (BS) and similar number of uplink users. The algorithm employs a randomized sampling method (which makes a probabilistic choice between Gibbs sampling and random sampling in each iteration) for detection. The proposed algorithm alleviates the stalling problem encountered at high SNRs in conventional MCMC algorithm and achieves near-optimal performance in large systems with M-QAM. A novel ingredient in the algorithm that is responsible for achieving near-optimal performance at low complexities is the joint use of a randomized MCMC (R-MCMC) strategy coupled with a multiple restart strategy with an efficient restart criterion. Near-optimal detection performance is demonstrated for large number of BS antennas and users (e.g., 64, 128, 256 BS antennas/users).

Low-complexity near-optimal signal detection in underdetermined large-MIMO systems

In this paper, we consider signal detection in nt × nr underdetermined MIMO (UD-MIMO) systems, where i) nt >; nr with a overload factor α = nt over nr >; 1, ii) nt symbols are transmitted per channel use through spatial multiplexing, and iii) nt, nr are large (in the range of tens). A low-complexity detection algorithm based on reactive tabu search is considered. A variable threshold based stopping criterion is proposed which offers near-optimal performance in large UD-MIMO systems at low complexities. A lower bound on the maximum likelihood (ML) bit error performance of large UD-MIMO systems is also obtained for comparison. The proposed algorithm is shown to achieve BER performance close to the ML lower bound within 0.6 dB at an uncoded BER of 10-2 in 16 × 8 V-BLAST UD-MIMO system with 4-QAM (32 bps/Hz). Similar near-ML performance results are shown for 32 × 16, 32 × 24 V-BLAST UD-MIMO with 4-QAM/16-QAM as well. A performance and complexity comparison between the proposed algorithm and the λ-generalized sphere decoder (λ-GSD) algorithm for UD-MIMO shows that the proposed algorithm achieves almost the same performance of λ-GSD but at a significantly lesser complexity.

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.

Optimal Forwarding in Delay-Tolerant Networks With Multiple Destinations

We study the tradeoff between delivery delay and energy consumption in a delay-tolerant network in which a message (or a file) has to be delivered to each of several destinations by epidemic relaying. In addition to the destinations, there are several other nodes in the network that can assist in relaying the message. We first assume that, at every instant, all the nodes know the number of relays carrying the message and the number of destinations that have received the message. We formulate the problem as a controlled continuous-time Markov chain and derive the optimal closed-loop control (i.e., forwarding policy). However, in practice, the intermittent connectivity in the network implies that the nodes may not have the required perfect knowledge of the system state. To address this issue, we obtain an ordinary differential equation (ODE) (i.e., a deterministic fluid) approximation for the optimally controlled Markov chain. This fluid approximation also yields an asymptotically optimal open-loop policy. Finally, we evaluate the performance of the deterministic policy over finite networks. Numerical results show that this policy performs close to the optimal closed-loop policy.

A NEAR OPTIMAL PROJECTION FOR SPARSE REPRESENTATION BASED CLASSIFICATION

Sparse representation based classification (SRC) is one of the most successful methods that has been developed in recent times for face recognition. Optimal projection for Sparse representation based classification (OPSRC)1] provides a dimensionality reduction map that is supposed to give optimum performance for SRC framework. However, the computational complexity involved in this method is too high. Here, we propose a new projection technique using the data scatter matrix which is computationally superior to the optimal projection method with comparable classification accuracy with respect OPSRC. The performance of the proposed approach is benchmarked with various publicly available face database.

Optimal Timer-Based Best Node Selection for Wireless Systems with Unknown Number of Nodes

The distributed, low-feedback, timer scheme is used in several wireless systems to select the best node from the available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal metric-to-timer mappings for the practical scenario where the number of nodes is unknown. We consider two cases in which the probability distribution of the number of nodes is either known a priori or is unknown. In the first case, the optimal mapping maximizes the success probability averaged over the probability distribution. In the second case, a robust mapping maximizes the worst case average success probability over all possible probability distributions on the number of nodes. Results reveal that the proposed mappings deliver significant gains compared to the mappings considered in the literature.

STOKES' SYSTEM IN A DOMAIN WITH OSCILLATING BOUNDARY: HOMOGENIZATION AND ERROR ANALYSIS OF AN INTERIOR OPTIMAL CONTROL PROBLEM

Homogenization and error analysis of an optimal interior control problem in the framework of Stokes' system, on a domain with rapidly oscillating boundary, are the subject matters of this article. We consider a three dimensional domain constituted of a parallelepiped with a large number of rectangular cylinders at the top of it. An interior control is applied in a proper subdomain of the parallelepiped, away from the oscillating volume. We consider two types of functionals, namely a functional involving the L-2-norm of the state variable and another one involving its H-1-norm. The asymptotic analysis of optimality systems for both cases, when the cross sectional area of the rectangular cylinders tends to zero, is done here. Our major contribution is to derive error estimates for the state, the co-state and the associated pressures, in appropriate functional spaces.

Optimal trajectory planning for path convergence in three-dimensional space

This article addresses the problem of determining the shortest path that connects a given initial configuration (position, heading angle, and flight path angle) to a given rectilinear or a circular path in three-dimensional space for a constant speed and turn-rate constrained aerial vehicle. The final path is assumed to be located relatively far from the starting point. Due to its simplicity and low computational requirements the algorithm can be implemented on a fixed-wing type unmanned air vehicle in real time in missions where the final path may change dynamically. As wind has a very significant effect on the flight of small aerial vehicles, the method of optimal path planning is extended to meet the same objective in the presence of wind comparable to the speed of the aerial vehicles. But, if the path to be followed is closer to the initial point, an off-line method based on multiple shooting, in combination with a direct transcription technique, is used to obtain the optimal solution. Optimal paths are generated for a variety of cases to show the efficiency of the algorithm. Simulations are presented to demonstrate tracking results using a 6-degrees-of-freedom model of an unmanned air vehicle.