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

Physical Sciences and Mathematics Commons

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

Computer Sciences

2004

Institution
Keyword
Publication
Publication Type
File Type

Articles 1 - 30 of 862

Full-Text Articles in Physical Sciences and Mathematics

Scaling A Dataflow Testing Methodology To The Multiparadigm World Of Commercial Spreadsheets, Marc Randall Fisher Ii, Gregg Rothermel, Tyler Creelan, Margaret Burnett Dec 2004

Scaling A Dataflow Testing Methodology To The Multiparadigm World Of Commercial Spreadsheets, Marc Randall Fisher Ii, Gregg Rothermel, Tyler Creelan, Margaret Burnett

CSE Technical Reports

Spreadsheet languages are widely used by end users to perform a broad range of important tasks. Evidence shows, however, that spreadsheets often contain faults. Thus, in prior work we presented a dataflow testing methodology for use with spreadsheets, that provides feedback about the coverage of cells in spreadsheets via visual devices. Studies have shown that this methodology, which we call WYSIWYT (What You See Is What You Test), can be used cost-effectively by end-user programmers. To date, however, the methodology has been investigated across a limited set of spreadsheet language features. Commercial spreadsheet environments are multiparadigm languages, utilizing features often …


Development Of Integrated Process Simulation System Model For Spent Fuel Treatment Facility (Sftf) Design: Quarterly Report October 1-December 31, 2004, Yitung Chen, Sean Hsieh Dec 2004

Development Of Integrated Process Simulation System Model For Spent Fuel Treatment Facility (Sftf) Design: Quarterly Report October 1-December 31, 2004, Yitung Chen, Sean Hsieh

Separations Campaign (TRP)

The Advanced Fuel Cycle Initiative (AFCI) and Transmutation Research Program- University Participation Program (TRP-UPP) supported by Department of Energy of the United States have been developing many important technologies for the transmutation of nuclear waste to address long-term disposal issues. While successfully embedding AMUSE module into a dedicated System Engineering Model (TRPSEMPro), developed by the Nevada Center for Advanced Computational Methods (NCACM) at the University of Nevada, Las Vegas collaborating with Argonne National Laboratory (ANL), ANL is interested in further simulating the Light Water Reactor (LWR) Spent Fuel Treatment Facility (SFTF) combining commercial process simulation and analysis packages and core …


The Icdm Development Toolkit: Technical Description, Russell Leighton, Lakshmi Vempati, Alan Davis, Mark Porczak, Jens G. Pohl Dec 2004

The Icdm Development Toolkit: Technical Description, Russell Leighton, Lakshmi Vempati, Alan Davis, Mark Porczak, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

This report provides a technical description of the Integrated Cooperative Decision-Making (ICDM) software toolkit for the development of intelligent decision-support applications. An overview of the transformational forces that have precipitated the need for a development toolkit capable of supporting a distributed, information-centric software environment, and the objectives of ICDM are contained in a companion CDM Technical Report (CDM-16-04) entitled: “The ICDM Development Toolkit: Purpose and Overview”.

ICDM is an application development framework and toolkit for distributed decision-support systems incorporating software agents that collaborate with each other and human users to monitor changes (i.e., events) in the state of problem situations, …


Partitioning Regular Polygons Into Circular Pieces Ii: Nonconvex Partitions, Mirela Damian, Joseph O'Rourke Dec 2004

Partitioning Regular Polygons Into Circular Pieces Ii: Nonconvex Partitions, Mirela Damian, Joseph O'Rourke

Computer Science: Faculty Publications

We explore optimal circular nonconvex partitions of regular k-gons. The circularity of a polygon is measured by its aspect ratio: the ratio of the radii of the smallest circumscribing circle to the largest inscribed disk. An optimal circular partition minimizes the maximum ratio over all pieces in the partition. We show that the equilateral triangle has an optimal 4-piece nonconvex partition, the square an optimal 13-piece nonconvex partition, and the pentagon has an optimal nonconvex partition with more than 20 thousand pieces. For hexagons and beyond, we provide a general algorithm that approaches optimality, but does not achieve it.


Secure Context-Sensitive Authorization, Kazuhiro Minami, David Kotz Dec 2004

Secure Context-Sensitive Authorization, Kazuhiro Minami, David Kotz

Computer Science Technical Reports

