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 1051 - 1080 of 2694

Full-Text Articles in Computer Sciences

Ceg 416-01: Matrix Computations, Ronald F. Taylor Oct 2010

Ceg 416-01: Matrix Computations, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is a survey of numerical methods in linear algebra for application to problems in engineering and the sciences. Emphasis is on using modern software tools on high performance computing systems. This course covers the mathematics of linear equations, eigenvalue problems, singular value decomposition, and least squares. Material covered will be relevant to applications areas such as structural analysis, heat transfer, neural networks, mechanical vibrations, and image processing in biomedical engineering. A familiarity with MATLAB is useful, and the ability to program in languages such as C/C++ or Fortran is very important. A basic knowledge of matrix algebra is …

Go to article

Ceg 355-01: Introduction To The Design Of Information Technology Systems, Thomas C. Hartrum Oct 2010

Ceg 355-01: Introduction To The Design Of Information Technology Systems, Thomas C. Hartrum

Computer Science & Engineering Syllabi

Introduction to the design of information systems comprising modern technologies such as SQL database programming, networks, and distributed computing with CORBA, electronic and hypertext (HTML) documents, and multimedia.

Go to article

Ceg 402/602-01: Introduction To Computer Communication, Bin Wang Oct 2010

Ceg 402/602-01: Introduction To Computer Communication, Bin Wang

Computer Science & Engineering Syllabi

This course provides an introduction to basic concepts of communication networks, different types of networks, protocols over different layers, and network applications through lectures, labs, homework, and reading on relevant materials. You will
•Understand networking principles, protocols, and technologies.
•Understand some design and performance issues involved in providing a
network service.
•Acquire background for supporting e-commerce, e-government, and e-education.
•Gain hands-on experience with programming techniques for network
protocols.
•Obtain background for original research in computer networks.

Go to article

Ceg 460/660-01: Introduction To Software Computer Engineering, Thomas C. Hartrum Oct 2010

Ceg 460/660-01: Introduction To Software Computer Engineering, Thomas C. Hartrum

Computer Science & Engineering Syllabi

This course is concerned with the techniques of designing and constructing large programs. Some of the required basic concepts necessarily have to be developed using small programs as examples. To this extent, we also study programming-in-the-small. The overall objectives are to present an overview of issues in the development of software, to discuss terminology, to illustrate via example case studies, and to give sufficiently detailed advice on how to develop quality software. Hands-on experience is emphasized through the use of homework and a class project.

Go to article

Ceg 453/653-01: Embedded Systems, Jack Jean Oct 2010

Ceg 453/653-01: Embedded Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 360/560-01: Digital System Design, Travis E. Doom Oct 2010

Ceg 360/560-01: Digital System Design, Travis E. Doom

Computer Science & Engineering Syllabi

Design of digital systems. Topics include flip-flops, registers, counters, programmable logic devices, memory devices, register-level design, and microcomputer system organization. Students must show competency in the design of digital systems. 3 hours lecture, 2 hours lab. Prerequisite: CEG260.

Go to article

Ceg 420/620-01: Computer Architecture, Jack Jean Oct 2010

Ceg 420/620-01: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 206: Computer Software Productivity Tools, John P. Herzog Oct 2010

Cs 206: Computer Software Productivity Tools, John P. Herzog

Computer Science & Engineering Syllabi

Focus on learning MS Office software applications including advanced topics in spreadsheets, database and presentation graphics, using a case study approach where critical thinking and problem solving skills are required. Computer concepts are integrated throughout the course to provide an understanding of advanced computing, the latest technological advances and how they are used in industry. Ethics and issues encountered in business are discussed to challenge students on societal impact of technology.

Go to article

Cs 240: Computer Programming - I, Dale E. Nelson Oct 2010

Cs 240: Computer Programming - I, Dale E. Nelson

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on problem solving and object oriented programming. This course provides a general introduction to the fundamentals of computer science and programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. The concepts covered will be applied to the Java programming language. Students must register for both lecture and one laboratory section. 4 credit hours.

Go to article

Cs 340: Programming Language Workshop In Python, Krishnaprasad Thirunarayan Oct 2010

Cs 340: Programming Language Workshop In Python, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is designed as a self-study in Python. You are expected to learn the language and solve a set of programming problems assigned to you from Budd's text using Python available from http://www.python.org. 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 400/600: Data Structures And Software Design, Meilin Liu Oct 2010

Cs 400/600: Data Structures And Software Design, Meilin Liu

Computer Science & Engineering Syllabi

This is a fundamental course for students majoring in Computer Science. Students will learn: basic algorithm analysis techniques; asymptotic complexity; big-0 and big-Omega notations; efficient algorithms for discrete structures including lists, trees, stacks, and graphs; fundamental computing algorithms including sorting, searching, and hashing techniques.

Go to article

