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 961 - 990 of 1355

Full-Text Articles in Computer Sciences

Intimacy And Face-To-Face Versus Computer Interaction, Emily Snow Jan 2007

Intimacy And Face-To-Face Versus Computer Interaction, Emily Snow

Undergraduate Review

No abstract provided.

Go to article

Greedy Population Sizing For Evolutionary Algorithms, Ekaterina Smorodkina, Daniel R. Tauritz Jan 2007

Greedy Population Sizing For Evolutionary Algorithms, Ekaterina Smorodkina, Daniel R. Tauritz

Computer Science Faculty Research & Creative Works

The number of parameters that need to be man ually tuned to achieve good performance of Evolutionary Algorithms and the dependency of the parameters on each other make this potentially robust and efficient computational method very time consuming and difficult to use. This paper introduces a Greedy Population Sizing method for Evolutionary Algo rithms (GPS-EA), an automated population size tuning method that does not require any population size related parameters to be specified or manually tuned a priori. Theoretical analysis of the number of function evaluations needed by the GPS EA to produce good solutions is provided. We also perform …

Go to article

An Analog Evolvable Hardware Device For Active Control, Saranyan A. Vigraham Jan 2007

An Analog Evolvable Hardware Device For Active Control, Saranyan A. Vigraham

Browse all Theses and Dissertations

The field of Evolvable Hardware (EH) has recently gained a lot of interest due to the novel methodology it offers for designing electrical circuits and machines. EH techniques involve configuring a reconfigurable hardware platform with the aid of learning engines such as evolutionary algorithms. The EH devices normally act as closed loop controllers with the capability of learning necessary control laws adaptively. Current EH practices have several shortcomings, which have restricted their use as reliable controllers. This dissertation will present an improved EH device based on behavioral reconfigurability that addresses the current open challenges in the field of analog Evolvable …

Go to article

Report On Realizing Practical Approximate And Distributed Reasoning For Ontologies, Pascal Hitzler, Peter Dolog, Perry Groot, Michel Klein, Malgorzata Mochol, Lyndon Nixon, Linda Peelen, Sebastian Rudolph, Stefan Schlobach, Heiner Stuckenschmidt, Denny Vrandecic, Holger Wache Jan 2007

Report On Realizing Practical Approximate And Distributed Reasoning For Ontologies, Pascal Hitzler, Peter Dolog, Perry Groot, Michel Klein, Malgorzata Mochol, Lyndon Nixon, Linda Peelen, Sebastian Rudolph, Stefan Schlobach, Heiner Stuckenschmidt, Denny Vrandecic, Holger Wache

Computer Science and Engineering Faculty Publications

We report on the progress we have made in KnowledgeWeb on the topic of scalable ontology reasoning. This deliverable contains contributions which advance the state of the art on a broad front, covering query approximation, ABox reasoning and TBox reasoning. It also covers approximation for uncertainty handling and for multi-perspective reasoning.

Go to article

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

An Augustinian Perspective On The Philosophy Of Mathematics, James Bradley

ACMS Journal 2007

From a Christian perspective, both modern and post-modern approaches to the philosophy of mathematics have significant shortcomings. This paper explores an alternative. It summarizes Augustine of Hippo’s views on the four classical themes of the philosophy of mathematics-the ontology of mathematical objects, their epistemology, the nature of truth in mathematics, and how we account for the effectiveness of mathematics in describing the natural world. It then traces what has happened to Augustine’s perspective in the roughly 1600 years since it was written concluding with a discussion of some spiritual and intellectual problems with the currently dominant secular perspective.

Go to article

Software Pattern Communities: Current Practices And Challenges, Scott Henninger, Victor Corrêa Jan 2007

Software Pattern Communities: Current Practices And Challenges, Scott Henninger, Victor Corrêa

School of Computing: Technical Reports

Software pattern users, software developers creating high-quality software systems, have few resources available to support pattern-based development practices. Patterns are currently disseminated in disjoint collections in various publishing mediums with little or no technology support. As the number of patterns and diversity of pattern types continue to proliferate, potential pattern users are faced with difficulties of understanding what patterns exist and when, where, and how to use them. This defeats the very purpose of patterns as a medium to encapsulate and disseminate recurring design experiences. In this paper, an initial study is done among a set of pattern collections in …

