An algebraic theory of functional and multivalued dependencies in relational databases

Computation of the dependency basis is the fundamental step in solving the membership problem for functional dependencies (FDs) and multivalued dependencies (MVDs) in relational database theory. We examine this problem from an algebraic perspective. We introduce the notion of the inference basis of a set M of MVDs and show that it contains the maximum information about the logical consequences of M. We propose the notion of a dependency-lattice and develop an algebraic characterization of inference basis using simple notions from lattice theory. We also establish several interesting properties of dependency-lattices related to the implication problem. Founded on our characterization, we synthesize efficient algorithms for (a): computing the inference basis of a given set M of MVDs; (b): computing the dependency basis of a given attribute set w.r.t. M; and (c): solving the membership problem for MVDs. We also show that our results naturally extend to incorporate FDs also in a way that enables the solution of the membership problem for both FDs and MVDs put together. We finally show that our algorithms are more efficient than existing ones, when used to solve what we term the ‘generalized membership problem’.

Algebraic distributed space-time codes with low ML decoding complexity

"Extended Clifford algebras" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic constructions of full diversity Distributed Space-Time Codes (DSTCs) are provided for any power of two number of relays. The left regular matrix representation has been shown to naturally result in space-time codes meeting the additional constraints required for DSTCs. The DSTCs so constructed have the salient feature of reduced Maximum Likelihood (ML) decoding complexity. In particular, the ML decoding of these codes can be performed by applying the lattice decoder algorithm on a lattice of four times lesser dimension than what is required in general. Moreover these codes have a uniform distribution of power among the relays and in time, thus leading to a low Peak to Average Power Ratio at the relays.

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.

The Implication Problem for Functional and Multivalued Dependencies

Computation of the dependency basis is the fundamental step in solving the implication problem for MVDs in relational database theory. We examine this problem from an algebraic perspective. We introduce the notion of the inference basis of a set M of MVDs and show that it contains the maximum information about the logical consequences of M. We propose the notion of an MVD-lattice and develop an algebraic characterization of the inference basis using simple notions from lattice theory. We also establish several properties of MVD-lattices related to the implication problem. Founded on our characterization, we synthesize efficient algorithms for (a) computing the inference basis of a given set M of MVDs; (b) computing the dependency basis of a given attribute set w.r.t. M; and (c) solving the implication problem for MVDs. Finally, we show that our results naturally extend to incorporate FDs also in a way that enables the solution of the implication problem for both FDs and MVDs put together.

Proton spin lattice relaxation in lithium ammonium sulphate LiNH4SO4

Lithium ammonium sulphate (LAS) undergoes a phase transition at TC1=459.5K from a paraelectric phase (phase I) to a ferroelectric phase (phase II) and again at TC2=283K to a polar ferroelastic phase (phase III). Proton spin lattice relaxation time measured at 10 MHz in powdered LAS in the temperature range 480 to 77K shows discontinuous changes at the two transitions.

Algebraic and geometric intersection numbers for free groups

We show that the algebraic intersection number of Scott and Swarup for splittings of free groups Coincides With the geometric intersection number for the sphere complex of the connected sum of copies of S-2 x S-1. (C) 2009 Elsevier B.V. All rights reserved.

Algebraic characterization of decentralized fixed modes

An input-output, frequency-domain characterization of decentralized fixed modes is given in this paper, using only standard block-diagram algebra, well-known determinantal expansions and the Binet-Cauchy formula.

Mean-field results of a lattice-gas model of multilayer adsorption

A lattice-gas model of multilayer adsorption has been solved in the mean-field approximation by a different numerical method. Earlier workers obtained a single solution for all values of temperature and pressure. In the present work, multiple solutions have been obtained in certain regions of temperature and pressure which give rise to bysteresis in the adsorption isotherm. In addition, we have obtained a parameter which behaves like an order parameter for the transition. The potential-energy function shows a double minimum in the region of bysteresis and a single maximum elsewhere.

On states, on a lattice, with half-integral charge

In certain molecular models, and related one-dimensional field theories, localized objects appear with half-integral expectation values of charge. We consider whether these states are eigenstates of charge, with half-integral eigenvalue. We find that it is indeed so for a suitably diffuse definition of the charge operator in question. This diffuse charge operator has a spectrum which approaches a continuum. The analysis is made on a lattice, to avoid divergence ambiguities, and on a finite length, which is only subsequently made large. The half-integral charge phenomenon is not tied to solitons, but can also arise as an end effect.

Algebraic design techniques for reliable stabilization

