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.

Computational algorithms inspired by biological processes and evolution

In recent times computational algorithms inspired by biological processes and evolution are gaining much popularity for solving science and engineering problems. These algorithms are broadly classified into evolutionary computation and swarm intelligence algorithms, which are derived based on the analogy of natural evolution and biological activities. These include genetic algorithms, genetic programming, differential evolution, particle swarm optimization, ant colony optimization, artificial neural networks, etc. The algorithms being random-search techniques, use some heuristics to guide the search towards optimal solution and speed-up the convergence to obtain the global optimal solutions. The bio-inspired methods have several attractive features and advantages compared to conventional optimization solvers. They also facilitate the advantage of simulation and optimization environment simultaneously to solve hard-to-define (in simple expressions), real-world problems. These biologically inspired methods have provided novel ways of problem-solving for practical problems in traffic routing, networking, games, industry, robotics, economics, mechanical, chemical, electrical, civil, water resources and others fields. This article discusses the key features and development of bio-inspired computational algorithms, and their scope for application in science and engineering fields.

Charge transport in functionalized multi-wall carbon nanotube-Nafion composite

The charge transport in sulfonated multi-wall carbon nanotube (sMWNT)-Nafion composite is reported. The scanning electron microscope images of the composite, at 1 and 10 wt % of sMWNT, show that the nanotubes are well dispersed in polymer matrix, with conductivity values of 0.005 and 3.2 S/cm, respectively; and the percolation threshold is nearly 0.42 wt. %. The exponent (∼0.25) of the temperature dependence of conductivity in both samples indicates Mott's variable range hopping (VRH) transport. The conductance in 1 wt. % sample increases by three orders of magnitude at high electric-fields, consistent with VRH model. The negative magnetoresistance in 10 wt. % sample is attributed to the forward interference scattering mechanism in VRH transport. The ac conductance in 1 wt. % sample is expressed by σ(ω)∝ωs, and the temperature dependence of s follows the correlated barrier hopping model.

Random copolymers consisting of dithienylcyclopentadienone, thiophene and benzothiadiazole for bulk heterojunction solar cells

Novel random copolymers containing dithienylcyclopentadienone, thiophene and benzothiadiazole were synthesized and photovoltaic properties of these materials were evaluated. Thermal, structural, optical and electrochemical characterization of the synthesized copolymers was carried out. These thermally stable copolymers are solution processable unlike the homopolymer. The absorption spectra indicated that with the incorporation of alkyl chains in the thiophene moiety, the onset of absorption increases and hence band gap decreases (1.47 eV to 1.41 eV). Bulk heterojunction solar cells were fabricated with the blend of copolymer and phenyl-C61-butyric acid methyl ester (PCBM) as the active material and device parameters were extracted. The copolymer consists of alkyl thiophene exhibit higher open circuit voltage than the copolymer consisting of thiophene moiety. (c) 2012 Elsevier B.V. All rights reserved.

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.

Conformational dynamics of HIV-1 protease: a comparative molecular dynamics simulation study with multiple amber force fields

Flap dynamics of HIV-1 protease (HIV-pr) controls the entry of inhibitors and substrates to the active site. Dynamical models from previous simulations are not all consistent with each other and not all are supported by the NMR results. In the present work, the er effect of force field on the dynamics of HIV-pr is investigated by MD simulations using three AMBER force fields ff99, ff99SB, and ff03. The generalized order parameters for amide backbone are calculated from the three force fields and compared with the NMR S2 values. We found that the ff99SB and ff03 force field calculated order parameters agree reasonably well with the NMR S2 values, whereas ff99 calculated values deviate most from the NMR order parameters. Stereochemical geometry of protein models from each force field also agrees well with the remarks from NMR S2 values. However, between ff99SB and ff03, there are several differences, most notably in the loop regions. It is found that these loops are, in general, more flexible in the ff03 force field. This results in a larger active site cavity in the simulation with the ff03 force field. The effect of this difference in computer-aided drug design against flexible receptors is discussed.

Interacting fermions in synthetic non-Abelian gauge fields

Generation and study of synthetic gauge fields has enhanced the possibility of using cold atom systems as quantum emulators of condensed matter Hamiltonians. In this article we describe the physics of interacting spin -1/2 fermions in synthetic non-Abelian gauge fields which induce a Rashba spin-orbit interaction on the motion of the fermions. We show that the fermion system can evolve to a Bose-Einstein condensate of a novel boson which we call rashbon. The rashbon-rashbon interaction is shown to be independent of the interaction between the constituent fermions. We also show that spin-orbit coupling can help enhancing superfluid transition temperature of weak superfluids to the order of Fermi temperature. A non-Abelian gauge field, when used in conjunction with another potential, can generate interesting Hamiltonians such as that of a magnetic monopole.

Nodal length fluctuations for arithmetic random waves

