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

Engineering Commons

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

Series

Computer Sciences

2005

Institution
Keyword
Publication

Articles 1 - 30 of 251

Full-Text Articles in Engineering

Architecture And Execution Model For A Survivable Workflow Transaction Infrastructure, Haraldur D. Thorvaldsson, Kenneth J. Goldman Dec 2005

Architecture And Execution Model For A Survivable Workflow Transaction Infrastructure, Haraldur D. Thorvaldsson, Kenneth J. Goldman

All Computer Science and Engineering Research

We present a novel architecture and execution model for an infrastructure supporting fault-tolerant, long-running distributed applications spanning multiple administrative domains. Components for both transaction processing and persistent state are replicated across multiple servers, en-suring that applications continue to function correctly de-spite arbitrary (Byzantine) failure of a bounded number of servers. We give a formal model of application execution, based on atomic execution steps, linearizability and a sep-aration between data objects and transactions that act on them. The architecture is designed for robust interoperability across domains, in an open and shared Internet computing infrastructure. A notable feature supporting cross-domain applications is ...


Loss Aware Rate Allocations In H.263 Coded Video Transmissions, Xiao Su, Benjamin Wah Dec 2005

Loss Aware Rate Allocations In H.263 Coded Video Transmissions, Xiao Su, Benjamin Wah

Faculty Publications

For packet video, information loss and bandwidth limitation are two factors that affect video playback quality. Traditional rate allocation approaches have focused on optimizing video quality under bandwidth constraint alone. However, in the best-effort Internet, packets carrying video data are susceptible to losses, which need to be reconstructed at the receiver side. In this paper, we propose loss aware rate allocations in both group-of-block (GOB) level and macroblock level, given that certain packets are lost during transmissions and reconstructed using simple interpolation methods at the receiver side. Experimental results show that our proposed algorithms can produce videos of higher quality ...


A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan Dec 2005

A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan

Research Collection School Of Computing and Information Systems

Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a well- designed set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that ...


Roadmap Query For Sensor Network Assisted Navigation In Dynamic Environments, Sangeeta Bhattacharya, Nuzhet Atay, Gazihan Alankus, Chenyang Lu, O. Burchan Bayazit, Gruia-Catalin Roman Nov 2005

Roadmap Query For Sensor Network Assisted Navigation In Dynamic Environments, Sangeeta Bhattacharya, Nuzhet Atay, Gazihan Alankus, Chenyang Lu, O. Burchan Bayazit, Gruia-Catalin Roman

All Computer Science and Engineering Research

Autonomous mobile entity navigation through dynamic and unknown environments is an essential part of many mission critical applications like search and rescue and fire fighting. The dynamism of the environment necessitates the mobile entity to constantly maintain a high degree of awareness of the changing environment. This criteria makes it difficult to achieve good navigation performance by using just on-board sensors and existing navigation methods and motivates the use of wireless sensor networks (WSNs) to aid navigation. In this paper, we present a novel approach that integrates a roadmap based navigation algorithm with a novel network query protocol called Roadmap ...


Group Scheduling In Selinux To Mitigate Cpu-Focused Denial Of Service Attacks, Armando Migliaccio, Terry Tidwell, Christopher Gill, Tejasvi Aswathanarayana, Douglas Niehaus Nov 2005

Group Scheduling In Selinux To Mitigate Cpu-Focused Denial Of Service Attacks, Armando Migliaccio, Terry Tidwell, Christopher Gill, Tejasvi Aswathanarayana, Douglas Niehaus

All Computer Science and Engineering Research

Popular security techniques such as public-private key encryption, firewalls, and role-based access control offer significant protec-tion of system data, but offer only limited protection of the computations using that data from significant interference due to accident or adversarial attack. However, in an increasing number of modern systems, ensuring the reliable execution of system activities is every bit as important as ensuring data security. This paper makes three contributions to the state of the art in protection of the execution of system activities from accidental or adversarial interference. First, we consider the motivating problem of CPU-focused denial of service attacks, and ...


End-To-End Scheduling Strategies For Aperiodic Tasks In Middleware, Yuanfang Zhang, Chenyang Lu, Christopher Gill, Patrick Lardieri, Gautum Thaker Nov 2005

End-To-End Scheduling Strategies For Aperiodic Tasks In Middleware, Yuanfang Zhang, Chenyang Lu, Christopher Gill, Patrick Lardieri, Gautum Thaker

All Computer Science and Engineering Research

