Optimality Conditions and Duality for Semi-Infinite Mathematical Programming Problem with Equilibrium Constraints

This article considers a semi-infinite mathematical programming problem with equilibrium constraints (SIMPEC) defined as a semi-infinite mathematical programming problem with complementarity constraints. We establish necessary and sufficient optimality conditions for the (SIMPEC). We also formulate Wolfe- and Mond-Weir-type dual models for (SIMPEC) and establish weak, strong and strict converse duality theorems for (SIMPEC) and the corresponding dual problems under invexity assumptions.

Low Complexity Power and Scheduling Policies for Wireless Networks to Provide Quality of Service

We consider optimal power allocation policies for a single server, multiuser system. The power is consumed in transmission of data only. The transmission channel may experience multipath fading. We obtain very efficient, low computational complexity algorithms which minimize power and ensure stability of the data queues. We also obtain policies when the users may have mean delay constraints. If the power required is a linear function of rate then we exploit linearity and obtain linear programs with low complexity.

A transmission electron microscopy and X-ray photoelectron spectroscopy study of annealing induced gamma-phase nucleation, clustering, and interfacial dynamics in reactively sputtered amorphous alumina thin films

Pure alpha-Al2O3 exhibits a very high degree of thermodynamical stability among all metal oxides and forms an inert oxide scale in a range of structural alloys at high temperatures. We report that amorphous Al2O3 thin films sputter deposited over crystalline Si instead show a surprisingly active interface. On annealing, crystallization begins with nuclei of a phase closely resembling gamma-Alumina forming almost randomly in an amorphous matrix, and with increasing frequency near the substrate/film interface. This nucleation is marked by the signature appearance of sharp (400) and (440) reflections and the formation of a diffuse diffraction halo with an outer maximal radius of approximate to 0.23 nm enveloping the direct beam. The microstructure then evolves by a cluster-coalescence growth mechanism suggestive of swift nucleation and sluggish diffusional kinetics, while locally the Al ions redistribute slowly from chemisorbed and tetrahedral sites to higher anion coordinated sites. Chemical state plots constructed from XPS data and simple calculations of the diffraction patterns from hypothetically distorted lattices suggest that the true origins of the diffuse diffraction halo are probably related to a complex change in the electronic structure spurred by the a-gamma transformation rather than pure structural disorder. Concurrent to crystallization within the film, a substantially thick interfacial reaction zone also builds up at the film/substrate interface with the excess Al acting as a cationic source. (C) 2015 AIP Publishing LLC.

Secure Transmission in Cooperative Networks with Weak Eavesdroppers

In this letter, we propose a scheme to improve the secrecy rate of cooperative networks using Analog Network Coding (ANC). ANC mixes the signals in the air; the desired signal is then separated out, from the mixed signals, at the legitimate receiver using techniques like self interference subtraction and signal nulling, thereby achieving better secrecy rates. Assuming global channel state information, memoryless adversaries and the decode-and-forward strategy, we seek to maximize the average secrecy rate between the source and the destination, subject to an overall power budget. Then, exploiting the structure of the optimization problem, we compute its optimal solution. Finally, we use numerical evaluations to compare our scheme with the conventional approaches.

A Generalist Predator Regulating Spread of a Wildlife Disease: Exploring Two Infection Transmission Scenarios

Ecoepidemiology is a well-developed branch of theoretical ecology, which explores interplay between the trophic interactions and the disease spread. In most ecoepidemiological models, however, the authors assume the predator to be a specialist, which consumes only a single prey species. In few existing papers, in which the predator was suggested to be a generalist, the alternative food supply was always considered to be constant. This is obviously a simplification of reality, since predators can often choose between a number of different prey. Consumption of these alternative prey can dramatically change their densities and strongly influence the model predictions. In this paper, we try to bridge the gap and explore a generic ecoepidemiological system with a generalist predator, where the densities of all prey are dynamical variables. The model consists of two prey species, one of which is subject to an infectious disease, and a predator, which consumes both prey species. We investigate two main scenarios of infection transmission mode: (i) the disease transmission rate is predator independent and (ii) the transmission rate is a function of predator density. For both scenarios we fulfil an extensive bifurcation analysis. We show that including a second dynamical prey in the system can drastically change the dynamics of the single prey case. In particular, the presence of a second prey impedes disease spread by decreasing the basic reproduction number and can result in a substantial drop of the disease prevalence. We demonstrate that with efficient consumption of the second prey species by the predator, the predator-dependent disease transmission can not destabilize interactions, as in the case with a specialist predator. Interestingly, even if the population of the second prey eventually vanishes and only one prey species finally remains, the system with two prey species may exhibit different properties to those of the single prey system.

A Polymatroid Approach to Separable Convex Optimization with Linear Ascending Constraints

