ppxscal/embedding_network huggingface dataset:
Bittorrent is an auction: analyzing and improving bittorrent's incentives
Authors: Dave Levin, Katrina LaCurts, Neil Spring, Bobby Bhattacharjee
Venue: ACM SIGCOMM Computer Communication Review (2008)

Incentives play a crucial role in BitTorrent, motivating users to upload to others to achieve fast download times for all peers. Though long believed to be robust to strategic manipulation, recent work has empirically shown that BitTorrent does not provide its users incentive to follow the protocol. We propose an auction-based model to study and improve upon BitTorrent's incentives. The insight behind our model is that BitTorrent uses, not tit-for-tat as widely believed, but an auction to decide which peers to serve. Our model not only captures known, performance-improving strategies, it shapes our thinking toward new, effective strategies. For example, our analysis demonstrates, counter-intuitively, that BitTorrent peers have incentive to intelligently under-report what pieces of the file they have to their neighbors. We implement and evaluate a modification to BitTorrent in which peers reward one another with proportional shares of bandwidth. Within our game-theoretic model, we prove that a proportional-share client is strategy-proof. With experiments on PlanetLab, a local cluster, and live downloads, we show that a proportional-share unchoker yields faster downloads against BitTorrent and BitTyrant clients, and that under-reporting pieces yields prolonged neighbor interest.
Improving Background Subtraction Based on a Casuistry of Colour-Motion Segmentation Problems
Authors: I. Huerta, D. Rowe, M. Mozerov, J. Gonzàlez
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

The basis for the high-level interpretation of observed patterns of human motion still relies on motion segmentation. Popular approaches based on background subtraction use colour information to model each pixel during a training period. Nevertheless, a deep analysis on colour segmentation problems demonstrates that colour segmentation is not enough to detect all foreground objects in the image, for instance when there is a lack of colour necessary to build the background model. In this paper, our segmentation procedure is based not only on colour, but also on intensity information. Consequently, the intensity model enhances segmentation when the use of colour is not feasible. Experimental results demonstrate the feasibility of our approach.
Agile Software Product Lines - A Working Session
Authors: John D. McGregor
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

Agile software development and software product line engineering are both successful approaches to the development of software-intensive products, but can the planning driven approach of product lines be effectively integrated with the opportunistic approach of agile techniques? This is a difficult question to answer since each broad strategy refers to a family of possible methods. It is a sufficiently interesting question to have been the subject of a workshop at SPLC 2006 and a journal special issue.
Existence of triple positive solutions for a third-order three-point boundary value problem
Authors: Yongping Sun
Venue: Journal of Computational and Applied Mathematics (2008)

