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

Engineering Commons

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

Computer Sciences

PDF

2008

Institution
Keyword
Publication
Publication Type

Articles 1 - 30 of 380

Full-Text Articles in Engineering

Quad General Tree Drawing Algorithm And General Trees Characterization: Towards An Environment For The Experimental Study On General Tree Drawing Algorithms, Chu Yao Dec 2008

Quad General Tree Drawing Algorithm And General Trees Characterization: Towards An Environment For The Experimental Study On General Tree Drawing Algorithms, Chu Yao

Theses and Dissertations

Information visualization produces (interactive) visual representations of abstract data to reinforce human cognition and perception; thus enabling the viewer to gain knowledge about the internal structure of the data and causal relationships in it. The visualization of information hierarchies is concerned with the presentation of abstract hierarchical information about relationships between various entities. It has many applications in diverse domains such as software engineering, information systems, biology, and chemistry. Information hierarchies are typically modeled by an abstract tree, where vertices are entities and edges represent relationships between entities. The aim of visualizing tree drawings is to automatically produce drawings of …


Sub-Circuit Selection And Replacement Algorithms Modeled As Term Rewriting Systems, Eric D. Simonaire Dec 2008

Sub-Circuit Selection And Replacement Algorithms Modeled As Term Rewriting Systems, Eric D. Simonaire

Theses and Dissertations

Intent protection is a model of software obfuscation which, among other criteria, prevents an adversary from understanding the program’s function for use with contextual information. Relating this framework for obfuscation to malware detection, if a malware detector can perfectly normalize a program P and any obfuscation (variant) of the program O(P), the program is not intent protected. The problem of intent protection on programs can also be modeled as intent protection on combinational logic circuits. If a malware detector can perfectly normalize a circuit C and any obfuscation (variant) O(C) of the circuit, the circuit is not intent protected. In …


A Model Based Fault Detection And Prognostic Scheme For Uncertain Nonlinear Discrete-Time Systems, Balaje T. Thumati, Jagannathan Sarangapani Dec 2008

A Model Based Fault Detection And Prognostic Scheme For Uncertain Nonlinear Discrete-Time Systems, Balaje T. Thumati, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

A new fault detection and prognostics (FDP) framework is introduced for uncertain nonlinear discrete time system by using a discrete-time nonlinear estimator which consists of an online approximator. A fault is detected by monitoring the deviation of the system output with that of the estimator output. Prior to the occurrence of the fault, this online approximator learns the system uncertainty. In the event of a fault, the online approximator learns both the system uncertainty and the fault dynamics. A stable parameter update law in discrete-time is developed to tune the parameters of the online approximator. This update law is also …


Neural Network Output Feedback Control Of A Quadrotor Uav, Jagannathan Sarangapani, Travis Alan Dierks Dec 2008

Neural Network Output Feedback Control Of A Quadrotor Uav, Jagannathan Sarangapani, Travis Alan Dierks

Electrical and Computer Engineering Faculty Research & Creative Works

A neural network (NN) based output feedback controller for a quadrotor unmanned aerial vehicle (UAV) is proposed. The NNs are utilized in the observer and for generating virtual and actual control inputs, respectively, where the NNs learn the nonlinear dynamics of the UAV online including uncertain nonlinear terms like aerodynamic friction and blade flapping. It is shown using Lyapunov theory that the position, orientation, and velocity tracking errors, the virtual control and observer estimation errors, and the NN weight estimation errors for each NN are all semi-globally uniformly ultimately bounded (SGUUB) in the presence of bounded disturbances and NN functional …


Mapping Reality Into Virtual Worlds, Josh Mcfarlane Dec 2008

Mapping Reality Into Virtual Worlds, Josh Mcfarlane

Computer Science and Computer Engineering Undergraduate Honors Theses

As virtual worlds become more prevalent, they become increasingly useful as a means of information dissemination. This thesis examines the possible connections between real world objects and their virtual world counterparts. We look at how, by attaching sensors to an object, or by using a smart object with embedded sensors, the information can be relayed to a server. From this information, it will be possible to create a duplicate object in the virtual world and have it mirror the real world object in terms of state and movement. Almost all current solutions for remotely viewing a room or area are …


Steganography In Ipv6, Barret Miller Dec 2008

Steganography In Ipv6, Barret Miller

Computer Science and Computer Engineering Undergraduate Honors Theses

Steganography is the process of hiding a secret message within another message such that it is difficult to detect the presence of the secret message. In other words, the existence of the secret message is hidden. A covert channel refers to the actual medium that is used to communicate the information such as a message, image, or file. This honors thesis uses steganography within the source address fields of Internet Protocol Version 6 (IPv6) packets to create a covert channel through which clandestine messages are passed from one party to another. A fully functional computer program was designed and written …


