ppxscal/embedding_network huggingface dataset:
Semantics for Communicating Actors with Interdependent Real-Time Deadlines
Authors: István Knoll, Anders P. Ravn, Arne Skou
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

Models of embedded systems with communicating actors and deadlines offer abstraction and encapsulation of related functionality, but their behavior is complex. Verification is therefore difficult and requires a combination of simulation, model checking and testing tools. In order to rely on the results, these tools must use consistent semantics for the model. Yet, a monolithic semantic model is just as complex as the entity it describes. In order to circumvent this issue, we define a three level semantics giving independent definitions of the functionality of actors, the temporal properties of communications, and finally imposing deadlines on the timing of dependent actors. With this approach the semantics is used directly in developing a simulator supporting the nondeterminism of the abstract semantics such that e.g. potential race conditions can be detected. The layers are also planned to underpin independent specialized verification tools. The verification task for timed, hybrid systems can thus be divided into the continuous, discrete, and timing domains with automated translation to specialized tools, and this promises better scalability than simulation or model checking of one complex model.
Private Information Retrieval Techniques for Enabling Location Privacy in Location-Based Services
Authors: Ali Khoshgozaran, Cyrus Shahabi
Venue: Privacy in Location-Based Applications: Research Issues and Emerging Trends (2009)

The ubiquity of smartphones and other location-aware hand-held devices has resulted in a dramatic increase in popularity of location-based services (LBS) tailored to user locations. The comfort of LBS comes with a privacy cost. Various distressing privacy violations caused by sharing sensitive location information with potentially malicious services have highlighted the importance of location privacy research aiming to protect user privacy while interacting with LBS.The anonymity and cloaking-based approaches proposed to address this problem cannot provide stringent privacy guarantees without incurring costly computation and communication overhead. Furthermore, they mostly require a trusted intermediate anonymizer to protect a user's location information during query processing. In this chapter, we review a set of fundamental approaches based on private information retrieval to process range and k-nearest neighbor queries, the elemental queries used in many Location Based Services, with significantly stronger privacy guarantees as opposed to cloaking or anonymity approaches.
On graph reasoning
Authors: Renata de Freitas, Paulo A. S. Veloso, Sheila R. M. Veloso, Petrucio Viana
Venue: Information and Computation (2009)

In this paper, we study the (positive) graph relational calculus. The basis for this calculus was introduced by Curtis and Lowe in 1996 and some variants, motivated by their applications to semantics of programs and foundations of mathematics, appear scattered in the literature. No proper treatment of these ideas as a logical system seems to have been presented. Here, we give a formal presentation of the system, with precise formulation of syntax, semantics, and derivation rules. We show that the set of rules is sound and complete for the valid inclusions, and prove a finite model result as well as decidability. We also prove that the graph relational language has the same expressive power as a first-order positive fragment (both languages define the same binary relations), so our calculus may be regarded as a notational variant of the positive existential first-order logic of binary relations. The graph calculus, however, has a playful aspect, with rules easy to grasp and use. This opens a wide range of applications which we illustrate by applying our calculus to the positive relational calculus (whose set of valid inclusions is not finitely axiomatizable), obtaining an algorithm for deciding the valid inclusions and equalities of the latter.
Image De-noising Based on Multi-wavelet
Authors: Wang Xiubi
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

The method of wavelet thresholding for image denoising has been researched extensively due to its effectiveness and simplicity. In order to obtain better denoising, appropriate wavelet function must be choosed. Multi-wavelet is a theories of vector wavelet that developed just in recent years. It has many good characters for example: or-thog-onality - short support more vanishing moments, etc. This means that multi-wavelet can provide a newer means to analyze the signal. Method of image de-noising based on traditional wavelet, lifting wavelet and multi-wavelet was introduced. Results of the experiment indicate, the quality of denoised image based on multi-wavelet is best.
Feature-based pronunciation modeling for speech recognition
Authors: Karen Livescu, James Glass
Venue: Proceedings of HLT-NAACL 2004: Short Papers on XX (2004)

