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

Computer Sciences Commons™

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

2007

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 481 - 510 of 1355

Full-Text Articles in Computer Sciences

Xml Interfaces: A Growing Need For Standardization, Elizabeth A. Jackson Jun 2007

Xml Interfaces: A Growing Need For Standardization, Elizabeth A. Jackson

Regis University Student Publications (comprehensive collection)

The incentive for this research came from the need to solve a fundamental problem many companies face when transferring data across multi-platform applications: how to deploy XML interfaces that integrate easily with other systems. The goal of this project was to identify a solution for Company ABC when integrating XML interfaces with customers, partners, and vendors. The project researches the need and development of data standards that can solve one of the key problems with XML - interoperability. Through the use of a common language, companies can utilize data formats and schemas developed by data standards organizations operating in their …


Efficient Gps Position Determination Algorithms, Thao Nguyen Jun 2007

Efficient Gps Position Determination Algorithms, Thao Nguyen

Theses and Dissertations

This research is aimed at improving the state of the art of GPS algorithms, namely, the development of a closed-form positioning algorithm for a standalone user and the development of a novel differential GPS algorithm for a network of users. The stand-alone user GPS algorithm is a direct, closed-form, and efficient new position determination algorithm that exploits the closed-form solution of the GPS trilateration equations and works in the presence of pseudorange measurement noise for an arbitrary number of satellites in view. A two-step GPS position determination algorithm is derived which entails the solution of a linear regression and updates …


Optimized Lane Assignment Using Inter-Vehicle Communication, Thanh-Son Dao, Christopher M. Clark, Jan Paul Huissoon Jun 2007

Optimized Lane Assignment Using Inter-Vehicle Communication, Thanh-Son Dao, Christopher M. Clark, Jan Paul Huissoon

Computer Science and Software Engineering

This paper presents an approach to lane assignment for highway vehicles that increases traffic throughput while ensuring they exit successfully at their destinations. Most of current traffic management systems do not consider lane organization of vehicles and only regulate traffic flows by controlling traffic signals or ramp meters. However, traffic throughput and efficient use of highways can be increased by coordinating driver behaviors intelligently. The goal of this research is to form a distributed control strategy for cars themselves to select lanes using inter-vehicle communication. Initial results are promising and demonstrate that intelligent lane selection can decrease vehicle traffic time.


Intelligent Rotoscoping: A Semi-Automated Interactive Boundary Tracking Approach To Video Segmentation, Seth R. Holladay Jun 2007

Intelligent Rotoscoping: A Semi-Automated Interactive Boundary Tracking Approach To Video Segmentation, Seth R. Holladay

Theses and Dissertations

Video segmentation is an application of computer vision aimed at automating the extraction of an object from a series of video frames. However, it is a difficult problem, especially to compute at real-time, interactive rates. Although general application to video is difficult because of the wide range of image scenarios, user interaction can help to reduce the problem space and speed up the computation. This thesis presents a fast object-tracking tool that selects an object from a series of frames based on minimal user input. Our Intelligent Rotoscoping tool aims for increased speed and accuracy over other video segmentation tools, …


Semantics To Empower Services Science: Using Semantics At Middleware, Web Services And Business Levels, Amit P. Sheth Jun 2007

Semantics To Empower Services Science: Using Semantics At Middleware, Web Services And Business Levels, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.


Methods And System For Equalizing Data In Multicarrier Receiver Systems, Richard K. Martin, Jaiganesh Balakrishnan, Wonzoo Chung, C. Richard Johnson Jun 2007

Methods And System For Equalizing Data In Multicarrier Receiver Systems, Richard K. Martin, Jaiganesh Balakrishnan, Wonzoo Chung, C. Richard Johnson

AFIT Patents

A method for equalizing data and systems utilizing the method. The method of this invention for equalizing (by shortening the channel response) data includes minimizing a function of the data and a number of equalizer characteristic parameters, where the function utilizes cyclic differences of equalized data. Updated equalizer characteristic parameters are then obtained from the minimization and an initial set of equalizer characteristic parameters. Finally, the received data is processed utilizing the equalizer defined by the minimization. The method of this invention can be implemented in an equalizer and the equalizer of this invention may be included in a system …


