Memory of past random wave conditions in submarine groundwater discharge

Submarine groundwater discharge (SGD) is an integral part of the hydrological cycle and represents an important aspect of land-ocean interactions. We used a numerical model to simulate flow and salt transport in a nearshore groundwater aquifer under varying wave conditions based on yearlong random wave data sets, including storm surge events. The results showed significant flow asymmetry with rapid response of influxes and retarded response of effluxes across the seabed to the irregular wave conditions. While a storm surge immediately intensified seawater influx to the aquifer, the subsequent return of intruded seawater to the sea, as part of an increased SGD, was gradual. Using functional data analysis, we revealed and quantified retarded, cumulative effects of past wave conditions on SGD including the fresh groundwater and recirculating seawater discharge components. The retardation was characterized well by a gamma distribution function regardless of wave conditions. The relationships between discharge rates and wave parameters were quantifiable by a regression model in a functional form independent of the actual irregular wave conditions. This statistical model provides a useful method for analyzing and predicting SGD from nearshore unconfined aquifers affected by random waves

Generation of optimum random pinhole arrays for multiple imaging

Through an analysis using the transfer function of a pinhole camera, the multiple imaging characteristics of photographic diffusers described by Grover and Tremblay [Appl. Opt.21,4500(1982)] is studied. It is found that only one pinhole diameter satisfies the optimum imaging condition for best contrast transfer at any desired spatial frequency. A simple method of generating random pinhole arrays with a controlled pinhole diameter is described. These pinhole arrays are later used to generate high frequency sinusoidal gratings from a coarse grid. The contrast in the final gratings is found to be reasonably high.

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.

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.

On the Cubicity of Interval Graphs

A k-cube (or ``a unit cube in k dimensions'') is defined as the Cartesian product R-1 x . . . x R-k where R-i (for 1 <= i <= k) is an interval of the form [a(i), a(i) + 1] on the real line. The k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that the k-cubes corresponding to two vertices in G have a non-empty intersection if and only if the vertices are adjacent. The cubicity of a graph G, denoted as cub(G), is defined as the minimum dimension k such that G has a k-cube representation. An interval graph is a graph that can be represented as the intersection of intervals on the real line - i. e., the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. We show that for any interval graph G with maximum degree Delta, cub(G) <= inverted right perpendicular log(2) Delta inverted left perpendicular + 4. This upper bound is shown to be tight up to an additive constant of 4 by demonstrating interval graphs for which cubicity is equal to inverted right perpendicular log(2) Delta inverted left perpendicular.

A Nonlinear System Under Combined Periodic and Random Excitation

The anharmonic oscillator under combined sinusoidal and white noise excitation is studied using the Gaussian closure approximation. The mean response and the steady-state variance of the system is obtained by the WKBJ approximation and also by the Fokker Planck equation. The multiple steadystate solutions are obtained and their stability analysis is presented. Numerical results are obtained for a particular set of system parameters. The theoretical results are compared with a digital simulation study to bring out the usefulness of the present approximate theory.

Boxicity of Halin graphs

A k-dimensional box is the Cartesian product R-1 x R-2 x ... x R-k where each R-i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G) is the minimum integer k such that G is the intersection graph of a collection of k-dimensional boxes. Halin graphs are the graphs formed by taking a tree with no degree 2 vertex and then connecting its leaves to form a cycle in such a way that the graph has a planar embedding. We prove that if G is a Halin graph that is not isomorphic to K-4, then box(G) = 2. In fact, we prove the stronger result that if G is a planar graph formed by connecting the leaves of any tree in a simple cycle, then box(G) = 2 unless G is isomorphic to K4 (in which case its boxicity is 1).

Helix-coil stability constants for amino acids in nonaqueous solvents. Studies of random poly(-benzyl-L-glutamate-co-L-alanine) and poly(-benzyl-L-glutamate-co-L-leucine) in a mixed solvent

The host-guest technique has been applied to the determination of the helix-coil stability constants of two naturally occurring amino acids, L-alanine and L-leucine, in a nonaqueous solvent system. Random copolymers containing L-alanine and L-leucine, respectively, as guest residues and -benzyl-L-glutamate as the host residue were synthesized. The polymers were fractionated and characterized for their amino acid content, molecular weight, and helix-coil transition behavior in a dichloroacetic acid (DCA)-1,2-dichloroethane (DCE) mixture. Two types of helix-coil transitions were carried out on the copolymers: solvent-induced transitions in DCA-DCE mixtures at 25°C and thermally induced transitions in a 82:18 (wt %) DCA-DCE mixture. The thermally induced transitions were analyzed by statistical mechanical methods to determine the Zimm-Bragg parameters, and s, of the guest residues. The experimental data indicate that, in the nonaqueous solvent, the L-alanine residue stabilizes the -helical conformation more than the L-leucine residue does. This is in contrast to their behavior in aqueous solution, where the reverse is true. The implications of this finding for the analysis of helical structures in globular proteins are discussed.

A note on acyclic edge coloring of complete bipartite graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic (2-colored) cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). Let Delta = Delta(G) denote the maximum degree of a vertex in a graph G. A complete bipartite graph with n vertices on each side is denoted by K-n,K-n. Alon, McDiarmid and Reed observed that a'(K-p-1,K-p-1) = p for every prime p. In this paper we prove that a'(K-p,K-p) <= p + 2 = Delta + 2 when p is prime. Basavaraju, Chandran and Kummini proved that a'(K-n,K-n) >= n + 2 = Delta + 2 when n is odd, which combined with our result implies that a'(K-p,K-p) = p + 2 = Delta + 2 when p is an odd prime. Moreover we show that if we remove any edge from K-p,K-p, the resulting graph is acyclically Delta + 1 = p + 1-edge-colorable. (C) 2009 Elsevier B.V. All rights reserved.

