ppxscal/embedding_network huggingface dataset:
Algorithms for Computing Weak Bisimulation Equivalence
Authors: Weisong Li
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

Weak bisimulation equivalence is an important relation informal verification. There is only one specific algorithm for computing weak simulation equivalence on unlabeled Kripke structure. We exploit two ways to improve the algorithm for this problem. First, the transitional relation graph is reduced to its s.c.c component graph. Second, Hopcroft’s idea of “process the smaller half” is incorporated to further improve time complexity. These two methods avoid the computation of transitive reflexive closure of the original transitional relation and achieve better time complexity inmost practical cases of model checking. 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
Spotting subsequences matching a HMM using the average observation probability criteria with application to keyword spotting
Authors: Marius Calin Silaghi
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

This paper addresses the problem of detecting keywords in unconstrained speech. The proposed algorithms search for the speech segment maximizing the average observation probability along the most likely path in the hypothesized keyword model. As known, this approach (sometimes referred to as sliding model method) requires a relaxation of the begin/endpoints of the Viterbi matching, as well as a time normalization of the resulting score. This makes solutions complex (i.e., LN2/2 basic operations for keyword HMM models with L states and utterances with N frames). We present here two altemative (quite simple and efficient) solutions to this problem. a) First we provide a method that finds the optimal segmentation according to the criteria of maximizing the average observation probability. It uses Dynamic Programming as a step, but does not require scoring for all possible begin/endpoints. While the worst case remains O(LN2), this technique converged in at most 3(L+2)N basic operations in each experiment for two very different applications. b) The second proposed algorithm does not provide a segmentation but can be used for the decision problem of whether the utterance should be classified as containing the keyword or not (provided a predefined threshold on the acceptable average observation probability). This allows the algorithm to be even faster, with fix cost of (L+2)N.
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
Authors: Rahul Jain, Hartmut Klauck
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

Consider the following {\em Simultaneous Message Passing} ($\smp$) model for computing a relation $f \subseteq \cX \times \cY \times \cZ$. In this model $\alice$, on input $x \in \cX$ and $\bob$, on input $y\in\cY$, send one message each to a third party $\referee$ who then outputs a $z \in \cZ$ such that $(x,y,z)\in f$. We first show optimal {\em Direct sum} results for all relations $f$ in this model, both in the quantum and classical settings, in the situation where we allow shared resources (shared entanglement in quantum protocols and public coins in classical protocols) between $\alice$ and $\referee$ and $\bob$ and $\referee$ and no shared resource between $\alice$ and $\bob$. This implies that, in this model, the communication required to compute $k$ simultaneous instances of $f$, with constant success overall, is at least $k$-times the communication required to compute one instance with constant success. This in particular implies an earlier Direct sum result, shown by Chakrabarti, Shi, Wirth and Yao~\cite{ChakrabartiSWY01} for the Equality function (and a class of other so-called robust functions), in the classical $\smp$ model with no shared resources between any parties. Furthermore we investigate the gap between the $\smp$ model and the one-way model in communication complexity and exhibit a partial function that is exponentially more expensive in the former if quantum communication with entanglement is allowed, compared to the latter even in the deterministic case.
A multiresolution analysis for tensor-product splines using weighted spline wavelets
Authors: Mario Kapl, Bert Jüttler
Venue: Journal of Computational and Applied Mathematics (2009)

We construct biorthogonal spline wavelets for periodic splines which extend the notion of ''lazy'' wavelets for linear functions (where the wavelets are simply a subset of the scaling functions) to splines of higher degree. We then use the lifting scheme in order to improve the approximation properties with respect to a norm induced by a weighted inner product with a piecewise constant weight function. Using the lifted wavelets we define a multiresolution analysis of tensor-product spline functions and apply it to image compression of black-and-white images. By performing-as a model problem-image compression with black-and-white images, we demonstrate that the use of a weight function allows to adapt the norm to the specific problem.
A Novel Method of Chinese Web Information Extraction and Applications
Authors: Zhong Liu, Ying Wang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

