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

Computer Sciences Commons™

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

Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 13921 - 13950 of 17319

Full-Text Articles in Computer Sciences

Toward A Two-Tier Clinical Warning System For Hospitalized Patients, Gregory Hackmann, Minmin Chen, Octav Chipara, Chenyang Lu, Yixin Chen, Marin Kollef, Thomas C. Bailey Jan 2010

Toward A Two-Tier Clinical Warning System For Hospitalized Patients, Gregory Hackmann, Minmin Chen, Octav Chipara, Chenyang Lu, Yixin Chen, Marin Kollef, Thomas C. Bailey

All Computer Science and Engineering Research

Clinical study has found early detection and intervention to be essential for preventing clinical deterioration in patients at general hospital units. In this paper, we envision a two-tiered early warning system designed to identify the signs of clinical deterioration and provide early warning of serious clinical events. The first tier of the system automatically identifies patients at risk of clinical deterioration from existing electronic medical record databases. The second tier performs real-time clinical event detection based on real-time vital sign data collected from on-body wireless sensors attached to those high-risk patients. We employ machine-learning techniques to analyze data from both …


An Inexpensive Robot Platform For Teleoperation And Experimentation, Daniel A. Lazewatsky, William D. Smart Jan 2010

An Inexpensive Robot Platform For Teleoperation And Experimentation, Daniel A. Lazewatsky, William D. Smart

All Computer Science and Engineering Research

Most commercially-available robots are either aimed at the research community, or are designed with a single purpose in mind. The extensive hobbyist community has tended to focus on the hardware and the low-level software aspects. We claim that there is a need for a low-cost, general-purpose robot, accessible to the hobbyist community, with sufficient computation and sensing to run ``research-grade'' software. In this paper, we describe the design and implementation of such a robot. We explicitly outline our design goals, and show how a capable robot can be assembled from off-the-shelf parts, for a modest cost, by a single person …


Performance Tuning Of Streaming Applications Via Search-Space Decomposition, Shobana Padmanabhan, Roger D. Chamberlain, Yixin Chen Jan 2010

Performance Tuning Of Streaming Applications Via Search-Space Decomposition, Shobana Padmanabhan, Roger D. Chamberlain, Yixin Chen

All Computer Science and Engineering Research

High-performance streaming applications are typically pipelined and deployed on architecturally diverse (hybrid)systems. Developers of such applications are interested in customizing components used, so as to benefit application performance. We present an efficient and automatic technique for design-space exploration of applications in this problem domain. We solve performance tuning as an optimization problem by formulating cost functions using results from queueing theory. This results in a mixed-integer nonlinear optimization problem which is NP-hard. We reduce the search complexity by decomposing the search space. We have developed a domain-specific decomposition technique using topological information of the application embodied in the queueing network …


Cloud Computing For Scalable Planning By Stochastic Search, Qiang Lu, You Xu, Ruoyun Huang, Yixin Chen Jan 2010

Cloud Computing For Scalable Planning By Stochastic Search, Qiang Lu, You Xu, Ruoyun Huang, Yixin Chen

All Computer Science and Engineering Research

Graph search has been employed by many AI techniques and applications. A natural way to improve the efficiency of search is to utilize ad- vanced, more powerful computing platforms. However, expensive computing infrastructures, such as supercomputers and large-scale clusters, are traditionally available to only a limited number of projects and researchers. As a results, most AI applications, with access to only commodity com- puters and clusters, cannot benefit from the efficiency improvements of high-performance parallel search algorithms. Cloud computing provides an attractive, highly accessible alternative to other traditional high- performance computing platforms. In this paper, we first show that the …


Multi-Channel Reliability And Spectrum Usage In Real Homes: Empirical Studies For Home-Area Sensor Networks, Mo Sha, Gregory Hackmann, Chenyang Lu Jan 2010

Multi-Channel Reliability And Spectrum Usage In Real Homes: Empirical Studies For Home-Area Sensor Networks, Mo Sha, Gregory Hackmann, Chenyang Lu

All Computer Science and Engineering Research

