Optimal Hop Distance and Power Control for a Single Cell, Dense, Ad Hoc Wireless Network

We consider a dense, ad hoc wireless network, confined to a small region. The wireless network is operated as a single cell, i.e., only one successful transmission is supported at a time. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organize into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention-based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first motivate that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc wireless network (described above) as a single cell, we study the hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (t) (1/eta), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterization of the optimal operating point. Simulation results are provided comparing the performance of the optimal strategy derived here with some simple strategies for operating the network.

An integrated model for optimal reservoir operation for irrigation of multiple crops

An integratedm odel is developed,b asedo n seasonailn puts of reservoiri nflow and rainfall in the irrigated area, to determine the optimal reservoir release policies and irrigation allocationst o multiple crops.T he model is conceptuallym ade up of two modules. Module 1 is an intraseasonal allocation model to maximize the sum of relative yieldso f all crops,f or a givens tateo f the systemu, singl inear programming(L P). The module takes into account reservoir storage continuity, soil moisture balance, and crop root growthw ith time. Module 2 is a seasonaal llocationm odel to derive the steadys tate reservoiro peratingp olicyu sings tochastidc ynamicp rogramming(S DP). Reservoir storage, seasonal inflow, and seasonal rainfall are the state variables in the SDP. The objective in SDP is to maximize the expected sum of relative yields of all crops in a year.The resultso f module 1 and the transitionp robabilitieso f seasonailn flow and rainfall form the input for module 2. The use of seasonailn puts coupledw ith the LP-SDP solution strategy in the present formulation facilitates in relaxing the limitations of an earlier study,w hile affectinga dditionali mprovementsT. he model is applied to an existing reservoir in Karnataka State, India.

Optimal incentive timing strategies for product marketing on social networks

We consider the problem of devising incentive strategies for viral marketing of a product. In particular, we assume that the seller can influence penetration of the product by offering two incentive programs: a) direct incentives to potential buyers (influence) and b) referral rewards for customers who influence potential buyers to make the purchase (exploit connections). The problem is to determine the optimal timing of these programs over a finite time horizon. In contrast to algorithmic perspective popular in the literature, we take a mean-field approach and formulate the problem as a continuous-time deterministic optimal control problem. We show that the optimal strategy for the seller has a simple structure and can take both forms, namely, influence-and-exploit and exploit-and-influence. We also show that in some cases it may optimal for the seller to deploy incentive programs mostly for low degree nodes. We support our theoretical results through numerical studies and provide practical insights by analyzing various scenarios.

A divide and conquer strategy for scaling weather simulations with multiple regions of interest

Accurate and timely prediction of weather phenomena, such as hurricanes and flash floods, require high-fidelity compute intensive simulations of multiple finer regions of interest within a coarse simulation domain. Current weather applications execute these nested simulations sequentially using all the available processors, which is sub-optimal due to their sub-linear scalability. In this work, we present a strategy for parallel execution of multiple nested domain simulations based on partitioning the 2-D processor grid into disjoint rectangular regions associated with each domain. We propose a novel combination of performance prediction, processor allocation methods and topology-aware mapping of the regions on torus interconnects. Experiments on IBM Blue Gene systems using WRF show that the proposed strategies result in performance improvement of up to 33% with topology-oblivious mapping and up to additional 7% with topology-aware mapping over the default sequential strategy.

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).

Optimal Trajectory Generation for Convergence to a Rectilinear Path

This paper presents a strategy to determine the shortest path of a fixed-wing Miniature Air Vehicle (MAV), constrained by a bounded turning rate, to eventually fly along a given straight line, starting from an arbitrary but known initial position and orientation. Unlike the work available in the literature that solves the problem using the Pontryagin's Minimum Principle (PMP) the trajectory generation algorithm presented here considers a geometrical approach which is intuitive and easy to understand. This also computes the explicit solution for the length of the optimal path as a function of the initial configuration. Further, using a 6-DOF model of a MAV the generated optimal path is tracked by an autopilot consisting of proportional-integral-derivative (PID) controllers. The simulation results show the path generation and tracking for different cases.

Incoherence-based optimal selection of independent measurements in diffuse optical tomography