A C To Register Transfer Level Algorithm Using Structured Circuit Templates: A Case Study With Simulated Annealing, Jonathan D. Phillips Dec 2008

A C To Register Transfer Level Algorithm Using Structured Circuit Templates: A Case Study With Simulated Annealing, Jonathan D. Phillips

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

A tool flow is presented for deriving simulated annealing accelerator circuits on a field programmable gate array (FPGA) from C source code by exploring architecture solutions that conform to a preset template through scheduling and mapping algorithms. A case study carried out on simulated annealing-based Autonomous Mission Planning and Scheduling (AMPS) software used for autonomous spacecraft systems is explained. The goal of the research is an automated method for the derivation of a hardware design that maximizes performance while minimizing the FPGA footprint. Results obtained are compared with a peer C to register transfer level (RTL) logic tool, a state-of-the-art …


Neural-Network-Based State Feedback Control Of A Nonlinear Discrete-Time System In Nonstrict Feedback Form, Pingan He, Jagannathan Sarangapani Dec 2008

Neural-Network-Based State Feedback Control Of A Nonlinear Discrete-Time System In Nonstrict Feedback Form, Pingan He, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a suite of adaptive neural network (NN) controllers is designed to deliver a desired tracking performance for the control of an unknown, second-order, nonlinear discrete-time system expressed in nonstrict feedback form. In the first approach, two feedforward NNs are employed in the controller with tracking error as the feedback variable whereas in the adaptive critic NN architecture, three feedforward NNs are used. In the adaptive critic architecture, two action NNs produce virtual and actual control inputs, respectively, whereas the third critic NN approximates certain strategic utility function and its output is employed for tuning action NN weights …


Distributing Complementary Resources Across Multiple Periods With Stochastic Demand, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau Dec 2008

