Physical Sciences and Mathematics Commons^™

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

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

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

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

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.

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 …

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 …

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

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

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

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

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

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

Department of Computer Science Technical Reports

No abstract provided.

On Security Notions For Steganalysis, Kisik Chang, Robert H. Deng, Feng Bao, Sangjin Lee, Hyungjun Kim, Jongin Lim

Research Collection School Of Computing and Information Systems

There have been some achievements in steganalysis recently. Many people have been making strides in steganalysis. They have approached steganalysis from different angles; from information theory to complexity theory. Anderson gave a possibility that there is a provable secure steganographic system, but there had not been complexity theoretical approaches for years. In 2002, Katzenbeisser and Petitcolas defined the conditional security of steganography and gave a possibility for a practical, provable secure steganography for the first time, and Hopper et al. introduced a provable secure steganographic algorithm in the sense of complexity theory. Chang et al. also tried to define the …

Design Lessons On Access Features In Paper, Yin-Leng Theng, Dion Hoe-Lian Goh, Ming Yin, Eng-Kai Suen, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Using Nielsen's Heuristic Evaluation, this paper reports a user study with six usability-trained subjects to evaluate PAPER's access features in assisting users to retrieve information efficiently, part of an on-going design partnership with stakeholders and designers/developers. PAPER (Personalised Adaptive Pathways for Exam Resources) is an improved version evolving from an earlier implementation of GeogDL built upon G-Portal, a geospatial digital library infrastructure. After two initial evaluations with student and teacher design partners, PAPER has evolved into a system containing a new bundle of personalized, interactive services with four modules: mock exam; personal coach (practice and review); trend analysis and performance …

Supporting Field Study With Personalized Project Spaces In A Geographical Digital Library, Ee Peng Lim, Aixin Sun, Zehua Liu, John Hedberg, Chew-Hung Chang, Tiong-Sa Teh, Dion Hoe-Lian Goh, Yin-Leng Theng

Research Collection School Of Computing and Information Systems

Digital libraries have been rather successful in supporting learning activities by providing learners with access to information and knowledge. However, this level of support is passive to learners and interactive and collaborative learning cannot be easily achieved. In this paper, we study how digital libraries could be extended to serve a more active role in collaborative learning activities. We focus on developing new services to support a common type of learning activity, field study, in a geospatial context. We propose the concept of personal project space that allows individuals to work in their personalized environment with a mix of private …

Vertical Sensitivity For The Information Security Health Rating Of Enterprises, Arcot Desai Narasimhalu, Nagarajan Dayasindhu, Raghavan Subramanian

Research Collection School Of Computing and Information Systems

INFOSeMM Maturity model was developed jointly by SMU and Infosys. It is recognized that different industry verticals will have different levels of recommended maturity levels. This paper articulates the need for developing the industry vertical benchmarks.

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 …

Method For Identifying Individuals, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

A method and system for identifying a subject comprises obtaining a digitised recording of an electrocardiogram measurement of the subject to be identified, the digitised recording being a cyclic waveform having a peak amplitude. The digitised recording is normalised to reduce variations due to physiological effects, and the normalised recording is processed to determine a feature vector in the frequency domain. The distance between the determined feature vector and a predetermined feature vector is measured to identify the subject.

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 …

Automatic Model Structuring From Text Using Biomedical Ontology, Joshi R., Li X., Ramachandaran S., Tze-Yun Leong

Research Collection School Of Computing and Information Systems

Bayesian Networks and Influence Diagrams are effective methods for structuring clinical problems. Constructing a relevant structure without the numerical probabilities in itself is a challenging task. In addition, due to the rapid rate of innovations and new findings in the biomedical domain, constructing a relevant graphical model becomes even more challenging. Building a model structure from text with minimum intervention from domain experts and minimum training examples has always been a challenge for the researchers. In the biomedical domain, numerous advances have been made which may make this dream a possibility now. We are currently trying to build a general …

High Performance P300 Speller For Brain-Computer Interface, Cuntai Guan, Manoj Thulasidas, Jiankang Wu

