ppxscal/embedding_network huggingface dataset:
Planning with Action Abstraction and Plan Decomposition Hierarchies
Authors: Christel Kemke, Erin Walker
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Useful and suitable action representations, with accompanying planning algorithms are crucial for the task performance of many agent systems, and thus a core issue of research on intelligent agents. An efficient and expressive representation of actions and plans can allow planning systems to retrieve relevant knowledge faster and to access and use suitable actions more effectively [18]. Two general approaches have been pursued in the past; STRIPS-based planners, which construct plans from scratch, based on primitive action descriptions and planners using pre-defined Plan Decompositions Hierarchies, also known as Hierarchical Task Networks. In our research, we integrated both an inheritance hierarchy of actions, using STRIPS-like action descriptions, with a plan decomposition hierarchy, which consists of pre-defined plan schemata. This combination is suitable for a richer action and plan representation, and thus an improved planning algorithm. We implemented and tested this approach for a prototypical example application: the travel planning domain.
Using a Topic Grid and Semantic Wikis for Ontology-Based Distributed Knowledge Management in Enterprise Software Development Processes
Authors: Axel Korthaus, Martin Schader
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

Enterprise software development is a very knowledgeintensive process. Modern component-based application development organizations often require collaboration of several stakeholders distributed between different sites. To support developers in performing their tasks, suitable knowledge management tools are required that are able to leverage semantics. Recent developments in the context of the Semantic Web and ontologies including technologies such as Topic Maps or RDF/OWL show potential to address those issues. In this paper, we present an architecture for a distributed knowledge management information system that uses Topic Maps in the background and Semantic Wikis as front end for developers to document and access relevant software development knowledge. The backbone is a Topic Map application infrastructure (called "Topic Grid" in the following) allowing transparent, node-spanning access to different Topic Maps distributed in a network.
The immersant experience of osmose and eph&eacute;m&egrave;re
Authors: Harold Thwaites
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

This paper outlines a study on the audience impact of the immersive virtual artworks, namely Osmose and Eph&eacute;m&egrave;re, created by artist Char Davies. The first half of the results from Osmose and Eph&eacute;m&egrave;re are discussed here. The study was undertaken at two different exhibit locations in Perth and Melbourne Australia, in 2002 and 2004 respectively. A shorter and limited report on this project was presented in July of 2003 at the Consciousness Reframed Conference, University College Newport Wales.
Adaptive Task Scheduling on Optical Grid
Authors: Xuebin Liang, Xinhua Lin, Minglu Li
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Optical Grid will be an attractive proposition, as the bandwidth of electrical network becomes the bottleneck of grid application. However, few scheduling methods consider the communication contention on optical Grid. This paper raises an optical grid model based on the characters of optical network. In this model, the network resource was granted the same level to be considered as the computation and storage resource. In order to reflect the reality in job scheduling, allocation of network resource for data transfer was taken into consideration. Then, this paper presents a communication contention-aware solution based on the list scheduling to minimize the total execution time for given tasks towards an optical grid, where the router algorithm was modified from Dijkstra route algorithm. Results proved the feasibility and efficiency of the solution proposed.
Storage Active Service: Model, Method and Practice
Authors: Lingfang Zeng, Dan Feng, Fang Wang, Lei Tian, Zhan Shi
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

