Lasing in active, sub-mean-free path-sized systems with dense, random, weak scatterers

We report enhanced emission and gain narrowing in Rhodamine 590 perchlorate dye in an aqueous suspension of polystyrene microspheres. A systematic experimental study of the threshold condition for and the gain narrowing of the stimulated emission over a wide range of dye concentrations and scatterer number densities showed several interesting features, even though the transport mean free path far exceeded the system size. The conventional diffusive-reactive approximation to radiative transfer in an inhomogeneously illuminated random amplifying medium, which is valid for a transport mean-free path much smaller than the system size, is clearly inapplicable here. We propose a new probabilistic approach for the present case of dense, random, weak scatterers involving the otherwise rare and ignorable sub-mean-free-path scatterings, now made effective by the high gain in the medium, which is consistent: with experimentally observed features. (C) 1997 Optical Society of America.

Single-Generation Network Coding for Networks with Delay

A single-source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the incoming symbols (received at their incoming edges) on their outgoing edges. Memory-free networks with delay using network coding are forced to do inter-generation network coding, as a result of which the problem of some or all sinks requiring a large amount of memory for decoding is faced. In this work, we address this problem by utilizing memory elements at the internal nodes of the network also, which results in the reduction of the number of memory elements used at the sinks. We give an algorithm which employs memory at all the nodes of the network to achieve single- generation network coding. For fixed latency, our algorithm reduces the total number of memory elements used in the network to achieve single- generation network coding. We also discuss the advantages of employing single-generation network coding together with convolutional network-error correction codes (CNECCs) for networks with unit- delay and illustrate the performance gain of CNECCs by using memory at the intermediate nodes using simulations on an example network under a probabilistic network error model.

Generation of Minimum Leakage Input Vectors with Constrained NBTI Degradation

Technology scaling has caused Negative Bias Temperature Instability (NBTI) to emerge as a major circuit reliability concern. Simultaneously leakage power is becoming a greater fraction of the total power dissipated by logic circuits. As both NBTI and leakage power are highly dependent on vectors applied at the circuit’s inputs, they can be minimized by applying carefully chosen input vectors during periods when the circuit is in standby or idle mode. Unfortunately input vectors that minimize leakage power are not the ones that minimize NBTI degradation, so there is a need for a methodology to generate input vectors that minimize both of these variables.This paper proposes such a systematic methodology for the generation of input vectors which minimize leakage power under the constraint that NBTI degradation does not exceed a specified limit. These input vectors can be applied at the primary inputs of a circuit when it is in standby/idle mode and are such that the gates dissipate only a small amount of leakage power and also allow a large majority of the transistors on critical paths to be in the “recovery” phase of NBTI degradation. The advantage of this methodology is that allowing circuit designers to constrain NBTI degradation to below a specified limit enables tighter guardbanding, increasing performance. Our methodology guarantees that the generated input vector dissipates the least leakage power among all the input vectors that satisfy the degradation constraint. We formulate the problem as a zero-one integer linear program and show that this formulation produces input vectors whose leakage power is within 1% of a minimum leakage vector selected by a search algorithm and simultaneously reduces NBTI by about 5.75% of maximum circuit delay as compared to the worst case NBTI degradation. Our paper also proposes two new algorithms for the identification of circuit paths that are affected the most by NBTI degradation. The number of such paths identified by our algorithms are an order of magnitude fewer than previously proposed heuristics.

Efficacies of multivalent vs monovalent poly(ether imine) dendritic catalysts within a generation in multiple C-C bond forming reactions

Dendrimers are ideal platforms to study multivalent effects due to the presence of uniform end groups at their peripheries. This report concerns with a study of multivalent dendritic catalysts, both within and across dendrimer generations, and their effects to mediate C-C bond forming reactions on multivalent substrates that have two and three acrylate reactive sites. As many as fourteen multivalent dendritic catalysts were prepared using 0-3 generations of poly(propyl ether imine) dendrimers, incorporated with Pd(II) catalytic sites, both within and across the dendrimer generations. C-C Bond forming reactions of these substrates with iodobenzene, mediated by uniform concentration of the metal across all catalysts, showed formation of partially and fully functionalized cinnamates in varying ratios, depending on the extent of clustering of catalytic moieties at the peripheries of dendrimers within a dendrimer generation. In a given generation, higher clustering of catalytic moieties greatly assisted multiple C-C bond formations than presenting the same in lesser number. The studies demonstrate true benefits of clustering catalytic moieties within a dendrimer generation and the beneficial effects applicable to catalysis of substrates presenting more than one reactive center. (C) 2011 Elsevier B.V. All rights reserved.