Research Collection School Of Computing and Information Systems

P300 speller is a communication tool with which one can input texts or commands to a computer by thought. The amplitude of the P300 evoked potential is inversely proportional to the probability of infrequent or task-related stimulus. In existing P300 spellers, rows and columns of a matrix are intensified successively and randomly, resulting in a stimulus frequency of 1/N (N is the number of rows or columns of the matrix). We propose a new paradigm to display each single character randomly and individually (therefore reducing the stimulus frequency to 1/(N*N)). On-line experiments showed that this new speller significantly improved the …

Secure Hardware Enhanced Myproxy: A Ph.D. Thesis Proposal, John Marchesini, David Kotz

Computer Science Technical Reports

In 1976, Whitfield Diffie and Martin Hellman demonstrated how "New Directions In Cryptography" could enable secure information exchange between parties that do not share secrets. In order for public key cryptography to work in modern distributed environments, we need an infrastructure for finding and trusting other parties' public keys (i.e., a PKI). A number of useful applications become possible with PKI. While the applications differ in how they use keys (e.g., S/MIME uses the key for message encryption and signing, while client-side SSL uses the key for authentication), all applications share one assumption: users have keypairs. In previous work, we …

Parsing Concurrent Xml, Ionut E. Iacob, Alex Dekhtyar, Kazuyo Kaneko

Computer Science and Software Engineering

Concurrent markup hierarchies appear often in document-centric XML documents, as a result of different XML elements having overlapping scopes. They require significantly different approach to management and maintenance. Management of XML documents composed of concurrent markup has been mostly studied by the document processing community and has attracted attention of computer scientists only recently. In this paper we discuss the architecture of an XML parser for concurrent XML. This parser uses a GODDAG data structure in place of traditional DOM Tree to store concurrent markup on top of the document content and provides a DOM-like API that allows software developers …

A Maximal Chain Approach For Scheduling Tasks In A Multiprocessor Systems, Sachin Pawaskar, Hesham Ali

Computer Science Faculty Proceedings & Presentations

Scheduling dependent tasks is one of the most challenging versions of the scheduling problem in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. As a result, researchers have studied restricted forms of the problem by constraining either the task graph representing the parallel tasks or the computer model. Also, in an attempt to solve the problem in the general case, a number of heuristics have been developed. In this paper, we study the scheduling problem for a fixed number of processors m. In the proposed work, we …

A Tail-Recursive Machine With Stack Inspection, John Clements, Mathias Felleisen

Computer Science and Software Engineering

Security folklore holds that a security mechanism based on stack inspection is incompatible with a global tail call optimization policy; that an implementation of such a language must allocate memory for a source-code tail call, and a program that uses only tail calls (and no other memory allocating construct) may nevertheless exhaust the available memory. In this article, we prove this widely held belief wrong.We exhibit an abstract machine for a language with security stack inspection whose space consumption function is equivalent to that of the canonical tail call optimizing abstract machine. Our machine is surprisingly simple and suggests that …

Interoperability And The Need For Intelligent Software, Jens G. Pohl

Collaborative Agent Design (CAD) Research Center

In my introduction to this year’s conference I will address six questions that I believe come to the core of our conference theme of interoperability. Do we human beings resist change? Is it in fact a human problem and not a technical problem that we are dealing with? Can non-human intelligence exist? Do we even have a need for intelligent software? How did software, particularly intelligent software (i.e., if we accept that there is such a thing) evolve over the past several decades, and what is all this talk about a Semantic Web environment? And, finally, what does the …

California State Information Technology Strategic Plan 2004, Office Of The State Chief Information Officer

California Agencies

No abstract provided.

A Survey Of Wpa And 802.11i Rsn Authentication Protocols, Kwang-Hyun Baek, Sean W. Smith, David Kotz

Computer Science Technical Reports

In the new standards for WLAN security, many choices exist for the authentication process. In this paper, we list eight desired properties of WLAN authentication protocols, survey eight recent authentication protocols, and analyze the protocols according to the desired properties.