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 2131 - 2160 of 2694

Full-Text Articles in Computer Sciences

Cs 208: Computer Programming For Business I, Dennis Kellermeier Oct 2005

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

Go to article

Ceg 460/660: Introduction To Software Computer Engineering, John A. Reisner Oct 2005

Ceg 460/660: Introduction To Software Computer Engineering, John A. Reisner

Computer Science & Engineering Syllabi

This course introduces established practices for engineering large-scale software systems. Emphasis is placed on both the technical and managerial aspects of software engineering, and the software development process. This includes techniques for requirements elicitation, analysis, design, testing, and project management. The course emphasizes object-oriented development with the Unified Modeling Language (UML). Hands-on experience is provided through individual homework problems and a group project.

Go to article

Ceg 724: Computer Vision I, Arthur A. Goshtasby Oct 2005

Ceg 724: Computer Vision I, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course cover basic techniques for low-level and some mid-level vision processing. The techniques include: image filtering, intensity thresholding, edge detection, 2-D shape analysis, line and circle detection, corner detection, pattern matching.

Go to article

Ceg 498: Design Experience, Thomas C. Hartrum Oct 2005

Ceg 498: Design Experience, Thomas C. Hartrum

Computer Science & Engineering Syllabi

CEG 498 (Design Experience) is a summative computer engineering design project course that builds upon previous engineering, science, mathematics and communications course work. CEG 498 projects are a minimum of two quarters in length and must be completed in groups of at least three students. Projects are selected under the guidance of the course instructor and are tailored to both student interest and formal classroom preparation. Students are evaluated both on their individual contributions as recorded in a graded engineering journals and on the quality of their collective efforts as reflected in group generated products.

Go to article

Ceg 760: Advanced Software Computer Engineering, Thomas C. Hartrum Oct 2005

Ceg 760: Advanced Software Computer Engineering, Thomas C. Hartrum

Computer Science & Engineering Syllabi

This course covers advanced topics in software engineering. Aspects of problem specification, design, verification, and evaluation are discussed. We will focus on design methods, including software patterns and software architecture, plus some advanced topics involving formal methods of software specification or evaluation using software metrics. Students will participate in team projects to apply the methods discussed.

Go to article

Cs 241: Computer Science Ii, L. Jane Lin Oct 2005

Cs 241: Computer Science Ii, L. Jane Lin

Computer Science & Engineering Syllabi

This course is the second in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. It focuses on tools for building abstract data types (using structure and class concepts in C++) and Object-Oriented Programming. We also begin the study of data structures in this course.

Go to article

Cs 340: Programming Language Workshop In C#, Krishnaprasad Thirunarayan Oct 2005

Cs 340: Programming Language Workshop In C#, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is designed as a self-study in C#. You are expected to learn the language and solve a set of programming problems assigned to you using MS Visual Studio .NET. There are no exams. We officially meet only once in the quarter. However, I will be available in the posted office hours for clarifications and discussions about the programming problems.

Go to article

Cs 415: Social Implications Of Computing, Leo Finkelstein Oct 2005

Cs 415: 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. The goal of this course is to blend social implications issues with common technical communication formats you'll need to be familiar with out in the "real world." To do this, the course is built around a research project on a social implications topic …

Go to article

Cs 480/680: Comparative Programming Languages, Michael L. Raymer Oct 2005

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

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 241: Introduction To Computer Science Ii, Praveen Kakumanu Oct 2005

Cs 241: Introduction To Computer Science Ii, Praveen Kakumanu

Computer Science & Engineering Syllabi

This course is the second in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. It focuses on tools for building abstract data types (using structure and class concepts in C++) and Object-Oriented Programming. We also begin the study of data structures in this course.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 1, September 2005, College Of Engineering And Computer Science, Wright State University Sep 2005

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 1, September 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

Ga-Facilitated Knn Classifier Optimization With Varying Similarity Measures, Michael R. Peterson, Travis E. Doom, Michael L. Raymer Sep 2005

Ga-Facilitated Knn Classifier Optimization With Varying Similarity Measures, Michael R. Peterson, Travis E. Doom, Michael L. Raymer

Kno.e.sis Publications

Genetic algorithms are powerful tools for k-nearest neighbors classifier optimization. While traditional knn classification techniques typically employ Euclidian distance to assess pattern similarity, other measures may also be utilized. Previous research demonstrates that GAs can improve predictive accuracy by searching for optimal feature weights and offsets for a cosine similarity-based knn classifier. GA-selected weights determine the classification relevance of each feature, while offsets provide alternative points of reference when assessing angular similarity. Such optimized classifiers perform competitively with other contemporary classification techniques. This paper explores the effectiveness of GA weight and offset optimization for knowledge discovery using knn classifiers with …

Go to article

Enterprise Applications Of Semantic Web: The Sweet Spot Of Risk And Compliance, Amit P. Sheth Aug 2005

