A numerical study of division of flow in open channels

A two-dimensional numerical model which employs the depth-averaged forms of continuity and momentum equations along with k-e turbulence closure scheme is used to simulate the flow at the open channel divisions. The model is generalised to flows of arbitrary geometries and MacCormack finite volume method is used for solving governing equations. Application of cartesian version of the model to analyse the flow at right-angled junction is presented. The numerical predictions are compared with experimental data of earlier investigators and measurements made as part of the present study. Performance of the model in predicting discharge distribution, surface profiles, separation zone parameters and energy losses is evaluated and discussed in detail. To illustrate the application of the numerical model to analyse the flow in acute angled offtakes and streamlined branch entries, a few computational results are presented.

Obliquely incident water waves against a vertical cliff

Utilizing the commutativity property of the Cartesian coordinate differential operators arising in the boundary conditions associated with the propagation of surface water waves against a vertical cliff, under the assumptions of linearized theory, the problem of obliquely incident surface waves is considered for solution. The case of normal incidence, handled by previous workers follow as a particular limiting case of the present problem, which exhibits a source/sink type behavior of the velocity potential at the shore-line. An independent method of attack is also presented to handle the case of normal incidence.

Unsteady compressible flow due to relative rotation and translation of a viscous fluid on a disk

The modification of the axisymmetric viscous flow due to relative rotation of the disk or fluid by a translation of the boundary is studied. The fluid is taken to be compressible, and the relative rotation and translation velocity of the disk or fluid are time-dependent. The nonlinear partial differential equations governing the motion are solved numerically using an implicit finite difference scheme and Newton's linearisation technique. Numerical solutions are obtained at various non-dimensional times and disk temperatures. The non-symmetric part of the flow (secondary flow) describing the translation effect generates a velocity field at each plane parallel to the disk. The cartesian components of velocity due to secondary flow exhibit oscillations when the motion is due to rotation of the fluid on a translating disk. Increase in translation velocity produces an increment in the radial skin friction but reduces the tangential skin friction.

Efficient algorithms for learning kernels from multiple similarity matrices with general convex loss functions

In this paper we consider the problem of learning an n × n kernel matrix from m(1) similarity matrices under general convex loss. Past research have extensively studied the m = 1 case and have derived several algorithms which require sophisticated techniques like ACCP, SOCP, etc. The existing algorithms do not apply if one uses arbitrary losses and often can not handle m > 1 case. We present several provably convergent iterative algorithms, where each iteration requires either an SVM or a Multiple Kernel Learning (MKL) solver for m > 1 case. One of the major contributions of the paper is to extend the well knownMirror Descent(MD) framework to handle Cartesian product of psd matrices. This novel extension leads to an algorithm, called EMKL, which solves the problem in O(m2 log n 2) iterations; in each iteration one solves an MKL involving m kernels and m eigen-decomposition of n × n matrices. By suitably defining a restriction on the objective function, a faster version of EMKL is proposed, called REKL,which avoids the eigen-decomposition. An alternative to both EMKL and REKL is also suggested which requires only an SVMsolver. Experimental results on real world protein data set involving several similarity matrices illustrate the efficacy of the proposed algorithms.

An economical method for direct numerical simulation studies of transitional round jets

A pseudo-spectral method based on Fourier expansions in a Cartesian coordinate system is shown to be an economical method for direct numerical simulation studies of transitional round jets, Several characteristics of the solutions are presented to establish the validity of the solutions in spite of the unnatural choices. We show that neither periodicity, nor the use of a Cartesian system have adversely affected the simulations, Instead, there are benefits in terms of ease of computing and lack of the usual restrictions due to grid structure near the jet axis. By computing the simultaneous evolution of passive scalers, the process of reaction in round jet burners, between a fuel-laden jet and an ambient oxidizer, was also simulated. Some typical solutions are shown and then the results of analysis of these data are summarized. (C) 2001 Elsevier Science Ltd, All rights reserved.

Finding a Box Representation for a Graph in $O(n^2\Delta^2\ln n)$ time