One promising application of natural language processing (NLP) research is in the area of information extraction (IE). In this paper, we present work flow of our IE system for the extraction of semantically rich information from the unstructured or semi-structured Chinese web pages. Knowledge engineering approach and automatic training approach are used to extract pattern and built knowledge repository. General IE system needs to label the unlabeled training web pages. A novel methodology that does not need to label text is developed, including hierarchy filtration pattern matching based on syntax in best distance method and maximum forward boundary recognition using organization suffix repository and part of speech tagging method. As for applications of IE, a new application system based on IE is built. It is object-level vertical search system and object here is Chinese people, so IE is concerned with extracting people’s related attributes from a collection of web pages about Chinese people. The results are displayed as hierarchy directory tree according to people’s attributes. The system makes user find people quickly and easily.
MPI Applications on Grids: A Topology Aware Approach
Authors: Camille Coti, Thomas Herault, Franck Cappello
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Porting on grids complex MPI applications involving collective communications requires significant program modification, usually dedicated to a single grid structure. The difficulty comes from the mismatch between programs organizations and grid structures: 1) large grids are hierarchical structures aggregating parallel machines through an interconnection network, decided at runtime and 2) the MPI standard does not currently provide any specific information for topology-aware applications, so almost all MPI applications have been developed following a non-hierarchical and non-flexible vision. In this paper, we propose a generic programming method and a modification of the MPI runtime environment to make MPI applications topology aware. In contrary to previous approaches, topology requirements for the application are given to the grid scheduling system, which exposes the compatible allocated topology to the application.
Multiple Object Types KNN Search Using Network Voronoi Diagram
Authors: Geng Zhao, Kefeng Xuan, David Taniar, Maytham Safar, Marina Gavrilova, Bala Srinivasan
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

Existing work on k nearest neighbor (kNN) in spatial/mobile query processing focuses on single object types. Furthermore, they do not consider optimum path in KNN. In this paper, we focus on multiple type kNN whereby the interest points are of multiple types. Additionally, we also consider an optimum path to reach the interest points. We propose three different query types involving multiple object types. Our algorithms adopt the network Voronoi Diagram (NVD). We describe two ways to solve multiple types of KNN queries: one is to create NVD for each object type, and two is to create one NVD for all objects. The comparison between these two approaches is presented in performance evaluation section.
Distributed resource management and matching in sensor networks
Authors: Jie Gao, Leonidas Guibas, Nikola Milosavljevic, Dengpan Zhou
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over time, events (fires, crime reports, cars looking for parking) arise one-by-one at arbitrary nodes, and need to be quickly matched to and serviced by an appropriate nearby resource, without knowledge of future requests, and without the ability to alter any decision once it has been made. We develop distributed algorithms to direct available resources in the network to these events (or vice versa) in a coordinated fashion, so that no two resources are assigned to the same event, and the total distance of the events from their matched resources is minimized. The key idea is to extract, in a preprocessing stage, a well-separated tree metric that approximates the original network metric by a logarithmic distortion, allowing greedy matching algorithms to generate close to optimal matchings, and enabling communication-efficient probing-based algorithms for events to detect nearby available resources. The distributed matching algorithm requires no global coordination and achieves polylogarithmic performance ratio in both online and offline settings. Simulation experiments corroborate the theoretical results on solution quality and further evaluate the communication costs of our scheme in practice.
Updatable Security Views
Authors: J. Nathan Foster, Benjamin C. Pierce, Steve Zdancewic
Venue: Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium (2009)

