Computer Sciences Commons^™

Software Internationalization: A Framework Validated Against Industry Requirements For Computer Science And Software Engineering Programs, John Huân Vũ

Master's Theses

View John Huân Vũ's thesis presentation at http://youtu.be/y3bzNmkTr-c.

In 2001, the ACM and IEEE Computing Curriculum stated that it was necessary to address "the need to develop implementation models that are international in scope and could be practiced in universities around the world." With increasing connectivity through the internet, the move towards a global economy and growing use of technology places software internationalization as a more important concern for developers. However, there has been a "clear shortage in terms of numbers of trained persons applying for entry-level positions" in this area. Eric Brechner, Director of Microsoft Development Training, suggested …

Highway Hull Revisited, Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop

Computer Science: Faculty Publications

A highway H is a line in the plane on which one can travel at a greater speed than in the remaining plane. One can choose to enter and exit H at any point. The highway time distance between a pair of points is the minimum time required to move from one point to the other, with optional use of H. The highway hull H(S,H) of a point set S is the minimal set containing S as well as the shortest paths between all pairs of points in H(S,H), using the highway time distance. We provide a Θ(nlogn) worst-case …

Quantification Of Artistic Style Through Sparse Coding Analysis In The Drawings Of Pieter Bruegel The Elder, James M. Hughes, Daniel J. Graham, Daniel N. Rockmore

Dartmouth Scholarship

Recently, statistical techniques have been used to assist art historians in the analysis of works of art. We present a novel technique for the quantification of artistic style that utilizes a sparse coding model. Originally developed in vision research, sparse coding models can be trained to represent any image space by maximizing the kurtosis of a representation of an arbitrarily selected image from that space. We apply such an analysis to successfully distinguish a set of authentic drawings by Pieter Bruegel the Elder from another set of well-known Bruegel imitations. We show that our approach, which involves a direct comparison …

Analysis Of The Consistency Of A Mixed Integer Programming-Based Multi-Category Constrained Discriminant Model, J. Paul Brooks, Eva K. Lee

Statistical Sciences and Operations Research Publications

Classification is concerned with the development of rules for the allocation of observations to groups, and is a fundamental problem in machine learning. Much of previous work on classification models investigates two-group discrimination. Multi-category classification is less-often considered due to the tendency of generalizations of two-group models to produce misclassification rates that are higher than desirable. Indeed, producing “good” two-group classification rules is a challenging task for some applications, and producing good multi-category rules is generally more difficult. Additionally, even when the “optimal” classification rule is known, inter-group misclassification rates may be higher than tolerable for a given classification model. …

The Topology Of Incidence Pseudographs, Thomas R. James, Reinhard Klette

Mathematics Faculty Scholarship

Incidence pseudographs model a (re°exive and symmetric) inci- dence relation between sets of various dimensions, contained in a count- able family. Work by Klaus Voss in 1993 suggested that this general discrete model allows to introduce a topology, and some authors have done some studies into this direction in the past (also using alternative discrete models such as, for example, abstract complexes or orders on sets of cells). This paper provides a comprehensive overview about the topology of incidence pseudographs. This topology has various appli- cations, such as in modeling basic data in 2D or 3D digital picture analysis, or …

A Vision For Acms, James Bradley

ACMS Journal 2010-2011

This paper presents a vision for the mission of the ACMS. It considers some plausible connections between mathematics and theology as well as some big questions that Christian mathematicians might fruitfully explore. It examines the current cultural norms of the mathematics guild, why these are problematic for Christians, and some possible ways the ACMS might respond.

Local Versus Global Search In Channel Graphs, A.H. Hunter, Nicholas Pippenger

All HMC Faculty Publications and Research

Previous studies of search in channel graphs has assumed that the search is global; that is, that the status of any link can be probed by the search algorithm at any time. We consider for the first time local search, for which only links to which an idle path from the source has already been established may be probed. We show that some well known channel graphs may require exponentially more probes, on the average, when search must be local than when it may be global.

On Coalgebras Over Algebras, Adriana Balan, Alexander Kurz

Engineering Faculty Articles and Research

We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a Set-monad M for functors arising as liftings. As an application we introduce the notion of commuting pair of endofunctors with respect to the monad M and show that under reasonable assumptions, the final coalgebra of one of the endofunctors involved can be obtained as the free algebra generated by the initial algebra of the other endofunctor.

Families Of Symmetries As Efficient Models Of Resource Binding, Vincenzo Ciancia, Alexander Kurz, Ugo Montanari

Engineering Faculty Articles and Research