Search on a fractal lattice using a quantum random walk

The spatial search problem on regular lattice structures in integer number of dimensions d >= 2 has been studied extensively, using both coined and coinless quantum walks. The relativistic Dirac operator has been a crucial ingredient in these studies. Here, we investigate the spatial search problem on fractals of noninteger dimensions. Although the Dirac operator cannot be defined on a fractal, we construct the quantum walk on a fractal using the flip-flop operator that incorporates a Klein-Gordon mode. We find that the scaling behavior of the spatial search is determined by the spectral (and not the fractal) dimension. Our numerical results have been obtained on the well-known Sierpinski gaskets in two and three dimensions.

Completely random nanoporous Cu4O3-CuO-C composite thin films for potential application as multiple channel photonic band gap based filter in the telecommunication wavelengths

In 2003, Babin et al. theoretically predicted (J. Appl. Phys. 94:4244, 2003) that fabrication of organic-inorganic hybrid materials would probably be required to implement structures with multiple photonic band gaps. In tune with their prediction, we report synthesis of such an inorganic-organic nanocomposite, comprising Cu4O3-CuO-C thin films that experimentally exhibit the highest (of any known material) number (as many as eleven) of photonic band gaps in the near infrared. On contrary to the report by Wang et al. (Appl. Phys. Lett. 84:1629, 2004) that photonic crystals with multiple stop gaps require highly correlated structural arrangement such as multilayers of variable thicknesses, we demonstrate experimental realization of multiple stop gaps in completely randomized structures comprising inorganic oxide nanocrystals (Cu4O3 and CuO) randomly embedded in a randomly porous carbonaceous matrix. We report one step synthesis of such nanostructured films through the metalorganic chemical vapor deposition technique using a single source metalorganic precursor, Cu-4(deaH)(dea)(oAc)(5) a <...aEuro parts per thousand(CH3)(2)CO. The films displaying multiple (4/9/11) photonic band gaps with equal transmission losses in the infrared are promising materials to find applications as multiple channel photonic band gap based filter for WDM technology.

Theory and Algorithms for Hop-Count-Based Localization with Random Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes in a region of Euclidean space. Following deployment, the nodes self-organize into a mesh topology with a key aspect being self-localization. Having obtained a mesh topology in a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this work, we analyze this approximation through two complementary analyses. We assume that the mesh topology is a random geometric graph on the nodes; and that some nodes are designated as anchors with known locations. First, we obtain high probability bounds on the Euclidean distances of all nodes that are h hops away from a fixed anchor node. In the second analysis, we provide a heuristic argument that leads to a direct approximation for the density function of the Euclidean distance between two nodes that are separated by a hop distance h. This approximation is shown, through simulation, to very closely match the true density function. Localization algorithms that draw upon the preceding analyses are then proposed and shown to perform better than some of the well-known algorithms present in the literature. Belief-propagation-based message-passing is then used to further enhance the performance of the proposed localization algorithms. To our knowledge, this is the first usage of message-passing for hop-count-based self-localization.

Nonuniform random geometric graphs with location-dependent radii

We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function n f(center dot), where n is an element of N, and f is a probability density function on R-d. A vertex located at x connects via directed edges to other vertices that are within a cut-off distance r(n)(x). We prove strong law results for (i) the critical cut-off function so that almost surely, the graph does not contain any node with out-degree zero for sufficiently large n and (ii) the maximum and minimum vertex degrees. We also provide a characterization of the cut-off function for which the number of nodes with out-degree zero converges in distribution to a Poisson random variable. We illustrate this result for a class of densities with compact support that have at most polynomial rates of decay to zero. Finally, we state a sufficient condition for an enhanced version of the above graph to be almost surely connected eventually.

Multilevel Dodecagonal Voltage Space Vector Generation using Flying Capacitor topology for Induction motor drives

In this paper, a multilevel flying capacitor inverter topology suitable for generating multilevel dodecagonal space vectors for an induction motor drive, is proposed. Because of the dodecagonal space vectors, it has increased modulation range with the absence of all 6n +/- 1, (n=odd) harmonics in the phase voltage and currents. The topology, realized by flying capacitor three level inverters feeding an open-end winding induction motor, does not suffer the neutral point voltage imbalance issues seen in NPC inverters and the capacitors have inherent charge-balancing capability with PWM control using switching state redundancies. Furthermore, the proposed technique uses lesser number of power supplies compared to cascaded H-bridge or NPC based dodecagonal schemes and has better ride-through capability. Finally, the voltage control is obtained through a simple carrier-based space vector PWM scheme implemented on a DSP.

