Computer Sciences Commons^™

A Note On Solid Coloring Of Pure Simplicial Complexes, Joseph O'Rourke

Computer Science: Faculty Publications

We establish a simple generalization of a known result in the plane. The simplices in any pure simplicial complex in R^d may be colored with d+1 colors so that no two simplices that share a (d-1)-facet have the same color. In R² this says that any planar map all of whose faces are triangles may be 3-colored, and in R³ it says that tetrahedra in a collection may be "solid 4-colored" so that no two glued face-to-face receive the same color.

Global Dimension Of Ci: Compete Or Collaborate, Arden L. Bement Jr.

PPRI Digital Library

No abstract provided.

Morphogrammatics Of Reflection, Rudolf Kaehr

Rudolf Kaehr

Turning back from the studies of morphogrammatics to some open questions of reflectional programming, the recountered problematics might be put into a different light and new methods of handling formal aspects of reflection and reflectionality shall be introduced. Albeit the use of light-metaphors, morphogrammatic reflection is not sketched along the paradigm of optical metaphors. Morphograms are presenting neither propositions nor perceptions able for mirroring (representation). Exercises in defining morphogrammatic retro-grade recursion and reflection schemata are continued from the paper “Sketches to Morphogrammatic Programming”.

On Semigroups With Lower Semimodular Lattice Of Subsemigroups, Peter R. Jones

Mathematics, Statistics and Computer Science Faculty Research and Publications

The question of which semigroups have lower semimodular lattice of subsemigroups has been open since the early 1960s, when the corresponding question was answered for modularity and for upper semimodularity. We provide a characterization of such semigroups in the language of principal factors. Since it is easily seen (and has long been known) that semigroups for which Green's relation J is trivial have this property, a description in such terms is natural. In the case of periodic semigroups—a case that turns out to include all eventually regular semigroups—the characterization becomes quite explicit and yields interesting consequences. In the general case, …

Powerpack: Energy Profiling And Analysis Of High-Performance Systems And Applications, Rong Ge, Xizhou Feng, Shuaiwen Song, Hung-Ching Chang, Dong Li, Kirk W. Cameron

Mathematics, Statistics and Computer Science Faculty Research and Publications

Energy efficiency is a major concern in modern high-performance computing system design. In the past few years, there has been mounting evidence that power usage limits system scale and computing density, and thus, ultimately system performance. However, despite the impact of power and energy on the computer systems community, few studies provide insight to where and how power is consumed on high-performance systems and applications. In previous work, we designed a framework called PowerPack that was the first tool to isolate the power consumption of devices including disks, memory, NICs, and processors in a high-performance cluster and correlate these measurements …

An Attempt To Get And Keep Women Involved In Physics, Jim Crumley, Kristen Nairn, Lynn Ziegler

MapCores Faculty Publications

In this talk I will briefly review some of the obstacles to the full participation of women in the STEM disciplines. In order to increase the number of women in physics, computer science, and mathematics we have started a cohort-based program with curricular and scholarship components for women in these majors. I will present the results of our program so far and offer some advice based on our experiences.

Flat Zipper-Unfolding Pairs For Platonic Solids, Joseph O'Rourke

Computer Science: Faculty Publications

We show that four of the five Platonic solids' surfaces may be cut open with a Hamiltonian path along edges and unfolded to a polygonal net each of which can "zipper-refold" to a flat doubly covered parallelogram, forming a rather compact representation of the surface. Thus these regular polyhedra have particular flat "zipper pairs." No such zipper pair exists for a dodecahedron, whose Hamiltonian unfoldings are "zip-rigid." This report is primarily an inventory of the possibilities, and raises more questions than it answers.

Non-Invasive Prenatal Detection Of Trisomy 21 Using Tandem Single Nucleotide Polymorphisms, Sujana Ghanta, Michael Mitchell, Mary Ames, Mats Hidestrand, Pippa Simpson, Mary Goetsch, William Thilly, Craig Struble, Aoy Tomita-Mitchell

Mathematics, Statistics and Computer Science Faculty Research and Publications