Security views are a flexible and effective mechanism for controlling access to confidential information.Rather than allowing untrusted users to access source data directly, they are instead provided with are restricted view, from which all confidential information has been removed.The program that generates the view effectively embodies a confidentiality policy for the underlying source data. However, this approach has a significant drawback: it prevents users from updating the data in the view.To address the "view update problem" in general, a number of bidirectional languages have been proposed. Programs in these languages---often called lenses---can be run in two directions: read from left to right, they map sources to views; from right to left,they map updated views back to updated sources. However, existing bidirectional languages do not deal adequately with security.In particular, they do not provide a way to ensure the integrity of source data as it is manipulated by untrusted users of the view.We propose a novel framework of secure lenses that addresses these shortcomings. We enrich the types of basic lenses with equivalence relations capturing notions of confidentiality and integrity, and formulate the essential security conditions as non-interference properties. We then instantiate this framework in the domain of string transformations, developing syntax for bidirectional string combinators with security-annotated regular expressions as their types.
Effective REST Services via .NET: For .NET Framework 3.5, 1st edition
Authors: Kenn Scribner, Scott Seely
Venue:  (2009)

Build Web Services Better and Faster with RESTful Techniques and .NET Technologies Developers are rapidly discovering the power of REST to simplify the development of even the most sophisticated Web servicesand todays .NET platform is packed with tools for effective REST development. Now, for the first time, theres a complete, practical guide to building REST-based services with .NET development technologies. Long-time .NET and Web services developers and authors Kenn Scribner and Scott Seely explain why REST fits so smoothly into the Internet ecosystem, why RESTful services are so much easier to build, what it means to be RESTful, and how to identify behaviors that are not RESTful. Next, they review the core Internet standards and .NET technologies used to develop RESTful solutions and show exactly how to apply them on both the client and server side. Using detailed code examples, Scribner and Seely begin with simple ASP.NET techniques, and then introduce increasingly powerful optionsincluding Windows Communication Foundation (WCF) and Microsofts cloud computing initiative, Azure. Coverage includes Accessing RESTful services from desktop applications, using Windows Forms and WPF Supporting Web client operations using Silverlight 2.0, JavaScript, and other technologies Understanding how IIS 7.0 processes HTTP requests and using that knowledge to build better REST services Constructing REST services based on traditional ASP.NET constructs Utilizing the ASP.NET MVC Framework to implement RESTful services more effectively Taking advantage of WCF 3.5s powerful REST-specific capabilities Creating RESTful data views effortlessly with ADO.NET Data Services Leveraging Microsofts Azure cloud-computing platform to build innovative new services Choosing the right .NET technology for each REST application or service
The theater-system technique: agile designing and testing of system behavior and interaction, applied to highly automated vehicles
Authors: Anna Schieben, Matthias Heesen, Julian Schindler, Johann Kelsch, Frank Flemisch
Venue: Proceedings of the 1st International Conference on Automotive User Interfaces and Interactive Vehicular Applications (2009)

In this paper, the theater-system technique, a method for agile designing and testing of system behavior and interaction concepts is described. The technique is based on the Wizard-of-Oz approach, originally used for emulating automated speech recognition, and is extended towards an interactive, user-centered design technique. The paper describes the design process using the theater-system technique, the technical build-up of the theater-system, and an application of the technique: the design of a haptic-multimodal interaction strategy for highly automated vehicles. The use of the theater-system in the design process is manifold: It is used for the concrete design work of the design team, for the assessment of user expectations as well as for early usability assessments, extending the principles of user-centered design towards a dynamically balanced design.
PrivateFlow: decentralised information flow control in event based middleware
Authors: I. Papagiannis, M. Migliavacca, P. Pietzuch, B. Shand, D. Eyers, J. Bacon
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

Complex middleware frameworks are made out of interacting components which may include bugs. These frameworks are often extended to provide additional features by third-party extensions that may not be completely trusted and, as a result, compromise the security of the whole platform. Aiming to minimize these problems, we propose a demonstration of PrivateFlow, a publish/subscribe prototype supported by Decentralized Information Flow Control (DIFC). DIFC is a taint-tracking mechanism that can prevent components from leaking information. We will showcase a simple deployment of PrivateFlow that incorporates third-party untrusted components. In our demonstration, one of these components will try to leak sensitive information about the system's operation and it will fail once DIFC is activated.
On the Automated Correction of Protocols with Improper Message Encoding
Authors: Dieter Hutter, Raúl Monroy
Venue: Foundations and Applications of Security Analysis: Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, ARSPA-WITS 2009, York, UK, March 28-29, 2009, Revised Selected Papers (2009)

