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

Computer Engineering Commons™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 11851 - 11880 of 13035

Full-Text Articles in Computer Engineering

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 …

Go to article

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 …

Go to article

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 …

Go to article

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 …

Go to article

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 …

Go to article

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 …

Go to article

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 …

Go to article

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 …

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

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

Cs 765: Foundations Of Neurocomputation, Mateen M. Rizki Jul 2005

Cs 765: Foundations Of Neurocomputation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course is designed to help you develop a solid understanding of neural network algorithms and architectures. At the end of this course you should be able to read and critically evaluate most neural network papers published in major journals, (e.g. IEEE Transaction on Neural Networks, Neural Networks, and Neural Computation). In addition, you should be able to implement a broad range of network architectures and learning algorithms for a variety of applications.

Go to article

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier Jul 2005

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 209 is the second 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.

Go to article

Cs 241: Computer Science Ii, Eric Maston Jul 2005

Cs 241: Computer Science Ii, Eric Maston

Computer Science & Engineering Syllabi

This course is the second in the Introduction to Computer Science (24X) series. It focuses on object oriented concepts and an introduction to data structures.

Go to article

Cs 405/605-01: Introduction To Database Management Systems, Guozhu Dong Jul 2005

Cs 405/605-01: Introduction To Database Management Systems, Guozhu Dong

Computer Science & Engineering Syllabi

Survey of logical and physical aspects of database management systems. Data models including entity-relationship (ER) and relational are presented. Physical implementation (data organization and indexing) methods are discussed. Query languages including SQL, relational algebra, relational calculus, and QBE are introduced. Students will also gain experience in creating and manipulating a database.

Go to article

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

Cs 141-01: 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 240: Computer Science - I, Ronald F. Taylor Jul 2005

Cs 240: Computer Science - I, Ronald F. Taylor

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement. For CS/CEO majors with familiarity of a high-level programming language. Co-requisite: MTH 130 and 131; or MTH 134. 4 credit hours.

Go to article

Ceg 720-01: Computer Architecture, Jack Jean Jul 2005

Ceg 720-01: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 260-01: Digital Computer Hardware/Switching Circuits, Eric Maston Jul 2005

Ceg 260-01: Digital Computer 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 360/560-01: Digital System Design, Travis E. Doom Jul 2005

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

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

Cs 206-01: 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

Ceg 220-01: Introduction To C Programming For Engineers, Robert Helt Jul 2005

Ceg 220-01: Introduction To C Programming For Engineers, Robert Helt

Computer Science & Engineering Syllabi

This course provides a general introduction to computers as a problem-solving tool using the C programming language. Emphasis is on algorithms and techniques useful to engineers. Topics include data representation, debugging, and program verification. 4 credit hours. Prerequisite: Mm 229 (Calculus I).

Go to article

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

Ceg 460/660-01: 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

Cs 701: Database Systems And Design I, Guozhu Dong Jul 2005

Cs 701: Database Systems And Design I, Guozhu Dong

Computer Science & Engineering Syllabi

An introduction to database design, database system implementation issues and techniques, and advanced data models.

Go to article

Mobility-Pattern Based Localization Update Algorithm For Mobile Wireless Sensor Networks, Mohammad Yacoub Al-Laho Jul 2005

Mobility-Pattern Based Localization Update Algorithm For Mobile Wireless Sensor Networks, Mohammad Yacoub Al-Laho

Electrical & Computer Engineering Theses & Dissertations

In mobile wireless sensor networks, sensors move in the monitored area at any direction and speed. Unlike many other networking hosts, sensor nodes do not have global addresses. They are often identified by using a location-based addressing scheme. Therefore, it is important to have the knowledge of the sensor location indicating where the data came from. In this thesis, three localization update algorithms were designed, Specifically, a sensor movement is divided into three states: Pause, Linear, and Random. Each state adopts different localization update algorithm. Since complex movement involves different mobility patterns, a state transition model is developed to …

Go to article

First Prev Next Last