Calculi that feature resource-allocating constructs (e.g. the pi-calculus or the fusion calculus) require special kinds of models. The best-known ones are presheaves and nominal sets. But named sets have the advantage of being finite in a wide range of cases where the other two are infinite. The three models are equivalent. Finiteness of named sets is strictly related to the notion of finite support in nominal sets and the corresponding presheaves. We show that named sets are generalisd by the categorical model of families, that is, free coproduct completions, indexed by symmetries, and explain how locality of interfaces gives good …

Algebraic Theories Over Nominal Sets, Alexander Kurz, Daniela Petrişan, Jiří Velebil

Engineering Faculty Articles and Research

We investigate the foundations of a theory of algebraic data types with variable binding inside classical universal algebra. In the first part, a category-theoretic study of monads over the nominal sets of Gabbay and Pitts leads us to introduce new notions of finitary based monads and uniform monads. In a second part we spell out these notions in the language of universal algebra, show how to recover the logics of Gabbay-Mathijssen and Clouston-Pitts, and apply classical results from universal algebra.

Character Degrees Of Normally Monomial Maximal Class 5-Groups, Michael Slattery

Mathematics, Statistics and Computer Science Faculty Research and Publications

This paper will impose limits on the possible sets of irreducible character degrees of a normally monomial 5-group of maximal class.

Developing Preservice Teachers’ Mathematical And Pedagogical Knowledge Using An Integrated Approach, Marta Magiera, Leigh A. Van Den Kieboom

Mathematics, Statistics and Computer Science Faculty Research and Publications

This paper describes how an integrated mathematics content and early field-experience course provides opportunities for preservice elementary teachers to develop understanding of mathematics and mathematics teaching. Engaging preservice teachers in solving and discussing mathematical tasks and providing opportunities to implement these tasks with elementary students creates an authentic context for the future teachers to reflect on their own understanding of mathematics, mathematics teaching, and students’ mathematical thinking. Essential elements of the cycle of events in the integrated model of instruction are discussed: preservice students’ acquisition of mathematical concepts in the context of selected tasks in the content course; subsequent posing …

Gliomapredict: A Clinically Useful Tool For Assigning Glioma Patients To Specific Molecular Subtypes, Aiguo Li, Serdar Bozdag, Yuri Kotliarov, Howard A. Fine

Mathematics, Statistics and Computer Science Faculty Research and Publications

Background: Advances in generating genome-wide gene expression data have accelerated the development of molecular-based tumor classification systems. Tools that allow the translation of such molecular classification schemas from research into clinical applications are still missing in the emerging era of personalized medicine.

Results: We developed GliomaPredict as a computational tool that allows the fast and reliable classification of glioma patients into one of six previously published stratified subtypes based on sets of extensively validated classifiers derived from hundreds of glioma transcriptomic profiles. Our tool utilizes a principle component analysis (PCA)-based approach to generate a visual representation of the analyses, quantifies …

Morphing Of Triangular Meshes In Shape Space, Stefanie Wuhrer, Prosenjit Bose, Chang Shu, Joseph O'Rourke, Alan Brunton

Computer Science: Faculty Publications

We present a novel approach to morph between two isometric poses of the same non-rigid object given as triangular meshes. We model the morphs as linear interpolations in a suitable shape space S. For triangulated 3D polygons, we prove that interpolating linearly in this shape space corresponds to the most isometric morph in R³ . We then extend this shape space to arbitrary triangulations in 3D using a heuristic approach and show the practical use of the approach using experiments. Furthermore, we discuss a modified shape space that is useful for isometric skeleton morphing. All of the newly presented …

A Mobile Intelligent Interruption Management System, Sina Zulkernain, Praveen Madiraju, Sheikh Iqbal Ahamed, Karl Stamm

Mathematics, Statistics and Computer Science Faculty Research and Publications

Mobile phones have become the most hated device that people cannot live without. For its primary usage as a communication device, it has surpassed any other medium. But it comes with a high price, interruption, anywhere anytime. These unwanted interruptions cause loss of productivity and also mostly not beneficial to the immediate task at hand, and moving them few minutes into the future can increase productivity. Considering receiver’s unavailability, it is possible to manage cell phone disruptions using advanced features like sensing capability, ubiquitous computing and context aware systems. This paper proposes the architecture of a system named Mobile Intelligent …

Digraphs With Isomorphic Underlying And Domination Graphs: 4-Cycles And Pairs Of Paths, Kim A. S. Factor, Larry J. Langley

Mathematics, Statistics and Computer Science Faculty Research and Publications