For current storage system, data service only passively response data consumer's requests. With the increasing requirements of mass data storage and the development of the hardware technology of computer architecture, storage active service becomes a crucial research topic. How to utilize the computation power on the future storage device to provide high performance computation and data access has been a hot and challenging task. Storage object is a fundamental unit that comprises not only data but also attributes. Storage object has been proposed in the past, but its definition should be extended. The goals of the storage active service project are to combine and distill previous work into a simple and usable model, design a storage active service mechanism as an understandable extension to object, and most importantly build a working system - a system that augments conventional structured and unstructured data management with data, attributes and trigger as an integral part of the storage object. This paper provides numerous motivating practices for storage active service and lays out preliminary plans for the forecast mechanism based on psychology.
TOP-COP: Mining TOP-K Strongly Correlated Pairs in Large Databases
Authors: Hui Xiong, Mark Brodie, Sheng Ma
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Recently, there has been considerable interest in computing strongly correlated pairs in large databases. Most previous studies require the specification of a minimum correlation threshold to perform the computation. However, it may be difficult for users to provide an appropriate threshold in practice, since different data sets typically have different characteristics. To this end, we propose an alternative task: mining the top-k strongly correlated pairs. In this paper, we identify a 2-D monotone property of an upper bound of Pearson's correlation coefficient and develop an efficient algorithm, called TOP-COP to exploit this property to effectively prune many pairs even without computing their correlation coefficients. Our experimental results show that the TOP-COP algorithm can be orders of magnitude faster than brute-force alternatives for mining the top-k strongly correlated pairs.
AdaBoost.MRF: Boosted Markov Random Forests and Application to Multilevel Activity Recognition
Authors: Tran The Truyen, Dinh Q. Phung, Svetha Venkatesh, Hung H. Bui
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Activity recognition is an important issue in building intelligent monitoring systems. We address the recognition of multilevel activities in this paper via a conditional Markov random field (MRF), known as the dynamic conditional random field (DCRF). Parameter estimation in general MRFs using maximum likelihood is known to be computationally challenging (except for extreme cases), and thus we propose an efficient boosting-based algorithm AdaBoost.MRF for this task. Distinct from most existing work, our algorithm can handle hidden variables (missing labels) and is particularly attractive for smarthouse domains where reliable labels are often sparsely observed. Furthermore, our method works exclusively on trees and thus is guaranteed to converge. We apply the AdaBoost.MRF algorithmto a home video surveillance application and demonstrate its efficacy.
The pairwise Escape-G metric: a measure for air combat maneuvering performance
Authors: Antoinette M. Portrey, Brian Schreiber, Winston Bennett,  Jr.
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The Air Force Research Laboratory, Warfighter Readiness Research Division, is continuously researching tools to measure performance of knowledge and skills from an individual level to the Command and Control (C2) level, within both high fidelity distributed simulation environments and live training environments. Using the Performance Effectiveness Tracking System (PETS), we ran preliminary testing of a metric called Pairwise Escape-G that uses a concept called the Theoretical Instantaneous Probability of Weapon Intercept (TIPWI). TIPWI takes into account the current geometry of one aircraft against another for each given weapon (i.e., the physics-based envelope parameters) and is the weapon's probability of threat intercept at any instant during an engagement. This paper will describe the initial application of the Escape G metric within the Distributed Mission Operations Testbed (four high-fidelity F-16 simulators, one Airborne Warning and Controller System console, and Instructor Operator Station), preliminary outcomes, and suggested applications for this metric.
SEAM: A Sound-Embedded Advertisement Model for Online Digital Music Distribution
Authors: Dimitrios Margounakis, Dionysios Politis, Christina Boutsouki
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

The new face of the music industry worldwide requires new strategies and different business models. One of the revolutionary business models for online music distribution via Internet is the advertisement model (ad-based model). The model proposed in this study originated from the advertisement model and is based on the distribution of free music with embedded sound advertisement spots of several sponsors. The alternative revenue from advertising could bring in profits to the music industry. A financial analysis and theoretical "simulation" of the proposed model with realistic numbers proves that it could be successfully implemented under certain circumstances.
Effects of local-lag mechanism on task performance in a desktop CVE system
Authors: Hong Chen, Ling Chen, Gen-Cai Chen
Venue: Journal of Computer Science and Technology (2005)

Consistency maintenance is a kernel problem in Collaborative Virtual Environment (CVE) research. The approaches used in Networked Virtual Environments (e.g., DR algorithm) could not be used in CVEs, for they could not prevent short-term inconsistency. Therefore, local-lag mechanism has been proposed to eliminate short-term inconsistency in CVEs. Choosing a proper lag value is a key problem in local-lag mechanism. This paper studied the effects of lag value (0ms-900ms) on task performance in a desktop CVE system. Experimental results indicate that the effect of lag value on task performance is not linear. The effect could be separated into four segments by three dividing points: 150ms, 300ms and 600ms. Lag has no effect on task performance while ranging from 0ms to 150ms. From 150ms to 300ms, lag slightly affects task performance. Lag deteriorates task performance seriously while ranging from 300ms to 600ms. When lag is longer than 600ms, the task cannot be accomplished sometimes.
A Requirements Primer
Authors: George W. Beeler,  Jr., Dana Gardner
Venue: Queue (2006)

