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

Physical Sciences and Mathematics Commons

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

Computer Sciences

2006

Institution
Keyword
Publication
Publication Type
File Type

Articles 151 - 180 of 1379

Full-Text Articles in Physical Sciences and Mathematics

Pedagogical Possibilities For The N-Puzzle Problem, Zdravko Markov, Ingrid Russell, Todd W. Neller, Neli Zlatareva Oct 2006

Pedagogical Possibilities For The N-Puzzle Problem, Zdravko Markov, Ingrid Russell, Todd W. Neller, Neli Zlatareva

Computer Science Faculty Publications

In this paper we present work on a project funded by the National Science Foundation with a goal of unifying the Artificial Intelligence (AI) course around the theme of machine learning. Our work involves the development and testing of an adaptable framework for the presentation of core AI topics that emphasizes the relationship between AI and computer science. Several hands-on laboratory projects that can be closely integrated into an introductory AI course have been developed. We present an overview of one of the projects and describe the associated curricular materials that have been developed. The project uses machine learning as …


Energy-Efficient Distributed Consturctions Of Minimum Spanning Tree For Wireless Ad-Hoc Networks, Maleq Khan, Gopal Pandurangan, V. S. Anil Kumar Oct 2006

Energy-Efficient Distributed Consturctions Of Minimum Spanning Tree For Wireless Ad-Hoc Networks, Maleq Khan, Gopal Pandurangan, V. S. Anil Kumar

Department of Computer Science Technical Reports

No abstract provided.


Meeting The Challenges Of Met Data With Mysql, Thomas S. Ciolek Oct 2006

Meeting The Challenges Of Met Data With Mysql, Thomas S. Ciolek

Regis University Student Publications (comprehensive collection)

The objective of this project is to develop a relational database housing meteorological data used in direct support of emergency response activities for an atmospheric consulting firm, hereon referred to by the pseudonym WindInc. The intent is to demonstrate to WindInc how a relational database system would be superior to their present flat-file approach by providing the flexibility, performance, and reliability needed to meet their ever-increasing business demands, while simultaneously boosting the performance of their atmospheric dispersion modeling system.


A P2p Integration Architecture For Protein Resources, K. T. Claypool, Sanjay Kumar Madria Oct 2006

A P2p Integration Architecture For Protein Resources, K. T. Claypool, Sanjay Kumar Madria

Computer Science Faculty Research & Creative Works

The availability of a direct pathway from a primary sequence (denovo or DNA derived) to macromolecular structure to biological function using computer-based tools is the ultimate goal for a protein scientist. Today's state of the art protein resources and on-going research and experiments provide the raw data that can enable protein scientists to achieve at least some steps of this goal. Thus, protein scientists are looking towards taking their benchtop research from the specific to a much broader base of using the large resources of available electronic information. However, currently the burden falls on the scientist to manually interface with …


Real-Time Divisible Load Scheduling For Cluster Computing, Xuan Lin, Ying Lu, Jitender S. Deogun, Steve Goddard Oct 2006

Real-Time Divisible Load Scheduling For Cluster Computing, Xuan Lin, Ying Lu, Jitender S. Deogun, Steve Goddard

CSE Technical Reports

Cluster computing has emerged as a new paradigm for solving large-scale problems. To enhance QoS and provide performance guarantees in cluster computing environments, various real-time scheduling algorithms and workload models have been investigated. Computational loads that can be arbitrarily divided into independent pieces represent many real-world applications. Divisible load theory (DLT) provides insight into distribution strategies for such computations. However, the problem of providing performance guarantees to divisible load applications has not yet been systematically studied. This paper investigates such algorithms for a cluster environment. Design parameters that affect the performance of these algorithms and scenarios when the choice of …


Dynamic Characterization Of Web Application Interfaces, Marc Randall Fisher Ii, Sebastian Elbaum, Gregg Rothermel Oct 2006

Dynamic Characterization Of Web Application Interfaces, Marc Randall Fisher Ii, Sebastian Elbaum, Gregg Rothermel

CSE Technical Reports

Web applications are increasingly prominent in society, serving a wide variety of user needs. Engineers seeking to enhance, test, and maintain these applications and third-party programmers wishing to utilize these applications need to understand their interfaces. In this paper, therefore, we present methodologies for characterizing the interfaces of web applications through a form of dynamic analysis, in which directed requests are sent to the application, and responses are analyzed to draw inferences about its interface. We also provide mechanisms to increase the scalability of the approach. Finally, we evaluate the approach’s performance on six non-trivial web applications.


Scaling The Zachman Framework A Software Development Methodology For Non-Enterprise Applications, Carla L. Thompson Oct 2006

Scaling The Zachman Framework A Software Development Methodology For Non-Enterprise Applications, Carla L. Thompson

Regis University Student Publications (comprehensive collection)

The software development methodology brought forth in John Zachman's System Architecture Framework can be used to design a wide range of information systems. While the Zachman Framework is very robust and typically used for developing large scale Enterprise Applications, this project will demonstrate that the framework can easily be scaled to fit a small scale non-Enterprise Application. The Zachman Framework is a six by six matrix that breaks down system requirements into cells that document the system. Each row of the Zachman Framework will be examined to determine if the documentation would be needed. A discussion about the appropriateness of …