In this paper we study two problems in feedback stabilization. The first is the simultaneous stabilization problem, which can be stated as follows. Given plantsG_{0}, G_{1},..., G_{l}, does there exist a single compensatorCthat stabilizes all of them? The second is that of stabilization by a stable compensator, or more generally, a "least unstable" compensator. Given a plantG, we would like to know whether or not there exists a stable compensatorCthat stabilizesG; if not, what is the smallest number of right half-place poles (counted according to their McMillan degree) that any stabilizing compensator must have? We show that the two problems are equivalent in the following sense. The problem of simultaneously stabilizingl + 1plants can be reduced to the problem of simultaneously stabilizinglplants using a stable compensator, which in turn can be stated as the following purely algebraic problem. Given2lmatricesA_{1}, ..., A_{l}, B_{1}, ..., B_{l}, whereA_{i}, B_{i}are right-coprime for alli, does there exist a matrixMsuch thatA_{i} + MB_{i}, is unimodular for alli?Conversely, the problem of simultaneously stabilizinglplants using a stable compensator can be formulated as one of simultaneously stabilizingl + 1plants. The problem of determining whether or not there exists anMsuch thatA + BMis unimodular, given a right-coprime pair (A, B), turns out to be a special case of a question concerning a matrix division algorithm in a proper Euclidean domain. We give an answer to this question, and we believe this result might be of some independent interest. We show that, given twon times mplantsG_{0} and G_{1}we can generically stabilize them simultaneously provided eithernormis greater than one. In contrast, simultaneous stabilizability, of two single-input-single-output plants, g0and g1, is not generic.

Proline ring conformations corresponding to a bistable jump model from 13C spin-lattice relaxation times

A formalism for extracting the conformations of a proline ring based on the bistable jump model of R. E. London [(1978) J. Am. Chem. Soc. 100, 2678-2685] from 13C spin-lattice relaxation times (T1) is given. The method is such that the relaxation data are only partially used to generate the conformations; these conformations are constrained to satisfy the rest of the relaxation data and to yield acceptable ring geometry. An alternate equation for T1 of 13C nuclei to that of London is given. The formalism is illustrated through an example.

Finite volume TVD formulation of lattice Boltzmann simulation on unstructured mesh

A numerical scheme is presented for accurate simulation of fluid flow using the lattice Boltzmann equation (LBE) on unstructured mesh. A finite volume approach is adopted to discretize the LBE on a cell-centered, arbitrary shaped, triangular tessellation. The formulation includes a formal, second order discretization using a Total Variation Diminishing (TVD) scheme for the terms representing advection of the distribution function in physical space, due to microscopic particle motion. The advantage of the LBE approach is exploited by implementing the scheme in a new computer code to run on a parallel computing system. Performance of the new formulation is systematically investigated by simulating four benchmark flows of increasing complexity, namely (1) flow in a plane channel, (2) unsteady Couette flow, (3) flow caused by a moving lid over a 2D square cavity and (4) flow over a circular cylinder. For each of these flows, the present scheme is validated with the results from Navier-Stokes computations as well as lattice Boltzmann simulations on regular mesh. It is shown that the scheme is robust and accurate for the different test problems studied.

Size effect on the lattice parameter of KCl during mechanical milling

The size effect on the lattice parameter of ionic KCl nanocrystals was studied systematically during mechanical milling of Pure KCl powder under vacuum. The results suggest anomalous lattice expansion, with the lattice parameter increasing from 6.278 angstrom at d = 6 mu m to 6.30307 angstrom at d = 85 mn. The defects generated during ball milling of KCl and surface stress are deemed to be responsible for this lattice parameter expansion. (C) 2009 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Proton Spin-Lattice Relaxation in Sodium Ammonium Selenate Dihydrate:NaNHaSeOa.2He0

Proton spin-lattice relaxation studies in sodium ammonium selenate dihydrate carried out in the temperature range 130 to 300 K at 10 MHz show a continuous change in T, at T, indicating a second order phase transition. This compound is a typical case of a highly hindered solid wherein the thermally activated reorientations of ammonium ions freeze well above 77 K, as seen by NMR.Untersuchimgen der Protonen-Spin-Gitter-Relaxation in Natriuni-Ammoniumselenat-Dihydrat bei 10 MHz im Temperaturbereich 130 bis 300 K zeigen eine kontinuierliche Andernng in TI bei T, und ergeben einen Phasenubergang zweiter Art. Diese Verbindung ist ein typischer Fall eines stark ,,behinderten" Festkarpers, in dein die thermisch aktivierten Reorientierungen der Ammoniumionen weit oberhalb 77 H einfrieren, wie die NMR-Ergebnisse zeigen.

An algebraic algorithm for the design and analysis of linear dynamical systems

In an earlier paper [1], it has been shown that velocity ratio, defined with reference to the analogous circuit, is a basic parameter in the complete analysis of a linear one-dimensional dynamical system. In this paper it is shown that the terms constituting velocity ratio can be readily determined by means of an algebraic algorithm developed from a heuristic study of the process of transfer matrix multiplication. The algorithm permits the set of most significant terms at a particular frequency of interest to be identified from a knowledge of the relative magnitudes of the impedances of the constituent elements of a proposed configuration. This feature makes the algorithm a potential tool in a first approach to a rational design of a complex dynamical filter. This algorithm is particularly suited for the desk analysis of a medium size system with lumped as well as distributed elements.