ppxscal/embedding_network huggingface dataset:
Visual Programming with Interaction Nets
Authors: Abubakar Hassan, Ian Mackie, Jorge Sousa Pinto
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

Programming directly with diagrams offers potential advantages such as visual intuitions, identification of errors (debugging), and insight into the dynamics of the algorithm. The purpose of this paper is to put forward one particular graphical formalism, interaction nets, as a candidate for visual programming which has not only all the desired properties that one would expect, but also has other benefits as a language, for instance sharing computation.
Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus
Authors: Robert Constable, Wojciech Moczydłowski
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

We prove constructively that for any propositional formula ¿ in Conjunctive Normal Form, we can either find a satisfying assignment of true and false to its variables, or a refutation of ¿ showing that it is unsatisfiable. This refutation is a resolution proof of ¬¿. From the formalization of our proof in Coq, we extract Robinson's famous resolution algorithm as a Haskell program correct by construction. The account is an example of the genre of highly readable formalized mathematics.
Inference of Uniquely Terminating EML
Authors: S. Kannamma, D. G. Thomas, K. Rangarajan
Venue: Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications (2008)

In [3], we have provided an algorithm to infer a few subclasses of linear languages through labeled extended Petri nets. The family of equal matrix languages [6] meets both the families of context sensitive languages and context-free languages. In this paper, we prove that an equal matrix language is a Petri net language.We construct labeled extended Petri nets to infer uniquely terminating code k-equal matrix languages (utCk-EMLs), a subclass of EMLs. A similar algorithm can be employed to construct a labeled Petri net which generates a uniquely terminating regular language [4]. This algorithm can be modified to infer a given uniquely terminating code regular language [2] through a labeled extended Petri net.
Application of neural networks for seed germination assessment
Authors: Mirolyub Mladenov, Martin Dejanov
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

This paper is focused on some key problems, related to the development of a new technology for seed germination assessment using computer vision. An approach for germinated seed image segmentation based on artificial neural networks is proposed. The possibility to use standard neural networks for seed, germ and roots zones extraction is analyzed. A modified RBFN is developed. The accuracy of realized procedures is evaluated.
Speaker Diarization for Conference Room: The UPC RT07s Evaluation System
Authors: Jordi Luque, Xavier Anguera, Andrey Temko, Javier Hernando
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

In this paper the authors present the UPC speaker diarization system for the NIST Rich Transcription Evaluation (RT07s) [1] conducted on the conference environment. The presented system is based on the ICSI RT06s system, which employs agglomerative clustering with a modified Bayesian Criterion (BIC) measure to decide which pairs of clusters to merge and to determine when to stop merging clusters [2]. This is the first participation of the UPC in the RT Speaker Diarization Evaluation and the purpose of this work has been the consolidation of a baseline system which can be used in the future for further research in the field of diarization. We have introduced, as prior modules before the diarization system, an Speech/Non-Speech detection module based on a Support Vector Machine from UPC and a Wiener Filtering from an implementation of the QIO front-end. In the speech parameterization a Frequency Filtering (FF) of the filter-bank energies is applied instead the classical Discrete Cosine Transform in the Mel-Cepstrum analysis. In addition, it is introduced a small changes in the complexity selection algorithm and a new post-processing technique which process the shortest clusters at the end of each Viterbi segmentation.
Mathematical modeling of incentive policies in p2p systems
Authors: Bridge Q. Zhao, John C.S. Lui, Dah-Ming Chiu
Venue: Proceedings of the 3rd international workshop on Economics of networked systems (2008)

In order to stimulate cooperation among nodes in P2P systems, some form of incentive mechanism is necessary so as to encourage service contribution. Hence, designing and evaluating the stability, robustness and performance of incentive policies is extremely critical. In this paper, we propose a general mathematical framework to evaluate the stability and evolution of a family of shared history based incentive policies. To illustrate the utility of the framework, we present two incentive policies and show why one incentive policy can lead to a total system collapse while the other is stable and operates at the optimal point. One can use this mathematical framework to design and analyze various incentive policies and verify whether they match the design objectives of the underlying P2P systems.
Enhanced automatic artifact detection based on independent component analysis and Renyi's entropy
Authors: Nadia Mammone, Francesco Carlo Morabito
Venue: Neural Networks (2008)