There is a recent trend toward rule-based authorization systems to achieve flexible security policies. Also, new sensing technologies in pervasive computing make it possible to define context-sensitive rules, such as ``allow database access only to staff who are currently located in the main office.'' However, these rules, or the facts that are needed to verify authority, often involve sensitive context information. This paper presents a secure context-sensitive authorization system that protects confidential information in facts or rules. Furthermore, our system allows multiple hosts in a distributed environment to perform the evaluation of an authorization query in a collaborative way; we …


A Performance And Schedulability Analysis Of An Autonomous Mobile Robot, Ala' Adel Qadi, Steve Goddard, Jiangyang Huang, Shane Farritor Dec 2004

A Performance And Schedulability Analysis Of An Autonomous Mobile Robot, Ala' Adel Qadi, Steve Goddard, Jiangyang Huang, Shane Farritor

CSE Technical Reports

We present an autonomous, mobile, robotics application that requires dynamic adjustments of task execution rates to meet the demands of an unpredictable environment. The Robotic Safety Marker (RSM) system consists of one lead robot, the foreman, and a group of guided robots, called robotic safety markers (a.k.a., barrels). An extensive analysis is conducted of two applications running on the foreman. Both applications require adjusting task periods to achieve desired performance metrics with respect to the speed at which a system task is completed, the accuracy of RSM placement, or the number of RSMs controlled by the foreman. A static priority …


Coordinating Heterogeneous Web Services Through Handhelds Using Syd?S Wrapper Framework, Mohini Padhye Dec 2004

Coordinating Heterogeneous Web Services Through Handhelds Using Syd?S Wrapper Framework, Mohini Padhye

Computer Science Theses

Tying web services together to build large, distributed, collaborative applications has gathered noticeable momentum and a lot of research is being put in it. Along with composition of the web services, coordination is one key aspect that has been considered keenly. Many frameworks, languages and protocols have been proposed for web service composition and coordination. With the advancement in wireless technology and rapid deployment of mobile services, collaborative application development for small devices using such composed web services finds a new research area. Much less work has been done in the area of web service coordination for mobile environment. In …


Minimum Power Configuration In Wireless Sensor Networks, Guoliang Xing, Chenyang Lu, Ying Zhang, Qingfeng Huang, Robert Pless Dec 2004

Minimum Power Configuration In Wireless 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 energy conservation in wireless sensor networks. In sharp contrast to earlier research that treats topology control, power-aware routing, and sleep management in isolation, MPC integrates them as a joint optimization prob-lem in which the power configurationof a network consists of a set of active nodes and the transmission powers of the nodes. We show through analysis that the minimum power configu-ration of a network is inherently dependent on the data rates of sources. We propose several approximation algorithms with provable performance bounds compared to the optimal solu-tion, and a practical …


Requirement Elicitation Of Large Web Projects., David E. Frazier Dec 2004

Requirement Elicitation Of Large Web Projects., David E. Frazier

Electronic Theses and Dissertations

One of the most important aspects of developing a large Web-based project is getting the correct requirements from the client. Time and money can be lost if the requirements are incomplete or inaccurate. Traditional Web design sources tend to gloss over this important activity.

Software engineering is a mature field that can help in the quest for more complete and accurate requirement gathering. This paper explores the ways that traditional software engineering techniques can be applied to Web projects. A methodology is presented based on both existing and new techniques. Several experiments are conducted to determine the usefulness of each …


Variable Resolution Discretization In The Joint Space, Christopher K. Monson, Kevin Seppi, David Wingate, Todd S. Peterson Dec 2004

Variable Resolution Discretization In The Joint Space, Christopher K. Monson, Kevin Seppi, David Wingate, Todd S. Peterson

Faculty Publications

We present JoSTLe, an algorithm that performs value iteration on control problems with continuous actions, allowing this useful reinforcement learning technique to be applied to problems where a priori action discretization is inadequate. The algorithm is an extension of a variable resolution technique that works for problems with continuous states and discrete actions. Results are given that indicate that JoSTLe is a promising step toward reinforcement learning in a fully continuous domain.


A Bayesian Technique For Task Localization In Multiple Goal Markov Decision Processes, James Carroll, Kevin Seppi Dec 2004

A Bayesian Technique For Task Localization In Multiple Goal Markov Decision Processes, James Carroll, Kevin Seppi

Faculty Publications

