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 15061 - 15090 of 17316

Full-Text Articles in Engineering

Gigabit Concept Mining: A Sensitivity Analysis, Masters Thesis, December 2006, Andrew Levine Jan 2007

Gigabit Concept Mining: A Sensitivity Analysis, Masters Thesis, December 2006, Andrew Levine

All Computer Science and Engineering Research

Massive amounts of data are passed over public networks. There is a need for network administrators to analyze this traffic, but it was not previously possible to analyze live network data at high speed. It has been shown that streaming computation and deep packet analysis are possible at very high rates through the use of hardware acceleration. This work provides analysis for a larger project that involves digesting large amounts of network traffic. In this system, we process the traffic using hardware that has constraints. The workings of the system are first discussed. Tradeoffs in the design of hardware and …


Ceg 477/677-01: Computer Graphics Ii, John A. Reisner Jan 2007

Ceg 477/677-01: Computer Graphics Ii, John A. Reisner

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 210-01: Pc Networking I, Karen Meyer Jan 2007

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, hardware and software configuration.


Ceg 434/634-01: Concurrent Software Design, Natsuhiko Futamura Jan 2007

Ceg 434/634-01: Concurrent Software Design, Natsuhiko Futamura

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 260-01: Digital Computer Hardware, Sridhar Ramachandran Jan 2007

Ceg 260-01: Digital Computer Hardware, Sridhar Ramachandran

Computer Science & Engineering Syllabi

Digital Computer Hardware. Topics include switching algebra and switching functions, logic design of combinational and sequential circuits using TTL, combinational logic design with MSI and LSI, busing, storage elements, and instrumentation. 3 hours lecture, 2 hours lab. Prerequisite: CS 241.


Medium Access Control Protocols And Routing Algorithms For Wireless Sensor Networks, Anirban Bag Jan 2007

Medium Access Control Protocols And Routing Algorithms For Wireless Sensor Networks, Anirban Bag

Electronic Theses and Dissertations

In recent years, the development of a large variety of mobile computing devices has led to wide scale deployment and use of wireless ad hoc and sensor networks. Wireless Sensor Networks consist of battery powered, tiny and cheap "motes", having sensing and wireless communication capabilities. Although wireless motes have limited battery power, communication and computation capabilities, the range of their application is vast. In the first part of the dissertation, we have addressed the specific application of Biomedical Sensor Networks. To solve the problem of data routing in these networks, we have proposed the Adaptive Least Temperature Routing (ALTR) algorithm …


Spatial Diversity In Signal Strength Based Wlan Location Determination Systems, Anil Ramachandran, Jagannathan Sarangapani Jan 2007

Spatial Diversity In Signal Strength Based Wlan Location Determination Systems, Anil Ramachandran, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

Literature indicates that spatial diversity can be utilized to compensate channel uncertainties such as multipath fading. Therefore, in this paper, spatial diversity is exploited for locating stationary and mobile objects in the indoor environment. First, space diversity technique is introduced for small scale motion and temporal variation compensation of received signal strength and it is demonstrated analytically that it enhances location accuracy. Small scale motion refers to movements of the transmitter and/or the receiver of the order of sub-wavelengths while temporal effects refer to environmental variations with time. A novel metric is introduced for selection combining in order to improve …


An Online Approximator-Based Fault Detection Framework For Nonlinear Discrete-Time Systems, Balaje T. Thumati, Jagannathan Sarangapani Jan 2007

An Online Approximator-Based Fault Detection Framework For Nonlinear Discrete-Time Systems, Balaje T. Thumati, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a fault detection scheme is developed for nonlinear discrete time systems. The changes in the system dynamics due to incipient failures are modeled as a nonlinear function of state and input variables while the time profile of the failures is assumed to be exponentially developing. The fault is detected by monitoring the system and is approximated by using online approximators. A stable adaptation law in discrete-time is developed in order to characterize the faults. The robustness of the diagnosis scheme is shown by extensive mathematical analysis and simulation results.


Route Aware Predictive Congestion Control Protocol For Wireless Sensor Networks, Carl Larsen, Maciej Jan Zawodniok, Jagannathan Sarangapani Jan 2007

Route Aware Predictive Congestion Control Protocol For Wireless Sensor Networks, Carl Larsen, Maciej Jan Zawodniok, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

Congestion in wireless sensor networks (WSN) may lead to packet losses or delayed delivery of important information rendering the WSN-based monitoring or control system useless. In this paper a routing-aware predictive congestion control (RPCC) yet decentralized scheme for WSN is presented that uses a combination of a hop by hop congestion control mechanism to maintain desired level of buffer occupancy, and a dynamic routing scheme that works in concert with the congestion control mechanism to forward the packets through less congested nodes. The proposed adaptive approach restricts the incoming traffic thus preventing buffer overflow while maintaining the rate through an …


Neural Network Control Of Robot Formations Using Rise Feedback, Jagannathan Sarangapani, Travis Alan Dierks Jan 2007

Neural Network Control Of Robot Formations Using Rise Feedback, Jagannathan Sarangapani, Travis Alan Dierks

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a combined kinematic/torque control law is developed for leader-follower based formation control using backstepping in order to accommodate the dynamics of the robots and the formation in contrast with kinematic-based formation controllers that are widely reported in the literature. A neural network (NN) is introduced along with robust integral of the sign of the error (RISE) feedback to approximate the dynamics of the follower as well as its leader using online weight tuning. It is shown using Lyapunov theory that the errors for the entire formation are asymptotically stable and the NN weights are bounded as opposed …


Online Reinforcement Learning Control Of Unknown Nonaffine Nonlinear Discrete Time Systems, Qinmin Yang, Jagannathan Sarangapani Jan 2007

