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 10861 - 10890 of 13037

Full-Text Articles in Computer Engineering

Scheduling Design With Unknown Execution Time Distributions Or Modes, Robert Glaubius, Terry Tidwell, Christopher Gill, William D. Smart Jan 2009

Scheduling Design With Unknown Execution Time Distributions Or Modes, Robert Glaubius, Terry Tidwell, Christopher Gill, William D. Smart

All Computer Science and Engineering Research

Open soft real-time systems, such as mobile robots, experience unpredictable interactions with their environments and yet must respond both adaptively and with reasonable temporal predictability. Because of the uncertainty inherent in such interactions, many of the assumptions of the real-time scheduling techniques traditionally used to ensure predictable timing of system actions do not hold in those environments. In previous work we have developed novel techniques for scheduling policy design where up-front knowledge of execution time distributions can be used to produce both compact representations of resource utilization state spaces and efficient optimal scheduling policies over those state spaces. This paper …

Go to article

The Design And Performance Of Cyber-Physical Middleware For Real-Time Hybrid Structural Testing, Huang-Ming Huang, Xiuyu Gao, Terry Tidewell, Christopher Gill Jan 2009

The Design And Performance Of Cyber-Physical Middleware For Real-Time Hybrid Structural Testing, Huang-Ming Huang, Xiuyu Gao, Terry Tidewell, Christopher Gill

All Computer Science and Engineering Research

Real-time hybrid testing of civil structures, in which computational models and physical components must be integrated with high fidelity at run-time represents a grand challenge in the emerging area of cyber-physical systems. Actuator dynamics, complex interactions among computers and physical components, and computation and communication delays all must be managed carefully to achieve accurate tests. To address these challenges, we have developed a novel middleware for integrating cyber and physical components flexibly and with suitable timing behavior within a Cyber-physical Instrument for Real-time hybrid Structural Testing (CIRST). This paper makes three main contributions to the state of the art in …

Go to article

Enabling A Low-Delay Internet Service Via Built-In Performance Incentives, Maxim Podlesny, Sergey Gorinsky Jan 2009

Enabling A Low-Delay Internet Service Via Built-In Performance Incentives, Maxim Podlesny, Sergey Gorinsky

All Computer Science and Engineering Research

The single best-effort service of the Internet struggles to accommodate divergent needs of different distributed applications. Numerous alternative network architectures have been proposed to offer diversified network services. These innovative solutions failed to gain wide deployment primarily due to economic and legacy issues rather than technical shortcomings. Our paper presents a new simple paradigm for network service differentiation that accounts explicitly for the multiplicity of Internet service providers and users as well as their economic interests in environments with partly deployed new services. Our key idea is to base the service differentiation on performance itself, rather than price. We design …

Go to article

Design Of An Extensible Network Testbed With Heterogeneous Components, Charlie Wisemen, Jyoti Parwatikar, Ken Wong, John Dehart, Jonathan Turner Jan 2009

Design Of An Extensible Network Testbed With Heterogeneous Components, Charlie Wisemen, Jyoti Parwatikar, Ken Wong, John Dehart, Jonathan Turner

All Computer Science and Engineering Research

Virtualized network infrastructures are currently deployed in both research and commercial contexts. The complexity of the virtualization layer varies greatly in different deployments, ranging from cloud computing environments, to carrier Ethernet applications using stacked VLANs, to networking testbeds. In all of these cases, there are many users sharing the resources of one provider, where each user expects their resources to be isolated from all other users. Our work in this area is focused on network testbeds. In particular, we present the design of the latest version of the Open Network Laboratory (ONL) testbed. This redesign generalizes the underlying infrastructure to …

Go to article

Robust Sensor Networks In Homes Via Reactive Channel Hopping, Mo Sha, Greg Hackmann, Chenyang Lu Jan 2009

Robust Sensor Networks In Homes Via Reactive Channel Hopping, Mo Sha, Greg 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 in deploying robust wireless sensor networks (WSNs) for home automation applications is the need to provide long-term, reliable operation in the face of the varied sources of interference found in typical residential settings. To better understand the channel dynamics in these environments, we performed an in-depth empirical study of the performance of HANs in ten real-life apartments. Our empirical study leads to several key insights into designing robust HANs for residential environments. …

Go to article

Reliable Patient Monitoring: A Clinical Study In A Step-Down Hospital Unit, Octav Chipara, Chenyang Lu, Thomas C. Bailey, Gruia-Catalin Roman Jan 2009

