Computer Sciences Commons^™

Rules And Insights: Connecting The Mathematical And Linguistic Abilities Of C.S. Lewis, Kim Regnier Jongerius

ACMS Journal 2008-2009

While most biographical works on C.S. Lewis give passing reference to Lewis' problems with elementary mathematics, few have made an attempt at diagnosing the difficulty or exploring its impact on his writing. A careful study of family correspondence, however, makes it clear that his learning difficulties were not with mathematics alone and suggests connections between attitudes toward and abilities in both mathematics and language. This paper will make these connections clear and will illustrate their ties to Lewis' effective mathematical references.

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

Scholarship and Professional Work - LAS

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 …

Equational Coalgebraic Logic, Alexander Kurz, Raul Leal

Engineering Faculty Articles and Research

Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T specifies the possible one-step behaviours of the system. A fundamental question in this area is how to obtain, for an arbitrary functor T, a logic for T-coalgebras. We compare two existing proposals, Moss’s coalgebraic logic and the logic of all predicate liftings, by providing one-step translations between them, extending the results in [21] by making systematic use of Stone duality. Our main contribution then is a novel coalgebraic logic, which can be seen as an equational axiomatization of Moss’s logic. The three logics are …

A Compartmentalized Approach To The Assembly Of Physical Maps, Serdar Bozdag, Timothy J. Close, Stefano Lonardi

Mathematics, Statistics and Computer Science Faculty Research and Publications

Background: Physical maps have been historically one of the cornerstones of genome sequencing and map-based cloning strategies. They also support marker assisted breeding and EST mapping. The problem of building a high quality physical map is computationally challenging due to unavoidable noise in the input fingerprint data. Results: We propose a novel compartmentalized method for the assembly of high quality physical maps from fingerprinted clones. The knowledge of genetic markers enables us to group clones into clusters so that clones in the same cluster are more likely to overlap. For each cluster of clones, a local physical map is first …

Special Set Linear Algebra And Special Set Fuzzy Linear Algebra, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

This book for the first time introduces the notion of special set linear algebra and special set fuzzy linear algebra. This is an extension of the book set linear algebra and set fuzzy linear algebra. These algebraic structures basically exploit only the set theoretic property, hence in applications one can include a finite number of elements without affecting the systems property. These new structures are not only the most generalized structures but they can perform multi task simultaneously; hence they would be of immense use to computer scientists. This book has five chapters. In chapter one the basic concepts about …

Compartmentalized Approach To The Assembly Of Physical Maps, Serdar Bozdag, Timothy J. Close, Stefano Lonardi

Mathematics, Statistics and Computer Science Faculty Research and Publications

Background

Physical maps have been historically one of the cornerstones of genome sequencing and map-based cloning strategies. They also support marker assisted breeding and EST mapping. The problem of building a high quality physical map is computationally challenging due to unavoidable noise in the input fingerprint data.

Results

We propose a novel compartmentalized method for the assembly of high quality physical maps from fingerprinted clones. The knowledge of genetic markers enables us to group clones into clusters so that clones in the same cluster are more likely to overlap. For each cluster of clones, a local physical map is first …

Development And Implementation Of High-Throughput Snp Genotyping In Barley, Timothy J. Close, Prasanna R. Bhat, Stefano Lonardi, Yonghui Wu, Nils Rostoks, Luke Ramsay, Arnis Druka, Nils Stein, Jan T. Svensson, Steve Wanamaker, Serdar Bozdag, Mikeal L. Roose, Matthew J. Moscou, Shiaoman Chao, Rajeev K. Varshney, Peter Szucs, Kazuhiro Sato, Patrick M. Hayes, David E. Matthews, Andris Kleinhofs, Gary J. Muehlbauer, Joseph Deyoung, David F. Marshall, Kavitha Madishetty, Raymond D. Fenton, Pascal Condamine, Andreas Graner, Robbie Waugh

Mathematics, Statistics and Computer Science Faculty Research and Publications

Background

High density genetic maps of plants have, nearly without exception, made use of marker datasets containing missing or questionable genotype calls derived from a variety of genic and non-genic or anonymous markers, and been presented as a single linear order of genetic loci for each linkage group. The consequences of missing or erroneous data include falsely separated markers, expansion of cM distances and incorrect marker order. These imperfections are amplified in consensus maps and problematic when fine resolution is critical including comparative genome analyses and map-based cloning. Here we provide a new paradigm, a high-density consensus genetic map of …

