Representation of functional dependencies in relational databases using linear graphs

Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) dependency relation, (2) equipotence relation, (3) dissidence relation, (4) completion relation, and dual relations of each of them are described. Any one of these eight relations can be used to represent the functional dependencies in a database. Results from linear graph theory are found helpful in obtaining these representations. The dependency relation directly gives the functional dependencies. The equipotence relation specifies the dependencies in terms of attribute sets which functionally determine each other. The dissidence relation specifies the dependencies in terms of saturated sets in a very indirect way. Completion relation represents the functional dependencies as a function, the range of which turns out to be a lattice. Depletion relation which is the dual of the completion relation can also represent functional dependencies and similarly can the duals of dependency, equipotence, and dissidence relations. The class of depleted sets, which is the dual of saturated sets, is defined and used in the study of depletion relations.

Representation of functional dependencies in relational databases using linear graphs

Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) dependency relation, (2) equipotence relation, (3) dissidence relation, (4) completion relation, and dual relations of each of them are described. Any one of these eight relations can be used to represent the functional dependencies in a database. Results from linear graph theory are found helpful in obtaining these representations. The dependency relation directly gives the functional dependencies. The equipotence relation specifies the dependencies in terms of attribute sets which functionally determine each other. The dissidence relation specifies the dependencies in terms of saturated sets in a very indirect way. Completion relation represents the functional dependencies as a function, the range of which turns out to be a lattice. Depletion relation which is the dual of the completion relation can also represent functional dependencies and similarly can the duals of dependency, equipotence, and dissidence relations. The class of depleted sets, which is the dual of saturated sets, is defined and used in the study of depletion relations.

Comparison of Elasticity, Shell Core, and Sandwich Shell Theories

The problem of an infinite circular sandwich shell subjected to an a\isymmetric radial line load is investigated using three-dimensional elasticity theory, shell core method, and sandwich shell theory due to Fulton and Schmidt. A comparison of the stresses and displacements with an exact elasticity solution is carried out for various shell parameters in order to clearly bring out the limitations of sandwich shell theories of Fulton and Schmidt as well as the shell core solution.

Phase field study of precipitate growth: Effect of misfit strain and interface curvature

We have used phase field simulations to study the effect of misfit and interfacial curvature on diffusion-controlled growth of an isolated precipitate in a supersaturated matrix. Treating our simulations as computer experiments, we compare our simulation results with those based on the Zener–Frank and Laraia–Johnson–Voorhees theories for the growth of non-misfitting and misfitting precipitates, respectively. The agreement between simulations and the Zener–Frank theory is very good in one-dimensional systems. In two-dimensional systems with interfacial curvature (with and without misfit), we find good agreement between theory and simulations, but only at large supersaturations, where we find that the Gibbs–Thomson effect is less completely realized. At small supersaturations, the convergence of instantaneous growth coefficient in simulations towards its theoretical value could not be tracked to completion, because the diffusional field reached the system boundary. Also at small supersaturations, the elevation in precipitate composition matches well with the theoretically predicted Gibbs–Thomson effect in both misfitting and non-misfitting systems.

Computer-aided analysis of the structure of kinematic chains

Using the link-link incidence matrix to represent a simple-jointed kinematic chain algebraic procedures have been developed to determine its structural characteristics such as the type of freedom of the chain, the number of distinct mechanisms and driving mechanisms that can be derived from the chain. A computer program incorporating these graph theory based procedures has been applied successfully for the structural analysis of several typical chains.

A phase space approach to generalized Hamilton–Jacobi theory

Generalizations of H–J theory have been discussed before in the literature. The present approach differs from others in that it employs geometrical ideas on phase space and classical transformation theory to derive the basic equations. The relation between constants of motion and symmetries of the generalized H–J equations is then clarified. Journal of Mathematical Physics is copyrighted by The American Institute of Physics.

Acoustic emission source location in composite structure by Voronoi construction using geodesic curve evolution

Conventional analytical/numerical methods employing triangulation technique are suitable for locating acoustic emission (AE) source in a planar structure without structural discontinuities. But these methods cannot be extended to structures with complicated geometry, and, also, the problem gets compounded if the material of the structure is anisotropic warranting complex analytical velocity models. A geodesic approach using Voronoi construction is proposed in this work to locate the AE source in a composite structure. The approach is based on the fact that the wave takes minimum energy path to travel from the source to any other point in the connected domain. The geodesics are computed on the meshed surface of the structure using graph theory based on Dijkstra's algorithm. By propagating the waves in reverse virtually from these sensors along the geodesic path and by locating the first intersection point of these waves, one can get the AE source location. In this work, the geodesic approach is shown more suitable for a practicable source location solution in a composite structure with arbitrary surface containing finite discontinuities. Experiments have been conducted on composite plate specimens of simple and complex geometry to validate this method.

Allostery and conformational free energy changes in human tryptophanyl-tRNA synthetase from essential dynamics and structure networks

The interdependence of the concept of allostery and enzymatic catalysis, and they being guided by conformational mobility is gaining increased prominence. However, to gain a molecular level understanding of llostery and hence of enzymatic catalysis, it is of utter importance that the networks of amino acids participating in allostery be deciphered. Our lab has been exploring the methods of network analysis combined with molecular dynamics simulations to understand allostery at molecular level. Earlier we had outlined methods to obtain communication paths and then to map the rigid/flexible regions of proteins through network parameters like the shortest correlated paths, cliques, and communities. In this article, we advance the methodology to estimate the conformational populations in terms of cliques/communities formed by interactions including the side-chains and then to compute the ligand-induced population shift. Finally, we obtain the free-energy landscape of the protein in equilibrium, characterizing the free-energy minima accessed by the protein complexes. We have chosen human tryptophanyl-tRNA synthetase (hTrpRS), a protein esponsible for charging tryptophan to its cognate tRNA during protein biosynthesis for this investigation. This is a multidomain protein exhibiting excellent allosteric communication. Our approach has provided valuable structural as well as functional insights into the protein. The methodology adopted here is highly generalized to illuminate the linkage between protein structure networks and conformational mobility involved in the allosteric mechanism in any protein with known structure.