Many software engineers and architects are exposed to compliance through the growing number of rules, regulations, and standards with which their employers must comply. Some of these requirements, such as HIPAA (Health Insurance Portabililty and Accountability Act), focus primarily on one industry, whereas others, such as SOX (Sarbanes-Oxley Act), span many industries. Some apply to only one country, while others cross national boundaries. To help navigate this often confusing world, Queue has assembled a short primer that provides background on four of the most important compliance challenges that organizations face today.
Disturbance Rejection of Distillation Column Using Multiloop Nonlinear Adaptive PID Controller
Authors: P. Eslami, M. R. Jahed Motlagh, R. Sarang
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

In this paper we present an enhanced adaptive PID Controller tuning for multivariable systems with concerning load disturbances. Attention of load disturbances is of primary concern for process control and set point following is often less important. An auto tuning neuron which provides 3 adjustable parameters is used to adjust gains of the multivariable PID controller, which is tuned on-line according to improved adaptation laws and accurate implementation. Simulations show the effectiveness of tuning scheme and better disturbance rejection.
AXMEDIS Programme and Publication Tools Integration with Workflow-Enabled Communication and Process Control
Authors: K. Ng, A. Badii, M. Sailor, B. Ong, R. Neagle, G. Quested
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

This paper presents the AXMEDIS Programme and Publications (P&P) tools as supported by Workflow (WF) integration enabling communication and control in a way that is designed to empower the user to locate digital contents of interest over the AXMEDIS P2P network and to manage and assign the distributions as required. These communications support a large set of interconnections between different sections of the AXMEDIS framework to enable automated processing and integration of digital contents. Following a brief introduction to the overall AXMEDIS framework, this paper presents the functionalities and features of the Programme and Publication (P&P) tools, discusses each individual component, including the P&P Editor and P&P Engine set in the context of the architecture for workflow integration and control for P&P Tools within the AXMEDIS Framework.
Latest arrival time leaky bucket for HRD constrained video coding
Authors: Lujun Yuan, Wen Gao, Yan Lu
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Hypothetical reference decoder (HRD) is a mathematical model of a decoder and its input buffer. It represents a set of normative requirements on bitstream for the purpose of avoiding buffer overflow and underflow. In other words, any coded video bitstream shall meet constraints imposed by HRD model. Two HRD models, i.e. the earliest arrival time leaky bucket (EAT- LB) and the constrained arrival time leaky bucket (CAT-LB), have been proposed for the JVT standard jointly developed by ISO/IEC and ITU-T. EAT-LB has the lower initial delay, whereas the CAT-LB model has the lower maximum delay. This paper proposes an improved leaky bucket model called latest arrival time leaky bucket (LAT-LB) so as to achieve the advantages of EAT-LB and CAT-LB simultaneously. The proposed LAT-LB first defines the data transmission schedule according to a set of resume points and stop points, and then derives the HRD parameters according to this schedule. Experimental results demonstrate that the proposed LAT-LB outperforms EAT-LB and CAT-LB in terms of initial delay and maximum delay.
Multimodal user interface facilitating critical data entry for traffic incident management
Authors: Ronnie Taib, Yu Shi, Eric Choi, Fang Chen, Matthew Sladescu, Nhan Phung
Venue: Proceedings of the 2005 NICTA-HCSNet Multimodal User Interaction Workshop - Volume 57 (2006)

