New phase unwrapping strategy for rapid and dense 3D data acquisition in structured light approach

Sinusoidal structured light projection (SSLP) technique, specifically-phase stepping method, is in widespread use to obtain accurate, dense 3-D data. But, if the object under investigation possesses surface discontinuities, phase unwrapping (an intermediate step in SSLP) stage mandatorily require several additional images, of the object with projected fringes (of different spatial frequencies), as input to generate a reliable 3D shape. On the other hand, Color-coded structured light projection (CSLP) technique is known to require a single image as in put, but generates sparse 3D data. Thus we propose the use of CSLP in conjunction with SSLP to obtain dense 3D data with minimum number of images as input. This approach is shown to be significantly faster and reliable than temporal phase unwrapping procedure that uses a complete exponential sequence. For example, if a measurement with the accuracy obtained by interrogating the object with 32 fringes in the projected pattern is carried out with both the methods, new strategy proposed requires only 5 frames as compared to 24 frames required by the later method.

Orientational relaxation in a random dipolar lattice: Wave-number and frequency dependence

In order to understand the role of translational modes in the orientational relaxation in dense dipolar liquids, we have carried out a computer ''experiment'' where a random dipolar lattice was generated by quenching only the translational motion of the molecules of an equilibrated dipolar liquid. The lattice so generated was orientationally disordered and positionally random. The detailed study of orientational relaxation in this random dipolar lattice revealed interesting differences from those of the corresponding dipolar liquid. In particular, we found that the relaxation of the collective orientational correlation functions at the intermediate wave numbers was markedly slower at the long times for the random lattice than that of the liquid. This verified the important role of the translational modes in this regime, as predicted recently by the molecular theories. The single-particle orientational correlation functions of the random lattice also decayed significantly slowly at long times, compared to those of the dipolar liquid.

Energy-Efficient Decentralized Cooperative Routing in Wireless Networks

Wireless adhoc networks transmit information from a source to a destination via multiple hops in order to save energy and, thus, increase the lifetime of battery-operated nodes. The energy savings can be especially significant in cooperative transmission schemes, where several nodes cooperate during one hop to forward the information to the next node along a route to the destination. Finding the best multi-hop transmission policy in such a network which determines nodes that are involved in each hop, is a very important problem, but also a very difficult one especially when the physical wireless channel behavior is to be accounted for and exploited. We model the above optimization problem for randomly fading channels as a decentralized control problem - the channel observations available at each node define the information structure, while the control policy is defined by the power and phase of the signal transmitted by each node. In particular, we consider the problem of computing an energy-optimal cooperative transmission scheme in a wireless network for two different channel fading models: (i) slow fading channels, where the channel gains of the links remain the same for a large number of transmissions, and (ii) fast fading channels, where the channel gains of the links change quickly from one transmission to another. For slow fading, we consider a factored class of policies (corresponding to local cooperation between nodes), and show that the computation of an optimal policy in this class is equivalent to a shortest path computation on an induced graph, whose edge costs can be computed in a decentralized manner using only locally available channel state information (CSI). For fast fading, both CSI acquisition and data transmission consume energy. Hence, we need to jointly optimize over both these; we cast this optimization problem as a large stochastic optimization problem. We then jointly optimize over a set of CSI functions of the local channel states, and a c- - orresponding factored class of control poli.

Practical Algorithms For Mean Velocity Estimation In Pulse Doppler Weather Radars Using A Small Number Of Samples

Doppler weather radars with fast scanning rates must estimate spectral moments based on a small number of echo samples. This paper concerns the estimation of mean Doppler velocity in a coherent radar using a short complex time series. Specific results are presented based on 16 samples. A wide range of signal-to-noise ratios are considered, and attention is given to ease of implementation. It is shown that FFT estimators fare poorly in low SNR and/or high spectrum-width situations. Several variants of a vector pulse-pair processor are postulated and an algorithm is developed for the resolution of phase angle ambiguity. This processor is found to be better than conventional processors at very low SNR values. A feasible approximation to the maximum entropy estimator is derived as well as a technique utilizing the maximization of the periodogram. It is found that a vector pulse-pair processor operating with four lags for clear air observation and a single lag (pulse-pair mode) for storm observation may be a good way to estimate Doppler velocities over the entire gamut of weather phenomena.

Interrogating an insect society

Insect societies such as those of ants, bees, and wasps consist of 1 or a small number of fertile queens and a large number of sterile or nearly sterile workers. While the queens engage in laying eggs, workers perform all other tasks such as nest building, acquisition and processing of food, and brood care. How do such societies function in a coordinated and efficient manner? What are the rules that individuals follow? How are these rules made and enforced? These questions are of obvious interest to us as fellow social animals but how do we interrogate an insect society and seek answers to these questions? In this article I will describe my research that was designed to see answers from an insect society to a series of questions of obvious interest to us. I have chosen the Indian paper wasp Ropalidia marginata for this purpose, a species that is abundantly distributed in peninsular India and serves as an excellent model system. An important feature of this species is that queens and workers are morphologically identical and physiologically nearly so. How then does an individual become a queen? How does the queen suppress worker reproduction? How does the queen regulate the nonreproductive activities of the workers? What is the function of aggression shown by different individuals? How and when is the queen's heir decided? I will show how such questions can indeed be investigated and will emphasize the need for a whole range of different techniques of observation and experimentation.