Cs 410/610: Theoretical Foundations Of Computing, Pascal Hitzler Oct 2010

Cs 410/610: Theoretical Foundations Of Computing, Pascal Hitzler

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan Oct 2010

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modem 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 and in Scheme.

Go to article

Cs 705: Introduction To Data Mining, Guozhu Dong Oct 2010

Cs 705: Introduction To Data Mining, Guozhu Dong

Computer Science & Engineering Syllabi

Data mining is concerned with the extraction of novel and useful knowledge from large amounts of data. This course introduces and studies the fundamental concepts, issues, tasks and techniques of data mining. Topics include data preparation and feature selection, association rules, classification, clustering, evaluation and validation, scalability, mining of spatial/text/sequence/graph/time-series etc data, privacy, data mining applications, and other topics of interest. 3 hours lecture, 2 hours lab.

Go to article

Cs 466/666: Introduction To Formal Languages, Guozhu Dong Oct 2010

Cs 466/666: Introduction To Formal Languages, Guozhu Dong

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 the patterns accepted by finite state machines. Along with presenting the 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, by Thomas Sudkamp.

Go to article

Cs 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan Oct 2010

Cs 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course deals with the theory and practice of compiler design. Topics emphasized are scanning and parsing. If time permits, semantic analysis will also be covered.

Go to article

Ceg 360/560-01: Digital System Design, Travis E. Doom Oct 2010

Ceg 360/560-01: Digital System Design, Travis E. Doom

Computer Science & Engineering Syllabi

Design of digital systems. Topics include flip-flops, registers, counters, programmable logic devices, memory devices, register-level design, and microcomputer system organization. Students must show competency in the design of digital systems. 3 hours lecture, 2 hours lab. Prerequisite: CE0260.

Go to article

Ceg 436/636-01: Mobile Computing, Yong Pei Oct 2010

Ceg 436/636-01: Mobile Computing, Yong Pei

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 724-01: Computer Vision I, Arthur A. Goshtasby Oct 2010

Ceg 724-01: Computer Vision I, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course covers basic algorithms for low-level and mid-level vision. The algorithms deal with edge detection and image segmentation, feature detection and matching, image registration, and image stitching. Also covered in the course are computer vision applications to computer graphics, such as computational photography and image-based rendering.

Go to article

Cs 302-01: Introduction To Oracle Sql Databases, Karen Meyer Oct 2010

Cs 302-01: Introduction To Oracle Sql Databases, Karen Meyer

Computer Science & Engineering Syllabi

Relational client server database design and access techniques. Includes building database tables, writing SQL and PL/SQL statements and programs and developing user interfaces using forms.

Go to article

Cs 499/699: Cloud Computing, Keke Chen Oct 2010

Cs 499/699: Cloud Computing, Keke Chen

Computer Science & Engineering Syllabi

This is an introductory course to cloud computing. In this course, we will explore a few aspects of cloud computing virtualization, security & privacy, Amazon Web Services, and interactive web-based applications. Students are expected in the class discussion is strongly encouraged. Guest speakers might be invited for some particular topics. (3 Hours)

Go to article

Cs 740: Algorithms, Complexity And The Theory Of Computability, Michael L. Raymer Oct 2010

Cs 740: Algorithms, Complexity And The Theory Of Computability, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 242: Computer Programming Iii, Mateen M. Rizki Oct 2010

Cs 242: Computer Programming Iii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

On Circulant And Two-Circulant Weighing Matrices, K. T. Arasu, I. S. Kotsireast, C. Koukouvinos, Jennifer Seberry Oct 2010

On Circulant And Two-Circulant Weighing Matrices, K. T. Arasu, I. S. Kotsireast, C. Koukouvinos, Jennifer Seberry

Mathematics and Statistics Faculty Publications

We employ theoretical and computational techniques to construct new weighing matrices constructed from two circulants. In particular, we con- struct W (148, 144), W (152, 144), W (156, 144) which are listed as open in the second edition of the Handbook of Combinatorial Designs. We also fill a missing entry in Strassler’s table with answer “YES”, by constructing a circulant weighing matrix of order 142 with weight 100.

Go to article

A Taxonomy-Based Model For Expertise Extrapolation, Delroy H. Cameron, Boanerges Aleman-Meza, Ismailcem Budak Arpinar, Sheron L. Decker, Amit P. Sheth Sep 2010

A Taxonomy-Based Model For Expertise Extrapolation, Delroy H. Cameron, Boanerges Aleman-Meza, Ismailcem Budak Arpinar, Sheron L. Decker, Amit P. Sheth

Kno.e.sis Publications