Enterprise Applications Of Semantic Web: The Sweet Spot Of Risk And Compliance, Amit P. Sheth

Kno.e.sis Publications

Semantic Web is in the transition from vision and research to reality. In this early state, it is important to study the technical capabilities in the context of real-world applications, and how applications built using the Semantic Web technology meet the real market needs. Beyond push from research, it is the market pull and the ability of the technology to meet real business needs that is a key to ultimate success of any technology. In this paper, we discuss the market of Risk and Compliance which presents unique market opportunity combined with challenging technical requirements. We discuss how the Semantic …

Go to article

Ontology Learning As A Use-Case For Neural-Symbolic Integration, Pascal Hitzler, Sebastian Bader, Artur Garcez Aug 2005

Ontology Learning As A Use-Case For Neural-Symbolic Integration, Pascal Hitzler, Sebastian Bader, Artur Garcez

Computer Science and Engineering Faculty Publications

We argue that the field of neural-symbolic integration is in need of identifying application scenarios for guiding further research. We furthermore argue that ontology learning - as occurring in the context of semantic technologies - provides such an application scenario with potential for success and high impact on neural-symbolic integration.

Go to article

Integrating First-Order Logic Programs And Connectionist Systems - A Constructive Approach, Sebastian Bader, Andreas Witzel, Pascal Hitzler Aug 2005

Integrating First-Order Logic Programs And Connectionist Systems - A Constructive Approach, Sebastian Bader, Andreas Witzel, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Significant advances have recently been made concerning the integration of symbolic knowledge representation with artificial neural networks (also called connectionist systems). However, while the integration with propositional paradigms has resulted in applicable systems, the case of first-order knowledge representation has so far hardly proceeded beyond theoretical studies which prove the existence of connectionist systems for approximating first-order logic programs up to any chosen precision. Advances were hindered severely by the lack of concrete algorithms for obtaining the approximating networks which were known to exist: the corresponding proofs are not constructive in that they do not yield concrete methods for building …

Go to article

Extracting Reduced Logic Programs From Artificial Neural Networks, Jens Lehmann, Sebastian Bader, Pascal Hitzler Aug 2005

Extracting Reduced Logic Programs From Artificial Neural Networks, Jens Lehmann, Sebastian Bader, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Artificial neural networks can be trained to perform excellently in many application areas. While they can learn from raw data to solve sophisticated recognition and analysis problems, the acquired knowledge remains hidden within the network architecture and is not readily accessible for analysis or further use: Trained networks are black boxes. Recent research efforts therefore investigate the possibility to extract symbolic knowledge from trained networks, in order to analyze, validate, and reuse the structural insights gained implicitly during the training process. In this paper, we will study how knowledge in form of propositional logic programs can be obtained in such …

Go to article

Peer-To-Peer Discovery Of Semantic Associations, Matthew Perry, Maciej Janik, Cartic Ramakrishnan, Conrad Ibanez, I. Budak Arpinar, Amit P. Sheth Jul 2005

Peer-To-Peer Discovery Of Semantic Associations, Matthew Perry, Maciej Janik, Cartic Ramakrishnan, Conrad Ibanez, I. Budak Arpinar, Amit P. Sheth

Kno.e.sis Publications

The Semantic Web vision promises an extension of the current Web in which all data is annotated with machine understandable metadata. The relationship-centric nature of this data has led to the definition of Semantic Associations, which are complex relationships between resources. Semantic Associations attempt to answer queries of the form “how are resource A and resource B related?” Knowing how two entities are related is a crucial question in knowledge discovery applications. Much the same way humans collaborate and interact to form new knowledge, discovery of Semantic Associations across repositories on a peer-to-peer network can allow peers to share their …

Go to article

A Modular Approach To Document Indexing And Semantic Search, Dhanya Ravishankar, Krishnaprasad Thirunarayan, Trivikram Immaneni Jul 2005

A Modular Approach To Document Indexing And Semantic Search, Dhanya Ravishankar, Krishnaprasad Thirunarayan, Trivikram Immaneni

Kno.e.sis Publications

This paper develops a modular approach to improving effectiveness of searching documents for information by reusing and integrating mature software components such as Lucene APIs, WORDNET, LSA techniques, and domain-specific controlled vocabulary. To evaluate the practical benefits, the prototype was used to query MEDLINE database, and to locate domain-specific controlled vocabulary terms in Materials and Process Specifications. Its extensibility has been demonstrated by incorporating a spell-checker for the input query, and by structuring the retrieved output into hierarchical collections for quicker assimilation. It is also being used to experimentally explore the relationship between LSA and document clustering using 20-mini-newsgroups and …

Go to article

Faster Owl Using Split Programs, Denny Vrandecic, Pascal Hitzler Jul 2005