We revisit a problem studied by Padakandla and Sundaresan SIAM J. Optim., August 2009] on the minimization of a separable convex function subject to linear ascending constraints. The problem arises as the core optimization in several resource allocation problems in wireless communication settings. It is also a special case of an optimization of a separable convex function over the bases of a specially structured polymatroid. We give an alternative proof of the correctness of the algorithm of Padakandla and Sundaresan. In the process we relax some of their restrictions placed on the objective function.

Optimal Power Allocation Policies for Low Powered Wireless Communication Systems

We consider optimal average power allocation policies in a wireless channel in the presence of individual delay constraints on the transmitted packets. Power is consumed in transmission of data only. We consider the case when the power used in transmission is a linear function of the data transmitted. The transmission channel may experience multipath fading. We have developed a computationally efficient online algorithm, when there is same hard delay constraint for all packets. Later on, we generalize it to the case when there are multiple real time streams with different hard deadline constraints. Our algorithm uses linear programming and has very low complexity.

Spatial Modulation Aided Zero-Padded Single Carrier Transmission for Dispersive Channels

In this paper, we consider spatial modulation (SM) operating in a frequency-selective single-carrier (SC) communication scenario and propose zero-padding instead of the cyclic-prefix considered in the existing literature. We show that the zero-padded single-carrier (ZP-SC) SM system offers full multipath diversity under maximum-likelihood (ML) detection, unlike the cyclic-prefix based SM system. Furthermore, we show that the order of ML detection complexity in our proposed ZP-SC SM system is independent of the frame length and depends only on the number of multipath links between the transmitter and the receiver. Thus, we show that the zero-padding applied in the SC SM system has two advantages over the cyclic prefix: 1) achieves full multipath diversity, and 2) imposes a relatively low ML detection complexity. Furthermore, we extend the partial interference cancellation receiver (PIC-R) proposed by Guo and Xia for the detection of space-time block codes (STBCs) in order to convert the ZP-SC system into a set of narrowband subsystems experiencing flat-fading. We show that full rank STBC transmissions over these subsystems achieves full transmit, receive as well as multipath diversity for the PIC-R. Furthermore, we show that the ZP-SC SM system achieves receive and multipath diversity for the PIC-R at a detection complexity order which is the same as that of the SM system in flat-fading scenario. Our simulation results demonstrate that the symbol error ratio performance of the proposed linear receiver for the ZP-SC SM system is significantly better than that of the SM in cyclic prefix based orthogonal frequency division multiplexing as well as of the SM in the cyclic-prefixed and zero-padded single carrier systems relying on zero-forcing/minimum mean-squared error equalizer based receivers.

A Physical Model for Inception and Propagation of Upward Lightning Leader from a 1200 kV AC Power Transmission Line

UHV power transmission lines have high probability of shielding failure due to their higher height, larger exposure area and high operating voltage. Lightning upward leader inception and propagation is an integral part of lightning shielding failure analysis and need to be studied in detail. In this paper a model for lightning attachment has been proposed based on the present knowledge of lightning physics. Leader inception is modeled based on the corona charge present near the conductor region and the propagation model is based on the correlation between the lightning induced voltage on the conductor and the drop along the upward leader channel. The inception model developed is compared with previous inception models and the results obtained using the present and previous models are comparable. Lightning striking distances (final jump) for various return stroke current were computed for different conductor heights. The computed striking distance values showed good correlation with the values calculated using the equation proposed by the IEEE working group for the applicable conductor heights of up to 8 m. The model is applied to a 1200 kV AC power transmission line and inception of the upward leader is analyzed for this configuration.

An Alternating l(p) - l(2) Projections Algorithm (ALPA) for Speech Modeling using Sparsity Constraints

We address the problem of separating a speech signal into its excitation and vocal-tract filter components, which falls within the framework of blind deconvolution. Typically, the excitation in case of voiced speech is assumed to be sparse and the vocal-tract filter stable. We develop an alternating l(p) - l(2) projections algorithm (ALPA) to perform deconvolution taking into account these constraints. The algorithm is iterative, and alternates between two solution spaces. The initialization is based on the standard linear prediction decomposition of a speech signal into an autoregressive filter and prediction residue. In every iteration, a sparse excitation is estimated by optimizing an l(p)-norm-based cost and the vocal-tract filter is derived as a solution to a standard least-squares minimization problem. We validate the algorithm on voiced segments of natural speech signals and show applications to epoch estimation. We also present comparisons with state-of-the-art techniques and show that ALPA gives a sparser impulse-like excitation, where the impulses directly denote the epochs or instants of significant excitation.

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints

The 3-Hitting Set problem involves a family of subsets F of size at most three over an universe U. The goal is to find a subset of U of the smallest possible size that intersects every set in F. The version of the problem with parity constraints asks for a subset S of size at most k that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the intersections of S with each set in the family F. In particular, an odd (even) set is a hitting set that hits every set at either one or three (two) elements, and a perfect code is a hitting set that intersects every set at exactly one element. These questions are of fundamental interest in many contexts for general set systems. Just as for Hitting Set, we find these questions to be interesting for the case of families consisting of sets of size at most three. In this work, we initiate an algorithmic study of these problems in this special case, focusing on a parameterized analysis. We show, for each problem, efficient fixed-parameter tractable algorithms using search trees that are tailor-made to the constraints in question, and also polynomial kernels using sunflower-like arguments in a manner that accounts for equivalence under the additional parity constraints.

