Institutional Repository

Array

Pages

Collaborative Collection Development: Increasing Equity in Times of Austerity
Presentation at ALA Annual, 2018. Libraries have long participated in cooperative collection development as a strategic way of spending funds and sharing resources. Using established best practices for collaborative collection development as a foundation, this session will describe updated strategies for initiating and assessing simple but effective cooperative collection development projects that increase the number of unique titles that can be shared among libraries with minimal commitment. The strategies are applicable to any library setting. Co-sponsored by RUSA CODES and the Social Responsibilities Round Table (SRRT)
Supplemental Figures and Data _ Small-Scale Process Engineering for Inverse Phase Miniemulsion Polymerization of Hydrogel Nanoparticles for Therapeutic Applications
Supplemental Figures and Data _ Small-Scale Process Engineering for Inverse Phase Miniemulsion Polymerization of Hydrogel Nanoparticles for Therapeutic Applications
This data set supports the process development work described in the associated manuscript, capturing the transition from bench-scale synthesis to small-scale process development of hydrogel nanoparticles. It includes the raw and processed quantitative data for experimental variables tested during this scale-down effort. Additionally, the data set provides the original red-green channel versions of fluorescence microscopy images used in cell studies. In the manuscript, these images were adjusted to be accessible for readers with red-green color vision deficiency; here, the unmodified channel versions are made available to ensure scientific transparency and reproducibility.
Hutong Skyscraper high-rise studio
This is Hutong Skyscraper high-rise studio
The Landings in North Africa November 1942
Donated to the Paul V. Galvin Library by IIT Naval ROTC
Undecanoic Acid, Lauric Acid, and N-Tridecanoic Acid Inhibit Escherichia coli Persistence and Biofilm Formation
Persister cell formation and biofilms of pathogens are extensively involved in the development of chronic infectious diseases. Eradicating persister cells is challenging, owing to their tolerance to conventional antibiotics, which cannot kill cells in a metabolically dormant state. A high frequency of persisters in biofilms makes inactivating biofilm cells more difficult, because the biofilm matrix inhibits antibiotic penetration. Fatty acids may be promising candidates as antipersister or antibiofilm agents, because some fatty acids exhibit antimicrobial effects. We previously reported that fatty acid ethyl esters effectively inhibit Escherichia coli persister formation by regulating an antitoxin. In this study, we screened a fatty acid library consisting of 65 different fatty acid molecules for altered persister formation. We found that undecanoic acid, lauric acid, and N-tridecanoic acid inhibited E. coli BW25113 persister cell formation by 25-, 58-, and 44-fold, respectively. Similarly, these fatty acids repressed persisters of enterohemorrhagic E. coli EDL933. These fatty acids were all medium-chain saturated forms. Furthermore, the fatty acids repressed Enterohemorrhagic E. coli (EHEC) biofilm formation (for example, by 8-fold for lauric acid) without having antimicrobial activity. This study demonstrates that medium-chain saturated fatty acids can serve as antipersister and antibiofilm agents that may be applied to treat bacterial infections., Sponsorship: NIH-R15AI130988; NSF REU-1757989
Geometry of Higher-Order Markov Chains
We determine an explicit Gr ?obner basis, consisting of linear forms and determinantal quadrics, for the prime ideal of Raftery’s mixture transition distribution model for Markov chains. When the states are binary, the corresponding projective variety is a linear space, the model itself consists of two simplices in a cross-polytope, and the likelihood function typically has two local maxima. In the general non-binary case, the model corresponds to a cone over a Segre variety.
Phylogenetic invariants for group-based models
In this paper we investigate properties of algebraic varieties representing group-based phylogenetic models. We propose a method of generating many phylogenetic invariants. We prove that we obtain all invariants for any tree for the two-state Jukes-Cantor model. We conjecture that for a large class of models our method can give all phylogenetic invariants for any tree. We show that for 3-Kimura our conjecture is equivalent to the conjecture of Sturmfels and Sullivant [22, Conjecture 2]. This, combined with the results in [22], would make it possible to determine all phylogenetic invariants for any tree for 3-Kimura model, and also other phylogenetic models. Next we give the (first) examples of non-normal varieties associated to general group-based model for an abelian group. Following Kubjas [17] we prove that for many group-based models varieties associated to trees with the same number of leaves do not have to be deformation equivalent.
Properties of semi-elementary imsets as sums of elementary imsets
We study properties of semi-elementary imsets and elementary imsets introduced by Studeny [10]. The rules of the semi-graphoid axiom (decomposition, weak union and contraction) for conditional independence statements can be translated into a simple identity among three semi-elementary imsets. By recursively applying the identity, any semi-elementary imset can be written as a sum of elementary imsets, which we call a representation of the semi-elementary imset. A semi-elementary imset has many representations. We study properties of the set of possible representations of a semi-elementary imset and prove that all representations are connected by relations among four elementary imsets.
Connectivity for 3 x 3 x K contingency tables
We consider an exact sequential conditional test for three-way conditional test of no interaction. At each time τ, the test uses as the conditional inference frame the set F(Hτ) of all tables with the same three two-way marginal tables as the obtained table Hτ . For 3 × 3 × K tables, we propose a method to construct F(Hτ) from F(Hτ−1). This enables us to perform efficiently the sequential exact conditional test. The subset Sτ of F (Hτ ) consisting of s + Hτ − Hτ −1 for s ∈ F(Hτ−1) contains Hτ , where the operations + and − are defined elementwise. Our argument is based on the minimal Markov basis for 3 × 3 × K contingency tables and we give a minimal subset M of some Markov basis which has the property that F (Hτ ) = {s − m | s ∈ Sτ , m ∈ M}.
FAST AUTOMATIC BAYESIAN CUBATURE USING MATCHING KERNELS AND DESIGNS
Automatic cubatures approximate multidimensional integrals to user-specified error tolerances. In many real-world integration problems, the analytical solution is either unavailable or difficult to compute. To overcome this, one can use numerical algorithms that approximately estimate the value of the integral. For high dimensional integrals, quasi-Monte Carlo (QMC) methods are very popular. QMC methods are equal-weight quadrature rules where the quadrature points are chosen deterministically, unlike Monte Carlo (MC) methods where the points are chosen randomly. The families of integration lattice nodes and digital nets are the most popular quadrature points used. These methods consider the integrand to be a deterministic function. An alternate approach, called Bayesian cubature, postulates the integrand to be an instance of a Gaussian stochastic process.
Environmental Monitoring of University Archives and Special Collections
This is the final report and analysis of activities conducted as part of Environmental Monitoring of University Archives and Special Collections, a project funded by a Preservation Assistance Grant from the National Endowment of the Humanities (PG-263471-19). This grant was awarded to support the first evercsystematic environmental monitoring of the UASC spaces. This report includes a summary of the collected data, analysis of the data, and potential future activities to be undertaken as a result of the grant activities and the data collected., Sponsorship: National Endowment For The Humanities, Preservation Assistance Grants for Smaller Institutions
The Waste of Parts Capstone Examples
The Waste of Parts is a prototype board game finished for my Digital Humanities Capstone Elective
Detecting epistasis via Markov bases
Rapid research progress in genotyping techniques have allowed large genome-wide association studies. Existing methods often focus on determining associations between single loci and a specific phenotype. However, a particular phenotype is usually the result of complex relationships between multiple loci and the environment. In this paper, we describe a two-stage method for detecting epistasis by combining the traditionally used single-locus search with a search for multiway interactions. Our method is based on an extended version of Fisher’s exact test. To perform this test, a Markov chain is constructed on the space of multidimensional contingency tables using the elements of a Markov basis as moves. We test our method on simulated data and compare it to a two-stage logistic regression method and to a fully Bayesian method, showing that we are able to detect the interacting loci when other methods fail to do so. Finally, we apply our method to a genome-wide data set consisting of 685 dogs and identify epistasis associated with canine hair length for four pairs of single nucleotide polymorphisms (SNPs).
Open Problems on Connectivity of Fibers with Positive Margins in Multi-dimensional Contingency Tables
Diaconis-Sturmfels developed an algorithm for sampling from conditional distributions for a statistical model of discrete exponential families, based on the algebraic theory of toric ideals. This algorithm is applied to categorical data analysis through the notion of Markov bases. Initiated with its application to Markov chain Monte Carlo approach for testing statistical fitting of the given model, many researchers have extensively studied the structure of Markov bases for models in computational algebraic statistics. In the Markov chain Monte Carlo approach for testing statistical fitting of the given model, a Markov basis is a set of moves connecting all contingency tables satisfying the given margins. Despite the computational advances, there are applied problems where one may never be able to compute a Markov basis. In general, the number of elements in a minimal Markov basis for a model can be exponentially many. Thus, it is important to compute a reduced number of moves which connect all tables instead of computing a Markov basis. In some cases, such as logistic regression, positive margins are shown to allow a set of Markov connecting moves that are much simpler than the full Markov basis. Such a set is called a Markov subbasis with assumption of positive margins. In this paper we summarize some computations of and open problems on Markov subbases for contingency tables with assumption of positive margins under specific models as well as develop algebraic methods for studying connectivity of Markov moves with margin positivity to develop Markov sampling methods for exact conditional inference in statistical models where the Markov basis is hard to compute.
Generalized Fréchet Bounds for Cell Entries in Multidimensional Contingency Tables
We consider the lattice, L, of all subsets of a multidimensional contingency table and establish the properties of monotonicity and supermodularity for the marginalization function, n(·), on L. We derive from the supermodularity of n(·) some generalized Fr ́echet inequalities comple- menting and extending inequalities of Dobra and Fienberg. Further, we construct new monotonic and supermodular functions from n(·), and we remark on the connection between supermodularity and some correlation inequalities for probability distributions on lattices. We also apply an inequal- ity of Ky Fan to derive a new approach to Fr ́echet inequalities for multidimensional contingency tables.
Maximal Length Projections in Group Algebras with Applications to Linear Rank Tests of Uniformity
Let G be a finite group, let CG be the complex group algebra of G, and let p ∈ CG. In this paper, we show how to construct submodules S of CG of a fixed dimension with the property that the orthogonal projection of p onto S has maximal length. We then provide an example of how such submodules for the symmetric group Sn can be used to create new linear rank tests of uniformity in statistics for survey data that arises when respondents are asked to give a complete ranking of n items.
Views on Ethical Issues in Research Labs: a University-Wide Survey
Full survey used for "Views on Ethical Issues in Research Labs" published in the journal Accountability in Research: Policies and Quality Assurance in 2021. This survey was completed in 2017., Sponsorship: National Science Foundation

Pages