An efficient flux difference splitting algorithm for unsteady duct flows of a real gas

A numerical scheme is presented for the solution of the Euler equations of compressible flow of a real gas in a single spatial coordinate. This includes flow in a duct of variable cross-section, as well as flow with slab, cylindrical or spherical symmetry, as well as the case of an ideal gas, and can be useful when testing codes for the two-dimensional equations governing compressible flow of a real gas. The resulting scheme requires an average of the flow variables across the interface between cells, and this average is chosen to be the arithmetic mean for computational efficiency, which is in contrast to the usual “square root” averages found in this type of scheme. The scheme is applied with success to five problems with either slab or cylindrical symmetry and for a number of equations of state. The results compare favourably with the results from other schemes.

An efficient finite difference scheme for three-dimensional, non-equilibrium flows using operator splitting

An efficient finite difference scheme is presented for the inviscid terms of the three-dimensional, compressible flow equations for chemical non-equilibrium gases. This scheme represents an extension and an improvement of one proposed by the author, and includes operator splitting.

Flux difference splitting for open channel flows

A finite difference scheme based on flux difference splitting is presented for the solution of the one-dimensional shallow-water equations in open channels, together with an extension to two-dimensional flows. A linearized problem, analogous to that of Riemann for gas dynamics, is defined and a scheme, based on numerical characteristic decomposition, is presented for obtaining approximate solutions to the linearized problem. The method of upwind differencing is used for the resulting scalar problems, together with a flux limiter for obtaining a second-order scheme which avoids non-physical, spurious oscillations. The scheme is applied to a one-dimensional dam-break problem, and to a problem of flow in a river whose geometry induces a region of supercritical flow. The scheme is also applied to a two-dimensional dam-break problem. The numerical results are compared with the exact solution, or other numerical results, where available.

Vertex splitting and connectivity augmentation in hypergraphs

We consider problems of splitting and connectivity augmentation in hypergraphs. In a hypergraph G = (V +s, E), to split two edges su, sv, is to replace them with a single edge uv. We are interested in doing this in such a way as to preserve a defined level of connectivity in V . The splitting technique is often used as a way of adding new edges into a graph or hypergraph, so as to augment the connectivity to some prescribed level. We begin by providing a short history of work done in this area. Then several preliminary results are given in a general form so that they may be used to tackle several problems. We then analyse the hypergraphs G = (V + s, E) for which there is no split preserving the local-edge-connectivity present in V. We provide two structural theorems, one of which implies a slight extension to Mader’s classical splitting theorem. We also provide a characterisation of the hypergraphs for which there is no such “good” split and a splitting result concerned with a specialisation of the local-connectivity function. We then use our splitting results to provide an upper bound on the smallest number of size-two edges we must add to any given hypergraph to ensure that in the resulting hypergraph we have λ(x, y) ≥ r(x, y) for all x, y in V, where r is an integer valued, symmetric requirement function on V*V. This is the so called “local-edge-connectivity augmentation problem” for hypergraphs. We also provide an extension to a Theorem of Szigeti, about augmenting to satisfy a requirement r, but using hyperedges. Next, in a result born of collaborative work with Zoltán Király from Budapest, we show that the local-connectivity augmentation problem is NP-complete for hypergraphs. Lastly we concern ourselves with an augmentation problem that includes a locational constraint. The premise is that we are given a hypergraph H = (V,E) with a bipartition P = {P1, P2} of V and asked to augment it with size-two edges, so that the result is k-edge-connected, and has no new edge contained in some P(i). We consider the splitting technique and describe the obstacles that prevent us forming “good” splits. From this we deduce results about which hypergraphs have a complete Pk-split. This leads to a minimax result on the optimal number of edges required and a polynomial algorithm to provide an optimal augmentation.

Comprehension of reflexives and pronouns in sequential bilingual children: do they pattern similarly to L1 children, L2 adults, or children with specific language impairment?

This paper investigates how sequential bilingual (L2) Turkish-English children comprehend English reflexives and pronouns and tests whether they pattern similarly to monolingual (L1) children, L2 adults, or children with Specific Language Impairment (SLI). Thirty nine 6- to 9-year-old L2 children with an age of onset of 30-48 months and exposure to English of 30-72 months and 33 L1 age-matched control children completed the Advanced Syntactic Test of Pronominal Reference-Revised (van der Lely, 1997). The L2 children’s performance was compared to L2 adults from Demirci (2001) and children with SLI from van der Lely & Stollwerck (1997). The L2 children’s performance in the comprehension of reflexives was almost identical to their age-matched controls, and differed from L2 adults and children with SLI. In the comprehension of pronouns, L2 children showed an asymmetry between referential and quantificational NPs, a pattern attested in younger L1 children and children with SLI. Our study provides evidence that the development of comprehension of reflexives and pronouns in these children resembles monolingual L1 acquisition and not adult L2 acquisition or acquisition of children with SLI.

Pattern separation in digital learning nets

Pattern separation is a new technique in digital learning networks which can be used to detect state conflicts. This letter describes pattern separation in a simple single-layer network, and an application of the technique in networks with feedback.

Divergent evolutionary pattern of starch biosynthetic pathway genes in grasses and dicots

Starch is the most widespread and abundant storage carbohydrate in crops and its production is critical to both crop yield and quality. As regards the starch content in the seeds of crop plants, there are distinct difference between grasses (Poaceae) and dicots. However, few studies have described the evolutionary pattern of genes in the starch biosynthetic pathway in these two groups of plants. In this study, therefore, an attempt was made to compare the evolutionary rate, gene duplication and selective pattern of the key genes involved in this pathway between the two groups, using five grasses and five dicots as materials. The results showed (i) distinct differences in patterns of gene duplication and loss between grasses and dicots; duplication in grasses mainly occurred prior to the divergence of grasses, whereas duplication mostly occurred in individual species within the dicots; there is less gene loss in grasses than in dicots; (ii) a considerably higher evolutionary rate in grasses than in dicots in most gene families analyzed; (iii) evidence of a different selective pattern between grasses and dicots; positive selection may have occurred asymmetrically in grasses in some gene families, e.g. AGPase small subunit. Therefore, we deduced that gene duplication contributes to, and a higher evolutionary rate is associated with, the higher starch content in grasses. In addition, two novel aspects of the evolution of the starch biosynthetic pathway were observed.