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

Engineering Commons™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 15691 - 15720 of 17309

Full-Text Articles in Engineering

Integrated Visualization And Analysis Of A Pig's Cardiovascular System, Joerg Meyer, Thomas Wischgoll, Elke Moritz Jun 2005

Integrated Visualization And Analysis Of A Pig's Cardiovascular System, Joerg Meyer, Thomas Wischgoll, Elke Moritz

Computer Science and Engineering Faculty Publications

No abstract provided.

Go to article

Auto-Pipe: A Pipeline Design And Evaluation System, Mark A. Franklin, John Maschmeyer, Eric Tyson, James Buckley, Patrick Crowley Jun 2005

Auto-Pipe: A Pipeline Design And Evaluation System, Mark A. Franklin, John Maschmeyer, Eric Tyson, James Buckley, Patrick Crowley

All Computer Science and Engineering Research

Auto-Pipe is a tool that aids in the design, evaluation, and implementation of pipelined applications that are distributed across a set of heterogeneous devices including multiple processors and FPGAs. It has been developed to meet the needs arising in the domains of communications, computation on large datasets, and real time streaming data applications. In this paper, the Auto-Pipe design flow is introduced and two sample applications, developed for compatibility with the Auto-Pipe system, are presented. The sample applications are the Triple-DES encryption standard and a subset of the signal-processing pipeline for VERITAS, a high-energy gamma-ray astrophysics experiment. These applications are …

Go to article

Towards A Systematic Account Of Different Semantics For Logic Programs, Pascal Hitzler Jun 2005

Towards A Systematic Account Of Different Semantics For Logic Programs, Pascal Hitzler

Computer Science and Engineering Faculty Publications

A new methodology has been proposed which allows one to derive uniform characterizations of different declarative semantics for logic programs with negation. One result from this work is that the well-founded semantics can formally be understood as a stratified version of the Fitting (or Kripke–Kleene) semantics. The constructions leading to this result, however, show a certain asymmetry which is not readily understood. We study this situation here with the result that we obtain a coherent picture of relations between different semantics for normal logic programs.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 8, May 2005, College Of Engineering And Computer Science, Wright State University May 2005

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 8, May 2005, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight 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

Hide It Or Unbundle It: A Comparison Of The Antitrust Investigations Against Microsoft In The U.S. And The E.U., Sue Ann Mota May 2005

Hide It Or Unbundle It: A Comparison Of The Antitrust Investigations Against Microsoft In The U.S. And The E.U., Sue Ann Mota

The University of New Hampshire Law Review

[Excerpt] "Microsoft Corporation, the world’s largest software company, has been facing antitrust scrutiny globally. In the U.S., after what’s been called the antitrust trial of the century, a consent decree was reached between Microsoft, the United States government, and several states, that closely resembled the litigated remedy that the remaining states received. Only Massachusetts appealed the litigated remedy, which was approved by the appeals court on June 30, 2004. In the United States, Microsoft was required to hide, but not remove, the Internet Explorer browser on the Windows Operating System. While antitrust litigation was ongoing in the United States against …

Go to article

Architectures For Rule Processing Intrusion Detection And Prevention Systems, Michael E. Attig May 2005

Architectures For Rule Processing Intrusion Detection And Prevention Systems, Michael E. Attig

All Computer Science and Engineering Research

High-performance intrusion detection and prevention systems are needed by network administrators in order to protect Internet systems from attack. Researchers have been working to implement components of intrusion detection and prevention systems for the highly popular Snort system in reconfigurable hardware. While considerable progress has been made in the areas of string matching and header processing, complete systems have not yet been demonstrated that effectively combine all of the functionality necessary to perform intrusion detection and prevention for real network systems. In this thesis, three architectures to perform rule processing, the heart of intrusion detection and prevention, are presented. The …

Go to article

Synthesizing E-Government Stage Models – A Meta-Synthesis Based On Meta-Ethnography Approach, Keng Siau, Y. Long May 2005

Synthesizing E-Government Stage Models – A Meta-Synthesis Based On Meta-Ethnography Approach, Keng Siau, Y. Long

Research Collection School Of Computing and Information Systems

The growing interest in e-government raises the question of stages in e-government development. A few stage models for e-government have been proposed. Without a common e-government stage model, different research in e-government may be based on different stage models. This presents a difficulty in comparing and understanding different research results. In this research, we synthesize the existing e-government stage models so that there is a common frame of reference for researchers and practitioners in the area.

Go to article

Improving The Performance Of Internet Data Transport, Anshul Kantawala, Jonathan S. Turner May 2005