An optimal measurement selection strategy based on incoherence among rows (corresponding to measurements) of the sensitivity (or weight) matrix for the near infrared diffuse optical tomography is proposed. As incoherence among the measurements can be seen as providing maximum independent information into the estimation of optical properties, this provides high level of optimization required for knowing the independency of a particular measurement on its counterparts. The proposed method was compared with the recently established data-resolution matrix-based approach for optimal choice of independent measurements and shown, using simulated and experimental gelatin phantom data sets, to be superior as it does not require an optimal regularization parameter for providing the same information. (C) 2014 Society of Photo-Optical Instrumentation Engineers (SPIE)

Optimal control of information epidemics modeled as Maki Thompson rumors

We model the spread of information in a homogeneously mixed population using the Maki Thompson rumor model. We formulate an optimal control problem, from the perspective of single campaigner, to maximize the spread of information when the campaign budget is fixed. Control signals, such as advertising in the mass media, attempt to convert ignorants and stiflers into spreaders. We show the existence of a solution to the optimal control problem when the campaigning incurs non-linear costs under the isoperimetric budget constraint. The solution employs Pontryagin's Minimum Principle and a modified version of forward backward sweep technique for numerical computation to accommodate the isoperimetric budget constraint. The techniques developed in this paper are general and can be applied to similar optimal control problems in other areas. We have allowed the spreading rate of the information epidemic to vary over the campaign duration to model practical situations when the interest level of the population in the subject of the campaign changes with time. The shape of the optimal control signal is studied for different model parameters and spreading rate profiles. We have also studied the variation of the optimal campaigning costs with respect to various model parameters. Results indicate that, for some model parameters, significant improvements can be achieved by the optimal strategy compared to the static control strategy. The static strategy respects the same budget constraint as the optimal strategy and has a constant value throughout the campaign horizon. This work finds application in election and social awareness campaigns, product advertising, movie promotion and crowdfunding campaigns. (C) 2014 Elsevier B.V. All rights reserved.

Multimodal therapy for complete regression of malignant melanoma using constrained nonlinear optimal dynamic inversion

Using a realistic nonlinear mathematical model for melanoma dynamics and the technique of optimal dynamic inversion (exact feedback linearization with static optimization), a multimodal automatic drug dosage strategy is proposed in this paper for complete regression of melanoma cancer in humans. The proposed strategy computes different drug dosages and gives a nonlinear state feedback solution for driving the number of cancer cells to zero. However, it is observed that when tumor is regressed to certain value, then there is no need of external drug dosages as immune system and other therapeutic states are able to regress tumor at a sufficiently fast rate which is more than exponential rate. As model has three different drug dosages, after applying dynamic inversion philosophy, drug dosages can be selected in optimized manner without crossing their toxicity limits. The combination of drug dosages is decided by appropriately selecting the control design parameter values based on physical constraints. The process is automated for all possible combinations of the chemotherapy and immunotherapy drug dosages with preferential emphasis of having maximum possible variety of drug inputs at any given point of time. Simulation study with a standard patient model shows that tumor cells are regressed from 2 x 107 to order of 105 cells because of external drug dosages in 36.93 days. After this no external drug dosages are required as immune system and other therapeutic states are able to regress tumor at greater than exponential rate and hence, tumor goes to zero (less than 0.01) in 48.77 days and healthy immune system of the patient is restored. Study with different chemotherapy drug resistance value is also carried out. (C) 2014 Elsevier Ltd. All rights reserved.

Campaigning in Heterogeneous Social Networks: Optimal Control of SI Information Epidemics

We study the optimal control problem of maximizing the spread of an information epidemic on a social network. Information propagation is modeled as a susceptible-infected (SI) process, and the campaign budget is fixed. Direct recruitment and word-of-mouth incentives are the two strategies to accelerate information spreading (controls). We allow for multiple controls depending on the degree of the nodes/individuals. The solution optimally allocates the scarce resource over the campaign duration and the degree class groups. We study the impact of the degree distribution of the network on the controls and present results for Erdos-Renyi and scale-free networks. Results show that more resource is allocated to high-degree nodes in the case of scale-free networks, but medium-degree nodes in the case of Erdos-Renyi networks. We study the effects of various model parameters on the optimal strategy and quantify the improvement offered by the optimal strategy over the static and bang-bang control strategies. The effect of the time-varying spreading rate on the controls is explored as the interest level of the population in the subject of the campaign may change over time. We show the existence of a solution to the formulated optimal control problem, which has nonlinear isoperimetric constraints, using novel techniques that is general and can be used in other similar optimal control problems. This work may be of interest to political, social awareness, or crowdfunding campaigners and product marketing managers, and with some modifications may be used for mitigating biological epidemics.

