A note on the Berry phase for systems having one degree of freedom

A one-dimensional arbitrary system with quantum Hamiltonian H(q, p) is shown to acquire the 'geometric' phase gamma (C)=(1/2) contour integral c(Podqo-qodpo) under adiabatic transport q to q+q+qo(t) and p to p+po(t) along a closed circuit C in the parameter space (qo(t), po(t)). The non-vanishing nature of this phase, despite only one degree of freedom (q), is due ultimately to the underlying non-Abelian Weyl group. A physical realisation in which this Berry phase results in a line spread is briefly discussed.

Generalized Query-By-Rule: a heterogeneous database query language

This paper describes the design and implementation of a high-level query language called Generalized Query-By-Rule (GQBR) which supports retrieval, insertion, deletion and update operations. This language, based on the formalism of database logic, enables the users to access each database in a distributed heterogeneous environment, without having to learn all the different data manipulation languages. The compiler has been implemented on a DEC 1090 system in Pascal.

A study of placement algorithms through trial interchange of logic modules

Based on trial interchanges, this paper develops three algorithms for the solution of the placement problem of logic modules in a circuit. A significant decrease in the computation time of such placement algorithms can be achieved by restricting the trial interchanges to only a subset of all the modules in a circuit. The three algorithms are simulated on a DEC 1090 system in Pascal and the performance of these algorithms in terms of total wirelength and computation time is compared with the results obtained by Steinberg, for the 34-module backboard wiring problem. Performance analysis of the first two algorithms reveals that algorithms based on pairwise trial interchanges (2 interchanges) achieve a desired placement faster than the algorithms based on trial N interchanges. The first two algorithms do not perform better than Steinberg's algorithm1, whereas the third algorithm based on trial pairwise interchange among unconnected pairs of modules (UPM) and connected pairs of modules (CPM) performs better than Steinberg's algorithm, both in terms of total wirelength (TWL) and computation time.

Access path query language for relational database systems

Database management systems offer a very reliable and attractive data organization for fast and economical information storage and processing for diverse applications. It is much more important that the information should be easily accessible to users with varied backgrounds, professional as well as casual, through a suitable data sublanguage. The language adopted here (APPLE) is one such language for relational database systems and is completely nonprocedural and well suited to users with minimum or no programming background. This is supported by an access path model which permits the user to formulate completely nonprocedural queries expressed solely in terms of attribute names. The data description language (DDL) and data manipulation language (DML) features of APPLE are also discussed. The underlying relational database has been implemented with the help of the DATATRIEVE-11 utility for record and domain definition which is available on the PDP-11/35. The package is coded in Pascal and MACRO-11. Further, most of the limitations of the DATATRIEVE-11 utility have been eliminated in the interface package.

GRDB: A general purpose relational database system

This article discusses the design and development of GRDB (General Purpose Relational Data Base System) which has been implemented on a DEC-1090 system in Pascal. GRDB is a general purpose database system designed to be completely independent of the nature of data to be handled, since it is not tailored to the specific requirements of any particular enterprise. It can handle different types of data such as variable length records and textual data. Apart from the usual database facilities such as data definition and data manipulation, GRDB supports User Definition Language (UDL) and Security definition language. These facilities are provided through a SEQUEL-like General Purpose Query Language (GQL). GRDB provides adequate protection facilities up to the relation level. The concept of “security matrix” has been made use of to provide database protection. The concept of Unique IDentification number (UID) and Password is made use of to ensure user identification and authentication. The concept of static integrity constraints has been used to ensure data integrity. Considerable efforts have been made to improve the response time through indexing on the data files and query optimisation. GRDB is designed for an interactive use but alternate provision has been made for its use through batch mode also. A typical Air Force application (consisting of data about personnel, inventory control, and maintenance planning) has been used to test GRDB and it has been found to perform satisfactorily.

An interactive graphics system for 2-D drawing and design