Home area networks (HANs) consisting of wireless sensors have emerged as the enabling technology for important applications such as smart energy and assisted living. A key challenge faced by HANs is maintaining reliable operation in real-world residential environments. This paper presents two in-depth empirical studies on the wireless channels in real homes. The spectrum study analyzes the spectrum usage in the 2.4 GHz band where wireless sensor networks based on the IEEE 802.15.4 standard must coexist with existing wireless devices. We characterize the ambient wireless environment in six apartments through passive spectrum analysis across the entire 2.4 GHz band over …


End-To-End Delay Analysis For Fixed Priority Scheduling In Wirelesshart Networks, Abusayeed Saifullah, You Xu, Chenyang Lu, Yixin Chen Jan 2010

End-To-End Delay Analysis For Fixed Priority Scheduling In Wirelesshart Networks, Abusayeed Saifullah, You Xu, Chenyang Lu, Yixin Chen

All Computer Science and Engineering Research

The WirelessHART standard has been specifically designed for real-time communication between sensor and actuator devices for industrial process monitoring and control. End-to-end communication delay analysis for WirelessHART networks is required for acceptance test of real-time data flows from sensors to actuators and for workload adjustment in response to network dynamics. In this paper, we map the scheduling of real-time periodic data flows in a WirelessHART network to real-time multiprocessor scheduling. We, then, exploit the response time analysis for multiprocessor scheduling and propose a novel method for the end-to-end delay analysis of the real-time flows that are scheduled using a fixed …


The Design And Implementation Of Mcflow: A Real-Time Multi-Core Aware Middleware For Dependent Task Graphs, Huang-Ming Huang, Christopher Gill, Chenyang Lu Jan 2010

The Design And Implementation Of Mcflow: A Real-Time Multi-Core Aware Middleware For Dependent Task Graphs, Huang-Ming Huang, Christopher Gill, Chenyang Lu

All Computer Science and Engineering Research

Modern computer architectures have evolved from uni-processor platforms to multi-processor and multi-core plat- forms, but traditional real-time distributed middleware such as RT-CORBA has not kept pace with that evolution. To address those issues, this paper describes the design and implementation of MCFlow, a new real-time distributed middleware for dependent task graphs running on multi-core platforms. MCFlow provides the following contributions to the state of the art in real-time middleware: (1) it provides an efficient C++ based component model through which computations can be configured flexibly for execution within a single core, across cores of a common host, or spanning multiple …


Priority Assignment For Real-Time Flows In Wirelesshart Sensor-Actuator Networks, Abusayeed Saifullah, You Chenyang, Yixin Chen Jan 2010

Priority Assignment For Real-Time Flows In Wirelesshart Sensor-Actuator Networks, Abusayeed Saifullah, You Chenyang, Yixin Chen

All Computer Science and Engineering Research

Recent years have witnessed the adoption of wireless sensor-actuator networks as a communication infrastructure for process control applications. An important enabling technology for industrial process control is WirelessHART, an open wireless sensor-actuator network standard specifically developed for process industries. A key challenge faced byWirelessHART networks is to meet the stringent real-time communication requirements imposed by feedback control systems in process industries. Fixed priority scheduling, a popular scheduling policy in real-time networks, has recently been shown to be an effective real-time transmission scheduling policy in WirelessHART networks. Priority assignment has a major impact on the schedulability of real-time flows in these …


Optimal Control Of Affine Nonlinear Continuous-Time Systems Using An Online Hamilton-Jacobi-Isaacs Formulation, T. Dierks, Sarangapani Jagannathan Jan 2010

Optimal Control Of Affine Nonlinear Continuous-Time Systems Using An Online Hamilton-Jacobi-Isaacs Formulation, T. Dierks, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

Solving the Hamilton-Jacobi-Isaacs (HJI) equation, commonly used in ℋ∞ optimal control, is often referred to as a two-player differential game where one player tries to minimize the cost function while the other tries to maximize it. in this paper, the HJI equation is formulated online and forward-in-time using a novel single online approximator (SOLA)-Based scheme to achieve optimal regulation and tracking control of affine nonlinear continuous-time systems. the SOLA-Based adaptive approach is designed to learn the infinite horizon HJI equation, the corresponding optimal control input, and the worst-case disturbance. a novel parameter tuning algorithm is derived which not only achieves …


