ppxscal/embedding_network huggingface dataset:
Deterministic Simulation of a NFA with k---Symbol Lookahead
Authors: Bala Ravikumar, Nicolae Santean
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA's resources (states and transitions). Unlike the standard NFA simulation, involving an algorithm which stores at each step all the states reached nondeterministically while reading the input, we consider deterministic finite automata (DFA) with lookahead, which choose the "right" NFA transitions based on a fixed number of input symbols read ahead. This concept, known as lookahead delegation, arose in a formal study of web services composition and its subsequent practical applications. Here we answer several related questions, such as "when is lookahead delegation possible?" and "how hard is it to find a delegator with a given lookahead buffer size?". In particular, we show that only finite languages have the property that all of their NFA's have delegators. This implies, among others, that delegation is a machine property, rather than a language property. We also prove that the existence of lookahead delegators for unambiguous NFA is decidable, thus partially solving an open problem. Finally, we show that finding delegators (even for a given buffer size) is hard in general, and is efficient for unambiguous NFA, and we give an algorithm and a compact characterization for NFA delegation in general.
COMANCHE: An Architecture for Software Configuration Management in the Home Environment
Authors: Sara Grilli, Andrea Villa, Christoforos Kavadias
Venue: Proceedings of the 2nd international conference on Network-Based Information Systems (2008)

The number of "intelligent" devices with computing and communication capabilities, that surround people in the home environment, are continuously growing. This kind of devices is characterized by software running on them but this needs to be configured and updated from time to time. The user who wants to configure and update these devices has to face the variety of devices configuration procedures and to find the software updates from different manufacturers. This intrinsic difficulty in configuring and updating devices, together with their spreading, make the necessity of an automatic configuration system grow. The COMANCHE project has proposed a complete architecture for software configuration management in the home environment, which aims to overcome the heterogeneity of configuration and upgrading procedures and will allow the deployment of value added services. This paper will give a screenshot of the defined architecture, comparing it also with other configuration and updating existing solutions, like OMA and TR-69.
Caution: This Product Contains Security Code
Authors: Martin Stytz, James A. Whittaker
Venue: IEEE Security and Privacy (2003)

Traditionally, software developers have written functional code and error code. Now they must consider writing a third type of code, security code. Unfortunately, few programmers have learned the intricacies of developing security code. In this article, the authors look at today's security coding environment and suggest some research approaches to advance programmers' capabilities in this challenging arena.
An Artificial Immune Network Model Applied to Data Clustering and Classification
Authors: Chenggong Zhang, Zhang Yi
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

A novel tree structured artificial immune network is proposed. The trunk nodes and leaf nodes represent memory antibodies and non-memory antibodies, respectively. A link is setup between two antibodies immediately after one has reproduced by another. By introducing well designed immune operators such as clonal selection, cooperation, suppression and topology updating, the network evolves from a single antibody to clusters that are well consistent with the local distribution and local density of original antigens. The framework of learning algorithm and several key steps are described. Experiments are carried out to demonstrate the learning process and classification accuracy of the proposed model.
Multi-level Clustering in Sarcoidosis: A Preliminary Study
Authors: V. L. Karthaus, H. H. Donkers, J. C. Grutters, H. J. Herik, J. M. Bosch
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

Sarcoidosis is a multisystem disorder that is characterized by the formation of granulomas in certain organs of the body. The exact cause of sarcoidosis is unknown but evidence exists that sarcoidosis results from exposure of genetically susceptible hosts to specific environmental agents. The wide degree of clinical heterogeneity might indicate that sarcoidosis is not a single polymorphic disease but a collection of genetically complex diseases. As a first step to identify the hypothesized subcategories, large amounts of multidimensional data are collected that are divided into distinct levels. We investigated how clustering techniques can be applied to support the interpretation of sarcoidosis and subsequently to reveal categories of sarcoidosis data. An attempt is made to relate multiple clusters between the different data levels based on validation criteria.
Internet Use Rising Among Developing Country Firms, But E-Business Lags
Authors: Staff
Venue: I-WAYS - The Journal of E-Government Policy and Regulation (2005)