Artifacts are disturbances that may occur during signal acquisition and may affect their processing. The aim of this paper is to propose a technique for automatically detecting artifacts from the electroencephalographic (EEG) recordings. In particular, a technique based on both Independent Component Analysis (ICA) to extract artifactual signals and on Renyi's entropy to automatically detect them is presented. This technique is compared to the widely known approach based on ICA and the joint use of kurtosis and Shannon's entropy. The novel processing technique is shown to detect on average 92.6% of the artifactual signals against the average 68.7% of the previous technique on the studied available database. Moreover, Renyi's entropy is shown to be able to detect muscle and very low frequency activity as well as to discriminate them from other kinds of artifacts. In order to achieve an efficient rejection of the artifacts while minimizing the information loss, future efforts will be devoted to the improvement of blind artifact separation from EEG in order to ensure a very efficient isolation of the artifactual activity from any signals deriving from other brain tasks.
A uniform family of tissue P systems with cell division solving 3-COL in a linear time
Authors: Daniel Díaz-Pernil, Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustín Riscos-Núñez
Venue: Theoretical Computer Science (2008)

Several examples of the efficiency of cell-like P systems regarding the solution of NP-complete problems in polynomial time can be found in the literature(obviously, trading space for time). Recently, different new models of tissue-like P systems have received much attention from the scientific community. In this paper we present a linear-time solution to an NP-complete problem from graph theory, the 3-coloring problem, and we discuss the suitability of tissue-like P systems as a framework to address the efficient solution to intractable problems.
Improving the performance of an incremental algorithm driven by error margins
Authors: José del Campo-Ávila, Gonzalo Ramos-Jiménez, João Gama, Rafael Morales-Bueno
Venue: Intelligent Data Analysis (2008)

Classification is a quite relevant task within data analysis field. This task is not a trivial task and different difficulties can arise depending on the nature of the problem. All these difficulties can become worse when the datasets are too large or when new information can arrive at any time. Incremental learning is an approach that can be used to deal with the classification task in these cases. It must alleviate, or solve, the problem of limited time and memory resources. One emergent approach uses concentration bounds to ensure that decisions are made when enough information supports them. IADEM is one of the most recent algorithms that use this approach. The aim of this paper is to improve the performance of this algorithm in different ways: simplifying the complexity of the induced models, adding the ability to deal with continuous data, improving the detection of noise, selecting new criteria for evolutionating the model, including the use of more powerful prediction techniques, etc. Besides these new properties, the new system, IADEM-2, preserves the ability to obtain a performance similar to standard learning algorithms independently of the datasets size and it can incorporate new information as the basic algorithm does: using short time per example.
The Algebra of Connectors—Structuring Interaction in BIP
Authors: Simon Bliudze, Joseph Sifakis
Venue: IEEE Transactions on Computers (2008)

We provide an algebraic formalization of connectors in the BIP component framework. A connector relates a set of typed ports. Types are used to describe different modes of synchronization: rendezvous and broadcast, in particular. Connectors on a set of ports P are modeled as terms of the algebra AC(P), generated from P by using a binary fusion operator and a unary typing operator. Typing associates with terms (ports or connectors) synchronization types --- trigger or synchron --- that determine modes of synchronization. Broadcast interactions are initiated by triggers. Rendezvous is a maximal interaction of a connector including only synchrons. The semantics of AC(P) associates with a connector the set of its interactions. It induces on connectors an equivalence relation which is not a congruence as it is not stable for fusion. We provide a number of properties of AC(P) used to symbolically simplify and handle connectors. We provide examples illustrating applications of AC(P), including a general component model encompassing synchrony, methods for incremental model decomposition, and efficient implementation by using symbolic techniques.
Semantic matchmaking of web services using model checking
Authors: Akin Günay, Pinar Yolum
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

Service matchmaking is the process of finding suitable services given by the providers for the service requests of consumers. Previous approaches to service matchmaking is mostly based on matching the input-output parameters of service requests and service provisions. However, such approaches do not capture the semantics of the services and hence cannot match requests to services effectively. This paper proposes an agent-based approach for matchmaking that is based on capturing the semantics of services and requests formally through temporal logic. Requests are represented as a set of properties and compared to the service representations using model checking, yielding results on whether a service can satisfy a request or not. By help of domain ontologies, our approach also supports flexible matching, where partially matching services are identified. We provide a general framework, where our approach can work with other existing matchmaking approaches and is integrated with current efforts such as OWL-S and SWRL.
Extended OCBP Scheme for MIPv6 over IEEE 802.16e Networks
Authors: Hyun Seung Park, Seunghwan Yun, Bum Han Kim, Dong Chun Lee, Okyeon Yi, Sangjin Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Many researches about Binding between Mobile IPv6 techniques and Wireless MAC are ongoing. But, Studies related to security hardly ever are conducted. In paper last time, we proposed Optimized Cryptographic Binding Protocol (OCBP)[2]. OCBP that bind between IEEE 802.16e Security Protocol (PKMv2 EAP method) [1] and MIPv6 AAA bootstrapping authentication procedure [15][17] supports more efficient authentication/Key distribution than non-binding case. We propose on "Extended OCBP scheme" for becoming higher than basic OCBP security level.
A Method for Automatically Generating Business Graphs
Authors: Takao Shimomura
Venue: IEEE Computer Graphics and Applications (1983)

