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 15571 - 15600 of 17312

Full-Text Articles in Engineering

Radar - A Novel Admission Control And Handoff Management Scheme For Multimedia Leo Satellite Networks, Syed Rashidali Rizvi Dec 2005

Radar - A Novel Admission Control And Handoff Management Scheme For Multimedia Leo Satellite Networks, Syed Rashidali Rizvi

Computer Science Theses & Dissertations

Low Earth Orbit (LEO) satellite networks are deployed as an enhancement to terrestrial wireless networks in order to provide broadband services to users regardless of their location. In addition to global coverage, these satellite systems support communications with hand-held devices and offer low cost-per-minute access cost, making them promising platforms for Personal Communication Services (PCS). LEO satellites are expected to support multimedia traffic and to provide their users with some form of Quality of Service (QoS) guarantees. However, the limited bandwidth of the satellite channel, satellite rotation around the Earth and mobility of end-users makes QoS provisioning and mobility management …

Go to article

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 …

Go to article

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 …

Go to article

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 …

Go to article

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 …

Go to article

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.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 3, November 2005, College Of Engineering And Computer Science, Wright State University Nov 2005

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 3, November 2005, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Go to article

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

Go to article

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 …

Go to article

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 …

Go to article

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.

Go to article

Ontologies In Web Personalization, Magdalini Eirinaki, Michalis Vazirgiannis Oct 2005

Ontologies In Web Personalization, Magdalini Eirinaki, Michalis Vazirgiannis

Faculty Publications

No abstract provided.

Go to article

The Igipi Ontological Framework: Integrating Gene Interactions With Protein Interactions, Bill Andreopoulos, Aijun An, Xiangji Huang Oct 2005

The Igipi Ontological Framework: Integrating Gene Interactions With Protein Interactions, Bill Andreopoulos, Aijun An, Xiangji Huang

Faculty Publications, Computer Science

No abstract provided.

Go to article

Can Infopipes Facilitate Reuse In A Traffic Application?, Emerson Murphy-Hill, Chuan-Kai Lin, Andrew P. Black, Jonathan Walpole Oct 2005

Can Infopipes Facilitate Reuse In A Traffic Application?, Emerson Murphy-Hill, Chuan-Kai Lin, Andrew P. Black, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Infopipes are presented as reusable building blocks for streaming applications. To evaluate this claim, we have built a significant traffic application in Smalltalk using Infopipes. This poster presents a traffic problem and solution, a short introduction to Infopipes, and the types of reuse Infopipes facilitate in our implementation.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 2, October 2005, College Of Engineering And Computer Science, Wright State University Oct 2005

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 2, October 2005, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Go to article

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.

Go to article

Ceg 210: Pc Networking I, Karen Meyer Oct 2005

Ceg 210: Pc Networking I, Karen Meyer

Computer Science & Engineering Syllabi

Introduction to PC networking hardware, concepts, and technologies. Focus is on LAN Administration.

Go to article

Cs 206: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog Oct 2005

Cs 206: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog

Computer Science & Engineering Syllabi

By the end of this course, the students will have a greater depth of understanding in the areas of spreadsheets, databases, and presentation software using Microsoft Excel Access and PowerPoint.

Go to article

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.

Go to article

Cs 242: Introduction To Computer Science Iii, Praveen Kakumanu Oct 2005

Cs 242: Introduction To Computer Science Iii, Praveen Kakumanu

Computer Science & Engineering Syllabi

This is the final course in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. It focuses on building a number of abstract data types such as stacks, queues, trees and tables. We continue to study the C++ object-oriented concepts such as Inheritance, polymorphism and template handling. We also start learning to analyze the complexity of algorithms in this course.

Go to article

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.

Go to article

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

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 240: Introduction To Computer Science I, L. Jane Lin Oct 2005

Cs 240: Introduction To Computer Science I, L. Jane Lin

Computer Science & Engineering Syllabi

This course is the first in the three course sequence "Introduction to Computer Science" offered by the
Computer Science department at WSU. This course presents a general introduction to C++ programming
language. It introduces the fundamental capabilities of C++ language as a problem solving tool. Topics include data representation, debugging and program verification.

Go to article

Cs 214: Visual Basic.Net, Roddy Keish Oct 2005

Cs 214: Visual Basic.Net, Roddy Keish

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

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

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

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

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.

Go to article

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 topic …

Go to article

Cs/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer Oct 2005

Cs/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer

Computer Science & Engineering Syllabi

Theory-oriented approach to the application of contemporary algorithms to bioinformatics. Graph theory, complexity theory, dynamic programming and optimization techniques are introduced in the context of application toward solving specific computational problems in molecular genetics.

Go to article

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.

Go to article

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 …

Go to article

First Prev Next Last