Application of various viscosity theories to the viscosity data of methyl methacrylate-acrylonitrile random copolymersstar

Values of Ko, Flory constant related to unperturbed dimensions, are evaluated for methyl methacrylate-acrylonitrile random copolymers using Flory-Fox, Kurata-Stockmayer and Inagaki-Ptitsyn methods and compared with the Ko values obtained by Stockmayer-Fixman method. Ko values are seen to be less in solvents which have large a (Mark-Houwink exponent) values. A correlation between Ko and a is developed to arrive at a more reliable estimate of Ko for this copolymer system.

Non-linear resonance in strings under narrow band random excitation, part I: Planar response and stability

Non-linear planar response of a string to planar narrow band random excitation is investigated in this paper. A response equation for the mean square deflection σ2 is obtained under a single mode approximation by using the equivalent linearization technique. It is shown that the response is triple valued, as in the case of harmonic excitation, if the centre frequency of excitation Ω lies in a certain specified range. The triple valued response occurs only if the excitation bandwidth β is smaller than a critical value βcrit which is a monotonically increasing function of the intensity of excitation. An approximate method of investigating the almost sure asymptotic stability of the solution is presented and regions of instability in the Ω-σ2 plane have been charted. It is shown that planar response can become unstable either due to an unbounded growth of the in-plane component of motion or due to a spontaneous appearance of an out-of-plane component.

Acyclic Edge Coloring of Graphs with Maximum Degree 4

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Sudakov, and Zaks that for any simple and finite graph G, a'(G) <= Delta+2, where Delta=Delta(G) denotes the maximum degree of G. We prove the conjecture for connected graphs with Delta(G)<= 4, with the additional restriction that m <= 2n-1, where n is the number of vertices and m is the number of edges in G. Note that for any graph G, m <= 2n, when Delta(G)<= 4. It follows that for any graph G if Delta(G)<= 4, then a'(G) <= 7.

An identification tool for the Australian weedy Sporobolus species based on random amplified polymorphic DNA (RAPD) profiles

Based on morphological features alone, there is considerable difficulty in identifying the 5 most economically damaging weed species of Sporobolus [viz. S. pyramidalis P. Beauv., S. natalensis (Steud.) Dur and Schinz, S. fertilis (Steud.) Clayton, S. africanus (Poir.) Robyns and Tourney, and S. jacquemontii Kunth.] found in Australia. A polymerase chain reaction (PCR)-based random amplified polymorphic DNA (RAPD) technique was used to create a series of genetic markers that could positively identify the 5 major weeds from the other less damaging weedy and native Sporobolus species. In the initial RAPD profiling experiment, using arbitrarily selected primers and involving 12 species of Sporobolus, 12 genetic markers were found that, when used in combination, could consistently identify the 5 weedy species from all others. Of these 12 markers, the most diagnostic were UBC51490 for S. pyramidalis and S. natalensis; UBC43310.2000.2100 for S. fertilis and S. africanus; and ORA20850 and UBC43470 for S. jacquemontii. Species-specific markers could be found only for S. jacquemontii. In an effort to understand why there was difficulty in obtaining species-specific markers for some of the weedy species, a RAPD data matrix was created using 40 RAPD products. These 40 products amplified by 6 random primers from 45 individuals belonging to 12 species, were then subjected to numerical taxonomy and multivariate system (NTSYS pc version 1.70) analysis. The RAPD similarity matrix generated from the analysis indicated that S. pyramidalis was genetically more similar to S. natalensis than to other species of the 'S. indicus complex'. Similarly, S. jacquemontii was more similar to S. pyramidalis, and S. fertilis was more similar to S. africanus than to other species of the complex. Sporobolus pyramidalis, S. jacquemontii, S. africanus, and S. creber exhibited a low within-species genetic diversity, whereas high genetic diversity was observed within S. natalensis, S. fertilis, S. sessilis, S. elongates, and S. laxus. Cluster analysis placed all of the introduced species (major and minor weedy species) into one major cluster, with S. pyramidalis and S. natalensis in one distinct subcluster and S. fertilis and S. africanus in another. The native species formed separate clusters in the phenograms. The close genetic similarity of S. pyramidalis to S. natalensis, and S. fertilis to S. africanus may explain the difficulty in obtaining RAPD species-specific markers. The importance of these results will be within the Australian dairy and beef industries and will aid in the development of integrated management strategy for these weeds.

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.

An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V, E). The expected running time of our algorithm is (O) over tilde (mc) where vertical bar E vertical bar = m and c is the maximum u-v edge connectivity, where u, v is an element of V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n - 1; so the expected run-ning time of our algorithm for simple unweighted graphs is (O) over tilde (mn). All the algorithms currently known for constructing a Gomory-Hu tree [8, 9] use n - 1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest (O) over tilde (n(20/9)) max flow algorithm due to Karger and Levine[11] yields the current best running time of (O) over tilde (n(20/9)n) for Gomory-Hu tree construction on simple unweighted graphs with m edges and n vertices. Thus we present the first (O) over tilde (mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs. We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S subset of V can be reused for computing a minimum Steiner cut for certain Steiner sets S' subset of S.