Computer Sciences Commons^™

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 …

Racial/Ethnic Health Disparities In Northeast Ohio, Mark Salling, Joseph Ahern

All Maxine Goodman Levin School of Urban Affairs Publications

Racial/Ethnic Health Disparities in Northeast Ohio, Planning & Action, The Center for Community Solutions, Vol. 63, No. 4 (July), 2010, pp. 12-15.

Putting Artists On The Map: A Five Part Study Of Greater Cleveland Artists' Location Decisions - Part 1: Summary Report, Mark Salling, Gregory Soltis, Charles Post, Sharon Bliss, Ellen Cyran

All Maxine Goodman Levin School of Urban Affairs Publications

A series of reports detailing the residential and work space location preferences of Cuyahoga county's artists.

Census 2010 And Human Services And Community Development, Mark Salling, Jenita Mcgowan

All Maxine Goodman Levin School of Urban Affairs Publications

Census 2010 and Human Services and Community Development, Planning & Action, The Center for Community Solutions, Vol. 63, No. 2 (March), 2010, pp 1-4.

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 …

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 …

Encryption Using Deterministic Chaos, Jonathan Blackledge, Nikolai Ptitsyn

Articles

The concepts of randomness, unpredictability, complexity and entropy form the basis of modern cryptography and a cryptosystem can be interpreted as the design of a key-dependent bijective transformation that is unpredictable to an observer for a given computational resource. For any cryptosystem, including a Pseudo-Random Number Generator (PRNG), encryption algorithm or a key exchange scheme, for example, a cryptanalyst has access to the time series of a dynamic system and knows the PRNG function (the algorithm that is assumed to be based on some iterative process) which is taken to be in the public domain by virtue of the Kerchhoff-Shannon …

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 …

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 …

A Hidden Markov Model Based Approach To Detect Rogue Access Points, Gayathri Shivaraj

Electrical & Computer Engineering Theses & Dissertations

One of the most challenging security concerns for network administrators is the presence of Rogue access points. The challenge is to detect and disable a Rogue access point before it can cause hazardous damage to the network. This thesis proposes a statistically based approach to detect Rogue access points using a Hidden Markov Model, which is applied to passively measure packet-header data collected at a gateway router or any monitoring point. This approach utilizes variations in packet inter-arrival time to differentiate between authorized access points and Rouge access points. This approach used the inter-arrival time of a packet as a …

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 …

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

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 …

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 …

Application Of Optimization Techniques To Spectrally Modulated, Spectrally Encoded Waveform Design, Todd W. Beard

Theses and Dissertations

A design process is demonstrated for a coexistent scenario containing Spectrally Modulated, Spectrally Encoded (SMSE) and Direct Sequence Spread Spectrum (DSSS) signals. Coexistent SMSE-DSSS designs are addressed under both perfect and imperfect DSSS code tracking conditions using a non-coherent delay-lock loop (DLL). Under both conditions, the number of SMSE subcarriers and subcarrier spacing are the optimization variables of interest. For perfect DLL code tracking conditions, the GA and RSM optimization processes are considered independently with the objective function being end-to-end DSSS bit error rate. A hybrid GA-RSM optimization process is used under more realistic imperfect DLL code tracking conditions. In …

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, …

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 …