Bounding Run-Times of Local Adiabatic Algorithms

A common trick for designing faster quantum adiabatic algorithms is to apply the adiabaticity condition locally at every instant. However it is often difficult to determine the instantaneous gap between the lowest two eigenvalues, which is an essential ingredient in the adiabaticity condition. In this paper we present a simple linear algebraic technique for obtaining a lower bound on the instantaneous gap even in such a situation. As an illustration, we investigate the adiabatic un-ordered search of van Dam et al. [17] and Roland and Cerf [15] when the non-zero entries of the diagonal final Hamiltonian are perturbed by a polynomial (in log N, where N is the length of the unordered list) amount. We use our technique to derive a bound on the running time of a local adiabatic schedule in terms of the minimum gap between the lowest two eigenvalues.

Linear time algorithms for Abelian group isomorphism and related problems

We consider the problem of determining if two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. We present an O(n) algorithm that determines if two Abelian groups with n elements each are isomorphic. This improves upon the previous upper bound of O(n log n) [Narayan Vikas, An O(n) algorithm for Abelian p-group isomorphism and an O(n log n) algorithm for Abelian group isomorphism, J. Comput. System Sci. 53 (1996) 1-9] known for this problem. We solve a more general problem of computing the orders of all the elements of any group (not necessarily Abelian) of size n in O(n) time. Our algorithm for isomorphism testing of Abelian groups follows from this result. We use the property that our order finding algorithm works for any group to design a simple O(n) algorithm for testing whether a group of size n, described by its multiplication table, is nilpotent. We also give an O(n) algorithm for determining if a group of size n, described by its multiplication table, is Abelian. (C) 2007 Elsevier Inc. All rights reserved.

Manifolds with nonnegative isotropic curvature

We prove that if (M-n, g), n >= 4, is a compact, orientable, locally irreducible Riemannian manifold with nonnegative isotropic curvature,then one of the following possibilities hold: (i) M admits a metric with positive isotropic curvature. (ii) (M, g) is isometric to a locally symmetric space. (iii) (M, g) is Kahler and biholomorphic to CPn/2. (iv) (M, g) is quaternionic-Kahler. This is implied by the following result: Let (M-2n, g) be a compact, locally irreducible Kahler manifold with nonnegative isotropic curvature. Then either M is biholomorphic to CPn or isometric to a compact Hermitian symmetric space. This answers a question of Micallef and Wang in the affirmative. The proof is based on the recent work of Brendle and Schoen on the Ricci flow.

Giant magnons in the D1-D5 system

We study giant magnons in the the D1-D5 system from both the boundary CFT and as classical solutions of the string sigma model in AdS(3) x S-3 x T-4. Re-examining earlier studies of the symmetric product conformal field theory we argue that giant magnons in the symmetric product are BPS states in a centrally extended SU(1 vertical bar 1) x SU(1 vertical bar 1) superalgebra with two more additional central charges. The magnons carry these additional central charges locally but globally they vanish. Using a spin chain description of these magnons and the extended superalgebra we show that these magnons obey a dispersion relation which is periodic in momentum. We then identify these states on the string theory side and show that here too they are BPS in the same centrally extended algebra and obey the same dispersion relation which is periodic in momentum. This dispersion relation arises as the BPS condition for the extended algebra and is similar to that of magnons in N = 4 Yang-Mills Yang-Mills.

Proximinality in Banach spaces

In this paper, we study approximatively τ-compact and τ-strongly Chebyshev sets, where τ is the norm or the weak topology. We show that the metric projection onto τ-strongly Chebyshev sets are norm-τ continuous. We characterize approximatively τ-compact and τ-strongly Chebyshev hyperplanes and use them to characterize factor reflexive proximinal subspaces in τ-almost locally uniformly rotund spaces. We also prove some stability results on approximatively τ-compact and τ-strongly Chebyshev subspaces.

On the stacking fault energies of some close-packed hexagonal metals

It is now realised (1,2,3) that a knowledge of stacking fault energy is fundamental for an understanding of the mechanical behaviour of metals. There are several processes in which the imperfect dislocations have to recombine locally to form an unextended dislocation . For intersection of two dislocations it is, for example, necessary to form 'constrictions'. Cross slip of extended dislocations also involves constriction. The onset of stage llI work hardening in a crystal with close-packed structure is attributed to cross slip and hence is controlled by the stacking fault energy (SPE). Methods of estimation of SFE are based on either the direct observation of stacking faults in an electron microscope or their effects on the deformation processes.

On the effect of matrix cracks in composite helicopter rotor blade