Faster Owl Using Split Programs, Denny Vrandecic, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Knowledge representation and reasoning on the Semantic Web is done by means of ontologies. While the quest for suitable ontology languages is still ongoing, OWL [5] has been established as a core standard. It comes in three flavours, as OWL Full, OWL DL and OWL Lite, where OWL Full contains OWL DL, which in turn contains OWL Lite. The latter two coincide semantically with certain description logics and can thus be considered fragments of first-order predicate logic.

Go to article

On Embedding Machine-Processable Semantics Into Documents, Krishnaprasad Thirunarayan Jul 2005

On Embedding Machine-Processable Semantics Into Documents, Krishnaprasad Thirunarayan

Kno.e.sis Publications

Most Web and legacy paper-based documents are available in human comprehensible text form, not readily accessible to or understood by computer programs. Here, we investigate an approach to amalgamate XML technology with programming languages for representational purposes that can enhance traceability, thereby facilitating semiautomatic extraction and update. Specifically, we propose a modular technique to embed machine-processable semantics into a text document with tabular data via annotations, resulting sometimes in ill-formed XML fragments, and evaluate this technique vis a vis document querying, manipulation, and integration. The ultimate aim is to be able to author and extract human-readable and machine-comprehensible parts of …

Go to article

Cs 208: Computer Programming For Business I, Dennis Kellermeier Jul 2005

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

Go to article

Cs 466/666: Introduction To Formal Languages, Krishnaprasad Thirunarayan Jul 2005

Cs 466/666: Introduction To Formal Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course introduces the theory of formal languages and automata. The primary focus is on the two methods of defining languages: using generators (e.g., grammars/regular expressions) and using recognizers (e.g., finite state machines). Along with presenting the fundamentals, this course will develop and examine relationships among the various specification methods for the regular languages and the context-free languages, in detail. Overall, we plan to cover the first seven chapters of the text book.

Go to article

Morphisms In Context, Markus Krotzsch, Guo-Qiang Zhang, Pascal Hitzler Jul 2005

Morphisms In Context, Markus Krotzsch, Guo-Qiang Zhang, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Morphisms constitute a general tool for modelling complex relationships between mathematical objects in a disciplined fashion. In Formal Concept Analysis (FCA), morphisms can be used for the study of structural properties of knowledge represented in formal contexts, with applications to data transformation and merging. In this paper we present a comprehensive treatment of some of the most important morphisms in FCA and their relationships, including dual bonds, scale measures, infomorphisms, and their respective relations to Galois connections. We summarize our results in a concept lattice that cumulates the relationships among the considered morphisms. The purpose of this work is to …

Go to article

A Semantic Template Based Designer For Semantic Web Processes, Ranjit Mulye, John A. Miller, Kunal Verma, Karthik Gomadam, Amit P. Sheth Jul 2005

A Semantic Template Based Designer For Semantic Web Processes, Ranjit Mulye, John A. Miller, Kunal Verma, Karthik Gomadam, Amit P. Sheth

Kno.e.sis Publications

The growing popularity of service oriented computing based on Web services standards is creating a need for paradigms to represent and design business processes. Significant work has been done in the representation aspects with regards to WSBPEL. However, design and modeling of business processes is still an open issue. In this paper, we present a novel designer for business processes, which allows for intuitive modeling of Web processes, as well as using a template based approach for semi-automatically integrating partners either at design time or at deployment time. This work has been done as part of the METEOR-S project, which …

Go to article

Cs 214: Object Oriented Programming, Roddy Keish Jul 2005

Cs 214: Object Oriented Programming, Roddy Keish

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 242: Computer Science Iii, Mateen M. Rizki Jul 2005

Cs 242: Computer Science Iii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 205: Computer Literacy And Office Automation, Terri Bauer Jul 2005

Cs 205: Computer Literacy And Office Automation, Terri Bauer

Computer Science & Engineering Syllabi

•To understand basic computer operations and the principal components of a computer and connected peripheral devices
•To understand and examine current operating systems, software utilities, device drivers and
application software
•To define and understand current storage technology and learn about logical file storage and management
•To become proficient in using:
-Windows XP
-Spreadsheet Applications
-Database Applications
-Presentation Graphics Applications
-To understand the basics of email

Go to article

Cs 400/600: Data Structures And Software Design, Jack Jean Jul 2005

Cs 400/600: Data Structures And Software Design, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 415: Social Implications Of Computing, Leo Finkelstein Jul 2005

Cs 415: 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 480/680: Comparative Languages, Krishnaprasad Thirunarayan Jul 2005

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modern programming languages. For concreteness, we study the details of an object-oriented language (e.g. Java), and a functional language (e.g., Scheme). The overall goal is to enable comparison and evaluation of existing languages. The programming assignments will be coded in Java 5 and in Scheme.

Go to article

First Prev Next Last