Preferential Utilization Of Nadph As The Endogenous Electron Donor For Nad(P)H:Quinone Oxidoreductase 1 (Nqo1) In Intact Pulmonary Arterial Endothelial Cells, Robert D. Bongard, Brian J. Lindemer, Gary S. Krenz, Marilyn P. Merker

Mathematics, Statistics and Computer Science Faculty Research and Publications

The goal was to determine whether endogenous cytosolic NAD(P)H:quinone oxidoreductase 1 (NQO1) preferentially uses NADPH or NADH in intact pulmonary arterial endothelial cells in culture. The approach was to manipulate the redox status of the NADH/NAD⁺ and NADPH/NADP⁺ redox pairs in the cytosolic compartment using treatment conditions targeting glycolysis and the pentose phosphate pathway alone or with lactate, and to evaluate the impact on the intact cell NQO1 activity. Cells were treated with 2-deoxyglucose, iodoacetate, or epiandrosterone in the absence or presence of lactate, NQO1 activity was measured in intact cells using duroquinone as the electron acceptor, and …

Dendrites, Topological Graphs, And 2-Dominance, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

For each positive ordinal α, the reflexive and transitive binary relation of α-dominance between compacta was first defined in our paper [Mapping properties of co-existentially closed continua, Houston J. Math., 31 (2005), 1047-1063] using the ultracopower construction. Here we consider the important special case α =2, and show that any Peano compactum 2-dominated by a dendrite is itself a dendrite (with the same being true for topological graphs and trees). We also characterize the topological graphs that 2-dominate arcs (resp., simple closed curves) as those that have cut points of order 2 (resp., those that are not trees).

Shadowing Chaos Via Optimization, Henrik Haakonsen

Mathematics, Statistics, and Computer Science Honors Projects

A prominent idea in the theory of chaos is that of shadowing, which says that, in many cases, the numerical results one sees after accuracy is lost are not total nonsense, but are in fact very close to the exact trajectory for an initial value that is near the one used. Using high-precision computation, I have researched the use of optimization as a way of finding exact shadows for several chaotic systems, such as the quadratic map r x (1 - x) and a billiard problem from the SIAM 100-Digit Challenge.

Topological Structures In The Equities Market Network, Gregory Leibon, Scott Pauls, Daniel Rockmore, Robert Savell

Dartmouth Scholarship

We present a new method for articulating scale-dependent topological descriptions of the network structure inherent in many complex systems. The technique is based on “partition decoupled null models,” a new class of null models that incorporate the interaction of clustered partitions into a random model and generalize the Gaussian ensemble. As an application, we analyze a correlation matrix derived from 4 years of close prices of equities in the New York Stock Exchange (NYSE) and National Association of Securities Dealers Automated Quotation (NASDAQ). In this example, we expose (i) a natural structure composed of 2 interacting partitions of …

A Trust-Based Secure Service Discovery (Tssd) Model For Pervasive Computing, Sheikh Iqbal Ahamed, Moushumi Sharmin

Mathematics, Statistics and Computer Science Faculty Research and Publications

To cope with the challenges posed by device capacity and capability, and also the nature of ad hoc networks, a Service discovery model is needed that can resolve security and privacy issues with simple solutions. The use of complex algorithms and powerful fixed infrastructure is infeasible due to the volatile nature of pervasive environment and tiny pervasive devices. In this paper, we present a trust-based secure Service discovery model, TSSD (trust-based secure service discovery) for a truly pervasive environment. Our model is a hybrid one that allows both secure and non-secure discovery of services. This model allows Service discovery and …

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

Computer Science: Faculty Publications

We extend the notion of a star unfolding to be based on a simple quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple, planar polygon: shortest paths from all vertices of P to Q are cut, and all but one segment of Q is cut.

On A-Ary Subdivision For Curve Design Ii. 3-Point And 5-Point Interpolatory Schemes, Jian-Ao Lian

Applications and Applied Mathematics: An International Journal (AAM)

The a-ary 3-point and 5-point interpolatery subdivision schemes for curve design are introduced for arbitrary odd integer a greater than or equal to 3. These new schemes further extend the family of the classical 4- and 6-point interpolatory schemes.

Ubi-App: A Ubiquitous Application For Universal Access From Handheld Devices, Shameem Ahmed, Moushumi Sharmin, Sheikh Iqbal Ahamed

Mathematics, Statistics and Computer Science Faculty Research and Publications

