ppxscal/embedding_network huggingface dataset:
Application of Neural Networks to Decentralized Control of Robotic Manipulators with High Degree of Freedom
Authors: Nasser Sadati, Ehsan Elhamifar
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

In this paper a neural network decentralized control for trajectory tracking of robot manipulators is developed. The proposed decentralized control allows the overall closed-loop system to be stabilized while making the tracking error to be uniformly ultimately bounded (UUB), without having any prior knowledge of the robot manipulator dynamics. The interconnections in the dynamic equations of each subsystem are considered with unknown nonlinear bounds. The RBF neural networks (RBFNNs) are proposed to model the unknown nonlinear dynamics of the robots and the interconnection terms. Using Lyapunov method, the stability of the overall system is investigated.
Adaptive Automatic Grid Reconfiguration Using Workload Phase Identification
Authors: Baochuan Lu, Michael Tinker, Amy Apon, Doug Hoffman, Lawrence Dowdy
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

The purpose of this study is to develop an adaptive-model of a very large scale data processing and storage environment. The target environment includes grid applications such as health-care and finance in which the data may be located primarily within the resources of a worldwide corporation. The approach is to use phase identification techniques that can detect over-utilized grid resources, and then to make dynamic decisions to reassign additional resources to that portion of the application processing. Two phase identification techniques are proposed, a variation technique and a real-time threshold-based technique. The techniques are validated with a simulation model and a case study using measured data from a production grid environment. The case study demonstrates that phase identification techniques can be used as the intelligent component of a reactive mechanism for a grid to adapt to changing environmental conditions by dynamic automatic reconfiguration. Results show that threshold based phase identifying techniques combined with dynamic resource allocation capabilities are effective in alleviating performance hot spots and improving response time in a large scale data grid.
Utility-based Adaptive Resource Allocation in Hybrid Wireless Networks
Authors: Calin Curescu, Simin Nadjm-Tehrani, Bing Cao, Teresa A. Dahlberg
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

Service availability in wireless networks is highly dependent on efficient resource allocation and guaranteed Quality of Service (QoS) amid overloads and failures. This paper addresses optimal bandwidth allocation in a hybrid network (cellular and ad hoc), where added reach through an ad hoc overlay is combined with the stability and essential services of a cellular network. The paper builds on a near optimal approach in which Resource-Utility functions are used as a means of adaptive delivery of QoS, user differentiation, and maximisation of system level utility. It distinguishes between non-adaptive, semi-adaptive, and fully adaptive applications. First, the global cellular bandwidth allocation (in the presence of multiple routes through ad hoc relays) is cast in terms of a Linear Programming problem. Second, a heuristic algorithm that has far lower computational overhead and accrues at worse 12% less than the utility of the optimal solution is presented. Both algorithms are implemented within a model of a hybrid network on top of the JSim simulation environment. Comparative studies are made to show effective load balancing and crash tolerance in the presence of a high traffic overload.
A framework to model complex systems via distributed simulation: a case study of the virtual test bed simulation system using the high level architecture
Authors: Jaebok Park
Venue:  (2005)

As the size, complexity, and functionality of systems we need to model and simulate continue to increase, benefits such as interoperability and reusability enabled by distributed discrete-event simulation are becoming extremely important in many disciplines, not only military but also many engineering disciplines such as distributed manufacturing, supply chain management, and enterprise engineering, etc. In this dissertation we propose a distributed simulation framework for the development of modeling and the simulation of complex systems. The framework is based on the interoperability of a simulation system enabled by distributed simulation and the gateways which enable Commercial Off-the-Shelf (COTS) simulation packages to interconnect to the distributed simulation engine. In the case study of modeling Virtual Test Bed (VTB), the framework has been designed as a distributed simulation to facilitate the integrated execution of different simulations, (shuttle process model, Monte Carlo model, Delay and Scrub Model) each of which is addressing different mission components as well as other non-simulation applications (Weather Expert System and Virtual Range). Although these models were developed independently and at various times, the original purposes have been seamlessly integrated, and interact with each other through Run-time Infrastructure (RTI) to simulate shuttle launch related processes. This study found that with the framework the defining properties of complex systems&mdash;interaction and emergence&mdash;are realized and that the software life cycle models (including the spiral model and prototyping) can be used as metaphors to manage the complexity of modeling and simulation of the system. The system of systems (a complex system is intrinsically a &ldquo;system of systems&rdquo;) continuously evolves to accomplish its goals, during the evolution subsystems coordinate with one another and adapt with environmental factors such as policies, requirements, and objectives. In the case study we first demonstrate how the legacy models developed in COTS simulation languages/packages and non-simulation tools can be integrated to address a complicated system of systems. We then describe the techniques that can be used to display the state of remote federates in a local federate in the High Level Architecture (HLA) based distributed simulation using COTS simulation packages.
A delegation framework for federated identity management
Authors: Hidehito Gomi, Makoto Hatakeyama, Shigeru Hosono, Satoru Fujita
Venue: Proceedings of the 2005 workshop on Digital identity management (2005)

