Effect of orientational motion of mobile chromophores on the dynamics of Forster energy transfer in polymers

Brownian dynamics (BD) simulations have been carried out to explore the effects of the orientational motion of the donor-acceptor (D-A) chromophore pair on the Forster energy transfer between the D-A pair embedded in a polymer chain in solution. It is found that the usually employed orientational averaging (that is, replacing the orientational factor, kappa, by kappa (2) = 2/3) may lead to an error in the estimation of the rate of the reaction by about 20%. In the limit of slow orientational relaxation, the preaveraging of the orientational factor leads to an overestimation of the rate, while in the opposite limit of very fast orientational relaxation, the usual scheme underestimates the rate. The latter results from an interesting interplay between reaction and diffusion. On the other hand, when one of the chromophores is fixed, the preaveraged rate is found to be fairly reliable if the rotational relaxation of the chromophore is sufficiently fast. The present study also reveals a power law dependence of the FRET rate on the chain length (rate proportional to N- alpha, with alpha approximate to 2.6).

Motion of a charged particle in superposed Heliotron and biconical cusp fields

We have studied the behaviour of a charged particle in an axially symmetric magnetic field having a neutral point, so as to find a possibility of confining a charged particle in a thermonuclear device. In order to study the motion we have reduced a three-dimensional motion to a two-dimensional one by introducing a fictitious potential. Following Schmidt we have classified the motion, as an ‘off-axis motion’ and ‘encircling motion’ depending on the behaviour of this potential. We see that the particle performs a hybrid type of motion in the negative z-axis, i.e. at some instant it is in ‘off-axis motion’ while at another instant it is in ‘encircling motion’. We have also solved the equation of motion numerically and the graphs of the particle trajectory verify our analysis. We find that in most of the cases the particle is contained. The magnetic moment is found to be moderately adiabatic.

Some properties of boundary layer flow during the transition from laminar to turbulent motion

Transition in the boundary layer on a flat plate is examined from the point of view of intermittent production of turbulent spots. On the hypothesis of localized laminar breakdown, for which there is some expermental evidence, Emmons’ probability calculations can be extended to explain the observed statistical similarity of transition regions. Application of these ideas allows detailed calculations of the boundary layer parameters including mean velocity profiles and skin friction during transition. The mean velocity profiles belong to a universal one-parameter family with the intermittency factor as the parameter. From an examination of experimental data the probable existence of a relation between the transition Reynolds number and the rate of production of the turbulent spots is deduced. A simple new technique for the measurement of the intermittency factor by a Pitot tube is reported.

The collective dynamics of self-propelled particles

We propose a method for the dynamic simulation of a collection of self-propelled particles in a viscous Newtonian fluid. We restrict attention to particles whose size and velocity are small enough that the fluid motion is in the creeping flow regime. We propose a simple model for a self-propelled particle, and extended the Stokesian Dynamics method to conduct dynamic simulations of a collection of such particles. In our description, each particle is treated as a sphere with an orientation vector p, whose locomotion is driven by the action of a force dipole Sp of constant magnitude S0 at a point slightly displaced from its centre. To simplify the calculation, we place the dipole at the centre of the particle, and introduce a virtual propulsion force Fp to effect propulsion. The magnitude F0 of this force is proportional to S0. The directions of Sp and Fp are determined by p. In isolation, a self-propelled particle moves at a constant velocity u0 p, with the speed u0 determined by S0. When it coexists with many such particles, its hydrodynamic interaction with the other particles alters its velocity and, more importantly, its orientation. As a result, the motion of the particle is chaotic. Our simulations are not restricted to low particle concentration, as we implement the full hydrodynamic interactions between the particles, but we restrict the motion of particles to two dimensions to reduce computation. We have studied the statistical properties of a suspension of self-propelled particles for a range of the particle concentration, quantified by the area fraction φa. We find several interesting features in the microstructure and statistics. We find that particles tend to swim in clusters wherein they are in close proximity. Consequently, incorporating the finite size of the particles and the near-field hydrodynamic interactions is of the essence. There is a continuous process of breakage and formation of the clusters. We find that the distributions of particle velocity at low and high φa are qualitatively different; it is close to the normal distribution at high φa, in agreement with experimental measurements. The motion of the particles is diffusive at long time, and the self-diffusivity decreases with increasing φa. The pair correlation function shows a large anisotropic build-up near contact, which decays rapidly with separation. There is also an anisotropic orientation correlation near contact, which decays more slowly with separation. Movies are available with the online version of the paper.

