ppxscal/embedding_network huggingface dataset:
Improving Trust in Composite eServices Via Run-Time Participants Testing
Authors: Flavio Corradini, Francesco Angelis, Andrea Polini, Alberto Polzonetti
Venue: Proceedings of the 7th international conference on Electronic Government (2008)

The Service Oriented Architecture paradigm promises to open and integrate Public Administration offices in order to provide high-value e-services to citizens. Nevertheless to foster real usage of e-services by citizens, in majority still not fully acquainted with Internet technologies, it is necessary to put in place mechanisms to reduce as much as possible perceived system misbehavior. e-Services often handle personal and sensible data, therefore trust on the behavior of the system becomes of primary importance. In this paper, focusing on run-time composition of e-services, we provide an approach that reduces the possibility that the system will fail as consequence of interoperability issues among run-time discovered services, and after that sensible data have been provided by the citizen. The approach uses run-time testing to assess interoperability between services, and model-checking based techniques to reduce the number of test-cases to be applied. An exemplificative case-study is also illustrated and discussed.
On the decomposition of asynchronous systems
Authors: Robert M. Keller
Venue: Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972) (1972)

This paper reports of part of a contunuing investigation of parallel computation, in particular, efforts toward understanding the nature of different types of parallel control. The first section defines an asynchornous system to be a simple type of state machine. This was arrived at in an attempt to generalize from the types of control in parallel program schemata and networks of asynchronous modules without bounded delays. Asychronous systems with output are also defined in a familiar way. The deviation from standard work comes in the definition of a parallel decomposition of asynchronous systems. Some preliminary work on compositions of this type appears in. Such definitions provide a useful analytic tool for discussion of related therioes. 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
Bridging and Fingerprinting: Epistemic Attacks on Route Selection
Authors: George Danezis, Paul Syverson
Venue: Proceedings of the 8th international symposium on Privacy Enhancing Technologies (2008)

Users building routes through an anonymization network must discover the nodes comprising the network. Yet, it is potentially costly, or even infeasible, for everyone to know the entire network. We introduce a novel attack, the route bridging attack, which makes use of what route creators do not know of the network. We also present new discussion and results concerning route fingerprinting attacks, which make use of what route creators do know of the network. We prove analytic bounds for both route fingerprinting and route bridging and describe the impact of these attacks on published anonymity-network designs. We also discuss implications for network scaling and client-server vs. peer-to-peer systems.
Partial Symbolic Pattern Databases for Optimal Sequential Planning
Authors: Stefan Edelkamp, Peter Kissmann
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

This paper investigates symbolic heuristic search with BDDs for solving domain-independent action planning problems cost-optimally. By distributing the impact of operators that take part in several abstractions, multiple partial symbolic pattern databases are added for an admissible heuristic, even if the selected patterns are not disjoint. As a trade-off between symbolic bidirectional and heuristic search with BDDs on rather small pattern sets, partial symbolic pattern databases are applied.
Methodologies for agent systems development: underlying assumptions and implications for design
Authors: Panayiotis Koutsabasis, John Darzentas
Venue: AI Society (2008)

The area of agent systems design may be safely described as cluttered and disorganized, especially by those that situate themselves outside the &#x201c;agent community&#x201d;. Despite the wealth of bibliography on agent systems design and applications, there are few widely acknowledged design methods that have surfaced from testing and practice, mainly in laboratory settings. The paper contributes to the understanding of the field by presenting a critical review of methodologies that have emerged over the last few years to guide and explain agent systems design and development. The perspective for this review has been mainly formulated by posing important research questions in the field, and by attempting to interpret and discover latent hypotheses and underlying assumptions made by methodologies in reference to relevant research, both in agent systems and cooperative information systems practice and theory. The paper identifies significant challenges for agent systems methodologies that, if pursued, can contribute to a new understanding of the field that shifts the foci of current agent systems research, towards holistic design methods that place human users and information systems stakeholders at the centre of interest and involve them in the design process as much as possible.
An IEEE 802.11 g simulation model with extended debug capabilities
Authors: Sorin Cocorada
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

IEEE 802.11g has become the de facto standard for Wireless LAN. Most of the 802.11g functionality is implemented in hardware or firmware; modifying or extending such communication protocols is a difficult task. In this paper, we present modifications to the Omnet++ simulation environment to support an accurate IEEE 802.11g MAC and PHY simulation model. A solution for debugging the proposed model using protocol analyzers is also provided.
Computability and Complexity in Self-assembly
Authors: James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