Monitoring And Correction Of Geometric Distortion In Projected Displays, Christopher O. Jaynes, Robert M. Steele Oct 2006

Monitoring And Correction Of Geometric Distortion In Projected Displays, Christopher O. Jaynes, Robert M. Steele

Computer Science Faculty Patents

A technique, and associated system and computer executable program code on a computer readable storage medium, for automatically correcting distortion of a front-projected display under observation by at least one camera. The technique may be employed in a myriad of front-projected display environments, e.g., single or multiple projectors and cameras are used. The technique includes: observing a first image, projected from at least one projector, comprising at least one target distribution of light intensities; for each conglomeration of white pixels of a difference image, compute a bounding box comprising a corresponding conglomeration of pixels in a framebuffer information of the …


Efficient Support For Application-Specific Video Adaptation, Jie Huang Oct 2006

Efficient Support For Application-Specific Video Adaptation, Jie Huang

Dissertations and Theses

As video applications become more diverse, video must be adapted in different ways to meet the requirements of different applications when there are insufficient resources. In this dissertation, we address two sorts of requirements that cannot be addressed by existing video adaptation technologies: (i) accommodating large variations in resolution and (ii) collecting video effectively in a multi-hop sensor network. In addition, we also address requirements for implementing video adaptation in a sensor network.

Accommodating large variation in resolution is required by the existence of display devices with widely disparate screen sizes. Existing resolution adaptation technologies usually aim at adapting video …


Design And Development Of A Software Module For Minimizing Transportation Cost, Gopalakrishna Udupi Oct 2006

Design And Development Of A Software Module For Minimizing Transportation Cost, Gopalakrishna Udupi

Regis University Student Publications (comprehensive collection)

The goal of this project is to design and develop a software module to solve a transportation problem, relating to minimizing costs to transport finished goods from multiple origins to multiple destinations. The transportation problem will be modeled as a linear programming model, using AMPL linear programming (LP) software. A graphical user interface (GUI) will be developed to enable the user to enter the data and parameters for the transportation problem. The GUI will be developed using C# programming language within the Microsoft© .NET framework. The GUI will also enable the user to launch the AMPL module to solve the …


A Decentralized Reinforcement Learning Controller For Collaborative Driving, Luke Ng, Christopher M. Clark, Jan P. Huissoon Oct 2006

A Decentralized Reinforcement Learning Controller For Collaborative Driving, Luke Ng, Christopher M. Clark, Jan P. Huissoon

Computer Science and Software Engineering

Research in the collaborative driving domain strives to create control systems that coordinate the motion of multiple vehicles in order to navigate traffic both efficiently and safely. In this paper a novel individual vehicle controller based on reinforcement learning is introduced. This controller is capable of both lateral and longitudinal control while driving in a multi-vehicle platoon. The design and development of this controller is discussed in detail and simulation results showing learning progress and performance are presented.


Complete And Scalable Multi-Robot Planning In Tunnel Environments, Mike Peasgood, John Mcphee, Christopher M. Clark Oct 2006

Complete And Scalable Multi-Robot Planning In Tunnel Environments, Mike Peasgood, John Mcphee, Christopher M. Clark

Computer Science and Software Engineering

This paper addresses the challenging problem of finding collision-free trajectories for many robots moving to individual goals within a common environment. Most popular algorithms for multi-robot planning manage the complexity of the problem by planning trajectories for robots sequentially; such decoupled methods may fail to find a solution even if one exists. In contrast, this paper describes a multi-phase approach to the planning problem that guarantees a solution by creating and maintaining obstacle-free paths through the environment as required for each robot to reach its goal. Using a topological graph and spanning tree representation of a tunnel or corridor environment, …


Parallel Randomized State-Space Search, Matthew B. Dwyer, Sebastian Elbaum, Suzette Person, Rahul Purandare Oct 2006

Parallel Randomized State-Space Search, Matthew B. Dwyer, Sebastian Elbaum, Suzette Person, Rahul Purandare

CSE Technical Reports

Model checkers search the space of possible program behaviors to detect errors and to demonstrate their absence. Despite major advances in reduction and optimization techniques, state-space search can still become cost-prohibitive as program size and complexity increase. In this paper, we present a technique for dramatically improving the cost-effectiveness of state-space search techniques for error detection using parallelism. Our approach can be composed with all of the reduction and optimization techniques we are aware of to amplify their benefits. It was developed based on insights gained from performing a large empirical study of the cost-effectiveness of randomization techniques in state-space …


Performance Rights For Software, Mark Perry, Stephen M. Watt Oct 2006

Performance Rights For Software, Mark Perry, Stephen M. Watt

Law Publications

As we use software in increasingly varied contexts, the concept of a software license has become progressively more complex. Software is embedded in devices that do not obviously resemble computers. Web services make software on one computer available to anyone with internet access. An individual may use several computers over the course of the day so the concept of a node locked or individual license is no longer clear. How should time based and single use and consumptive licenses be governed and interact? This paper examines how these and other issues in software licensing can be seen as instances of …


