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

Computer Sciences Commons

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

32,677 Full-Text Articles 32,650 Authors 10,216,521 Downloads 300 Institutions

All Articles in Computer Sciences

Faceted Search

32,677 full-text articles. Page 931 of 956.

Representation Invariant Genetic Operators, Jonathan E. Rowe, Michael D. Vose, Alden H. Wright 2010 University of Montana - Missoula

Representation Invariant Genetic Operators, Jonathan E. Rowe, Michael D. Vose, Alden H. Wright

Computer Science Faculty Publications

A genetic algorithm is invariant with respect to a set of representations if it runs the same no matter which of the representations is used. We formalize this concept mathematically, showing that the representations generate a group that acts upon the search space. Invariant genetic operators are those that commute with this group action. We then consider the problem of characterizing crossover and mutation operators that have such invariance properties. In the case where the corresponding group action acts transitively on the search space, we provide a complete characterization, including high-level representation-independent algorithms implementing these operators.


Cr: Capability Information For Routing Of Wireless Ad Hoc Networks In The Real Environment, Zhen Jiang, Zhigang Li, Nong Xiao, Jie Wu 2010 West Chester University of Pennsylvania

Cr: Capability Information For Routing Of Wireless Ad Hoc Networks In The Real Environment, Zhen Jiang, Zhigang Li, Nong Xiao, Jie Wu

Computer Science

No abstract provided.


Towards Context-Aware Real-Time Information Dissemination, Kyoung-Don Kang, Greg Vert 2010 Binghamton University--SUNY

Towards Context-Aware Real-Time Information Dissemination, Kyoung-Don Kang, Greg Vert

Computer Science Faculty Scholarship

Real-time information dissemination is essential for the success of key applications such as transportation management and battlefield monitoring. In these applications, relevant information should be disseminated to interested users in a timely fashion. However, it is challenging to support timely information dissemination due to the limited and even time-varying network bandwidth. Thus, a naive approach disseminating every data with no consideration of the context that describes where and when the data is acquired and how it can satisfy users may only provide poor performance and user perceived quality of service (QoS). To address the problem, we design a novel context-aware ...


An Intelligent Data-Centric Approach Toward Identification Of Conserved Motifs In Protein Sequences, Kathryn Dempsey Cooper, Benjamin Currall, Richard Hallworth, Hesham Ali 2010 University of Nebraska at Omaha

An Intelligent Data-Centric Approach Toward Identification Of Conserved Motifs In Protein Sequences, Kathryn Dempsey Cooper, Benjamin Currall, Richard Hallworth, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

The continued integration of the computational and biological sciences has revolutionized genomic and proteomic studies. However, efficient collaboration between these fields requires the creation of shared standards. A common problem arises when biological input does not properly fit the expectations of the algorithm, which can result in misinterpretation of the output. This potential confounding of input/output is a drawback especially when regarding motif finding software. Here we propose a method for improving output by selecting input based upon evolutionary distance, domain architecture, and known function. This method improved detection of both known and unknown motifs in two separate case ...


Perceptually Realistic Behavior Through Alibi Generation, Ben Sunshine-Hill, Norman I. Badler 2010 University of Pennsylvania

Perceptually Realistic Behavior Through Alibi Generation, Ben Sunshine-Hill, Norman I. Badler

Center for Human Modeling and Simulation

Real-time pedestrian simulation for open-world games involves aggressive behavior simplification and culling to keep computational cost under control, but it is diffficult to predict whether these techniques will become unrealistic in certain situations. We propose a method of perceptually simulating highly realistic pedestrian behavior in virtual cities in real- time. Designers build a highly realistic simulation, from which a perceptually identical “perceptual simulation” is generated. Although the perceptual simulation simulates only a small portion of the world at a time, and does so with inexpensive approximations, it can be statistically guaranteed that the results are perceptually indistinguishable from those of ...


Smart Events And Primed Agents, Catherine Stocker, Pengfei Huang, Norman I. Badler 2010 University of Pennsylvania

Smart Events And Primed Agents, Catherine Stocker, Pengfei Huang, Norman I. Badler

Center for Human Modeling and Simulation

We describe a new organization for virtual human responses to dynamically occurring events. In our approach behavioral responses are enumerated in the representation of the event itself. These Smart Events inform an agent of plausible actions to undertake. We additionally introduce the notion of agent priming, which is based on psychological concepts and further restricts and simplifies action choice. Priming facilitates multi-dimensional agents and in combination with Smart Events results in reasonable, contextual action selection without requiring complex reasoning engines or decision trees. This scheme burdens events with possible behavioral outcomes, reducing agent computation to evaluation of a case expression ...


Real-Time Evacuation Simulation In Mine Interior Model Of Smoke And Action, Pengfei Huang, Jinsheng Kang, Joseph T. Kider, Ben Sunshine-Hill, Jonathan B. McCaffrey, Desiree Velazquez Rios, Norman I. Badler 2010 University of Pennsylvania

