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

Computer Sciences Commons™

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

Wright State University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 2071 - 2100 of 2694

Full-Text Articles in Computer Sciences

Cs 415-01: Social Implications Of Computing, Leo Finkelstein Jan 2006

Cs 415-01: Social Implications Of Computing, Leo Finkelstein

Computer Science & Engineering Syllabi

CS 415 is a communication skills course using as its subject matter current salient issues associated with the social implications of computing. In addition to the course text, you will need to use certain reading materials in the library and elsewhere, and you will be responsible for using concepts and theories provided in class lectures and discussions.

Go to article

Cs 466/666-01: Introduction To Formal Languages, Thomas Sudkamp Jan 2006

Cs 466/666-01: Introduction To Formal Languages, Thomas Sudkamp

Computer Science & Engineering Syllabi

CS 466/666 is an introduction to formal language and automata theory. In this course we will examine methods for defining syntax of languages and recognizing patterns: the syntax of languages can be defined using grammars and patterns accepted by finite state machines. Along with presenting with fundamentals of these two topics, the course will develop and investigate the relationships between language definition and pattern recognition. The text will be the third edition of Languages and Machines: An Introduction to the Theory of Computer Science.

Go to article

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 …

Go to article

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 …

Go to article

Specification For Visual Requirements Of Work-Centered Software Systems, James Robert Knapp Jan 2006

Specification For Visual Requirements Of Work-Centered Software Systems, James Robert Knapp

Browse all Theses and Dissertations

Work-centered software systems function as inherent work-aiding systems. Based on the design concept for a work-centered support system (WCSS), these software systems support user tasks and goals through both direct and indirect aiding methods within the interface client. In order to ensure the coherent development and delivery of work-centered software products, WCSS visual interface requirements must be specified in order to capture the cognitive and work-aiding aspects of the user interface design. Without the ability to specify such original requirements, the probability of creating an accurate and effective work-centered software system is significantly reduced. A new visual requirements specification language …

Go to article

A Field Programmable Gate Array Architecture For Two-Dimensional Partial Reconfiguration, Fei Wang Jan 2006

A Field Programmable Gate Array Architecture For Two-Dimensional Partial Reconfiguration, Fei Wang

Browse all Theses and Dissertations

Reconfigurable machines can accelerate many applications by adapting to their needs through hardware reconfiguration. Partial reconfiguration allows the reconfiguration of a portion of a chip while the rest of the chip is busy working on tasks. Operating system models have been proposed for partially reconfigurable machines to handle the scheduling and placement of tasks. They are called OS4RC in this dissertation. The main goal of this research is to address some problems that come from the gap between OS4RC and existing chip architectures and the gap between OS4RC models and practical applications. Some existing OS4RC models are based on an …

Go to article

Openws-Transaction: Enabling Reliable Web Service Transactions, Ivan Vasquez, John A. Miller, Kunal Verma, Amit P. Sheth Dec 2005

Openws-Transaction: Enabling Reliable Web Service Transactions, Ivan Vasquez, John A. Miller, Kunal Verma, Amit P. Sheth

Kno.e.sis Publications

OpenWS-Transaction is an open source middleware that enables Web services to participate in a distributed transaction as prescribed by the WS-Coordination and WS-Transaction set of specifications. Central to the framework are the Coordinator and Participant entities, which can be integrated into existing services by introducing minimal changes to application code. OpenWS-Transaction allows transaction members to recover their original state in case of operational failure by leveraging techniques in logical logging and recovery at the application level. Depending on transaction style, system recovery may involve restoring key application variables and replaying uncommitted database activity. Transactions are assumed to be defined in …

Go to article

Demonstrating Dynamic Configuration And Execution Of Web Processes, Karthik Gomadam, Kunal Verma, Amit P. Sheth, John A. Miller Dec 2005

Demonstrating Dynamic Configuration And Execution Of Web Processes, Karthik Gomadam, Kunal Verma, Amit P. Sheth, John A. Miller

Kno.e.sis Publications

Web processes are next generation workflows on the web, created using Web services. In this paper we demonstrate the METEOR-S Configuration and Execution Environment (MCEE) system. It will illustrate the capabilities of the system to a) Discover partners b) Optimize partner selection using constraint analysis, c) Perform interaction protocol and data mediation. A graphical execution monitor to monitor the various phases of execution will be used to demonstrate various aspects of the system.

Go to article