A note on the Hadwiger number of circular arc graphs

The intention of this note is to motivate the researchers to study Hadwiger's conjecture for circular arc graphs. Let η(G) denote the largest clique minor of a graph G, and let χ(G) denote its chromatic number. Hadwiger's conjecture states that η(G)greater-or-equal, slantedχ(G) and is one of the most important and difficult open problems in graph theory. From the point of view of researchers who are sceptical of the validity of the conjecture, it is interesting to study the conjecture for graph classes where η(G) is guaranteed not to grow too fast with respect to χ(G), since such classes of graphs are indeed a reasonable place to look for possible counterexamples. We show that in any circular arc graph G, η(G)less-than-or-equals, slant2χ(G)−1, and there is a family with equality. So, it makes sense to study Hadwiger's conjecture for this family.

DMT of Multi-hop Cooperative Networks-Part I: K-Parallel-Path Networks

We consider single-source, single-sink multi-hop relay networks, with slow-fading Rayleigh fading links and single-antenna relay nodes operating under the half-duplex constraint. While two hop relay networks have been studied in great detail in terms of the diversity-multiplexing tradeoff (DMT), few results are available for more general networks. In this two-part paper, we identify two families of networks that are multi-hop generalizations of the two hop network: K-Parallel-Path (KPP) networks and Layered networks. In the first part, we initially consider KPP networks, which can be viewed as the union of K node-disjoint parallel paths, each of length > 1. The results are then generalized to KPP(I) networks, which permit interference between paths and to KPP(D) networks, which possess a direct link from source to sink. We characterize the optimal DMT of KPP(D) networks with K >= 4, and KPP(I) networks with K >= 3. Along the way, we derive lower bounds for the DMT of triangular channel matrices, which are useful in DMT computation of various protocols. As a special case, the DMT of two-hop relay network without direct link is obtained. Two key implications of the results in the two-part paper are that the half-duplex constraint does not necessarily entail rate loss by a factor of two, as previously believed and that, simple AF protocols are often sufficient to attain the best possible DMT.

Phase space methods and the Hamilton-Jacobi form of dynamics

A general analysis of the Hamilton-Jacobi form of dynamics motivated by phase space methods and classical transformation theory is presented. The connection between constants of motion, symmetries, and the Hamilton-Jacobi equation is described.

Network approach for capturing ligand-induced subtle global changes in protein structures

Ligand-induced conformational changes in proteins are of immense functional relevance. It is a major challenge to elucidate the network of amino acids that are responsible for the percolation of ligand-induced conformational changes to distal regions in the protein from a global perspective. Functionally important subtle conformational changes (at the level of side-chain noncovalent interactions) upon ligand binding or as a result of environmental variations are also elusive in conventional studies such as those using root-mean-square deviations (r.m.s.d.s). In this article, the network representation of protein structures and their analyses provides an efficient tool to capture these variations (both drastic and subtle) in atomistic detail in a global milieu. A generalized graph theoretical metric, using network parameters such as cliques and/or communities, is used to determine similarities or differences between structures in a rigorous manner. The ligand-induced global rewiring in the protein structures is also quantified in terms of network parameters. Thus, a judicious use of graph theory in the context of protein structures can provide meaningful insights into global structural reorganizations upon perturbation and can also be helpful for rigorous structural comparison. Data sets for the present study include high-resolution crystal structures of serine proteases from the S1A family and are probed to quantify the ligand-induced subtle structural variations.

Modified Kirchhoffs theory of plates including transverse shear deformations

A primary flexure problem defined by Kirchhoff theory of plates in bending is considered. Significance of auxiliary function introduced earlier in the in-plane displacements in resolving Poisson-Kirchhoffs boundary conditions paradox is reexamined with reference to reported sixth order shear deformation theories, in particular, Reissner's theory and Hencky's theory. Sixth order modified Kirchhoff's theory is extended here to include shear deformations in the analysis. (C) 2011 Elsevier Ltd. All rights reserved.

Impact of Energy Expenditure Rate Constraints on the performance of Multihop Wireless Mesh Networks

In this article we study the problem of joint congestion control, routing and MAC layer scheduling in multi-hop wireless mesh network, where the nodes in the network are subjected to maximum energy expenditure rates. We model link contention in the wireless network using the contention graph and we model energy expenditure rate constraint of nodes using the energy expenditure rate matrix. We formulate the problem as an aggregate utility maximization problem and apply duality theory in order to decompose the problem into two sub-problems namely, network layer routing and congestion control problem and MAC layer scheduling problem. The source adjusts its rate based on the cost of the least cost path to the destination where the cost of the path includes not only the prices of the links in it but also the prices associated with the nodes on the path. The MAC layer scheduling of the links is carried out based on the prices of the links. We study the e�ects of energy expenditure rate constraints of the nodes on the optimal throughput of the network.

Combinatorial Representations of Block Codes

We look at graphical descriptions of block codes known as trellises, which illustrate connections between algebra and graph theory, and can be used to develop powerful decoding algorithms. Trellis sizes for linear block codes are known to grow exponentially with the code parameters. Of considerable interest to coding theorists therefore, are more compact descriptions called tail-biting trellises which in some cases can be much smaller than any conventional trellis for the same code . We derive some interesting properties of tail-biting trellises and present a new decoding algorithm.