Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 23 of 23

Full-Text Articles in Physical Sciences and Mathematics

Genuine Faculty-Mentored Research Experiences For In-Service Science Teachers: Increases In Science Knowledge, Perception, And Confidence Levels, Christine E. Cutucache, Heather D. Leas, Neal F. Grandgenett, Kari L. Nelson, Steven N. Rodie, Robert Duncan Shuster, Chris Schaben, William E. Tapprich Jan 2018

Genuine Faculty-Mentored Research Experiences For In-Service Science Teachers: Increases In Science Knowledge, Perception, And Confidence Levels, Christine E. Cutucache, Heather D. Leas, Neal F. Grandgenett, Kari L. Nelson, Steven N. Rodie, Robert Duncan Shuster, Chris Schaben, William E. Tapprich

Biology Faculty Publications

The overall purpose of this multifocused study was to explore how participation in genuine mentored scientific research experiences impacts in-service science teachers and the knowledge and skills needed for their own science teaching. The research experiences resulted from a partnership between the University of Nebraska at Omaha and the Omaha Public School District. This Teacher- Researcher Partnership Program facilitated opportunities in inquiry, science content, interaction with laboratory instrumentation and technologies, critical discussion of literature, and dissemination of findings for participating in-service science teacher professional development utilizing an inquiry-based theoretical framework wherein we examined science teacher preparation via inquiry-based methods in …


University Of Nebraska At Omaha 2018-2019 Course Catalog, University Of Nebraska At Omaha Jan 2018

University Of Nebraska At Omaha 2018-2019 Course Catalog, University Of Nebraska At Omaha

Undergraduate Catalogs

Located in one of America’s best cities to live, work and learn, the University of Nebraska at Omaha (UNO) is Nebraska’s premier metropolitan university. With more than 15,000 students enrolled in 200-plus programs of study, UNO is recognized nationally for its online education, graduate education, military friendliness, and community engagement efforts.Founded in 1908, UNO has served learners of all backgrounds for more than 100 years and is dedicated to another century of excellence both in the classroom and in the community.


University Of Nebraska At Omaha 2017-2018 Course Catalog, University Of Nebraska At Omaha Jan 2017

University Of Nebraska At Omaha 2017-2018 Course Catalog, University Of Nebraska At Omaha

Graduate Catalogs

The University of Nebraska Omaha (UNO) is a premier metropolitan university that combines the resources of a doctoral research institution with a thriving community in the heart of Omaha.

With a global reach and vision, UNO is large enough to provide opportunities students seek, yet personal enough to include the mentorship they need to achieve academic excellence, creativity, and engaged learningat competitive tuition rates.

UNO is committed to and engaged with the city surrounding it, allowing students unique hands-on opportunities, internships, service learning,applied research, and other collaborative activities that enhance time in the classroom.

This is the ”O” we want …


A Dynamic Run-Profile Energy-Aware Approach For Scheduling Computationally Intensive Bioinformatics Applications, Sachin Pawaskar, Hesham Ali Jul 2016

A Dynamic Run-Profile Energy-Aware Approach For Scheduling Computationally Intensive Bioinformatics Applications, Sachin Pawaskar, Hesham Ali

Computer Science Faculty Proceedings & Presentations

High Performance Computing (HPC) resources are housed in large datacenters, which consume exorbitant amounts of energy and are quickly demanding attention from businesses as they result in high operating costs. On the other hand HPC environments have been very useful to researchers in many emerging areas in life sciences such as Bioinformatics and Medical Informatics. In an earlier work, we introduced a dynamic model for energy aware scheduling (EAS) in a HPC environment; the model is domain agnostic and incorporates both the deadline parameter as well as energy parameters for computationally intensive applications. Our proposed EAS model incorporates 2-phases. In …


Graph Mining For Next Generation Sequencing: Leveraging The Assembly Graph For Biological Insights, Julia Warnke-Sommer, Hesham Ali May 2016

Graph Mining For Next Generation Sequencing: Leveraging The Assembly Graph For Biological Insights, Julia Warnke-Sommer, Hesham Ali

Computer Science Faculty Publications

