A Tale of Two Campuses: Open Educational Resources in Florida and California Academic Institutions

Open educational resources (OER) provide a high-quality and low-cost alternative to traditional textbooks. The University of Central Florida (UCF) and the University of San Diego (USD) have been engaged in a multitude of efforts related to OER and textbook affordability. This article will discuss the textbook affordability climate at the state (Florida and California) and institutional (UCF and USD) level. Macro and microventures and lessons learned will be shared by both institutions ranging from perceptions of open education resources by the universities to collaborating with constituents across campus, in addition to specific case studies with UCF faculty teaching online and face-to-face courses as well as USD’s stipend program. Lastly, the article will discuss future developments and continuous improvements by educating UCF and USD campus communities through several initiatives and new partnerships with stakeholders

Steering effect on the shape of islands for homoepitaxial growth of Cu on Cu(100)

The steering effect on the growth of islands is investigated by combining molecular dynamics (MD) and kinetic Monte Carlo (KMC) simulations. Dynamics of depositing atoms and kinetics of atoms on a substrate are realized by MD and KMC, respectively. The reported experimental results on the asymmetric island growth [van Dijken {\it et al.}, Phys. Rev. Lett. {\bf 82}, 4038 (1999).] is well reproduced. A salient phenomenon, the reversal of the asymmetry, is found as the island size increases, and attributed to the asymmetric flux on the lower terrace of island.Comment: 5 figur

A 2k2k-Vertex Kernel for Maximum Internal Spanning Tree

We consider the parameterized version of the maximum internal spanning tree problem, which, given an $n$-vertex graph and a parameter $k$, asks for a spanning tree with at least $k$ internal vertices. Fomin et al. [J. Comput. System Sci., 79:1-6] crafted a very ingenious reduction rule, and showed that a simple application of this rule is sufficient to yield a $3k$-vertex kernel. Here we propose a novel way to use the same reduction rule, resulting in an improved $2k$-vertex kernel. Our algorithm applies first a greedy procedure consisting of a sequence of local exchange operations, which ends with a local-optimal spanning tree, and then uses this special tree to find a reducible structure. As a corollary of our kernel, we obtain a deterministic algorithm for the problem running in time $4^k \cdot n^{O(1)}$

Stormiest winter on record for Ireland and UK

Meteorological agencies of Ireland and the UK have confirmed that winter (December to February) 2013-14 (W2013/14) set records for precipitation totals and the occurrence of extreme wind speeds1,2,3. Less clear is whether storminess (characterised as the frequency and intensity of cyclones) during W2013/14 was equally unprecedented. We assess multidecadal variations in storminess by considering frequency and intensity together and find that W2013/14 was indeed exceptional. Given the potential societal impacts there is clearly a need to better understand the processes driving extreme cyclonic activity in the North Atlantic (NA)

Spotting Trees with Few Leaves

We show two results related to the Hamiltonicity and $k$-Path algorithms in undirected graphs by Bj\"orklund [FOCS'10], and Bj\"orklund et al., [arXiv'10]. First, we demonstrate that the technique used can be generalized to finding some $k$-vertex tree with $l$ leaves in an $n$-vertex undirected graph in $O^*(1.657^k2^{l/2})$ time. It can be applied as a subroutine to solve the $k$-Internal Spanning Tree ($k$-IST) problem in $O^*(\min(3.455^k, 1.946^n))$ time using polynomial space, improving upon previous algorithms for this problem. In particular, for the first time we break the natural barrier of $O^*(2^n)$. Second, we show that the iterated random bipartition employed by the algorithm can be improved whenever the host graph admits a vertex coloring with few colors; it can be an ordinary proper vertex coloring, a fractional vertex coloring, or a vector coloring. In effect, we show improved bounds for $k$-Path and Hamiltonicity in any graph of maximum degree $\Delta=4,\ldots,12$ or with vector chromatic number at most 8

Transphyletic conservation of developmental regulatory state in animal evolution