Universal access from a handheld device (such as a PDA, cell phone) at any time or anywhere is now a reality. Ubicomp Assistant (UA) (Sharmin et al. in Proceedings of the 21st annual ACM symposium on applied computing (ACM SAC 2006), Dijon, France, pp 1013–1017, 2006) is an integral service of MARKS (Sharmin et al. in Proceedings of the third international conference on information technology: new generations (ITNG 2006), Las Vegas, Nevada, USA, pp 306–313, 2006). It is a middleware developed for handheld devices, and has been designed to accommodate different types of users (e.g., education, healthcare, marketing, or business). …

Coenzyme Q1 Redox Metabolism During Passage Through The Rat Pulmonary Circulation And The Effect Of Hyperoxia, Said H. Audi, Marilyn P. Merker, Gary S. Krenz, Taniya Ahuja, David L. Roerig, Robert D. Bongard

Mathematics, Statistics and Computer Science Faculty Research and Publications

The objective was to evaluate the pulmonary disposition of the ubiquinone homolog coenzyme Q₁ (CoQ₁) on passage through lungs of normoxic (exposed to room air) and hyperoxic (exposed to 85% O₂ for 48 h) rats. CoQ₁ or its hydroquinone (CoQ₁H₂) was infused into the arterial inflow of isolated, perfused lungs, and the venous efflux rates of CoQ₁H₂ and CoQ₁ were measured. CoQ₁H₂ appeared in the venous effluent when CoQ₁ was infused, and CoQ₁ appeared when CoQ1H2 was infused. In normoxic lungs, CoQ …

A Simplex Model For Layered Niche Networks, Philip Fraundorf

Physics Faculty Works

No abstract provided.

Matlab Report, Nancy Hale

Cornerstone 3 Reports : Interdisciplinary Informatics

The objective of this effort is to create a multidisciplinary approach to problem solving using technology. Through Thinkfinity, the Seidenberg School of Computer Science and Information Systems is collaborating with the science and quantitative faculty to create lessons that can be used by high school and first -year college students to work interactively with data to solve problems. MatLab is the tool of choice. It gives the user the ability to create visual models of large data sets and is used in the science and finance areas.

The key features of MatLab:

• Interactive tools for iterative exploration, design, and …

Unfolding Manhattan Towers, Mirela Damian, Robin Flatland, Joseph O'Rourke

Computer Science: Faculty Publications

We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthogonal polygon. The algorithm cuts along edges of a 4×5×1 refinement of the vertex grid.

Integer Ratio Logarithm Based Edge Detection For Runway Hazard Detection, Sri Satya Vardhan Gogineni

Electrical & Computer Engineering Theses & Dissertations

As air traffic is growing in leaps and bounds every day, flying safe has been a major concern in day to day life. Aviation safety is always dependent on the performance of the pilot and air traffic controllers. The very involvement of human discretion introduces judgment as a component of a safe takeoff and landing. A convenient and immediate alternative would be the use of technology to alleviate the problem. Several algorithms have been developed to solve this problem. However, most computer vision algorithms leave the task of interpreting the end data unaddressed. Juggling the myriad tasks during landing and …

Uniform Uncertainty Principle And Signal Recovery Via Regularized Orthogonal Matching Pursuit, Deanna Needell, Roman Vershynin

CMC Faculty Publications and Research

This paper seeks to bridge the two major algorithmic approaches to sparse signal recovery from an incomplete set of linear measurements—L1-minimization methods and iterative methods (Matching Pursuits). We find a simple regularized version of Orthogonal Matching Pursuit (ROMP) which has advantages of both approaches: the speed and transparency of OMP and the strong uniform guarantees of L1-minimization. Our algorithm, ROMP, reconstructs a sparse signal in a number of iterations linear in the sparsity, and the reconstruction is exact provided the linear measurements satisfy the uniform uncertainty principle.

On A-Ary Subdivision For Curve Design: I. 4-Point And 6-Point Interpolatory Schemes, Jian-Ao Lian

Applications and Applied Mathematics: An International Journal (AAM)

The classical binary 4-point and 6-point interpolatery subdivision schemes are generalized to a-ary setting for any integer a greater than or equal to 3. These new a-ary subdivision schemes for curve design are derived easily from their corresponding two-scale scaling functions, a notion from the context of wavelets.

Architecture And Implementation Of A Trust Model For Pervasive Applications, Sheikh Iqbal Ahamed, Mohammad Zulkernine, Sailaja Bulusu, Mehrab Monjur

Mathematics, Statistics and Computer Science Faculty Research and Publications

Collaborative effort to share resources is a significant feature of pervasive computing environments. To achieve secure service discovery and sharing, and to distinguish between malevolent and benevolent entities, trust models must be defined. It is critical to estimate a device's initial trust value because of the transient nature of pervasive smart space; however, most of the prior research work on trust models for pervasive applications used the notion of constant initial trust assignment. In this paper, we design and implement a trust model called DIRT. We categorize services in different security levels and depending on the service requester's context information, …