Background: Screening tests for Trisomy 21 (T21), also known as Down syndrome, are routinely performed for the majority of pregnant women. However, current tests rely on either evaluating non-specific markers, which lead to false negative and false positive results, or on invasive tests, which while highly accurate, are expensive and carry a risk of fetal loss. We outline a novel, rapid, highly sensitive, and targeted approach to non-invasively detect fetal T21 using maternal plasma DNA.

Methods and Findings: Highly heterozygous tandem Single Nucleotide Polymorphism (SNP) sequences on chromosome 21 were analyzed using High-Fidelity PCR and Cycling Temperature Capillary …

Impact Of Interdisciplinary Undergraduate Research In Mathematics And Biology On The Development Of A New Course Integrating Five Stem Disciplines, Lester Caudill, April L. Hill, Kathy Hoke, Ovidiu Z. Lipan

Department of Math & Statistics Faculty Publications

Funded by innovative programs at the National Science Foundation and the Howard Hughes Medical Institute, University of Richmond faculty in biology, chemistry, mathematics, physics, and computer science teamed up to offer first- and second-year students the opportunity to contribute to vibrant, interdisciplinary research projects. The result was not only good science but also good science that motivated and informed course development. Here, we describe four recent undergraduate research projects involving students and faculty in biology, physics, mathematics, and computer science and how each contributed in significant ways to the conception and implementation of our new Integrated Quantitative Science course, a …

Impact Of Interdisciplinary Undergraduate Research In Mathematics And Biology On The Development Of A New Course Integrating Five Stem Disciplines, Lester Caudill, April L. Hill, Kathy Hoke, Ovidiu Z. Lipan

Biology Faculty Publications

Funded by innovative programs at the National Science Foundation and the Howard Hughes Medical Institute, University of Richmond faculty in biology, chemistry, mathematics, physics, and computer science teamed up to offer first- and second-year students the opportunity to contribute to vibrant, interdisciplinary research projects. The result was not only good science but also good science that motivated and informed course development. Here, we describe four recent undergraduate research projects involving students and faculty in biology, physics, mathematics, and computer science and how each contributed in significant ways to the conception and implementation of our new Integrated Quantitative Science course, a …

The Hamiltonian Index Of Graphs, Yi Hong, Jian-Liang Lin, Zhi-Sui Tao, Zhi-Hong Chen

Zhi-Hong Chen

