Engineering Commons^™

A Fuzzy Logic Controller For Autonomous Wheeled Vehicles, Mohamed Trabia, Linda Z. Shi, Neil Eugene Hodge

Mechanical Engineering Faculty Research

Autonomous vehicles have potential applications in many fields, such as replacing humans in hazardous environments, conducting military missions, and performing routine tasks for industry. Driving ground vehicles is an area where human performance has proven to be reliable. Drivers typically respond quickly to sudden changes in their environment. While other control techniques may be used to control a vehicle, fuzzy logic has certain advantages in this area; one of them is its ability to incorporate human knowledge and experience, via language, into relationships among the given quantities. Fuzzy logic controllers for autonomous vehicles have been successfully applied to address various …

Cosign: A Parallel Algorithm For Coordinated Traffic Signal Control, Shih-Fen Cheng, Marina A. Epelman, Robert L. Smith

Research Collection School Of Computing and Information Systems

The problem of finding optimal coordinated signal timing plans for a large number of traffic signals is a challenging problem because of the exponential growth in the number of joint timing plans that need to be explored as the network size grows. In this paper, the game-theoretic paradigm of fictitious play to iteratively search for a coordinated signal timing plan is employed, which improves a system-wide performance criterion for a traffic network. The algorithm is robustly scalable to realistic-size networks modeled with high-fidelity simulations. Results of a case study for the city of Troy, MI, where there are 75 signalized …

Finding A Length-Constrained Maximum-Sum Or Maximum-Density Subtree And Its Application To Logistics, Hoong Chuin Lau, Trung Hieu Ngo, Bao Nguyen Nguyen

Research Collection School Of Computing and Information Systems

We study the problem of finding a length-constrained maximum-density path in a tree with weight and length on each edge. This problem was proposed in [R.R. Lin, W.H. Kuo, K.M. Chao, Finding a length-constrained maximum-density path in a tree, Journal of Combinatorial Optimization 9 (2005) 147–156] and solved in O(nU) time when the edge lengths are positive integers, where n is the number of nodes in the tree and U is the length upper bound of the path. We present an algorithm that runs in O(nlog2n) time for the generalized case when the edge lengths are positive real numbers, which …

Dynamic Multi-Linked Negotiations In Multi-Echelon Production Scheduling Networks, Hoong Chuin Lau, Guan Li Soh, Wee Chong Wan

Research Collection School Of Computing and Information Systems

In this paper, we are concerned with scheduling resources in a multi-tier production/logistics system for multi-indenture goods. Unlike classical production scheduling problems, the problem we study is concerned with local utilities which are private. We present an agent model and investigate an efficient scheme for handling multi-linked agent negotiations. With this scheme we attempt to overcome the drawbacks of sequential negotiations and negotiation parameter settings. Our approach is based on embedding a credit-based negotiation protocol within a local search scheduling algorithm. We demonstrate the computational efficiency and effectiveness of the approach in solving a real-life dynamic production scheduling problem which …

Supply Chain Information Sharing In A Macro Prediction Market, Zhiling Guo, Fang Fang, Andrew B. Whinston

Research Collection School Of Computing and Information Systems

This paper aims to address supply chain partners' incentives for information sharing from an information systems design perspective. Specifically, we consider a supply chain characterized by N geographically distributed retailers who order a homogeneous product from one manufacturer. Each retailer's demand risk consists of two parts: a systematic risk part that affects all retailers and an idiosyncratic risk part that only has a local effect. We propose a macro prediction market to effectively elicit and aggregate useful information about systematic demand risk. We show that such information can be used to achieve accurate demand forecast sharing and better channel coordination …

Robust Control Techniques Enabling Duty Cycle Experiments Utilizing A 6-Dof Crewstation Motion Base, A Full Scale Combat Hybrid Electric Power System, And Long Distance Internet Communications, Marc Compere, Jarrett Goodell, Miguel Simon, Wilford Smith, Mark Brudnak

Publications

The RemoteLink effort supports the U.S. Army's objective for developing and fielding next generation hybrid-electric combat vehicles. It is a distributed soldierin- the-Ioop and hardware-in-the-Ioop environment with a 6-DOF motion base for operator realism, a full-scale combat hybrid electric power system, and an operational context provided by OneSAF. The driver/gunner crewstations rest on one of two 6-DOF motion bases at the U.S. Army TARDEC Simulation Laboratory (TSL). The hybrid power system is located 2,450 miles away at the TARDEC Power and Energy System Integration Laboratory (P&E SIL). The primary technical challenge in the RemoteLink is to operate both laboratories together …

Optimal Placement And Control Of Unified Power Flow Control Devices Using Evolutionary Computing And Sequential Quadratic Programming, Radha P. Kalyani, Mariesa Crow, Daniel R. Tauritz

Electrical and Computer Engineering Faculty Research & Creative Works

A crucial factor effecting modern power systems today is power flow control. An effective means for controlling and improving power flow is by installing fast reacting devices such as a unified power flow controller (UPFC). For maximum positive impact of this device on the power grid, it should be installed at an optimal location and employ an optimal realtime control algorithm. This paper proposes the combination of an evolutionary algorithm (EA) to find the optimal location and sequential quadratic programming (SQP) to optimize the UPFC control settings. Simulations are conducted using the classic IEEE 118 bus test system. For comparison …