Improving The Performance Of Internet Data Transport, Anshul Kantawala, Jonathan S. Turner

All Computer Science and Engineering Research

With the explosion of the World Wide Web, the Internet infrastructure faces new challenges in providing high performance for data traffic. First, it must be able to pro-vide a fair-share of congested link bandwidth to every flow. Second, since web traffic is inherently interactive, it must minimize the delay for data transfer. Recent studies have shown that queue management algorithms such as Tail Drop, RED and Blue are deficient in providing high throughput, low delay paths for a data flow. Two major shortcomings of the current algorithms are: they allow TCP flows to get synchronized and thus require large buffers …

Go to article

Synthesizing E-Government Stage Models – A Meta-Synthesis Based On Meta-Ethnography Approach, Keng Siau, Y. Long May 2005

Synthesizing E-Government Stage Models – A Meta-Synthesis Based On Meta-Ethnography Approach, Keng Siau, Y. Long

Research Collection School Of Computing and Information Systems

The growing interest in e-government raises the question of stages in e-government development. A few stage models for e-government have been proposed. Without a common e-government stage model, different research in e-government may be based on different stage models. This presents a difficulty in comparing and understanding different research results. In this research, we synthesize the existing e-government stage models so that there is a common frame of reference for researchers and practitioners in the area.

Go to article

Static Determination Of Allocation Rates To Support Real-Time Garbage Collection, Tobias Mann Apr 2005

Static Determination Of Allocation Rates To Support Real-Time Garbage Collection, Tobias Mann

All Computer Science and Engineering Research

While it is generally accepted that garbage-collected languages offer advantages over languages in which objects must be explicitly deallocated, real-time developers are leery of the adverse effects a garbage collector might have on real-time performance. Semiautomatic approaches based on regions have been proposed, but incorrect usage could cause unbounded storage leaks or program failure. Moreover, correct usage cannot be guaranteed at compile-time. Recently, real-time garbage collectors have been developed that provide a guaranteed fraction of the CPU to the application, and the correct operation of those collectors has been proven, subject only to the specification of certain statistics related to …

Go to article

Composable Timed Automata Models For Real-Time Embedded Systems Middleware, Venkita Subramonian, Christopher Gill, Cesar Sanchez, Henny Sipma Apr 2005

Composable Timed Automata Models For Real-Time Embedded Systems Middleware, Venkita Subramonian, Christopher Gill, Cesar Sanchez, Henny Sipma

All Computer Science and Engineering Research

Middleware for distributed real-time embedded (DRE) systems has grown more and more complex in recent years, to address functional and temporal requirements of complex real-time applications. While current approaches for modeling middleware have eased the task of assembling, deploying and configuring middleware and applications, a more formal, fundamental and lower-level set of models is needed to be able to uncover subtle safety and timing errors introduced by interference between computations, particularly in the face of alternative concurrency strategies in the middleware layer. In this paper, we examine how formal models of lower-level middleware building blocks provide an appropriate level of …

Go to article

What A Mesh: Dependent Data Types For Correct Mesh Manipulation Algorithms, Joel R. Brandt Apr 2005

What A Mesh: Dependent Data Types For Correct Mesh Manipulation Algorithms, Joel R. Brandt

All Computer Science and Engineering Research

The Edinburgh Logical Framework (LF) has been proposed as a system for expressing inductively defined sets. I will present an inductive definition of the set of manifold meshes in LF. This definition takes into account the topological characteri-zation of meshes, namely their Euler Characteristic. I will then present a set of dependent data types based on this inductive def-inition. These data types are defined in a programming language based on LF. The language’s type checking guarantees that any typeable expression represents a correct manifold mesh. Furthermore, any mesh can be represented using these data types. Hence, the encoding is sound …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 7, April 2005, College Of Engineering And Computer Science, Wright State University Apr 2005

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 7, April 2005, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A six 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

Fly Through A Pig's Heart: An Educational Computer Game, Thomas Wischgoll, Joerg Meyer Apr 2005

Fly Through A Pig's Heart: An Educational Computer Game, Thomas Wischgoll, Joerg Meyer

Computer Science and Engineering Faculty Publications

No abstract provided.

Go to article

Ceg 210-01: Pc Networking I, Karen Meyer Apr 2005

Ceg 210-01: 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

Ceg 260-01: Digital Computing Hardware/Switching Circuits, Eric Maston Apr 2005

Ceg 260-01: Digital Computing Hardware/Switching Circuits, Eric Maston

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

Ceg 210-01: Pc Networking I, Karen Meyer Apr 2005

Ceg 210-01: Pc Networking I, Karen Meyer

Computer Science & Engineering Syllabi