We present an approach to pronunciation modeling in which the evolution of multiple linguistic feature streams is explicitly represented. This differs from phone-based models in that pronunciation variation is viewed as the result of feature asynchrony and changes in feature values, rather than phone substitutions, insertions, and deletions. We have implemented a flexible feature-based pronunciation model using dynamic Bayesian networks. In this paper, we describe our approach and report on a pilot experiment using phonetic transcriptions of utterances from the Switchboard corpus. The experimental results, as well as the model's qualitative behavior, suggest that this is a promising way of accounting for the types of pronunciation variation often seen in spontaneous speech.
Model-based Runtime Verification Framework
Authors: Yuhong Zhao, Franz Rammig
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Model-based runtime verification is an extension to the state-of-the-art runtime verification, aimed at checking at runtime the system implementation against the system model (consistency checking) and the system model against the system specification (safety checking). Notice that our runtime verification works at the model level, thus, we do not need to strictly synchronize this runtime verification with the system execution. In fact, we mainly use the runtime information (current states) obtained from the system execution to reduce the state space (of the system model) to be explored. It means that this model-based runtime verification might run before or after the system execution, i.e., switch alternately between a preventive pre-checking mode and a maintaining post-checking mode. In order to make it run ahead of the system execution for as long time as possible, we present two possible strategies so that this runtime verification can selectively reduce the state space (of the system model) to be explored by making the system model enriched with probabilities and additional information derived and learned at the system testing phase.
Accelerating reinforcement learning by composing solutions of automatically identified subtasks
Authors: Chris Drummond
Venue: Journal of Artificial Intelligence Research (2002)

This paper discusses a system that accelerates reinforcement learning by using transfer from related tasks. Without such transfer, even if two tasks are very similar at some abstract level, an extensive re-learning effort is required. The system achieves much of its power by transferring parts of previously learned solutions rather than a single complete solution. The system exploits strong features in the multi-dimensional function produced by reinforcement learning in solving a particular task. These features are stable and easy to recognize early in the learning process. They generate a partitioning of the state space and thus the function. The partition is represented as a graph. This is used to index and compose functions stored in a case base to form a close approximation to the solution of the new task. Experiments demonstrate that function composition often produces more than an order of magnitude increase in learning rate compared to a basic reinforcement learning algorithm.
General relativistic hypercomputing and foundation of mathematics
Authors: Hajnal Andréka, István Németi, Péter Németi
Venue: Natural Computing: an international journal (2009)