A domination graph of a digraph D, dom(D), is created using the vertex set of D, V(D). There is an edge uv in dom(D) whenever (u, z) or (v, z) is in the arc set of D, A(D), for every other vertex z ε V(D). For only some digraphs D has the structure of dom(D) been characterized. Examples of this are tournaments and regular digraphs. The authors have characterizations for the structure of digraphs D for …

Local Out-Tournaments With Upset Tournament Strong Components I: Full And Equal {0,1}-Matrix Ranks, Kim A. S. Factor, Rebecca M. Kohler, Jason M. Derby

Mathematics, Statistics and Computer Science Faculty Research and Publications

A digraph D is a local out-tournament if the outset of every vertex is a tournament. Here, we use local out-tournaments, whose strong components are upset tournaments, to explore the corresponding ranks of the adjacency matrices. Of specific interest is the out-tournament whose adjacency matrix has boolean, nonnegative integer, term, and real rank all equal to the number of vertices, n. Corresponding results for biclique covers and partitions of the digraph are provided.

Digraphs With Isomorphic Underlying And Domination Graphs: Pairs Of Paths, Kim A. S. Factor, Larry J. Langley

Mathematics, Statistics and Computer Science Faculty Research and Publications

A domination graph of a digraph D, dom (D), is created using thc vertex set of D and edge uv ϵ E (dom (D)) whenever (u, z) ϵ A (D) or (v, z) ϵ A (D) for any other vertex z ϵ A (D). Here, we consider directed graphs whose underlying graphs are isomorphic to their domination graphs. Specifically, digraphs are completely characterized where UG^c (D) is the union of two disjoint paths.

Lower Semimodular Inverse Semigroups, Ii, Peter R. Jones, Kyeong Hee Cheong

Mathematics, Statistics and Computer Science Faculty Research and Publications

The authors’ description of the inverse semigroups S for which the lattice ℒℱ(S) of full inverse subsemigroups is lower semimodular is used to describe those for which (a) the lattice ℒ(S) of all inverse subsemigroups or (b) the lattice �o(S) of convex inverse subsemigroups has that property. In each case, we show that this occurs if and only if the entire lattice is a subdirect product of ℒℱ(S) with ℒ(E _S ), or �o(E _S ), respectively, where E _S is the semilattice of idempotents of …

Automation Process For Morphometric Analysis Of Volumetric Ct Data From Pulmonary Vasculature In Rats, Rahul Shingrani, Gary S. Krenz, Robert Molthen

Mathematics, Statistics and Computer Science Faculty Research and Publications

With advances in medical imaging scanners, it has become commonplace to generate large multidimensional datasets. These datasets require tools for a rapid, thorough analysis. To address this need, we have developed an automated algorithm for morphometric analysis incorporating A Visualization Workshop computational and image processing libraries for three-dimensional segmentation, vascular tree generation and structural hierarchical ordering with a two-stage numeric optimization procedure for estimating vessel diameters. We combine this new technique with our mathematical models of pulmonary vascular morphology to quantify structural and functional attributes of lung arterial trees. Our physiological studies require repeated measurements of vascular structure to determine …

Cnareporter: A Computational Tool For The Generation Of Clinical Reports Of Genomic Alterations, Yuri Kotliarov, Serdar Bozdag, Hangjiong Cheng, Stefan Wuchty, Jean-Claude Zenklusen, Howard A. Fine

Mathematics, Statistics and Computer Science Faculty Research and Publications

Background: Genomic copy number alterations are widely associated with a broad range of human tumors and offer the potential to be used as a diagnostic tool. Especially in the emerging era of personalized medicine medical informatics tools that allow the fast visualization and analysis of genomic alterations of a patient's genomic profile for diagnostic and potential treatment purposes increasingly gain importance. Results: We developed CNAReporter, a software tool that allows users to visualize SNP-specific data obtained from Affymetrix arrays and generate PDF-reports as output. We combined standard algorithms for the analysis of chromosomal alterations, utilizing the widely applied GenePattern framework. …

Not Every Co-Existential Map Is Confluent, Paul Bankston

Mathematics, Statistics and Computer Science Faculty Research and Publications

A continuous surjection between compacta is co-existential if it is the second of two maps whose composition is a standard ultracopower projection. Co-existential maps are always weakly confluent, and are even monotone when the range space is locally connected; so it is a natural question to ask whether they are always confluent. Here we give a negative answer. This is an interesting question, mainly because of the fact that most theorems about confluent maps have parallel versions for co-existential maps---notably, both kinds of maps preserve hereditary indecomposability. Where the known parallels break down is in the question of chainability. It …

On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan

Engineering Faculty Articles and Research

