Multiplexing in multiple imaging through the theta modulation technique

We apply the theta modulation technique to simultaneously multiple image more than one object independently with a Fourier plane sampling type of multiple imaging system. Experimental results of multiple imaging two objects is presented.

Study of the random vibration of nonlinear systems by the Gaussian closure technique

A technique is developed to study random vibration of nonlinear systems. The method is based on the assumption that the joint probability density function of the response variables and input variables is Gaussian. It is shown that this method is more general than the statistical linearization technique in that it can handle non-Gaussian excitations and amplitude-limited responses. As an example a bilinear hysteretic system under white noise excitation is analyzed. The prediction of various response statistics by this technique is in good agreement with other available results.

Fabrication of device quality films of high loaded PPy/MWCNT nanocomposites using pulsed laser deposition

Polypyrrole (PPy) - multiwalled carbonnanotubes (MWCNT) nanocomposites with various MWCNT loading were prepared by in situ inversion emulsion polymerization technique. High loading of the nano filler were evaluated because of available inherent high interface area for charge separation in the nanocomposites. Solution processing of these conducting polymer nanocomposites is difficult because, most of them are insoluble in organic solvents. Device quality films of these composites were prepared by using pulsed laser deposition techniques (PLD). Comparative study of X-ray photoelectron spectroscopy (XPS) of bulk and film show that there is no chemical modification of polymer on ablation with laser. TEM images indicate PPy layer on MWCNT surface. SEM micrographs indicate that the MWCNT's are distributed throughout the film. It was observed that MWCNT in the composite held together by polymer matrix. Further more MWCNT diameter does not change from bulk to film indicating that the polymer layer remains intact during ablation. Even for very high loadings (80 wt.% of MWCNT's) of nanocomposites device quality films were fabricated, indicating laser ablation is a suitable technique for fabrication of device quality films. Conductivity of both bulk and films were measured using collinear four point probe setup. It was found that overall conductivity increases with increase in MWCNT loading. Comparative study of thickness with conductivity indicates that maximum conductivity was observed around 0.2 mu m. (C) 2010 Elsevier B.V. All rights reserved.

The nature of dislocation motion in quasicrystals

Calculations in a hydrodynamic model of quasicrystal dynamics show that dislocation motion in these systems is impeded by a drag far greater than that in crystals.

Regenerating Codes for Distributed Storage Networks

In a storage system where individual storage nodes are prone to failure, the redundant storage of data in a distributed manner across multiple nodes is a must to ensure reliability. Reed-Solomon codes possess the reconstruction property under which the stored data can be recovered by connecting to any k of the n nodes in the network across which data is dispersed. This property can be shown to lead to vastly improved network reliability over simple replication schemes. Also of interest in such storage systems is the minimization of the repair bandwidth, i.e., the amount of data needed to be downloaded from the network in order to repair a single failed node. Reed-Solomon codes perform poorly here as they require the entire data to be downloaded. Regenerating codes are a new class of codes which minimize the repair bandwidth while retaining the reconstruction property. This paper provides an overview of regenerating codes including a discussion on the explicit construction of optimum codes.

Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.

Ordered Ports – a Language Concept for High-level Distributed Programming

A new language concept for high-level distributed programming is proposed. Programs are organised as a collection of concurrently executing processes. Some of these processes, referred to as liaison processes, have a monitor-like structure and contain ports which may be invoked by other processes for the purposes of synchronisation and communication. Synchronisation is achieved by conditional activation of ports and also through port control constructs which may directly specify the execution ordering of ports. These constructs implement a path-expression-like mechanism for synchronisation and are also equipped with options to provide conditional, non-deterministic and priority ordering of ports. The usefulness and expressive power of the proposed concepts are illustrated through solutions of several representative programming problems. Some implementation issues are also considered.

Precise measurement of hyperfine structure in the 2P(1/2) state of Li-7 using saturated-absorption spectroscopy

We report a precise measurement of the hyperfine interval in the 2P(1/2) state of Li-7. The transition from the ground state (D-1 line) is accessed using a diode laser and the technique of saturated-absorption spectroscopy in hot Li vapor. The interval is measured by locking an acousto-optic modulator to the frequency difference between the two hyperfine peaks. The measured interval of 92.040(6) MHz is consistent with an earlier measurement reported by us using an atomic-beam spectrometer Das and Natarajan, J. Phys. B 41, 035001 (2008)]. The interval yields the magnetic dipole constant in the P-1/2 state as A = 46.047(3), which is discrepant from theoretical calculations by > 80 kHz.

Activity–Composition Relations in the Nickel Oxide–Magnesium Oxide System at 1300 K by the Solid-State Galvanic Cell Technique

The activity of NiO in NiO-MgO rock salt solid solution has been measured at 1300 K by employing a solid-state galvanic cell: Pt,Ni+ NiO||(CaO)ZrO2||Ni + (Nix,Mgl-x)O, Pt. A high-density tube of Zr02-15 mol% CaO has been used as the solid electrolyte for the emf measurements. The activities of the component oxides in the rock salt solid solution exhibit negative deviation from ideality at the temperature of investigation. The solid solution obeys regular solution behavior at 1300 K. The value of the regular solution parameter is found to be -12000 ((l000) J mol-1. The composition dependence of ΔGEx obtained in this study agrees reasonably well with the calorimetric data reported in the literature for NiO-MgO solid solution.

Design of nonequivalent self-routing networks based on a matrix model

In earlier work, nonisomorphic graphs have been converted into networks to realize Multistage Interconnection networks, which are topologically nonequivalent to the Baseline network. The drawback of this technique is that these nonequivalent networks are not guaranteed to be self-routing, because each node in the graph model can be replaced by a (2 × 2) switch in any one of the four different configurations. Hence, the problem of routing in these networks remains unsolved. Moreover, nonisomorphic graphs were obtained by interconnecting bipartite loops in a heuristic manner; the heuristic nature of this procedure makes it difficult to guarantee full connectivity in large networks. We solve these problems through a direct approach, in which a matrix model for self-routing networks is developed. An example is given to show that this model encompases nonequivalent self-routing networks. This approach has the additional advantage in that the matrix model itself ensures full connectivity.