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

Digital Commons Network™

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

Wright State University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 4711 - 4740 of 7045

Full-Text Articles in Entire DC Network

Clustering Similarity Comparison Using Density Profiles, Eric Bae, James Bailey, Guozhu Dong Jan 2006

Clustering Similarity Comparison Using Density Profiles, Eric Bae, James Bailey, Guozhu Dong

Kno.e.sis Publications

The unsupervised nature of cluster analysis means that objects can be clustered in many ways, allowing different clustering algorithms to generate vastly different results. To address this, clustering comparison methods have traditionally been used to quantify the degree of similarity between alternative clusterings. However, existing techniques utilize only the point memberships to calculate the similarity, which can lead to unintuitive results. They also cannot be applied to analyze clusterings which only partially share points, which can be the case in stream clustering. In this paper we introduce a new measure named ADCO, which takes into account density profiles for each …


An Online Discriminative Approach To Background Subtraction, Li Cheng, Shaojun Wang, Terry Caelli Jan 2006

An Online Discriminative Approach To Background Subtraction, Li Cheng, Shaojun Wang, Terry Caelli

Kno.e.sis Publications

We present a simple, principled approach to detecting foreground objects in video sequences in real-time. Our method is based on an on-line discriminative learning technique that is able to cope with illumination changes due to discontinuous switching, or illumination drifts caused by slower processes such as varying time of the day. Starting from a discriminative learning principle, we derive a training algorithm that, for each pixel, computes a weighted linear combination of selected past observations with time-decay. We present experimental results that show the proposed approach outperforms existing methods on both synthetic sequences and real video data.


Graduate Course Descriptions, 2006 Winter, Wright State University Jan 2006

Graduate Course Descriptions, 2006 Winter, Wright State University

Course Descriptions

Wright State University graduate course descriptions from Winter 2006.


Formalizing Ontology Alignment And Its Operations With Category Theory, Antoine Zimmermann, Markus Krotzsch, Jerome Euzenat, Pascal Hitzler Jan 2006

Formalizing Ontology Alignment And Its Operations With Category Theory, Antoine Zimmermann, Markus Krotzsch, Jerome Euzenat, Pascal Hitzler

Computer Science and Engineering Faculty Publications

An ontology alignment is the expression of relations between different ontologies. In order to view alignments independently from the language expressing ontologies and from the techniques used for finding the alignments, we use a category-theoretical model in which ontologies are the objects. We introduce a categorical structure, called V-alignment, made of a pair of morphisms with a common domain having the ontologies as codomain. This structure serves to design an algebra that describes formally what are ontology merging, alignment composition, union and intersection using categorical constructions. This enables combining alignments of various provenance. Although the desirable properties of this algebra …


Academic Data Series, 2005-06 Edition, Office Of The Controller, Wright State University Jan 2006

Academic Data Series, 2005-06 Edition, Office Of The Controller, Wright State University

Academic Data Series

A compilation of statistics extracted from the University's Banner System and Ohio Department of Higher Education resources for 2005-2006.


Ceg 490/690-01: Technology-Based Ventures, Forouzan Golshani, S. Narayanan Jan 2006

Ceg 490/690-01: Technology-Based Ventures, Forouzan Golshani, S. Narayanan

Computer Science & Engineering Syllabi

No abstract provided.


Cs 205-04,05,06: Computer Literacy And Office Automation, Terri Bauer Jan 2006

Cs 205-04,05,06: Computer Literacy And Office Automation, Terri Bauer

Computer Science & Engineering Syllabi

No abstract provided.


Assessment Of The Technology Of Genetic Modification In Light Of Its Socio-Economic Implications, Valentina Lootens Jan 2006

Assessment Of The Technology Of Genetic Modification In Light Of Its Socio-Economic Implications, Valentina Lootens

Masters Culminating Experiences (1993-2011)

Since Watson and Crick discovered the “double helix” in 1953, the arguments about the benefits and danger of genetic modification remain largely unanswered, particularly in the relation to food supply. Today, genetic modification or genetic engineering are global issues. Governments, scientific organizations, corporations, research institutions, and scholars hotly dispute the advantages and disadvantages of GM technology. However, unfortunately, the population at large is left in darkness about this new technology and its consequences for human health, environment and society. Moreover, genetic engineering creates a special problem: unlike many new technologies it is irreversible. Once introduced into the food chain, GM …


Robust Shape Design Techniques For Steady-State Metal Forming Processes, Jalaja Repalle Jan 2006

Robust Shape Design Techniques For Steady-State Metal Forming Processes, Jalaja Repalle

Browse all Theses and Dissertations

