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

Computer Engineering Commons™

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

Physical Sciences and Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 12301 - 12330 of 13561

Full-Text Articles in Computer Engineering

Cs 205-08: Computer Literacy And Office Automation, Kim Gros Oct 2005

Cs 205-08: Computer Literacy And Office Automation, Kim Gros

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 application software categories that are covered in the seven modules. To understand the basics of e-mail. To introduce networking concepts including the Internet and its components and web browser basics. To learn ways to protect your data and avoid computer disasters.


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.


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.


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.


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.


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.


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.


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.


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 …


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.


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.


A Motion Planning Processor On Reconfigurable Hardware, Nuzhet Atay, Burchan Bayazit Sep 2005

A Motion Planning Processor On Reconfigurable Hardware, Nuzhet Atay, Burchan Bayazit

All Computer Science and Engineering Research

Motion planning algorithms enable us to find feasible paths for moving objects. These algorithms utilize feasibility checks to differentiate valid paths from invalid ones. Unfortunately, the computationally expensive nature of such checks reduces the effectiveness of motion planning algorithms. However, by using hardware acceleration to speed up the feasibility checks, we can greatly enhance the performance of the motion planning algorithms. Of course, such acceleration is not limited to feasibility checks; other components of motion planning algorithms can also be accelerated using specially designed hardware. A Field Programmable Gate Array (FPGA) is a great platform to support such an acceleration. …


The Open Network Laboratory (A Resource For High Performance Networking Research), John Dehart, Fred Kuhns, Jyoti Parwatikar, Jonathan Turner, Ken Wong Sep 2005

The Open Network Laboratory (A Resource For High Performance Networking Research), John Dehart, Fred Kuhns, Jyoti Parwatikar, Jonathan Turner, Ken Wong

All Computer Science and Engineering Research

The Open Network Laboratory (ONL) is a remotely accessible network testbed designed to enable network researchers to conduct experiments using high performance routers and applications. ONL™s Remote Laboratory Interface (RLI) allows users to easily configure a network topology, initialize and modify the routers™ routing tables, packet classification tables and queuing parameters. It also enables users to add software plugins to the embedded processors available at each of the routers™ ports, enabling the introduction of new functionality. The routers provide a large number of built-in counters to track various aspects of system usage, and the RLI software makes these available through …


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.


Poster Session A: A Multi-Priority Application Framework For Mobile Ad Hoc Networks, M. Ibrahim Channa, Ahsan Chaudhry, Kashif Sharif, Irum Memon Aug 2005

Poster Session A: A Multi-Priority Application Framework For Mobile Ad Hoc Networks, M. Ibrahim Channa, Ahsan Chaudhry, Kashif Sharif, Irum Memon

International Conference on Information and Communication Technologies

The fast spread of small wireless computers has enabled the design and deployment of wireless Ad Hoc networks. Typical applications proposed for such networks include both Real Time and Non-Real Time applications. We propose an architecture that provides a complete framework for Real Time applications and Best Effort traffic. The proposed architecture comprises of an Ad Hoc Routing Protocol for route setup and route repair, a Bandwidth Allocation and Reservation Scheme for Real Time traffic, and a MAC layer protocol that provides traffic differentiation. The Admission Control module is used to admit or reject a new Real Time flow request …


Secured Network Model For Management Information System Based On Ip Security (Ipsec) Encryption Using Multilayered Approach Of Network Security, Dr. Amir Hassan Pathan, Muniza Irshad Aug 2005

Secured Network Model For Management Information System Based On Ip Security (Ipsec) Encryption Using Multilayered Approach Of Network Security, Dr. Amir Hassan Pathan, Muniza Irshad

International Conference on Information and Communication Technologies

Secured flow of information through the network and play important role in the management information systems. In this paper I describe Secured Network Model For Corporate & Business Organization In Based On Network Level IP Security (IPSec) Encryption & Its Physical Layout Using Multilayered Approach. I have four important considerations for adoption of secured network model as secured network model for management information system.


G-Value Decoding Of Greedy Codes, Khalil Ahmad Aug 2005

G-Value Decoding Of Greedy Codes, Khalil Ahmad

