ppxscal/embedding_network huggingface dataset:
A Multi-scheme and Multi-channel Framework for Micropayment Systems
Authors: Aniello Castiglione, Giuseppe Cattaneo, Maurizio Cembalo, Pompeo Faruolo, Umberto Ferraro Petrillo
Venue: Proceedings of the 10th International Conference on E-Commerce and Web Technologies (2009)

In this paper we present an integrated framework for developing and running micropayment services. Our framework is multi-channel, as it allows a micropayment service to be used, at the same time, by clients using different types of communication channels. It is also multi-scheme, because it allows to have on the same server different types of micropayment schemes.The framework has been designed in such a way to simplify the distribution and the replication of its server components across several machines, thus increasing the overall efficiency. On the client side, it includes two library of classes that can be used to run micropayment services on Java applications running on a desktop computer, in a Web browser or on a mobile phone. The framework also includes the implementation of two traditional micropayment schemes, as well as the communication modules needed to implement micropayment schemes over HTTP based and SMS based communication channels.
Second-Level Partition for Estimating FAR Confidence Intervals in Biometric Systems
Authors: Rongfeng Li, Darun Tang, Wenxin Li, David Zhang
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Most biometric authentication algorithms make use of a similarity score that defines how similar two templates are according to a threshold and the accuracy of the results are expressed in terms of a False Reject Rate (FRR) or False Accept Rate (FAR) that is estimated using the training data set. A confidence interval is assigned to any claim of accuracy with 90% being commonly assumed for biometric-based authentication systems. However, these confidence intervals may not be as accurate as is presumed. In this paper, we report the results of experiments measuring the performance of the widely-used subset bootstrap approach to estimating the confidence interval of FAR. We find that the coverage of the FAR confidence intervals estimated by the subset bootstrap approach is reduced by the dependence between two similarities when they come from two individual pairs shared with a common individual. This is because subset bootstrap requires the independence of different subsets. To deal with this, we present a second-level partition to the similarity score set between different individuals, producing what we call a subset false accept rate (SFAR) bootstrap estimation. The experimental results show that the proposed procedures greatly increase the coverage of the FAR confidence intervals.
A Novel Swarm Intelligence Optimization Based on Gene Mutation
Authors: Mingyi Cui
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

Particle swarm optimization (PSO) is one of important swarm intelligence (SI) methods. So far, more and more results of PSO application have been published by researchers. The premature convergence and lower local search performance are drawbacks of PSO. This paper proposes a novel gene mutation PSO (GMPSO), mutates some components of particles by the probability, makes a lot of experiments. The results of the research and the experiments indicate that the method can obviously improve the performance of PSO, is credible in theory and is feasible in technique. 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
Research of Auxiliary Game Platform Based on BCI Technology
Authors: Derong Jiang, Jinghai Yin
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

A brain computer interface (BCI) is a real-time communication system designed to allow users to voluntarily send messages or commands without sending them through the brain's normal output pathways. We designed a real-time BCI auxiliary game platform for motion disabled. Firstly, this system digitizes and stores the EEG signal, and exports the results of Signal Analysis on the Monitors to achieve the basic function which is playing pc-game through the human’s ideas. COM technology allows the BCI platform has strong scalability to meet the needs of various types of brain computer interface solution for the games. Secondly, Fisher Distance criterion is used to select the features. And classification of Motor Imagery EEG evoked by a sequence of randomly mixed left and right motor imagery is performed by a back-propagation neural networks (BPNN), which is in order to recover the two EEG channels C3/C4. Finally, this paper presents one of these solutions, which control games by BCI based on motor imagery. This type of BCI solution is translating the motor imagery EEG into three control signals: left, right or stop. And then a simple game player can use it as an input device of to realize the function of operating games.
Duality of Actor and Character Goals in Virtual Drama
Authors: Maria Arinbjarnar, Daniel Kudenko
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Actor agents in a virtual reality and interactive drama must deliver a believable performance. This is challenging and many issues need to be resolved. One prominent problem is that the goals of a character in an emergent interactive drama may conflict with demands for coherency in the drama's progress. We propose an approach to resolve this that uses Object Oriented Bayesian networks and intelligent agents with dual roles: an actor role focused on the dramatic goals of the story, and a character role focused on believable actions in line with the character's personality and goals.
SENESCOPE: A design tool for cost optimization of wireless sensor nodes
Authors: M. Niedermayer, C. Richter, J. Hefer, S. Guttowski, H. Reichl
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