Background: The assembly of Next Generation Sequencing (NGS) reads remains a challenging task. This is especially true for the assembly of metagenomics data that originate from environmental samples potentially containing hundreds to thousands of unique species. The principle objective of current assembly tools is to assemble NGS reads into contiguous stretches of sequence called contigs while maximizing for both accuracy and contig length. The end goal of this process is to produce longer contigs with the major focus being on assembly only. Sequence read assembly is an aggregative process, during which read overlap relationship information is lost as reads are …


Community Chairs As A Catalyst For Campus Collaboration In Stem, Neal Grandgenett, David Boocker, Hesham Ali, Angela M. Hodge, Brian Dorn, Christine E. Cutucache Jan 2015

Community Chairs As A Catalyst For Campus Collaboration In Stem, Neal Grandgenett, David Boocker, Hesham Ali, Angela M. Hodge, Brian Dorn, Christine E. Cutucache

Biology Faculty Publications

Strong collaborative partnerships are critical to the ongoing success of any urban or metropolitan university in its efforts to build the science, technology, engineering, and mathematics (STEM) career pathways so critical to our nation. At the University of Nebraska at Omaha, we have established a faculty leadership structure of "community chairs" that work across colleges to support campus priorities. This paper describes UNO’s STEM community chair model, including selected initiatives, impacts, and challenges to date.


Identifying Aging-Related Genes In Mouse Hippocampus Using Gateway Nodes, Kathryn Dempsey Cooper, Hesham Ali Jan 2014

Identifying Aging-Related Genes In Mouse Hippocampus Using Gateway Nodes, Kathryn Dempsey Cooper, Hesham Ali

Interdisciplinary Informatics Faculty Publications

Background: High-throughput studies continue to produce volumes of metadata representing valuable sources of information to better guide biological research. With a stronger focus on data generation, analysis models that can readily identify actual signals have not received the same level of attention. This is due in part to high levels of noise and data heterogeneity, along with a lack of sophisticated algorithms for mining useful information. Networks have emerged as a powerful tool for modeling high-throughput data because they are capable of representing not only individual biological elements but also different types of relationships en masse. Moreover, well-established graph …


On Identifying And Analyzing Significant Nodes In Protein-­Protein Interaction Networks, Rohan Khazanchi, Kathryn Dempsey Cooper, Ishwor Thapa, Hesham Ali Jan 2013

On Identifying And Analyzing Significant Nodes In Protein-­Protein Interaction Networks, Rohan Khazanchi, Kathryn Dempsey Cooper, Ishwor Thapa, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

Network theory has been used for modeling biological data as well as social networks, transportation logistics, business transcripts, and many other types of data sets. Identifying important features/parts of these networks for a multitude of applications is becoming increasingly significant as the need for big data analysis techniques grows. When analyzing a network of protein-protein interactions (PPIs), identifying nodes of significant importance can direct the user toward biologically relevant network features. In this work, we propose that a node of structural importance in a network model can correspond to a biologically vital or significant property. This relationship between topological and …


On Mining Biological Signals Using Correlation Networks, Kathryn Dempsey Cooper, Ishwor Thapa, Claudia Cortes, Zack Eriksen, Dhundy Raj Bastola, Hesham Ali Jan 2013

On Mining Biological Signals Using Correlation Networks, Kathryn Dempsey Cooper, Ishwor Thapa, Claudia Cortes, Zack Eriksen, Dhundy Raj Bastola, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

Correlation networks have been used in biological networks to analyze and model high-throughput biological data, such as gene expression from microarray or RNA-seq assays. Typically in biological network modeling, structures can be mined from these networks that represent biological functions; for example, a cluster of proteins in an interactome can represent a protein complex. In correlation networks built from high-throughput gene expression data, it has often been speculated or even assumed that clusters represent sets of genes that are coregulated. This research aims to validate this concept using network systems biology and data mining by identification of correlation network clusters …


A Parallel Template For Implementing Filters For Biological Correlation Networks, Kathryn Dempsey Cooper, Vladimir Ufimtsev, Sanjukta Bhowmick, Hesham Ali Jan 2013

A Parallel Template For Implementing Filters For Biological Correlation Networks, Kathryn Dempsey Cooper, Vladimir Ufimtsev, Sanjukta Bhowmick, Hesham Ali

Interdisciplinary Informatics Faculty Publications