Nonlinear Dynamics In Combinatorial Games: Renormalizing Chomp, Eric J. Friedman, Adam S. Landsberg Jun 2007

Nonlinear Dynamics In Combinatorial Games: Renormalizing Chomp, Eric J. Friedman, Adam S. Landsberg

WM Keck Science Faculty Papers

We develop a new approach to combinatorial games that reveals connections between such games and some of the central ideas of nonlinear dynamics: scaling behaviors, complex dynamics and chaos, universality, and aggregation processes. We take as our model system the combinatorial game Chomp, which is one of the simplest in a class of "unsolved" combinatorial games that includes Chess, Checkers, and Go. We discover that the game possesses an underlying geometric structure that "grows" (reminiscent of crystal growth), and show how this growth can be analyzed using a renormalization procedure adapted from physics. In effect, this methodology allows one to …


Finding Termination And Time Improvement In Predicate Abstraction With Under-Approximation And Abstract Matching, Dritan Kudra Jun 2007

Finding Termination And Time Improvement In Predicate Abstraction With Under-Approximation And Abstract Matching, Dritan Kudra

Theses and Dissertations

The focus of current formal verification methods is mitigating the state explosion problem. One of these formal methods is predicate abstraction, which reduces concrete states of a system to bitvectors of true/false valuations of a set of predicates. Predicate abstraction comes in two flavors, over-approximation and under-approximation. A drawback of over-approximation is that it produces too many spurious errors for data-intensive applications. A more recent under-approximation technique which does not produce spurious errors, does abstract matching on concrete states (AMCS). AMCS adds behaviors to an abstract system by augmenting the set of initial predicates, making use of a theorem prover. …


Internet Enabled Remote Driving Of A Combat Hybrid Electric Power System For Duty Cycle Measurement, Jarrett Goodell, Marc Compere, Wilford Smith, Mark Brudnak, Mike Pozolo, Et Al. Jun 2007

Internet Enabled Remote Driving Of A Combat Hybrid Electric Power System For Duty Cycle Measurement, Jarrett Goodell, Marc Compere, Wilford Smith, Mark Brudnak, Mike Pozolo, Et Al.

Publications