This system takes advantage of menu frames and interactive editing to produce graphic representations of data quickly and easily.
A Biologically Inspired Spiking Neural Network for Sound Localisation by the Inferior Colliculus
Authors: Jindong Liu, Harry Erwin, Stefan Wermter, Mahmoud Elsaid
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

We introduce a biologically inspired azimuthal sound localisation system, which simulates the functional organisation of the human auditory midbrain up to the inferior colliculus (IC). Supported by recent neurophysiological studies on the role of the IC and superior olivary complex (SOC) in sound processing, our system models two ascending pathways of the auditory midbrain: the ITD (Interaural Time Difference) pathway and ILD (Interaural Level Difference) pathway. In our approach to modelling the ITD pathway, we take into account Yin's finding that only a single delay line exists in the ITD processing from cochlea to SOC for the ipsilateral ear while multiple delay lines exists for the contralateral ear. The ILD pathway is modelled without varied delay lines because of neurophysiological evidence that indicates the delays along that pathway are minimal and constant. Level-locking auditory neurons are introduced for the ILD pathway network to encode sound amplitude into spike sequence, that are similar to the phase-locking auditory neurons which encode time information to the ITD pathway. A leaky integrate-and-fire spiking neural model is adapted to simulate the neurons in the SOC that process ITD and ILD. Experimental results show that our model performs sound localisation that approaches biological performance. Our approach brings not only new insight into the brain mechanism of the auditory system, but also demonstrates a practical application of sound localisation for mobile robots.
Mixed Bregman Clustering with Approximation Guarantees
Authors: Richard Nock, Panu Luosto, Jyrki Kivinen
Venue: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II (2008)

Two recent breakthroughs have dramatically improved the scope and performance of k-means clustering: squared Euclidean seeding for the initialization step, and Bregman clustering for the iterative step. In this paper, we first unite the two frameworks by generalizing the former improvement to Bregman seeding -- a biased randomized seeding technique using Bregman divergences -- while generalizing its important theoretical approximation guarantees as well. We end up with a complete Bregman hard clustering algorithm integrating the distortion at hand in both the initialization and iterative steps. Our second contribution is to further generalize this algorithm to handle mixed Bregman distortions, which smooth out the asymetricity of Bregman divergences. In contrast to some other symmetrization approaches, our approach keeps the algorithm simple and allows us to generalize theoretical guarantees from regular Bregman clustering. Preliminary experiments show that using the proposed seeding with a suitable Bregman divergence can help us discover the underlying structure of the data.
A pioneer compression technique for database
Authors: Sarita S. Bhadoria, Sushil Kumar, Piyush Kumar Shukla
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