Identity federation is a powerful scheme that links accounts of users maintained distinctly by different business partners. The concept of network identity is a driver for accelerating automation of Web Services on the Internet for users on their behalf while protecting privacy of their personally identifiable information. Although users of Web Services essentially delegate some or all privileges to an entity to perform actions, current identity based systems do not take into sufficient consideration delegation between entities hosting Web Services from a viewpoint of identity and privacy. This paper introduces a delegation model for federated identity management systems and proposes a delegation framework to provide solutions for access control in the context of delegation. The framework has a function of transferring user's privileges across the entities encoded in delegation assertion extending SAML (Security Assertion Markup Language). The framework enables users to manage their own privileges, and service providers to control access of entities based on delegated privileges by the users with assistance of a delegation authority that authorizes delegation of a delegating entity and an authentication authority that authenticates a user and manages user's name identifiers.
Quality Assurance in the Design of Web Information Systems
Authors: Aleksander Binemann-Zdanowicz, Bernhard Thalheim, Klaus-Dieter Schewe, Jane Zhao
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Despite the fact that several integrated development methods for web information systems (WISs) have been proposed, quality assurance for such systems has hardly been addressed. In this paper some quality criteria are postulated and investigated by combining semi-formal and formal methods. On a high level of abstractions WISs can be described by abstract locations and transitions between them. These so-called story spaces can be formalised using Abstract State Machines (ASMs), which permit to verify, whether user-tailored versions are compatible with user preferences. Furthermore, ASMs provide a framework for refinement, which permits the integration of story spaces with extended views on databases. This leads to further proof obligations for consistency that can be formalised in the logic associated with ASMs.
Protecting representation with effect encapsulation
Authors: Yi Lu, John Potter
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

Representation exposure is a well-known problem in the object-oriented realm. Object encapsulation mechanisms have established a tradition for solving this problem based on a principle of reference containment. This paper proposes a novel type system which is based on a different principle, we call effect encapsulation, which confines side effects, rather than object references, according to an ownership structure. Compared to object encapsulation, effect encapsulation liberates us from the restriction on object referenceability and offers more flexibility. In this paper, we show that effect encapsulation can be statically type checked.
Combining Multiple Clusterings by Soft Correspondence
Authors: Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Combining multiple clusterings arises in various important data mining scenarios. However, finding a consensus clustering from multiple clusterings is a challenging task because there is no explicit correspondence between the classes from different clusterings. We present a new framework based on soft correspondence to directly address the correspondence problem in combining multiple clusterings. Under this framework, we propose a novel algorithm that iteratively computes the consensus clustering and correspondence matrices using multiplicative updating rules. This algorithm provides a final consensus clustering as well as correspondence matrices that gives intuitive interpretation of the relations between the consensus clustering and each clustering from clustering ensembles. Extensive experimental evaluations also demonstrate the effectiveness and potential of this framework as well as the algorithm for discovering a consensus clustering from multiple clusterings.
Supporting Classroom Activities with the BSUL Environment
Authors: Nobuji A. Saito, Hiroaki Ogata, Rosa G. J. Paredes, Yoneo Yano, Gerardo Ayala San Martin
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

In this paper we present our ongoing research about the integration of ubiquitous computing systems into classroom settings, in order to give basic support for some classroom and field activities. We have developed some web application components using Java technology and configured a classroom with wireless network access and a web camera for our purposes. In this classroom the students interact between them and with the professor through an Internet enabled PDA, using the different modules described in this paper. We include our evaluations about the performance and usability of the system in a computer science related course of the University of Tokushima, other practical uses and the future research and development work.
High dynamic range imaging
Authors: Paul Debevec, Erik Reinhard, Greg Ward, Sumanta Pattanaik
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