International Conference on Information and Communication Technologies

Error-correcting codes are widely used to increase the reliability of transmission of information over various forms of communication channels. Codes with a given minimum distance d can be constructed by a greedy algorithm [2]. In this paper, I proposed a new algorithm for the allocation of g-values to the binary vectors. Hamming (7, 4, 3) code can be generated by the application of greedy algorithm on the binary vectors of length 7 arranged in B-ordering. This code is used to demonstrate a new decoding technique for linear codes in addition to the schemes already known for decoding such as Syndrome …


Keynote: Role Of Values & Culture In Information Technology, Prof. Dr. Anis Ahmad Aug 2005

Keynote: Role Of Values & Culture In Information Technology, Prof. Dr. Anis Ahmad

International Conference on Information and Communication Technologies

It is no longer unusual to see, in a remote town in northern area in Pakistan, a practically non-literate wagon driver calling from his Nokia cell phone his uncle in Dubai or in Karachi. He enjoys sharing with him about his success in business and the settlement of family disputes. While he is driving on dangerous curvy roads and having this conversation, in the back seat of the wagon a comparatively young person is playing games on his cell phone. All this was unimaginable a quarter of a century ago.


Cut-And-Solve: A Linear Search Strategy For Combinatorial Optimization Problems, Sharlee Climer, Weixiong Zhang Aug 2005

Cut-And-Solve: A Linear Search Strategy For Combinatorial Optimization Problems, Sharlee Climer, Weixiong Zhang

All Computer Science and Engineering Research

Branch-and-bound and branch-and-cut use search trees to identify optimal solutions. In this paper, we introduce a linear search strategy which we refer to as cut-and-solve and prove optimality and completeness for this method. This search is different from traditional tree searching as there is no branching. At each node in the search path, a relaxed problem and a sparse problem are solved and a constraint is added to the relaxed problem. The sparse problems provide incumbent solutions. When the constraining of the relaxed problem becomes tight enough, its solution value becomes no better than the incumbent solution value. At this …


Efficient And Effective Schemes For Streaming Media Delivery, Cheng Huang Aug 2005

Efficient And Effective Schemes For Streaming Media Delivery, Cheng Huang

All Computer Science and Engineering Research

The rapid expansion of the Internet and the increasingly wide deployment of wireless networks provide opportunities to deliver streaming media content to users at anywhere, anytime. To ensure good user experience, it is important to battle adversary effects, such as delay, loss and jitter. In this thesis, we first study efficient loss recovery schemes, which require pure XOR operations. In particular, we propose a novel scheme capable of recovering up to 3 packet losses, and it has the lowest complexity among all known schemes. We also propose an efficient algorithm for array codes decoding, which achieves significant throughput gain and …


Spawn: Service Provision In Ad-Hoc Wireless Networks, Radu Handorean, Gruia-Catalin Roman, Rohan Sen, Gregory Hackmann, Christopher Gill Aug 2005

Spawn: Service Provision In Ad-Hoc Wireless Networks, Radu Handorean, Gruia-Catalin Roman, Rohan Sen, Gregory Hackmann, Christopher Gill

All Computer Science and Engineering Research

The increasing ubiquity of wireless mobile computing platforms has opened up the potential for unprecedented levels of communication, coordination and collaboration among mobile computing devices, most of which will occur in an ad hoc, on-demand manner. This paper describes SPAWN, a middleware supporting service provision in ad-hoc wireless networks. The aim of SPAWN is to provide the software resources on mobile devices that facilitate electronic collaboration. This is achieved by applying the principles of service oriented computing (SOC), an emerging paradigm that has seen success in wired settings. SPAWN is an adaptation and extension of the Jini model of SOC …


A Collision Detection Chip On Reconfigurable Hardware, Nuzhet Atay, John W. Lockwood, Burchan Bayazit Jul 2005

A Collision Detection Chip On Reconfigurable Hardware, Nuzhet Atay, John W. Lockwood, Burchan Bayazit

All Computer Science and Engineering Research