Force Biased Molecular Dynamics Simulation Study of Effect of Dendrimer Generation on Interaction with DNA

We have studied the effect of dendrimer generation on the interaction between dsDNA and the PAMAM dendrimer using force biased simulation of dsDNA with three generations of dendrimer: G3, G4, and G5. Our results for the potential of mean force (PMF) and the dendrimer asphericity along the binding pathway, combined with visualization of the simulations, demonstrate that dendrimer generation has a pronounced impact on the interaction. The PMF increases linearly with increasing generation of the dendrimer. While, in agreement with previous results, we see an increase in the extent to which the dendrimer bends the dsDNA with increasing dendrimer generation, we also see that the deformation of the dendrimer is greater with smaller generation of the dendrimer. The larger dendrimer forces the dsDNA to conform to its structure, while the smaller dendrimer is forced to conform to the structure of the dsDNA. Monitoring the number of bound cations at different values of force bias distance shows the expected effect of ions being expelled when the dendrimer binds dsDNA.

Coulomb-hole summations and energies for GW calculations with limited number of empty orbitals: a modified static remainder approach

Ab initio GW calculations are a standard method for computing the spectroscopic properties of many materials. The most computationally expensive part in conventional implementations of the method is the generation and summation over the large number of empty orbitals required to converge the electron self-energy. We propose a scheme to reduce the summation over empty states by the use of a modified static remainder approximation, which is simple to implement and yields accurate self-energies for both bulk and molecular systems requiring a small fraction of the typical number of empty orbitals.

Identification of fault location in power distribution system with distributed generation using support vector machines

This paper presents a multi-class support vector machine (SVMs) approach for locating and diagnosing faults in electric power distribution feeders with the penetration of Distributed Generations (DGs). The proposed approach is based on the three phase voltage and current measurements which are available at all the sources i.e. substation and at the connection points of DG. To illustrate the proposed methodology, a practical distribution feeder emanating from 132/11kV-grid substation in India with loads and suitable number of DGs at different locations is considered. To show the effectiveness of the proposed methodology, practical situations in distribution systems (DS) such as all types of faults with a wide range of varying fault locations, source short circuit (SSC) levels and fault impedances are considered for studies. The proposed fault location scheme is capable of accurately identify the fault type, location of faulted feeder section and the fault impedance. The results demonstrate the feasibility of applying the proposed method in practical in smart grid distribution automation (DA) for fault diagnosis.

Optimal synthesis of adjustable planar four-bar crank-rocker type mechanisms for approximate multi-path generation

This paper deals with an optimization based method for synthesis of adjustable planar four-bar, crank-rocker mechanisms. For multiple different and desired paths to be traced by a point on the coupler, a two stage method first determines the parameters of the possible driving dyads. Then the remaining mechanism parameters are determined in the second stage where a least-squares based circle-fitting procedure is used. Compared to existing formulations, the optimization method uses less number of design variables. Two numerical examples demonstrate the effectiveness of the proposed synthesis method. (C) 2013 Elsevier Ltd. All rights reserved.

Fault-tolerant secret key generation

Mobile nodes observing correlated data communicate using an insecure bidirectional switch to generate a secret key, which must remain concealed from the switch. We are interested in fault-tolerant secret key rates, i.e., the rates of secret key generated even if a subset of nodes drop out before the completion of the communication protocol. We formulate a new notion of fault-tolerant secret key capacity, and present an upper bound on it. This upper bound is shown to be tight when the random variables corresponding to the observations of nodes are exchangeable. Further, it is shown that one round of interaction achieves the fault-tolerant secret key capacity in this case. The upper bound is also tight for the case of a pairwise independent network model consisting of a complete graph, and can be attained by a noninteractive protocol.

An asymptotically optimal push-pull method for multicasting over a random network

We consider multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent to every other node in the session. If the session does not consist of all the nodes, the remaining nodes act as relays. The nodes are connected by undirected edges whose capacities are independent and identically distributed random variables. We study the asymptotics of the capacity region (with network coding) in the limit of a large number of nodes, and show that the normalized sum rate converges to a constant almost surely. We then provide a decentralized push-pull algorithm that asymptotically achieves this normalized sum rate.