A global database of ICT indicators is being prepared under the leadership of the UN Conference on Trade and Development (UNCTAD). This new information, presented in the UNCTAD 2004 E-Commerce Development Report, is intended to assist developing countries in addressing their lack of reliable, internationally comparable statistical information about ICT usage, which is essential for ICT policy-making. Already known is that automating and integrating business processes through ICTs (e-business) is much less frequent in SMEs, and E-Commerce is still rare, particularly for direct sales. This initiative is part of efforts to promote the World Summit on the Information Society (WSIS), the second phase due to take place in Tunis later in 2005. Another issue raised in the report is Internet Governance, that is a question receiving wide attention. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Visualized Voice Service System by VSXML
Authors: Hung-Jen Chou, Yung-Wei Kao, Sheau-Ling Hsieh, Shyan-Ming Yuan
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

The paper presents Voice Service XML (VSXML) technologies to transform the traditional voice services into the visualized ones for mobile phone users. The technologies contain VSXML formatted files, VSXML Designer, and VSXML Renderer. The VSXML file encapsulates the interactive Question Units plus the communication protocols during the voice services conversation. The VSXML Designer is a toolkit can provide visualizable and handy applications for voice service designers. The VSXML Renderer generates the corresponding controls of the voice service conversion according to the VSXML file. The techniques have been designed and implemented to Motorola and Nokia mobile phones. We did the preliminary investigation regarding the VSXML Designer toolkit usage as well. The paper concludes the technologies are flexible and easy to adapt. In general, the voice services can be visualizable completely if there is no database accessing. We also addressed the future work of the technologies.
A Remote Sensing Image Fusion Algorithm Based on Constrained Nonnegative Matrix Factorization
Authors: Zhongni Wang, Xianchuan Yu, Libao Zhang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Data fusion on remote sensing is one of important problems in current image processing. The key of a successful image fusion is to find effective and practical image fusion algorithm. To eliminate image data redundancy for two different remote sensing images, a new approach using the constrained nonnegative matrix factorization for remote image fusion between Landsat ETM+ panchromatic and CBERS multi-spectral images is proposed. Visual and statistical analyses prove that the concept of fusion based on constrained nonnegative matrix factorization is promising, and it does significantly increasing the signal-to-noise ratio and improve the fusion quality compared to conventional IHS and wavelet fusion techniques.
Archetype-Driven Character Dialogue Generation for Interactive Narrative
Authors: Jonathan P. Rowe, Eun Young Ha, James C. Lester
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

Recent years have seen a growing interest in creating virtual agents to populate the cast of characters for interactive narrative. A key challenge posed by interactive characters for narrative environments is devising expressive dialogue generators. To be effective, character dialogue generators must be able to simultaneously take into account multiple sources of information that bear on dialogue, including character attributes, plot development, and communicative goals. Building on the narrative theory of character archetypes, we propose an archetype-driven character dialogue generator that uses a probabilistic unification framework to generate dialogue motivated by character personality and narrative history to achieve communicative goals. The generator's behavior is illustrated with character dialogue generation in a narrative-centered learning environment, Crystal Island.
On Affect and Self-adaptation: Potential Benefits of Valence-Controlled Action-Selection
Authors: Joost Broekens, Walter A. Kosters, Fons J. Verbeek
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

Psychological studies have shown that emotion and affect influence learning. We employ these findings in a machine-learning meta-parameter context, and dynamically couple an adaptive agent's artificial affect to its action-selection mechanism (Boltzmann β). The agent's performance on two important learning problems is measured. The first consists of learning to cope with two alternating goals. The second consists of learning to prefer a later larger reward (global optimum) for an earlier smaller one (local optimum). Results show that, compared to several control conditions, coupling positive affect to exploitation and negative affect to exploration has several important benefits. In the alternating-goal task, it significantly reduces the agent's "goal-switch search peak". The agent finds its new goal faster. In the second task, artificial affect facilitates convergence to a global instead of a local optimum, while permitting to exploit that local optimum. We conclude that affect-controlled action-selection has adaptation benefits.
User-directed routing: from theory, towards practice
Authors: Paul Laskowski, Benjamin Johnson, John Chuang
Venue: Proceedings of the 3rd international workshop on Economics of networked systems (2008)

