Numerical solutions for unsteady gravity-driven flows in collapsible tubes: evolution and roll-wave instability of a steady state

Unsteady flow in collapsible tubes has been widely studied for a number of different physiological applications; the principal motivation for the work of this paper is the study of blood flow in the jugular vein of an upright, long-necked subject (a giraffe). The one-dimensional equations governing gravity- or pressure-driven flow in collapsible tubes have been solved in the past using finite-difference (MacCormack) methods. Such schemes, however, produce numerical artifacts near discontinuities such as elastic jumps. This paper describes a numerical scheme developed to solve the one-dimensional equations using a more accurate upwind finite volume (Godunov) scheme that has been used successfully in gas dynamics and shallow water wave problems. The adapatation of the Godunov method to the present application is non-trivial due to the highly nonlinear nature of the pressure–area relation for collapsible tubes. The code is tested by comparing both unsteady and converged solutions with analytical solutions where available. Further tests include comparison with solutions obtained from MacCormack methods which illustrate the accuracy of the present method. Finally the possibility of roll waves occurring in collapsible tubes is also considered, both as a test case for the scheme and as an interesting phenomenon in its own right, arising out of the similarity of the collapsible tube equations to those governing shallow water flow

Cycles, Disjoint Spanning Trees and Orientations of Graphs

A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton path (a path including every vertex of G); and G is s-hamiltonian-connected if the deletion of any vertex subset with at most s vertices results in a hamiltonian-connected graph. We prove that the line graph of a (t + 4)-edge-connected graph is (t + 2)-hamiltonian-connected if and only if it is (t + 5)-connected, and for s ≥ 2 every (s + 5)-connected line graph is s-hamiltonian-connected.;For integers l and k with l \u3e 0, and k ≥ 0, Ch( l, k) denotes the collection of h-edge-connected simple graphs G on n vertices such that for every edge-cut X with 2 ≤ |X| ≤ 3, each component of G -- X has at least (n -- k)/l vertices. We prove that for any integer k \u3e 0, there exists an integer N = N( k) such that for any n ≥ N, any graph G ∈ C2(6, k) on n vertices is supereulerian if and only if G cannot be contracted to a member in a well characterized family of graphs.;An orientation of an undirected graph G is a mod (2 p + 1)-orientation if under this orientation, the net out-degree at every vertex is congruence to zero mod 2p + 1. A graph H is mod (2p + 1)-contractible if for any graph G that contains H as a subgraph, the contraction G/H has a mod (2p + 1)-orientation if and only if G has a mod (2p + 1)-orientation (thus every mod (2p + 1)-contractible graph has a mod (2p + 1)-orientation). Jaeger in 1984 conjectured that every (4p)-edge-connected graph has a mod (2p + 1)-orientation. It has also been conjectured that every (4p + 1)-edge-connected graph is mod (2 p + 1)-contractible. We investigate graphs that are mod (2 p + 1)-contractible, and as applications, we prove that a complete graph Km is (2p + 1)-contractible if and only if m ≥ 4p + 1; that every (4p -- 1)-edge-connected K4-minor free graph is mod (2p + 1)-contractible, which is best possible in the sense that there are infinitely many (4p -- 2)-edge-connected K4-minor free graphs that are not mod (2p + 1)-contractible; and that every (4p)-connected chordal graph is mod (2p + 1)-contractible. We also prove that the above conjectures on line graphs would imply the truth of the conjectures in general, and that if G has a mod (2p + 1)-orientation and delta(G) ≥ 4p, then L(G) also has a mod (2p + 1)-orientation.;The design of an n processor network with given number of connections from each processor and with a desirable strength of the network can be modelled as a degree sequence realization problem with certain desirable graphical properties. A nonincreasing sequence d = ( d1, d2, ···, dn) is graphic if there is a simple graph G with degree sequence d. It is proved that for a positive integer k, a graphic nonincreasing sequence d has a simple realization G which has k-edge-disjoint spanning trees if and only if either both n = 1 and d1 = 0, or n ≥ 2 and both dn ≥ k and i=1n di ≥ 2k(n -- 1).;We investigate the emergence of specialized groups in a swarm of robots, using a simplified version of the stick-pulling problem [56], where the basic task requires the collaboration of two robots in asymmetric roles. We expand our analytical model [57] and identify conditions for optimal performance for a swarm with any number of species. We then implement a distributed adaptation algorithm based on autonomous performance evaluation and parameter adjustment of individual agents. While this algorithm reliably reaches optimal performance, it leads to unbounded parameter distributions. Results are improved by the introduction of a direct parameter exchange mechanism between selected high- and low-performing agents. The emerging parameter distributions are bounded and fluctuate between tight unimodal and bimodal profiles. Both the unbounded optimal and the bounded bimodal distributions represent partitions of the swarm into two specialized groups