Go to article

A New Member Of The Family? The Continuum Of Being, Artificial Intelligence, And The Image Of God, Noreen L. Herzfeld Jan 2007

A New Member Of The Family? The Continuum Of Being, Artificial Intelligence, And The Image Of God, Noreen L. Herzfeld

Theology Faculty Publications

Are the scientific and religious definitions of life irreconcilable or do they overlap in significant areas? What is life? Religion seems to imply that there is a qualitative distinction between human beings and the rest of creation; however, there is a strong tradition in Christianity and in Eastern thought that suggests that the natural world also has a relationship with God. Human dominion over other parts of creation exists, but does not obviate this connection, nor give humans a circle unto themselves. The concept of humans being created in the image of God can be used to explain why we …

Go to article

Recognition-Based Motion Capture And The Humaneva Ii Test Data, Nicholas Howe Jan 2007

Recognition-Based Motion Capture And The Humaneva Ii Test Data, Nicholas Howe

Computer Science: Faculty Publications

Quantitative comparison of algorithms for human motion capture have been hindered by the lack of standard benchmarks. The development of the HumanEva I & II test sets provides an opportunity to assess the state of the art by evaluating existing methods on the new standardized test videos. This paper presents a comprehensive evaluation of a monocular recognition-based pose recovery algorithm on the HumanEva II clips. The results show that the method achieves a mean relative error of around 10-12 cm per joint.

Go to article

Cache Coherence Protocol Verification Using Ωmega, Ki Yung Ahn Jan 2007

Cache Coherence Protocol Verification Using Ωmega, Ki Yung Ahn

Computer Science Faculty Publications and Presentations

We verify some correctness properties of the DASH cache coherence protocol using Ωmega. Ωmega is a language with a rich type system featuring GADTs, type functions, and user-guided type checking rules. Cache coherence protocols have both safety properties and liveness properties. We show how to describe some of the safety properties of DASH cache coherence protocol in mega. Since liveness properties are not easily expressed by types, we investigate invariants sufficient to imply some of the liveness properties of concern, and assert those invariants as well in the type system of Ωmega. Using Ωmega, we can have both a working …

Go to article

Protecting The Internet With Public Work, Ed Kaiser, Wu-Chang Feng Jan 2007

Protecting The Internet With Public Work, Ed Kaiser, Wu-Chang Feng

Computer Science Faculty Publications and Presentations

Distributed denial-of-service attacks represent a growing problem for networked systems. To tackle this problem, this paper explores the addition of a public work function to the service advertisement mechanisms used by such systems. When under attack, services advertise this function along with their location information and clients must attach a solution to the function with subsequent requests. The function, which can be made specific to the source of traffic, is publicly verifiable, allowing arbitrary network devices at the edges of the network to quickly verify that subsequent communication from the source will be accepted by the destination. We describe a …

Go to article

Why Don’T People Use Refactoring Tools?, Andrew P. Black, Emerson Murphy-Hill Jan 2007

Why Don’T People Use Refactoring Tools?, Andrew P. Black, Emerson Murphy-Hill

Computer Science Faculty Publications and Presentations

Tools that perform refactoring are currently under-utilized by programmers. As more advanced refactoring tools are designed, a great chasm widens between how the tools must be used and how programmers want to use them. In this position paper, we characterize the dominant process of refactoring, demonstrate that many research tools do not support this process, and initiate a call to action for designers of future refactoring tools.

Go to article

Directflow: A Domain-Specific Language For Information-Flow Systems, Andrew P. Black, Chuan-Kai Lin Jan 2007

Directflow: A Domain-Specific Language For Information-Flow Systems, Andrew P. Black, Chuan-Kai Lin

Computer Science Faculty Publications and Presentations