User-directed routing technologies - that is, systems in which users choose their own routes through a communications network - have generated considerable interest in recent years. Despite their numerous theoretical advantages, ISPs have so far resisted these technologies, even as users have learned to capture some routing power through overlay networks. This study responds to this disconnect between theory and practice by asking how user-directed routing would affect three prominent objectives of network operators: maintaining control over the network, earning profits, and keeping inner details of the network secret. Contrary to the modern theme in routing proposals, we argue that user-directed routing is not fundamentally incompatible with ISP-control, as long as a flexible pricing system is in place. Instead - and under surprisingly general assumptions - an ISP can use prices on the open market to induce any feasible traffic pattern. Moreover, we argue that the market-based approach maximizes welfare for any given traffic pattern. In general, our model does not guarantee whether an ISP will earn more money under user-directed routing. Nevertheless, we provide some intuition to suggest why a typical ISP may expect higher profits. Finally, we suggest that giving routing power to users conflicts with an ISP's desire for secrecy. At the same time, widespread adoption of user-directed routing, perhaps promoted through regulation, may facilitate a transparent and civil industry, to the benefit of many ISPs.
eGovernment in the European Union: Online Availability of Public Services
Authors: Staff
Venue: I-WAYS - The Journal of E-Government Policy and Regulation (2005)

This is an assessment of progress that has been made in European Union countries to introduce eGovernment in public services. It results from a study conducted by Capgemini under the Commission's eEurope 2005 program. The study focuses on online availability and sophistication of 20 public services, 12 for citizens and 8 for businesses. However, the study does not measure actual use of these services or the impact on cost or time savings. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A New Automatic Planning of Inspection of 3D Industrial Parts by Means of Visual System
Authors: J. M. Sebastián, D. García, A. Traslosheros, F. M. Sánchez, S. Domínguez
Venue: Proceedings of the 4th international conference on Image Analysis and Recognition (2007)

This paper describes a new planning algorithm to perform automatic dimensional inspection of 3D industrial parts using a machine vision system. Our approach makes use of all the information available in the system: model of the machine part to inspect and characteristics of the inspection system obtained in previous calibration stages. The analysis is based on discretizing both the configuration space of the system as well as the geometry of the part. Our method does not limit the range of application of the system. It neither imposes any restrictions to the viewpoints from where the part is to be inspected nor to the complexity of the part. All the results shown in this study have been tested with a machine vision inspection system for quality control of industrial parts which consists of a stereoscopic pair of cameras and a laser plane.
Generating Probabilistic and Intensity-Varying Workload for Web-Based Software Systems
Authors: André van Hoorn, Matthias Rohr, Wilhelm Hasselbring
Venue: Proceedings of the SPEC international workshop on Performance Evaluation: Metrics, Models and Benchmarks (2008)

This paper presents an approach and a corresponding tool for generating probabilistic and intensity-varying workload for Web-based software systems. The workload to be generated is specified in two types of models. An application model specifies the possible interactions with the Web-based software system, as well as all required low-level protocol details by means of a hierarchical finite state machine. Based on the application model, the probabilistic usage is specified in corresponding user behavior models by means of Markov chains. Our tool Markov4JMeter implements our approach to probabilistic workload generation by extending the popular workload generation tool JMeter. A case study demonstrates how probabilistic workload for a sample Web application can be modeled and executed using Markov4JMeter.
Optimal data rate selection for vehicle safety communications
Authors: Daniel Jiang, Qi Chen, Luca Delgrossi
Venue: Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking (2008)

This paper answers a simple but important question in VANET research: what is the optimal data rate to be used in DSRC-based vehicle safety communications? While it is generally accepted that the default choice is 6 Mbps, this assumption is not rooted in strong technical considerations. This paper provides a systematic evaluation of optimized data rates choices in a variety of scenarios. The answer found enables researchers to generally eliminate one dimension of complexity in relevant VANET studies. Additionally, the methodology used in this paper is possibly as interesting as the conclusion.
Integral vs. Separable Attributes in Spatial Similarity Assessments
Authors: Konstantinos A. Nedas, Max J. Egenhofer
Venue: Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space (2008)

