ppxscal/embedding_network huggingface dataset:
Finding Nash bargaining solutions for multi-issue negotiations: a preliminary result
Authors: Katsuhide Fujita, Takayuki Ito, Mark Klein
Venue: Proceedings of the 1st International Working Conference on Human Factors and Computational Models in Negotiation (2008)

We envision the future in which large number of participants collaborate, negotiate, and reach consensus through computer supported negotiation support system against a global problem in the world. Multi interdependent issues negotiation has been studied widely since such most real-world negotiation involves multiple interdependent issues. Our work focuses on negotiation with multiple interdependent issues, in which agent utility functions are nonlinear. Existing works have not yet concerned with agents' private information that should be concealed from others in negotiations. In this paper, we propose Distributed Mediator Protocol (DMP) to securely find the agreements that satisfy the Pareto optimality. DMP successfully conceals agents' private information. Then, we propose the following two measures for selecting the final agreements from the set of Pareto-optimal contracts. First, we propose "approximated fairness," which represents how fair the contract is for each agent. We employ deviation for measuring the difference of utilities achieved by agents. Second, we propose the rate of Nash bargaining solution, which represents how close the contract is to the Nash bargaining solution. The Nash bargaining solution maximizes the product of each agent's utilities (Nash product) in our model. The approximated fairness helps the mediator find the contract that is close to the Nash bargaining solution. This is because the Nash product will be increased if approximated fairness becomes small. Moreover, we compare DMP with a search algorithm (called Direct Search) to find a contract which maximizes Nash products directly. Direct Search is usually better for finding the Nash bargaining solution. However, Direct Search isn't always better from the Pareto Optimality and Fairness if the situation is difficult for finding the Nash bargaining solution. We compare DMP with Direct Search from Nash product and Pareto optimality in the experiments.
Spherical discriminant analysis in semi-supervised speaker clustering
Authors: Hao Tang, Stephen M. Chu, Thomas S. Huang
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

Semi-supervised speaker clustering refers to the use of our prior knowledge of speakers in general to assist the unsupervised speaker clustering process. In the form of an independent training set, the prior knowledge helps us learn a speaker-discriminative feature transformation, a universal speaker prior model, and a discriminative speaker subspace, or equivalently a speaker-discriminative distance metric. The directional scattering patterns of Gaussian mixture model mean supervectors motivate us to perform discriminant analysis on the unit hypersphere rather than in the Euclidean space, which leads to a novel dimensionality reduction technique called spherical discriminant analysis (SDA). Our experiment results show that in the SDA subspace, speaker clustering yields superior performance than that in other reduced-dimensional subspaces (e.g., PCA and LDA).
Validation of SDL specifications using EFSM-based test generation
Authors: W. Eric Wong, Andy Restrepo, Byoungju Choi
Venue: Information and Software Technology (2009)

Existing methods for testing an SDL specification mainly allow for either black box simulation or conformance testing to verify that the behavior of an implementation matches its corresponding model. However, this relies on the potentially hazardous assumption that the model is completely correct. We propose a test generation method that can accomplish conformance verification as well as coverage criteria-driven white box testing of the specification itself. We first reformat a set of EFSMs equivalent to the processes in an SDL specification and identify ''hot spots'' - nodes or edges in the EFSM which should be prioritized during testing to effectively increase coverage. Then, we generate test sequences intended to cover selected hot spots; we address the possible infeasibility of such a test sequence by allowing for its rejection decided by a constraint solver and re-generation of an alternate test sequence to the hot spot. In this paper, we present our test generation method and tool, and provide case studies on five SDL processes demonstrating the effectiveness of our coverage-based test sequence selection.
A Comparative Study on Feature Selection for Retinal Vessel Segmentation Using FABC
Authors: Carmen Alina Lupaşcu, Domenico Tegolo, Emanuele Trucco
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

This paper presents a comparative study on five feature selection heuristics applied to a retinal image database called DRIVE. Features are chosen from a feature vector (encoding local information, but as well information from structures and shapes available in the image) constructed for each pixel in the field of view (FOV) of the image. After selecting the most discriminatory features, an AdaBoost classifier is applied for training. The results of classifications are used to compare the effectiveness of the five feature selection methods.
Identify Implicit Social Network by RST/FL Framework
Authors: Hong Feng Lai
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