This paper investigates the feasibility of an on-line damage detection capability for helicopter main rotor blades made of composite material. Damage modeled in the composite is matrix cracking. A box-beam with stiffness properties similar to a hingeless rotor blade is designed using genetic algorithm for the typical [+/-theta(m)/90(n)](s) family of composites. The effect of matrix cracks is included in an analytical model of composite box-beam. An aeroelastic analysis of the helicopter rotor based on finite elements in space and time is used to study the effects of matrix cracking in the rotor blade in forward flight. For global fault detection, rotating frequencies, tip bending and torsion response, and blade root loads are studied. It is observed that the effect of matrix cracking on lag bending and elastic twist deflection at the blade tip and blade root yawing moment is significant and these parameters can be monitored for online health monitoring. For implementation of local fault detection technique, the effect on axial and shear strain, for matrix cracks in the whole blade as well as matrix cracks occurring locally is studied. It is observed that using strain measurement along the blade it is possible to locate the matrix cracks as well as to predict density of matrix cracks. (C) 2004 Elsevier Ltd. All rights reserved.

Laser processing of high-Tc superconducting thin films

High-Tc superconducting thin films can be deposited and processed by pulsed and CW lasers, and a respectable materials technology for the Y-Ba-Cu-O superconductor is rapidly emerging. The pulsed laser deposition technique is simple because it produces films with compositions nearly identical to those of the target pellets. A larger variety of substrates can be used, compared to other deposition technologies, because of the relatively low temperature requirements. The laser deposition mechanism has been investigated. As-deposited superconducting films, epitaxial films with smooth surfaces, and multilayer structures with abrupt interfaces have been produced. The electrical transport properties can be changed locally using a focused argon-ion laser by modifying the oxygen stoichiometry. This laser writing can be erased by room-temperature exposure to an oxygen plasma. Other laser patterning methods such as material removal, melt-quench, and direct pattern transfer are being developed.

Boundary regularity of correspondences in C-n

Let M, M' be smooth, real analytic hypersurfaces of finite type in C-n and f a holomorphic correspondence (not necessarily proper) that is defined on one side of M, extends continuously up to M and maps M to M-t. It is shown that f must extend across M as a locally proper holonnorphic correspondence. This is a version for correspondences of the Diederich-Pinchuk extension result for CR maps.

Distributed nonlinear optimization algorithms for general network problems

There are a number of large networks which occur in many problems dealing with the flow of power, communication signals, water, gas, transportable goods, etc. Both design and planning of these networks involve optimization problems. The first part of this paper introduces the common characteristics of a nonlinear network (the network may be linear, the objective function may be non linear, or both may be nonlinear). The second part develops a mathematical model trying to put together some important constraints based on the abstraction for a general network. The third part deals with solution procedures; it converts the network to a matrix based system of equations, gives the characteristics of the matrix and suggests two solution procedures, one of them being a new one. The fourth part handles spatially distributed networks and evolves a number of decomposition techniques so that we can solve the problem with the help of a distributed computer system. Algorithms for parallel processors and spatially distributed systems have been described.There are a number of common features that pertain to networks. A network consists of a set of nodes and arcs. In addition at every node, there is a possibility of an input (like power, water, message, goods etc) or an output or none. Normally, the network equations describe the flows amoungst nodes through the arcs. These network equations couple variables associated with nodes. Invariably, variables pertaining to arcs are constants; the result required will be flows through the arcs. To solve the normal base problem, we are given input flows at nodes, output flows at nodes and certain physical constraints on other variables at nodes and we should find out the flows through the network (variables at nodes will be referred to as across variables).The optimization problem involves in selecting inputs at nodes so as to optimise an objective function; the objective may be a cost function based on the inputs to be minimised or a loss function or an efficiency function. The above mathematical model can be solved using Lagrange Multiplier technique since the equalities are strong compared to inequalities. The Lagrange multiplier technique divides the solution procedure into two stages per iteration. Stage one calculates the problem variables % and stage two the multipliers lambda. It is shown that the Jacobian matrix used in stage one (for solving a nonlinear system of necessary conditions) occurs in the stage two also.A second solution procedure has also been imbedded into the first one. This is called total residue approach. It changes the equality constraints so that we can get faster convergence of the iterations.Both solution procedures are found to coverge in 3 to 7 iterations for a sample network.The availability of distributed computer systems — both LAN and WAN — suggest the need for algorithms to solve the optimization problems. Two types of algorithms have been proposed — one based on the physics of the network and the other on the property of the Jacobian matrix. Three algorithms have been deviced, one of them for the local area case. These algorithms are called as regional distributed algorithm, hierarchical regional distributed algorithm (both using the physics properties of the network), and locally distributed algorithm (a multiprocessor based approach with a local area network configuration). The approach used was to define an algorithm that is faster and uses minimum communications. These algorithms are found to converge at the same rate as the non distributed (unitary) case.