In a reinforcement learning task library system for Multiple Goal Markov Decision Process (MGMDP), localization in the task space allows the agent to determine whether a given task is already in its library in order to exploit previously learned experience. Task localization in MGMDPs can be accomplished through a Bayesian approach, however a trivial approach fails when the rewards are not distributed normally. This can be overcome through our Bayesian Task Localization Technique (BTLT).


Data Exploration Tools For The Gene Ontology Database, Elizabeth Shoop, Paulo Casaes, Getiria Onsongo, Lisa Lesnett, Erla Petursdottir, Edward Donkor, Dennis Tkach, Michael Cosimini Dec 2004

Data Exploration Tools For The Gene Ontology Database, Elizabeth Shoop, Paulo Casaes, Getiria Onsongo, Lisa Lesnett, Erla Petursdottir, Edward Donkor, Dennis Tkach, Michael Cosimini

Elizabeth Shoop

No abstract provided.


Statistical Tools For Digital Image Forensics, Alin C. Popescu Dec 2004

Statistical Tools For Digital Image Forensics, Alin C. Popescu

Dartmouth College Ph.D Dissertations

A digitally altered image, often leaving no visual clues of having been tampered with, can be indistinguishable from an authentic image. The tampering, however, may disturb some underlying statistical properties of the image. Under this assumption, we propose five techniques that quantify and detect statistical perturbations found in different forms of tampered images: (1) re-sampled images (e.g., scaled or rotated); (2) manipulated color filter array interpolated images; (3) double JPEG compressed images; (4) images with duplicated regions; and (5) images with inconsistent noise patterns. These techniques work in the absence of any embedded watermarks or signatures. For each technique we …


Com- Putational Subset Model Selection Algorithms And Applications, Xinli Bao Dec 2004

Com- Putational Subset Model Selection Algorithms And Applications, Xinli Bao

Doctoral Dissertations

This dissertation develops new computationally e±cient algorithms for identifying the subset of variables that minimizes any desired information criteria in model selection.

In recent years, the statistical literature has placed more and more empha- sis on information theoretic model selection criteria. A model selection crite- rion chooses model that \closely" approximates the true underlying model. Recent years have also seen many exciting developments in the model se- lection techniques. As demand increases for data mining of massive data sets with many variables, the demand for model selection techniques are be- coming much stronger and needed. To this end, we introduce …


Nichtmonotone, Neuro-Symbolische Und Begriffliche Wissensverarbeitung, Pascal Hitzler Dec 2004

Nichtmonotone, Neuro-Symbolische Und Begriffliche Wissensverarbeitung, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Diese Schrift dient dem Bericht uber die Hauptaspekte meiner Forschertatigkeit an der TU Dresden seit der Promotion. In diesen dreieinhalb Jahren war es mein Bestreben, selbststandig aktuelle, theoretisch fundierte und anwendungsbezogene Fragestellungen zu entwickeln und zu verfolgen.

Naturgemaß war meine Forschung in dieser Zeit vor allem zu Anfang sehr explorativ. Meine Suche konzentrierte sich dabei auf das Herausarbeiten theoretischer Zusammenhange. Ob ich einen Ansatz dann weiterverfolgte entschied sich anschließend aufgrund einer Evaluation aus angewandter Sicht.

Die in dieser Schrift dargestellten Forschungsansatze gedenke ich in Zukunft fortzufuhren. Sie bilden die Keimzellen fur langfristig angelegte angewandte und theoretische Untersuchungen. Ich werde in …


Discrete-Time Fractional Differentiation From Integer Derivatives, Hany Farid Dec 2004

Discrete-Time Fractional Differentiation From Integer Derivatives, Hany Farid

Computer Science Technical Reports

Discrete-time fractional derivative filters (1-D and 2-D) are shown to be well approximated from a small set of integer derivatives. A fractional derivative of arbitrary order (and, in 2-D, of arbitrary orientation) can therefore be efficiently computed from a linear combination of integer derivatives of the underlying signal or image.


Robust And Distributed Computation Of Aggregates In Wireless Sensor Networks, Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu Dec 2004

Robust And Distributed Computation Of Aggregates In Wireless Sensor Networks, Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu

Department of Computer Science Technical Reports

No abstract provided.


Unstructured Peer-To-Peer Networks For Sharing Processor Cycles, Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Y. Grama Dec 2004

Unstructured Peer-To-Peer Networks For Sharing Processor Cycles, Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Y. Grama

Department of Computer Science Technical Reports

No abstract provided.