In this paper we investigate the existence of triple positive solutions for the nonlinear third-order three-point boundary value problem u^@?(t)=a(t)f(t,u(t),u^'(t),u^''(t)),0[0,~),q:(0,1)->[0,~) are continuous. First, Green's function for the associated linear boundary value problem is constructed, and then, by using a fixed-point theorem due to Avery and Peterson, we establish results on the existence of triple positive solutions to the boundary value problem.
Single Data Copying for MPI Communication Optimization on Shared Memory System
Authors: Qiankun Miao, Guangzhong Sun, Jiulong Shan, Guoliang Chen
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Shared memory system is an important platform for high performance computing. In traditional parallel programming, message passing interface (MPI) is widely used. But current implementation of MPI doesn't take full advantage of shared memory for communication. A double data copying method is used to copy data to and from system buffer for message passing. In this paper, we propose a novel method to design and implement the communication protocol for MPI on shared memory system. The double data copying method is replaced by a single data copying method, thus, message is transferred without the system buffer. We compare the new communication protocol with that in MPICH an implementation of MPI. Our performance measurements indicate that the new communication protocol outperforms MPICH with lower latency. For Point-to-Point communication, the new protocol performs up to about 15 times faster than MPICH, and it performs up to about 300 times faster than MPICH for collective communication.
A System Supporting Users of Cultural Resource Management Semantic Portals
Authors: Andrea Bonomi, Glauco Mantegari, Alessandro Mosca, Matteo Palmonari, Giuseppe Vizzari
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

Cultural Resource Management (CRM) represents an interesting application domain for innovative approaches, models and technologies developed by computer science researchers. This paper presents NavEditOW, a system for the navigation, query and updating of ontologies through the web, as a tool providing suitable functionalities for the design and development of semantic portals in the CRM area. NavEditOW supports ontology maintainers, content editors, and end-users, that have little or no specific knowledge on Semantic Web technologies and on related formal tools. A description of the application of the tool to the representation and management of archaeological knowledge for the description of publications in an e-library is also provided.
Privacy-preserving multimodal person and object identification
Authors: Oleksiy Koval, Sviatoslav Voloshynovskiy, Thierry Pun
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

In this paper we investigate multimodal biometric person and object identification. We model this process of multimodal identification as multimodal multiple hypothesis testing with independent modalities. We analyze theoretical performance limits that can be attained in such a multimodal protocol in terms of exponents of average error probability. Furthermore, we address a privacy related issues in this paper. In particular, we consider performance/privacy trade-off due to the indirect multimodal identification performed in a secret subspace and approximate the obtained performance limits using properties of random projections. Finally, a set of experiments exemplifies our findings.
A Device Management Framework for Secure Ubiquitous Service Delivery
Authors: Adrian Leung, Chris J. Mitchell
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

In a mobile ubiquitous environment, service interactions between a user device and a service provider should be secure, regardless of the type of device used to access or consume a service. We present a Secure Device Management Framework (SDMF), designed to securely deliver services to user devices, whilst also hiding (some of) the complexity of security management from users. Key to this framework is the Device Management Entity (DME), that manages a user device's security credentials, and interacts with service providers on its behalf. This framework also provides users with assurance that a compromised device cannot consume the delivered service, and, at the same time, prevents users from illegally sharing their credentials with other users. We achieve these objectives using Trusted Computing functionality and certain other security mechanisms.
Evading Anomaly Detection through Variance Injection Attacks on PCA
Authors: Benjamin I. Rubinstein, Blaine Nelson, Ling Huang, Anthony D. Joseph, Shing-Hon Lau, Nina Taft, J. D. Tygar
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

Whenever machine learning is applied to security problems, it is important to measure vulnerabilities to adversaries who poison the training data. We demonstrate the impact of variance injection schemes on PCA-based network-wide volume anomaly detectors, when a single compromised PoP injects chaff into the network. These schemes can increase the chance of evading detection by sixfold, for DoS attacks.
Efficient Algorithms for Computing Nœther Normalization
Authors: Amir Hashemi
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

In this paper, we provide first a new algorithm for testing whether a monomial ideal is in Nœther position or not, without using its dimension, within a complexity which is quadratic in input size. Using this algorithm, we provide also a new algorithm to put an ideal in this position within an incremental (one variable after the other) random linear change of the last variables without using its dimension. We describe a modular (probabilistic) version of these algorithms for any ideal using the modular method used in [2] with some modifications. These algorithms have been implemented in the distributed library noether.lib [17] of Singular, and we evaluate their performance via some examples. 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
Partially Connected Networks: Information Theoretically Secure Protocols and Open Problems (Invited Talk)
Authors: Juan A. Garay
Venue: Proceedings of the 3rd international conference on Information Theoretic Security (2008)

We consider networks (graphs) that are not fully connected, and where some of the nodes may be corrupted (and thus misbehave in arbitrarily malicious and coordinated ways) by a computationally unbounded adversary. It is well known that some fundamental tasks in information-theoretic security, such as secure communication (perfectly secure message transmission) [4], broadcast (a.k.a. Byzantine agreement) [7], and secure multi-party computation [1,2], are possible if and only the network has very large connectivity--specifically, ¿(t), where t is an upper bound on the number of corruptions [3,4]. On the other hand, typically in practical networks most nodes have a small degree, independent of the size of the network; thus, it is unavoidable that some of the nodes will be unable to perform the required task.The notion of computation in such settings was introduced in [5], where achieving Byzantine agreement with a low number of exceptions on several classes of graphs was considered, and more recently studied in [6,8] with regards to secure multi-party computation.In this talk we review several protocols for the above tasks, and point out some interesting problems for future research.
On the Use of MLP Features for Broadcast News Transcription
Authors: Petr Fousek, Lori Lamel, Jean-Luc Gauvain
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

Multi-Layer Perceptron (MLP) features have recently been attracting growing interest for automatic speech recognition due to their complementarity with cepstral features. In this paper the use of MLP features is evaluated in a large vocabulary continuous speech recognition task, exploring different types of MLP features and their combination. Cepstral features and three types of Bottle-Neck MLP features were first evaluated without and with unsupervised model adaptation using models with the same number of parameters. When used with MLLR adaption on a broadcast news Arabic transcription task, Bottle-Neck MLP features perform as well as or even slightly better than a standard 39 PLP based front-end. This paper also explores different combination schemes (feature concatenations, cross adaptation, and hypothesis combination). Extending the feature vector by combining various feature sets led to a 9% relative word error rate reduction relative to the PLP baseline. Significant gains are also reported with both ROVER hypothesis combination and cross-model adaptation. Feature concatenation appears to be the most efficient combination method, providing the best gain with the lowest decoding cost.
Autonomous monitoring of vulnerable habitats using a wireless sensor network
Authors: Tomasz Naumowicz, Robin Freeman, Andreas Heil, Martin Calsyn, Eric Hellmich, Alexander Brändle, Tim Guilford, Jochen Schiller
Venue: Proceedings of the workshop on Real-world wireless sensor networks (2008)

In the natural sciences, researchers use a variety of techniques that rely on extensive man-hours and can therefore be difficult to scale. This obviously limits questions that concern large spatial scales or that involve large numbers of animals. Here, we describe the design and deployment of a wireless sensor network that delivers high resolution sensor data while monitoring seabirds on a UK National Nature Reserve. We describe some of the problems encountered and the solutions we have used. In general, the network has successfully demonstrated its utility in a real world scenario and will be extended and enhanced for the coming field season.
The Temporal Logic of Rewriting: A Gentle Introduction
Authors: José Meseguer
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

This paper presents the temporal logic of rewriting $\mathit{TLR}^{\ast}$. Syntactically, $\mathit{TLR}^{\ast}$ is a very simple extension of $\mathit{CTL}^{\ast}$ which just adds action atoms, in the form of spatial action patterns, to $\mathit{CTL}^{\ast}$. Semantically and pragmatically, however, when used together with rewriting logic as a "tandem" of system specification and property specification logics, it has substantially more expressive power than purely state-based logics like $\mathit{CTL}^{\ast}$, or purely action-based logics like A-$\mathit{CTL}^{\ast}$. Furthermore, it avoids the system/property mismatch problem experienced in state-based or action-based logics, which makes many useful properties inexpressible in those frameworks without unnatural changes to a system's specification. The advantages in expresiveness of $\mathit{TLR}^{\ast}$ are gained without losing the ability to use existing tools and algorithms to model check its properties: a faithful translation of models and formulas is given that allows verifying $\mathit{TLR}^{\ast}$ properties with $\mathit{CTL}^{\ast}$ model checkers.
Optimization Models of Pricing Hydro-thermal Trade Based on Energy Economics
Authors: Guangjuan Chen, Zhongfu Tan, Jie Zhao, Jianxun Qi, Li Li
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

An Optimization model of pricing hydro-thermal trade is presented in day-ahead market of electricity, which object is to maximize the social benefit increment. And an algorithm of the model is given using heuristics algorithm. Example indicates that the model and algorithm are feasible.
An Automated Validation Method for Security Policies: The Firewall Case
Authors: Ryma Abassi, Sihem Guemara El Fatmi
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

Research in computer security issues has recently addressed the development of Security Policy specification languages. It has however omitted the need of formal validation. In this paper we try to remedy to this drawback by the proposition of an automated tool for security policies. Because we have found several similarities between security policies and software engineering, our approach is strongly inspired from the reasoning followed in the software engineering. First, it brings out a model inspired by Promela to enable the validation task. Secondly, it proposes a 3-step validation process that deals with consistency, completeness and preservation of safety and liveness properties.
Estimates of Network Complexity and Integral Representations
Authors: Paul C. Kainen, Věra Kůrková
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Upper bounds on rates of approximation by neural networks are derived for functions representable as integrals in the form of networks with infinitely many units. The bounds are applied to perceptron networks.
Multiobjective target setting in data envelopment analysis using AHP
Authors: Sebastián Lozano, Gabriel Villa
Venue: Computers and Operations Research (2009)

In this paper two new target setting DEA approaches are proposed. The first one is an interactive multiobjective method that at each step of the process asks the decision maker (DM) which inputs and outputs he wishes to improve, which ones are allowed to worsen and which ones should stay at their current level. The local relative priorities of these inputs and outputs changes are computed using the analytic hierarchy process (AHP). After obtaining the candidate target, the DM can update his preferences for improving, worsening or maintaining current inputs and outputs levels and obtain a new candidate target. Thus continuing, until a satisfactory operating point is computed. The second method proposed uses a lexicographic multiobjective approach in which the DM specifies a priori a set of priority levels and, using AHP, the relative importance given to the improvements of the inputs and outputs at each priority level. This second approach requires solving a series of models in order, one model for each priority level. The models do not allow for worsening of neither inputs nor outputs. After the lowest priority model has been solved the corresponding target operating point is obtained. The application of the proposed approach to a port logistics problem is presented.
From Top Coders to Top IT Professionals
Authors: Krzysztof Diks, Jan Madey
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

This paper presents the history of successes of young Poles in the field of computer science (particularly, in programming) in the past 15 years and indicates the grounds for their outstanding achievements. We will also discuss conditions which should be fulfilled in order for successes of young computer scientists to evolve into achievements in their professional life, corresponding to their abilities and ambition. It seems that Polish experiences are universal enough to be adopted also by some other countries and could be helpful in the process of selecting gifted IT students and in work with them.
Analysis of Negotiation Dynamics
Authors: Koen Hindriks, Catholijn M. Jonker, Dmytro Tykhonov
Venue: Proceedings of the 11th international workshop on Cooperative Information Agents XI (2007)

The process of reaching an agreement in a bilateral negotiation to a large extent determines that agreement. The tactics of proposing an offer and the perception of offers made by the other party determine how both parties engage each other and, as a consequence, the kind of agreement they will establish. It thus is important to gain a better understanding of the tactics and potential other factors that play a role in shaping that process. A negotiation, however, is typically judged by the efficiency of the outcome. The process of reaching an outcome has received less attention in literature and the analysis of the negotiation process is typically not as rigorous nor is it based on formal tools. Here we present an outline of a formal toolbox to analyze and study the dynamics of negotiation based on an analysis of the types of moves parties to a negotiation can make while exchanging offers. This toolbox can be used to study both the performance of human negotiators as well as automated negotiation systems.
Stock Prediction Using FCMAC-BYY
Authors: Jiacai Fu, Kok Siong Lum, Minh Nhut Nguyen, Juan Shi
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

The increasing reliance on Computational Intelligence applications to predict stock market positions have resulted in numerous researches in financial forecasting and trading trend identifications. Stock market price prediction applications are required to be adaptive to new incoming data as well as have fast learning capabilities due to the volatility nature of market movements. This paper analyses stock market price prediction based on a Fuzzy Cerebellar Model Articulation Controller --- Bayesian Ying Yang (FCMAC-BYY) neural network. The model is motivated from the Chinese ancient Ying-Yang philosophy which states that everything in the universe can be viewed as a product of a constant conflict between opposites, Ying and Yang. A perfect status is reached if Ying and Yang achieves harmony. The analyzed experiment on a set of real stock market data (Singapore Airlines Ltd --- SIA) in the Singapore Stock Exchange (SGX) and Ibex35 stock index shows the effectiveness of the FCMAC-BYY in the universal approximation and prediction.
On the Complexity of Equilibria Problems in Angel-Daemon Games
Authors: Joaquim Gabarro, Alina García, Maria Serna
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or grid orchestration on a faulty environment with bounded amount of failures [6]. It turns out that Angel-Daemon games are, at the best of our knowledge, the first natural example of zero-sum succinct games in the sense of [1],[9]. We show that deciding the existence of a pure Nash equilibrium or a dominant strategy for a given player is $\mathsf{\Sigma}^p_2$-complete. Furthermore, computing the value of an Angel-Daemon game is EXP-complete. Thus, matching the already known complexity results of the corresponding problems for the generic families of succinctly represented games with exponential number of actions.
Web Services Discovery Utilizing Semantically Annotated WSDL
Authors: Jorge Cardoso, John A. Miller, Savitha Emani
Venue: Reasoning Web: 4th International Summer School 2008, Venice, Italy, September 7-11, 2008, Tutorial Lectures (2008)

To make semantic Web services accessible to users, providers use registries to publish them. Unfortunately, the current registries use discovery mechanisms which are inefficient, as they do not support discovery based on the semantics of the services and thus lead to a considerable number of irrelevant matches. Semantic discovery and matching of services is a promising approach to address this challenge. This paper presents an algorithm to match a semantic Web service request described with SAWSDL against semantic Web service advertisements. The algorithm is novel in three fundamental aspects. First, the similarity among semantic Web service properties, such as inputs and outputs, is evaluated using Tversky's model which is based on concepts (classes), their semantic relationships, and their common and distinguishing features (properties). Second, the algorithm, not only takes into account services' inputs and outputs, but it also considers the functionality of services. Finally, the algorithm is able to match a semantic Web service request against advertisements that are annotated with concepts that are with or without a common ontological commitment. In other words, it can evaluate the similarity of concepts defined in the context of different ontologies.