Efficient road traffic incident handling is essential to the overall operations of transport management. Traffic incident handling requires fast and accurate retrieval of contact information for senior executives, as well as that for the intervention crew near the incident location. A user interface mock-up based on multimodal user interaction technology is presented to provide traffic control operators with an intuitive, cognitively effective and efficient way to record traffic incident conditions and facilitate fast retrieval of contact details.
Interaction Testing in Model-Based Development: Effect on Model-Coverage
Authors: Renee C. Bryce, Ajitha Rajan, Mats P. E. Heimdahl
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Model-based software development is gaining interest in domains such as avionics, space, and automotives. The model serves as the central artifact for the development efforts (such as, code generation), therefore, it is crucial that the model be extensively validated. Automatic generation of interaction test suites is a candidate for partial automation of this model validation task. Interaction testing is a combinatorial approach that systematically tests all t-way combinations of inputs for a system. In this paper, we report how well interaction test suites (2-way through 5-way interaction test suites) structurally cover a model of the modelogic of a flight guidance system. We conducted experiments to (1) compare the coverage achieved with interaction test suites to that of randomly generated tests and (2) determine if interaction test suites improve the coverage of black-box test suites derived from system requirements. The experiments show that the interaction test suites provide little benefit over the randomly generated tests and do not improve coverage of the requirements-based tests. These findings raise questions on the application of interaction testing in this domain.
Segmentation by Level Sets and Symmetry
Authors: Tammy Riklin-Raviv, Nahum Kiryati, Nir Sochen
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Shape symmetry is an important cue for image understanding. In the absence of more detailed prior shape information, segmentation can be significantly facilitated by symmetry. However, when symmetry is distorted by perspectivity, the detection of symmetry becomes non-trivial, thus complicating symmetry-aided segmentation. We present an original approach for segmentation of symmetrical objects accommodating perspective distortion. The key idea is the use of the replicative form induced by the symmetry for challenging segmentation tasks. This is accomplished by dynamic extraction of the object boundaries, based on the image gradients, gray levels or colors, concurrently with registration of the image symmetrical counterpart (e.g. reflection) to itself. The symmetrical counterpart of the evolving object contour supports the segmentation by resolving possible ambiguities due to noise, clutter, distortion, shadows, occlusions and assimilation with the background. The symmetry constraint is integrated in a comprehensive level-set functional for segmentation that determines the evolution of the delineating contour. The proposed framework is exemplified on various images of skewsymmetrical objects and its superiority over state of the art variational segmentation techniques is demonstrated.
Image annotation watermarking: nested object embedding using hypergraph model
Authors: Claus Vielhauer, Maik Schott
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

In this paper, we introduce to the special domain of image annotation watermarking, based on embedding of hierarchical data related to objects into user-selected areas on an image. In comparison to earlier methods, the main goal of the work presented here is to provide a specific robustness, specifically against cropping, in a way that preserves hierarchical object relations even after retrieval from a partial image, which has been cut from the original (pure security aspects are of limited relevance for our application). We identify two initial categories for such relations, visual-functional and visual-spatial and suggest a novel coding scheme for the first of these. Our prototypical system consists of a new ontology-based interactive editor and a watermarking scheme, which is an extension of previously suggested block-based image watermarking towards the specific requirements for annotation watermarking. Our initial experiments of the new approach include evaluation of appropriate synchronization patterns and issues of their threshold-based exhaustive search. Further, we present results from robustness tests, which are based on cropping and lossy JPEG compression. Our findings show that the suggested method is capable to restore payload in a hierarchy-preserving way after up to 50% JPEG compression, with a low to medium loss of transparency, which has been evaluated subjectively. Further, we observe that even when limiting exhaustive search to those watermark candidates showing the highest embedding energy, we are able to correctly detect between 55% and 100% of cropped objects.
A note on cancellation path modeling signal in active noise control
Authors: Ming Wu, Xiaojun Qiu, Boling Xu, Ningrong Li
Venue: Signal Processing (2006)

This communication analyzes the performance of using band stop (BS) signal for on-line cancellation path modeling in active noise control when the disturbance is a tonal or narrow band signal. It is shown theoretically and experimentally that the modeling error is mainly caused by the corresponding spectral components of the modeling signal close to the central frequency of the disturbance signal. Thus using BS random signal as the modeling signal can significantly reduce the modeling error than using random signal if the frequency components of the BS random signal around the frequency of the disturbance signal is much less than that of random signal.
A Method for Determining an Emergency Readmission Time Window for Better Patient Management
Authors: Eren Demir, Thierry Chaussalet, Haifeng Xie, Peter H. Millard
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

This paper introduces an modelling approach to determining the appropriate width of a time window within which an admission is classified as a readmission. The approach is based on an intuitive idea that patients, who are discharged from hospital, can be broadly considered as consisting of two groups -a group that is at high risk of readmission and a group that is at low risk. Using national data from the London area (UK), we demonstrate its usefulness in the case of chronic obstructive pulmonary diseases (COPD), one of the leading causes of early readmission. Although marked regional differences exist for the optimal width of the time window for COPD patients, our findings are largely inline with figures used by the government, hance provide some support for the use of 28 days as the time window for defining COPD readmissions. The novelty of this modelling approach lies in its ability to estimate an appropriate time window based on evidence objectively derived from operational data. Therefore, it can provide a means of monitoring performance for hospitals, and can potentially contribute to the better management of patient care.