Real-Time Evacuation Simulation In Mine Interior Model Of Smoke And Action, Pengfei Huang, Jinsheng Kang, Joseph T. Kider, Ben Sunshine-Hill, Jonathan B. Mccaffrey, Desiree Velazquez Rios, Norman I. Badler

Center for Human Modeling and Simulation

Virtual human crowd models have been used in the simulation of building and urban evacuation, but have not yet applied to underground coal mine operations and escape situations with emphasis on smoke, fires and physiological behaviors. We explore this through a real-time simulation model, MIMOSA (Mine Interior Model Of Smoke and Action), which integrates an underground coal mine virtual environment, a fire and smoke propagation model, and a human physiology and behavior model. Each individual agent has a set of physiological parameters as variables of time and environment, simulating a miner’s physiological condition during normal operations as well as ...


Dynamic Join Optimization In Multi-Hop Wireless Sensor Networks, Svilen Mihaylov, Marie Jacob, Zachary G. Ives, Sudipto Guha 2010 University of Pennsylvania

Dynamic Join Optimization In Multi-Hop Wireless Sensor Networks, Svilen Mihaylov, Marie Jacob, Zachary G. Ives, Sudipto Guha

Departmental Papers (CIS)

To enable smart environments and self-tuning data centers, we are developing the Aspen system for integrating physical sensor data, as well as stream data coming from machine logical state, and database or Web data from the Internet. A key component of this system is a query processor optimized for limited-bandwidth, possibly battery-powered devices with multiple hop wireless radio communications. This query processor is given a portion of a data integration query, possibly including joins among sensors, to execute. Several recent papers have developed techniques for computing joins in sensors, but these techniques are static and are only appropriate for specific ...


Representing Synonymity In Causal Logic And In Logic Programming, Joohyung Lee, Yuliya Lierler, Vladimir Lifschitz, Fangkai Yang 2010 Arizona State University

Representing Synonymity In Causal Logic And In Logic Programming, Joohyung Lee, Yuliya Lierler, Vladimir Lifschitz, Fangkai Yang

Computer Science Faculty Proceedings & Presentations

We investigate the relationship between rules representing synonymity in nonmonotonic causal logic and in answer set programming. This question is of interest in connection with current work on modular languages for describing actions.


Formalization Of The Ad Hominem Argumentation Scheme, Douglas Walton 2010 University of Windsor

Formalization Of The Ad Hominem Argumentation Scheme, Douglas Walton

CRRAR Publications

In this paper, several examples from the literature, and one central new one, are used as case studies of texts of discourse containing an argumentation scheme that has now been widely investigated in literature on argumentation. Argumentation schemes represent common patterns of reasoning used in everyday conversational discourse. The most typical ones represent defeasible arguments based on nonmonotonic reasoning. Each scheme has a matching set of critical questions used to evaluate a particular argument fitting that scheme. The project is to study how to build a formal computational model of this scheme for the circumstantial ad hominem argument using argumentation ...


Expressiveness Of Streaming String Transducers, Rajeev Alur 2010 University of Pennsylvania

Expressiveness Of Streaming String Transducers, Rajeev Alur

Departmental Papers (CIS)

Streaming string transducers define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and uses a finite set of variables that range over strings from the output alphabet. At every step, the transducer processes an input symbol, and updates all the variables in parallel using assignments whose right-hand-sides are concatenations of output symbols and variables with the restriction that a variable can be used at most once in a right-hand-side expression. It has been shown that streaming string transducers operating on strings over infinite data domains are of interest ...


Temporal Reasoning For Procedural Programs, Rajeev Alur, Swarat Chaudhuri 2010 University of Pennsylvania

Temporal Reasoning For Procedural Programs, Rajeev Alur, Swarat Chaudhuri

Departmental Papers (CIS)

While temporal verification of programs is a topic with a long history, its traditional basis—semantics based on word languages—is ill-suited for modular reasoning about procedural programs. We address this issue by defining the semantics of procedural (potentially recursive) programs using languages of nested words and developing a framework for temporal reasoning around it. This generalization has two benefits. First, this style of reasoning naturally unifies Manna-Pnueli-style temporal reasoning with Hoare-style reasoning about structured programs. Second, it allows verification of "non-regular" properties of specific procedural contexts—e.g., "If a lock is acquired in a context, then it is ...


Mpi Enhancements In John The Ripper, Edward R. Sykes, Michael Lin, Wesley Skoczen 2010 Sheridan College

Mpi Enhancements In John The Ripper, Edward R. Sykes, Michael Lin, Wesley Skoczen

Faculty Publications and Scholarship

John the Ripper (JtR) is an open source software package commonly used by system administrators to enforce password policy. JtR is designed to attack (i.e., crack) passwords encrypted in a wide variety of commonly used formats. While parallel implementations of JtR exist, there are several limitations to them. This research reports on two distinct algorithms that enhance this password cracking tool using the Message Passing Interface. The first algorithm is a novel approach that uses numerous processors to crack one password by using an innovative approach to workload distribution. In this algorithm the candidate password is distributed to all ...