Decentralized Nearly Optimal Control Of A Class Of Interconnected Nonlinear Discrete-Time Systems By Using Online Hamilton-Bellman-Jacobi Formulation, S. Mehraeen, Sarangapani Jagannathan Jan 2010

Decentralized Nearly Optimal Control Of A Class Of Interconnected Nonlinear Discrete-Time Systems By Using Online Hamilton-Bellman-Jacobi Formulation, S. Mehraeen, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, the direct neural dynamic programming technique is utilized to solve the Hamilton Jacobi-Bellman (HJB) equation online and forward-in-time for the decentralized nearly optimal control of nonlinear interconnected discrete-time systems in affine form with unknown internal subsystem and interconnection dynamics. Only the state vector of the local subsystem is considered measurable. the decentralized optimal controller design for each subsystem consists of an action neural network (NN) that is aimed to provide a nearly optimal control signal, and a critic NN which approximates the cost function. the NN weights are tuned online for both the NNs. It is shown …


Output Feedback Control Of A Quadrotor Uav Using Neural Networks, Travis Dierks, Sarangapani Jagannathan Jan 2010

Output Feedback Control Of A Quadrotor Uav Using Neural Networks, Travis Dierks, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a new nonlinear controller for a quadrotor unmanned aerial vehicle (UAV) is proposed using neural networks (NNs) and output feedback. the assumption on the availability of UAV dynamics is not always practical, especially in an outdoor environment. Therefore, in this work, an NN is introduced to learn the complete dynamics of the UAV online, including uncertain nonlinear terms like aerodynamic friction and blade flapping. Although a quadrotor UAV is underactuated, a novel NN virtual control input scheme is proposed which allows all six degrees of freedom (DOF) of the UAV to be controlled using only four control …


Optimal Control Of Affine Nonlinear Continuous-Time Systems, T. Dierks, Sarangapani Jagannathan Jan 2010

Optimal Control Of Affine Nonlinear Continuous-Time Systems, T. Dierks, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, the optimal regulation and tracking control of affine nonlinear continuous-time systems with known dynamics is undertaken using a novel single online approximator (SOL)-Based scheme. the SOLA-Based adaptive approach is designed to learn the infinite horizon continuous time Hamilton-Jacobi-Bellman (HJB) equation and its corresponding optimal control input. a novel parameter tuning algorithm is derived which not only ensures the optimal cost (HJB) function and control input are achieved, but also ensures the system states remain bounded during the online learning process. Lyapunov techniques show that all signals are uniformly ultimately bounded (UUB) and the approximated control signal approaches …


Novel Dynamic Representation And Control Of Power Systems With Facts Devices, Shahab Mehraeen, Jagannathan Sarangapani, Mariesa Crow Jan 2010

Novel Dynamic Representation And Control Of Power Systems With Facts Devices, Shahab Mehraeen, Jagannathan Sarangapani, Mariesa Crow

Electrical and Computer Engineering Faculty Research & Creative Works

FACTS devices have been shown to be useful in damping power system oscillations. However, in large power systems, the FACTS control design is complex due to the combination of differential and algebraic equations required to model the power system. In this paper, a new method to generate a nonlinear dynamic representation of the power network is introduced to enable more sophisticated control design. Once the new representation is obtained, a back stepping methodology for the UPFC is utilized to mitigate the generator oscillations. Finally, the neural network approximation property is utilized to relax the need for knowledge of the power …


Cs 400-01: Data Structures And Software Design, Meilin Liu Jan 2010

Cs 400-01: Data Structures And Software Design, Meilin Liu

Computer Science & Engineering Syllabi

This is a fundamental course for students majoring in Computer Science. Students will learn: basic algorithm analysis techniques; asymptotic complexity; big-0 and big-Omega notations; efficient algorithms for discrete structures including lists, trees, stacks, and graphs; fundamental computing algorithms including sorting, searching, and hashing techniques.


