Inertial mass of a vortex in cuprate superconductors

We present here a calculation of the inertial mass of a moving vortex in cuprate superconductors. This is a poorly known basic quantity of obvious interest in vortex dynamics. The motion of a vortex causes a dipolar density distortion and an associated electric field which is screened. The energy cost of the density distortion as well as the related screened electric field contributes to the vortex mass, which is small because of efficient screening. As a preliminary, we present a discussion and calculation of the vortex mass using a microscopically derivable phase-only action functional for the far region which shows that the contribution from the far region is negligible and that most of it arises from the (small) core region of the vortex. A calculation based on a phenomenological Ginzburg-Landau functional is performed in the core region. Unfortunately such a calculation is unreliable; the reasons for it are discussed. A credible calculation of the vortex mass thus requires a fully microscopic non-coarse-grained theory. This is developed, and results are presented for an s-wave BCS-like gap, with parameters appropriate to the cuprates. The mass, about 0.5m(e) per layer, for a magnetic field along the c axis arises from deformation of quasiparticle states bound in the core and screening effects mentioned above. We discuss earlier results, possible extensions to d-wave symmetry, and observability of effects dependent on the inertial mass. [S0163-1829(97)05534-3].

Efficient use of correlation entropy for analysing time series data

The correlation dimension D 2 and correlation entropy K 2 are both important quantifiers in nonlinear time series analysis. However, use of D 2 has been more common compared to K 2 as a discriminating measure. One reason for this is that D 2 is a static measure and can be easily evaluated from a time series. However, in many cases, especially those involving coloured noise, K 2 is regarded as a more useful measure. Here we present an efficient algorithmic scheme to compute K 2 directly from a time series data and show that K 2 can be used as a more effective measure compared to D 2 for analysing practical time series involving coloured noise.

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.

Efficient Output-Sensitive Construction of Reeb Graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. This paper describes a near-optimal two-step algorithm that constructs the Reeb graph of a Morse function defined over manifolds in any dimension. The algorithm first identifies the critical points of the input manifold, and then connects these critical points in the second step to obtain the Reeb graph. A simplification mechanism based on topological persistence aids in the removal of noise and unimportant features. A radial layout scheme results in a feature-directed drawing of the Reeb graph. Experimental results demonstrate the efficiency of the Reeb graph construction in practice and its applications.

Solid fuel block as an alternate fuel for cooking and barbecuing: Preliminary result

A large part of the rural people of developing countries use traditional biomass stoves to meet their cooking and heating energy demands. These stoves possess very low thermal efficiency; besides, most of them cannot handle agricultural wastes. Thus, there is a need to develop an alternate cooking contrivance which is simple, efficient and can handle a range of biomass including agricultural wastes. In this reported work, a highly densified solid fuel block using a range of low cost agro residues has been developed to meet the cooking and heating needs. A strategy was adopted to determine the best suitable raw materials, which was optimized in terms of cost and performance. Several experiments were conducted using solid fuel block which was manufactured using various raw materials in different proportions; it was found that fuel block composed of 40% biomass, 40% charcoal powder, 15% binder and 5% oxidizer fulfilled the requirement. Based on this finding, fuel blocks of two different configurations viz. cylindrical shape with single and multi-holes (3, 6, 9 and 13) were constructed and its performance was evaluated. For instance, the 13 hole solid fuel block met the requirement of domestic cooking; the mean thermal power was 1.6 kWth with a burn time of 1.5 h. Furthermore, the maximum thermal efficiency recorded for this particular design was 58%. Whereas, the power level of single hole solid fuel block was found to be lower but adequate for barbecue cooking application.

Efficient Hg and Ag ion detection with luminescent PbS quantum dots grown in poly vinyl alcohol and capped with mercaptoethanol

PbS quantum dots capped with mercaptoethanol (C2H5OSH) have been synthesized in poly vinyl alcohol and used to investigate their photoluminescence (PL) response to various ions such as zinc (Zn), cadmium (Cd), mercury (Hg), silver (Ag), copper (Cu), iron (Fe), manganese (Mn), cobalt (Co), chromium (Cr) and nickel (Ni). The enhancement in the PL intensity was observed with specific ions namely Zn, Cd, Hg and Ag. Among these four ions, the PL response to Hg and Ag even at sub-micro-molar concentrations was quite high, compared to that of Zn and Cd. It was observed that the change in Pb and S molar ratio has profound effect on the sensitivity of these ions. These results indicate that the sensitivity of these QDs could be fine-tuned by controlling the S concentration at the surface. Contrary to the above, Cu quenched the photoluminescence. In Cd based QDs related ion probing, Hg and Cu was found to have quenching properties, however, our PbS QDs have quenching property only for Cu ions. This was attributed to the formation HgS at the surface that has bandgap higher than PbS. Another interesting property of PbS in PVA observed is photo-brightening mechanism due to the curing of the polymer with laser. However, the presence of excess ions at the surface changes its property to photo-darkening/brightening that depends on the direction of carrier transfer mechanism (from QDs to the surface adsorbed metal ions or vice-versa). which is an interesting feature for metal ion detectivity.