Specific regulatory states, i.e., sets of expressed transcription factors, define the gene expression capabilities of cells in animal development. Here we explore the functional significance of an unprecedented example of regulatory state conservation from the cnidarian Nematostella to Drosophila, sea urchin, fish, and mammals. Our probe is a deeply conserved cis-regulatory DNA module of the SRY-box B2 (soxB2), recognizable at the sequence level across many phyla. Transphyletic cis-regulatory DNA transfer experiments reveal that the plesiomorphic control function of this module may have been to respond to a regulatory state associated with neuronal differentiation. By introducing expression constructs driven by this module from any phyletic source into the genomes of diverse developing animals, we discover that the regulatory state to which it responds is used at different levels of the neurogenic developmental process, including patterning and development of the vertebrate forebrain and neurogenesis in the Drosophila optic lobe and brain. The regulatory state recognized by the conserved DNA sequence may have been redeployed to different levels of the developmental regulatory program during evolution of complex central nervous systems

Beam Test of Silicon Strip Sensors for the ZEUS Micro Vertex Detector

For the HERA upgrade, the ZEUS experiment has designed and installed a high precision Micro Vertex Detector (MVD) using single sided micro-strip sensors with capacitive charge division. The sensors have a readout pitch of 120 microns, with five intermediate strips (20 micron strip pitch). An extensive test program has been carried out at the DESY-II testbeam facility. In this paper we describe the setup developed to test the ZEUS MVD sensors and the results obtained on both irradiated and non-irradiated single sided micro-strip detectors with rectangular and trapezoidal geometries. The performances of the sensors coupled to the readout electronics (HELIX chip, version 2.2) have been studied in detail, achieving a good description by a Monte Carlo simulation. Measurements of the position resolution as a function of the angle of incidence are presented, focusing in particular on the comparison between standard and newly developed reconstruction algorithms.Comment: 41 pages, 21 figures, 2 tables, accepted for publication in NIM

Mixtures in non stable Levy processes

We analyze the Levy processes produced by means of two interconnected classes of non stable, infinitely divisible distribution: the Variance Gamma and the Student laws. While the Variance Gamma family is closed under convolution, the Student one is not: this makes its time evolution more complicated. We prove that -- at least for one particular type of Student processes suggested by recent empirical results, and for integral times -- the distribution of the process is a mixture of other types of Student distributions, randomized by means of a new probability distribution. The mixture is such that along the time the asymptotic behavior of the probability density functions always coincide with that of the generating Student law. We put forward the conjecture that this can be a general feature of the Student processes. We finally analyze the Ornstein--Uhlenbeck process driven by our Levy noises and show a few simulation of it.Comment: 28 pages, 3 figures, to be published in J. Phys. A: Math. Ge

Mixing Color Coding-Related Techniques

Narrow sieves, representative sets and divide-and-color are three breakthrough color coding-related techniques, which led to the design of extremely fast parameterized algorithms. We present a novel family of strategies for applying mixtures of them. This includes: (a) a mix of representative sets and narrow sieves; (b) a faster computation of representative sets under certain separateness conditions, mixed with divide-and-color and a new technique, "balanced cutting"; (c) two mixtures of representative sets, iterative compression and a new technique, "unbalanced cutting". We demonstrate our strategies by obtaining, among other results, significantly faster algorithms for $k$-Internal Out-Branching and Weighted 3-Set $k$-Packing, and a framework for speeding-up the previous best deterministic algorithms for $k$-Path, $k$-Tree, $r$-Dimensional $k$-Matching, Graph Motif and Partial Cover

Measurement of the J/Psi Production Cross Section in 920 GeV/c Fixed-Target Proton-Nucleus Interactions

The mid-rapidity (dsigma_(pN)/dy at y=0) and total sigma_(pN) production cross sections of J/Psi mesons are measured in proton-nucleus interactions. Data collected by the HERA-B experiment in interactions of 920 GeV/c protons with carbon, titanium and tungsten targets are used for this analysis. The J/Psi mesons are reconstructed by their decay into lepton pairs. The total production cross section obtained is sigma_(pN)(J/Psi) = 663 +- 74 +- 46 nb/nucleon. In addition, our result is compared with previous measurements