Using the spectral multiplicities of the standard torus, we endow the Laplace eigenspaces with Gaussian probability measures. This induces a notion of random Gaussian Laplace eigenfunctions on the torus (''arithmetic random waves''). We study the distribution of the nodal length of random eigenfunctions for large eigenvalues, and our primary result is that the asymptotics for the variance is nonuniversal. Our result is intimately related to the arithmetic of lattice points lying on a circle with radius corresponding to the energy.

Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes

We study the tradeoff between the average error probability and the average queueing delay of messages which randomly arrive to the transmitter of a point-to-point discrete memoryless channel that uses variable rate fixed codeword length random coding. Bounds to the exponential decay rate of the average error probability with average queueing delay in the regime of large average delay are obtained. Upper and lower bounds to the optimal average delay for a given average error probability constraint are presented. We then formulate a constrained Markov decision problem for characterizing the rate of transmission as a function of queue size given an average error probability constraint. Using a Lagrange multiplier the constrained Markov decision problem is then converted to a problem of minimizing the average cost for a Markov decision problem. A simple heuristic policy is proposed which approximately achieves the optimal average cost.

Network-error correcting codes using small fields

Recently, Ebrahimi and Fragouli proposed an algorithm to construct scalar network codes using small fields (and vector network codes of small lengths) satisfying multicast constraints in a given single-source, acyclic network. The contribution of this paper is two fold. Primarily, we extend the scalar network coding algorithm of Ebrahimi and Fragouli (henceforth referred to as the EF algorithm) to block network-error correction. Existing construction algorithms of block network-error correcting codes require a rather large field size, which grows with the size of the network and the number of sinks, and thereby can be prohibitive in large networks. We give an algorithm which, starting from a given network-error correcting code, can obtain another network code using a small field, with the same error correcting capability as the original code. Our secondary contribution is to improve the EF Algorithm itself. The major step in the EF algorithm is to find a least degree irreducible polynomial which is coprime to another large degree polynomial. We suggest an alternate method to compute this coprime polynomial, which is faster than the brute force method in the work of Ebrahimi and Fragouli.

Near-optimal large-MIMO detection using randomized MCMC and randomized search algorithms

Low-complexity near-optimal detection of signals in MIMO systems with large number (tens) of antennas is getting increased attention. In this paper, first, we propose a variant of Markov chain Monte Carlo (MCMC) algorithm which i) alleviates the stalling problem encountered in conventional MCMC algorithm at high SNRs, and ii) achieves near-optimal performance for large number of antennas (e.g., 16×16, 32×32, 64×64 MIMO) with 4-QAM. We call this proposed algorithm as randomized MCMC (R-MCMC) algorithm. Second, we propose an other algorithm based on a random selection approach to choose candidate vectors to be tested in a local neighborhood search. This algorithm, which we call as randomized search (RS) algorithm, also achieves near-optimal performance for large number of antennas with 4-QAM. The complexities of the proposed R-MCMC and RS algorithms are quadratic/sub-quadratic in number of transmit antennas, which are attractive for detection in large-MIMO systems. We also propose message passing aided R-MCMC and RS algorithms, which are shown to perform well for higher-order QAM.

An inquisitive analysis on the temporal variation of return stroke current essential for producing observed remote electro-magnetic fields

The gross characteristics of spatio-temporal current evolution in the return stroke phase of a cloud-to-ground lightning are rather well defined. However, they by themselves do not ensure the salient features for the resulting remote Electro- Magnetic Fields (EMFs). In spite of significant efforts in the engineering models wherein, the spatio-temporal current distribution all along the channel is specified by the design, all the salient features of remote EMFs could not be achieved. Only the current evolution that ensures the basic characteristics along with its ability to reproduce all the salient features of remote EMFs ranging from 50 m – 200 km from the lightning channel, can be considered as a realistic return stroke channel current. In view of this, the present work intends to investigate on the required fine features of the return stroke current evolution that yields all the desired features. To ensure that the current evolution is not arbitrary but obeys the involved basic physical processes, a recently developed physical model will be employed for the analysis.

Random forest algorithm with derived geographical layers for improved classification of remote sensing data

Effective conservation and management of natural resources requires up-to-date information of the land cover (LC) types and their dynamics. The LC dynamics are being captured using multi-resolution remote sensing (RS) data with appropriate classification strategies. RS data with important environmental layers (either remotely acquired or derived from ground measurements) would however be more effective in addressing LC dynamics and associated changes. These ancillary layers provide additional information for delineating LC classes' decision boundaries compared to the conventional classification techniques. This communication ascertains the possibility of improved classification accuracy of RS data with ancillary and derived geographical layers such as vegetation index, temperature, digital elevation model (DEM), aspect, slope and texture. This has been implemented in three terrains of varying topography. The study would help in the selection of appropriate ancillary data depending on the terrain for better classified information.