High throughput biological experiments are critical for their role in systems biology – the ability to survey the state of cellular mechanisms on the broad scale opens possibilities for the scientific researcher to understand how multiple components come together, and what goes wrong in disease states. However, the data returned from these experiments is massive and heterogeneous, and requires intuitive and clever computational algorithms for analysis. The correlation network model has been proposed as a tool for modeling and analysis of this high throughput data; structures within the model identified by graph theory have been found to represent key players …


A Novel Multithreaded Algorithm For Extracting Maximal Chordal Subgraphs, Mahantesh Halappanavar, John Feo, Kathryn Dempsey Cooper, Hesham Ali, Sanjukta Bhowmick Jan 2012

A Novel Multithreaded Algorithm For Extracting Maximal Chordal Subgraphs, Mahantesh Halappanavar, John Feo, Kathryn Dempsey Cooper, Hesham Ali, Sanjukta Bhowmick

Interdisciplinary Informatics Faculty Proceedings & Presentations

Chordal graphs are triangulated graphs where any cycle larger than three is bisected by a chord. Many combinatorial optimization problems such as computing the size of the maximum clique and the chromatic number are NP-hard on general graphs but have polynomial time solutions on chordal graphs. In this paper, we present a novel multithreaded algorithm to extract a maximal chordal sub graph from a general graph. We develop an iterative approach where each thread can asynchronously update a subset of edges that are dynamically assigned to it per iteration and implement our algorithm on two different multithreaded architectures - Cray …


On The Design Of Advanced Filters For Biological Networks Using Graph Theoretic Properties, Kathryn Dempsey Cooper, Tzu-Yi Chen, Sanjukta Bhowmick, Hesham Ali Jan 2012

On The Design Of Advanced Filters For Biological Networks Using Graph Theoretic Properties, Kathryn Dempsey Cooper, Tzu-Yi Chen, Sanjukta Bhowmick, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

Network modeling of biological systems is a powerful tool for analysis of high-throughput datasets by computational systems biologists. Integration of networks to form a heterogeneous model requires that each network be as noise-free as possible while still containing relevant biological information. In earlier work, we have shown that the graph theoretic properties of gene correlation networks can be used to highlight and maintain important structures such as high degree nodes, clusters, and critical links between sparse network branches while reducing noise. In this paper, we propose the design of advanced network filters using structurally related graph theoretic properties. While spanning …


The Development Of Parallel Adaptive Sampling Algorithms For Analyzing Biological Networks, Kathryn Dempsey Cooper, Kanimathi Duraisamy, Sanjukta Bhowmick, Hesham Ali Jan 2012

The Development Of Parallel Adaptive Sampling Algorithms For Analyzing Biological Networks, Kathryn Dempsey Cooper, Kanimathi Duraisamy, Sanjukta Bhowmick, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

The availability of biological data in massive scales continues to represent unlimited opportunities as well as great challenges in bioinformatics research. Developing innovative data mining techniques and efficient parallel computational methods to implement them will be crucial in extracting useful knowledge from this raw unprocessed data, such as in discovering significant cellular subsystems from gene correlation networks. In this paper, we present a scalable combinatorial sampling technique, based on identifying maximum chordal subgraphs, that reduces noise from biological correlation networks, thereby making it possible to find biologically relevant clusters from the filtered network. We show how selecting the appropriate filter …


A Novel Correlation Networks Approach For The Identification Of Gene Targets, Kathryn Dempsey Cooper, Stephen Bonasera, Dhundy Raj Bastola, Hesham Ali Jan 2011

A Novel Correlation Networks Approach For The Identification Of Gene Targets, Kathryn Dempsey Cooper, Stephen Bonasera, Dhundy Raj Bastola, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

Correlation networks are emerging as a powerful tool for modeling temporal mechanisms within the cell. Particularly useful in examining coexpression within microarray data, studies have determined that correlation networks follow a power law degree distribution and thus manifest properties such as the existence of “hub” nodes and semicliques that potentially correspond to critical cellular structures. Difficulty lies in filtering coincidental relationships from causative structures in these large, noise-heavy networks. As such, computational expenses and algorithm availability limit accurate comparison, making it difficult to identify changes between networks. In this vein, we present our work identifying temporal relationships from microarray data …


Evaluation Of Essential Genes In Correlation Networks Using Measures Of Centrality, Kathryn Dempsey Cooper, Hesham Ali Jan 2011