This paper is about a software system, GRASS-Graphic Software System for 2-D drawing and design—which has been implemented on a PDP-11/35 system with RSX-11M operating system. It is a low cost interactive graphics system for the design of two dimensional drawings and uses a minimum of hardware. It provides comprehensive facilities for creating, editing, storing and retrieving pictures. It has been implemented in the language Pascal and has the potential to be used as a powerful data-imputting tool for a design-automation system. The important features of the system are its low cost, software character generation and a user-trainable character recognizer, which has been included.

An interpreter for slips-An applicative language based on LAMBDA-Calculus

An applicative language based on the LAMBDA-Calculus is presented. The language, SLIPS (Small Language for Instruction Purposes), is described using the LAMBDA-Calculus as a metalanguage. A call-by-need mechanism of function invocation eliminates the drawbacks of both call-by-name and call-by-value. The system has been implemented in PASCAL.

DFL: A Data Flow Language

Many novel computer architectures like array and multiprocessors which achieve high performance through the use of concurrency exploit variations of the von Neumann model of computation. The effective utilization of the machines makes special demands on programmers and their programming languages, such as the structuring of data into vectors or the partitioning of programs into concurrent processes. In comparison, the data flow model of computation demands only that the principle of structured programming be followed. A data flow program, often represented as a data flow graph, is a program that expresses a computation by indicating the data dependencies among operators. A data flow computer is a machine designed to take advantage of concurrency in data flow graphs by executing data independent operations in parallel. In this paper, we discuss the design of a high level language (DFL: Data Flow Language) suitable for data flow computers. Some sample procedures in DFL are presented. The implementation aspects have not been discussed in detail since there are no new problems encountered. The language DFL embodies the concepts of functional programming, but in appearance closely resembles Pascal. The language is a better vehicle than the data flow graph for expressing a parallel algorithm. The compiler has been implemented on a DEC 1090 system in Pascal.

1-D hydrogen-bonded organization of hexanuclear {3d-4f-5d} complexes: evidence for slow relaxation of the magnetization for [{LMe2Ni(H2O)Ln(H2O)4.5}2{W(CN)8}2] with Ln = Tb and Dy

Heterometallic {3d-4f-5d} aggregates with formula [{LMe2Ni(H2O)Ln(H2O)4.5}2{W(CN)8}2]·15H2O, (LMe2 stands for N,N-2,2-dimethylpropylenedi(3-methoxysalicylideneiminato) Schiff-base ligand) with Ln = Gd, Tb, Dy, have been obtained by reacting bimetallic [LMe2Ni(H2O)2Ln(NO3)3] and Cs3{W(CN)8} in H2O. The hexanuclear complexes are organized in 1-D arrays by means of hydrogen bonds established between the solvent molecules coordinated to Ln and the CN ligands of an octacyanometallate moiety. The X-ray structure was solved for the Tb derivative. Magnetic behavior indicates ferromagnetic {W–Ni} and {Ni–Ln} interactions (JNiW = 18.5 cm-1, JNiGd = 1.85 cm-1) as well as ferromagnetic intermolecular interactions mediated by the H-bonds. Dynamic magnetic susceptibility studies reveal slow magnetic relaxation processes for the Tb and Dy derivatives, suggesting SMM type behavior for these compounds.

Implementation of placement and routing algorithms for computer aided design of printed circuit boards

The Printed Circuit Board (PCB) layout design is one of the most important and time consuming phases during equipment design process in all electronic industries. This paper is concerned with the development and implementation of a computer aided PCB design package. A set of programs which operate on a description of the circuit supplied by the user in the form of a data file and subsequently design the layout of a double-sided PCB has been developed. The algorithms used for the design of the PCB optimise the board area and the length of copper tracks used for the interconnections. The output of the package is the layout drawing of the PCB, drawn on a CALCOMP hard copy plotter and a Tektronix 4012 storage graphics display terminal. The routing density (the board area required for one component) achieved by this package is typically 0.8 sq. inch per IC. The package is implemented on a DEC 1090 system in Pascal and FORTRAN and SIGN(1) graphics package is used for display generation.