Foundations And Interpretations Of Quantum Mechanics, Cory Johnson

Honors Theses

The first famous thought experiment of Einstein gives rise to his theories of relativity, the bedrock of modern astrophysics and cosmology. His second famous thought experiment begins the investigation into the foundations of quantum mechanics. It leads to a paradox, inspiring various 'no-go' theorems proven by Bell, Kochen, and Specker. Physicists and philosophers worldwide become increasingly dissatisfied with the probabilistic complementarity interpretation (Born-Bohr) and eventually offer their own accounts of the theory. By the end of the 20th century two alternative approaches stand out as the best candidates: Both the hidden variables interpretation (de Broglie-Bohm) and the many worlds interpretation …

Effects Of Context Of Natural And Artifactual Objects On Categorization, Linsey Walker

Honors Theses

Categorization of animals and vehicles in different contexts was investigated in three experiments using event related potentials (ERPs). The presence of a background and congruency of the background in relation to the object were both manipulated in order to determine the effects of context on visual processing. In Experiment 1, adults were presented with images of animals and vehicles in two conditions: situated in a congruent context (e.g. an animal in a field) and in the absence of a context (an animal in a white homogeneous background). In experiment 2, adults were presented with images of animals and vehicles in …

Cauchy’S Arm Lemma On A Growing Sphere, Zachary Abel, David Charlton, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Godfried Toussaint

Computer Science: Faculty Publications

We propose a variant of Cauchy's Lemma, proving that when a convex chain on one sphere is redrawn (with the same lengths and angles) on a larger sphere, the distance between its endpoints increases. The main focus of this work is a comparison of three alternate proofs, to show the links between Toponogov's Comparison Theorem, Legendre's Theorem and Cauchy's Arm Lemma.

An Impregnable Lightweight Device Discovery (Ildd) Model For The Pervasive Computing Environment Of Enterprise Applications, Munirul H. Haque, Sheikh Iqbal Ahamed

Mathematics, Statistics and Computer Science Faculty Research and Publications

The worldwide use of handheld devices (personal digital assistants, cell phones, etc.) with wireless connectivity will reach 2.6 billion units this year and 4 billion by 2010. More specifically, these handheld devices have become an integral part of industrial applications. These devices form pervasive ad hoc wireless networks that aide in industry applications. However, pervasive computing is susceptible and vulnerable to malicious active and passive snoopers. This is due to the unavoidable interdevice dependency, as well as a common shared medium, very transitory connectivity, and the absence of a fixed trust infrastructure. In order to ensure security and privacy in …

Volume 01, Jessica Fields, Stephanie Neeley, Derek W. Hambright, Mary E. Lehman, Andrew R. Grzankowski, Zachary Johnson, Boone M. Prentice, Ashley M. Swandby, Victoria Morgan, Katie Williamson, Kristine G. Bender, Katelyn N. Romaine, D. Nicole Swann, Jessica Fox, Mike Mcateer, Alex Grabiec, Laura Nodtvedt, Nick Costa, Rachel Wolfe, Zack Dalton

Incite: The Journal of Undergraduate Scholarship

Introduction from Dean Dr. Charles Ross

Three Decades of Digging: Undergraduate Archeology at Longwood by Jessica Fields and Stephanie Neeley

Interactions of Allelopathy and Heat Stress in Plants by Derek W. Hambright and Mary E. Lehman

Inertial Electrostatic Confinement D-D Fusion Device: Construction and Simulation by Andrew R. Grzankowski

Shackled Nim by Zachary Johnson

Development of GC-MS and Chemometric Methods for the Analysis of Accelerants in Arson Cases by Boone M. Prentice

A Comparison of Image Analysis Methods in cDNA Microarrays by Ashley M. Swandby

Perceived Sexual Activity of Short and Long-Term Relationships by Victoria Morgan and Katie Williamson

Elderly …

Grid Vertex-Unfolding Orthogonal Polyhedra, Mirela Damian

Computer Science: Faculty Publications

No abstract provided.

A Class Of Convex Polyhedra With Few Edge Unfoldings, Alex Benton, Joseph O'Rourke

Computer Science: Faculty Publications

We construct a sequence of convex polyhedra on n vertices with the property that, as n -> infinity, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the fraction that overlap approaches 1. Nevertheless, each does have (several) nonoverlapping edge unfoldings.