The market of wireless sensor networks is permanently growing due to the declining costs of sensor nodes. This paper presents a new approach for the hardware design of sensor networks based on a multi-criteria cost optimization by means of evolutionary algorithms. During an automated selection procedure of several implementation variants, not only expenditures for development and fabrication are considered, but also additional objectives like time to market or process complexity. A design tool was realized in order to support the development of very cost-efficient sensor networks. The integration of specific cost models allows the designer to identify the appropriate architecture variants and technology options. The verification of the design tool resulted in valuable knowledge about sensor nodes especially for specific application scenarios. A prototype for condition monitoring was designed and discussed regarding options for cost optimization.
Java Programming: From Problem Analysis to Program Design, 4th edition
Authors: D. S. Malik
Venue:  (2009)

Designed for the beginning programming student, this book will motivate learners while teaching fundamental programming concepts. Based on years of classroom testing, this fourth edition of JAVA PROGRAMMING: FROM PROBLEM ANALYSIS TO PROGRAM DESIGN approaches programming with a focus on clear explanations and practice - two critical factors in mastering the Java language. Straightforward language is used to explain the reasoning behind each new concept, and numerous examples and exercises allow readers to practice solving problems and writing code. This new edition is fully compliant with the latest version of Java, and includes updated programming exercises and programs.
Overview based example selection in end user interactive concept learning
Authors: Saleema Amershi, James Fogarty, Ashish Kapoor, Desney Tan
Venue: Proceedings of the 22nd annual ACM symposium on User interface software and technology (2009)

Interaction with large unstructured datasets is difficult because existing approaches, such as keyword search, are not always suited to describing concepts corresponding to the distinctions people want to make within datasets. One possible solution is to allow end users to train machine learning systems to identify desired concepts, a strategy known as interactive concept learning. A fundamental challenge is to design systems that preserve end user flexibility and control while also guiding them to provide examples that allow the machine learning system to effectively learn the desired concept. This paper presents our design and evaluation of four new overview based approaches to guiding example selection. We situate our explorations within CueFlik, a system examining end user interactive concept learning in Web image search. Our evaluation shows our approaches not only guide end users to select better training examples than the best performing previous design for this application, but also reduce the impact of not knowing when to stop training the system. We discuss challenges for end user interactive concept learning systems and identify opportunities for future research on the effective design of such systems.
Product Variety, Consumer Preferences, and Web Technology: Can the Web of Data Reduce Price Competition and Increase Customer Satisfaction?
Authors: Martin Hepp
Venue: Proceedings of the 10th International Conference on E-Commerce and Web Technologies (2009)

E-Commerce on the basis of current Web technology has created fierce competition with a strong focus on price. Despite a huge variety of offerings and diversity in the individual preferences of consumers, current Web search fosters a very early reduction of the search space to just a few commodity makes and models. As soon as this reduction has taken place, search is reduced to flat price comparison. This is unfortunate for the manufacturers and vendors, because their individual value proposition for a particular customer may get lost in the course of communication over the Web, and it is unfortunate for the customer, because he/she may not get the most utility for the money based on her/his preference function. A key limitation is that consumers cannot search using a consolidated view on all alternative offers across the Web. In this talk, I will (1) analyze the technical effects of products and services search on the Web that cause this mismatch between supply and demand, (2) evaluate how the GoodRelations vocabulary and the current Web of Data movement can improve the situation, (3) give a brief hands-on demonstration, and (4) sketch business models for the various market participants. 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
Stochastic Games with Finitary Objectives
Authors: Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

The synthesis of a reactive system with respect to an ¿-regular specification requires the solution of a graph game. Such games have been extended in two natural ways. First, a game graph can be equipped with probabilistic choices between alternative transitions, thus allowing the modeling of uncertain behavior. These are called stochastic games. Second, a liveness specification can be strengthened to require satisfaction within an unknown but bounded amount of time. These are called finitary objectives. We study, for the first time, the combination of stochastic games and finitary objectives. We characterize the requirements on optimal strategies and provide algorithms for computing the maximal achievable probability of winning stochastic games with finitary parity or Streett objectives. Most notably, the set of states from which a player can win with probability 1 for a finitary parity objective can be computed in polynomial time, even though no polynomial-time algorithm is known in the nonfinitary case.
Terminological reasoning in SHIQ with ordered binary decision diagrams
Authors: Sebastian Rudolph, Markus Krötzsch, Pascal Hitzler
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