Estimation of Execution Times of Process Control Algorithms on Microcomputers

An important question which has to be answered in evaluting the suitability of a microcomputer for a control application is the time it would take to execute the specified control algorithm. In this paper, we present a method of obtaining closed-form formulas to estimate this time. These formulas are applicable to control algorithms in which arithmetic operations and matrix manipulations dominate. The method does not require writing detailed programs for implementing the control algorithm. Using this method, the execution times of a variety of control algorithms on a range of 16-bit mini- and recently announced microcomputers are calculated. The formulas have been verified independently by an analysis program, which computes the execution time bounds of control algorithms coded in Pascal when they are run on a specified micro- or minicomputer.

Semi-Classical Mechanics in Phase Space: A Study of Wigner's Function

We explore the semi-classical structure of the Wigner functions ($\Psi $(q, p)) representing bound energy eigenstates $|\psi \rangle $ for systems with f degrees of freedom. If the classical motion is integrable, the classical limit of $\Psi $ is a delta function on the f-dimensional torus to which classical trajectories corresponding to ($|\psi \rangle $) are confined in the 2f-dimensional phase space. In the semi-classical limit of ($\Psi $ ($\hslash $) small but not zero) the delta function softens to a peak of order ($\hslash ^{-\frac{2}{3}f}$) and the torus develops fringes of a characteristic 'Airy' form. Away from the torus, $\Psi $ can have semi-classical singularities that are not delta functions; these are discussed (in full detail when f = 1) using Thom's theory of catastrophes. Brief consideration is given to problems raised when ($\Psi $) is calculated in a representation based on operators derived from angle coordinates and their conjugate momenta. When the classical motion is non-integrable, the phase space is not filled with tori and existing semi-classical methods fail. We conjecture that (a) For a given value of non-integrability parameter ($\epsilon $), the system passes through three semi-classical regimes as ($\hslash $) diminishes. (b) For states ($|\psi \rangle $) associated with regions in phase space filled with irregular trajectories, ($\Psi $) will be a random function confined near that region of the 'energy shell' explored by these trajectories (this region has more than f dimensions). (c) For ($\epsilon \neq $0, $\hslash $) blurs the infinitely fine classical path structure, in contrast to the integrable case ($\epsilon $ = 0, where $\hslash $ )imposes oscillatory quantum detail on a smooth classical path structure.

Calculating the bound spectrum by path summation in action-angle variables

The density of states n(E) is calculated for a bound system whose classical motion is integrable, starting from an expression in terms of the trace of the time-dependent Green function. The novel feature is the use of action-angle variables. This has the advantages that the trace operation reduces to a trivial multiplication and the dependence of n(E) on all classical closed orbits with different topologies appears naturally. The method is contrasted with another, not applicable to integrable systems except in special cases, in which quantization arises from a single closed orbit which is assumed isolated and the trace taken by the method of stationary phase.

Quantum spin nematics, dimerization, and deconfined criticality in Quasi-1D spin-one magnets

We study theoretically the destruction of spin nematic order due to quantum fluctuations in quasi-one-dimensional spin-1 magnets. If the nematic ordering is disordered by condensing disclinations, then quantum Berry phase effects induce dimerization in the resulting paramagnet. We develop a theory for a Landau-forbidden second order transition between the spin nematic and dimerized states found in recent numerical calculations. Numerical tests of the theory are suggested.

Fate of the superconducting ground state on the Moyal plane

It is known that Berry curvature of the band structure of certain crystals can lead to effective noncommutativity between spatial coordinates. Using the techniques of twisted quantum field theory, we investigate the question of the formation of a paired state of twisted fermions in such a system. We find that to leading order in the noncommutativity parameter, the gap between the non-interacting ground state and the paired state is smaller compared to its commutative counterpart. This suggests that BCS type superconductivity, if present in such systems, is more fragile and easier to disrupt. (C) 2010 Elsevier B.V. All rights reserved.