Telomere structure, replication and length maintenance

Telomeres are the termini of linear eukaryotic chromosomes consisting of tandem repeats of DNA and proteins that bind to these repeat sequences. Telomeres ensure the complete replication of chromosome ends, impart protection to ends from nucleolytic degradation, end-to-end fusion, and guide the localization of chromosomes within the nucleus. In addition, a combination of genetic, biochemical, and molecular biological approaches have implicated key roles for telomeres in diverse cellular processes such as regulation of gene expression, cell division, cell senescence, and cancer. This review focuses on recent advances in our understanding of the organization of telomeres, telomere replication, proteins that bind telomeric DNA, and the establishment of telomere length equilibrium.

Importance of amino-terminus in maintenance of oligomeric structure of cytosolic serine hydroxymethyltransferase

The role of the amino and carboxyl-terminal regions of cytosolic serine hydroxymethyltransferase (SHMT) in subunit assembly and catalysis was studied using six amino-terminal (lacking the first 6, 14, 30, 49, 58, and 75 residues) and two carboxyl-terminal (lacking the last 49 and 185 residues) deletion mutants. These mutants were constructed from a full length cDNA clone using restriction enzyme/PCR-based methods and overexpressed in Escherichia coli. The overexpressed proteins, des-(A1-K6)-SHMT and des-(A1- W14)-SHMT were present in the soluble fraction and they were purified to homogeneity. The deletion clones, for des-(A1–V30)-SHMT and des-(A1–L49)-SHMT were expressed at very low levels, whereas des-(A1–R58)-SHMT, des-(A1–G75)-SHMT, des-(Q435–F483)-SHMT and des-(L299-F483)-SHMT mutant proteins were not soluble and formed inclusion bodies. Des-(A1–K6)-SHMT and des-(A1–W14)-SHMT catalyzed both the tetrahydrofolate-dependent and tetrahydrofolate-independent reactions, generating characteristic spectral intermediates with glycine and tetrahydrofolate. The two mutants had similar kinetic parameters to that of the recombinant SHMT (rSHMT). However, at 55 °C, the des-(A1–W14)-SHMT lost almost all the activity within 5 min, while at the same temperature rSHMT and des-(A1–K6)-SHMT retained 85% and 70% activity, respectively. Thermal denaturation studies showed that des-(A1–W14)-SHMT had a lower apparent melting temperature (52°C) compared to rSHMT (56°C) and des-(A1–K6)-SHMT (55 °C), suggesting that N-terminal deletion had resulted in a decrease in the thermal stability of the enzyme. Further, urea induced inactivation of the enzymes revealed that 50% inactivation occurred at a lower urea concentration (1.2 ± 0.1 M) in the case of des-(A1–W14)-SHMT compared to rSHMT (1.8 ±0.1 M) and des-(A1–K6)-SHMT (1.7 ±0.1 M). The apoenzyme of des-(A1- W14)-SHMT was present predominantly in the dimer form, whereas the apoenzymes of rSHMT and des-(A1–K6)-SHMT were a mixture of tetramers (≈75% and ≈65%, respectively) and dimers. While, rSHMT and des-(A1–K6)-SHMT apoenzymes could be reconstituted upon the addition of pyridoxal-5'-phosphate to 96% and 94% enzyme activity, respectively, des-(A1–W14)-SHMT apoenzyme could be reconstituted only upto 22%. The percentage activity regained correlated with the appearance of visible CD at 425 nm and with the amount of enzyme present in the tetrameric form upon reconstitution as monitored by gel filtration. These results demonstrate that, in addition to the cofactor, the N-terminal arm plays an important role in stabilizing the tetrameric structure of SHMT.

Importance of the amino terminus in maintenance of oligomeric structure of sheep liver cytosolic serine hydroxymethyltransferase