While many ExpertFinder applications succeed in finding experts, their techniques are not always designed to capture the various levels at which expertise can be expressed. Indeed, expertise can be inferred from relationships between topics and subtopics in a taxonomy. The conventional wisdom is that expertise in subtopics is also indicative of expertise in higher level topics as well. The enrichment of Expertise Profiles for finding experts can therefore be facilitated by taking domain hierarchies into account. We present a novel semantics-based model for finding experts, expertise levels and collaboration levels in a peer review context, such as composing a Program …

Go to article

Ranking Documents Semantically Using Ontological Relationships, Boanerges Aleman-Meza, I. Budak Arpinar, Mustafa V. Nural, Amit P. Sheth Sep 2010

Ranking Documents Semantically Using Ontological Relationships, Boanerges Aleman-Meza, I. Budak Arpinar, Mustafa V. Nural, Amit P. Sheth

Kno.e.sis Publications

Although arguable success of today’s keyword based search engines in certain information retrieval tasks, ranking search results in a meaningful way remains an open problem. In this work, the goal is to use of semantic relationships for ranking documents without relying on the existence of any specific structure in a document or links between documents. Instead, real-world entities are identified and the relevance of documents is determined using relationships that are known to exist between the entities in a populated ontology. We introduce a measure of relevance that is based on traversal and the semantics of relationships that link entities …

Go to article

Pattern Space Maintenance For Data Updates And Interactive Mining, Mengling Feng, Guozhu Dong, Jinyan Li, Yap-Peng Tan, Limsoon Wong Aug 2010

Pattern Space Maintenance For Data Updates And Interactive Mining, Mengling Feng, Guozhu Dong, Jinyan Li, Yap-Peng Tan, Limsoon Wong

Kno.e.sis Publications

This article addresses the incremental and decremental maintenance of the frequent pattern space. We conduct an in-depth investigation on how the frequent pattern space evolves under both incremental and decremental updates. Based on the evolution analysis, a new data structure, Generator-Enumeration Tree (GE-tree), is developed to facilitate the maintenance of the frequent pattern space. With the concept of GE-tree, we propose two novel algorithms, Pattern Space Maintainer+ (PSM+) and Pattern Space Maintainer− (PSM−), for the incremental and decremental maintenance of frequent patterns. Experimental results demonstrate that the proposed algorithms, on average, outperform the representative state-of-the-art …

Go to article

Cross-Market Model Adaptation With Pairwise Preference Data For Web Search Ranking, Jing Bai, Fernando Diaz, Yi Chang, Zhaohui Zheng, Keke Chen Aug 2010

Cross-Market Model Adaptation With Pairwise Preference Data For Web Search Ranking, Jing Bai, Fernando Diaz, Yi Chang, Zhaohui Zheng, Keke Chen

Kno.e.sis Publications

Machine-learned ranking techniques automatically learn a complex document ranking function given training data. These techniques have demonstrated the effectiveness and flexibility required of a commercial web search. However, manually labeled training data (with multiple absolute grades) has become the bottleneck for training a quality ranking function, particularly for a new domain. In this paper, we explore the adaptation of machine-learned ranking models across a set of geographically diverse markets with the market-specific pairwise preference data, which can be easily obtained from clickthrough logs. We propose a novel adaptation algorithm, Pairwise-Trada, which is able to adapt ranking models that are trained …

Go to article

10302 Summary - Learning Paradigms In Dynamic Environments, Barbara Hammer, Pascal Hitzler Jul 2010

10302 Summary - Learning Paradigms In Dynamic Environments, Barbara Hammer, Pascal Hitzler

Computer Science and Engineering Faculty Publications

The seminar centered around problems which arise in the context of machine learning in dynamic environments. Particular emphasis was put on a couple of specific questions in this context: how to represent and abstract knowledge appropriately to shape the problem of learning in a partially unknown and complex environment and how to combine statistical inference and abstract symbolic representations; how to infer from few data and how to deal with non i.i.d. data, model revision and life-long learning; how to come up with efficient strategies to control realistic environments for which exploration is costly, the dimensionality is high and data …

Go to article

Trust Model For Semantic Sensor And Social Networks: A Preliminary Report, Pramod Anantharam, Cory Andrew Henson, Krishnaprasad Thirunarayan, Amit P. Sheth Jul 2010

Trust Model For Semantic Sensor And Social Networks: A Preliminary Report, Pramod Anantharam, Cory Andrew Henson, Krishnaprasad Thirunarayan, Amit P. Sheth

Kno.e.sis Publications

Trust is an amorphous concept that is becoming Increasingly important in many domains, such as P2P networks, E-commerce, social networks, and sensor networks. While we all have an intuitive notion of trust, the literature is scattered with a wide assortment of differing definitions and descriptions; often these descriptions are highly dependent on a single domain or application of interest. In addition, they often discuss orthogonal aspects of trust while continuing to use the general term “trust”. In order to make sense of the situation, we have developed an ontology of trust that integrates and relates its various aspects into a …

Go to article

First Prev Next Last