Basic Needs and Much More With One Kilowatt Per Capita

Conventional thinkin g holds that increased energy consumption is a prerequisite for economic and social development. This belief, together With the prospect of dwindling global petroleum supplies and the high costs of expanding energy supply generally, lead many to believe that it is not feasible to improve living standards substantially in the developing countries. But by shifting to high-quality energy carriers and by exploiting cost-effective opportunities for more efficient energy use, it would be possible to satisfy basic human needs and to provide considerable further improvements in living standards without significantly increasing per-capita energy use above the present level.

A low cost demagnetizer with controllable cycle and adjustable level

Demagnetization to zero remanent value or to a predetermined value is of interest to magnet manufacturers and material users. Conventional methods of demagnetization using a varying alternating demagnetizing field, under a damped oscillatory or conveyor system, result in either high cost for demagnetization or large power dissipation. A simple technique using thyristors is presented for demagnetizing the material. Power consumption is mainly in the first two half-cycles of applied voltage. Hence power dissipation is very much reduced. An optimum value calculation for a thyristor triggering angle for demagnetizing high coercive materials is also presented.

Efficient algorithms for computing Reeb graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. We describe an algorithm that constructs the Reeb graph of a Morse function defined on a 3-manifold. Our algorithm maintains connected components of the two dimensional levels sets as a dynamic graph and constructs the Reeb graph in O(nlogn+nlogg(loglogg)3) time, where n is the number of triangles in the tetrahedral mesh representing the 3-manifold and g is the maximum genus over all level sets of the function. We extend this algorithm to construct Reeb graphs of d-manifolds in O(nlogn(loglogn)3) time, where n is the number of triangles in the simplicial complex that represents the d-manifold. Our result is a significant improvement over the previously known O(n2) algorithm. Finally, we present experimental results of our implementation and demonstrate that our algorithm for 3-manifolds performs efficiently in practice.

A Closed-Cycle Refrigerator Based Pulsed Management System

A low cost 12 T pulsed magnet system has been integrated with a closed-cycle helium refrigerator. The copper solenoid is directly immersed in liquid nitrogen for reduced electrical resistance and more efficient heat transfer. This ensures a minimal delay of few minutes between pulses. The sample is mounted on the cold finger of the refrigerator and, along with the surrounding vacuum shroud, is inserted into the bore of the solenoid. When combined with software lock-in signal processing to reduce noise, quick but accurate measurements can be performed at temperatures 4 K-300 K up to 12 T. Quantum Hall effect data in a p-channel SiGe/Si heterostructure has been used to calibrate the instrument against a commercial superconducting magnet. Its versatility as a routine characterization tool is demonstrated bymeasuring parallel conduction in Si/SiGe modulation doped heterostructures.

In quest of a reliable and efficient computational test for detection of isomorphism in kinematic chains

The test based on comparison of the characteristic coefficients of the adjancency matrices of the corresponding graphs for detection of isomorphism in kinematic chains has been shown to fail in the case of two pairs of ten-link, simple-jointed chains, one pair corresponding to single-freedom chains and the other pair corresponding to three-freedom chains. An assessment of the merits and demerits of available methods for detection of isomorphism in graphs and kinematic chains is presented, keeping in view the suitability of the methods for use in computerized structural synthesis of kinematic chains. A new test based on the characteristic coefficients of the “degree” matrix of the corresponding graph is proposed for detection of isomorphism in kinematic chains. The new test is found to be successful in the case of a number of examples of graphs where the test based on characteristic coefficients of adjancency matrix fails. It has also been found to be successful in distinguishing the structures of all known simple-jointed kinematic chains in the categories of (a) single-freedom chains with up to 10 links, (b) two-freedom chains with up to 9 links and (c) three-freedom chains with up to 10 links.

A computationally efficient technique for data-clustering

A computationally efficient agglomerative clustering algorithm based on multilevel theory is presented. Here, the data set is divided randomly into a number of partitions. The samples of each such partition are clustered separately using hierarchical agglomerative clustering algorithm to form sub-clusters. These are merged at higher levels to get the final classification. This algorithm leads to the same classification as that of hierarchical agglomerative clustering algorithm when the clusters are well separated. The advantages of this algorithm are short run time and small storage requirement. It is observed that the savings, in storage space and computation time, increase nonlinearly with the sample size.