The rapid growth of internet has transformed the way relationships between companies and their customers. To find the implicit social network and form customer club (community) for customers is a critical requirement in some businesses. The social role analysis attempts to find explicit similarities between actors in the network. Traditional clustering methods based on attributes between actors lack for logic foundation. In this paper, we apply rough set theory to partition objects into equivalence classes interpreting the hidden community. This paper proposes a framework to find the implicit social network based on rough set theory and frame logic to extract and express the social structure and relationship. The development framework includes three levels, i.e. conceptual level, logical level and validation level. In conceptual level, we explore the properties of social network. The logic and validation is based on frame logic. The interface of different level is a mapping from a source model to a target model using a set of transformation rules. Finally, we apply FLORID tools to evaluate the correctness and the adequacy of the model.
Lagrange interpolations using bivariate C2 quintic supersplines on double Clough-Tocher refinements
Authors: Huan-Wen Liu, Le-Le Fan
Venue: Computers Mathematics with Applications (2009)

In this paper, a local Lagrange interpolation set for a bivariate quintic superspline space defined on the triangulation @?@?"D"C"T is constructed, where @?@?"D"C"T can be gained through refining certain triangles in an arbitrary regular triangulation @? by double Clough-Tocher refinements.
Tell Me Where You've Lived, and I'll Tell You What You Like: Adapting Interfaces to Cultural Preferences
Authors: Katharina Reinecke, Abraham Bernstein
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

Adapting user interfaces to cultural preferences has been shown to improve a user's performance, but is oftentimes foregone because of its time-consuming and costly procedure. Moreover, it is usually limited to producing one uniform user interface (UI) for each nation disregarding the intangible nature of cultural backgrounds. To overcome these problems, we exemplify a new approach with our culturally adaptive web application MOCCA, which is able to map information in a cultural user model onto adaptation rules in order to create personalized UIs. Apart from introducing the adaptation flexibility of MOCCA, the paper describes a study with 30 participants in which we compared UI preferences to MOCCA's automatically generated UIs. Results confirm that automatically predicting cultural UI preferences is possible, paving the way for low-cost cultural UI adaptations.
Bandwidth provisioning in ADSL access networks
Authors: Kaiqi Xiong, Harry Perros, Steven Blake
Venue: International Journal of Network Management (2009)

We consider an ADSL access network consisting of subscribers, digital subscriber line access multiplexers (DSLAMs), metro Ethernet switches and a broadband remote access aggregation server (BRAS). We obtain expressions for dimensioning the access network in the upstream direction. Specifically, we show that the bandwidth required at each DSLAM, metro Ethernet switch, and BRAS can be expressed as an exponential function of the subscribers in a log scale when the number of subscribers does not surpass a certain value. After this value, it grows linearly as a function of the subscribers.
Anton: A Specialized Machine for Millisecond-Scale Molecular Dynamics Simulations of Proteins
Authors: David E. Shaw
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

The ability to perform long, accurate molecular dynamics (MD) simulations involving proteins and other biological macromolecules could in principle lead to important scientific advances and provide a powerful new tool for drug discovery. A wide range of biologically important processes, however, occur over time scales on the order of a millisecond -- several orders of magnitude beyond the duration of the longest previous MD simulations. Our research group has recently completed a specialized, massively parallel machine called Anton, which is capable of calculating millisecond-scale molecular trajectories at an atomic level of detail. The machine has greatly extended the power of simulation as a tool for understanding the structure and dynamics of proteins, and has already allowed us to observe and analyze important biological phenomena that have not previously been accessible to either computational or experimental study. 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
Supporting the use of multiple representations in multimedia learning environments
Authors: Maria Opfermann, Jan Van Der Meij, Shaaron Ainsworth, Tina Seufert, Markus Vogel, Roland Brünken, Jan L. Plass, Bruce Homer, Yan Wang, Minchi Kim, Catherine Milne, Trace Jordan, Peter Gerjets, Katharina Scheiter, Ton De Jong
Venue: Proceedings of the 8th international conference on International conference for the learning sciences - Volume 3 (2008)