Constraints based analysis of extended cybernetic models

The cybernetic modeling framework provides an interesting approach to model the regulatory phenomena occurring in microorganisms. In the present work, we adopt a constraints based approach to analyze the nonlinear behavior of the extended equations of the cybernetic model. We first show that the cybernetic model exhibits linear growth behavior under the constraint of no resource allocation for the induction of the key enzyme. We then quantify the maximum achievable specific growth rate of microorganisms on mixtures of substitutable substrates under various kinds of regulation and show its use in gaining an understanding of the regulatory strategies of microorganisms. Finally, we show that Saccharomyces cerevisiae exhibits suboptimal dynamic growth with a long diauxic lag phase when growing on a mixture of glucose and galactose and discuss on its potential to achieve optimal growth with a significantly reduced diauxic lag period. The analysis carried out in the present study illustrates the utility of adopting a constraints based approach to understand the dynamic growth strategies of microorganisms. (C) 2015 Elsevier Ireland Ltd. All rights reserved.

Asparagine requirement in Plasmodium berghei as a target to prevent malaria transmission and liver infections

The proteins of Plasmodium, the malaria parasite, are strikingly rich in asparagine. Plasmodium depends primarily on host haemoglobin degradation for amino acids and has a rudimentary pathway for amino acid biosynthesis, but retains a gene encoding asparagine synthetase (AS). Here we show that deletion of AS in Plasmodium berghei (Pb) delays the asexual-and liver-stage development with substantial reduction in the formation of ookinetes, oocysts and sporozoites in mosquitoes. In the absence of asparagine synthesis, extracellular asparagine supports suboptimal survival of PbAS knockout (KO) parasites. Depletion of blood asparagine levels by treating PbASKO-infected mice with asparaginase completely prevents the development of liver stages, exflagellation of male gametocytes and the subsequent formation of sexual stages. In vivo supplementation of asparagine in mice restores the exflagellation of PbASKO parasites. Thus, the parasite life cycle has an absolute requirement for asparagine, which we propose could be targeted to prevent malaria transmission and liver infections.

Physical constraints, fundamental limits, and optimal locus of operating points for an inverted pendulum based actuated dynamic walker

The inverted pendulum is a popular model for describing bipedal dynamic walking. The operating point of the walker can be specified by the combination of initial mid-stance velocity (v(0)) and step angle (phi(m)) chosen for a given walk. In this paper, using basic mechanics, a framework of physical constraints that limit the choice of operating points is proposed. The constraint lines thus obtained delimit the allowable region of operation of the walker in the v(0)-phi(m) plane. A given average forward velocity v(x,) (avg) can be achieved by several combinations of v(0) and phi(m). Only one of these combinations results in the minimum mechanical power consumption and can be considered the optimum operating point for the given v(x, avg). This paper proposes a method for obtaining this optimal operating point based on tangency of the power and velocity contours. Putting together all such operating points for various v(x, avg,) a family of optimum operating points, called the optimal locus, is obtained. For the energy loss and internal energy models chosen, the optimal locus obtained has a largely constant step angle with increasing speed but tapers off at non-dimensional speeds close to unity.

CheepSync: A Time Synchronization Service for Resource Constrained Bluetooth LE Advertisers

Clock synchronization is highly desirable in distributed systems, including many applications in the Internet of Things and Humans. It improves the efficiency, modularity, and scalability of the system, and optimizes use of event triggers. For IoTH, BLE - a subset of the recent Bluetooth v4.0 stack - provides a low-power and loosely coupled mechanism for sensor data collection with ubiquitous units (e.g., smartphones and tablets) carried by humans. This fundamental design paradigm of BLE is enabled by a range of broadcast advertising modes. While its operational benefits are numerous, the lack of a common time reference in the broadcast mode of BLE has been a fundamental limitation. This article presents and describes CheepSync, a time synchronization service for BLE advertisers, especially tailored for applications requiring high time precision on resource constrained BLE platforms. Designed on top of the existing Bluetooth v4.0 standard, the CheepSync framework utilizes low-level time-stamping and comprehensive error compensation mechanisms for overcoming uncertainties in message transmission, clock drift, and other system-specific constraints. CheepSync was implemented on custom designed nRF24Cheep beacon platforms (as broadcasters) and commercial off-the-shelf Android ported smartphones (as passive listeners). We demonstrate the efficacy of CheepSync by numerous empirical evaluations in a variety of experimental setups, and show that its average (single-hop) time synchronization accuracy is in the 10 mu s range.