Metal forming is a process that transforms a simple shape of a workpiece into a predetermined complex shape through the application of compressive/tensile forces exerted by dies. In the design of a forming process, the only factors that are known are the final component shape and the material with which it is to be made. Then the engineer has to design a process to make defect-free product, subject to limitations of shape, material properties, cost, time, and other such factors. The design cycle can be enhanced if performance sensitivity information is available that could be used with any commercially available …


Driving Deep Semantics In Middleware And Networks: What, Why And How?, Amit P. Sheth Jan 2006

Driving Deep Semantics In Middleware And Networks: What, Why And How?, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.


Knowledge Modeling And Its Application In Life Sciences: A Tale Of Two Ontologies, Satya S. Sahoo, Christopher Thomas, Amit P. Sheth, William S. York, Samir Tartir Jan 2006

Knowledge Modeling And Its Application In Life Sciences: A Tale Of Two Ontologies, Satya S. Sahoo, Christopher Thomas, Amit P. Sheth, William S. York, Samir Tartir

Kno.e.sis Publications

High throughput glycoproteomics, similar to genomics and proteomics, involves extremely large volumes of distributed, heterogeneous data as a basis for identification and quantification of a structurally diverse collection of biomolecules. The ability to share, compare, query for and most critically correlate datasets using the native biological relationships are some of the challenges being faced by glycobiology researchers. As a solution for these challenges, we are building a semantic structure, using a suite of ontologies, which supports management of data and information at each step of the experimental lifecycle. This framework will enable researchers to leverage the large scale of glycoproteomics …


Show Me What You Mean! Exploiting Domain Semantics In Ontology Visualization, Ravi Pavagada, Christopher Thomas, Amit P. Sheth, William S. York Jan 2006

Show Me What You Mean! Exploiting Domain Semantics In Ontology Visualization, Ravi Pavagada, Christopher Thomas, Amit P. Sheth, William S. York

Kno.e.sis Publications

Ontologies build the backbone for many life-sciences applications. These ontologies, however, are represented in XML based languages that are meant for machine-consumption and hence are difficult for humans to comprehend. For a meaningful visualization of these ontologies, it is important that the display of entities and relationships captures the cognitive representation of the domain as perceived by the domain experts. In this paper we present OntoVista, an ontology visualization tool that is adaptable to the needs of different domains, especially in the life sciences. While keeping the graph structures as the predominant model, we provide a semantically enhanced graph display …


Horizontal Subsurface Flow Constructed Wetlands For On-Site Wastewater Treatment, Boyd C. Hoddinott Jan 2006

Horizontal Subsurface Flow Constructed Wetlands For On-Site Wastewater Treatment, Boyd C. Hoddinott

Master of Public Health Program Student Publications

Horizontal subsurface flow constructed wetlands (SSFCWs) are being used worldwide to treat wastewater from a variety of sources. An extensive literature review was conducted to update the current state of scientific knowledge on the performance of SSFCWs for domestic wastewater treatment. This review documented good treatment efficiency for the five commonly measured parameters (TSS, BOD, nitrogen, phosphorus, and fecal coliforms).

An attempt at a Meta analysis turned up a myriad of problems preventing a proper statistical review. These include lack of adherence to standard methods for effluent analysis, varying metrics for reporting treatment efficiency, variability in the nitrogen species which …


Investigating The Male-Driven Evolution Hypothesis Using Human AluRepeat Elements, Sridhar Ramachandran Jan 2006

Investigating The Male-Driven Evolution Hypothesis Using Human AluRepeat Elements, Sridhar Ramachandran

Browse all Theses and Dissertations

Thousands of copies of short interspersed repeats (SINEs) are scattered essentially ran-domly through the human genome. Although copies of each repeat subfamily are identical at the time of their insertion, they become subject to individual substitutions after insertion. As the relative time of insertion is known for many of these repeats, such "junk DNA" can be used to provide a sizeable number of time-series data points for studying substitution effects in a variety of genomic contexts. This dissertation specifically discusses the usefulness of the Alufamily of SINE repeats towards addressing open problems in genomics, population genetics, and biology in …


A Computational Framework For Analyzing Chemical Modification And Limited Proteolysis Experimental Data Used For High Confidence Protein Structure Prediction, Paul E. Anderson Jan 2006

A Computational Framework For Analyzing Chemical Modification And Limited Proteolysis Experimental Data Used For High Confidence Protein Structure Prediction, Paul E. Anderson

Browse all Theses and Dissertations

Prediction of protein tertiary structure based on amino acid sequence is one of the most challenging open questions in computational molecular biology. Experimental methods for protein structure determination remain relatively time consuming and expensive, and are not applicable to all proteins. While a diverse array of algorithms have been developed for prediction of protein structure from amino acid sequence information, the accuracy and reliability of these methods are not yet comparable to experimental structure determination techniques. Computational models of protein structure can, however, be improved by the incorporation of experimental information. Relatively rapid and inexpensive protein modification experiments can be …