This paper explores the impact of geometry on computability and complexity in Winfree's model of nanoscale self-assembly. We work in the two-dimensional tile assembly model, i.e., in the discrete Euclidean plane ¿ ×¿. Our first main theorem says that there is a roughly quadratic function f such that a set A ¿ ¿ + is computably enumerable if and only if the set X A = { (f(n), 0) | n ¿ A } --- a simple representation of A as a set of points on the x-axis --- self-assembles in Winfree's sense. In contrast, our second main theorem says that there are decidable sets D ¿ ¿ ×¿ that do not self-assemble in Winfree's sense.Our first main theorem is established by an explicit translation of an arbitrary Turing machine M to a modular tile assembly system $\mathcal{T}_M$, together with a proof that $\mathcal{T}_M$ carries out concurrent simulations of M on all positive integer inputs.
Scalable and Adaptive Metadata Management in Ultra Large-Scale File Systems
Authors: Yu Hua, Yifeng Zhu, Hong Jiang, Dan Feng, Lei Tian
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

This paper presents a scalable and adaptive decentralized metadata lookup scheme for ultra large-scale file systems (≥ Petabytes or even Exabytes). Our scheme logically organizes metadata servers (MDS) into a multi-layered query hierarchy and exploits grouped Bloom filters to efficiently route metadata requests to desired MDS through the hierarchy. This metadata lookup scheme can be executed at the network or memory speed, without being bounded by the performance of slow disks. Our scheme is evaluated through extensive trace-driven simulations and prototype implementation in Linux. Experimental results show that this scheme can significantly improve metadata management scalability and query efficiency in ultra large-scale storage systems.
Dynamic Behavior Qualifiers for Conversational Agents
Authors: Maurizio Mancini, Catherine Pelachaud
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

We aim at defining conversational agents that exhibit qualitatively distinctive behaviors. To this aim we provide a small set of parameters to allow one to define behavior profiles and then leave to the system the task of animating the agent. Our approach is to manipulate the behavior tendency of the agent depending on its communicative intention and emotional state.In this paper we will define the concepts of Baseline and Dynamicline. The Baseline of an agent is defined as a set of fixed parameters that represent the personalized agent behavior, while the Dynamicline, is a set of parameters values that derive both from the Baseline and the current communicative goals and emotional state.
Adaptive Hybrid SMC-SVM Control for a Class of Nonaffine Nonlinear Systems
Authors: Heng Li, Jinhua Wu, Youan Zhang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

An improved hybrid adaptive controller is proposed for a class of nonaffine nonlinear systems based on sliding mode control (SMC) and support vector machine (SVM) in this paper. The sliding mode controller ensures the robustness of the closed loop system while the support vector machine is used to adaptive tracking. Moreover, the Lyapunov stability theory is employed to grantee the global stability. The simulation results have shown the effectiveness of the proposed method.
A Model Driven Approach to Represent Sequence Diagrams as Free Choice Petri Nets
Authors: Mohamed Ariff Ameedeen, Behzad Bordbar
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

Model Driven Development (MDD) aims to promote the role of modeling in Software Engineering. Enterprise systems and architectures are often modeled via multiple representations. For example UML models are widely used by the designers to capture various viewpoint of the system; while formal models using languages such as CSP, Z and Petri Nets are suitable for the analysis. Model transformation techniques developed as a part of MDD can be applied to generate one model from another model automatically. This allows benefiting from the tools and techniques developed and used in multiple languages. This paper presents a method of applying MDD model transformation from UML 2.0 Sequence Diagrams to Petri Nets. The paper shows that the model transformation results in Free Choice Petri Nets. As a result, the low complexity of analysis and the synthesis techniques can be applied to the models of enterprise systems which are captured in UML Sequence Diagrams.
Anticipation based on constraint processing in a multi-agent context
Authors: A. Doniec, R. Mandiau, S. Piechowiak, S. Espié
Venue: Autonomous Agents and Multi-Agent Systems (2008)

Anticipation is a general concept used and applied in various domains. Many studies in the field of artificial intelligence have investigated the capacity for anticipation. In this article, we focus on the use of anticipation in multi-agent coordination, particularly preventive anticipation which consists of anticipating undesirable future situations in order to avoid them. We propose to use constraint processing to formalize preventive anticipation in the context of multi-agent coordination. The resulting algorithm allows any action that may induce an undesirable future state to be detected upstream of any multi-agent coordination process. Our proposed method is instantiated in a road traffic simulation tool. For the specific question of simulating traffic at road junctions, our results show that taking anticipation into account allows globally realistic behaviors to be reproduced without provoking gridlock between the simulated vehicles.
A multi-agent based implementation of a Delphi process
Authors: Iván García-Magariño, Jorge J. Gómez-Sanz, José R. Pérez-Agüera
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

