Zanzabari Textile Designs Bridge Cultural Contexts in Graphics

VCU senior Leah Schmidt studied textiles for two months in Zanzibar, Tanzania this past summer, focusing on native textile designs and traditional methods. A Graphic Design major, Schmidt was a recipient of both the VCU Arts Dean’s International Study Grant and an Undergraduate Research Opportunity Program Fellowship Grant (also known as a UROP Grant). Schmidt worked alongside her faculty advisor and many local Zanzabari designers and artisans to identify the methods used in screen printing, weaving, and batik dying. She related the designs and patterns of the Zanzabari natives to those she uses in graphic design

Hannah Huddle: Visually Comparing Art and Science

Hannah Huddle, a junior at VCU majoring in communications arts with a concentration in scientific illustration, has been working on a research project with VCU biology professor Dr. Lesley Bulluck, and a group of six students, researching the Prothonotary Warbler. Unlike most researchers, Huddle is both studying the biology of the bird and making illustrations of the bird and the research involving the Warbler

Pattern recognition receptors in antifungal immunity

We thank the Wellcome Trust for funding this study.Peer reviewedPublisher PD

Measuring Value in Mediation: A Case Study of Workplace Mediation in City Government

Published in cooperation with the American Bar Association Section of Dispute Resolutio

Space tug propulsion system failure mode, effects and criticality analysis

For purposes of the study, the propulsion system was considered as consisting of the following: (1) main engine system, (2) auxiliary propulsion system, (3) pneumatic system, (4) hydrogen feed, fill, drain and vent system, (5) oxygen feed, fill, drain and vent system, and (6) helium reentry purge system. Each component was critically examined to identify possible failure modes and the subsequent effect on mission success. Each space tug mission consists of three phases: launch to separation from shuttle, separation to redocking, and redocking to landing. The analysis considered the results of failure of a component during each phase of the mission. After the failure modes of each component were tabulated, those components whose failure would result in possible or certain loss of mission or inability to return the Tug to ground were identified as critical components and a criticality number determined for each. The criticality number of a component denotes the number of mission failures in one million missions due to the loss of that component. A total of 68 components were identified as critical with criticality numbers ranging from 1 to 2990

Revealing mammalian evolutionary relationships by comparative analysis of gene clusters

Many software tools for comparative analysis of genomic sequence data have been released in recent decades. Despite this, it remains challenging to determine evolutionary relationships in gene clusters due to their complex histories involving duplications, deletions, inversions, and conversions. One concept describing these relationships is orthology. Orthologs derive from a common ancestor by speciation, in contrast to paralogs, which derive from duplication. Discriminating orthologs from paralogs is a necessary step in most multispecies sequence analyses, but doing so accurately is impeded by the occurrence of gene conversion events. We propose a refined method of orthology assignment based on two paradigms for interpreting its definition: by genomic context or by sequence content. X-orthology (based on context) traces orthology resulting from speciation and duplication only, while N-orthology (based on content) includes the influence of conversion events

Searching a bitstream in linear time for the longest substring of any given density

Given an arbitrary bitstream, we consider the problem of finding the longest substring whose ratio of ones to zeroes equals a given value. The central result of this paper is an algorithm that solves this problem in linear time. The method involves (i) reformulating the problem as a constrained walk through a sparse matrix, and then (ii) developing a data structure for this sparse matrix that allows us to perform each step of the walk in amortised constant time. We also give a linear time algorithm to find the longest substring whose ratio of ones to zeroes is bounded below by a given value. Both problems have practical relevance to cryptography and bioinformatics.Comment: 22 pages, 19 figures; v2: minor edits and enhancement