An axis-parallel box in $b$-dimensional space is a Cartesian product $R_1 \times R_2 \times \cdots \times R_b$ where $R_i$ (for $1 \leq i \leq b$) is a closed interval of the form $[a_i, b_i]$ on the real line. For a graph $G$, its boxicity is the minimum dimension $b$, such that $G$ is representable as the intersection graph of (axis-parallel) boxes in $b$-dimensional space. The concept of boxicity finds application in various areas of research like ecology, operation research etc. Chandran, Francis and Sivadasan gave an $O(\Delta n^2 \ln^2 n)$ randomized algorithm to construct a box representation for any graph $G$ on $n$ vertices in $\lceil (\Delta + 2)\ln n \rceil$ dimensions, where $\Delta$ is the maximum degree of the graph. They also came up with a deterministic algorithm that runs in $O(n^4 \Delta )$ time. Here, we present an $O(n^2 \Delta^2 \ln n)$ deterministic algorithm that constructs the box representation for any graph in $\lceil (\Delta + 2)\ln n \rceil$ dimensions.

Redundancy resolution using a tractrix and its application to real-time simulations of hyper-redundant manipulators, snakes and tying of knots

To realistically simulate the motion of flexible objects such as ropes, strings, snakes, or human hair,one strategy is to discretise the object into a large number of small rigid links connected by rotary or spherical joints. The discretised system is highly redundant and the rotations at the joints (or the motion of the other links) for a desired Cartesian motion of the end of a link cannot be solved uniquely. In this paper, we propose a novel strategy to resolve the redundancy in such hyper-redundant systems.We make use of the classical tractrix curve and its attractive features. For a desired Cartesian motion of the `head'of a link, the `tail' of the link is moved according to a tractrix,and recursively all links of the discretised objects are moved along different tractrix curves. We show that the use of a tractrix curve leads to a more `natural' motion of the entire object since the motion is distributed uniformly along the entire object with the displacements tending to diminish from the `head' to the `tail'. We also show that the computation of the motion of the links can be done in real time since it involves evaluation of simple algebraic, trigonometric and hyperbolic functions. The strategy is illustrated by simulations of a snake, tying of knots with a rope and a solution of the inverse kinematics of a planar hyper-redundant manipulator.

Boxicity of Circular Arc Graphs

A k-dimensional box is a Cartesian product R(1)x...xR(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 can be represented as the intersection graph of a collection of k-dimensional boxes. That is, two vertices are adjacent if and only if their corresponding boxes intersect. A circular arc graph is a graph that can be represented as the intersection graph of arcs on a circle. We show that if G is a circular arc graph which admits a circular arc representation in which no arc has length at least pi(alpha-1/alpha) for some alpha is an element of N(>= 2), then box(G) <= alpha (Here the arcs are considered with respect to a unit circle). From this result we show that if G has maximum degree Delta < [n(alpha-1)/2 alpha] for some alpha is an element of N(>= 2), then box(G) <= alpha. We also demonstrate a graph having box(G) > alpha but with Delta = n (alpha-1)/2 alpha + n/2 alpha(alpha+1) + (alpha+2). For a proper circular arc graph G, we show that if Delta < [n(alpha-1)/alpha] for some alpha is an element of N(>= 2), then box(G) <= alpha. Let r be the cardinality of the minimum overlap set, i.e. the minimum number of arcs passing through any point on the circle, with respect to some circular arc representation of G. We show that for any circular arc graph G, box(G) <= r + 1 and this bound is tight. We show that if G admits a circular arc representation in which no family of k <= 3 arcs covers the circle, then box(G) <= 3 and if G admits a circular arc representation in which no family of k <= 4 arcs covers the circle, then box(G) <= 2. We also show that both these bounds are tight.

Boxicity and Poset Dimension

Let G be a simple, undirected, finite graph with vertex set V (G) and edge set E(G). A k-dimensional box is a Cartesian product of closed intervals [a(1), b(1)] x [a(2), b(2)] x ... x [a(k), b(k)]. The boxicity of G, box(G), is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes; i.e., each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset, where S is the ground set and P is a reflexive, antisymmetric and transitive binary relation on S. The dimension of P, dim(P), is the minimum integer t such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P; i.e., S is the vertex set and two vertices are adjacent if and only if they are comparable in P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. It immediately follows that if P is a height-2 poset, then box(G(P)) <= dim(P) <= 2box(G(P)) since the underlying comparability graph of a height-2 poset is a bipartite graph. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with the extended double cover of G, denoted as G(c): Note that G(c) is a bipartite graph with partite sets A and B which are copies of V (G) such that, corresponding to every u is an element of V (G), there are two vertices u(A) is an element of A and u(B) is an element of B and {u(A), v(B)} is an edge in G(c) if and only if either u = v or u is adjacent to v in G. Let P(c) be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P(c)) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension such as dim(P) = 2 tree width (G(P)) + 4, since boxicity of any graph is known to be at most its tree width + 2. In the other direction, using the already known bounds for partial order dimension we get the following: (1) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta), which is an improvement over the best-known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-is an element of)) for any is an element of > 0 unless NP = ZPP.