Current display devices can display only a limited range of contrast and colors, which is one of the main reasons that most image acquisition, processing, and display techniques use no more than eight bits per color channel. This course outlines recent advances in high-dynamic-range imaging, from capture to display, that remove this restriction, thereby enabling images to represent the color gamut and dynamic range of the original scene rather than the limited subspace imposed by current monitor technology. This hands-on course teaches how high-dynamic-range images can be captured, the file formats available to store them, and the algorithms required to prepare them for display on low-dynamic-range display devices. The trade-offs at each stage, from capture to display, are assessed, allowing attendees to make informed choices about data-capture techniques, file formats, and tone-reproduction operators. The course also covers recent advances in image-based lighting, in which HDR images can be used to illuminate CG objects and realistically integrate them into real-world scenes. Through practical examples taken from photography and the film industry, it shows the vast improvements in image fidelity afforded by high-dynamic-range imaging.
On instant messaging worms, analysis and countermeasures
Authors: Mohammad Mannan, Paul C. van Oorschot
Venue: Proceedings of the 2005 ACM workshop on Rapid malcode (2005)

We provide a collection of minor results on the area of Instant Messaging (IM) worms, which has received relatively little attention in the formal literature. We review selected IM worms and summarize their main characteristics, motivating a brief overview of the network formed by IM contact lists, and a discussion of theoretical consequences of worms in such networks. Existing methods to restrict an IM worm epidemic are analyzed in terms of usability and effectiveness, leading to the suggestion of two minor variations to limit IM worm propagation. We believe these variations are more user-friendly and effective than existing published methods. We also provide brief results of a three and a half year user study of IM text messaging and file transfer frequency in a moderate-size public IM network -- the largest such study to date -- which is of independent interest, but also supports in part the preceding claim regarding user-friendliness.
RFID security without extensive cryptography
Authors: Sindhu Karthikeyan, Mikhail Nesterenko
Venue: Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks (2005)

A Radio Frequency Identification Device (RFID) allows effective identification of a large number of tagged objects without physical or visual contact. RFID systems are a promising technology for supply chain management and inventory control. As individual item tagging becomes a reality, privacy concerns over RFID use come to the fore. The shared radio medium allow eavesdropping and unauthorized tag reading which poses threats to individual's privacy. Moreover, due to the mode of use of RFIDs, new threats emerge. For example, an intruder may be able to track the movement of an individual by repeatedly querying an RFID attached to the item that this individual carries. The limited size and cost considerations do not allow to implement conventional cryptographic systems on RFIDs. In this paper we propose an efficient RFID tag identification algorithm that incorporates reader-authentication. Our algorithm is secure against the anticipated threats to RFID systems. Our algorithm does not require computationally expensive cryptographic mechanisms, it relies on rather simple matrix multiplication. To further enhance the utility of our algorithm we propose a scheme that allows for the algorithm to carry out secure identification of multiple tags simultaneously.
Semantics Based Operators for Integrating Heterogeneous Biological Data Sources
Authors: Sudha Ram, Wei Wei
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

Advances in analytical techniques have drastically increased the amount of biological data available, which in turn has increased the difficulty and complexity of biological knowledge discovery. It is important to have mechanisms to take full advantage of the data not only for doing simple searches, but also for answering ad hoc and complex questions at the user's will by virtually connecting the heterogeneous data sources. In this paper we propose and formally define new operators that can be used for sequence comparison and alignment. Furthermore, cross-database operators can be developed based on work presented in this paper to dynamically link different types of databases. We believe this will liberate biological researchers from unproductive labor and allow them to focus on pattern seeking and interpretation of results.
Computational methods for least squares problems and clinical trials
Authors: Tze Leung Lai, Michael Saunders
Venue:  (2005)

