Mathematics Commons^™

About Furuta's Inequality And Aluthge Transform On Pseudo-Hilbert Spaces, Loredana Ciudariu

ACMS Conference Proceedings 2009

No abstract provided.

Paper Abstracts (2009), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 2009

Seventeenth Conference of the Association of Christians in the Mathematical Sciences

Introduction (2009), Terry Perciante

ACMS Conference Proceedings 2009

Seventeenth Conference of the Association of Christians in the Mathematical Sciences

The Heavens And The Scriptures In The Eyes Of Johannes Kepler, Dale L. Mcintyre

ACMS Conference Proceedings 2009

The heavens declare the glory of God… Ps. 19:1 Acclaimed as one of the most accomplished and influential scientists of his time, the subject of this paper was also a passionate defender of the Christian faith who believed he had been called by God to glorify Him in the study of His Creation. We see a man who was so immersed in both the Scriptures and his exploration of the heavens that his scholarly writings often burst forth with biblical quotations and songs of praise for God the Creator. Though always magnanimous and tolerant of others, he suffered persecution from …

Table Of Contents (2009), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 2009

Seventeenth Conference of the Association of Christians in the Mathematical Sciences

Schedule (2009), Association Of Christians In The Mathematical Sciences

ACMS Conference Proceedings 2009

Seventeenth Conference of the Association of Christians in the Mathematical Sciences

Some Properties Of Yao Y4 Subgraphs, Joseph O'Rourke

Computer Science: Faculty Publications

The Yao graph for k = 4, Y₄, is naturally partitioned into four subgraphs, one per quadrant. We show that the subgraphs for one quadrant differ from the subgraphs for two adjacent quadrants in three properties: planarity, connectedness, and whether the directed graphs are spanners.

Volume 02, Joseph A. Mann, Kathryn J. Greenly, Scott E. Jenkins, Andrew E. Puckette, Daniel M. Honey, Jeffery P. Ravenhorst, Jamie Elizabeth Mesrobian, Thomas Scott, Jay Crowell, Sarah Spangenberg, Amy S. Eason, Kenny Wolfe, Liz Hale, Rachel Bouchard, Will Semonco, Carley York, Ryan Higgenbothom, Adrienne Heinbaugh, Melissa Dorton, Madeline Hunter, June Ashmore, Clark Barkley, Jay Haley

Incite: The Journal of Undergraduate Scholarship

Introduction from Dean Dr. Charles Ross

Mike's Nite: New Jazz for an Old Instrument by Joseph A. Mann

Investigation of the use of Cucumis Sativus for Remediation Of Chromium from Contaminated Environmental Matrices: An Interdisciplinary Instrumental Analysis Project by Kathryn J. Greenly, Scott E. Jenkins, and Andrew E. Puckette

Development of GC-MS and Chemometric Methods for the Analysis of Accelerants in Arson Cases by Scott Jenkins

Building and Measuring Scalable Computing Systems by Daniel M. Honey and Jeffery P. Ravenhorst

Nomini Hall: A Case Study in the Use of Archival Resources as Guides for Excavation at An Archaeological Site by …

The Hidden Injuries Of Overloading 'Adt, Duane Buck, David J. Stucki

Mathematics Faculty Scholarship

The most commonly stated definition of abstract data type (ADT) is that it is a domain of values and the operations over that domain. So, for example, a language's built-in types, like int are seen to be ADTs. It is our opinion that a pure interpretation of this definition yields a semantics in which using an ADT is the same as using built-in types: the operations are side effect free and there is no concern over alias, shallow copy or synchronization problems. Unfortunately, the term abstract data type has over time been associated with at least three distinct meanings, and …

Collapsible Graphs And Reductions Of Line Graphs, Zhi-Hong Chen, Peter C.B. Lam, Wai-Chee Shiu

Scholarship and Professional Work - LAS

A graph G is collapsible if for every even subset X ⊆ V ( G ) , G has a subgraph such that G − E ( Γ ) is connected and the set of odd-degree vertices of Γ is X . A graph obtained by contracting all the non-trivial collapsible subgraphs of G is called the reduction of G . In this paper, we characterize graphs of diameter two in terms of collapsible subgraphs and investigate the relationship between the line graph of the reduction and the reduction of the line graph. Our results extend former results in [H.-J. …

A Different Pencil Too Good To Be Ignored? A First Look At Wolfram|Alpha, Gizem Karaali, Bruce Yoshiwara

Pomona Faculty Publications and Research

So you came across several news pieces about Wolfram|Alpha and you’re wondering what all the fuss is about. Let’s start with the basics.

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 …

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 …

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).

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 …

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 …

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.

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 …

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 …

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.