The Hamiltonian index of a graph G is defined as h ( G ) = min { m : L m ( G ) is Hamiltonian } . In this paper, using the reduction method of Catlin [P.A. Catlin, A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12 (1988) 29–44], we constructed a graph H ̃ ( m ) ( G ) from G and prove that if h ( G ) ≥ 2 , then h ( G ) = min{ m : H ̃ ( m ) ( G ) has a spanning Eulerian subgraph …

Bioinformatics Across The Sciences, Nigel Yarlett

Cornerstone 3 Reports : Interdisciplinary Informatics

No abstract provided.

Energetyka Niskoemisyjna, Wojciech M. Budzianowski

Wojciech Budzianowski

No abstract provided.

Quantitative Analysis Of Arterial Spin Labeling Fmri Data Using A General Linear Model, Luis Hernandez-Garcia, Hesamoddin Jahanian, Daniel Rowe

Mathematics, Statistics and Computer Science Faculty Research and Publications

Arterial spin labeling techniques can yield quantitative measures of perfusion by fitting a kinetic model to difference images (tagged-control). Because of the noisy nature of the difference images investigators typically average a large number of tagged versus control difference measurements over long periods of time. This averaging requires that the perfusion signal be at a steady state and not at the transitions between active and baseline states in order to quantitatively estimate activation induced perfusion. This can be an impediment for functional magnetic resonance imaging task experiments. In this work, we introduce a general linear model (GLM) that specifies Blood …

A Methodology For Engineering Collaborative And Ad-Hoc Mobile Applications Using Syd Middleware, Praveen Madiraju, Srilaxmi Malladi, Janaka Balasooriya, Arthi Hariharan, Sushil K. Prasad, Anu Bourgeois

Mathematics, Statistics and Computer Science Faculty Research and Publications

Today’s web applications are more collaborative and utilize standard and ubiquitous Internet protocols. We have earlier developed System on Mobile Devices (SyD) middleware to rapidly develop and deploy collaborative applications over heterogeneous and possibly mobile devices hosting web objects. In this paper, we present the software engineering methodology for developing SyD-enabled web applications and illustrate it through a case study on two representative applications: (i) a calendar of meeting application, which is a collaborative application and (ii) a travel application which is an ad-hoc collaborative application. SyD-enabled web objects allow us to create a collaborative application rapidly with limited coding …

Processing Induced Voxel Correlation In Sense Fmri Via The Ammust Framework, Daniel Rowe, Iain P. Bruce

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.

A Class Of Models For Uncorrelated Random Variables, Nader Ebrahimi, Gholamhossein Hamedani, Ehsan S. Soofi, Hans Volkmer

Mathematics, Statistics and Computer Science Faculty Research and Publications

We consider the class of multivariate distributions that gives the distribution of the sum of uncorrelated random variables by the product of their marginal distributions. This class is defined by a representation of the assumption of sub-independence, formulated previously in terms of the characteristic function and convolution, as a weaker assumption than independence for derivation of the distribution of the sum of random variables. The new representation is in terms of stochastic equivalence and the class of distributions is referred to as the summable uncorrelated marginals (SUM) distributions. The SUM distributions can be used as models for the joint distribution …

The Maximum Clique Problem: Algorithms, Applications, And Implementations, John David Eblen

Doctoral Dissertations

Computationally hard problems are routinely encountered during the course of solving practical problems. This is commonly dealt with by settling for less than optimal solutions, through the use of heuristics or approximation algorithms. This dissertation examines the alternate possibility of solving such problems exactly, through a detailed study of one particular problem, the maximum clique problem. It discusses algorithms, implementations, and the application of maximum clique results to real-world problems. First, the theoretical roots of the algorithmic method employed are discussed. Then a practical approach is described, which separates out important algorithmic decisions so that the algorithm can be easily …

Noise Assumptions In Complex-Valued Sense Mr Image Reconstruction, Daniel B. Rowe, Iain P. Bruce

Mathematics, Statistics and Computer Science Faculty Research and Publications

In fMRI, brain images are not measured instantaneously and a volume of images can take two seconds to acquire at a low 64x64 resolution. Significant effort has been put forth on many fronts to decrease image acquisition time including parallel imaging. In parallel imaging, sub-sampled spatial frequency points are measured in parallel and combined to form a single image. Measurement time is decreased at the expense of increased image reconstruction difficulty and time. One significant parallel imaging technique known as SENSE utilizes a complex-valued regression coefficient estimation process with transposes replaced by conjugate transposes. However, in SENSE the noise structure …

A Formal Context Specific Trust Model (Ftm) For Multimedia And Ubiquitous Computing Environment, Sheikh Iqbal Ahamed, Munirul M. Haque, Nilothpal Talukder

Mathematics, Statistics and Computer Science Faculty Research and Publications

In order to ensure secure sharing of resources in an ad-hoc network of handheld devices in a multimedia and ubiquitous computing environment, mutual collaboration is essential. However, the limitations, such as poor storage and computational capability of these multimedia and ubiquitous devices stand as the bottleneck for effective sharing of resources. As a result of this drawback, the adversaries are obtaining access to the new doors for security breaches. Mutual Trust is the weapon used to combat security violations by restricting malicious devices from participating in any interaction in such an open and dynamic environment. In this paper, we present …

Automated Theorem Prover Axiom Management, Ashley T. Holeman, Ewen Denney

STAR Program Research Presentations

Automated Theorem Provers (ATPs), are computer programs that use collections of axioms,which are logical statements assumed to be true, in order to prove conjectures. NASA uses these programs to verify safety and functional requirements in domains like Guidance, Navigation, and Control. There are about 30 axioms on each major topic including the theory of coordinate systems, elementary arithmetic and linear algebra. These axioms have been created over the duration of many projects and combined into a single file. One task is to manage the axioms by arranging them into logical sections, deleting unnecessary ones and rewriting some into a more …

Discrete Groups And The Complex Contact Geometry Of Sl(2, C), Brendan Foreman

Mathematics and Computer Science

We investigate the vertical foliation of the standard complex contact structure on Γ \ Sl(2, C), where Γ is a discrete subgroup. We find that, if Γ is nonelementary, the vertical leaves on Γ \ Sl(2, C) are holomorphic but not regular. However, if Γ is Kleinian, then Γ \ Sl(2, C) contains an open, dense set on which the vertical leaves are regular, complete and biholomorphic to C ∗. If Γ is a uniform lattice, the foliation is nowhere regular, although there are both infinitely many compact and infinitely many nonclosed leaves.

Dnagents: Genetically Engineered Intelligent Mobile Agents, Jeremy Otho Kackley

Dissertations

Mobile agents are a useful paradigm for network coding providing many advantages and disadvantages. Unfortunately, widespread adoption of mobile agents has been hampered by the disadvantages, which could be said to outweigh the advantages. There is a variety of ongoing work to address these issues, and this is discussed. Ultimately, genetic algorithms are selected as the most interesting potential avenue. Genetic algorithms have many potential benefits for mobile agents. The primary benefit is the potential for agents to become even more adaptive to situational changes in the environment and/or emergent security risks. There are secondary benefits such as the natural …

Acm/Springer Mobile Networks And Applications (Monet) Special Issue On “Advanced Mobile Applications And Intelligent Multimedia Systems For Ubi-Com”, Jong Hyuk Park, Shu-Ching Chen, Mieso Denko, Sheikh Iqbal Ahamed

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.

On Folding A Polygon To A Polyhedron, Joseph O'Rourke

Computer Science: Faculty Publications

We show that the open problem presented in "Geometric Folding Algorithms: Linkages, Origami, Polyhedra" [DO07] is solved by a theorem of Burago and Zalgaller [BZ96] from more than a decade earlier.

Fastmedusa: A Parallelized Tool To Infer Gene Regulatory Networks, Serdar Bozdag, Aiguo Li, Stefan Wuchty, Howard A. Fine

Mathematics, Statistics and Computer Science Faculty Research and Publications

Motivation: In order to construct gene regulatory networks of higher organisms from gene expression and promoter sequence data efficiently, we developed FastMEDUSA. In this parallelized version of the regulatory network-modeling tool MEDUSA, expression and sequence data are shared among a user-defined number of processors on a single multi-core machine or cluster. Our results show that FastMEDUSA allows a more efficient utilization of computational resources. While the determination of a regulatory network of brain tumor in Homo sapiens takes 12 days with MEDUSA, FastMEDUSA obtained the same results in 6 h by utilizing 100 processors. Availability: Source code and documentation of …

On Flat Polyhedra Deriving From Alexandrov's Theorem, Joseph O'Rourke

Computer Science: Faculty Publications

We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov's gluing theorem is a degenerate flat polyhedron, and to reconstruct it from the gluing instructions. The algorithm runs in O(n³) time for polygons whose gluings are specified by n labels.

Star Unfolding Convex Polyhedra Via Quasigeodesic Loops, Jin-Ichi Itoh, Joseph O'Rourke, Costin Vîlcu

Computer Science: Faculty Publications

We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron ℘ to a simple (nonoverlapping) planar polygon: cut along one shortest path from each vertex of ℘ toQ, and cut all but one segment of Q.

The Yao Graph Y6 Is A Spanner, Joseph O'Rourke

Computer Science: Faculty Publications

We prove that Y₆ is a spanner. Y₆ is the Yao graph on a set of planar points, which has an edge from each point x to a closest point y within each of the six angular cones of 60^◦ surrounding x .

The Teaching Of Equation Solving: Approaches In Standards-Based And Traditional Curricula In The United States, Jinfa Cai, Bikai Nie, John Moyer

Mathematics, Statistics and Computer Science Faculty Research and Publications

This paper discusses the approaches to teaching linear equation solving that are embedded in a Standards-based mathematics curriculum (Connected Mathematics Program or CMP) and in a traditional mathematics curriculum (Glencoe Mathematics) in the United States. Overall, the CMP curriculum takes a functional approach to teaching equation solving, while Glencoe Mathematics takes a structural approach. The functional approach emphasizes the important ideas of change and variation in situations and contexts. It also emphasizes the representation of relationships between variables. The structural approach, on the other hand, requires students to work abstractly with symbols and follow procedures in a systematic way. …