Dynamic Programming-Based Energy-Efficient Rate Adaptation For Wireless Ad Hoc Networks, Maciej Jan Zawodniok, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

Resource constraints require that ad hoc wireless networks are energy efficient during transmission and rate adaptation. In this paper we propose a novel cross-layer energy-efficient rate adaptation scheme that employs dynamic programming (DP) principle to analytically select the modulation scheme online. The scheme uses channel state information from the physical layer and congestion information from the scheduling layer to select a modulation rate. This online selection maximizes throughput while saving energy and preventing congestion. The simulation results indicate that an increase in throughput by 96% and energy-efficiency by 131% is observed when compared to the Receiver Based AutoRate (RBAR) protocol.

Modeling Local Interest Points For Semantic Detection And Video Search At Trecvid 2006, Yu-Gang Jiang, Xiaoyong Wei, Chong-Wah Ngo, Hung-Khoon Tan, Wanlei Zhao, Xiao Wu

Research Collection School Of Computing and Information Systems

Local interest points (LIPs) and their features have been shown to obtain surprisingly good results in object detection and recognition. Its effectiveness and scalability, however, have not been seriously addressed in large-scale multimedia database, for instance TRECVID benchmark. The goal of our works is to investigate the role and performance of LIPs, when coupling with multi-modality features, for high-level feature extraction and automatic video search.

Robust Controllability In Temporal Constraint Networks Under Uncertainty, Hoong Chuin Lau, Jia Li, Roland H. C. Yap

Research Collection School Of Computing and Information Systems

Temporal constraint networks are embedded in many planning and scheduling problems. In dynamic problems, a fundamental challenge is to decide whether such a network can be executed as uncertainty is revealed over time. Very little work in this domain has been done in the probabilistic context. In this paper, we propose a Temporal Constraint Network (TCN) model where durations of uncertain activities are represented by random variables. We wish to know whether such a network is robust controllable, i.e. can be executed dynamically within a given failure probability, and if so, how one might find a feasible schedule as the …

Analysis Of Large Scale Image Data Using Out-Of-Core Techniques, Chandrashekara H. Raju, Thomas Wischgoll

Computer Science and Engineering Faculty Publications

No abstract provided.

Ceg 210: Pc Networking I, Chris P. Fickert

Computer Science & Engineering Syllabi

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

Course Goals

At the end of the quarter the student will be able to:

• design and configure a client/server network
• create and manage network objects
• plan and implement directory services and the network file systems
• plan and implement network security
• design and write network login scripts
• manage and solve problems related to a client/server network

Ceg 434/634: Concurrent Software Design, Natsuhiko Futamura

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 the course projects and through readings on operating system design text book.

Ceg 333: Introduction To Unix, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you should be able to:

• Describe the basic methodology of UNIX filters, including pipes and redirection of stdin/stdout

• Program simple UNIX utilities at the command-line and shell-script level • Discuss the advantages and disadvantages of common user interfaces {such as UNIX vs. PC/Windows)

• Discuss the philosophy of UNIX development and the open source movement

• Work comfortably in the UNIX environment

• Edit and manage files and user-level security for UNIX development

• Use standard UNIX development tools for C or C++

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. 4 credit hours. Prerequisite: CEG220 (Introduction to C Programming for Engineers).

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 obects 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

• 2-D and 3-D viewing transformations

• Input devices and interactive techniques •

Visible surface detection methods

Ceg 220: Introduction To C Programming For Engineers I, 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: MTH 229 (Calculus I) or EGR 101 (Engineering Mathematics).

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 420/620: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

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 partnered project.

Ceg 453/653: Design Of Computing Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 360/560 Ee 451/651: 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: CEG 260.

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

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 770: Computer Engineering Mathematics, Yong Pei

Computer Science & Engineering Syllabi

Computer Engineering and Science students need proficiency in relevant applied mathematics to be able to discover and model difficult real-world computer engineering and science problems. The relationship of these problems to mathematical theory will be discussed. This course provides an introduction to linear and nonlinear programming, probability and stochastic process, and queueing theory. In addition to mathematical theory, appropriate applications will be presented.

Ceg 790: Emerging Networks, Bin Wang

Computer Science & Engineering Syllabi

This is a graduate level course on emerging networking technologies. The course involves a reading/lecture/presentation/discussion component, paper review component, and a project component. It will provide an in-depth study on a number of focused areas: dense wavelength division multiplexing (DWDM) optical networks, optical burst switching networks, peer-to-peer networks, and wireless mobile networks (including Ad-hoc wireless networks, sensor networks). Various technical and research issues involved will be studied. These areas of emerging networking technologies will play central roles in future communication networks.

Cs 141: Computer Programming I, Michael Ondrasek

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.

Cs 208: Computer Programming For Business I, Dennis Kellermeier

Computer Science & Engineering Syllabi

No abstract provided.

Cs 214: Object-Based Programming, Eric Maston

Computer Science & Engineering Syllabi

This course is a basic introduction to object oriented programming utilizing the Visual Basic programming language.

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier

Computer Science & Engineering Syllabi

No abstract provided.