Isomeric identification of methylated naphthalenes using gas phase infrared spectroscopy

We report gas phase mid-infrared spectra of 1- and 2- methyl naphthalenes at 0.2 cm(-1) resolution. Assignment of observed bands have been made using scaled quantum mechanical (SQM) calculations where the force fields rather the frequencies are scaled to find a close fit between observed and calculated bands. The structure of the molecules has been optimized using B3LYP level of theory in conjunction with standard 6-311G** basis set to obtain the harmonic frequencies. Using the force constants in Cartesian coordinates from the Gaussian output, scaled force field calculations are carried out using a modified version of the UMAT program in the QCPE package. Potential energy distributions of the normal modes obtained from such calculations helped us assign the observed bands and identify the unique features of the spectra of 1- and 2-MNs which are important for their isomeric identification.

Infrared Spectra of Dimethylphenanthrenes in the Gas phase

Infrared spectra of atmospherically and astronomically important dimethylphenanthrenes (DMPs), namely 1,9-DMP, 2,4-DMP, and 3,9-DMP, were recorded in the gas phase from 400 to 4000 cm(-1) with a resolution of 0.5 cm(-1) at 110 degrees C using a 7.2 m gas cell. DFT calculations at the B3LYP/6-311G** level were carried out to get the harmonic and anharmonic frequencies and their corresponding intensities for the assignment of the observed bands. However, spectral assignments could not be made unambiguously using anharmonic or selectively scaled harmonic frequencies. Therefore, the scaled quantum mechanical (SQM) force field analysis method was adopted to achieve more accurate assignments. In this method force fields instead of frequencies were scaled. The Cartesian force field matrix obtained from the Gaussian calculations was converted to a nonredundant local coordinate force field matrix and then the force fields were scaled to match experimental frequencies in a consistent manner using a modified version of the UMAT program of the QCPE package. Potential energy distributions (PEDs) of the normal modes in terms of nonredundant local coordinates obtained from these calculations helped us derive the nature of the vibration at each frequency. The intensity of observed bands in the experimental spectra was calculated using estimated vapor pressures of the DMPs. An error analysis of the mean deviation between experimental and calculated intensities reveal that the observed methyl C-H stretching intensity deviates more compared to the aromatic C-H and non C-H stretching bands.

A Triangulation of CP3 as Symmetric Cube of S-2

The symmetric group acts on the Cartesian product (S (2)) (d) by coordinate permutation, and the quotient space is homeomorphic to the complex projective space a'',P (d) . We used the case d=2 of this fact to construct a 10-vertex triangulation of a'',P (2) earlier. In this paper, we have constructed a 124-vertex simplicial subdivision of the 64-vertex standard cellulation of (S (2))(3), such that the -action on this cellulation naturally extends to an action on . Further, the -action on is ``good'', so that the quotient simplicial complex is a 30-vertex triangulation of a'',P (3). In other words, we have constructed a simplicial realization of the branched covering (S (2))(3)-> a'',P (3).

Vaporization and collision modeling of liquid fuel sprays in a co-axial fuel and air pre-mixer