Sascha Vitzhum, Jim Browne (Interviewer) 2010 WGLT

Sascha Vitzhum, Jim Browne (Interviewer)

Interviews for WGLT

Jim Browne interviews Assistant Professor Sascha Vitzhum about virtual worlds, economics and marketing. (requires RealPlayer)


Quantum Corrections To The Gravitational Potential And Orbital Motion, Ioannis Haranas, Vasile Mioc 2010 Wilfrid Laurier University

Quantum Corrections To The Gravitational Potential And Orbital Motion, Ioannis Haranas, Vasile Mioc

Physics and Computer Science Faculty Publications

GRT predicts the existence of relativistic corrections to the static Newtonian potential, which can be calculated and verified experimentally. The idea leading to quantum corrections at large distances consists of the interactions of massless particles, which only involve their coupling energies at low energies. Using the quantum correction term of the potential we obtain the perturbing quantum acceleration function. Next, with the help of the Newton-Euler planetary equations, we calculate the time rates of changes of the orbital elements per revolution for three different orbits around the primary. For one solar mass primary and an orbit with semimajor axis and ...


Learning To Create Jazz Melodies Using Deep Belief Nets, Greg Bickerman '10, Sam Bosley, Peter Swire, Robert M. Keller 2010 Harvey Mudd College

Learning To Create Jazz Melodies Using Deep Belief Nets, Greg Bickerman '10, Sam Bosley, Peter Swire, Robert M. Keller

All HMC Faculty Publications and Research

We describe an unsupervised learning technique to facilitate automated creation of jazz melodic improvisation over chord sequences. Specifically we demonstrate training an artificial improvisation algorithm based on unsupervised learning using deep belief nets, a form of probabilistic neural network based on restricted Boltzmann machines. We present a musical encoding scheme and specifics of a learning and creational method. Our approach creates novel jazz licks, albeit not yet in real-time. The present work should be regarded as a feasibility study to determine whether such networks could be used at all. We do not claim superiority of this approach for pragmatically creating ...


Local Versus Global Search In Channel Graphs, A.H. Hunter, Nicholas Pippenger 2010 University of Washington - Seattle Campus

Local Versus Global Search In Channel Graphs, A.H. Hunter, Nicholas Pippenger

All HMC Faculty Publications and Research

Previous studies of search in channel graphs has assumed that the search is global; that is, that the status of any link can be probed by the search algorithm at any time. We consider for the first time local search, for which only links to which an idle path from the source has already been established may be probed. We show that some well known channel graphs may require exponentially more probes, on the average, when search must be local than when it may be global.


Jane: A New Tool For The Cophylogeny Reconstruction Problem, Chris Conow, Daniel Fielder '11, Yaniv J. Ovadia '10, Ran Libeskind-Hadas 2010 California State Polytechnic University - Pomona

Jane: A New Tool For The Cophylogeny Reconstruction Problem, Chris Conow, Daniel Fielder '11, Yaniv J. Ovadia '10, Ran Libeskind-Hadas

All HMC Faculty Publications and Research

Background

This paper describes the theory and implementation of a new software tool, called Jane, for the study of historical associations. This problem arises in parasitology (associations of hosts and parasites), molecular systematics (associations of orderings and genes), and biogeography (associations of regions and orderings). The underlying problem is that of reconciling pairs of trees subject to biologically plausible events and costs associated with these events. Existing software tools for this problem have strengths and limitations, and the new Jane tool described here provides functionality that complements existing tools.

Results

The Jane software tool uses a polynomial time dynamic programming ...


Performance Tuning Of Streaming Applications Via Search-Space Decomposition, Shobana Padmanabhan, Roger D. Chamberlain, Yixin Chen 2010 Washington University in St Louis

Performance Tuning Of Streaming Applications Via Search-Space Decomposition, Shobana Padmanabhan, Roger D. Chamberlain, Yixin Chen

All Computer Science and Engineering Research

High-performance streaming applications are typically pipelined and deployed on architecturally diverse (hybrid)systems. Developers of such applications are interested in customizing components used, so as to benefit application performance. We present an efficient and automatic technique for design-space exploration of applications in this problem domain. We solve performance tuning as an optimization problem by formulating cost functions using results from queueing theory. This results in a mixed-integer nonlinear optimization problem which is NP-hard. We reduce the search complexity by decomposing the search space. We have developed a domain-specific decomposition technique using topological information of the application embodied in the queueing ...


What Do Collaborations With The Arts Have To Say About Human-Robot Interaction?, William D. Smart, Annamaria Pileggi, Leila Takayama 2010 Washington University in St Louis

What Do Collaborations With The Arts Have To Say About Human-Robot Interaction?, William D. Smart, Annamaria Pileggi, Leila Takayama

All Computer Science and Engineering Research

This is a collection of papers presented at the workshop "What Do Collaborations with the Arts Have to Say About HRI", held at the 2010 Human-Robot Interaction Conference, in Osaka, Japan.


Digital Commons powered by bepress