We present a new algorithm for reasoning in the description logic SHIQ, which is the most prominent fragment of the Web Ontology Language OWL. The algorithm is based on ordered binary decision diagrams (OBDDs) as a datastructure for storing and operating on large model representations. We thus draw on the success and the proven scalability of OBDD-based systems. To the best of our knowledge, we present the very first agorithm for using OBDDs for reasoning with general Tboxes.
Analyzing disagreements
Authors: Beata Beigman Klebanov, Eyal Beigman, Daniel Diermeier
Venue: Proceedings of the Workshop on Human Judgements in Computational Linguistics (2008)

We address the problem of distinguishing between two sources of disagreement in annotations: genuine subjectivity and slip of attention. The latter is especially likely when the classification task has a default class, as in tasks where annotators need to find instances of the phenomenon of interest, such as in a metaphor detection task discussed here. We apply and extend a data analysis technique proposed by Beigman Klebanov and Shamir (2006) to first distill reliably deliberate (non-chance) annotations and then to estimate the amount of attention slips vs genuine disagreement in the reliably deliberate annotations.
Architecture Optimization Based on Incremental Approach for Airplane Digital Distributed Flight Control System
Authors: Manel Sghairi, Agnan de Bonneval, Yves Crouzet, Jean-Jacques Aubert, Patrice Brot
Venue: Proceedings of the Advances in Electrical and Electronics Engineering - IAENG Special Edition of the World Congress on Engineering and Computer Science 2008 (2008)

Over the years, technical improvements, such as digital computer and digital communication, are drastically changing avionics architecture designs. Airplane performance and business pressures related to cost have been the main drivers to change the Flight Control Systems (FCS) from mechanical to digital fly-by-wire designs. In this context, there exists a great motivation to change current FCS architecture to “more” distributed architectures, better optimized in terms of hardware redundancy for future generation aircraft. Analysis of existing FCS architectures of Airbus and Boeing airplanes, as well as future requirements (eco-efficiency), drive us to introduce a brief overview of an incremental methodology of architectural design process based on progressive requirements injection and distribution of system’s functionality.
Algebraic foundation of a data model for an extensible space-based collaboration protocol
Authors: Stefan Craß, Eva Kühn, Gernot Salzer
Venue: Proceedings of the 2009 International Database Engineering & Applications Symposium (2009)

Space-based computing middleware offers a data driven style for the coordination of processes. The interaction requirements between these processes can be complex, and the template matching coordination law of the Linda and JavaSpaces model is not sufficient. Moreover, the usage should not be limited to a single platform. Several authors have proposed coordination extensions, but besides the suggestion to use XML or RDF based query facilities, a formalization of a general and extensible space-based coordination model has not yet been realized. In this paper we present the algebraic data structures and the coordination model based on a navigational query language for the extensible virtual shared memory architecture, and show how they can be adapted to support arbitrary coordination laws by the introduction of user-definable matchmaker and selector functions. The platform independence is achieved through a language independent communication protocol. The formal specification of the data model is the necessary basis for this protocol.
nfn2dlp and nfnsolve: Normal Form Nested Programs Compiler and Solver
Authors: Annamaria Bria, Wolfgang Faber, Nicola Leone
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

Normal Form Nested (NFN) programs have recently been introduced in order to allow for enriching the syntax of disjunctive logic programs under the answer sets semantics. In particular, heads of rules can be disjunctions of conjunctions, while bodies can be conjunctions of disjunctions. Different to many other proposals of this kind, NFN programs may contain variables, and a notion of safety has been defined for guaranteeing domain independence. Moreover, NFN programs can be efficiently translated to standard disjunctive logic programs (DLP).In this paper we present the tool nfn2dlp, a compiler for NFN programs, which implements an efficient translation from safe NFN programs to safe DLP programs. The answer sets of the original NFN program can be obtained from the answer sets of the transformed program (which in turn can be obtained by using a DLP system) by a simple transformation. The system has been implemented using the object-oriented programming language Ruby and Treetop, a language for Parsing Expression Grammars (PEGs). It currently produces DLP programs in the format of DLV. The separate script nfnsolve uses DLV as a back-end to compute answer sets for NFN programs. Thus, combining the two tools we obtain a system which supports the powerful NFN language, and is available for experiments.
An α-approximation protocol for the generalized mutual assignment problem
Authors: Katsutoshi Hirayama
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