This paper describes a human-in-the-loop motion-based simulator interfaced to hybrid-electric power system hardware, both of which were used to measure the duty cycle of a combat vehicle in a virtual simulation environment. The project discussed is a greatly expanded follow-on to the experiment published in [1,7]. This paper is written in the context of [1,7] and therefore highlights the enhancements. The most prominent of these enhancements is the integration (in real-time) of the Power & Energy System Integration Lab (P&E SIL) with a motion base simulator by means of a “long haul” connection over the Internet (a geographical distance of …


Cognitive And Behavioral Model Ensembles For Autonomous Virtual Characters, Jeffrey S. Whiting Jun 2007

Cognitive And Behavioral Model Ensembles For Autonomous Virtual Characters, Jeffrey S. Whiting

Theses and Dissertations

Cognitive and behavioral models have become popular methods to create autonomous self-animating characters. Creating these models presents the following challenges: (1) Creating a cognitive or behavioral model is a time intensive and complex process that must be done by an expert programmer (2) The models are created to solve a specific problem in a given environment and because of their specific nature cannot be easily reused. Combining existing models together would allow an animator, without the need of a programmer, to create new characters in less time and would be able to leverage each model's strengths to increase the character's …


Vision-Based Control And Flight Optimization Of A Rotorcraft Uav, David Christian Hubbard Jun 2007

Vision-Based Control And Flight Optimization Of A Rotorcraft Uav, David Christian Hubbard

Theses and Dissertations

A Rotorcraft UAV provides an ideal experimental platform for vision-based navigation. This thesis describes the flight tests of the US Army PALACE pro ject, which implements Moravec's pseudo-normalized correlation tracking algorithm. The tracker uses the movement of the landing site in the camera, a laser range, and the aircraft attitude from an IMU to estimate the relative motion of the UAV. The position estimate functions as a GPS equivalent to enable the rotorcraft to maneuver without the aid of GPS. Flight tests were performed with obstacles and over concrete, asphalt, and grass in daylight conditions with a safe landing area …


Session 2 - Societal-Consciousness In The Computing Curricula: A Time For Serious Introspection, Daniel Moix, Srini Ramaswamy Jun 2007

Session 2 - Societal-Consciousness In The Computing Curricula: A Time For Serious Introspection, Daniel Moix, Srini Ramaswamy

International Symposium on Technology and Society

This paper addresses the growing need for inculcating appropriate ethics within the computing curriculum by fostering the development of a societally-conscious ethical framework among our students to address the use of information technology vis-à-vis government, business and society. We propose a new integrated model based approach (IDEA) and suggest its adoption to encourage students on reflecting upon the social and ethical ramifications of technology, beyond the narrow, project focused tunnel vision that currently (subliminally) exists in many computing curricula, and in particular, in today’s profit-focused, consulting and contract-based software industry.


Teach A Course In The Math Of Voting And Choice, Karl-Dieter Crisman Jun 2007

Teach A Course In The Math Of Voting And Choice, Karl-Dieter Crisman

ACMS Conference Proceedings 2007

Many mathematics instructors at the college level are looking for a curricular option that has the potential to serve a number of different constituencies. It could be to encourage more students to take math courses, or to give worthwhile options to students who need to take math but who are not ready for calculus (or its sequence). On the other hand, one may wish to add a new course for majors outside of the typical offerings, or even to prepare students for undergraduate research. The mathematics of voting and choice is ideally suited to meet all these needs in the …


Bach (To The Calculus Of) Variations, Charles R. Hampton Jun 2007

Bach (To The Calculus Of) Variations, Charles R. Hampton

ACMS Conference Proceedings 2007

While it is quite common for professionals (doctors, lawyers, academics, etc) to be talented in many ways, including musical talent, there is a special connection between music and mathematics. Musicians collectively are not more talented in mathematics than other professionals and other academics. This paper examines the connections between math and music, particularly calculus and the music of Johann Sebastian Bach.


Chaos Theory And Metaphysical (In) Determinism, Tim Rogalsky Jun 2007

Chaos Theory And Metaphysical (In) Determinism, Tim Rogalsky

ACMS Conference Proceedings 2007

This paper will begin by introducing the issues that arise from chaos theory for the Christian mathematician and scientist: What is at stake in this debate? It will then briefly review chaos theory, by means of two examples. It will then introduce the metaphysical interpretations given to chaos theory by three different scientist-theologians. The paper will conclude with a brief introduction to open theists, and analyze their use of chaos theory to supper their theological claims.


Closest And Farthest-Line Voronoi Diagrams In The Plane, Mark C. Henle Jun 2007

Closest And Farthest-Line Voronoi Diagrams In The Plane, Mark C. Henle

Dartmouth College Undergraduate Theses

Voronoi diagrams are a geometric structure containing proximity information useful in efficiently answering a number of common geometric problems associated with a set of points in the plane.. They have applications in fields ranging from crystallography to biology. Diagrams of sites other than points and with different distance metrics have been studied. This paper examines the Voronoi diagram of a set of lines, which has escaped study in the computational geometry literature. The combinatorial and topological properties of the closest and farthest Voronoi diagrams are analyzed and O(n^2) and O(n log n) algorithms are presented for their computation respectively.


Web Based Candidate Assessment System, Noel Kyne Jun 2007

Web Based Candidate Assessment System, Noel Kyne

Regis University Student Publications (comprehensive collection)

Devplex Technologies Limited is a privately owned company based in Galway Ireland. They have been operating for over two years and currently undertake contract projects for the travel and financial industries. The projects are varied and a wide range of skills are necessary. Devplex Technologies are currently undergoing expansion and intend to hire a number of new employees with varying levels of experience. Devplex Technologies also employ a high number of contractors, with varying skills and contract periods range from one month to twenty four months. The current technical leaders are all very busy with project work. The human resource …


Trigonometry Without Sines And Geometry Without Angles, Phillip Lestmann Jun 2007

Trigonometry Without Sines And Geometry Without Angles, Phillip Lestmann

ACMS Conference Proceedings 2007

In his book, Divine Proportions, N. J. Wildberger advocates for a "rational" trigonometry by substituting the squares of the common trigonometric ratios for those ratios themselves. This presentation examines and critiques the claims of the book by evaluating its presented methods.


Portrayls Of Mathematics In Culture, Jeremy Case Jun 2007

Portrayls Of Mathematics In Culture, Jeremy Case

ACMS Conference Proceedings 2007

This paper looks at various portrays of mathematicians in culture, and how that can influence perceptions of mathematics.


Integrating Moral And Spiritual Themes In Middle School And High School Mathematics Teaching Units, Dave Klanderman, Sean Bird Jun 2007

Integrating Moral And Spiritual Themes In Middle School And High School Mathematics Teaching Units, Dave Klanderman, Sean Bird

ACMS Conference Proceedings 2007

In 2006, the Kuyers Institute published a total of nine math lessons for the middle school and high school which incorporate a Christian perspective. This paper examines the impact of teaching all of these lessons at a the high school level as well as selected lessons at the college level with preservice elementary and secondary mathematics teachers.


Agent Design Of Smart License Management System Using Gaia Methodology, Qian Zhao, Yu Zhou, Mark Perry Jun 2007

Agent Design Of Smart License Management System Using Gaia Methodology, Qian Zhao, Yu Zhou, Mark Perry

Computer Science Publications

Modern software services and data centers require a license management system to regulate the agreements that have been reached between subscriber and provider. License management helps to track usage and protect service from abuse. License agreements provide the basis for enforcement and regulation. The automation of license agreements is desired by providers and subscribers to improve transaction efficiency, give flexibility, and minimize unwanted cost.

We have proposed a framework, called SmArt (Semantic Agreement) system, that enables agreement automation in the autonomic computing context using ontology and agent technologies. This paper applies the SmArt system to the domain of license management …


Runtime Support Of Speculative Optimization For Offline Escape Analysis, Kevin Cleereman, Michelle Cheatham, Krishnaprasad Thirunarayan Jun 2007

Runtime Support Of Speculative Optimization For Offline Escape Analysis, Kevin Cleereman, Michelle Cheatham, Krishnaprasad Thirunarayan

Kno.e.sis Publications

Escape analysis can improve the speed and memory efficiency of garbage collected languages by allocating objects to the call stack, but an offline analysis will potentially interfere with dynamic class loading and an online analysis must sacrifice precision for speed. We describe a technique that permits the safe use of aggressive, speculative offline escape analysis in programs potentially loading classes that violate the analysis results.


Paraconsistent Resolution For Four-Valued Description Logics, Yue Ma, Pascal Hitzler, Zuoquan Li Jun 2007

Paraconsistent Resolution For Four-Valued Description Logics, Yue Ma, Pascal Hitzler, Zuoquan Li

Computer Science and Engineering Faculty Publications

In this paper, we propose an approach to translating any ALC ontology (possible inconsistent) into a logically consistent set of disjunctive datalog rules. We achieve this in two steps: First we give a simple way to make any ALC based ontology 4-valued satisfiable, and then we study a sound and complete paraconsistent ordered-resolution decision procedure for our 4-valued ALC. Our approach can be viewed as a paraconsistent version of KAON2 algorithm.


Measuring Inconsistency For Description Logics Based On Paraconsistent Semantics, Yue Ma, Guilin Qi, Pascal Hitzler, Zuoquan Lin Jun 2007

Measuring Inconsistency For Description Logics Based On Paraconsistent Semantics, Yue Ma, Guilin Qi, Pascal Hitzler, Zuoquan Lin

Computer Science and Engineering Faculty Publications

In this paper, we propose an approach for measuring inconsistency in inconsistent ontologies. We first define the degree of inconsistency of an inconsistent ontology using a four-valued semantics for the description logic ALC. Then an ordering over inconsistent ontologies is given by considering their inconsistency degrees. Our measure of inconsistency can provide important information for inconsistency handling.


An Augustinian Perspective On The Philosophy Of Mathematics, James Bradley Jun 2007

An Augustinian Perspective On The Philosophy Of Mathematics, James Bradley

ACMS Conference Proceedings 2007

Enlightenment thinkers saw the universe as mechanistic and mathematics as the language in which the universe is written. They viewed mathematics as eternal, as transcending human minds, and as comprehensible by human beings. Thus mathematics, from their perspective, is our best tool for understanding the secrets of nature. This outlook was nicely summarized by Morris Kline: (Kline, 1953) In brief the whole world is the totality of mathematically expressible motions of objects in space and time, and the entire universe is a great, harmonious, and mathematically designed machine. From a Christian perspective, however, the Enlightenment outlook is flawed. It privileges …


Rules And Insights: Connecting The Mathematical And Linguistic Abilities Of C.S. Lewis, Kim Jongerius Jun 2007

Rules And Insights: Connecting The Mathematical And Linguistic Abilities Of C.S. Lewis, Kim Jongerius

ACMS Conference Proceedings 2007

While most biographical works on C.S. Lewis give passing reference to Lewis' problems with elementary mathematics, few have made an attempt at diagnosing the difficulty or exploring its impact on his writing. A careful study of family correspondence, however, makes it clear that his learning difficulties were not with mathematics alone and suggests connections between attitudes toward and abilities in both mathematics and language. This paper will make these connections clear and will illustrate their ties to Lewis' effective mathematical references.


An S-Hamiltonian Line Graph Problem, Zhi-Hong Chen, Hong-Jian Lai, Wai-Chee Shiu, Deying Li Jun 2007

An S-Hamiltonian Line Graph Problem, Zhi-Hong Chen, Hong-Jian Lai, Wai-Chee Shiu, Deying Li

Scholarship and Professional Work - LAS

For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman proposed an open problem: for a given positive integer k, determine the value s for which the statement “Let G be a k-triangular graph. Then L(G), the line graph of G, is s-hamiltonian if and only L(G) is (s + 2)-connected” is valid. Broersma and Veldman proved in 1987 that the statement above holds for 0 ≤ s ≤ k and asked, specifically, if the statement holds …


Foundations Of Refinement Operators For Description Logics, Jens Lehmann, Pascal Hitzler Jun 2007

Foundations Of Refinement Operators For Description Logics, Jens Lehmann, Pascal Hitzler

Computer Science and Engineering Faculty Publications

In order to leverage techniques from Inductive Logic Programming for the learning in description logics (DLs), which are the foundation of ontology languages in the Semantic Web, it is important to acquire a thorough understanding of the theoretical potential and limitations of using refinement operators within the description logic paradigm. In this paper, we present a comprehensive study which analyses desirable properties such operators should have. In particular, we show that ideal refinement operators in general do not exist, which is indicative of the hardness inherent in learning in DLs. We also show which combinations of desirable properties are theoretically …


A Refinement Operator Based Learning Algorithm For The Alc Description Logic, Jens Lehmann, Pascal Hitzler Jun 2007

A Refinement Operator Based Learning Algorithm For The Alc Description Logic, Jens Lehmann, Pascal Hitzler

Computer Science and Engineering Faculty Publications

With the advent of the Semantic Web, description logics have become one of the most prominent paradigms for knowledge representation and reasoning. Progress in research and applications, however, faces a bottleneck due to the lack of available knowledge bases, and it is paramount that suitable automated methods for their acquisition will be developed. In this paper, we provide the first learning algorithm based on refinement operators for the most fundamental description logic ALC. We develop the algorithm from thorough theoretical foundations and report on a prototype implementation.


Counting Tulips: Three Combinatorial Proofs, Eric Gossett Jun 2007

Counting Tulips: Three Combinatorial Proofs, Eric Gossett

ACMS Conference Proceedings 2007

A gardener has r ≥ 1 red tulips and b ≥ 1 blue tulips, each in its own pot. She plans to plant them in a line along the edge of her driveway. In how many visually distinguishable ways can she arrange them?