Cs 241-02: Computer Programming - Ii, Michael Ondrasek Jan 2010

Cs 241-02: Computer Programming - Ii, Michael Ondrasek

Computer Science & Engineering Syllabi

The CS 241 course is a continuation of CS 240. The emphasis in CS 241 is on solving more complex problems using object oriented programming. Prerequisite: CS240. Students must register for both lecture and one laboratory section. 4 credit hours.


Cs 340-01: Programming Language Workshop In C#, Krishnaprasad Thirunarayan Jan 2010

Cs 340-01: 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 790-01: Knowledge Representation For The Semantic Web, Pascal Hitzler Jan 2010

Cs 790-01: Knowledge Representation For The Semantic Web, Pascal Hitzler

Computer Science & Engineering Syllabi

Semantic Web is a maturing field of technology that continues to be the emphasis of much focused research and industrial investigation. The central idea behind Semantic Web is to enhance data on the World Wide Web by so-called metadata, which describes the meaning (semantics) of the data and thus makes it available for processing in intelligent systems. In this course we cover in depth the standardized knowledge representation languages for expressing metadata, called ontology languages. We will in particular cover the Resource Description Framework RDF and the Web Ontology Language OWL, both of which are recommended standards by the World …


Cs 240: Computer Programming I, Vanessa Starkey Jan 2010

Cs 240: Computer Programming I, Vanessa Starkey

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement.


Cs 241-01: Computer Programming Ii, Travis E. Doom Jan 2010

Cs 241-01: Computer Programming Ii, Travis E. Doom

Computer Science & Engineering Syllabi

A continuation of CS240. The emphasis is on data abstraction and software engineering. Prerequisite: CS240.


Cs 400/600-01: Data Structures And Software Design, Guozhu Dong Jan 2010

Cs 400/600-01: Data Structures And Software Design, Guozhu Dong

Computer Science & Engineering Syllabi

No abstract provided.


Cs 714-01: Machine Learning, Shaojun Wang Jan 2010

Cs 714-01: Machine Learning, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.


Cs 242-01: Computer Programming Iii, Mateen M. Rizki Jan 2010

Cs 242-01: Computer Programming Iii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.


Cs 302-01: Introduction To Oracle/Sql Databases, Karen Meyer Jan 2010

Cs 302-01: Introduction To Oracle/Sql Databases, Karen Meyer

Computer Science & Engineering Syllabi

Relational client server database design and access techniques. Includes building database tables, writing SQL and PL/SQL statements and programs and developing user interfaces using forms and reports.


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

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 405/605-01: Introduction To Database Management Systems, Guozhu Dong Jan 2010

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

Computer Science & Engineering Syllabi

Logical and physical aspects of database management systems are surveyed. Data models including entity-relationship (ER) and relational models are presented. Physical implementation (data organization and indexing) methods are discussed. Query languages including SQL, relational algebra, relational calculus, and QBE are studied. Students will gain experience in creating and manipulating a database, and gain knowledge on professional and ethical responsibility and on the importance of privacy/security of data.


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

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 771-01: Natural Language Processing Techniques, Shaojun Wang Jan 2010

Cs 771-01: Natural Language Processing Techniques, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.


Cs 740-01: Algorithms, Complexity And The Theory Of Computability, Michael L. Raymer Jan 2010

Cs 740-01: Algorithms, Complexity And The Theory Of Computability, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.


Cs 707-01: Information Retrieval, Krishnaprasad Thirunarayan Jan 2010

Cs 707-01: Information Retrieval, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course covers models for information retrieval, techniques for indexing and searching, and algorithms for classification and clustering. It will also cover SVM, latent semantic indexing, link analysis and ranking, Map-Reduce architecture and Hadoop, to different degrees of detail, time permitting.


Ceg 402/602-01: Introduction To Computer Communication, Bin Wang Jan 2010

Ceg 402/602-01: Introduction To Computer Communication, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.