A Credit-Based Distributed Protocol For Long-Term Fairness In Ieee 802.11 Single-Hop Networks, Yan Wu, Sonia Fahmy Dec 2004

A Credit-Based Distributed Protocol For Long-Term Fairness In Ieee 802.11 Single-Hop Networks, Yan Wu, Sonia Fahmy

Department of Computer Science Technical Reports

No abstract provided.


Analysis Of Hostile Network Reconnaissance To Anticipate And Mitigate Network Attacks, Luis Angel Rivera Dec 2004

Analysis Of Hostile Network Reconnaissance To Anticipate And Mitigate Network Attacks, Luis Angel Rivera

Theses and Dissertations

Network security systems today such as current intrusion detection systems, intrusion prevention systems and firewalls are good at reacting to attacks as they occur or shortly after they occur. Current security systems lack the ability to identify and detect the activity that usually precedes an attack. This activity is known as network reconnaissance. In this thesis we have developed a technique that can assist current security systems to detect hostile network reconnaissance to anticipate and mitigate network attacks.


Topology Control Of Ad Hoc Wireless Networks For Energy Efficiency, Maggie Xiaoyan Cheng, Mihaela Cardei, Jinhua Sun, Xiaochun Cheng, Lusheng Wang, Yinfeng Xu, Ding-Zhu Du Dec 2004

Topology Control Of Ad Hoc Wireless Networks For Energy Efficiency, Maggie Xiaoyan Cheng, Mihaela Cardei, Jinhua Sun, Xiaochun Cheng, Lusheng Wang, Yinfeng Xu, Ding-Zhu Du

Computer Science Faculty Research & Creative Works

In ad hoc wireless networks, to compute the transmission power of each wireless node such that the resulting network is connected and the total energy consumption is minimized is defined as a Minimum Energy Network Connectivity (MENC) problem, which is an NP-complete problem. In this paper, we consider the approximated solutions for the MENC problem in ad hoc wireless networks. We present a theorem that reveals the relation between the energy consumption of an optimal solution and that of a spanning tree and propose an optimization algorithm that can improve the result of any spanning tree-based topology. Two polynomial time …


Annotation Manager: An Automated Web-Based Content Management System For Digital Libraries With Annotated Bibliographies, Frenny Thomas Dec 2004

Annotation Manager: An Automated Web-Based Content Management System For Digital Libraries With Annotated Bibliographies, Frenny Thomas

Theses and Dissertations

With the expansion of the World Wide Web in the 90s, individuals (especially students) are always on a quest for information resources especially in the form of Web sites. Yet many of them are overwhelmed when faced with deciding which site will best suit their research needs. As a result, these individuals may select a resource for less than optimal reasons. To ease some of the burden, libraries have made great advances to provide a place to organize information resources. Such places are called library portals, and they typically provide a gateway to web resources by categorizing and annotating them …


Recommender Systems For Multimedia Libraries: An Evaluation Of Different Models For Datamining Usage Data, Raquel Oliveira Araujo Dec 2004

Recommender Systems For Multimedia Libraries: An Evaluation Of Different Models For Datamining Usage Data, Raquel Oliveira Araujo

Computer Science Theses & Dissertations

Many recommender systems exist today to help users deal with the large growth in the amount of information available in the Internet. Most of these recommender systems use collaborative filtering or content-based techniques to present new material that would be of interest to a user. While these methods have proven to be effective, they have not been designed specifically for multimedia collections. In this study we present a new method to find recommendations that is not dependent on traditional Information Retrieval (IR) methods and compare it to algorithms that do rely on traditional IR methods. We evaluated these algorithms using …


Crown Reductions And Decompositions: Theoretical Results And Practical Methods, William Henry Suters, Iii Dec 2004

Crown Reductions And Decompositions: Theoretical Results And Practical Methods, William Henry Suters, Iii

Masters Theses

Two kernelization schemes for the vertex cover problem, an NP-hard problem in graph theory, are compared. The first, crown reduction, is based on the identification of a graph structure called a crown and is relatively new while the second, LP-kernelization has been used for some time. A proof of the crown reduction algorithm is presented, the algorithm is implemented and theorems are proven concerning its performance. Experiments are conducted comparing the performance of crown reduction and LP- kernelization on real world biological graphs. Next, theorems are presented that provide a logical connection between the crown structure and LP-kernelization. Finally, an …


Generating Linear Orders Of Events For Geospatial Domains, Suzannah Hall Dec 2004