Many mission-critical distributed real-time applicationsmust handle aperiodic tasks with hard end-to-end dead-lines. Existing middleware such as RT-CORBA lacksschedulability analysis and run-time scheduling mecha-nisms that can provide real-time guarantees to aperiodictasks. This paper makes the following contributions to thestate of the art for end-to-end aperiodic scheduling in mid-dleware. First, we compare two approaches to aperiodicscheduling, the deferrable server and the aperiodic utiliza-tion bound, using representative workloads. Numerical re-sults show that the deferrable server analysis is less pes-simistic than the aperiodic utilization bounds when appliedoffline. Second, we propose a practical approach to tuningdeferrable servers for end-to-end tasks. Third, we describedeferrable server mechanisms ...


Context Aware Service Oriented Computing In Mobile Ad Hoc Networks, Radu Handorean, Gruia-Catalin Roman, Christopher Gill Nov 2005

Context Aware Service Oriented Computing In Mobile Ad Hoc Networks, Radu Handorean, Gruia-Catalin Roman, Christopher Gill

All Computer Science and Engineering Research

These days we witness a major shift towards small, mobile devices, capable of wireless communication. Their communication capabilities enable them to form mobile ad hoc networks and share resources and capabilities. Service Oriented Computing (SOC) is a new emerging paradigm for distributed computing that has evolved from object-oriented and component-oriented computing to enable applications distributed within and across organizational boundaries. Services are autonomous computational elements that can be described, published, discovered, and orchestrated for the purpose of developing applications. The application of the SOC model to mobile devices provides a loosely coupled model for distributed processing in a resource-poor and ...


Minimum Power Configuration For Wireless Communication In Sensor Networks, Guoliang Xing, Chenyang Lu, Ying Zhang, Qingfeng Huang, Robert Pless Nov 2005

Minimum Power Configuration For Wireless Communication In Sensor Networks, Guoliang Xing, Chenyang Lu, Ying Zhang, Qingfeng Huang, Robert Pless

All Computer Science and Engineering Research

This paper proposes the Minimum Power Configuration (MPC) approach to power management in wireless sensor networks. In contrast to earlier research that treats different radio states (transmission/reception/idle) in isolation, MPC integrates them in a joint optimization problem that depends on both the set of active nodes and the transmission power. We propose four approximation algorithms with provable performance bounds and two practical routing protocols. Simulations based on realistic radio models show that the MPC approach can conserve more energy than existing minimum power routing and topology control protocols. Furthermore, it can flexibly adapt to network workload and radio ...


The Screech Owl Reasoner - Scalable Approximate Abox Reasoning With Owl, Pascal Hitzler, Denny Vrandecic Nov 2005

The Screech Owl Reasoner - Scalable Approximate Abox Reasoning With Owl, Pascal Hitzler, Denny Vrandecic

Computer Science and Engineering Faculty Publications

We present a preliminary version of the approximate OWL reasoning system SCREECH. It builds on the KAON2 system and performs OWL ABox reasoning in an approximate manner. It trades soundness of reasoning for efficiency, with resulting polynomial worst-case data complexity. It has been developed for use in time-critical applications where quick response time is more important than a full guarantee of correctness of answers. The theoretical background for the system is explained in [Hitzler and Vrandecic, 2005] and is being presented at the conference.


Mobiquery: A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Guoliang Xing, Sangeeta Bhattacharya, Chenyang Lu, Octav Chipara, Chien-Liang Fok, Gruia-Catalin Roman Oct 2005

Mobiquery: A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Guoliang Xing, Sangeeta Bhattacharya, Chenyang Lu, Octav Chipara, Chien-Liang Fok, Gruia-Catalin Roman

All Computer Science and Engineering Research

This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically collect sensor data from the physical environment through wireless sensor networks. A salient feature of \MQ is that it can meet stringent spatiotemporal performance constraints, including query latency, data freshness, and changing areas of interest due to user mobility. We present three just-in-time prefetching protocols that enable MobiQuery to achieve desired spatiotemporal performance despite low node duty cycles, while significantly reducing communication overhead. We validate our approach through both theoretical analysis and extensive simulations under realistic settings including varying user movement patterns and location errors.


Ceg 220: Introduction To C Programming For Engineers I, Ronald F. Taylor Oct 2005

Ceg 220: Introduction To C Programming For Engineers I, Ronald F. Taylor

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. Some programming assignments may involve complex arithmetic and trigonometric and exponential functions. 4 credit hours. Prerequisite: MTH 229 (Calculus I) or EGR 101 (Engineering Mathematics).


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

Ceg 433/633: Operating Systems, Prabhaker Mateti

Computer Science & Engineering Syllabi