Programs that process streams of information are commonly built by assembling reusable information-flow components. In some systems the components must be chosen from a pre-defined set of primitives; in others the programmer can create new custom components using a general-purpose programming language. Neither approach is ideal: restricting programmers to a set of primitive components limits the expressivity of the system, while allowing programmers to define new components in a general-purpose language makes it difficult or impossible to reason about the composite system. We advocate defining information-flow components in a domain-specific language (DSL) that enables us to infer the properties of …

Go to article

Borg: Block-Reorganization And Self-Optimization In Storage Systems, Medha Bhadkamkar, Jorge Guerra, Luis Useche, Sam Burnett, Jason Liptak, Raju Rangaswami, Vagelis Hristidis Jan 2007

Borg: Block-Reorganization And Self-Optimization In Storage Systems, Medha Bhadkamkar, Jorge Guerra, Luis Useche, Sam Burnett, Jason Liptak, Raju Rangaswami, Vagelis Hristidis

Electrical Engineering and Computer Science - All Scholarship

This paper presents the design, implementation, and evaluation of BORG, a self-optimizing storage system that performs automatic block reorganization based on the observed I/O workload. BORG is motivated by three characteristics of I/O workloads: non-uniform access frequency distribution, temporal locality, and partial determinism in non-sequential accesses. To achieve its objective, BORG manages a small, dedicated partition on the disk drive, with the goal of servicing a majority of the I/O requests from within this partition with significantly reduced seek and rotational delays. BORG is transparent to the rest of the storage stack, including applications, file system(s), and I/O schedulers, thereby …

Go to article

Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson Jan 2007

Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson

Scholarship and Professional Work - LAS

In this paper we consider the problem of computing xe mod m for large integers x, e, and m. This is the bottleneck in Rabin’s algorithm for testing primality, the Diffie-Hellman algorithm for exchanging cryptographic keys, and many other common algorithms.

Go to article

Personal Information Management. A Framework For Development Of Personalisable Web Based Services, Christopher Fuchs Jan 2007

Personal Information Management. A Framework For Development Of Personalisable Web Based Services, Christopher Fuchs

Theses

The thesis research proposed herein will model, analyse and implement strategies for the development of personalised services. The goal of the research work is to design and implement a framework which supports developers by minimising the effort required in implementing personalised services. This includes the ability to react to localisation changes and to present proper information. An overall design goal is the independency of most components from each other which will be attained through the use of standard technologies and protocols and the consistent use of a component model. The result will include the proposed framework and the analyses of …

Go to article

Optimizing The High Dynamic Range Imaging Pipeline, Ahmet Oguz Akyuz Jan 2007

Optimizing The High Dynamic Range Imaging Pipeline, Ahmet Oguz Akyuz

Electronic Theses and Dissertations

High dynamic range (HDR) imaging is a rapidly growing field in computer graphics and image processing. It allows capture, storage, processing, and display of photographic information within a scene-referred framework. The HDR imaging pipeline consists of the major steps an HDR image is expected to go through from capture to display. It involves various techniques to create HDR images, pixel encodings and file formats for storage, tone mapping for display on conventional display devices and direct display on HDR capable screens. Each of these stages have important open problems, which need to be addressed for a smoother transition to an …

Go to article

Studies Of A Quantum Scheduling Algorithm And On Quantum Error Correction, Feng Lu Jan 2007

Studies Of A Quantum Scheduling Algorithm And On Quantum Error Correction, Feng Lu

Electronic Theses and Dissertations

Quantum computation has been a rich field of study for decades because it promises possible spectacular advances, some of which may run counter to our classically rooted intuitions. At the same time, quantum computation is still in its infancy in both theoretical and practical areas. Efficient quantum algorithms are very limited in number and scope; no real breakthrough has yet been achieved in physical implementations. Grover's search algorithm can be applied to a wide range of problems; even problems not generally regarded as searching problems can be reformulated to take advantage of quantum parallelism and entanglement leading to algorithms which …

Go to article

Image-Space Approach To Real-Time Realistic Rendering, Musawir Shah Jan 2007

Image-Space Approach To Real-Time Realistic Rendering, Musawir Shah

Electronic Theses and Dissertations