Introduction to PC networking hardware, concepts, and technologies. Focus is on LAN administration, and hardware and software configuration.

Go to article

Cs 206: Computer Software Productivity Tools, Greg Coffey Apr 2005

Cs 206: Computer Software Productivity Tools, Greg Coffey

Computer Science & Engineering Syllabi

This course introduces advanced computer applications using MS Word, MS Excel, MS Access, and MS PowerPoint.

Go to article

Cs 207: Advanced Office Productivity Ii, Louis A. Benavides Apr 2005

Cs 207: Advanced Office Productivity Ii, Louis A. Benavides

Computer Science & Engineering Syllabi

This course covers post-advanced microcomputer applications including Microsoft Office Word 2003, Microsoft Office Excel 2003, Microsoft Office Access 2003, and Microsoft Office PowerPoint 2003. Topics include: creating an online form; working with macros and Visual Basic for Applications (VBA); working with a master document, an index and a table of contents; linking an Excel worksheet and charting its data in Word; formula auditing, data validation, and complex problem solving in Excel; importing data into Excel; working with PivotCharts, PivotTables, and trendlines in Excel; creating a PivotTable List; advanced Access report and form techniques, and creating multi-page forms; administering a database …

Go to article

Ceg 255-01: Introduction To The Design Of Information Technology Systems, Eric Maston Apr 2005

Ceg 255-01: Introduction To The Design Of Information Technology Systems, Eric Maston

Computer Science & Engineering Syllabi

Information systems consist of modern elements such as database systems, networks, multi-platform distributed computing, web infrastructure and multimedia computing. In this course we will address these areas individually and also where they intersect to gain a basic understanding of how information technology can be used to solve real problems.

Go to article

Cs 141: Computer Programming - I, Ronald F. Taylor Apr 2005

Cs 141: Computer Programming - I, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of computer 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. Prerequisite: MTH 127 (College Algebra) or equivalent.

Go to article

Cs 241: Computer Science Ii, L. Jane Lin Apr 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. For All CS 241 students, concurrent registration into CS 241 lab is a must.

Go to article

Cs 466/666: Introduction To Formal Languages, Thomas Sudkamp Apr 2005

Cs 466/666: 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 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.

Go to article

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

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

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 801: Advanced Database Systems, Soon M. Chung Apr 2005

Cs 801: Advanced Database Systems, Soon M. Chung

Computer Science & Engineering Syllabi

Introduction of current trends and research issues in database systems.

Go to article

Cs 241-02: Introduction To Computer Science Ii, Praveen Kakumanu Apr 2005

Cs 241-02: 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. Note: For all CS 241 students, concurrent registration into CS 241 lab is a must

Go to article

Cs 240-02: Introduction To Computer Science, Eric Maston Apr 2005

Cs 240-02: Introduction To Computer Science, Eric Maston

Computer Science & Engineering Syllabi

We will develop basic techniques to design, develop and implement programs using the C++ language. This course focuses on basic elements of programming and assumes no knowledge of programming in C++.

Go to article

Cs 340: Programming Language Workshop In Java, Krishnaprasad Thirunarayan Apr 2005

Cs 340: Programming Language Workshop In Java, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to learn the Java language and solve a set of programming problems assigned to you using it. (You may develop your code using any IDE you like, but you must ensure that it eventually runs using JDK 5). 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 discussions about the programming problems.

Go to article

Cs/Mth 316/516: Numerical Methods For Digital Computers - I, Ronald F. Taylor Apr 2005

Cs/Mth 316/516: Numerical Methods For Digital Computers - I, Ronald F. Taylor

Computer Science & Engineering Syllabi

Introduction to numerical methods used in the sciences. Methods of interpolation, data smoothing, functional approximation, numerical differentiation and integration. Solution techniques for linear and nonlinear equations. Discussion of sources of error in numerical methods. Applications of interest to engineering, science, and applied mathematics students are an integral part of the course. Special topics presented as schedule permits. 4 credit hours. Prerequisites: CS 142 or EGR 153 or CEG 220 or CS 241, MTH 231, MTH 253 or 255.

Go to article

Bio/Cs 271: Introduction To Bioinformatics, Dan E. Krane, Travis E. Doom Apr 2005

Bio/Cs 271: Introduction To Bioinformatics, Dan E. Krane, Travis E. Doom

Computer Science & Engineering Syllabi

BIO/CS 271 Introduction to Bioinformatics: Introduction to DNA as an information storage system, data searches and pairwise alignments, substitution patterns, protein folding, and proteomics. Prerequisite: CS 240 or equivalent, BIO 112

Go to article

First Prev Next Last