Discovering Informative Connection Subgraphs In Multi-Relational Graphs, Cartic Ramakrishnan, William Milnor, Matthew Perry, Amit P. Sheth Dec 2005

Discovering Informative Connection Subgraphs In Multi-Relational Graphs, Cartic Ramakrishnan, William Milnor, Matthew Perry, Amit P. Sheth

Kno.e.sis Publications

Discovering patterns in graphs has long been an area of interest. In most approaches to such pattern discovery either quantitative anomalies, frequency of substructure or maximum flow is used to measure the interestingness of a pattern. In this paper we introduce heuristics that guide a subgraph discovery algorithm away from banal paths towards more "informative" ones. Given an RDF graph a user might pose a question of the form: "What are the most relevant ways in which entity X is related to entity Y?" the response to which is a subgraph connecting X to Y. We use our heuristics to …

Go to article

Ontoqa: Metric-Based Ontology Quality Analysis, Samir Tartir, I. Budak Arpinar, Michael Moore, Amit P. Sheth, Boanerges Aleman-Meza Nov 2005

Ontoqa: Metric-Based Ontology Quality Analysis, Samir Tartir, I. Budak Arpinar, Michael Moore, Amit P. Sheth, Boanerges Aleman-Meza

Kno.e.sis Publications

As the Semantic Web gains importance for sharing knowledge on the Internet this has lead to the development and publishing of many ontologies in different domains. When trying to reuse existing ontologies into their applications, users are faced with the problem of determining if an ontology is suitable for their needs. In this paper, we introduce OntoQA, an approach that analyzes ontology schemas and their populations (i.e. knowledgebases) and describes them through a well defined set of metrics. These metrics can highlight key characteristics of an ontology schema as well as its population and enable users to make an informed …

Go to article

Semantics For Scientific Experiments And The Web: The Implicit, The Formal And The Powerful, Amit P. Sheth Nov 2005

Semantics For Scientific Experiments And The Web: The Implicit, The Formal And The Powerful, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Optimal Adaptation In Autonomic Web Processes With Inter-Service Dependencies, Kunal Verma, Prashant Doshi, Karthik Gomadam, John A. Miller, Amit P. Sheth Nov 2005

Optimal Adaptation In Autonomic Web Processes With Inter-Service Dependencies, Kunal Verma, Prashant Doshi, Karthik Gomadam, John A. Miller, Amit P. Sheth

Kno.e.sis Publications

We present methods for optimally adapting Web processes to exogenous events while preserving inter-service dependencies. For example, in a supply chain process, orders placed by the manufacturer may get delayed in arriving. In response to this event, the manufacturer has the choice of either waiting out the delay or changing the supplier.

Go to article

The Screech Owl Reasoner - Scalable Approximate Abox Reasoning With Owl, Pascal Hitzler, Denny Vrandecic Nov 2005

The Screech Owl Reasoner - Scalable Approximate Abox Reasoning With Owl, Pascal Hitzler, Denny Vrandecic

Computer Science and Engineering Faculty Publications

We present a preliminary version of the approximate OWL reasoning system SCREECH. It builds on the KAON2 system and performs OWL ABox reasoning in an approximate manner. It trades soundness of reasoning for efficiency, with resulting polynomial worst-case data complexity. It has been developed for use in time-critical applications where quick response time is more important than a full guarantee of correctness of answers. The theoretical background for the system is explained in [Hitzler and Vrandecic, 2005] and is being presented at the conference.

Go to article

Dlp Isn't So Bad After All, Peter Haase, Markus Krotzsch, York Sure, Rudi Studer, Pascal Hitzler Nov 2005

Dlp Isn't So Bad After All, Peter Haase, Markus Krotzsch, York Sure, Rudi Studer, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We discuss some of the recent controversies concerning the DLP fragment of OWL. We argue that it is a meaningful fragment and can serve as a basic interoperability layer between OWL and logic programming-based ontology languages.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 3, November 2005, College Of Engineering And Computer Science, Wright State University Nov 2005

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 3, November 2005, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Go to article

Modeling Fuzzy Rules With Description Logics, Sudhir Agarwal, Pascal Hitzler Nov 2005

Modeling Fuzzy Rules With Description Logics, Sudhir Agarwal, Pascal Hitzler

Computer Science and Engineering Faculty Publications

In real application scenarios, input data and knowledge is often vague. Likewise, it is often the case that exact reasoning over data is impossible due to complex dependencies between input data and target outputs. For practical applications, however, good approximations often suffice, and efficient calculation of an approximate answer is often preferable over complex processing which may take a long time to come up with an exact answer. Fuzzy logic supports both features by providing fuzzy membership functions and fuzzy IF-THEN rule bases. In this paper, we show how fuzzy membership functions and fuzzy rules can be modeled by means …