An Adaptive Feature Based Low Power Motion Estimation Algorithm

Motion Estimation is one of the most power hungry operations in video coding. While optimal search (eg. full search)methods give best quality, non optimal methods are often used in order to reduce cost and power. Various algorithms have been used in practice that trade off quality vs. complexity. Global elimination is an algorithm based on pixel averaging to reduce complexity of motion search while keeping performance close to that of full search. We propose an adaptive version of the global elimination algorithm that extracts individual macro-block features using Hadamard transform to optimize the search. Performance achieved is close to the full search method and global elimination. Operational complexity and hence power is reduced by 30% to 45% compared to global elimination method.

REDEFINE: Architecture of a SoC Fabric for Runtime Composition of Computation Structures

In this paper we propose the architecture of a SoC fabric onto which applications described in a HLL are synthesized. The fabric is a homogeneous layout of computation, storage and communication resources on silicon. Through a process of composition of resources (as opposed to decomposition of applications), application specific computational structures are defined on the fabric at runtime to realize different modules of the applications in hardware. Applications synthesized on this fabric offers performance comparable to ASICs while retaining the programmability of processing cores. We outline the application synthesis methodology through examples, and compare our results with software implementations on traditional platforms with unbounded resources.

Redundancy resolution using a tractrix and its application to real-time simulations of hyper-redundant manipulators, snakes and tying of knots

To realistically simulate the motion of flexible objects such as ropes, strings, snakes, or human hair,one strategy is to discretise the object into a large number of small rigid links connected by rotary or spherical joints. The discretised system is highly redundant and the rotations at the joints (or the motion of the other links) for a desired Cartesian motion of the end of a link cannot be solved uniquely. In this paper, we propose a novel strategy to resolve the redundancy in such hyper-redundant systems.We make use of the classical tractrix curve and its attractive features. For a desired Cartesian motion of the `head'of a link, the `tail' of the link is moved according to a tractrix,and recursively all links of the discretised objects are moved along different tractrix curves. We show that the use of a tractrix curve leads to a more `natural' motion of the entire object since the motion is distributed uniformly along the entire object with the displacements tending to diminish from the `head' to the `tail'. We also show that the computation of the motion of the links can be done in real time since it involves evaluation of simple algebraic, trigonometric and hyperbolic functions. The strategy is illustrated by simulations of a snake, tying of knots with a rope and a solution of the inverse kinematics of a planar hyper-redundant manipulator.

Capacity Optimizing Hop Distance in a Mobile Ad Hoc Network with Power Control

In a dense multi-hop network of mobile nodes capable of applying adaptive power control, we consider the problem of finding the optimal hop distance that maximizes a certain throughput measure in bit-metres/sec, subject to average network power constraints. The mobility of nodes is restricted to a circular periphery area centered at the nominal location of nodes. We incorporate only randomly varying path-loss characteristics of channel gain due to the random motion of nodes, excluding any multi-path fading or shadowing effects. Computation of the throughput metric in such a scenario leads us to compute the probability density function of random distance between points in two circles. Using numerical analysis we discover that choosing the nearest node as next hop is not always optimal. Optimal throughput performance is also attained at non-trivial hop distances depending on the available average network power.

The Future of Computation

The purpose of life is to obtain knowledge, use it to live with as much satisfaction as possible, and pass it on with improvements and modifications to the next generation.'' This may sound philosophical, and the interpretation of words may be subjective, yet it is fairly clear that this is what all living organisms--from bacteria to human beings--do in their life time. Indeed, this can be adopted as the information theoretic definition of life. Over billions of years, biological evolution has experimented with a wide range of physical systems for acquiring, processing and communicating information. We are now in a position to make the principles behind these systems mathematically precise, and then extend them as far as laws of physics permit. Therein lies the future of computation, of ourselves, and of life.