We investigate universal algebra over the category Nom of nominal sets. Using the fact that Nom is a full re ective subcategory of a monadic category, we obtain an HSP-like theorem for algebras over nominal sets. We isolate a `uniform' fragment of our equational logic, which corresponds to the nominal logics present in the literature. We give semantically invariant translations of theories for nominal algebra and NEL into `uniform' theories and systematically prove HSP theorems for models of these theories.

Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz

Engineering Faculty Articles and Research

We introduce pairwise Stone spaces as a natural bitopological generalization of Stone spaces—the duals of Boolean algebras—and show that they are exactly the bitopological duals of bounded distributive lattices. The category PStone of pairwise Stone spaces is isomorphic to the category Spec of spectral spaces and to the category Pries of Priestley spaces. In fact, the isomorphism of Spec and Pries is most naturally seen through PStone by first establishing that Pries is isomorphic to PStone, and then showing that PStone is isomorphic to Spec. We provide the bitopological and spectral descriptions of many algebraic concepts important for the study …

Development And Implementation Of High-Throughput Snpgenotyping In Barley, Serdar Bozdag, Timothy J. Close, Prasanna R. Bhat, Stefano Lonardi, Yonghui Wu, Nils Rostoks, Luke Ramsay, Arnis Druka, Nils Stein, Jan T. Svensson, Steve Wanamaker, 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 …

Reinforcing The Number Of Disjoint Spanning Trees, Damin Liu, Hong-Jian Lai, Zhi-Hong Chen

Scholarship and Professional Work - LAS

The spanning tree packing number of a connected graph G, denoted by _T(G), is the maximum number of edge-disjoint spanning trees of G. In this paper, we determine the minimum number of edges that must be added to G so that the resulting graph has spanning tree packing number at least k, for a given value of k.

Design And Implementation Of S-Marks: A Secure Middleware For Pervasive Computing Applications, Sheikh Iqbal Ahamed, Haifeng Li, Nilothpal Talukder, Mehrab Monjur, Chowdhury Sharif Hasan

Mathematics, Statistics and Computer Science Faculty Research and Publications

As portable devices have become a part of our everyday life, more people are unknowingly participating in a pervasive computing environment. People engage with not a single device for a specific purpose but many devices interacting with each other in the course of ordinary activity. With such prevalence of pervasive technology, the interaction between portable devices needs to be continuous and imperceptible to device users. Pervasive computing requires a small, scalable and robust network which relies heavily on the middleware to resolve communication and security issues. In this paper, we present the design and implementation of S-MARKS which incorporates device …

Application Of Dual-Tree Complex Wavelet Transforms To Burst Detection And Rf Fingerprint Classification, Randall W. Klein

Theses and Dissertations

This work addresses various Open Systems Interconnection (OSI) Physical (PHY) layer mechanisms to extract and exploit RF waveform features (”fingerprints”) that are inherently unique to specific devices and that may be used to provide hardware specific identification (manufacturer, model, and/or serial number). This is addressed by applying a Dual-Tree Complex Wavelet Transform (DT-CWT) to improve burst detection and RF fingerprint classification. A ”Denoised VT” technique is introduced to improve performance at lower SNRs, with denoising implemented using a DT-CWT decomposition prior to Traditional VT processing. A newly developed Wavelet Domain (WD) fingerprinting technique is presented using statistical WD fingerprints with …

Statistical Investigation Of Structure In The Discrete Logarithm, Andrew Hoffman

Mathematical Sciences Technical Reports (MSTR)

The absence of an efficient algorithm to solve the Discrete Logarithm Problem is often exploited in cryptography. While exponentiation with a modulus is extremely fast with a modern computer, the inverse is decidedly not. At the present time, the best algorithms assume that the inverse mapping is completely random. Yet there is at least some structure, and to uncover additional structure that may be useful in constructing or refining algorithms, statistical methods are employed to compare modular exponential mappings to random mappings. More concretely, structure will be defined by representing the mappings as functional graphs and using parameters from graph …

Circular Nonlinear Subdivision Schemes For Curve Design, Jian-Ao Lian, Yonghui Wang, Yonggao Yang

Applications and Applied Mathematics: An International Journal (AAM)

Two new families of nonlinear 3-point subdivision schemes for curve design are introduced. The first family is ternary interpolatory and the second family is binary approximation. All these new schemes are circular-invariant, meaning that new vertices are generated from local circles formed by three consecutive old vertices. As consequences of the nonlinear schemes, two new families of linear subdivision schemes for curve design are established. The 3-point linear binary schemes, which are corner-cutting depending on the choices of the tension parameter, are natural extensions of the Lane-Riesenfeld schemes. The four families of both nonlinear and linear subdivision schemes are implemented …