Go to article

Computing For Human Experience And Wellness, Amit P. Sheth Oct 2005

Computing For Human Experience And Wellness, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Work In Progress: The Wsu Model For Engineering Mathematics Education, Nathan W. Klingbeil, Richard Mercer, Kuldip S. Rattan, Michael L. Raymer, David B. Reynolds Oct 2005

Work In Progress: The Wsu Model For Engineering Mathematics Education, Nathan W. Klingbeil, Richard Mercer, Kuldip S. Rattan, Michael L. Raymer, David B. Reynolds

Kno.e.sis Publications

This paper summarizes progress to date on the WSU model for engineering mathematics education, an NSF funded curriculum reform initiative at Wright State University. The WSU model seeks to increase student retention, motivation and success in engineering through application-driven, just-in-time engineering math instruction. The WSU approach involves the development of a novel freshman-level engineering mathematics course EGR 101, as well as a large-scale restructuring of the engineering curriculum. By removing traditional math prerequisites and moving core engineering courses earlier in the program, the WSU model shifts the traditional emphasis on math prerequisite requirements to an emphasis on engineering motivation for …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 2, October 2005, College Of Engineering And Computer Science, Wright State University Oct 2005

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 2, October 2005, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Go to article

Cs 340: Programming Language Workshop In Java, Ronald F. Taylor Oct 2005

Cs 340: 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.

Go to article

Ceg 210: Pc Networking I, Karen Meyer Oct 2005

Ceg 210: Pc Networking I, Karen Meyer

Computer Science & Engineering Syllabi

Introduction to PC networking hardware, concepts, and technologies. Focus is on LAN Administration.

Go to article

Cs 206: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog Oct 2005

Cs 206: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog

Computer Science & Engineering Syllabi

By the end of this course, the students will have a greater depth of understanding in the areas of spreadsheets, databases, and presentation software using Microsoft Excel Access and PowerPoint.

Go to article

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp Oct 2005

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp

Computer Science & Engineering Syllabi

This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. The Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.

Go to article

Cs 242: Introduction To Computer Science Iii, Praveen Kakumanu Oct 2005

Cs 242: Introduction To Computer Science Iii, Praveen Kakumanu

Computer Science & Engineering Syllabi

This is the final course in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. It focuses on building a number of abstract data types such as stacks, queues, trees and tables. We continue to study the C++ object-oriented concepts such as Inheritance, polymorphism and template handling. We also start learning to analyze the complexity of algorithms in this course.

Go to article

Ceg 260: Digital Computer Hardware Switching Circuits, Eric Matson Oct 2005

Ceg 260: Digital Computer Hardware Switching Circuits, Eric Matson

Computer Science & Engineering Syllabi

We will discuss and cover basic digital, combinational and sequential logic systems. Labs will be used to gain valuable practical experience in implementing elementary circuits and logic designs.

Go to article

Cs 766: Evolutionary Computation, Mateen M. Rizki Oct 2005

Cs 766: Evolutionary Computation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course explores evolutionary computation from a historical, theoretical, and application viewpoint. An overview of the most common evolutionary search techniques are presented including genetic algorithms, evolutionary programming, evolutionary strategies, and genetic programming. The fundamental issues driving the choice of problem representation and specific genetic operators are discussed. Various applications of evolutionary computation to problems in control, optimization, and pattern recognition are examined.

Go to article

Cs 240: Introduction To Computer Science I, L. Jane Lin Oct 2005

Cs 240: 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.

Go to article

Cs 214: Visual Basic.Net, Roddy Keish Oct 2005

Cs 214: Visual Basic.Net, Roddy Keish

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 240: Introduction To Computer Science I, Mateen M. Rizki Oct 2005

Cs 240: Introduction To Computer Science I, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 409/609: Principles Of Artificial Intelligence, John C. Gallagher Oct 2005

Cs 409/609: Principles Of Artificial Intelligence, John C. Gallagher

Computer Science & Engineering Syllabi

Problem solving methods in artificial intelligence (AI) with emphasis on heuristic approaches. Topics include methods of representation, search, intelligent agents, planning, learning, natural language processing, logic, inference, robotics, and case-based reasoning. Three hours lecture, two hours lab.

Go to article

First Prev Next Last