A practical estimate for the optimal backward errors of linear least squares problems are studied. Dense, sparse, and iterative methods are developed to evaluate the estimate. Numerical results show that the computed estimate of the optimal backward error is very near the true optimal backward error. Algorithms for calculating sequences of upper and lower bounds for the estimate are also developed, based on Gauss quadrature theory. Numerical results show that the bounds converge quickly and are therefore useful in practice. This solves a twenty-five year old problem suggested by Stewart and Wilkinson. Test-based approaches are explored to construct confidence intervals in clinical trials with survival time as the primary response. Importance resampling techniques are developed to compute tail probabilities of the tests, thereby reducing the variance of the Monte Carlo estimate of an error probability and thus the number of simulations required to compute sample size and power in the design stage of a clinical trial and to construct confidence intervals from the trial's data.
Attention region selection with information from professional digital camera
Authors: Song Liu, Liang-Tien Chia, Deepu Rajan
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The attentive region extraction is a challenging issue for semantic interpretation of image and video content. The successful attentive region extraction greatly facilitates image classification, adaptation, compression and retrieval. Different from the traditional visual attention detection models, we propose a new attentive region extraction method based on out-of-focus blurring (OFB) technique used by professional photographers. Firstly, we combine metadata in Exchangeable Image File Format (EXIF) with visual features to quickly select professional photographs from image database. After that, an algorithm is implemented to automatically extract the attentive region from these photographs. This algorithm measures the saliency for individual pixels based on edge distribution of the images. The experimental results on OFB images have proved that our approach is able to overcome the contrast map selection problem of traditional visual attention methods and extract the attentive region using OFB information. The attentive region generated by our algorithm has similar shape and size with the subject of photographs which is a useful information for searching and retrieving the high-level semantic meaningful objects.
Data durability in peer to peer storage systems
Authors: G. Utard, A. Vernois
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

In this paper we present a quantitative study of data survival in peer to peer storage systems. We first recall two main redundancy mechanisms: replication and erasure codes, which are used by most peer to peer storage systems like OceanStore, PAST or CFS, to guarantee data durability. Second we characterize peer to peer systems according to a volatility factor (a peer is free to leave the system at anytime) and to an availability factor (a peer is not permanently connected to the system). Third we model the behavior of a system as a Markov chain and analyse the average life time of data (MTTF) according to the volatility and availability factors. We also present the cost of the repair process based on these redundancy schemes to recover failed peers. The conclusion of this study is that when there is no high availability of peers, a simple replication scheme may be more efficient than sophisticated erasure codes.
Famtile: an algorithm for learning high-level tactical behavior from observation
Authors: Brian S. Stensrud
Venue:  (2005)

This research focuses on the learning of a class of behaviors defined as high-level behaviors. High-level behaviors are defined here as behaviors that can be executed using a sequence of identifiable behaviors. Represented by low-level contexts, these behaviors are known a priori to learning and can be modeled separately by a knowledge engineer. The learning task, which is achieved by observing an expert within simulation, then becomes the identification and representation of the low-level context sequence executed by the expert. To learn this sequence, this research proposes FAMTILE&mdash;the Fuzzy ARTMAP/Template-Based Interpretation Learning Engine. This algorithm attempts to achieve this learning task by constructing rules that govern the low-level context transitions made by the expert. By combining these rules with models for these low-level context behaviors, it is hypothesized that an intelligent model for the expert can be created that can adequately model his behavior. To evaluate FAMTILE, four testing scenarios were developed that attempt to achieve three distinct evaluation goals: assessing the learning capabilities of Fuzzy ARTMAP, evaluating the ability of FAMTILE to correctly predict expert actions and context choices given an observation, and creating a model of the expert's behavior that can perform the high-level task at a comparable level of proficiency.
Dynamic Estimation of Task Level Parallelism with Operating System Support
Authors: Luong D. Hung, Shuichi Sakai
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

The amount of Task Level Parallelism (TLP) in runtime workload is useful information to determine the efficient usage of multiprocessors. This paper presents mechanisms to dynamically estimate the amount of TLP in runtime workloads. Modifications are added to the operating system (OS) to collect information about processor utilization, task activities, from which TLP can be calculated. By effectively utilizing the Time Stamp Counter (TSC) hardware, the task activities can be monitored at fine time resolution, resulting in capability of estimation of TLP at fine granularity. We implement the mechanisms on a recent version of Linux OS. Evaluation results indicate that the mechanisms can estimate TLP accurately for various kinds of workloads with small overheads.
Model reliability and software quality assurance in simulation of nuclear fuel waste management systems
Authors: Tuncer I. Ören, Maurlce S. Elzas, Grant Sheng
Venue: ACM SIGSIM Simulation Digest (1985)

As is the case with all scientific simulation studies, computerized simulation of nuclear fuel waste management systems can introduce and hide various types of errors. Frameworks to clarify issues of model reliability and software quality assurance are offered. Potential problems with reference to the main areas of concern for reliability and quality are discussed; e.g. experimental issues, decomposition, scope, fidelity, verification, requirements, testing, correctness, robustness are treated with reference to the experience gained in the past. A list comprising over 80 most common computerization errors is provided. Software tools and techniques used to detect and to correct computerization errors are discussed.