Cs 340-01: Programming Language Workshop In Java, Ronald F. Taylor Jan 2006

Cs 340-01: Programming Language Workshop In Java, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to work independently to learn the Java language and solve a set of programming problems assigned to you using latest Java SDK available at http://java.sun.com or other software as approved by the instructor. There are no exams. We officially meet only once in a quarter. However, I will be available in the posted office hours for clarifications and general discussion of the programming assignments. Do not expect support in debugging badly documented code.


Cs 480/680-01: Comparative Programming Languages, Michael L. Raymer Jan 2006

Cs 480/680-01: Comparative Programming Languages, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.


Cs 740-01: Algorithms, Complexity And The Theory Of Computability, Thomas Sudkamp Jan 2006

Cs 740-01: Algorithms, Complexity And The Theory Of Computability, Thomas Sudkamp

Computer Science & Engineering Syllabi

No abstract provided.


Cs 790-01: Introduction To Parallel Algorithms, Natsuhiko Futamura Jan 2006

Cs 790-01: Introduction To Parallel Algorithms, Natsuhiko Futamura

Computer Science & Engineering Syllabi

Low-cost parallel computers such as PC clusters are becoming available, and many previously unsolvable problems can be solved using such computers. However, designing algorithms that perform well on parallel computers is often challenging. The focus of this course is on learning how to design algorithms for parallel computers and how to evaluate them.


Cs 142-01: Computer Programming Ii, Eric Maston Jan 2006

Cs 142-01: Computer Programming Ii, Eric Maston

Computer Science & Engineering Syllabi

This course provides a continuation to the general introduction of computer programming begun in CS 141. Examples from and applications to a broad range of problems are given. The concepts covered will be applied to the Java programming language. (Students must register for both lecture and one laboratory section.)


Cs 240-01: Introduction To Computer Science I, L. Jane Lin Jan 2006

Cs 240-01: Introduction To Computer Science I, L. Jane Lin

Computer Science & Engineering Syllabi

This course is the first in the three course sequence "Introduction to Computer Science" offered by the Computer Science department at WSU. This course presents a general introduction to C++ programming language. It introduces the fundamental capabilities of C++ language as a problem solving tool. Topics include data representation, debugging and program verification.


Cs 242-01: Introduction To Computer Science Iii, Eric Maston Jan 2006

Cs 242-01: Introduction To Computer Science Iii, Eric Maston

Computer Science & Engineering Syllabi

This is the third and final course in the Introduction to Computer Science series. This course focuses on data structures with abstract data types, such as trees, stacks, queues, and tables.


Cs 302-01: Client Server Databases, Karen Meyer Jan 2006

Cs 302-01: Client Server Databases, Karen Meyer

Computer Science & Engineering Syllabi

No abstract provided.


Cs 241-01: Computer Science Ii, Mateen M. Rizki Jan 2006

Cs 241-01: Computer Science Ii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.


Cs 701-01: Database Systems And Design, Kenneth Melendez Jan 2006

Cs 701-01: Database Systems And Design, Kenneth Melendez

Computer Science & Engineering Syllabi

No abstract provided.


Cs 765-01: Foundations Of Neurocomputation, Mateen M. Rizki Jan 2006

Cs 765-01: Foundations Of Neurocomputation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course is designed to help you develop a solid understanding of neural network algorithms and architectures. At the end of this course you should be able to read and critically evaluate most neural network papers published in major journals, (e.g. IEEE Transaction on Neural Networks, Neural Networks, and Neural Computation). In addition, you should be able to implement a broad range of network architectures and learning algorithms for a variety of applications.


Cs 317-01: Numerical Methods For Digital Computers - Ii, Ronald F. Taylor Jan 2006

Cs 317-01: Numerical Methods For Digital Computers - Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

Introduction to numerical methods used in the sciences. Methods for solving matrix eigenvalue problems, initial value and boundary value problem for ordinary differential equations (ODEs). Study of standard types of partial differential equations (PDEs) with applications. Solution techniques for systems of nonlinear equations. Discussion of courses of errors in numerical methods. Special topics and applications presented as schedule permits. 4 credit hours. Prerequisites: CS 316, MTH 233, 253, or 355. Programming course prerequisites: EGR 153 or CEG 220 or CS 241.


Cs 884-01: Advanced Topics In Programming Languages, Krishnaprasad Thirunarayan Jan 2006

Cs 884-01: Advanced Topics In Programming Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

The primary focus of this course is the design and specification of the Object-Oriented language Java.


Cs 208-01: Computer Programming For Business I, Dennis Kellermeier Jan 2006

Cs 208-01: Computer Programming For Business I, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 208 is the first of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming. This course assumes students have never written a program before.


Cs 400/600-01: Data Structures And Software Design, Michael L. Raymer Jan 2006

Cs 400/600-01: Data Structures And Software Design, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.