Droplet collision occurs frequently in regions where the droplet number density is high. Even for Lean Premixed and Pre-vaporized (LPP) liquid sprays, the collision effects can be very high on the droplet size distributions, which will in turn affect the droplet vaporization process. Hence, in conjunction with vaporization modeling, collision modeling for such spray systems is also essential. The standard O'Rourke's collision model, usually implemented in CFD codes, tends to generate unphysical numerical artifact when simulations are performed on Cartesian grid and the results are not grid independent. Thus, a new collision modeling approach based on no-time-counter method (NTC) proposed by Schmidt and Rutland is implemented to replace O'Rourke's collision algorithm to solve a spray injection problem in a cylindrical coflow premixer. The so called ``four-leaf clover'' numerical artifacts are eliminated by the new collision algorithm and results from a diesel spray show very good grid independence. Next, the dispersion and vaporization processes for liquid fuel sprays are simulated in a coflow premixer. Two liquid fuels under investigation are jet-A and Rapeseed Methyl Esters (RME). Results show very good grid independence in terms of SMD distribution, droplet number distribution and fuel vapor mass flow rate. A baseline test is first established with a spray cone angle of 90 degrees and injection velocity of 3 m/s and jet-A achieves much better vaporization performance than RME due to its higher vapor pressure. To improve the vaporization performance for both fuels, a series of simulations have been done at several different combinations of spray cone angle and injection velocity. At relatively low spray cone angle and injection velocity, the collision effect on the average droplet size and the vaporization performance are very high due to relatively high coalescence rate induced by droplet collisions. Thus, at higher spray cone angle and injection velocity, the results expectedly show improvement in fuel vaporization performance since smaller droplet has a higher vaporization rate. The vaporization performance and the level of homogeneity of fuel-air mixture can be significantly improved when the dispersion level is high, which can be achieved by increasing the spray cone angle and injection velocity. (C) 2012 Elsevier Ltd. All rights reserved.

3-MANIFOLD GROUPS, KÄHLER GROUPS AND COMPLEX SURFACES

Let G be a Kahler group admitting a short exact sequence 1 -> N -> G -> Q -> 1 where N is finitely generated. (i) Then Q cannot be non-nilpotent solvable. (ii) Suppose in addition that Q satisfies one of the following: (a) Q admits a discrete faithful non-elementary action on H-n for some n >= 2. (b) Q admits a discrete faithful non-elementary minimal action on a simplicial tree with more than two ends. (c) Q admits a (strong-stable) cut R such that the intersection of all conjugates of R is trivial. Then G is virtually a surface group. It follows that if Q is infinite, not virtually cyclic, and is the fundamental group of some closed 3-manifold, then Q contains as a finite index subgroup either a finite index subgroup of the three-dimensional Heisenberg group or the fundamental group of the Cartesian product of a closed oriented surface of positive genus and the circle. As a corollary, we obtain a new proof of a theorem of Dimca and Suciu in Which 3-manifold groups are Kahler groups? J. Eur. Math. Soc. 11 (2009) 521-528] by taking N to be the trivial group. If instead, G is the fundamental group of a compact complex surface, and N is finitely presented, then we show that Q must contain the fundamental group of a Seifert-fibered 3-manifold as a finite index subgroup, and G contains as a finite index subgroup the fundamental group of an elliptic fibration. We also give an example showing that the relation of quasi-isometry does not preserve Kahler groups. This gives a negative answer to a question of Gromov which asks whether Kahler groups can be characterized by their asymptotic geometry.

Cubicity and Bandwidth

A unit cube in (or a k-cube in short) is defined as the Cartesian product R (1) x R (2) x ... x R (k) where R (i) (for 1 a parts per thousand currency sign i a parts per thousand currency sign k) is a closed interval of the form a (i) , a (i) + 1] on the real line. A k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that two vertices in G are adjacent if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G is the minimum k such that G has a k-cube representation. From a geometric embedding point of view, a k-cube representation of G = (V, E) yields an embedding such that for any two vertices u and v, ||f(u) - f(v)||(a) a parts per thousand currency sign 1 if and only if . We first present a randomized algorithm that constructs the cube representation of any graph on n vertices with maximum degree Delta in O(Delta ln n) dimensions. This algorithm is then derandomized to obtain a polynomial time deterministic algorithm that also produces the cube representation of the input graph in the same number of dimensions. The bandwidth ordering of the graph is studied next and it is shown that our algorithm can be improved to produce a cube representation of the input graph G in O(Delta ln b) dimensions, where b is the bandwidth of G, given a bandwidth ordering of G. Note that b a parts per thousand currency sign n and b is much smaller than n for many well-known graph classes. Another upper bound of b + 1 on the cubicity of any graph with bandwidth b is also shown. Together, these results imply that for any graph G with maximum degree Delta and bandwidth b, the cubicity is O(min{b, Delta ln b}). The upper bound of b + 1 is used to derive upper bounds for the cubicity of circular-arc graphs, cocomparability graphs and AT-free graphs in terms of the maximum degree Delta.