Many learning environments contain multiple representations. Using them can lead to a deeper level of cognitive processing when learners make mental transformations between representations. However, research has revealed two problems. First, it has been shown that learners often do not make spontaneous use of such multiple options. Second, the translation process is often difficult. The papers presented in this symposium aim at supporting learners' use of multiple representations as well as their translation process. The first study provided learners with different types of representations and asked them to translate those into other representations. The second study examined the effectiveness of contextual scaffolds in computer simulations. The third study aimed at supporting hypermedia learning with multiple representations by means of metacognitive modelling and prompting of representational awareness. The fourth study investigated if sequencing dynamic representations combined with explicit instruction to relate and translate between representations has a positive effect on learning outcomes.
A Location-Independent Node Scheduling for Heterogeneous Wireless Sensor Networks
Authors: Huanzhao Wang, Fanzhi Meng, Hanmei Luo, Ting Zhou
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

In this paper, we address the problem of maximizing sensor networks lifetime as well as maintain sufficient sensing coverage. The problem of computing redundant sensing areas among neighboring heterogeneous sensors is analyzed. We present a mathematical model to compute the redundancy degree of each sensor without the knowledge of location information for heterogeneous wireless sensor networks. Based on the model, we propose a Location-Independent Node Scheduling for Heterogeneous wireless sensor networks (LINSH), which can implement node self-scheduling automatically. Simulations results show that LINSH can guarantee the desired coverage QoS requirement accurately as well as minimize the number of active nodes and prolong the networks useful lifetime significantly. In addition, LINSH can also balance the energy consumption with low control overhead.
Efficient Data Structure and Algorithms for Sparse Integers, Sets and Predicates
Authors: Jean E. Vuillemin
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

We construct a natural number n > 1 by trichotomyn = g + Xpd; Xp = 22p; 0 · g
Heuristics for dynamically adapting propagation in constraint satisfaction problems
Authors: Kostas Stergiou
Venue: AI Communications (2009)

Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt the propagation method applied on the constraints of the problem during search. In this paper we present a heuristic approach to this problem based on the monitoring of propagation events like value deletions and domain wipeouts. We develop a number of heuristics that allow the constraint solver to dynamically switch between a weaker and cheap local consistency and a stronger, but more expensive one, when certain conditions are met. The success of this approach is based on the observation that propagation events for individual constraints in structured problems mostly occur in clusters of nearby revisions. Hence, parts of the search space where certain constraints are highly active can be identified and exploited paving the way for the informed use of constraint propagation techniques. In this paper we first give some experimental results displaying the clustering of propagation events in structured binary CSPs. Then we present simple heuristics that exploit this clustering to efficiently switch between different local consistencies on individual constraints during search. Finally, we make an experimental study on various binary CSPs demonstrating the effectiveness of the proposed heuristics.
Flash AS3 for Interactive Agencies: Insider Guide for Interactive Agency Flash Development
Authors: Randall W. Haws
Venue:  (2009)

This book is a free online book, open-source, and a non-profit endeavor. The author of this book recommends that you download the free "printer ready" book from www.as3core.com before ordering a paperback copy at your own expense and effort, which is a luxury and not necessary. Haws Press, Haws Professional Editions, and Randall W. Haws are pleased to provide an insider guide for interactive agency flash development. "Flash AS3 for Interactive Agencies" (or "FAS3FIA") has been an evolving and collaborative work for almost 3 years and incorporates open-source works by several of the best Flash developers from around the world. The AS3_CORE Flash Template project is an open-source template framework in ActionScript 3 that serves as a base framework for new Flash projects. All you need to do is configure a few items and files, on a per project basis, to quickly and efficiently start development for the new project and begin writing project specific API code. 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
Cost-sensitive imputing missing values with ordering
Authors: Xiaofeng Zhu, Shichao Zhang, Jilian Zhang, Chengqi Zhang
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Various approaches for dealing with missing data have been developed so far. In this paper, two strategies are proposed for cost-sensitive iterative imputing missing values with optimal ordering. Experimental results demonstrate that proposed strategies outperform the existing methods in terms of imputation cost and accuracy.
Arabic preprocessing schemes for statistical machine translation
Authors: Nizar Habash, Fatiha Sadat
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

In this paper, we study the effect of different word-level preprocessing decisions for Arabic on SMT quality. Our results show that given large amounts of training data, splitting off only proclitics performs best. However, for small amounts of training data, it is best to apply English-like to-kenization using part-of-speech tags, and sophisticated morphological analysis and disambiguation. Moreover, choosing the appropriate preprocessing produces a significant increase in BLEU score if there is a change in genre between training and test data.
Application of Software Simulation Approach to Adjustable Speed AC Drive System Curriculum
Authors: Zheng Li
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