Evaluation Of Essential Genes In Correlation Networks Using Measures Of Centrality, Kathryn Dempsey Cooper, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

Correlation networks are emerging as powerful tools for modeling relationships in high-throughput data such as gene expression. Other types of biological networks, such as protein-protein interaction networks, are popular targets of study in network theory, and previous analysis has revealed that network structures identified using graph theoretic techniques often relate to certain biological functions. Structures such as highly connected nodes and groups of nodes have been found to correspond to essential genes and protein complexes, respectively. The correlation network, which measures the level of co-variation of gene expression levels, shares some structural properties with other types of biological networks. We …


A Noise Reducing Sampling Approach For Uncovering Critical Properties In Large Scale Biological Networks, Karthik Duraisamy, Kathryn Dempsey Cooper, Hesham Ali, Sanjukta Bhowmick Jan 2011

A Noise Reducing Sampling Approach For Uncovering Critical Properties In Large Scale Biological Networks, Karthik Duraisamy, Kathryn Dempsey Cooper, Hesham Ali, Sanjukta Bhowmick

Interdisciplinary Informatics Faculty Proceedings & Presentations

A correlation network is a graph-based representation of relationships among genes or gene products, such as proteins. The advent of high-throughput bioinformatics has resulted in the generation of volumes of data that require sophisticated in silico models, such as the correlation network, for in-depth analysis. Each element in our network represents expression levels of multiple samples of one gene and an edge connecting two nodes reflects the correlation level between the two corresponding genes in the network according to the Pearson correlation coefficient. Biological networks made in this manner are generally found to adhere to a scale-free structural nature, that …


A Parallel Graph Sampling Algorithm For Analyzing Gene Correlation Networks, Kathryn Dempsey Cooper, Kanimathi Duraisamy, Hesham Ali, Sanjukta Bhowmick Jan 2011

A Parallel Graph Sampling Algorithm For Analyzing Gene Correlation Networks, Kathryn Dempsey Cooper, Kanimathi Duraisamy, Hesham Ali, Sanjukta Bhowmick

Interdisciplinary Informatics Faculty Publications

Effcient analysis of complex networks is often a challenging task due to its large size and the noise inherent in the system. One popular method of overcoming this problem is through graph sampling, that is extracting a representative subgraph from the larger network. The accuracy of the sample is validated by comparing the combinatorial properties of the subgraph and the original network. However, there has been little study in comparing networks based on the applications that they represent. Furthermore, sampling methods are generally applied agnostically, without mapping to the requirements of the underlying analysis. In this paper,we introduce a parallel …


An Intelligent Data-Centric Approach Toward Identification Of Conserved Motifs In Protein Sequences, Kathryn Dempsey Cooper, Benjamin Currall, Richard Hallworth, Hesham Ali Jan 2010

An Intelligent Data-Centric Approach Toward Identification Of Conserved Motifs In Protein Sequences, Kathryn Dempsey Cooper, Benjamin Currall, Richard Hallworth, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

The continued integration of the computational and biological sciences has revolutionized genomic and proteomic studies. However, efficient collaboration between these fields requires the creation of shared standards. A common problem arises when biological input does not properly fit the expectations of the algorithm, which can result in misinterpretation of the output. This potential confounding of input/output is a drawback especially when regarding motif finding software. Here we propose a method for improving output by selecting input based upon evolutionary distance, domain architecture, and known function. This method improved detection of both known and unknown motifs in two separate case studies. …


An Improved String Composition Method For Sequence Comparison, Guoquing Lu, Shunpu Zhang, Xiang Fang May 2008

An Improved String Composition Method For Sequence Comparison, Guoquing Lu, Shunpu Zhang, Xiang Fang

Biology Faculty Publications

Background: Historically, two categories of computational algorithms (alignment-based and alignment-free) have been applied to sequence comparison–one of the most fundamental issues in bioinformatics. Multiple sequence alignment, although dominantly used by biologists, possesses both fundamental as well as computational limitations. Consequently, alignment-free methods have been explored as important alternatives in estimating sequence similarity. Of the alignment-free methods, the string composition vector (CV) methods, which use the frequencies of nucleotide or amino acid strings to represent sequence information, show promising results in genome sequence comparison of prokaryotes. The existing CV-based methods, however, suffer certain statistical problems, thereby underestimating the amount of evolutionary …