Online Reinforcement Learning Control Of Unknown Nonaffine Nonlinear Discrete Time Systems, Qinmin Yang, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a novel neural network (NN) based online reinforcement learning controller is designed for nonaffine nonlinear discrete-time systems with bounded disturbances. The nonaffine systems are represented by nonlinear auto regressive moving average with exogenous input (NARMAX) model with unknown nonlinear functions. An equivalent affine-like representation for the tracking error dynamics is developed first from the original nonaffine system. Subsequently, a reinforcement learning-based neural network (NN) controller is proposed for the affine-like nonlinear error dynamic system. The control scheme consists of two NNs. One NN is designated as the critic, which approximates a predefined long-term cost function, whereas an …


Online Reinforcement Learning Neural Network Controller Design For Nanomanipulation, Qinmin Yang, Jagannathan Sarangapani Jan 2007

Online Reinforcement Learning Neural Network Controller Design For Nanomanipulation, Qinmin Yang, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a novel reinforcement learning neural network (NN)-based controller, referred to adaptive critic controller, is proposed for affine nonlinear discrete-time systems with applications to nanomanipulation. In the online NN reinforcement learning method, one NN is designated as the critic NN, which approximates the long-term cost function by assuming that the states of the nonlinear systems is available for measurement. An action NN is employed to derive an optimal control signal to track a desired system trajectory while minimizing the cost function. Online updating weight tuning schemes for these two NNs are also derived. By using the Lyapunov approach, …


Ceg 498-01: Design Experience, Thomas C. Hartrum Jan 2007

Ceg 498-01: 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.


Cs 208-01: Computer Programming For Business I, Dennis Kellermeier Jan 2007

Cs 208-01: 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 241-01: Introduction To Computer Science Ii, Mateen M. Rizki Jan 2007

Cs 241-01: Introduction To Computer Science Ii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.


Cs 142-01: Computer Programming Ii, Haiyun Bian Jan 2007

Cs 142-01: Computer Programming Ii, Haiyun Bian

Computer Science & Engineering Syllabi

Concepts introduced in CS 141 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, graphics, development of user interfaces and exception handling. Student must register for both lecture and one lab section.


Cs 141-01: Computer Programming - I, Michael Ondrasek Jan 2007

Cs 141-01: 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. 4 credit hours. Prerequisite: MTH 127 (College Algebra) or equivalent.


Cs 205-01: Introduction To Computers And Office Productivity Software, Kim Gros Jan 2007

Cs 205-01: Introduction To Computers And Office Productivity Software, Kim Gros

Computer Science & Engineering Syllabi

Focus on learning MS Office software applications including word processing (intermediate), spreadsheet database and presentation graphics using a case study approach where critical thinking and problem solving skills are required. Computer concepts are integrated throughout the course to provide an understanding of the basics of computing, the latest technological advances and how they are used in industry. Ethics and issues encountered in business are discussed to challenge students on societal impact of technology.


Cs 209-01: Computer Programming For Business Ii, Dennis Kellermeier Jan 2007

Cs 209-01: 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.


Cs 214-01: Visual Basic Programming, Michael Ondrasek Jan 2007

Cs 214-01: Visual Basic Programming, Michael Ondrasek

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of object computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. However, students should have a familiarity with programming concepts. The concepts covered will be applied in the Visual Basic programming language. 4 credit hours.


Cs 241-01: Computer Science Ii, Eric Maston Jan 2007

Cs 241-01: 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.


Cs 242-01: Computer Science Iii, Eric Maston Jan 2007

Cs 242-01: Computer Science Iii, Eric Maston

Computer Science & Engineering Syllabi

This is the third and final course in the Introduction to Computer Science series. This course focuses on data structures with abstract data types, such as trees, stacks, queues and tables.


Cs 240-01: Introduction To Computer Science I, Dale E. Nelson Jan 2007

Cs 240-01: Introduction To Computer Science I, Dale E. Nelson

Computer Science & Engineering Syllabi

No abstract provided.


Cs 241-02, 03: Introduction To Computer Science Ii, Haiyun Bian Jan 2007

Cs 241-02, 03: Introduction To Computer Science Ii, Haiyun Bian

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. Concepts introduced in CS 240 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, graphics, development of user interfaces and exception handling. Student must register for one lecture section and one lab section.


Cs 400/600-01: Data Structures And Software Design, Michael L. Raymer Jan 2007

Cs 400/600-01: Data Structures And Software Design, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.


Cs 480/680-01: Comparative Programming Languages, Michael L. Raymer Jan 2007

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

Computer Science & Engineering Syllabi

No abstract provided.


Cs 415-01: Social Implications Of Computing, Leo Finkelstein Jan 2007

Cs 415-01: 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.


Cs 701-01: Database Systems And Design, Soon M. Chung Jan 2007

Cs 701-01: Database Systems And Design, Soon M. Chung

Computer Science & Engineering Syllabi

Introduction of DB design concepts and operating principles of database systems.


Cs 765-01: Foundations Of Neurocomputation, Mateen M. Rizki Jan 2007

Cs 765-01: 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.


Cs 790-02: Advanced Data Mining, Guozhu Dong Jan 2007

Cs 790-02: Advanced Data Mining, Guozhu Dong

Computer Science & Engineering Syllabi

In this course we will cover advanced topics in data mining. We will study some classic papers as well as some important recent papers, on different types of applications, in this fast evolving field. Topics include: sequence mining, text mining, graph mining, data warehouse/cube mining, micro-array gene expression mining, privacy w.r.t. data mining, sensor network mining, data stream mining, time series mining, web mining, etc. The aim is to prepare you for advanced data mining research and application development.