This paper presents a new distributed solution protocol, called DisLRPα, for the Generalized Mutual Assignment Problem (GMAP). The GMAP is a typical distributed combinatorial optimization problem whose goal is to maximize social welfare of the agents. Unlike the previous protocol for the GMAP, DisLRPα can provide a theoretical guarantee on global solution quality. In DisLRPα, as with in the previous protocol, the agents repeatedly solve their local problems while coordinating their local solutions using a distributed constraint satisfaction technique. The key difference is that, in DisLRPα, each agent is required to produce a feasible solution whose local objective value is not lower than α (0 < α ≤ 1) times the local optimal value. Our experimental results on benchmark problem instances show that DisLRPα can certainly find a solution whose global objective value is higher than that theoretically guaranteed. Furthermore, they also show that, while spending extra communication and computation costs, DisLRPα can produce a significantly better solution than the previous protocol if we set α appropriately.
Quantitative Pathway Logic for Computational Biology
Authors: Michele Baggi, Demis Ballis, Moreno Falaschi
Venue: Proceedings of the 7th International Conference on Computational Methods in Systems Biology (2009)

This paper presents an extension of Pathway Logic, called Quantitative Pathway Logic (QPL), which allows one to reason about quantitative aspects of biological processes, such as element concentrations and reactions kinetics. Besides, it supports the modeling of inhibitors, that is, chemicals which may block a given reaction whenever their concentration exceeds a certain threshold. QPL models can be specified and directly simulated using rewriting logic or can be translated into Discrete Functional Petri Nets (DFPN) which are a subclass of Hybrid Functional Petri Nets in which only discrete transitions are allowed. Under some constraints over the anonymous variables appearing in the QPL models, the transformation between the two computational models is shown to preserve computations. By using the DFPN representation our models can be graphically visualized and simulated by means of well known tools (e.g. Cell Illustrator); moreover standard Petri net analyses (e.g. topological analysis, forward/backward reachability, etc.) may be performed on the net model. An executable framework for QPL and for the translation of QPL models into DFPNs has been implemented using the rewriting-based language Maude. We have tested this system on several examples.
On the syllabification of phonemes
Authors: Susan Bartlett, Grzegorz Kondrak, Colin Cherry
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

Syllables play an important role in speech synthesis and recognition. We present several different approaches to the syllabification of phonemes. We investigate approaches based on linguistic theories of syllabification, as well as a discriminative learning technique that combines Support Vector Machine and Hidden Markov Model technologies. Our experiments on English, Dutch and German demonstrate that our transparent implementation of the sonority sequencing principle is more accurate than previous implementations, and that our language-independent SVM-based approach advances the current state-of-the-art, achieving word accuracy of over 98% in English and 99% in German and Dutch.
Blind Source Separation Using Virtual Sensors
Authors: Mahdi Mahdi Khani, Mohammad Hossein Kahaei
Venue: Proceedings of the 2009 Fourth International Conference on Digital Telecommunications (2009)

This paper presents a new approach to enhance the quality of separated source in blind source separation problem. We consider the general case where the total number of sources is larger than the number of sensors and the number of sources is not known. The method is based on a principal point that we can use the signals of the “virtual sensors” that do not exist in practice but generated synthetically. In the proposed algorithm, the number of actual and virtual sensors equals the number of sources. This algorithm deletes the musical noise effect generated by DESPRIT algorithm, so the quality of separated signals increases compared to DESPRIT.
Objetive assessment of olfactory function using functional magnetic resonance (fMRI)
Authors: S. Borromeo, J. A. Hernandez-Tamames, G. Luna, F. Machado, N. Malpica, A. Toledano
Venue: Proceedings of the 2009 IEEE International Workshop on Medical Measurements and Applications (2009)

In this work, a device for generating automated olfactory stimuli in functional magnetic resonance imaging (fMRI) studies is described. The novel issues of our design are: synchronization between the acquisition and the olfactory task, automated control of experimental parameters (odorants sequences, frequency, time and concentration of stimuli). Finally, we present the preliminary results obtained on a General Electric 3 Tesla MRI scanner belong to The Alzheimer Project of the Fundación Reina Sofía.