One of the main goals of computer graphics is the fast synthesis of photorealistic image of virtual 3D scenes. The work presented in this thesis addresses this goal of speed and realism. In real-time realistic rendering, we encounter certain problems that are difficult to solve in the traditional 3-dimensional geometric space. We show that using an image-space approach can provide effective solutions to these problems. Unlike geometric space algorithms that operate on 3D primitives such as points, edges, and polygons, image-space algorithms operate on 2D snapshot images of the 3D geometric data. Operating in image-space effectively decouples the geometric complexity …

Go to article

Behavior Of Variable-Length Genetic Algorithms Under Random Selection, Harold Stringer Jan 2007

Behavior Of Variable-Length Genetic Algorithms Under Random Selection, Harold Stringer

Electronic Theses and Dissertations

In this work, we show how a variable-length genetic algorithm naturally evolves populations whose mean chromosome length grows shorter over time. A reduction in chromosome length occurs when selection is absent from the GA. Specifically, we divide the mating space into five distinct areas and provide a probabilistic and empirical analysis of the ability of matings in each area to produce children whose size is shorter than the parent generation's average size. Diversity of size within a GA's population is shown to be a necessary condition for a reduction in mean chromosome length to take place. We show how a …

Go to article

On The Size Of Succinct Indices, Alexander Golynski, Ankur Gupta Jan 2007

On The Size Of Succinct Indices, Alexander Golynski, Ankur Gupta

Scholarship and Professional Work - LAS

A succinct data structure occupies an amount of space that is close to the information-theoretic minimum plus an additional term. The latter is not necessarily a lower-order term and, in several cases, completely dominates the space occupancy both in theory and in practice. In this paper, we present several solutions to partially overcome this problem, introducing new techniques of independent interest that allow us to improve over previously known upper and lower bounds.

Go to article

Temperature-Driven Transition From The Wigner Crystal To The Bond-Charge-Density Wave In The Quasi-One-Dimensional Quarter-Filled Band, Rahul Hardikar Jan 2007

Temperature-Driven Transition From The Wigner Crystal To The Bond-Charge-Density Wave In The Quasi-One-Dimensional Quarter-Filled Band, Rahul Hardikar

Scholarship and Professional Work - LAS

It is known that within the interacting electron model Hamiltonian for the one-dimensional 14-filled band, the singlet ground state is a Wigner crystal only if the nearest-neighbor electron-electron repulsion is larger than a critical value. We show that this critical nearest-neighbor Coulomb interaction is different for each spin subspace, with the critical value decreasing with increasing spin. As a consequence, with the lowering of temperature, there can occur a transition from a Wigner crystal charge-ordered state to a spin-Peierls state that is a bond-charge-density wave with charge occupancies different from the Wigner crystal. This transition is possible because spin excitations …

Go to article

Using Simulation To Evaluate Global Software Development Task Allocation Strategies, Siri-On Setamanit, Wayne Wakeland, David Raffo Jan 2007

Using Simulation To Evaluate Global Software Development Task Allocation Strategies, Siri-On Setamanit, Wayne Wakeland, David Raffo

Complex Systems Faculty Publications and Presentations

We describe a hybrid computer simulation model of the software development process that is specifically architected to study alternative ways to configure global software development (GSD) projects, including phase-based, module-based, and follow-the-sun allocation strategies. The model is a hybrid system dynamics and discrete-event model. In this paper, test cases have been developed for each allocation strategy, and project duration is computed for each configuration under a range of plausible assumptions for key parameters. The primary finding is that although under ideal assumptions follow-the-sun is able to produce impressive reductions in time-to-market, under more realistic assumptions the reverse is true, thus …

Go to article

Securitycom: A Multi-Player Game For Researching And Teaching Information Security Teams, Douglas P. Twitchell Jan 2007

Securitycom: A Multi-Player Game For Researching And Teaching Information Security Teams, Douglas P. Twitchell

Journal of Digital Forensics, Security and Law

A major portion of government and business organizations’ attempts to counteract information security threats is teams of security personnel. These teams often consist of personnel of diverse backgrounds in specific specialties such as network administration, application development, and business administration, resulting in possible conflicts between security, functionality, and availability. This paper discusses the use of games to teach and research information security teams and outlines research to design and build a simple, team-oriented, configurable, information security game. It will be used to study how information security teams work together to defend against attacks using a multi-player game, and to study …