On the number of two-line and three-line latin rectangles - an alternative approach

The number of two-line and three-line Latin rectangles is obtained by recursive methods in a setting slightly more general than usually considered. We show how this leads to a generalisation which is proved elsewhere.

Number and proportion of selenocucleosides in the transfer RNA of escherichia-coli

tRNA isolated from escherichia-coli grown in a medium containing [75Se] sodium selenosulfate was converted to nucleosides and analysed for selenonucleosides on a phosphocellulose column. Upon chromatography of the nucleosides on phosphocellulose column, the radioactivity resolved into three peaks. The first peak consisted of free selenium and traces of undigested nucleotides. The second peak was identified as 4-selenouridine by co-chromatographing with an authentic sample of 4-selenouridine. The identity of the third peak was not established. The second and third peaks represented 93% and 7% of the selenium present in nucleosides respectively.

Number and proportion of selenocucleosides in the transfer RNA of Image Image

tRNA isolated from . grown in a medium containing [75Se] sodium selenosulfate was converted to nucleosides and analysed for selenonucleosides on a phosphocellulose column. Upon chromatography of the nucleosides on phosphocellulose column, the radioactivity resolved into three peaks. The first peak consisted of free selenium and traces of undigested nucleotides. The second peak was identified as 4-selenouridine by co-chromatographing with an authentic sample of 4-selenouridine. The identity of the third peak was not established. The second and third peaks represented 93% and 7% of the selenium present in nucleosides respectively.

Experimental investigation of cowl shape and location on inlet characteristics at hypersonic Mach number

An experimental study is presented to show the effect of the cowl location and shape on the shock interaction phenomena in the inlet region for a 2D, planar scramjet inlet model. Investigations include schlieren visualization around the cowl region and heat transfer rate measurement inside the inlet chamber.Both regular and Mach reflections are observed when the forebody ramp shock reflects from the cowl plate. Mach stem heights of 3.3 mm and 4.1 mm are measured in 18.5 mm and 22.7 mm high inlet chambers respecively. Increased heat transfer rate is measured at the same location of chamber for cowls of longer lenghs is indicating additional mass flow recovery by the inlet.

Nature of dependence of spin-orbit splittings on atomic number

It has been shown that Dirac equation employing a constant value of the screening constant Z0 does not explain the variation of spin-orbit splittings of 2p and 3p levels with atomic number Z. A model which takes into account the variation of Z0 withZ is shown to satisfactorily predict the dependence of spinorbit splittings onZ.

Singular value decomposition based computationally efficient algorithm for rapid dynamic near-infrared diffuse optical tomography

Purpose: A computationally efficient algorithm (linear iterative type) based on singular value decomposition (SVD) of the Jacobian has been developed that can be used in rapid dynamic near-infrared (NIR) diffuse optical tomography. Methods: Numerical and experimental studies have been conducted to prove the computational efficacy of this SVD-based algorithm over conventional optical image reconstruction algorithms. Results: These studies indicate that the performance of linear iterative algorithms in terms of contrast recovery (quantitation of optical images) is better compared to nonlinear iterative (conventional) algorithms, provided the initial guess is close to the actual solution. The nonlinear algorithms can provide better quality images compared to the linear iterative type algorithms. Moreover, the analytical and numerical equivalence of the SVD-based algorithm to linear iterative algorithms was also established as a part of this work. It is also demonstrated that the SVD-based image reconstruction typically requires O(NN2) operations per iteration, as contrasted with linear and nonlinear iterative methods that, respectively, requir O(NN3) and O(NN6) operations, with ``NN'' being the number of unknown parameters in the optical image reconstruction procedure. Conclusions: This SVD-based computationally efficient algorithm can make the integration of image reconstruction procedure with the data acquisition feasible, in turn making the rapid dynamic NIR tomography viable in the clinic to continuously monitor hemodynamic changes in the tissue pathophysiology.

A note on the Hadwiger number of circular arc graphs

The intention of this note is to motivate the researchers to study Hadwiger's conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G, and let χ(G) denote its chromatic number. Hadwiger's conjecture states that η(G)greater-or-equal, slantedχ(G) and is one of the most important and difficult open problems in graph theory. From the point of view of researchers who are sceptical of the validity of the conjecture, it is interesting to study the conjecture for graph classes where η(G) is guaranteed not to grow too fast with respect to χ(G), since such classes of graphs are indeed a reasonable place to look for possible counterexamples. We show that in any circular arc graph G, η(G)less-than-or-equals, slant2χ(G)−1, and there is a family with equality. So, it makes sense to study Hadwiger's conjecture for this family.