Verifiable Electronic Voting System: An Open Source Solution, Halina Kaminski, Mark Perry Oct 2006

Verifiable Electronic Voting System: An Open Source Solution, Halina Kaminski, Mark Perry

Computer Science Publications

Elections, referenda and polls are vital processes for the operation of a modern democracy. They form the mechanism for transferring power from citizens to their representatives. Although some commentators claim that the pencil-and-paper systems used in countries such as Canada and UK are still the best method of avoiding voterigging, recent election problems, and the need for faster, better, cheaper vote counting, have stimulated great interest in managing the election process through the use of electronic voting systems. While computer scientists, for the most part, have been warning of the possible perils of such action, vendors have forged ahead with …


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

Ceg 210: Pc Networking I, Chris P. Fickert

Computer Science & Engineering Syllabi

An introduction to PC networking hardware, software, concepts, and technologies. Focus is on LAN administration, hardware, and software configuration.

Course Goals

At the end of the quarter the student will be able to:

  • design and configure a client/server network
  • create and manage network objects
  • plan and implement directory services and the network file systems
  • plan and implement network security
  • design and write network login scripts
  • manage and solve problems related to a client/server network


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

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 text book.


Ceg 333: Introduction To Unix, Thomas Wischgoll Oct 2006

Ceg 333: Introduction To Unix, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you should be able to:

• Describe the basic methodology of UNIX filters, including pipes and redirection of stdin/stdout

• Program simple UNIX utilities at the command-line and shell-script level • Discuss the advantages and disadvantages of common user interfaces {such as UNIX vs. PC/Windows)

• Discuss the philosophy of UNIX development and the open source movement

• Work comfortably in the UNIX environment

• Edit and manage files and user-level security for UNIX development

• Use standard UNIX development tools for C or C++


Ceg 221: Advanced C Programming For Engineers, Robert Helt Oct 2006

Ceg 221: Advanced C Programming For Engineers, Robert Helt

Computer Science & Engineering Syllabi

This course introduces advanced constructs, algorithms, and data structures in the C programming language. Emphasis is on problem solving and techniques useful to engineers. Topics include functions, array, pointers, structures as well as sorting algorithms, linked lists, complex numbers, stacks, queues, hash tables, and binary trees. 4 credit hours. Prerequisite: CEG220 (Introduction to C Programming for Engineers).


Ceg 476/676: Computer Graphics I, Thomas Wischgoll Oct 2006

Ceg 476/676: Computer Graphics I, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you will have learnt techniques for constructing 2-D and 3-D obects as well as manipulating and rendering the objects using OpenGL.

The outline of the course is as follows:

• Introduction

• Geometric primitives

• Attributes of geometric primitives

• Antialiasing techniques

• Homogeneous coordinate system

• 2-D and 3-D viewing transformations

• Structures and hierarchical modeling

• 2-D and 3-D viewing transformations

• Input devices and interactive techniques •

Visible surface detection methods


Ceg 220: Introduction To C Programming For Engineers I, Robert Helt Oct 2006

Ceg 220: Introduction To C Programming For Engineers I, Robert Helt

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. 4 credit hours. Prerequisite: MTH 229 (Calculus I) or EGR 101 (Engineering Mathematics).


Ceg 402/602: Introduction To Computer Communication, Bin Wang Oct 2006

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

Computer Science & Engineering Syllabi

This course provides an introduction to basic concepts of communication networks, different types of networks, protocols over different layers, and network applications through lectures, labs, homework, and reading on relevant materials. You will

• Understand networking principles, protocols, and technologies.

• Understand some design and performance issues involved in providing a network service.

• Acquire background for supporting e-commerce, e-government, and e-education.

• Gain hands-on experience with programming techniques for network protocols.

• Obtain background for original research in computer networks.


Ceg 420/620: Computer Architecture, Jack Jean Oct 2006

Ceg 420/620: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 460/660: Introduction To Software Computer Engineering, John A. Reisner Oct 2006

Ceg 460/660: Introduction To Software Computer Engineering, John A. Reisner

Computer Science & Engineering Syllabi

This course introduces established practices for engineering large-scale software systems. Emphasis is placed on both the technical and managerial aspects of software engineering, and the software development process. This includes techniques for requirements elicitation, analysis, design, testing, and project management. The course emphasizes object-oriented development with the Unified Modeling Language (UML). Hands-on experience is provided through individual homework problems and a partnered project.


Ceg 453/653: Design Of Computing Systems, Jack Jean Oct 2006

Ceg 453/653: Design Of Computing Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 360/560 Ee 451/651: Digital System Design, Travis E. Doom Oct 2006

Ceg 360/560 Ee 451/651: Digital System Design, Travis E. Doom

Computer Science & Engineering Syllabi

Design of digital systems. Topics include flip-flops, registers, counters, programmable logic devices, memory devices, register-level design, and microcomputer system organization. Students must show competency in the design of digital systems. 3 hours lecture, 2 hours lab. Prerequisite: CEG 260.


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

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.


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

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 770: Computer Engineering Mathematics, Yong Pei Oct 2006

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 2006

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.