The Delphi protocol is applied when a community of experts is required to reach a consensus and to deliver an answer. In these cases, consensus stands for reaching an agreement among the experts about what the answer should be. This consensus reaching problem has been already considered in the literature, though its automatisation remains as a challenge. Intuitively, the experts should dialogue, interchange ideas, and change their mind as the discussion progresses. This paper presents the first complete-implementation of the Delphi process. This implementation is achieved with a Multi-agent System (MAS), in which the experts are implemented with agents. The presented case study solves the document relevance evaluation problem where a community of experts decide whether a document is relevant or not. In conclusion, this paper makes an important contribution to people using Delphi processes, because the presented system is the first complete-computerised Delphi process. With respect to multi-agent systems, it has the potential to solve coordination in an original way.
Techniques for query optimization, scheduling, and load shedding in data stream management systems
Authors: Chinya V. Ravishankar
Venue:  (2007)

Continuous query (CQ) is an important class of queries in Data Stream Management Systems. While much work has been done on algorithms for processing CQs, less attention has been paid to the issue of optimizing such queries. We first argue that parameters such as output rate and main memory utilization are important cost objectives for CQ performance, than disk I/O. We propose a novel framework, called OM to optimize the memory utilization and output rate of CQs. Our technique monitors input stream and query characteristics, and switches plans only at certain boundary conditions. Our approach is tunable to application requirements and enables a user to make the query performance versus optimization overhead trade-off. Next, we introduce Real-time Continuous Queries (RCQs) over streaming data, and show how to schedule them under dynamic query and data loads. Our Load-adaptive Rate-Monotonic (LRM) scheduling method adapts schedules to load conditions through controlled load-shedding. It accommodates user-specified requirements to maximize result accuracy when CPU-time is a constraint. We show that LRM scheduling is fair, provides response-time guarantees and enables appropriate trade-offs between overhead and deadline misses. Lastly, we address the problem of approximate join processing over data streams. Approximate processing is necessitated in a data stream management system (DSMS) due to the limited availability of main memory. Join being a stateful operation, incoming tuples need to be buffered in main memory, so they can match with future incoming tuples. However, when memory becomes full, there is a need to evict some tuples based on some load-shedding policy. Load-shedding is challenging because there is no foreknowledge of data distributions and arrival rates. Moreover, many real-world DSMS applications over streams, such as stock-ticker applications, news-feeds and sensor-data may model data as having different importance levels. We first show that recent load-shedding policies are not practical, and identify two main reasons for their poor performance, namely (1) premature tuple drop and (2) unproductive tuple retention. We propose a novel framework, called iJoin, which overcomes the above drawbacks, and also provides tuples a fair chance in being part of the join result.
Design and Implementation to Intelligent Examination System for e-Business Application Operation
Authors: Xin Jin, Yanlin Ma
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

This paper presents a design and implementation of an intelligent testing system for checking the e-business application operation capable of the examinees. A novel architecture for on-line examination system is proposed. That system adopts the common client-server pattern with two major parts, the client component also called Student site and the application-oriented server component here also called Teacher site. The Student site provides examinee a GUI (Graphics User Interface) embedded a WWW browser for answering the paper. The Teacher site mainly includes paper management subsystem for managing paper database, a building paper subsystem for building a new paper, and a scoring paper subsystem for scoring the paper of the examinees. In this paper, we also analyze the system architecture, some key questions and the corresponding solutions.
Main-path analysis and path-dependent transitions in HistCite&trade;-based historiograms
Authors: Diana Lucio-Arias, Loet Leydesdorff
Venue: Journal of the American Society for Information Science and Technology (2008)

