Midplane-symmetry breaking in the flow between two counter-rotating disks

This paper considers the axisymmetric steady flow driven by exact counter rotation of two co-axial disks of finite radius. At the edges of the rotating disks one of three conditions is (typically) imposed: (i) zero velocity, corresponding to a stationary, impermeable, cylindrical shroud (ii) zero normal velocity and zero tangential fluid traction, corresponding to a (confined) free surface and (iii) an edge constraint that is consistent with a similarity solution of von Kármán form. The similarity solution is valid in an infinite geometry and possesses a pitchfork bifurcation that breaks the midplane symmetry at a critical Reynolds number. In this paper, similar bifurcations of the global (finite-domain) flow are sought and comparisons are made between the resulting bifurcation structure and that found for the similarity solution. The aim is to assess the validity of the nonlinear similarity solutions in finite domains and to explore the sensitivity of the solution structure to edge conditions that are implicitly neglected when assuming a self-similar flow. It is found that, whilst the symmetric similarity solution can be quantitatively useful for a range of boundary conditions, the bifurcated structure of the finite-domain flow is rather different for each boundary condition and bears little resemblance to the self-similar flow.     

Revisiting the need for formal education in visualization.

Defining visualization education is still a work in progress. Visualization education is not just a subject within computer science. Computer scientists are not always the appropriate choice to teach visualization courses on their own. Visualization is not just mastering a set of concepts but acquiring skills. Student should learn by doing, either using one tool or a variety of tools, depending on the course's focus.     

The effect of solidification time and heat treatment on the fatigue properties of a cast 319 aluminum alloy

Solidification time and heat treatment are known to have a large effect on the microstructure of cast aluminum alloys. This study was conducted to quantify how the fatigue properties of a 319-type aluminum alloy are affected by solidification time and heat treatment. Both porosity-containing (non-hot isostatically pressed (HIP)) and porosity-free (HIP) samples in the T6 (“peak aged”) or T7 (“overaged”) heattreated conditions were tested. As the solidification time increased, the average initiating pore diameter increased and stress-controlled fatigue life decreased. Heat treatment was observed to have a large effect on fatigue properties of the HIP samples. However, in the non-HIP fatigue samples, heat treatment did not significantly change the fatigue life or fatigue strength of the cast 319-type alloy. The absence of an influence of heat treatment on fatigue response is attributed to the predominance of the microporosity in fatigue crack initiation in cast aluminum.     

Deflection Calculation of FRP Reinforced Concrete Beams Based on Modifications to the Existing Branson Equation

Fundamental concepts of tension stiffening are used to explain why Branson’s equation for the effective moment of inertia Ie does not predict deflection well for fiber reinforced polymer (FRP) reinforced concrete beams. The tension stiffening component in Branson’s equation is shown to depend on the ratio of gross-to-cracked moment of inertia (Ig/Icr), and gives too much tension stiffening for beams with an Ig/Icr ratio greater than 3. FRP beams typically have an Ig/Icr ratio greater than 5, leading to a much stiffer response and underprediction of computed deflections as observed by others in the past. One common approach to computing deflection of FRP reinforced concrete beams has been to use a modified form of the Branson equation. This paper presents a rational development of appropriate modification factors needed to reduce the tension stiffening component in Branson’s original expression to realistic levels. Computed deflections using this approach give reasonable results with the right modification factor, and compare well with a more general unified approach that incorporates a realistic tension stiffening model. Comparison is made with the existing and past correction factors recommended by ACI 440 for predicting deflection of FRP beams. The method presently used by ACI 440 gives reasonable estimates of deflection for glass and carbon FRP reinforced beams. However, this method underestimates deflection of aramid FRP reinforced beams and is restricted to rectangular sections. A proposal is made for adoption of a simple modification factor that works well for all types of FRP bar and beam cross-sectional shape.     

Analytical results for the plectonemic response of supercoiled DNA

The DNA molecule is modeled as an elastic rod with bending and twisting rigidities, subjected to external tension and twist applied at one end, the other end being clamped. We study the plectonemic equilibrium of such a rod, taking into account the impenetrability constraint. Numerical solutions of this boundary value problem have previously shown that purely elastic models can reproduce the supercoiling response of the DNA molecule. Using a variational approach, we derive analytical formulae for the elastic response of the filament, and extend former numerical results.     

The role of experience in liking "read-to-drink" alcoholic beverages.

Ready-to-drinks (RTDs) are composed of an alcoholic component and a soft-drink base and are primarily consumed by a youth market. The authors explored whether liking and experience with an RTD soft-drink base predicts liking for the RTD. Participants (N=350) from ages 12 to 30 years sampled 3 RTDs and their respective soft-drink and alcoholic components. For milk- and fruit-based RTDs, liking for and familiarity with their soft-drink base was the best predictor of liking for and familiarity with the RTD itself. For the Coke-based RTD, familiarity with and liking for bourbon best predicted familiarity with and liking for the RTD. All of these effects were consistent across blind and nonblind testing. The authors' results suggest that where there is perceptual similarity between the RTD and its soft-drink base, these beverages may provide an easy transition into alcohol consumption for novice drinkers. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Algorithms in the W-Hierarchy

We show new upper bounds for problems in the W-hierarchy of fixed-parameter complexity. A crucial ingredient of our proofs is an extension to the W-RAM model, which permits more-powerful operations but remains equivalent to the original. We use the extended model to give new upper bounds for Subsetsum, Maximum Irredundant Set, and various problems concerning intersection of finite-state machines.     

Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers

A finite recurrent system over sets of natural numbers of dimension n is a pair composed of n n-ary functions over sets of natural numbers and an n-tuple of singleton sets of natural numbers. Every function is applied to the entries of the tuple and computes a set of natural numbers, that may also be empty. The results are composed into another tuple, and the process is started anew. Thus, a finite recurrent system defines an infinite sequence of n-tuples containing sets of natural numbers. The last entry of a generated n-tuple is called the output of a step, and the union of the output sets of all steps is the set defined by the finite recurrent system. Membership problems ask whether a given number is in a specified output set or in some output set. We study membership problems for special finite recurrent systems, whose functions are built from the set operations union, intersection and complementation and the arithmetical operations addition and multiplication. Sum and product of two sets of natural numbers are defined elementwise. We restrict the set of operations from which functions are built and determine the impact on the complexity of the membership problems. We focus on PSPACE-decidable membership problems and show completeness results for the complexity classes NL, NP and PSPACE.