Collision detection algorithms check the intersection between two given surfaces or volumes. They are computationally-intensive and the capabilities of conventional processors limit their performance. Hardware acceleration of these algorithms can greatly benefit the systems that need collision detection to be performed in real-time. A Field Programmable Gate Array (FPGA) is a great platform to achieve such acceleration. An FPGA is a collection of digital gates which can be reprogrammed at run time, i.e., it can be used as a CPU that reconfigures itself for a given task. In this paper, we present an FPGA based collision detection chip. The chip …


Real-Time Power Aware Routing In Wireless Sensor Networks, Octav Chipara, Zhimin He, Guoliang Xing, Qin Chen, Xiaorui Wang, Chenyang Lu, John Stankovic, Tarek Abdelzaher Jul 2005

Real-Time Power Aware Routing In Wireless Sensor Networks, Octav Chipara, Zhimin He, Guoliang Xing, Qin Chen, Xiaorui Wang, Chenyang Lu, John Stankovic, Tarek Abdelzaher

All Computer Science and Engineering Research

Many mission-critical wireless sensor network applications must resolve the inherent conflict between the tight resource constraints on each sensor node, particularly in terms of energy, with the need to achieve desired quality of service such as end-to-end real-time performance. To address this challenge we propose the Real-time Power-Aware Routing (RPAR) protocol. RPAR achieves required communication delays at minimum energy cost by dynamically adapting the transmission power and routing decisions based on packet deadlines. RPAR integrates a geographic forwarding policy cognizant of deadlines, power, and link quality with new algorithms for on-demand power adaptation and efficient neighborhood discovery. Simulations based on …


Dream: A Theoretical Analysis, Xueying Qi Jul 2005

Dream: A Theoretical Analysis, Xueying Qi

Computer Science Theses & Dissertations

A Mobile Ad-hoc Network (MANET, for short) is a collection of mobile nodes deployed in support of a short-lived special-purpose operation. Examples include search-and-rescue missions, law-enforcement, multimedia classrooms, and among many others. Unlike cellular or satellite networks, MANET do not rely on any form of pre-existing infrastructure. The mobility of nodes combined with the lack of infrastructure makes routing in MANET notoriously difficult. It was recently suggested that routing in MANET can use to advantage geographic information that the nodes may acquire either by endowing them with a GPS chip or simply by using known localization algorithms. Distance Routing Effect …


Non-Linear And Linear Transformations Of Features For Robust Speech Recognition And Speaker Identification, Saurabh Prasad Jul 2005

Non-Linear And Linear Transformations Of Features For Robust Speech Recognition And Speaker Identification, Saurabh Prasad

Electrical & Computer Engineering Theses & Dissertations

Automatic speech recognizers perform poorly when training and test data are systematically different in terms of noise and channel characteristics. One manifestation of such differences is variations in the probability density functions (pdfs) between training and test features. Consequently, both automatic speech recognition and automatic speaker identification may be severely degraded. Previous attempts to mm1m1ze this problem include Cepstral Mean and Variance Normalization and transforming all speech features to a uni-variate Gaussian pdf. In this thesis, two techniques are presented for non-linearly scaling speech features to fit them to a target pdf - the first is based on the principles …


Fine-Tuning Of Mass-Spring Model Properties For Simulating Realistic Soft Body Deformation, Sylva A. Girtelschmid Jul 2005

Fine-Tuning Of Mass-Spring Model Properties For Simulating Realistic Soft Body Deformation, Sylva A. Girtelschmid

Computational Modeling & Simulation Engineering Theses & Dissertations

Obtaining a well behaved soft-tissue model is one of the most challenging and important tasks in the development of surgical simulation systems. Achieving both accurate and real-time deformation response from a soft-tissue model becomes more difficult as the complexity of the represented anatomy and the degree of deformation increases. One common approach to modeling deformable objects is the Mass-Spring (MS) system method. Mass-Spring systems are attractive to real-time applications due to their relatively low computational requirement and ease of implementation. However, their parameter determination is typically done manually, which becomes tedious when accurate approximation to real-world objects is desired. This …


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.


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.


Cs 214: Object Oriented Programming, Roddy Keish Jul 2005

Cs 214: Object Oriented Programming, Roddy Keish

Computer Science & Engineering Syllabi

No abstract provided.


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.