Crew appliance study

Viable crew appliance concepts were identified by means of a thorough literature search. Studies were made of the food management, personal hygiene, housekeeping, and off-duty habitability functions to determine which concepts best satisfy the Space Shuttle Orbiter and Modular Space Station mission requirements. Models of selected appliance concepts not currently included in the generalized environmental-thermal control and life support systems computer program were developed and validated. Development plans of selected concepts were generated for future reference. A shuttle freezer conceptual design was developed and a test support activity was provided for regenerative environmental control life support subsystems

Genome Assembly Techniques

Since the publication of the human genome in 2001, the price and the time of DNA sequencing have dropped dramatically. The genome of many more species have since been sequenced, and genome sequencing is an ever more important tool for biologists. This trend will likely revolutionize biology and medicine in the near future where the genome sequence of each individual person, instead of a model genome for the human, becomes readily accessible. Nevertheless, genome assembly remains a challenging computational problem, even more so with second generation sequencing technologies which generate a greater amount of data and make the assembly process more complex. Research to quickly, cheaply and accurately assemble the increasing amount of DNA sequenced is of great practical importance. In the first part of this thesis, we present two software developed to improve genome assemblies. First, Jellyfish is a fast k-mer counter, capable of handling large data sets. k-mer frequencies are central to many tasks in genome assembly (e.g. for error correction, finding read overlaps) and other study of the genome (e.g. finding highly repeated sequences such as transposons). Second, Chromosome Builder is a scaffolder and contig placement software. It aims at improving the accuracy of genome assembly. In the second part of this thesis we explore several problems dealing with graphs. The theory of graphs can be used to solve many computational problems. For example, the genome assembly problem can be represented as finding an Eulerian path in a de Bruijn graph. The physical interactions between proteins (PPI network), or between transcription factors and genes (regulatory networks), are naturally expressed as graphs. First, we introduce the concept of "exactly 3-edge-connected" graphs. These graphs have only a remote biological motivation but are interesting in their own right. Second, we study the reconstruction of ancestral network which aims at inferring the state of ancestral species' biological networks based on the networks of current species

Case study of assembly defects in manufactured products

Design for Quality Manufacturability (DFQM) is a design tool that empowers engineers to create designs that are easily and effectively transformed into manufactured products. The goal of this methodology is to make designers aware of design characteristics that may lead to product defects during the assembly process. Acknowledging the possibility of these defects will enable the designer to institute design modifications early in the design phase. The benefits realized in this approach are a reduction in the number of defects in the finished product, reduced product cycle times, a reduction in monitoring costs and a reduction in time-to-market. This thesis supports the application of the DFQM methodology as a means of maintaining a competitive advantage within industry. The value of utilizing this approach is proven by the submitted case studies of quality defects. An automobile emergency brake, portable overhead projector, car door handle, hand soap dispenser, floppy disk drive and hand held hair dryer were analyzed using the DFQM classes of Manufacturing Quality Defects. Through this analysis, Influencing Factors and Factor Variables of the each design were isolated and suggestions for modifications were presented to eliminate these quality defects