Reliable Patient Monitoring: A Clinical Study In A Step-Down Hospital Unit, Octav Chipara, Chenyang Lu, Thomas C. Bailey, Gruia-Catalin Roman

All Computer Science and Engineering Research

This paper presents the design, deployment, and empirical study of a wireless clinical monitoring system that collects pulse and oxygen saturation readings from patients. The primary contribution of this paper is an in-depth clinical trial that assesses the feasibility of wireless sensor networks for patient monitoring in general (non-ICU) hospital units. The trial involved 32 patients monitored in a step-down cardiology unit at Barnes-Jewish Hospital, St. Louis. During a total of 31 days of monitoring, the network achieved high reliability (median 99.92%, range 95.21% - 100%). The overall reliability of the system was dominated by sensing reliability (median 80.55%, range …

Go to article

Multicast Encryption Infrastructure For Security In Sensor Networks, Richard R. Brooks, Brijesh Pillai, Matthew Pirretti, Michele C. Weigle Jan 2009

Multicast Encryption Infrastructure For Security In Sensor Networks, Richard R. Brooks, Brijesh Pillai, Matthew Pirretti, Michele C. Weigle

Computer Science Faculty Publications

Designing secure sensor networks is difficult. We propose an approach that uses multicast communications and requires fewer encryptions than pairwise communications. The network is partitioned into multicast regions; each region is managed by a sensor node chosen to act as a keyserver. The keyservers solicit nodes in their neighborhood to join the local multicast tree. The keyserver generates a binary tree of keys to maintain communication within the multicast region using a shared key. Our approach supports a distributed key agreement protocol that identifies the compromised keys and supports membership changes with minimum system overhead. We evaluate the overhead of …

Go to article

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 …

Go to article

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 …

Go to article

Graphical User Interfaces As Updatable Views, James Felger Terwilliger Nov 2008

Graphical User Interfaces As Updatable Views, James Felger Terwilliger

Dissertations and Theses

In contrast to a traditional setting where users express queries against the database schema, we assert that the semantics of data can often be understood by viewing the data in the context of the user interface (UI) of the software tool used to enter the data. That is, we believe that users will understand the data in a database by seeing the labels, dropdown menus, tool tips, help text, control contents, and juxtaposition or arrangement of controls that are built in to the user interface. Our goal is to allow domain experts with little technical skill to understand and query …

Go to article

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 …

Go to article

Modeling Video Hyperlinks With Hypergraph For Web Video Reranking, Hung-Khoon Tan, Chong-Wah Ngo, Xiao Wu Oct 2008

Modeling Video Hyperlinks With Hypergraph For Web Video Reranking, Hung-Khoon Tan, Chong-Wah Ngo, Xiao Wu

Research Collection School Of Computing and Information Systems

In this paper, we investigate a novel approach of exploiting visual-duplicates for web video reranking using hypergraph. Current graph-based reranking approaches consider mainly the pair-wise linking of keyframes and ignore reliability issues that are inherent in such representation. We exploit higher order relation to overcome the issues of missing links in visual-duplicate keyframes and in addition identify the latent relationships among keyframes. Based on hypergraph, we consider two groups of video threads: visual near-duplicate threads and story threads, to hyperlink web videos and describe the higher order information existing in video content. To facilitate reranking using random walk algorithm, the …

Go to article

Fusing Semantics, Observability, Reliability And Diversity Of Concept Detectors For Video Search, Xiao-Yong Wei, Chong-Wah Ngo Oct 2008

Fusing Semantics, Observability, Reliability And Diversity Of Concept Detectors For Video Search, Xiao-Yong Wei, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Effective utilization of semantic concept detectors for large-scale video search has recently become a topic of intensive studies. One of main challenges is the selection and fusion of appropriate detectors, which considers not only semantics but also the reliability of detectors, observability and diversity of detectors in target video domains. In this paper, we present a novel fusion technique which considers different aspects of detectors for query answering. In addition to utilizing detectors for bridging the semantic gap of user queries and multimedia data, we also address the issue of "observability gap" among detectors which could not be directly inferred …

Go to article

Ontology-Based Visual Word Matching For Near-Duplicate Retrieval, Yu-Gang Jiang, Chong-Wah Ngo Oct 2008

Ontology-Based Visual Word Matching For Near-Duplicate Retrieval, Yu-Gang Jiang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper proposes a novel approach to exploit the ontological relationship of visual words by linguistic reasoning. A visual word ontology is constructed to facilitate the rigorous evaluation of linguistic similarity across visual words. The linguistic similarity measurement enables cross-bin matching of visual words, compromising the effectiveness and speed of conventional keypoint matching and bag-of-word approaches. A constraint EMD is proposed and experimented to efficiently match visual words. Empirical findings indicate that the proposed approach offers satisfactory performance to near-duplicate retrieval, while still enjoying the merit of speed efficiency compared with other techniques.

Go to article

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.

Go to article

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

Ceg 453/653: Embedded Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 770: Computer Engineering Mathematics, Yong Pei Oct 2008

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.

Go to article

Cs 705: Introduction To Data Mining, Guozhu Dong Oct 2008

Cs 705: Introduction To Data Mining, Guozhu Dong

Computer Science & Engineering Syllabi

Data mining is concerned with the extraction of novel and useful knowledge from large amounts of data. This course introduces and studies the fundamental concepts, issues, tasks and techniques of data mining. Topics include data preparation and feature selection, association rules, classification, clustering, evaluation and validation, scalability, spatial and sequence mining, privacy, and data mining applications. 3 hours lecture, 2 hours lab.

Go to article

Cs 766: Evolutionary Computation, Mateen M. Rizki Oct 2008

Cs 766: Evolutionary Computation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course explores evolutionary computation from a historical, theoretical, and application viewpoint. An overview of the most common evolutionary search techniques are presented including genetic algorithms, evolutionary programming, evolutionary strategies, and genetic programming. The fundamental issues driving the choice of problem representation and specific genetic operators are discussed. Various applications of evolutionary computation to problems in control, optimization, and pattern recognition are examined.

Go to article

Cs 141: Computer Programming - I, Michael Ondrasek Oct 2008

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

Go to article

Ceg 320/520: Computer Organization And Assembly Language Programming, Travis E. Doom Oct 2008

Ceg 320/520: Computer Organization And Assembly Language Programming, Travis E. Doom

Computer Science & Engineering Syllabi

Terminology and understanding of functional organizations and sequential operation of a digital computer. Program structure, and machine and assembly language topics including addressing, stacks, argument pasing, arithmetic operations, traps, and input/output. Macros, modularization, linkers, and debuggers are used.

Go to article

Cs 466/666: Introduction To Formal Languages, Guozhu Dong Oct 2008

Cs 466/666: Introduction To Formal Languages, Guozhu Dong

Computer Science & Engineering Syllabi

CS 466/666 is an introduction to formal language and automata theory. In this course we will examine methods for defining syntax of languages and recognizing patterns: the syntax of languages can be defined using grammars and patterns accepted by finite state machines. Along with presenting the fundamentals of these two topics, the course will develop and investigate the relationships between language definition and pattern recognition. The text will be the third edition of Languages and Machines: An Introduction to the Theory of Computer Science, by Thomas Sudkamp.

Go to article

Cs 409/609: Principles Of Artificial Intelligence, Shaojun Wang Oct 2008

Cs 409/609: Principles Of Artificial Intelligence, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 240: Introduction To Computer Science I, Mateen M. Rizki Oct 2008

Cs 240: Introduction To Computer Science I, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 415: Social Implications Of Computing, Leo Finkelstein Oct 2008

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 241: Introduction To Computer Science Ii, Ronald F. Taylor Oct 2008

Cs 241: Introduction To Computer Science Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

A continuation of CS 240. Emphasis is on solving more complex problems using object oriented programming. Prerequisite: CS 240. 4 credit hours.

Go to article

Cs 400/600: Data Structures And Software Design, Keke Chen Oct 2008

Cs 400/600: Data Structures And Software Design, Keke Chen

Computer Science & Engineering Syllabi

This course will cover the implementation of classical data structures and control structures, an introduction to the fundamentals of algorithm design and analysis, and the basic problem solving techniques.

Go to article

Ceg/Ee 260: Digital Computer Hardware Switching Circuits, John C. Gallagher Oct 2008

Ceg/Ee 260: Digital Computer Hardware Switching Circuits, John C. Gallagher

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.

Go to article

Cs 205-08: Introduction To Computers And Office Productivity Software, Kim Gros Oct 2008

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

Computer Science & Engineering Syllabi

Focus on learning MS Office software applications including word processing (intermediate), spreadsheets, 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.

Go to article

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp Oct 2008

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp

Computer Science & Engineering Syllabi

This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. Although the Turing machine provides a simple computational framework, the Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.

Go to article

First Prev Next Last