Minimization Problems Based on Relative alpha-Entropy II: Reverse Projection

In part I of this two-part work, certain minimization problems based on a parametric family of relative entropies (denoted I-alpha) were studied. Such minimizers were called forward I-alpha-projections. Here, a complementary class of minimization problems leading to the so-called reverse I-alpha-projections are studied. Reverse I-alpha-projections, particularly on log-convex or power-law families, are of interest in robust estimation problems (alpha > 1) and in constrained compression settings (alpha < 1). Orthogonality of the power-law family with an associated linear family is first established and is then exploited to turn a reverse I-alpha-projection into a forward I-alpha-projection. The transformed problem is a simpler quasi-convex minimization subject to linear constraints.

On Locally Gabriel Geometric Graphs

Let be a set of points in the plane. A geometric graph on is said to be locally Gabriel if for every edge in , the Euclidean disk with the segment joining and as diameter does not contain any points of that are neighbors of or in . A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any , there exists LGG with edges. This improves upon the previous best bound of . (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any point set, there exists an independent set of size .

A Variant of the Hadwiger-Debrunner (p, q)-Problem in the Plane

Let X be a convex curve in the plane (say, the unit circle), and let be a family of planar convex bodies such that every two of them meet at a point of X. Then has a transversal of size at most . Suppose instead that only satisfies the following ``(p, 2)-condition'': Among every p elements of , there are two that meet at a common point of X. Then has a transversal of size . For comparison, the best known bound for the Hadwiger-Debrunner (p, q)-problem in the plane, with , is . Our result generalizes appropriately for if is, for example, the moment curve.

Ir nanoparticles-anchored reduced graphene oxide as a catalyst for oxygen electrode in Li-O-2 cells

Iridium nanoparticles-anchored reduced graphene oxide (Ir-RGO) was prepared by simultaneous reduction of graphene oxide and Ir3+ ions and its catalytic activity for oxygen electrode in Li-O-2 cells was demonstrated. Ir particles with an average size of 3.9 nm were uniformly distributed on RGO sheets. The oxygen reduction reaction (ORR) was studied on an Ir-RGO catalyst in non-aqueous electrolytes using cyclic voltammetry and rotating disk electrode techniques. Li-O-2 cells with Ir-RGO as a bifunctional oxygen electrode catalyst were subjected to charge-discharge cycling at several current densities. A discharge capacity of 9529 mA h g(-1) (11.36 mA h cm(-2)) was obtained initially at a current density of 0.5 mA cm(-2) (393 mA g(-1)). A decrease in capacity was observed on increasing the current density. Although there was a decrease in capacity on repeated discharge-charge cycling initially, a stable capacity was observed for about 30 cycles. The results suggest that Ir-RGO is a useful catalyst for rechargeable Li-O-2 cells.

A Simple Label Switching Algorithm for Semisupervised Structural SVMs

In structured output learning, obtaining labeled data for real-world applications is usually costly, while unlabeled examples are available in abundance. Semisupervised structured classification deals with a small number of labeled examples and a large number of unlabeled structured data. In this work, we consider semisupervised structural support vector machines with domain constraints. The optimization problem, which in general is not convex, contains the loss terms associated with the labeled and unlabeled examples, along with the domain constraints. We propose a simple optimization approach that alternates between solving a supervised learning problem and a constraint matching problem. Solving the constraint matching problem is difficult for structured prediction, and we propose an efficient and effective label switching method to solve it. The alternating optimization is carried out within a deterministic annealing framework, which helps in effective constraint matching and avoiding poor local minima, which are not very useful. The algorithm is simple and easy to implement. Further, it is suitable for any structured output learning problem where exact inference is available. Experiments on benchmark sequence labeling data sets and a natural language parsing data set show that the proposed approach, though simple, achieves comparable generalization performance.

A Zero-Crossing Rate Property of Power Complementary Analysis Filterbank Outputs

We establish zero-crossing rate (ZCR) relations between the input and the subbands of a maximally decimated M-channel power complementary analysis filterbank when the input is a stationary Gaussian process. The ZCR at lag is defined as the number of sign changes between the samples of a sequence and its 1-sample shifted version, normalized by the sequence length. We derive the relationship between the ZCR of the Gaussian process at lags that are integer multiples of Al and the subband ZCRs. Based on this result, we propose a robust iterative autocorrelation estimator for a signal consisting of a sum of sinusoids of fixed amplitudes and uniformly distributed random phases. Simulation results show that the performance of the proposed estimator is better than the sample autocorrelation over the SNR range of -6 to 15 dB. Validation on a segment of a trumpet signal showed similar performance gains.

Comparative study of Eu3+ -activated LnOCl (Ln=La and Gd) phosphors and their Judd-Ofelt analysis

Eu3+-activated layered LnOCl (Ln=La and Gd) phosphors were synthesized by the conventional solid-state method at relatively low temperature (700 degrees C) and shorter duration of 2 h. The structural parameters were refined by the Rietveld refinement analysis and confirmed by the high resolution transmission electron microscopy (HRTEM). Both the compounds were crystallized in the tetragonal structure with space group P4/nmm (No. 129). The homogeneity of the elements were analyzed by TEM mapping and found to be uniformly distributed. The photoluminescence spectra revealed that the intensity of D-5(0)-> F-7(2) transition (619 nm) was more intense in Eu3+-activated GdOCl compared to LaOCl. This was due to the property of Gd3+ ions to act as an intermediate sublattice to facilitate the energy transfer to Eu3+ ions. Intensity parameters and radiative properties such as transition probabilities, radiative lifetime and branching ratio were calculated using the Judd-Ofelt theory. The CIE color coordinates result revealed that the Eu3+-activated GdOCl (0.641, 0.354) phosphor was close to the commercial red phosphors like, Y2O3:Eu3+ (0.645, 0.347), (Y2OS)-S-2:Eu3+ (0.647, 0.343) and National Television System Committee (NTSC) (0.67, 0.33). The results suggest that the present GdOCl:Eu3+ compound acts as a potential candidate for red phosphor materials.

Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.

Necessary and sufficient conditions for optimality in constrained general sum stochastic games

In this paper we first derive a necessary and sufficient condition for a stationary strategy to be the Nash equilibrium of discounted constrained stochastic game under certain assumptions. In this process we also develop a nonlinear (non-convex) optimization problem for a discounted constrained stochastic game. We use the linear best response functions of every player and complementary slackness theorem for linear programs to derive both the optimization problem and the equivalent condition. We then extend this result to average reward constrained stochastic games. Finally, we present a heuristic algorithm motivated by our necessary and sufficient conditions for a discounted cost constrained stochastic game. We numerically observe the convergence of this algorithm to Nash equilibrium. (C) 2015 Elsevier B.V. All rights reserved.

Event-triggered Sampling and Reconstruction of Sparse Real-valued Trigonometric Polynomials

We propose data acquisition from continuous-time signals belonging to the class of real-valued trigonometric polynomials using an event-triggered sampling paradigm. The sampling schemes proposed are: level crossing (LC), close to extrema LC, and extrema sampling. Analysis of robustness of these schemes to jitter, and bandpass additive gaussian noise is presented. In general these sampling schemes will result in non-uniformly spaced sample instants. We address the issue of signal reconstruction from the acquired data-set by imposing structure of sparsity on the signal model to circumvent the problem of gap and density constraints. The recovery performance is contrasted amongst the various schemes and with random sampling scheme. In the proposed approach, both sampling and reconstruction are non-linear operations, and in contrast to random sampling methodologies proposed in compressive sensing these techniques may be implemented in practice with low-power circuitry.

Secure Communication in Amplify-and-Forward Networks with Multiple Eavesdroppers: Decoding with SNR Thresholds

The problem of secure unicast communication over a two hop Amplify-and-Forward wireless relay network with multiple eavesdroppers is considered. Assuming that a receiver (destination or eavesdropper) can decode a message only if the received SNR is above a predefined threshold, we consider this problem in two scenarios. In the first scenario, we maximize the SNR at the legitimate destination, subject to the condition that the received SNR at each eavesdropper is below the target threshold. Due to the non-convex nature of the objective function and eavesdroppers' constraints, we transform variables and obtain a quadratically constrained quadratic program (QCQP) with convex constraints, which can be solved efficiently. When the constraints are not convex, we consider a semidefinite relaxation (SDR) to obtain computationally efficient approximate solution. In the second scenario, we minimize the total power consumed by all relay nodes, subject to the condition that the received SNR at the legitimate destination is above the threshold and at every eavesdropper, it is below the corresponding threshold. We propose a semidefinite relaxation of the problem in this scenario and also provide an analytical lower bound.

Global response sensitivity analysis of uncertain structures

The problem of characterizing global sensitivity indices of structural response when system uncertainties are represented using probabilistic and (or) non-probabilistic modeling frameworks (which include intervals, convex functions, and fuzzy variables) is considered. These indices are characterized in terms of distance measures between a fiducial model in which uncertainties in all the pertinent variables are taken into account and a family of hypothetical models in which uncertainty in one or more selected variables are suppressed. The distance measures considered include various probability distance measures (Hellinger,l(2), and the Kantorovich metrics, and the Kullback-Leibler divergence) and Hausdorff distance measure as applied to intervals and fuzzy variables. Illustrations include studies on an uncertainly parametered building frame carrying uncertain loads. (C) 2015 Elsevier Ltd. All rights reserved.

Anomalous lifetime statistics of ligand-receptor binding in a tethered polymer system

In this paper, motivated by observations of non-exponential decay times in the stochastic binding and release of ligand-receptor systems, exemplified by the work of Rogers et al on optically trapped DNA-coated colloids (Rogers et al 2013 Soft Matter 9 6412), we explore the general problem of polymer-mediated surface adhesion using a simplified model of the phenomenon in which a single polymer molecule, fixed at one end, binds through a ligand at its opposite end to a flat surface a fixed distance L away and uniformly covered with receptor sites. Working within the Wilemski-Fixman approximation to diffusion-controlled reactions, we show that for a flexible Gaussian chain, the predicted distribution of times f(t) for which the ligand and receptor are bound is given, for times much shorter than the longest relaxation time of the polymer, by a power law of the form t(-1/4). We also show when the effects of chain stiffness are incorporated into this model (approximately), the structure of f(t) is altered to t(-1/2). These results broadly mirror the experimental trends in the work cited above.

Pattern formation in thin films of polymer solutions: Theory and simulations

Self-assembly has been recognized as an efficient tool for generating a wide range of functional, chemically, or physically textured surfaces for applications in small scale devices. In this work, we investigate the stability of thin films of polymer solutions. For low concentrations of polymer in the solution, long length scale dewetting patterns are obtained with wavelength approximately few microns. Whereas, for concentrations above a critical value, bimodal dispersion curves are obtained with the dominant wavelength being up to two orders smaller than the usual dewetting length scale. We further show that the short wavelength corresponds to the phase separation in the film resulting in uniformly distributed high and low concentration regions. Interestingly, due to the solvent entropy, at very high concentration values of polymer, a re-entrant behaviour is observed with the dominant length scale now again corresponding to the dewetting wavelength. Thus, we show that the binary films of polymer solutions provide additional control parameters that can be utilized for generating functional textured surfaces for various applications. (C) 2016 AIP Publishing LLC.

Two-Phase Metallic Thermal Interface Materials Processed Through Liquid Phase Sintering Followed by Accumulative Roll Bonding

Thermal interface materials (TIMs) form a mechanical and thermal link between a heat source and a heat sink. Thus, they should have high thermal conductivity and high compliance to efficiently transfer heat and accommodate any differential strain between the heat source and the sink, respectively. This paper reports on the processing and the characterization of potential metallic TIM composite solders comprising of Cu, a high conductivity phase, uniformly embedded in In matrix, a highly compliant phase. We propose the fabrication of such a material by a two-step fabrication technique comprising of liquid phase sintering (LPS) followed by accumulative roll bonding (ARB). To demonstrate the efficacy of the employed two-step processing technique, an In-40 vol. % Cu composite solder was produced first using LPS with short sintering periods (30 or 60 s at 160 degrees C) followed by ARB up to five passes, each pass imposing a strain of 50%. Mechanical response and electrical and thermal conductivities of the fabricated samples were evaluated. It was observed that processing through ARB homogenizes the distribution of Cu in an In matrix, disintegrates the agglomerates of Cu powders, and also significantly increases thermal and electrical conductivities, almost attaining theoretically predicted values, without significantly increasing the flow stress. Furthermore, the processing technique also allows the insertion of desired foreign species, such as reduced graphene oxide, in In-Cu for further enhancing a target property, such as electrical conductivity.