ppxscal/embedding_network huggingface dataset:
Variants and Homographs
Authors: Jaroslava Hlaváčová, Markéta Lopatková
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

We discuss two types of asymmetry between wordforms and their(morphological) characteristics, namely (morphological) variants and homographs. We introduce a concept of multiple lemma that allows for unique identification of wordform variants as well as `morphologically-based' identification of homographic lexemes. The deeper insight into these concepts allows further refining of morphological dictionaries and subsequently better performance of any NLP tasks. We demonstrate our approach on the morphological dictionary of Czech.
On the Kronecker Product Construction of Completely Transitive q-Ary Codes
Authors: Josep Rifà, Victor Zinoviev
Venue: Proceedings of the 2nd international Castle meeting on Coding Theory and Applications (2008)

For any integer ρ ¿ 1 and for any prime power q, the explicit construction of an infinite family of completely transitive (and completely regular) q-ary codes with minimum distance d = 3 and with covering radius ρ is given.
Artifact Processor for Neuronal Activity Analysis during Deep Brain Stimulation
Authors: Dimitri V. Nowicki, Brigitte Piallat, Alim-Louis Benabid, Tatiana I. Aksenova
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

The present paper is devoted to the suppression of spurious signals (artifacts) in records of neural activity during deep brain stimulation. An algorithm of adaptive filtering based on the signals synchronization in phase space is presented. The algorithm was implemented and tested using synthetic data and recordings collected from patients during the stimulation.
Early Prototyping of Wireless Sensor Network Algorithms in PVS
Authors: Cinzia Bernardeschi, Paolo Masci, Holger Pfeifer
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

We describe an approach of using the evaluation mechanism of the specification and verification system PVS to support formal design exploration of WSN algorithms at the early stages of their development. The specification of the algorithm is expressed with an extensible set of programming primitives, and properties of interest are evaluated with ad hoc network simulators automatically generated from the formal specification. In particular, we build on the PVSio package as the core base for the network simulator. According to requirements, properties of interest can be simulated at different levels of abstraction. We illustrate our approach by specifying and simulating a standard routing algorithm for wireless sensor networks.
A System for Multimodal Exploration of Social Spaces
Authors: Victor V. Kryssanov, Shizuka Kumokawa, Igor Goncharenko, Hitoshi Ogawa
Venue: Proceedings of the 3rd international workshop on Haptic and Audio Interaction Design (2008)

This paper describes a system developed to help people explore local communities by providing navigation services in social spaces created by members of the communities. Just as a community's social space is formed by communication and knowledge-sharing practices, the proposed system utilizes data of the corresponding social network to reconstruct the social space, which is otherwise not physically perceptible but imaginary and yet experiential and learnable. The social space is modeled with an agent network, where each agent stands for a member of the community and has knowledge about expertise and personal characteristics of other members. An agent can gather information, using its social "connections," to find community members most suitable to communicate to in a specific situation defined by the system's user. The system then deploys its multimodal interface, which operates with 3D graphics and haptic virtual environments and "maps" the social space onto a representation of the relevant physical space, to advise the user on an efficient communication strategy for the given community. A prototype of the system is built and used in a pilot study. The study results are briefly discussed, conclusions are drawn, and implications for future work are formulated.
Energy-efficient channel access and routing protocols for multi-hop wireless networks
Authors: Bulent Yener
Venue:  (2007)

Recent research efforts on multi-hop wireless networks are motivated and driven by two important phenomena: an ever increasing demand for ubiquitous access to online information and services, and a strong desire and need to capture and analyze data from physical phenomena surrounding us in our daily lives. The first of the two constitutes an inspiration for wireless mesh networks, as the latter does for wireless sensor networks.In this thesis, we address the energy-efficient media access control (MAC) and routing issues on multi-hop wireless networks. Our major contributions are threefold. First, we propose a set of contention-free MAC protocols that do not rely on global time synchronization and that are possessed of the desired characteristics of a multi-hop wireless network protocol; i.e. they are energy-saving, distributed, and self-stabilizing. Our protocols attest that distributed and asynchronous slot assignment with reasonable frame sizes and throughput is possible in multi-hop wireless networks. Second, we present the first routing protocols that&mdash;to the best of our knowledge&mdash;improve the QoS level of Spatial TDMA (STDMA) MAC protocols by effectively decreasing the end-to-end delay in wireless sensor and mesh networks. In large multi-hop wireless networks, where data is routed over several hops, the end-to-end latency may be significantly large, especially when a reservation-based channel access protocol is used. We show that by exploiting the relative timing of nodes' slots in the underlying STDMA protocol, significant performance gain is possible compared to the shortest-hop based conventional routing approaches.Third, we propose a general framework for a new hybrid media access scheme based on the idea of spatially limiting the contention in multi-hop wireless networks. The channel assignment component of the hybrid access scheme employs a novel approach for carefully selecting the set of contending nodes such that the hidden terminals are completely eliminated. Hence, in the contention-based component of the hybrid access scheme, only the spatially close (neighbor) nodes contend for the channel as if in a single-hop network, which can be handled much more efficiently by a carrier-sense multiple access (CSMA) scheme. In order to assess the performance of the proposed scheme under different network conditions, we provide and utilize a general framework for the formal analysis of CSMA and CSMA/CA (collision avoidance) schemes for multi-hop wireless networks, which can capture under-saturation traffic loads unlike prior work.
Computational challenges in e-commerce
Authors: Joan Feigenbaum, David C. Parkes, David M. Pennock
Venue: Communications of the ACM (2009)

Economic and social sciences will drive Internet protocols and services into the future.
Commitment-Based Multiagent Decision Making
Authors: Viji R. Avali, Michael N. Huhns
Venue: Proceedings of the 12th international workshop on Cooperative Information Agents XII (2008)

In a cooperative system, multiple dynamic agents work together and share resources to achieve common goals, while simultaneously pursuing their individual goals. Interactions among the agents in such a cooperative system are critical to its successful behavior, and we believe that commitments are the proper abstraction to characterize the interactions. Commitments then become the basis for monitoring and controlling the system and tracking the progress towards its goals.Commitments are binary relationships that bind two agents: a "debtor agent" that promises to provide a particular service for a "creditor agent". Their role is to represent agreements between the agents and prevent potential conflicts while the agents collaborate to achieve the system's common goals, which are imposed from outside. But the willingness to participate in achieving the goals comes from within the agent and that is why the beliefs, desires, and intentions of the agents are crucial in formalizing commitments. In this paper, we have formalized commitments in terms of the agents' internal states of mind--their beliefs, desires, and intentions. This formalization addresses what it means for a participating agent to promise or to satisfy a commitment. The formalization uses a branching-time computational tree logic framework with commitment definitions and operations to define a commitment-centric cooperative multiagent environment.
Reuse: From Components to Services
Authors: Alberto Sillitti, Giancarlo Succi
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

In these years, a programming paradigm shift is in progress: researchers and developers are moving from component-based to service-based development. This shift is deeply affecting the technology, changing the way of addressing old problems and producing new standards and methodologies to address the new ones. However, even with this shift, some old problems are arising again and their complexity is increasing. One of such problems is the identification of a set of components/services that can be integrated to build a system. This paper proposes an adaptation of a methodology for ranking and selecting components to a service-based environment.
Erratum: Erratum to: Reasoning with infinite stable models [Artificial Intelligence 156 (1) (2004) 75--111]
Authors: Piero A. Bonatti
Venue: Artificial Intelligence (2008)

Theorem 16 in [Piero A. Bonatti, Reasoning with infinite stable models, Artificial Intelligence 156 (1) (2004) 75-111] states that ground skeptical and credulous inferences under the stable model semantics are decidable when the given normal logic program is finitary. Giovanni Criscuolo and Nicola Leone independently observed in personal communications that the proof of this theorem relies on an unproved assumption that-at the best of our current knowledge-might turn out to be false. In this note we correct Theorem 16 by adding the set of odd-cyclic atoms to the inputs of the computation, and argue that this change has no impact on the current applications of the theory of finitary programs.
An Optimization-Based Classification Approach with the Non-additive Measure
Authors: Nian Yan, Zhengxin Chen, Rong Liu, Yong Shi
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

Optimization-based classification approaches have well been used for decision making problems, such as classification in data mining. It considers that the contributions from all the attributes for the classification model equals to the joint individual contribution from each attribute. However, the impact from the interactions among attributes is ignored because of linearly or equally aggregation of attributes. Thus, we introduce the generalized Choquet integral with respect to the non-additive measure as the attributes aggregation tool to the optimization-based approaches in classification problem. Also, the boundary for classification is optimized in our proposed model compared with previous optimization-based models. The experimental result of two real life data sets shows the significant improvement of using the non-additive measure in data mining.
Asynchronous Multi-Party Computation with Quadratic Communication
Authors: Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

We present an efficient protocol for secure multi-party computation in the asynchronous model with optimal resilience. For n parties, up to t < n/3 of them being corrupted, and security parameter ¿, a circuit with c gates can be securely computed with communication complexity $\O(c n^2 \kappa)$ bits, which improves on the previously known solutions by a factor of ¿(n). The construction of the protocol follows the approach introduced by Franklin and Haber (Crypto'93), based on a public-key encryption scheme with threshold decryption. To achieve the quadratic complexity, we employ several techniques, including circuit randomization due to Beaver (Crypto'91), and an abstraction of certificates, which can be of independent interest.
Mining Direct and Indirect Fuzzy Multiple Level Sequential Patterns in Large Transaction Databases
Authors: Weimin Ouyang, Qinhua Huang, Shuanghu Luo
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Sequential pattern is an important research topic in data mining and knowledge discovery. Traditional algorithms for mining sequential patterns are built on the binary attributes databases, which has three limitations. The first, it can not concern quantitative attributes; the second, only direct sequential patterns are discovered; the third, it can not process these data items with multiple level concepts. Mining fuzzy sequential patterns has been proposed to address the first limitation. We put forward a discovery algorithm for mining indirect multiple level sequential patterns to deal with the second and the third limitations, and a discovery algorithm for mining both direct and indirect fuzzy multiple level sequential patterns by combining these three approaches.
Measuring the Ignorance and Degree of Satisfaction for Answering Queries in Imprecise Probabilistic Logic Programs
Authors: Anbu Yue, Weiru Liu, Anthony Hunter
Venue: Proceedings of the 2nd international conference on Scalable Uncertainty Management (2008)

In probabilistic logic programming, given a query, either a probability interval or a precise probability obtained by using the maximum entropy principle is returned for the query. The former can be noninformative (e.g., interval [0,1]) and the reliability of the latter is questionable when the priori knowledge is imprecise. To address this problem, in this paper, we propose some methods to quantitatively measure if a probability interval or a single probability is sufficient for answering a query. We first propose an approach to measuring the ignorance of a probabilistic logic program with respect to a query. The measure of ignorance (w.r.t. a query) reflects how reliable a precise probability for the query can be and a high value of ignorance suggests that a single probability is not suitable for the query. We then propose a method to measure the probability that the exact probability of a query falls in a given interval, e.g., a second order probability. We call it the degree of satisfaction. If the degree of satisfaction is high enough w.r.t. the query, then the given interval can be accepted as the answer to the query. We also provide properties of the two measures and use an example to demonstrate the significance of the measures.
Selection of Experts for the Design of Multiple Biometric Systems
Authors: Roberto Tronci, Giorgio Giacinto, Fabio Roli
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

In the biometric field, different experts are combined to improve the system reliability, as in many application the performance attained by individual experts (i.e., different sensors, or processing algorithms) does not provide the required reliability. However, there is no guarantee that the combination of any ensemble of experts provides superior performance than those of individual experts. Thus, an open problem in multiple biometric system is the selection of experts to combine, provided that a bag of experts for the problem at hand are available. In this paper we present an extensive experimental evaluation of four combination methods, i.e. the Mean rule, the Product rule, the Dynamic Score Selection technique, and a linear combination based on the Linear Discriminant Analysis. The performance of combination have been evaluated by the Area Under the Curve (AUC), and the Equal Error Rate (EER). Then, four measures have been used to characterise the performance of the individual experts included in each ensemble, namely the AUC, the EER, and two measures of class separability, i.e., the d' and an integral separability measure. The experimental results clearly pointed out that the larger the d' of individual experts, the higher the performance that can be attained by the combination of experts.
A Study on the P3P Problem
Authors: Jianliang Tang, Wensheng Chen, Jie Wang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

In this paper, we focus on the number of solution for the Perspective-Three-point problem (P3P) in some geometrical constraints of 3 points, which is a common problem in applied mathematics and computer vision. We use Wu's zero decomposition method to find a complete triangular decomposition of a practical configuration for the P3P problem. By the Wu's method, we also obtain some sufficient conditions under which there are multi-solution for the P3P problem.
On the Equivalence of the SMO and MDM Algorithms for SVM Training
Authors: Jorge López, Álvaro Barbero, José R. Dorronsoro
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

SVM training is usually discussed under two different algorithmic points of view. The first one is provided by decomposition methods such as SMO and SVMLight while the second one encompasses geometric methods that try to solve a Nearest Point Problem (NPP), the Gilbert---Schlesinger---Kozinec (GSK) and Mitchell---Demyanov---Malozemov (MDM) algorithms being the most representative ones. In this work we will show that, indeed, both approaches are essentially coincident. More precisely, we will show that a slight modification of SMO in which at each iteration both updating multipliers correspond to patterns in the same class solves NPP and, moreover, that this modification coincides with an extended MDM algorithm. Besides this, we also propose a new way to apply the MDM algorithm for NPP problems over reduced convex hulls.
Optimal Extension Field Inversion in the Frequency Domain
Authors: Selçuk Baktır, Berk Sunar
Venue: Proceedings of the 2nd international workshop on Arithmetic of Finite Fields (2008)

In this paper, we propose an adaptation of the Itoh-Tsujii algorithm to the frequency domain for efficient inversion in a class of Optimal Extension Fields. To the best of our knowledge, this is the first time a frequency domain finite field inversion algorithm is proposed for elliptic curve cryptography. We believe the proposed algorithm would be well suited especially for efficient low-power hardware implementation of elliptic curve cryptography using affine coordinates in constrained small devices such as smart cards and wireless sensor network nodes.
Role-Play Virtual Environments: Recreational Learning of Software Design
Authors: Guillermo Jiménez-Díaz, Mercedes Gómez-Albarrán, Pedro A. González-Calero
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

CRC cards and role-play sessions are two techniques widely used in responsibility-driven design and employed as active learning methods to teach object-oriented software design. Based on our experience using them, we propose a game-based approach to take the classroom experience into a virtual environment. We show how the proposed virtual environment must integrate a number of mechanics and we des-cribe one possible interaction metaphor that combines features from first person shooters and sport games, along with its implementation.
Generalizations of 1-deterministic regular languages
Authors: Yo-Sub Han, Derick Wood
Venue: Information and Computation (2008)

We examine two generalizations of 1-deterministic regular languages that are used for the content models of DTDs in XML. They are k-lookahead determinism and k-block-determinism. The k-lookahead determinism uses the first k symbols w"1w"2...w"k of the current input string as lookahead to process the first symbol w"1. On the other hand, the k-block-determinism takes kw"1w"2...w"k as lookahead and process the whole k symbols. We show that there is a hierarchy in k-lookahead determinism and there is a proper hierarchy in k-block-determinism. Moreover, we prove that k-block-deterministic regular languages are a proper subfamily of deterministic k-lookahead regular languages.
Experiences with a Focus on Testing in Teaching
Authors: Henrik Bærbak Christensen
Venue: Reflections on the Teaching of Programming: Methods and Implementations (2008)

Software of high quality is a major concern in teaching programming: simply making any program that fulfills the requirements is not enough. Yet the way teachers often state exercises tends to make the students focus more on functionality requirements and deadlines than on keeping the program quality high. This chapter discusses some concrete teaching guidelines that help in keeping the learning focus on quality and reports on our experiences in applying them. It furthermore presents an important observation relating to the use of test-driven development as a process that focus on high quality, namely that it tend to improve also the flexibility and reusability of the production code. This issue is presented and argued by a concrete development example.
Separation in Stability Analysis of Piecewise Linear Systems in Discrete Time
Authors: Ji-Woong Lee
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

Stability analysis of piecewise linear systems, without affine terms, consists of the problem of finding maximal stabilizing sets of switching paths among possible system coefficients and that of obtaining a sequence of state-space partitions in the order of increasing refinement. Exploiting the fact that these two problems can be solved separately, one can find subsets of the state space such that the piecewise linear system restricted to these sets is uniformly exponentially stable. 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
Tikhonov Regularization Parameter in Reproducing Kernel Hilbert Spaces with Respect to the Sensitivity of the Solution
Authors: Kateřina Hlaváčková-Schindler
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

In our paper, we consider Tikhonov regularization in the reproducing Kernel Hilbert Spaces. In this space we derive upper and lower bound of the interval which contains the optimal value of Tikhonov regularization parameter with respect to the sensitivity of the solution without computing the singular values of the corresponding matrix. For the case of normalized kernel, we give an explicit formula for the optimal regularization parameter with respect to the sensitivity of the solution which needs only the knowledge of the minimal singular value of the corresponding matrix.