Go to article

Table Of Contents Jan 2007

Table Of Contents

Journal of Digital Forensics, Security and Law

No abstract provided.

Go to article

An Analysis Of Services Provided By Faith-Based Organizations To Cleveland’S Ward 17 Community, Mark Salling Jan 2007

An Analysis Of Services Provided By Faith-Based Organizations To Cleveland’S Ward 17 Community, Mark Salling

All Maxine Goodman Levin School of Urban Affairs Publications

No abstract provided.

Go to article

Destination Website Effectiveness – A Delphi-Based Emetric Approach – A Dms Perspective, Patrick Horan, Andrew Frew Jan 2007

Destination Website Effectiveness – A Delphi-Based Emetric Approach – A Dms Perspective, Patrick Horan, Andrew Frew

Conference papers

This paper outlines the development and evaluation of a comprehensive set of eMetrics for measuring the effectiveness of a Destination Management Systems’ (DMS) websites from the perspective of small and medium-sized hotel enterprises. Ultimately, from a hotel’s viewpoint, website effectiveness depends on how well a site performs with respect to the related business goals. The priority of the research is thus to establish which criteria are important for destination websites and to determine a mechanism for their measurement. These criteria are divided into both macro- and micro- level metrics which each combine to provide information that is actionable from a …

Go to article

Spatial Clustering Using The Likelihood Function, April Kerby, David Marx, Ashok Samal, Viacheslav Adamchuk Jan 2007

Spatial Clustering Using The Likelihood Function, April Kerby, David Marx, Ashok Samal, Viacheslav Adamchuk

School of Computing: Conference and Workshop Papers

Clustering has been widely used as a tool to group multivariate observations that have similar characteristics. However, there have been few attempts at formulating a method to group similar multivariate observations while taking into account their spatial location. This paper proposes a method to spatially cluster similar observations based on their likelihoods. The geographic or spatial location of the observations can be incorporated into the likelihood of the multivariate normal distribution through the variance-covariance matrix. The variance-covariance matrix can be computed using any specific spatial covariance structure. Therefore, observations within a cluster which are spatially close to one another will …

Go to article

Sofya: Supporting Rapid Development Of Dynamic Program Analyses For Java, Alex Kinneer, Matthew B. Dwyer, Gregg Rothermel Jan 2007

Sofya: Supporting Rapid Development Of Dynamic Program Analyses For Java, Alex Kinneer, Matthew B. Dwyer, Gregg Rothermel

School of Computing: Conference and Workshop Papers

Dynamic analysis is an increasingly important means of supporting software validation and maintenance. To date, developers of dynamic analyses have used low-level instrumentation and debug interfaces to realize their analyses. Many dynamic analyses, however, share multiple common high-level requirements, e.g., capture of program data state as well as events, and efficient and accurate event capture in the presence of threading. We present SOFYA – an infra-structure designed to provide high-level, efficient, concurrency-aware support for building analyses that reason about rich observations of program data and events. It provides a layered, modular architecture, which has been successfully used to rapidly develop …

Go to article

Helping End-User Programmers “Engineer” Software: An Opportunity For Empirical Researchers, Gregg Rothermel Jan 2007

Helping End-User Programmers “Engineer” Software: An Opportunity For Empirical Researchers, Gregg Rothermel

School of Computing: Conference and Workshop Papers

While much of the software that people depend on is written by professional software engineers, increasingly, important applications are being created by non-professional (end-user) programmers. Using tools such as spreadsheet environments and web authoring tools, these programmers are creating software that is being used to support significant activities and inform decisions. Such software needs to work dependably and increase user productivity, but evidence shows that it frequently does not. For example, studies have shown that a large percentage of the spreadsheets created by end-users contain faults, and data suggests that time spent maintaining web macros may actually impede their users’ …

Go to article

Glycomics Project Overview, Satya S. Sahoo Jan 2007

Glycomics Project Overview, Satya S. Sahoo

Kno.e.sis Publications

No abstract provided.

Go to article

First Prev Next Last