Generating Linear Orders Of Events For Geospatial Domains, Suzannah Hall

Electronic Theses and Dissertations

Events in the world do not occur in neat chronological order, but may take place, for example, during or overlapping each other, or as simultaneous events. Efficient summaries of real-world events are important in many disciplines and require events to be modeled in a linear fashion. This thesis focuses on modeling events as intervals and using relations between the events to derive linear orders from more complex partially ordered sets. A method is developed for mapping Allen's thirteen temporal relations to only two relations, before and equals, which allow a linear ordering of all events present in the set. This …


Using Linear Features For Aerial Image Sequence Mosaiking, Caixia Wang Dec 2004

Using Linear Features For Aerial Image Sequence Mosaiking, Caixia Wang

Electronic Theses and Dissertations

With recent advances in sensor technology and digital image processing techniques, automatic image mosaicking has received increased attention in a variety of geospatial applications, ranging from panorama generation and video surveillance to image based rendering. The geometric transformation used to link images in a mosaic is the subject of image orientation, a fundamental photogrammetric task that represents a major research area in digital image analysis. It involves the determination of the parameters that express the location and pose of a camera at the time it captured an image. In aerial applications the typical parameters comprise two translations (along the x …


Context-Specific Preference Learning Of One Dimensional Quantitative Geospatial Attributes Using A Neuro-Fuzzy Approach, Georgios Mountrakis Dec 2004

Context-Specific Preference Learning Of One Dimensional Quantitative Geospatial Attributes Using A Neuro-Fuzzy Approach, Georgios Mountrakis

Electronic Theses and Dissertations

Change detection is a topic of great importance for modern geospatial information systems. Digital aerial imagery provides an excellent medium to capture geospatial information. Rapidly evolving environments, and the availability of increasing amounts of diverse, multiresolutional imagery bring forward the need for frequent updates of these datasets. Analysis and query of spatial data using potentially outdated data may yield results that are sometimes invalid. Due to measurement errors (systematic, random) and incomplete knowledge of information (uncertainty) it is ambiguous if a change in a spatial dataset has really occurred. Therefore we need to develop reliable, fast, and automated procedures that …


Maximal Clique Enumeration And Related Tools For Microarray Data Analysis, Nicole E. Baldwin Dec 2004

Maximal Clique Enumeration And Related Tools For Microarray Data Analysis, Nicole E. Baldwin

Masters Theses

The purpose of this study was to investigate the utility of exact maximal clique enumeration in DNA microarray analysis, to analyze and improve upon existing exact maximal clique enumeration algorithms, and to develop new clique-based algorithms to assist in the analysis as indicated during the course of the study. As a first test, microarray data sets comprised of pre-classified human lung tissue samples were obtained through the Critical Assessment of Microarray Data Analysis (CAMDA) conference. A combination of exact maximal clique enumeration and approximate dominating set was used to attempt to classify the samples.

In another test, maximal clique enumeration …


Using Fine-Grained Cycle Stealing To Improve Throughput, Efficiency And Response Time On A Dedicated Cluster While Maintaining Quality Of Service, Gary Stiehr Dec 2004

Using Fine-Grained Cycle Stealing To Improve Throughput, Efficiency And Response Time On A Dedicated Cluster While Maintaining Quality Of Service, Gary Stiehr

All Computer Science and Engineering Research

For various reasons, a dedicated cluster is not always fully utilized even when all of its processors are allocated to jobs. This occurs any time that a running job does not use 100% of each of the processors allocated to it. Keeping in mind the needs of both the cluster’s system administrators and its users, we would like to increase the throughput and efficiency of the cluster while maintaining or improving the average turnaround time of the jobs and the quality of service of the “primary” jobs originally scheduled on the cluster. To increase the throughput and efficiency of the …


Forensic Analysis Of Digital Image Tampering, Jonathan R. Sturak Dec 2004

Forensic Analysis Of Digital Image Tampering, Jonathan R. Sturak

Theses and Dissertations

The use of digital photography has increased over the past few years, a trend which opens the door for new and creative ways to forge images. The manipulation of images through forgery influences the perception an observer has of the depicted scene, potentially resulting in ill consequences if created with malicious intentions. This poses a need to verify the authenticity of images originating from unknown sources in absence of any prior digital watermarking or authentication technique. This research explores the holes left by existing research; specifically, the ability to detect image forgeries created using multiple image sources and specialized methods …