Computational similarity assessments over spatial objects are typically decomposed into similarity comparisons of geometric and non-geometric attribute values. Psychological findings have suggested that different types of aggregation functions--for the conversions from the attributes' similarity values to the objects' similarity values--should be used depending on whether the attributes are separable (which reflects perceptual independence) or whether they are integral (which reflects such dependencies among the attributes as typically captured in geometric similarity measures). Current computational spatial similarity methods have ignored the potential impact of such differences, however, treating all attributes and their values homogeneously. Through a comprehensive simulation of spatial similarity queries the impact of psychologically compliant (which recognize groups of integral attributes) vs. deviant (which fail to detect such groups) methods have been studied, comparing the top-10 items of the compliant and deviant ranked lists. We found that only for objects with very small numbers of attributes--no more than two or three attributes for the objects--the explicit recognition of integral attributes is negligible, but the differences between compliant and deviant methods become progressively worse as the percentage of integral attributes increases and the number of groups in which these integral attributes are distributed decreases.
Challenges in Relational Learning for Real-Time Systems Applications
Authors: Mark Bartlett, Iain Bate, Dimitar Kazakov
Venue: Proceedings of the 18th international conference on Inductive Logic Programming (2008)

The problem of determining the Worse Case Execution Time (WCET) of a piece of code is a fundamental one in the Real Time Systems community. Existing methods either try to gain this information by analysis of the program code or by running extensive timing analyses. This paper presents a new approach to the problem based on using Machine Learning in the form of ILP to infer program properties based on sample executions of the code. Additionally, significant improvements in the range of functions learnable and the time taken for learning can be made by the application of more advanced ILP techniques.
A Formal Analysis of Behavioral Equivalence for Web Services
Authors: Li Kuang
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

The notion of behavioral equivalence for web services is a foundation of the priori analysis of what will happen when the service is interacting with others. The dissertation aims to explore a derivative and decidable approach to the formal analysis of behavioral equivalence for web services. The research consists of three inter-dependent studies. The first study investigates the formal express of service interaction behavior using Pi-calculus. The second study builds on the formalization and demonstrates a proper definition of behavioral equivalence and a derivative and computable way to the analysis process. The third study evaluates the effectiveness and usability of the proposed approach by developing a verification tool and conducting a series of experiments.
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
Authors: Yeting Ge, Clark Barrett, Cesare Tinelli
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

First order logic provides a convenient formalism for describing a wide variety of verification conditions. Two main approaches to checking such conditions are pure first order automated theorem proving (ATP) and automated theorem proving based on satisfiability modulo theories (SMT). Traditional ATP systems are designed to handle quantifiers easily, but often have difficulty reasoning with respect to theories. SMT systems, on the other hand, have built-in support for many useful theories, but have a much more difficult time with quantifiers. One clue on how to get the best of both worlds can be found in the legacy system Simplify which combines built-in theory reasoning with quantifier instantiation heuristics. Inspired by Simplify and motivated by a desire to provide a competitive alternative to ATP systems, this paper describes a methodology for reasoning about quantifiers in SMT systems. We present the methodology in the context of the Abstract DPLL Modulo Theories framework. Besides adapting many of Simplify's techniques, we also introduce a number of new heuristics. Most important is the notion of instantiation level which provides an effective mechanism for prioritizing and managing the large search space inherent in quantifier instantiation techniques. These techniques have been implemented in the SMT system CVC3. Experimental results show that our methodology enables CVC3 to solve a significant number of benchmarks that were not solvable with any previous approach.
Analysis of the Size of Antidictionary in DCA
Authors: Julien Fayolle
Venue: Proceedings of the 19th annual symposium on Combinatorial Pattern Matching (2008)

We analyze the lossless data compression scheme using antidictionary. Its principle is to build the dictionary of a set of words that do not occur in the text (minimal forbidden words). We prove here that the number of words in the antidictionary, i.e., minimum forbidden words, behaves asymptotically linearly in the length of the text under a memoryless model on the generation of texts. The linearity constant is explicited. We use methods from analytic combinatorics.