The focus of the present work is on introducing the simulation approach based on software to the adjustable speed AC drive system curriculum. These techniques not only help to develop a deeper understanding of adjustable speed AC drive system but also to evaluate performance and feasibility of control strategies and topological features without fabrication of a real system. Typical elements and control strategies are modeled and simulated. Simulation results provide an overview of the capability and limitations of various control schemes. It is expected that this work will be of use to students as well as researchers who are interested in studying and researching AC drive.
Optimal Local Temporal Common Spatial Patterns for Single-trial EEG Classification
Authors: Xiaohua Huang, Wenming Zheng
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

The classification of brain-wave such as an electroencephalogram (EEG) has an important character in Brain-Computer Interface. Local temporal Common Spatial Patterns (LTCSP) is a technique to capture the local temporal information of EEG signal, and has two free parameters including the number of nearest neighbors and the kernel variance, which have to be specified manually. In this paper we propose a novel method for selecting the optimal parameter for LTCSP automatically. Comparing computational time and classification rate on BCI Competition 2003 data set, it shows that our proposed method is more efficient than CSP and LTCSP.
The Application of the Ant Colony Pheromones in Intelligent Learning
Authors: Wang Cuiru, Li Yang
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

We used the Ant Colony Pheromones in the intelligent learning. Proposed an intelligence network based on Ant Colony Pheromones and TSP problem. The Ant Colony Pheromones was in hierarchical distribution in the network, Recording of the learning and related information by the residual Pheromones, so realized intelligent decision. We use the path choosing in the Ant Colony Algorithm as decision of the network, use the pheromones updating in the Ant Colony Algorithm as the intelligent learning of the intelligent network .Because every cycle in the Ant Colony Algorithm was related with the last, so add the begin point and the end point the last path to the input of the network. At the end of the paper, we used Ant Colony Pheromones and the intelligent network based on Ant Colony Pheromones on SCADA systems, achieved good results.
Online Priority Steiner Tree Problems
Authors: Spyros Angelopoulos
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instance, in QoS multicasting, a source needs to efficiently transmit a message to a set of receivers, each requiring support at a different QoS level (e.g., bandwidth). This can be formulated as the Priority Steiner tree problem: Here, each link of the underlying network is associated with a priority value (namely the QoS level it can support) as well as a cost value. The objective is to find a tree of minimum cost that spans all receivers and the source, such that the path from the source to any given receiver can support the QoS level requested by the said receiver. The problem has been studied from the point of view of approximation algorithms.In this paper we introduce and address the on-line variant of the problem, which models the situation in which receivers join the multicast group dynamically. Our main technical result is a tight bound on the competitive ratio of $\Theta \left (\min \left \{b \log \frac{k}{b},k \right \} \right)$ (when k > b), and ¿(k) (when k ≤ b), where b is the total number of different priority values and k is the total number of receivers. The bound holds for undirected graphs, and for both deterministic and randomized algorithms. For the latter class, the techniques of Alon et al. [Trans. on Algorithms 2005] yield a O(logk logm)-competitive randomized algorithm, where m is the number of edges in the graph. Last, we study the competitiveness of online algorithms assuming directed graphs; in particular, we consider directed graphs of bounded edge-cost asymmetry.
BDI-Based Development of Virtual Characters with a Theory of Mind
Authors: Michal P. Sindlar, Mehdi M. Dastani, John-Jules Ch. Meyer
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Users expect characters in role-playing games to be proactive and social, but these characters fail to deliver in this respect due to limitations of traditional game AI programming approaches. BDI-based approaches are suited for development of proactive systems, such as NPCs in games. This paper argues that a BDI-based approach is also highly suited for developing social NPCs in a principled way.
Hybrid possibilistic networks
Authors: Salem Benferhat, Salma Smaoui
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

Possibilistic networks are important tools for dealing with uncertain pieces of information. For multiply-connected networks, it is well known that the inference process is a hard problem. This paper studies a new representation of possibilistic networks, called hybrid possibilistic networks. The uncertainty is no longer represented by local conditional possibility distributions, but by their compact representations which are possibilistic knowledge bases. We show that the inference algorithm in hybrid networks is strictly more efficient than the ones of standard propagation algorithm.