Characterization of compact ICP ion source for focused ion beam applications

A compact, high brightness 13.56 MHz inductively coupled plasma ion source without any axial or radial multicusp magnetic fields is designed for the production of a focused ion beam. Argon ion current of density more than 30 mA/cm(2) at 4 kV potential is extracted from this ion source and is characterized by measuring the ion energy spread and brightness. Ion energy spread is measured by a variable-focusing retarding field energy analyzer that minimizes the errors due t divergence of ion beam inside the analyzer. Brightness of the ion beam is determined from the emittance measured by a fully automated and locally developed electrostatic sweep scanner. By optimizing various ion source parameters such as RF power, gas pressure and Faraday shield, ion beams with energy spread of less than 5 eV and brightness of 7100 Am(-2)sr(-1)eV(-1) have been produced. Here, we briefly report the details of the ion source, measurement and optimization of energy spread and brightness of the ion beam. (C) 2010 Elsevier B.V. All rights reserved.

Sustainable bioenergy production strategies for rural India

The paper aims to assess the potential of decentralized bioenergy technologies in meeting rural energy needs and reducing carbon dioxide (CO2) emissions. Decentralized energy planning is carried out for the year 2005 and 2020. Decentralized energy planning model using goal programming technique is applied for different decentralized scales (village to a district) for obtaining the optimal mix of energy resources and technologies. Results show that it is possible to meet the energy requirements of all the services that are necessary to promote development and improve the quality of life in rural areas from village to district scale, by utilizing the locally available energy resources such as cattle dung, leaf litter and woody biomass feedstock from bioenergy plantation on wastelands. The decentralized energy planning model shows that biomass feedstock required at village to district level can even be obtained from biomass conserved by shifting to biogas for cooking. Under sustainable development scenario, the decentralized energy planning model shows that there is negligible emission of CO2, oxide of Sulphur (SOx) and oxide of nitrogen (NOx), even while meeting all the energy needs.

Sensitive high-resolution ion microprobe U-Pb dating of prograde and retrograde ultrahigh-temperature metamorphism as exemplified by Sri Lankan granulites

Ultrahigh-temperature (UHT) granulites of the central Highland Complex, Sri Lanka, underwent some of the highest known peak temperatures of crustal metamorphism. Zircon and monazite U-Pb systems in granulites near Kandy, the highest grade region (similar to 1050 degrees C; 0.9 GPa), preserve both a record of the timing of prograde and retrograde phases of UHT metamorphism and evidence for the ages of older protolith components. Zircon grains from a quartz-saturated granulite containing relics of the peak UHT assemblage have remnant detrital cores with dates of ca. 2.5-0.83 Ga. Date clusters of ca. 1.7 and 1.04-0.83 Ga record episodes of zircon growth in the source region of the protolith sediment. Two generations of overgrowths with contrasting Th/U record metamorphic zircon growth at 569 +/- 5 and 551 +/- 7 Ma, probably in the absence and presence of monazite, respectively. The age of coexisting metamorphic monazite (547 +/- 7 Ma) is indistinguishable from that of the younger, low-Th/U zircon overgrowths. Zircon from a quartz-undersaturated monazite-absent UHT granulite with a mainly retrograde assemblage is mostly metamorphic (551 +/- 5 Ma). The ca. 570 Ma zircon overgrowths in the quartz-saturated granulite probably record partial melting just before or at the metamorphic peak. The ca. 550 Ma zircon in both rocks, and the ca. 550 Ma monazite in the quartz-saturated sample, record post-peak isothermal decompression. A possible model for this pressure-temperature-time evolution is ultrahot collisional orogeny during the assembly of Gondwana, locally superheated by basaltic underplating, followed by fast extensional exhumation.

Device for reusing damaged laser mirrors

A simple mirror holder which permits the use of locally damaged laser morrors by allowing the undamaged areas of the reflector to be aligned along the laser optic axis is described. The mirror holder has an eccentric step for housing the mirror and a concentric aperture through which the undamaged surface of the reflector is utilised. By varying the eccentricity and by rotating the mirror inside the step the entire surface area of the reflector can be used successively.

Uniform chemical terminology for indian languages

A comparison is made between German and Russian terminological derivations in chemistry and the methods used by Germans and Russians to solve problems related to the fornlrrtion of scientific words. A study of this comparison, it is believed, can help us in the development of scientific words in Indian languages.