The management of resources in multi-user computer systems. Emphasis is on problems of file-system design, process scheduling, memory allocation, protection, and tools needed for solutions. Course projects use the CIC++ language and include the design of portions of an operating system. 4 credit hours.


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

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/Ee 260: Digital Computer Hardware Switching Circuits, Jack Jean Oct 2005

Ceg/Ee 260: Digital Computer Hardware Switching Circuits, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.


Cs 340: Programming Language Workshop In Java, Ronald F. Taylor Oct 2005

Cs 340: Programming Language Workshop In Java, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to work independently to learn the Java language and solve a set of programming problems assigned to you using latest Java SDK available at http://java.sun.com or other software as approved by the instructor. There are no exams.


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

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. The goal of this course is to blend social implications issues with common technical communication formats you'll need to be familiar with out in the "real world." To do this, the course is built around a research project on a social implications ...


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

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. The Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.


Cs 207: Advanced Office Productivity Ii, Louis A. Benavides Oct 2005

Cs 207: Advanced Office Productivity Ii, Louis A. Benavides

Computer Science & Engineering Syllabi

This course covers post-advanced microcomputer applications including Microsoft Office Word 2003, Microsoft Office Excel 2003, Microsoft Office Access 2003, and Microsoft Office PowerPoint 2003. Topics include: creating an online form; working with macros and Visual Basic for Applications (VBA); working ·with a master document, an index and a table of contents; linking an Excel worksheet and charting its data in Word; formula auditing, data validation, and complex problem solving in Excel; importing data into Excel; working with PivotCharts, PivotTables, and trendlines in Excel; creating a PivotTable List; advanced Access report and form techniques, and creating multi-page forms; administering a database ...


Cs 466/666: Introduction To Formal Languages, Thomas Sudkamp Oct 2005

Cs 466/666: Introduction To Formal Languages, Thomas Sudkamp

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 the syntax of languages and recognizing patterns. The syntax of languages can be defined using grammars and patterns can be described by regular expressions and accepted by finite state machines. Along with presenting the fundamentals of these topics, the course will develop and investigate the relationships between language definition and pattern recognition.


Cs 409/609: Principles Of Artificial Intelligence, John C. Gallagher Oct 2005

Cs 409/609: Principles Of Artificial Intelligence, John C. Gallagher

Computer Science & Engineering Syllabi

Problem solving methods in artificial intelligence (AI) with emphasis on heuristic approaches. Topics include methods of representation, search, intelligent agents, planning, learning, natural language processing, logic, inference, robotics, and case-based reasoning. Three hours lecture, two hours lab.


Cs/Mth 316/516: Numerical Methods For Digital Computers, Ronald F. Taylor Oct 2005

Cs/Mth 316/516: Numerical Methods For Digital Computers, Ronald F. Taylor

Computer Science & Engineering Syllabi

Introduction to numerical methods used in the sciences. Methods of interpolation, data smoothing, functional approximation, numerical differentiation and integration. Solution techniques for linear and nonlinear equations. Discussion of sources of error in numerical methods. Applications of interest to engineering, science, and applied mathematics students are an integral part of the course. Special topics presented as schedule permits.


Ceg 476/676 Computer Graphics, Arthur A. Goshtasby Oct 2005

Ceg 476/676 Computer Graphics, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

The objective of this course are to learn the fundamentals of2-D and 3-D object construction, to learn algorithms that transform 2-D and 3-D objects, and practice some of the concepts through implementation.


Ceg 434/634: Concurrent Software Design, Natsuhiko Futamura Oct 2005

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.


Ceg 210: Pc Networking I, Chris P. Fickert Oct 2005

Ceg 210: Pc Networking I, Chris P. Fickert

Computer Science & Engineering Syllabi

The objective of the course is to provide an introduction to PC networking hardware, concepts, and technologies with a focus on hardware configuration and LAN administration using in-class, hands-on exercises with Novell NetWare.


Cs 141: Computer Programming I, Eric Maston Oct 2005

Cs 141: Computer Programming I, Eric Maston

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.)


Ceg 333: Introduction To Unix, Travis E. Doom Oct 2005

Ceg 333: Introduction To Unix, Travis E. Doom

Computer Science & Engineering Syllabi

Introduction to the use of UNIX and UNIX tools as a problem-solving environment. Emphasis on the shell, files and directories, editing files, user process management, compiling, and debugging. Prerequisite: CS 241.


Ceg 260: Digital Computer Hardware Switching Circuits, Eric Matson Oct 2005

Ceg 260: Digital Computer Hardware Switching Circuits, Eric Matson

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.


Ceg 770: Computer Engineering Mathematics, Yong Pei Oct 2005

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 Oct 2005

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.


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

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.