The advent of information technology has affected all walks of life. And when we talk the use of information technology in a business environment, we cannot ignore the presence of a data base system as its core. Data base technology has also grown from a simple file system to data navigation system, & over a last two decade a majority of top-&-middle level business institutions have adopted the computerization process, & as a result have been flooded with data. Temporal database [1] (a database that require some aspect of time when organizing their information) often increases with the time like information from reservation counters (flight, railways, buses, hotels), Bank ATMs, shares price from stock market, insurance policies. So with the limited resource how to manage and store this data, the only possible solution we can have is to just compress & store it with in the available resource. The traditional approach of compression [2] make use of entropy encoding (compress without any regard to it's content), whereas we can take advantage of its structure (source encoding) for compression as we do in audio or image compression. This paper presents an attempt to apply this category of compression method for a database file.
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
Authors: Minghui Jiang
Venue: Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management (2007)

We study three closely related problems motivated by the prediction of RNA secondary structures with arbitrary pseudoknots: the Maximum Base Pair Stackings problem proposed by Ieong et al. [19] , the Maximum Stacking Base Pairs problem proposed by Lyngsø [22], and the 2-Interval Pattern problem proposed by Vialette [36] . For Maximum Base Pair Stackings and Maximum Stacking Base Pairs, we present improved approximation algorithms that can incorporate covariance information from comparative analysis as explicit input of candidate base pairs. For 2-Interval Pattern, we present improved approximation algorithms on unitary and near-unitary input, and propose a new variant called Length-Weighted Balanced 2-Interval Pattern, which is natural in the nearest-neighbor energy model that emphasizes base pair stacking.
A Memetic Algorithm for the Delineation of Local Labour Markets
Authors: Francisco Flórez-Revuelta, José Manuel Casado-Díaz, Lucas Martínez-Bernabeu, Raúl Gómez-Hernández
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Given a territory composed of basic geographical units, the delineation of local labour market areas (LLMAs) can be seen as a problem in which those units are grouped subject to multiple constraints. In previous research, standard genetic algorithms were not able to find valid solutions, and a specific evolutionary algorithm was developed. The inclusion of multiple ad hoc operators allowed the algorithm to find better solutions than those of a widely-used greedy method. However, the percentage of invalid solutions was still very high. In this paper we improve that evolutionary algorithm through the inclusion of (i) a reparation process, that allows every invalid individual to fulfil the constraints and contribute to the evolution, and (ii) a hillclimbing optimisation procedure for each generated individual by means of an appropriate reassignment of some of its constituent units. We compare the results of both techniques against the previous results and a greedy method.
Design and implementation of a vehicle interface protocol using an IEEE 1394 network
Authors: Kenya Sato, Takahiro Koita, Scott McCormick
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

A wide variety of in-vehicle devices such as camera sensors, navigation systems, telematics and communication equipments have been incorporated into a vehicle to realize Intelligent Transport Systems (ITS) applications. Because an efficient standardized network is required, ITS Data Bus (IDB) has been discussed to carry high-speed multimedia data for audio, video and other real-time ITS applications. For connecting devices in a standardized manner, the IDB network has architecture with a gateway called vehicle interface which is located between automaker's proprietary network and the standardized IDB network. IEEE 1394 (also known as iLink or FireWire), which can transport multimedia data for consumer electronics, is a good candidate for IDB network. In this paper, we analyze the issues for existing AV/C protocol (application layer protocol over IEEE 1394) to comprise the IDB network. In addition, we designed and implemented the vehicle interface protocol as a higher layer of IEEE 1394 to address the AV/C protocol issues for realizing the whole IDB network architecture.
Project-Based Artificial Neural Networks Development Software and Applications
Authors: Xiaofeng Lin, Shaojian Song, Chunning Song, Qingbao Huang, Xiao Xiao Song
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

We have designed a kind of practical artificial neural network development software for ordinary engineering technicians. This software, with graphic interface, not only supports multiple types and algorithms of artificial neural networks, but also supports the IEC 61131-3 International Standard. This article, through three application examples of artificial neural networks, shows the feasibility and the easy implementation of this development software, as well as the realization of artificial neural networks in IEC 61131-3 Standard-based software. It also shows the application value of artificial neural networks development tool and the realistic significance of applying artificial neural networks control in the projects.
Annotation of Colorectal Cancer Data Using the UMLS Metathesaurus
Authors: Marcos Martínez, José M. Vázquez, Javier Pereira, Alejandro Pazos
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Reusing the data collected during an epidemiological study is a complex task. This is mainly due to the frequent utilization of traditional storage supports, as well as specific formats and/or terminologies which can make it difficult to integrate the gathered data with data from other information resources. Using terms from the UMLS Metathesaurus, we have annotated the data collected during the development of an epidemiological study of colorectal cancer funded by the US National Cancer Institute (NCI), which was carried out in Galicia, Spain. In our opinion, this annotation can facilitate integration of these data with data from other studies, allowing the future development of larger studies in a faster and more economical manner.
Using UML 2.1 to Model Multi-agent Systems
Authors: Darshan S. Dillon, Tharam S. Dillon, Elizabeth Chang
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

The use of UML 2.1 to model a broad range of systems is evident from the variety of UML diagrams in academia and in the marketplace. One class of systems currently gaining popularity are Multi-Agent Systems. There are efforts underway to use UML to model these systems and these efforts are both productive and form the basis for both a methodology and a notation for systems of this type.