Security protocols are crucial to achieve trusted computing. However, designing security protocols is not easy and so security protocols are typically faulty and have to be repaired. Continuing previous work we present first steps to automate this repairing process, especially for protocols that are susceptible to type-flaw attacks. To this end, we extend the notion of strand spaces by introducing an implementation layer for messages and extending the capabilities of a penetrator to swap messages that share the same implementation. Based on this framework we are able to track type flaw attacks to incompatibilities between the way messages are implemented and the design of concrete security protocols. Heuristics are given to either change the implementation or the protocol to avoid these situations.
Character-level dependencies in Chinese: usefulness and learning
Authors: Hai Zhao
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

We investigate the possibility of exploiting character-based dependency for Chinese information processing. As Chinese text is made up of character sequences rather than word sequences, word in Chinese is not so natural a concept as in English, nor is word easy to be defined without argument for such a language. Therefore we propose a character-level dependency scheme to represent primary linguistic relationships within a Chinese sentence. The usefulness of character dependencies are verified through two specialized dependency parsing tasks. The first is to handle trivial character dependencies that are equally transformed from traditional word boundaries. The second furthermore considers the case that annotated internal character dependencies inside a word are involved. Both of these results from character-level dependency parsing are positive. This study provides an alternative way to formularize basic character-and word-level representation for Chinese.
A Certain Complexity Threshold during Growth of Functioning Networks
Authors: Andrzej Gecow
Venue: Proceedings of the 2008 First International Conference on Complexity and Intelligence of the Artificial and Natural Complex Systems. Medical Applications of the Complex Systems. Biomedical Computing (2008)

Certain threshold on network size axis was observed in statistical mechanisms of adaptive evolution. Now it is investigated. This threshold is connected with maturation of chaos and lies far above the critical point of percolation. It can be treated as complexity threshold defining the term ‘complex network' for Kauffman chaotic networks. Distributions of damage size are obtained using simulation for a representative set of network parameters and network types (including scale-free, RBN and networks with more than two signal variants) for network sizes up to 4000 nodes. Based on them a criterion of the threshold is sought. We do not find any critical point in the investigated area, however a certain practical criterion is proposed. It is zero occurrence in-between two peaks of damage size frequency - left of real fadeout of damage which is ordered behaviour and right of equilibrium level after damage avalanche which is chaotic behaviour.
Elicitator: An expert elicitation tool for regression in ecology
Authors: Allan James, Samantha Low Choy, Kerrie Mengersen
Venue: Environmental Modelling Software (2010)

Expert elicitation is the process of retrieving and quantifying expert knowledge in a particular domain. Such information is of particular value when the empirical data is expensive, limited or unreliable. This paper describes a new software tool, called Elicitator, which assists in quantifying expert knowledge in a form suitable for use as a prior model in Bayesian regression. Potential environmental domains for applying this elicitation tool include habitat modelling, assessing detectability or eradication, ecological condition assessments, risk analysis and quantifying inputs to complex models of ecological processes. The tool has been developed to be user-friendly, extensible and facilitate consistent and repeatable elicitation of expert knowledge across these various domains. We demonstrate its application to elicitation for logistic regression in a geographically based ecological context. The underlying statistical methodology is also novel, utilizing an indirect elicitation approach to target expert knowledge on a case-by-case basis. For several elicitation sites (or cases), experts are asked simply to quantify their estimated ecological response (e.g. probability of presence), and its range of plausible values, after inspecting (habitat) covariates via GIS.