Wild Pansies, Trojan Horses, and Others: International Teaching and Learning as Bricolage

Educational change, predictable or unanticipated, occurs when student populations are altered. When an American college started an international program in Prague, it was anticipated that educational practice would change. To understand the implications for teaching, learning, and practice mentors explored the new educational landscape. The concept of bricolage informed much of that exploration and this paper considers bricolage, summarizes research outcomes, and reflects on the opportunity and ethics of engagement with Other

Codes from Riemann-Roch Spaces for Y2 = Xp - X over GF(P)

Let Χ denote the hyperelliptic curve y2 = xp - x over a field F of characteristic p. The automorphism group of Χ is G = PSL(2, p). Let D be a G-invariant divisor on Χ(F). We compute explicit F-bases for the Riemann-Roch space of D in many cases as well as G-module decompositions. AG codes with good parameters and large automorphism group are constructed as a result. Numerical examples using GAP and SAGE are also given

Counting Arithmetical Structures on Paths and Cycles

Let G be a finite, connected graph. An arithmetical structure on G is a pair of positive integer vectors d, r such that (diag (d) - A) r=0 , where A is the adjacency matrix of G. We investigate the combinatorics of arithmetical structures on path and cycle graphs, as well as the associated critical groups (the torsion part of the cokernels of the matrices (diag (d) - A)). For paths, we prove that arithmetical structures are enumerated by the Catalan numbers, and we obtain refined enumeration results related to ballot sequences. For cycles, we prove that arithmetical structures are enumerated by the binomial coefficients ((2n-1)/(n-1)) , and we obtain refined enumeration results related to multisets. In addition, we determine the critical groups for all arithmetical structures on paths and cycles

Counting Arithmetical Structures on Paths and Cycles

Let G be a finite, connected graph. An arithmetical structure on G is a pair of positive integer vectors d, r such that (diag (d) - A) r=0 , where A is the adjacency matrix of G. We investigate the combinatorics of arithmetical structures on path and cycle graphs, as well as the associated critical groups (the torsion part of the cokernels of the matrices (diag (d) - A)). For paths, we prove that arithmetical structures are enumerated by the Catalan numbers, and we obtain refined enumeration results related to ballot sequences. For cycles, we prove that arithmetical structures are enumerated by the binomial coefficients ((2n-1)/(n-1)) , and we obtain refined enumeration results related to multisets. In addition, we determine the critical groups for all arithmetical structures on paths and cycles

Reflective Coating on Fibrous Insulation for Reduced Heat Transfer

Radiative heat transfer through fibrous insulation used in thermal protection systems (TPS) is significant at high temperatures (1200 C). Decreasing the radiative heat transfer through the fibrous insulation can thus have a major impact on the insulating ability of the TPS. Reflective coatings applied directly to the individual fibers in fibrous insulation should decrease the radiative heat transfer leading to an insulation with decreased effective thermal conductivity. Coatings with high infrared reflectance have been developed using sol-gel techniques. Using this technique, uniform coatings can be applied to fibrous insulation without an appreciable increase in insulation weight or density. Scanning electron microscopy, Fourier Transform infrared spectroscopy, and ellipsometry have been performed to evaluate coating performance

The regulatory and transcriptional landscape associated with carbon utilization in a filamentous fungus.

Filamentous fungi, such as Neurospora crassa, are very efficient in deconstructing plant biomass by the secretion of an arsenal of plant cell wall-degrading enzymes, by remodeling metabolism to accommodate production of secreted enzymes, and by enabling transport and intracellular utilization of plant biomass components. Although a number of enzymes and transcriptional regulators involved in plant biomass utilization have been identified, how filamentous fungi sense and integrate nutritional information encoded in the plant cell wall into a regulatory hierarchy for optimal utilization of complex carbon sources is not understood. Here, we performed transcriptional profiling of N. crassa on 40 different carbon sources, including plant biomass, to provide data on how fungi sense simple to complex carbohydrates. From these data, we identified regulatory factors in N. crassa and characterized one (PDR-2) associated with pectin utilization and one with pectin/hemicellulose utilization (ARA-1). Using in vitro DNA affinity purification sequencing (DAP-seq), we identified direct targets of transcription factors involved in regulating genes encoding plant cell wall-degrading enzymes. In particular, our data clarified the role of the transcription factor VIB-1 in the regulation of genes encoding plant cell wall-degrading enzymes and nutrient scavenging and revealed a major role of the carbon catabolite repressor CRE-1 in regulating the expression of major facilitator transporter genes. These data contribute to a more complete understanding of cross talk between transcription factors and their target genes, which are involved in regulating nutrient sensing and plant biomass utilization on a global level

Solution generating with perfect fluids

We apply a technique, due to Stephani, for generating solutions of the Einstein-perfect fluid equations. This technique is similar to the vacuum solution generating techniques of Ehlers, Harrison, Geroch and others. We start with a ``seed'' solution of the Einstein-perfect fluid equations with a Killing vector. The seed solution must either have (i) a spacelike Killing vector and equation of state P=rho or (ii) a timelike Killing vector and equation of state rho+3P=0. The new solution generated by this technique then has the same Killing vector and the same equation of state. We choose several simple seed solutions with these equations of state and where the Killing vector has no twist. The new solutions are twisting versions of the seed solutions

Restricted feedback control of one-dimensional maps

Dynamical control of biological systems is often restricted by the practical constraint of unidirectional parameter perturbations. We show that such a restriction introduces surprising complexity to the stability of one-dimensional map systems and can actually improve controllability. We present experimental cardiac control results that support these analyses. Finally, we develop new control algorithms that exploit the structure of the restricted-control stability zones to automatically adapt the control feedback parameter and thereby achieve improved robustness to noise and drifting system parameters.Comment: 29 pages, 9 embedded figure

Dynamics and Selection of Giant Spirals in Rayleigh-Benard Convection

For Rayleigh-Benard convection of a fluid with Prandtl number \sigma \approx 1, we report experimental and theoretical results on a pattern selection mechanism for cell-filling, giant, rotating spirals. We show that the pattern selection in a certain limit can be explained quantitatively by a phase-diffusion mechanism. This mechanism for pattern selection is very different from that for spirals in excitable media

Using Satellite Images of Environmental Changes to Predict Infectious Disease Outbreaks

A strong global satellite imaging system is essential for predicting outbreaks