The Role Of The Amino And Carboxyl-Terminal Regions Of Cytosolic Serine Hydroxymethyltransferase (SHMT) In Subunit Assembly And Catalysis Was Studied Using Sis Amino-Terminal (Lacking The First 6, 14, 30, 49, 58, And 75 Residues) And Two Carboxyl-Terminal (Lacking The Last 49 And 185 Residues) Deletion Mutants. These Mutants Were Constructed From A Full Length Cdna Clone Using Restriction Enzyme/PCR-Based Methods And Overexpressed In Escherichia Coli. The Overexpressed Proteins, Des-(A1-K6) SHMT And Des-(A1-W14)-SHMT Were Present In The Soluble Fraction And They Were Purified To Homogeneity. The Deletion Clones, For Des-(A1-V30)-SHMT And Des-(A1-L49)-SHMT Were Expressed At Very Low Levels, Whereas Des-(A1-R58)-SHMT, Des-/A1-G75)-SHMT, Des-(Q435-F483)-SHMT And Des-(L299-F483)-SHMT Mutant Proteins Were Not Soluble And Formed Inclusion Bodies. Des-(A1-K6)-SHMT And Des-(A1-W14)-SHMT Catalyzed Both The Tetrahydrofolate-Dependent And Tetrahydrofolate-Independent Reactions, Generating Characteristic Spectral Intermediates With Glycine And Tetrahydrofolate. The Two Mutants Had Similar Kinetic Parameters To That Of The Recombinant SHMT (Rshmt). However, At 55 Degrees C, The Des-(A1-W14)-SHMT Lost Almost All The Activity Within 5 Min, While At The Same Temperature Rshmt And Des-(A1-K6)-SHMT Retained 85% And 70% Activity, Respectively. Thermal Denaturation Studies Showed That Des-(A1-W14)-SHMT Had A Lower Apparent Melting Temperature (52 Degrees C) Compared To Rshmt (56 Degrees C) And Des-(A1-K6)-SHMT (55 Degrees C), Suggesting That N-Terminal Deletion Had Resulted In A Decrease In The Thermal Stability Of The Enzyme. Further Urea Induced Inactivation Of The Enzymes Revealed That 50% Inactivation Occurred At A Lower Urea Concentration (1.2+/-0.1 M) In The Case Of Des-(A1-W14)-SHMT Compared To Rshmt (1.8+/-0.1 M) And Des-(A1 -K6)-SHMT (1.7+/-0.1 M). The Apoenzyme Of Des-/A1-K6)-SHMT Was Present Predominantly In The Dimer Form, Whereas The Apoenzymes Of Rshmt And Des-(A1-K6)-SHMT Were A Mixture Of Tetramers (Approximate To 75% And Approximate To 65%, Respectively) And Dimers. While, Rshmt And Des-(A1-K6)-SHMT Apoenzymes Could Be Reconstituted Upon The Addition Of Pyridoxal-5'-Phosphate To 96% And 94% Enzyme Activity, Respectively Des-(A1-W14)-SHMT Apoenzyme Could Be Reconstituted Only Upto 22%. The Percentage Activity Refined Correlated With The Appearance Of Visible CD At 425 Nm And With The Amount Of Enzyme Present In The Tetrameric Form Upon Reconstitution As Monitored By Gel Filtration. These Results Demonstrate That, In Addition To The Cofactor, The N-Terminal Arm Plays An Important Role In Stabilizing The Tetrameric Structure Of SHMT.

Optimal barrier subdivision for Kramers' escape rate

We examine the effect of subdividing the potential barrier along the reaction coordinate on Kramers' escape rate for a model potential. Using the known supersymmetric potential approach, we show the existence of an optimal number of subdivisions that maximizes the rate.

Hybrid structural control using magnetorheological dampers for base isolated structures

In this paper two nonlinear model based control algorithms have been developed to monitor the magnetorheological (MR) damper voltage. The main advantage of the proposed algorithms is that it is possible to directly monitor the voltage required to control the structural vibration considering the effect of the supplied and commanded voltage dynamics of the damper. The efficiency of the proposed techniques has been shown and compared taking an example of a base isolated three-storey building under a set of seismic excitations. Comparison of the performances with a fuzzy based intelligent control algorithm and a widely used clipped optimal strategy has also been shown.