Distributing Complementary Resources Across Multiple Periods With Stochastic Demand, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments, we show that under stochastic conditions the performance variation of the process decreases as the time frame length (time …


Leading Firms As Knowledge Gatekeepers In A Networked Environment, Deogratias Harorimana Mr Nov 2008

Leading Firms As Knowledge Gatekeepers In A Networked Environment, Deogratias Harorimana Mr

Dr Deogratias Harorimana

This chapter introduces the role of the knowledge gatekeeper as a mechanism by which knowledge is created and transferred in a networked environment. Knowledge creation and transfer are essential for building a knowledge based economy. The chapter considers obstacles that inhibit this process and argues that leading firms create a shared socio-cultural context that enables the condivision of tacit meanings and codification of knowledge. Leading firms act as gatekeepers of knowledge through the creation of shared virtual platforms. There will be a leading firm that connects several networks of clients and suppliers may not interact directly with one another, but …


Irrelevance, Polymorphism, And Erasure In Type Theory, Richard Nathan Mishra-Linger Nov 2008

Irrelevance, Polymorphism, And Erasure In Type Theory, Richard Nathan Mishra-Linger

Dissertations and Theses

Dependent type theory is a proven technology for verified functional programming in which programs and their correctness proofs may be developed using the same rules in a single formal system. In practice, large portions of programs developed in this way have no computational relevance to the ultimate result of the program and should therefore be removed prior to program execution. In previous work on identifying and removing irrelevant portions of programs, computational irrelevance is usually treated as an intrinsic property of program expressions. We find that such an approach forces programmers to maintain two copies of commonly used datatypes: a …


Analysis And Evaluation Of Existing C-Band Feed Horns For Applicability To The 21 Meter Morehead Space Tracking Antenna, Prabhakara Rao Eluru Oct 2008

Analysis And Evaluation Of Existing C-Band Feed Horns For Applicability To The 21 Meter Morehead Space Tracking Antenna, Prabhakara Rao Eluru

Morehead State Theses and Dissertations

A thesis presented to the faculty of the College of Science & Technology at Morehead State University in partial fulfillment of the requirements for the Degree of Master of Science by Prabhakara Rao Eluru on October 8, 2008.


Ceg 420/620: Computer Architecture, Jack Jean Oct 2008

Ceg 420/620: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 453/653: Embedded Systems, Jack Jean Oct 2008

Ceg 453/653: Embedded Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 210: Pc Networking I, Karen Meyer Oct 2008

Ceg 210: Pc Networking I, Karen Meyer

Computer Science & Engineering Syllabi

Introduction to networking technologies including infrastructure and architectures, standards, protocols and directory services, administration, security and management. Integrated lecture and lab.


Ceg 433/633: Operating Systems, Prabhaker Mateti Oct 2008

Ceg 433/633: Operating Systems, Prabhaker Mateti

Computer Science & Engineering Syllabi

Overview of operating systems internals. File-system usage and design, process usage and control, virtual memory, multi user systems, access control. Course projects use C++ language.


Ceg 460/660: Introduction To Software Computer Engineering, Jeffrey Mcdonald Oct 2008

Ceg 460/660: Introduction To Software Computer Engineering, Jeffrey Mcdonald

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 sot1ware, 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.


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

Ceg 724: Computer Vision I, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course covers basic techniques for low-level and some mid-level vision. The techniques include: camera calibration, image filtering and edge detection, image segmentation and feature selection, and stereo depth perception.


Ceg 436/636: Mobile Computing, Yong Pei Oct 2008

Ceg 436/636: Mobile Computing, Yong Pei

Computer Science & Engineering Syllabi

Increasingly.. people, computers and microelectronic devices are being linked together to bring to life the communications mantra: anybody, anything, anytime, anywhere. This junior/senior/graduate course provides an in-depth study of networking protocol and system design in the area of wireless networking and mobile computing. It will help engineering and computer science students establish a solid foundation in concepts, architecture, design, and performance evaluation of mobile computing principle, protocols and applications. It will also introduce students to a few hot topics in wireless networking and mobile computing research such as mobile IP, wireless TCP, 802. l l, agent techniques, etc. The course …


Ceg 221: Advanced C Programming For Engineers, Robert Helt Oct 2008

Ceg 221: Advanced C Programming For Engineers, Robert Helt

Computer Science & Engineering Syllabi

This course introduces advanced constructs, algorithms, and data structures in the C programming language. Emphasis is on problem solving and techniques useful to engineers. Topics include functions, array, pointers, structures as well as sorting algorithms, linked lists, complex numbers, stacks, queues, hash tables, and binary trees.


Ceg 220: Introduction To C Programming For Engineers I, Jay Dejongh Oct 2008

Ceg 220: Introduction To C Programming For Engineers I, Jay Dejongh

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: MTH 229 (Calculus I) or EGR 101 (Engineering Mathematics).


Ceg 476/676: Computer Graphics I, Thomas Wischgoll Oct 2008

Ceg 476/676: Computer Graphics I, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you will have learnt techniques for constructing 2-D and 3-D objects
as well as manipulating and rendering the objects using OpenGL.
The outline of the course is as follows:

Introduction

  • Geometric primitives
  • Attributes of geometric primitives
  • Antialiasing techniques
  • Homogeneous coordinate system
  • 2-D and 3-D viewing transformations
  • Structures and hierarchical modeling
  • Input devices and interactive techniques
  • Visible surface detection methods


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

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 journal and on the quality of their collective efforts as reflected in group generated products.


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

Ceg 355: 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.

This course is concerned with the techniques of designing and implementing distributed business software. Emphasis is on developing graphical user interfaces (GUIs) using Java Swing classes, storing and accessing data in a relational database using SQL, and implementing a distributed system using CORBA technology. Especially in light of Java and CORBA, there is a focus on object-oriented programming. The overall objective is to make the student aware of the technology available to …


Ceg 720: Computer Architecture I, Soon M. Chung Oct 2008

Ceg 720: Computer Architecture I, Soon M. Chung

Computer Science & Engineering Syllabi

Review of sequential computer architecture and study of parallel computers. Topics include memory hierarchy, reduced instruction set computer, pipeline processing, multiprocessing, various parallel computers, interconnection networks, and fault-tolerant computing.


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

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.


Ceg 402/602: Introduction To Computer Communication, Bin Wang Oct 2008

Ceg 402/602: 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.


Ceg 777: Computer Aided Geometric Design, Arthur A. Goshtasby Oct 2008

Ceg 777: Computer Aided Geometric Design, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course covers the fundamentals of geometric modeling, including design of curves and surfaces, composite curves and surfaces, and subdivision techniques for creating free-form shapes.


Ceg 434/634: Concurrent Software Design, Yong Pei Oct 2008

Ceg 434/634: Concurrent Software Design, Yong Pei

Computer Science & Engineering Syllabi

This course provides an introduction to concurrent program design in the UNIX environment. Classical problems of synchronization, concurrency, and their solutions are examined through course projects and through readings on operating system design.


Ceg 260: Digital Computer Hardware Switching Circuits, Meilin Liu Oct 2008

Ceg 260: Digital Computer Hardware Switching Circuits, Meilin Liu

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.