Dynamic Energy Aware Task Scheduling For Periodic Tasks Using Expected Execution Time Feedback, Sachin Pawaskar, Hesham Ali Feb 2008

Dynamic Energy Aware Task Scheduling For Periodic Tasks Using Expected Execution Time Feedback, Sachin Pawaskar, Hesham Ali

Computer Science Faculty Proceedings & Presentations

Scheduling dependent tasks is one of the most challenging problems in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. An interesting application of scheduling is in the area of energy awareness for mobile battery operated devices where minimizing the energy utilized is the most important scheduling policy consideration. A number of heuristics have been developed for this consideration. In this paper, we study the scheduling problem for a particular battery model. In the proposed work, we show how to enhance a well know approach of accounting for …


On The Tradeoff Between Speedup And Energy Consumption In High Performance Computing – A Bioinformatics Case Study, Sachin Pawaskar, Hesham Ali Jan 2008

On The Tradeoff Between Speedup And Energy Consumption In High Performance Computing – A Bioinformatics Case Study, Sachin Pawaskar, Hesham Ali

Computer Science Faculty Proceedings & Presentations

High Performance Computing has been very useful to researchers in the Bioinformatics, Medical and related fields. The bioinformatics domain is rich in applications that require extracting useful information from very large and continuously growing sequence of databases. Automated techniques such as DNA sequencers, DNA microarrays & others are continually growing the dataset that is stored in large public databases such as GenBank and Protein DataBank. Most methods used for analyzing genetic/protein data have been found to be extremely computationally intensive, providing motivation for the use of powerful computers or systems with high throughput characteristics. In this paper, we provide a …


A Spatial Sirs Boolean Network Model For The Spread Of H5n1 Avian Influenza Virus Among Poultry Farms, Alexander Kasyanov, Leona Kirkland, Mihaela Teodora Matache Jan 2008

A Spatial Sirs Boolean Network Model For The Spread Of H5n1 Avian Influenza Virus Among Poultry Farms, Alexander Kasyanov, Leona Kirkland, Mihaela Teodora Matache

Mathematics Faculty Proceedings & Presentations

To predict the spread of Avian Influenza we propose a synchronous Susceptible-Infected-Recovered-Susceptible (SIRS) Boolean network of poultry farms, using probabilistic Boolean rules. Gravity models from transportation theory are used for the probability of infection of a node in one time step, taking into account farm sizes, distances be- tween farms, and mean distance travelled by birds. Basic reproduction numbers are computed analytically and numerically. The dynamics of the network are analyzed and various statistics considered such as number of infected nodes or time until eradication of the epidemic. We conclude that mostly when large farms (eventually) become infected the epidemic …


Expression Of Epstein-Barr Virus (Ebv) Dna And Cloned Dna Fragments In Human Lymphocytes Following Sendai Virus Envelope-Mediated Gene Transfer, David J. Volsky, Thomas Gross, Faruk Sinangil, Charles Kuszynski, Ronald Bartzatt, Timothy Dambaugh, Elliott Kieff Oct 1984

Expression Of Epstein-Barr Virus (Ebv) Dna And Cloned Dna Fragments In Human Lymphocytes Following Sendai Virus Envelope-Mediated Gene Transfer, David J. Volsky, Thomas Gross, Faruk Sinangil, Charles Kuszynski, Ronald Bartzatt, Timothy Dambaugh, Elliott Kieff

Chemistry Faculty Proceedings & Presentations

Purified EBV DNA and cloned DNA fragments were trapped in Sendai virus (SV) envelopes during envelope reconstitution. The DNA-loaded reconstituted envelopes (RSVE/DNA) served as gene-transfer vehicles using the capability of RSVE to fuse with normal and tumor cells. The efficiency of RSVE-mediated EBV DNA transfer into lymphoid tumor cells and fresh human lymphocytes was 5-10% of the enveloped 3H-labeled EcoRI fragment B of EBV DNA. Purified intracellular EBV (B95-8 strain) DNA induced EBV nuclear antigen (EBNA) in 0.2-1% of human lymphocytes, transiently stimulated cellular DNA synthesis, but did not fully transform cells. Cloned Sal I F1 fragment [approximately equal to …