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

Computer Sciences Commons

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

2004

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 1 - 30 of 797

Full-Text Articles in Computer Sciences

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

School of Computing: 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 …


Information And Communication Technology Applications In The Tanzanian Health Sector, M Victor Dec 2004

Information And Communication Technology Applications In The Tanzanian Health Sector, M Victor

Tanzania Journal of Engineering and Technology (TJET)

The potential role of Information and Communication Technology (ICT) in the health sector is to improve the delivery of health services and would also help to deal with major constraints in uplifting the health standards Of Tanzanians. ICT in heath can be used to facilitate remote consultation, diagnosis and treatment. The objective Of the study was exploratory in nature and aimed at determining the awareness level of the länzanian health sector on various ICT applications which could be used in the sector. The study also aimed ar establishing the challenges to the implementation of ICT in the Tanzanian health sector. …


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, …


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 …


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.


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 …


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

School of Computing: 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 …


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 …


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).


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.


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 …


Using Distributed Network Systems To Model Perception With An Artificial Neural Network, Tide Kansona Takizala Dec 2004

Using Distributed Network Systems To Model Perception With An Artificial Neural Network, Tide Kansona Takizala

All-Inclusive List of Electronic Theses and Dissertations

It is difficult to be certain about brain functioning. Until now, most efforts to understand brain computations have only been conducted on a stand alone computer. In order to recreate the brain accurately, members of the Institute of Cognitive Computing Technology (ICCT) were interested in finding out whether or not a biological process could be simulated on a Distributed Artificial Neural Network (DANN). The goal of this investigation was to implement visual perception on a network of computers and compare the computations of the network with those of a human brain. The distributed network was developed as a Local Area …


Distributed Artificial Neural Network (Dann): Model Of Human Memory Behavior, Karen Meriweather Dec 2004

Distributed Artificial Neural Network (Dann): Model Of Human Memory Behavior, Karen Meriweather

All-Inclusive List of Electronic Theses and Dissertations

It is believed that a distributed network system will provide a general means of understanding cognitive functions that occur in the brain. This study provides a framework for modeling human memory behavior using a Distributed Artificial Neural Network (DANN) architecture. This approach presents a different method for modeling cognitive functions using peer-to-peer computing. The computers on the network represents different memory stores, and by using Hopfield Neural Network Techniques, along with the software application Joone, the final product is a DANN system that exhibits human memory behavior and the ability to associate input vectors from the Fisher's Iris Classification output …


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 …


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 …


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 …


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.


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 …


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 …


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.


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.


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 …


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.


Theoretical And Practical Complexity Of Unified Modeling Language: Delphi Study And Metrics Analyses, J. Erickson, Keng Siau Dec 2004

Theoretical And Practical Complexity Of Unified Modeling Language: Delphi Study And Metrics Analyses, J. Erickson, Keng Siau

Research Collection School Of Computing and Information Systems

Systems have become increasingly complex, and as a result development methods have become more complex as well. The unified modeling language (UML) has been criticized for the often cited and sometimes over- whelming complexity it presents to its users, and those seeking to learn to use it. Using Rossi and Brinkkemper’s (1996) complexity metrics, Siau and Cao (2001) completed a complexity analysis of UML and 36 other modeling techniques, finding that UML is indeed more complex than other techniques. Siau, Erickson and Lee (2002) proposed that Rossi and Brinkkemper’s metrics present the theoretical maximum complexity, known as theoretical complexity. This …


Justilm: Few-Shot Justification Generation For Explainable Fact-Checking Of Real-World Claims, Fengzhu Zeng, Wei Gao Dec 2004

Justilm: Few-Shot Justification Generation For Explainable Fact-Checking Of Real-World Claims, Fengzhu Zeng, Wei Gao

Research Collection School Of Computing and Information Systems

Justification is an explanation that supports the verdict assigned to a claim in fact-checking. However, the task of justification generation is previously oversimplified as summarization of fact-check article authored by professional checkers. In this work, we propose a realistic approach to generate justification based on retrieved evidence. We present a new benchmark dataset called ExClaim for Explainable Claim verification, and introduce JustiLM, a novel few-shot retrieval-augmented language model to learn justification generation by leveraging fact-check articles as auxiliary resource during training. Our results show that JustiLM outperforms in-context learning (ICL)-enabled LMs including Flan-T5 and Llama2, and the retrieval-augmented model Atlas …


On The Use Of Randomness In Computing To Perform Intelligent Tasks, Ryan Scott Regensburger Dec 2004

On The Use Of Randomness In Computing To Perform Intelligent Tasks, Ryan Scott Regensburger

Theses and Dissertations

The study of Artificial Intelligence attempts to simulate the processes of human intelligence in a set of computable algorithms. The purpose of Random Algorithms in this field is to provide a best-guess approach at identifying the unknown. In this thesis, research shows that random algorithms are able to break down many intelligent processes into a set of solvable problems. For example, solving puzzles and playing games involve the same estimating ability shown in standard problems such as the Coupon Collector problem or the Monty Hall problem. This thesis shows Random Algorithmic applications in two overlapping categories of intelligent behavior: Pattern …


Modeling The Spread And Prevention Of Malicious Mobile Code Via Simulation Cs-2004-15, Christopher Brian Shirey Dec 2004

Modeling The Spread And Prevention Of Malicious Mobile Code Via Simulation Cs-2004-15, Christopher Brian Shirey

Theses and Dissertations

Malicious mobile code causes billions of dollars every year in damages, and that cost keeps increasing. Traditional signature-based anti-virus software is a reactive solution that can not detect fast spreading malicious code quickly enough to prevent widespread infection. If we hope to prevent widespread infection of future malicious mobile code, new prevention techniques must be developed that either stop a new infection completely, or at least limit the spread until signature-based anti-virus software can be updated. Simulators exist that model the spread of malicious mobile code, but none currently exists that can efficiently model host-based and network-based spread prevention techniques …


Factors Impacting E-Government Development, Keng Siau, Y. Long Dec 2004

Factors Impacting E-Government Development, Keng Siau, Y. Long

Research Collection School Of Computing and Information Systems

E-government is a way for governments to use new technologies such as the Internet to provide citizens with more convenient access to government information and services, to improve the quality of services, and to provide greater opportunities for citizens to participate in democratic institutions and processes. This research investigates factors impacting e-government development. Based on the growth theory and human capital theory from the economics literature, we hypothesize that information and computer technology, and human development are two factors impacting e-government development. The hypotheses were empirically tested using secondary data from the United Nations and the United Nations Development Programme. …