ppxscal/embedding_network huggingface dataset:
Voting Security and Technology
Authors: Bruce Schneier
Venue: IEEE Security and Privacy (2004)

Voting seems like the perfect application for technology, but actually applying it is harder than it first appears. To ensure that voters can vote honestly, they need anonymity, which requires a secret ballot. 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
Towards minimalism and expressiveness in interactive drama
Authors: Nicolas Szilas, Jue Wang, Monica Axelrad
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

Having found it difficult for authors to be creative with current interactive drama systems, we propose an alternative author-centered approach allowing authors of nonlinear media to express themselves easily and smoothly. At the level of character animation, a bottleneck in Interactive Drama, our idea is to build authoring tools and author-centered engines for interactive drama that make it possible for an author to create virtual worlds, characters and animation instantly. To achieve this goal, a minimalist design for each of those features is proposed. A Use Case is described to better illustrate the approach.
Monostable Controllers for Adaptive Behaviour
Authors: Christopher L. Buckley, Peter Fine, Seth Bullock, Ezequiel Paolo
Venue: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats (2008)

Recent artificial neural networks for machine learning have exploited transient dynamics around globally stable attractors, inspired by the properties of cortical microcolumns. Here we explore whether similarly constrained neural network controllers can be exploited for embodied, situated adaptive behaviour. We demonstrate that it is possible to evolve globally stable neurocontrollers containing a single basin of attraction, which nevertheless sustain multiple modes of behaviour. This is achieved by exploiting interaction between environmental input and transient dynamics. We present results that suggest that this globally stable regime may constitute an evolvable and dynamically rich subset of recurrent neural network configurations, especially in larger networks. We discuss the issue of scalability and the possibility that there may be alternative adaptive behaviour tasks that are more `attractor hungry'.
Anxiety increases the feeling of presence in virtual reality
Authors: Stéphane Bouchard, Julie St-Jacques, Geneviève Robillard, Patrice Renaud
Venue: Presence: Teleoperators and Virtual Environments (2008)

Given previous studies indicating a significant correlation between anxiety and presence, the purpose of this investigation was to explore the direction of the causal relationship between them. The sample consisted of 31 adults suffering from snake phobia. The study featured a randomized within-between design with two conditions and three counterbalanced immersions: (a) a baseline control immersion (BASELINE), (b) an immersion in a threatening and anxiety-inducing environment (ANX), and (c) an immersion in a nonthreatening environment that should not induce anxiety (NOANX). In the NOANX environment, participants were immersed for 5 min in a virtual Egyptian desert. They were told that the environment was safe and contained no snakes. The ANX immersion was identical, except that participants were led to believe that a multitude of hidden and dangerous snakes were lurking in the environment. A period of distraction (reading a text on relaxation) separated the ANX and NOANX immersions. Experimenters recorded presence and anxiety in the middle of and after each VR immersion. These brief measures of presence supported our hypothesis and were significantly higher in the anxious immersion than in the baseline or the nonanxious immersion. This finding was not corroborated by the presence questionnaire, where scores varied significantly in the opposite direction. The results from the brief one-item measures of presence support the significant contribution of emotions felt during the immersion on the subjective feeling of presence. The mixed results with the presence questionnaire are discussed, along with psychological factors potentially involved in presence.
Rough Set Approaches for Mining Incomplete Information Systems
Authors: M. K. Sabu, G. Raju
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Rough Set theory and its extensions are found to be very effective in Knowledge Discovery in Data Bases. A number of tools are available in RST to solve Data Mining tasks such as clustering, rule mining, handling missing values and elimination of redundant data. In Data Mining handling of information tables with missing data values plays a very important role as missing values reduces the quality of information extracted. In this paper we discuss three different approaches to handle missing values. First method is called RSFit approach which predicts the missing attribute values based on a distance function.Second method, called Characteristic set based approach, provides decision rules from incomplete information systems. Finally a novel approach is introduced for constructing decision rules. This is based on a similarity relation. Experiment with small data set shows that the new approach is slightly better than the second method.
On the Synthetic Generation of Semantic Web Schemas
Authors: Yannis Theoharis, George Georgakopoulos, Vassilis Christophides
Venue: Semantic Web, Ontologies and Databases: VLDB Workshop, SWDB-ODBIS 2007, Vienna, Austria, September 24, 2007, Revised Selected Papers (2008)

In order to cope with the expected size of the Semantic Web (SW) in the coming years, we need to benchmark existing SW tools (e.g., query language interpreters) in a credible manner. In this paper we present the first RDFS schema generator, termed PoweRGen, which takes into account the morphological features that schemas frequently exhibit in reality. In particular, we are interested in generating synthetically the two core components of an RDFS schema, namely the property (relationships between classes or attributes) and the subsumption (subsumption relationships among classes) graph. The total-degree distribution of the former, as well as the out-degree distribution of the Transitive Closure (TC) of the latter, usually follow a power-law. PoweRGen produces synthetic property and subsumption graphs whose distributions respect the power-law exponents given as input with a confidence ranging between 90 ¿ 98%.
Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination
Authors: Sudipto Guha, Andrew Mcgregor
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

There is a natural relationship between lower bounds in the multi-pass stream model and lower bounds in multi-round communication. However, this connection is less understood than the connection between single-pass stream computation and one-way communication. In this paper, we consider data-stream problems for which reductions from natural multi-round communication problems do not yield tight bounds or do not apply. While lower bounds are known for some of these data-stream problems, many of these only apply to deterministic or comparison-based algorithms, whereas the lower bounds we present apply to any (possibly randomized) algorithms. Our results are particularly relevant to evaluating functions that are dependent on the ordering of the stream, such as the longest increasing subsequence and a variant of tree pointer jumping in which pointers are revealed according to a post-order traversal.Our approach is based on establishing "pass-elimination" type results that are analogous to the round-elimination results of Miltersen et al. [23] and Sen [29]. We demonstrate our approach by proving tight bounds for a range of data-stream problems including finding the longest increasing sequences (a problem that has recently become very popular [22,16,30,15,12] and we resolve an open question of [30]), constructing convex hulls and fixed-dimensional linear programming (generalizing results of [8] to randomized algorithms), and the "greater-than" problem (improving results of [9]). These results will also clarify one of the main messages of our work: sometimes it is necessary to prove lower bounds directly for stream computation rather than proving a lower bound for a communication problem and then constructing a reduction to a data-stream problem.
Battery-aware scheduling inwireless mesh networks
Authors: Chi Ma, Zhenghao Zhang, Yuanyuan Yang
Venue: Mobile Networks and Applications (2008)

Wireless mesh networks recently emerge as a flexible, low-cost and multipurpose networking platform with wired infrastructure connected to the Internet. A critical issue in mesh networks is to maintain network activities for a long lifetime with high energy efficiency. As more and more outdoor applications require long-lasting, high energy efficient and continuously-working mesh networks with battery-powered mesh routers, it is important to optimize the performance of mesh networks from a battery-aware point of view. Recent study in battery technology reveals that discharging of a battery is nonlinear. Batteries tend to discharge more energy than needed, and reimburse the over-discharged energy later if they have sufficiently long recovery time. Intuitively, to optimize network performance, a mesh router should recover its battery periodically to prolong the lifetime. In this paper, we introduce a mathematical model on battery discharging duration and lifetime for wireless mesh networks. We also present a battery lifetime optimization scheduling algorithm (BLOS) to maximize the lifetime of battery-powered mesh routers. Based on the BLOS algorithm, we further consider the problem of using battery powered routers to monitor or cover a few hot spots in the network. We refer to this problem as the Spot Covering under BLOS Policy problem (SCBP). We prove that the SCBP problem is NP-hard and give an approximation algorithm called the Spanning Tree Scheduling (STS) to dynamically schedule mesh routers. The key idea of the STS algorithm is to construct a spanning tree according to the BLOS Policy in the mesh network. The time complexity of the STS algorithm is O(r) for a network with r mesh routers. Our simulation results show that the STS algorithm can greatly improve the lifetime, data throughput and energy consumption efficiency of a wireless mesh network.
Report from the Open Space and Poster Sessions
Authors: Lars Marius Garshol, Lutz Maicher
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

This is a summary of the presentations made in the poster session and the two open space sessions at the TMRA 2007 conference. The poster session consists of peer-reviewed conference submissions accepted as posters, while the open space sessions were free-form sessions where anyone could sign up to do a short presentation. The result is a collection of reports on works in progress and interesting ideas, some of which are likely to appear as papers at next year's conference.
Lexical and Semantic Methods in Inner Text Topic Segmentation: A Comparison between C99 and Transeg
Authors: Alexandre Labadié, Violaine Prince
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

This paper present a semantic and syntactic distance based method in topic text segmentation and compare it to a very well known text segmentation algorithm: c99. To do so we ran the two algorithms on a corpus of twenty two French political discourses and compared their results.
Automated formal analysis of human multi-issue negotiation processes
Authors: Tibor Bosse, Catholijn M. Jonker, Lourens van der Meij, Jan Treur
Venue: Multiagent and Grid Systems (2008)

This paper reports on experiments in (human) multi-issue negotiation and their analysis, and presents a generic software environment supporting such an analysis. First, the paper presents a System for Analysis of Multi-Issue Negotiation (SAMIN). SAMIN was designed to analyse multi-issue negotiation processes between human negotiators, between human and software agents, and between software agents. The agents conduct one-to-one negotiations, in which the values across multiple issues are negotiated on simultaneously. To analyse such negotiation processes, the user can enter any formal property deemed useful into the system and use the system to automatically check this property in given negotiation traces. The paper presents the results of applying SAMIN in the analysis of empirical traces obtained from an experiment in multi-issue negotiation about second hand cars. In the experiment the efforts of 74 humans negotiating against each other have been analysed using SAMIN.
Real-Time Open-Domain QA on the Portuguese Web
Authors: António Branco, Lino Rodrigues, João Silva, Sara Silveira
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

This paper presents a system for real-time, open-domain question answering on the Web of documents written in Portuguese, prepared to handle factual questions and available as a freely accessible online service. In order to deliver candidate answers to input questions phrased in Portuguese, this system resorts to a number of shallow processing tools and question answering techniques that are specifically geared to cope with the Portuguese language.
Affect Related Acoustic Features of Speech and Their Modification
Authors: Dandan Cui, Fanbo Meng, Lianhong Cai, Liuyi Sun
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

This paper presents our recent work on the investigation of affect related acoustic features of Mandarin speech and their modification. A syllabic F0 contour model so called "Gravity Model" is proposed, which can describe the detailed changes of the F0 contour on the syllable level between different emotions. Then, different representations of spectrum, together with different modification methods, are also tried and compared; a maximal-mean amplitude representation proves to be the best, with its corresponding modifying method.
Scala for generic programmers
Authors: Bruno C.d.S. Oliveira, Jeremy Gibbons
Venue: Proceedings of the ACM SIGPLAN workshop on Generic programming (2008)

Datatype-generic programming involves parametrization by the shape of data, in the form of type constructors such as "list of". Most approaches to datatype-generic programming are developed in the lazy functional programming language Haskell. We argue that the functional object-oriented language Scala is in many ways a better setting. Not only does Scala provide equivalents of all the necessary functional programming features (such parametric polymorphism, higher-order functions, higher-kinded type operations, and type- and constructor-classes), but it also provides the most useful features of object-oriented languages (such as subtyping, overriding, traditional single inheritance, and multiple inheritance in the form of traits). We show how this combination of features benefits datatype-generic programming, using three different approaches as illustrations.
MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks
Authors: Stefano Boschi, Miriam Di lanni, Pilu Crescenzi, Gianluca Rossi, Paola Vocca
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

This paper describes MOMOSE, a highly flexible and easily extensible environment for the simulation of mobility models. MOMOSE not only allows a programmer to easily integrate a new mobility model into the set of models already included in its distribution, but it also allows the user to let the nodes of the MANET move in different ways by associating any mobility model to any subset of the nodes themselves. Moreover, MOMOSE can be easily adapted in order to record, during the simulation time, all the data necessary for the evaluation of the performance of any communication protocol or of any MANET-based application.
How Protective Are Synthetic Data?
Authors: John M. Abowd, Lars Vilhuber
Venue: Proceedings of the UNESCO Chair in data privacy international conference on Privacy in Statistical Databases (2008)

This short paper provides a synthesis of the statistical disclosure limitation and computer science data privacy approaches to measuring the confidentiality protections provided by fully synthetic data. Since all elements of the data records in the release file derived from fully synthetic data are sampled from an appropriate probability distribution, they do not represent "real data," but there is still a disclosure risk. In SDL this risk is summarized by the inferential disclosure probability. In privacy-protected database queries, this risk is measured by the differential privacy ratio. The two are closely related. This result (not new) is demonstrated and examples are provided from recent work.
A Classification of Viruses Through Recursion Theorems
Authors: Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recursion theorem. We show that we can classify viruses as solutions of fixed point equations which are obtained from different versions of Kleene's second recursion theorem. This lead us to consider four classes of viruses which various polymorphic features. We propose to use virus distribution in order to deal with mutations.Topics covered. Computability theoretic aspects of programs, computer virology.
Membrane Systems and Their Application to Systems Biology
Authors: Giancarlo Mauri
Venue: Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World (2007)

P-systems, or membrane systems [1], were introduced by George Păun as a class of unconventional computing devices of distributed, parallel and nondeterministic type, inspired by the compartmental structure and the functioning of living cells. The basic model consists of a membrane structure, described by a finite string of well matching parentheses, and graphically represented as regions on the plane, hierarchically embedded within an external region. Each membrane contains a multiset of objects (representing chemical substances) that evolve according to given evolution rules (representing reactions).
Communication Complexity in Algebraic Two-Party Protocols
Authors: Rafail Ostrovsky, William E. Skeith,  Iii
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption schemes, using their homomorphic properties in a black-box way. A few notable examples of such primitives include items like single database Private Information Retrieval (PIR) schemes (introduced in [15]) and private database update with small communication (introduced in [5]). In this paper, we illustrate a general methodology for determining what types of protocols can and cannot be implemented with small communication by using homomorphic encryption in a black-box way.We hope that this work will provide a simple "litmus test" of feasibility for black-box use of known homomorphic encryption schemes by other cryptographic researchers attempting to develop new protocols with low communication. Additionally, a precise mathematical language for reasoning about such problems is developed in this work, which may be of independent interest. We stress that the class of algebraic structures for which we prove communication complexity lower bounds is large, and covers practically all known semantically-secure homomorphic cryptosystems (including those based upon bilinear maps).Finally, we show the following equivalence which relates group homomorphic encryption and a major open question of designing a so-called fully-homomorphic cryptosystem: a fully homomorphic encryption scheme (over a non-zero ring) exists if and only if there exists homomorphic encryption over any finite non-abelian simple group. This result somewhat generalizes results of Barrington [1] (to any group containing a finite non-abelian simple subgroup) and of Maurer and Rhodes [18], and in fact gives a constructive proof of the 1974 result Werner [28]. (This also answers an open question posed by Rappe in [23], who in 2004 proved a special case of this result.)
An Improved CAViaR Model for Oil Price Risk
Authors: Dashan Huang, Baimin Yu, Lean Yu, Frank J. Fabozzi, Masao Fukushima
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

As a benchmark for measuring market risk, Value-at-Risk (VaR) reduces the risk associated with any kind of asset to just a number (amount in terms of a currency), which can be well understood by regulators, board members, and other interested parties. This paper employs a new kind of VaR approach due to Engle and Manganelli [4] to forecasting oil price risk. In doing so, we provide two original contributions: introducing a new exponentially weighted moving average CAViaR model and developing a least squares regression model for multi-period VaR prediction.
Comparing Hybrid Versions of SS and DE to Solve a Realistic FAP Problem
Authors: José M. Chaves-González, Marisa Silva Maximiano, Miguel A. Vega-Rodríguez, Juan A. Gómez-Pulido, Juan M. Sánchez-Pérez
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

In this work we study and compare hybrid versions of two different metaheuristics to solve a real-world frequency assignment problem (FAP) in GSM networks. We have used a precise mathematical formulation, developed in published work, in which the frequency plans are evaluated using accurate interference information coming from a real GSM network. Therefore, we focus on solving FAP problem for a realistic-sized, real-world GSM network using a hybrid version of Scatter Search and Differential Evolution algorithms. We have analyzed and fixed both approaches to the FAP problem and, after a detailed statistical study, the obtained results prove that our hybrid approaches compute accurate frequency plans for real-world instances in an optimum way. In fact, our results surpass all the results previously published in the literature.
On Integer Programming and the Branch-Width of the Constraint Matrix
Authors: William H. Cunningham, Jim Geelen
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

Consider an integer program max (c t x : Ax = b, x ¿ 0, x ¿ Z n ) where A ¿ Z m×n , b ¿ Z m , and c ¿ Z n . We show that the integer program can be solved in pseudo-polynomial time when A is non-negative and the column-matroid of A has constant branch-width.