Looking at very recent developments in spacetime theory, we can wonder whether these results exhibit features of hypercomputation that traditionally seemed impossible or absurd. Namely, we describe a physical device in relativistic spacetime which can compute a non-Turing computable task, e.g. which can decide the halting problem of Turing machines or decide whether ZF set theory is consistent (more precisely, can decide the theorems of ZF). Starting from this, we will discuss the impact of recent breakthrough results of relativity theory, black hole physics and cosmology to well established foundational issues of computability theory as well as to logic. We find that the unexpected, revolutionary results in the mentioned branches of science force us to reconsider the status of the physical Church Thesis and to consider it as being seriously challenged. We will outline the consequences of all this for the foundation of mathematics (e.g. to Hilbert's programme). Observational, empirical evidence will be quoted to show that the statements above do not require any assumption of some physical universe outside of our own one: in our specific physical universe there seem to exist regions of spacetime supporting potential non-Turing computations. Additionally, new "engineering" ideas will be outlined for solving the so-called blue-shift problem of GR-computing. Connections with related talks at the Physics and Computation meeting, e.g. those of Jerome Durand-Lose, Mark Hogarth and Martin Ziegler, will be indicated.
Security Analysis for Wireless Networks Based on ZigBee
Authors: Meng Qianqian, Bao Kejin
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

With the development of network and communication technology, people's demands on wireless network are getting higher and higher. Security problem is becoming the focus that wireless networks pay attention to. This article discusses the security structures of ZigBee wireless network, analyzes the security of MAC. NWK and APL layer firstly. Moreover, it analyzes the authentication and encryption in ZigBee technology completely, and proposes opinions for network security protection, solves the confidentiality, integrity and access control problem in network communication.
On algebras admitting a complete set of near weights, evaluation codes, and Goppa codes
Authors: Cícero Carvalho, Ercílio Silva
Venue: Designs, Codes and Cryptography (2009)

In 1998 Høholdt, van Lint and Pellikaan introduced the concept of a "weight function" defined on a $${\mathbb{F}_q}$$ -algebra and used it to construct linear codes, obtaining among them the algebraic geometry (AG) codes supported on one point. Later, in 1999, it was proved by Matsumoto that all codes produced using a weight function are actually AG codes supported on one point. Recently, "near weight functions" (a generalization of weight functions), also defined on a $${\mathbb{F}_q}$$ -algebra, were introduced to study codes supported on two points. In this paper we show that an algebra admits a set of m near weight functions having a compatibility property, namely, the set is a "complete set", if and only if it is the ring of regular functions of an affine geometrically irreducible algebraic curve defined over $${\mathbb{F}_q}$$ whose points at infinity have a total of m rational branches. Then the codes produced using the near weight functions are exactly the AG codes supported on m points. A bound for the minimum distance of these codes is presented with examples which show that in some situations it compares better than the usual Goppa bound.
Randomized algorithms for the loop cutset problem
Authors: Ann Becker, Reuven Bar-Yehuda, Dan Geiger
Venue: Journal of Artificial Intelligence Research (2000)

We show how to find a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the first step in the method of conditioning for inference. Our randomized algorithm for finding a loop cutset outputs a minimum loop cutset after O(c 6kkn) steps with probability at least 1 - (1 - 1/6k)c6k, where c > 1 is a constant specified by the user, k is the minimal size of a minimum weight loop cutset, and n is the number of vertices. We also show empirically that a variant of this algorithm often finds a loop cutset that is closer to the minimum weight loop cutset than the ones found by the best deterministic algorithms known.
An architecture for data-to-text systems
Authors: Ehud Reiter
Venue: Proceedings of the Eleventh European Workshop on Natural Language Generation (2007)

I present an architecture for data-to-text systems, that is NLG systems which produce texts from non-linguistic input data; this essentially extends the architecture of Reiter and Dale (2000) to systems whose input is raw data instead of AI knowledge bases. This architecture is being used in the BabyTalk project, and is based on experiences in several projects at Aberdeen; it also seems to be compatible with many data-to-text systems developed elsewhere. It consists of four stages which are organised in a pipeline: Signal Analysis, Data Interpretation, Document Planning, and Microplanning and Realisation.
Streaming Media Caching on Advanced Relay Nodes
Authors: Yusuke Sugio, Hiroyuki Koga, Masayoshi Shimamura, Takeshi Ikenaga
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

Streaming media delivery services over the Internet have been rapidly spread. Growth of these traffic causes serious problems in terms of quality degradation of service in a near future. Therefore, in this paper, we propose a streaming media caching scheme on advanced relay nodes placed inside networks in order to achieve efficient streaming media delivery. The proposed scheme can alleviate traffic congestion on the networks and overload on the streaming servers. Furthermore, we show a potential and effectiveness of the proposed scheme through simulation evaluations.
Evaluation Proposal of a Framework for the Integration of Multimodal Interaction in 3D Worlds
Authors: Héctor Olmedo-Rodríguez, David Escudero-Mancebo, Valentín Cardeñoso-Payo
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

This paper describes a multimodal architecture to control 3D avatars with speech dialogs and mouse events. We briefly describe the scripting language used to specify the sequences and the components of the architecture supporting the system. Then we focus on the evaluation procedure that is proposed to test the system. The discussion on the evaluation results shows us the future work to be accomplished.
Application of Metamorphic Methodologies on the Synthesizing Write-Back Caches
Authors: Jun-qiao Qi, Hanlong Cui
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Many hackers worldwide would agree that, if it is not for the evaluation of I/O automata, the construction of red-black trees might never have occurred. In order to construction of red-black trees, significant research into scatter/gather I/O was established, which we confirmed the refinement of Boolean logic. Through an ambimorphic tool for visualizing IPv4 (JUG) was described, a novel method for the investigation of B-trees (JUG) was proposed, which we used to verify that superblocks can be made omniscient, Bayesian, and pseudorandom. Lastly, we showed that virtual machines can be made authenticated, collaborative, and distributed.
Stability under Strategy Switching
Authors: Soumya Paul, R. Ramanujam, Sunil Simon
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

We suggest that a process-like notion of strategy is relevant in the context of interactions in systems of self-interested agents. In this view, strategies are not plans formulated by rational agents considering all possible futures and (mutually recursively) taking into account strategies employed by other players. Instead, they are partial; players start with a set of potential strategies and dynamically switch between them. This necessitates some means in the model for players to access each others' strategies, and we suggest a syntax by which players' rationale for such switching may be specified and structurally composed. In such a model one can ask a stability question: given a game arena and a strategy specification, whether players eventually settle down to strategies without further switching. We show that this problem can be algorithmically solved using automata theoretic methods.
Using Call Patterns to Detect Unwanted Communication Callers
Authors: Tetsuya Kusumoto, Eric Y. Chen, Mitsutaka Itoh
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

Unwanted communications such as SPIT (SPam over Internet Telephony) and number harvesting are expected to become serious problems as the use of VoIP (Voice over Internet Protocol) grows. Having call rates that are approaching zero, VoIP is becoming an attractive alternative media for delivering spam. Existing solutions to detect unwanted communications have problems, such as the requirement of modifying the SIP (Session Initiation Protocol) server, significant inconvenience to users, and the possibility of the unwanted communication avoiding detection. We propose a novel detection method using call pattern analysis. We express call patterns with parameters such as user relationships, average call duration, and the rate of unsuccessful calls.The proposed method does not require any SIP server modification and can be deployed in a non-intrusive manner to users. Furthermore, we have made detection avoidance difficult for malicious users. We also describe in detail an evaluation of our proposed method and comparative methods and the favorable results we have obtained in various experiment scenarios.
Dynamic Clustering-Based Estimation of Missing Values in Mixed Type Data
Authors: Vadim V. Ayuyev, Joseph Jupin, Philip W. Harris, Zoran Obradovic
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

The appropriate choice of a method for imputation of missing data becomes especially important when the fraction of missing values is large and the data are of mixed type. The proposed dynamic clustering imputation (DCI) algorithm relies on similarity information from shared neighbors, where mixed type variables are considered together. When evaluated on a public social science dataset of 46,043 mixed type instances with up to 33% missing values, DCI resulted in more than 20% improved imputation accuracy over Multiple Imputation, Predictive Mean Matching, Linear and Multilevel Regression, and Mean Mode Replacement methods. Data imputed by 6 methods were used for prediction tests by NB-Tree, Random Subset Selection and Neural Network-based classification models. In our experiments classification accuracy obtained using DCI-preprocessed data was much better than when relying on alternative imputation methods for data preprocessing.
Distributed weather net: wireless sensor network supported inquiry-based learning
Authors: Ben Chang, Hsue-Yie Wang, Chin-Shueh Chen, Jen-Kai Liang
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

In 2004, a city-wide weather wireless sensor network, Taipei Weather Inquiry-Based Learning Network, composed of sixty school-based weather sensor nodes and a centralized weather archive server was established to facilitate students having weather science inquiry-based learning. The network covers the whole Taipei City, collects the city's weather status, and opens the weather data to the general public. A series of annual weather inquiry-based learning tournaments was held since 2006 to engage the students to use the network's resource. Until now, there have been 171 registered teams which include 447 grade 4-9 students and 220 teachers involved in it. The study of the tournaments data indicated that the usability of the network was satisfied.
An Ultra Low Power Wakeup Receiver for Wireless Sensor Nodes
Authors: Marco Spinola Durante, Stefan Mahlknecht
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

An ultra-low power 2.4 GHz RF Wakeup Receiver is designed for wireless sensor networks nodes. The receiver demodulates On-Off Keying at 100 kbps. A 120 nm CMOS chip includes the analog front-end and consumes only 7.5 mu W from a single 1.5 V supply. The digital signal processing is implemented in an FPGA. The results of measures and simulations are evaluated for the use of this receiver in wireless sensor networks.
Mobile application framework for the next billion mobile users
Authors: Jörg Dörflinger
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

Every day about 1 million people become mobile phone users - 85% of these live in the developing world. The biggest potential of future mobile development will not be in the already saturated 1st economy market but in the market of about one billion potential mobile users in emerging economies. In contrast to the impressive rise of mobile phone usage, the mobile services and applications provided for this new market are far behind expectations. Due to infrastructural (low, erratic and expensive bandwidth, low end devices) and social (illiteracy, novice ICT users) impediments a copy&paste approach of well known application and architecture concepts from the 1st economy will not work. My research goal is the development of a Mobile Application Framework (MAF) containing guidelines, concepts, and best practices to provide novice IT users in rural areas of emerging economies with the most appropriate access to ICT according to the infrastructural and cultural impediments.
Semi-Automated Wrappers Using Rule Trees
Authors: Adrian Iasinschi, Mirel Cosulschi
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

In this paper we describe the concept of a semi-automated wrapper for extracting information from semi-structured pages, usually part of the e-commerce data intensive web sites. The process is based on creating extraction rules in a visual manner, using the DOM tree associated to a XHTML document, helping the user to make the right decisions. The extraction rules defined have a naturaltree structure. Based on the model designed, the wrapper can then be used to navigate through the site and extract the relevant data.
Chinese named entity recognition with cascaded hybrid model
Authors: Xiaofeng Yu
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

We propose a high-performance cascaded hybrid model for Chinese NER. Firstly, we use Boosting, a standard and theoretically well-founded machine learning method to combine a set of weak classifiers together into a base system. Secondly, we introduce various types of heuristic human knowledge into Markov Logic Networks (MLNs), an effective combination of first-order logic and probabilistic graphical models to validate Boosting NER hypotheses. Experimental results show that the cascaded hybrid model significantly outperforms the state-of-the-art Boosting model.