With the program HistCite&trade; it is possible to generate and visualize the most relevant papers in a set of documents retrieved from the Science Citation Index. Historical reconstructions of scientific developments can be represented chronologically as developments in networks of citation relations extracted from scientific literature. This study aims to go beyond the historical reconstruction of scientific knowledge, enriching the output of HistCite&trade; with algorithms from social-network analysis and information theory. Using main-path analysis, it is possible to highlight the structural backbone in the development of a scientific field. The expected information value of the message can be used to indicate whether change in the distribution (of citations) has occurred to such an extent that a path-dependency is generated. This provides us with a measure of evolutionary change between subsequent documents. The &ldquo;forgetting and rewriting&rdquo; of historically prior events at the research front can thus be indicated. These three methods&mdash;HistCite, main path and path dependent transitions&mdash;are applied to a set of documents related to fullerenes and the fullerene-like structures known as nanotubes. &copy; 2008 Wiley Periodicals, Inc.
Documenting Application-Specific Adaptations in Software Product Line Engineering
Authors: Günter Halmans, Klaus Pohl, Ernst Sikora
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

Software product line engineering distinguishes between two types of development processes: domain engineering and application engineering. In domain engineering software artefacts are developed for reuse. In application engineering domain artefacts are reused to create specific applications.Application engineers often face the problem that individual customer needs cannot be satisfied completely by reusing domain artefacts and thus application-specific adaptations are required. Either the domain artefacts or the application artefacts need to be modified to incorporate the application-specific adaptations. We consider the case that individual customer needs are realised by adapting the application artefacts and propose a technique for maintaining traceability between the adapted application artefacts and the domain artefacts. The traceable documentation of application-specific adaptations is facilitated by an application variability model (AVM) which records the differences between the domain artefacts and the application artefacts of a particular application. The approach is formalised using graph transformations.
The importance of syntactic parsing and inference in semantic role labeling
Authors: Vasin Punyakanok, Dan Roth, Wen-tau Yih
Venue: Computational Linguistics (2008)

We present a general framework for semantic role labeling. The framework combines a machine-learning technique with an integer linear programming-based inference procedure, which incorporates linguistic and structural constraints into a global decision process. Within this framework, we study the role of syntactic parsing information in semantic role labeling. We show that full syntactic parsing information is, by far, most relevant in identifying the argument, especially, in the very first stage---the pruning stage. Surprisingly, the quality of the pruning stage cannot be solely determined based on its recall and precision. Instead, it depends on the characteristics of the output candidates that determine the difficulty of the downstream problems. Motivated by this observation, we propose an effective and simple approach of combining different semantic role labeling systems through joint inference, which significantly improves its performance. Our system has been evaluated in the CoNLL-2005 shared task on semantic role labeling, and achieves the highest F1 score among 19 participants.
Shadow price of capital and the Furubotn&ndash;Pejovich effect: Some empirical evidence for Italian wine cooperatives
Authors: Ornella Wanda Maietta, Vania Sena
Venue: Applied Stochastic Models in Business and Industry (2008)

We test the underinvestment hypothesis (the so-called Furubotn&ndash;Pejovich effect) from the specialized literature on co-ops by comparing the shadow price of capital and the dual capacity utilization index for a panel of Italian cooperative and conventional firms, 1996&ndash;2003. The results do not show any difference between co-ops and conventional firms in this respect. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Extended pi-Calculi
Authors: Magnus Johansson, Joachim Parrow, Björn Victor, Jesper Bengtson
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

We demonstrate a general framework for extending the pi-calculus with data terms. In this we generalise and improve on several related efforts such as the spic calculus and the pi-calculus, also including pattern matching and polyadic channels. Our framework uses a single untyped notion of agent, name and scope, an operational semantics without structural equivalence and a simple definition of bisimilarity. We provide general criteria on the semantic equivalence of data terms; with these we prove algebraic laws and that bisimulation is preserved by the operators in the usual way. The definitions are simple enough that an implementation in an automated proof assistant is feasible.
Constituent parsing by classification
Authors: I. Dan Melamed
Venue:  (2007)

We present an approach to constituent parsing, which is driven by classifiers induced to minimize a single regularized objective. It is the first discriminatively-trained constituent parser to surpass the Collins (2003) parser without using a generative model. Our primary contribution is simplifying the human effort required for feature engineering. Our model can incorporate arbitrary features of the input and parse state. Feature selection and feature construction occur automatically, as part of learning. We define a set of fine-grained atomic features, and let the learner induce informative compound features. Our learning approach includes several novel approximations and optimizations which improve the efficiency of discriminative training. We introduce greedy completion, a new agenda-driven search strategy designed to find low-cost solutions given a limit on search effort. The inference evaluation function was learned accurately enough to guide the deterministic parsers to the optimal parse reasonably quickly without pruning, and thus without search errors. Experiments demonstrate the flexibility of our approach, which has also been applied to machine translation (Wellington et al., 2006; Turian et al., 2007).