pinecone/core-2020-05-10-deduplication huggingface dataset:
Human Interactions in Electronic Institutions

Every social network has its own fixed, but different, set of rules that apply to all users. This reflects the fact that in real life every community has different norms depending on the relationships between its members. Unfortunately this has required people to create many different social networks that exist next to each other even though they have largely overlapping sets of members. In this paper we argue that Electronic Institutions (EI) solve this problem by allowing to create a generic social network in which users can set up their own sub-communities with their own particular norms and protocols. Electronic Institutions make it easy for users to specify these protocols and norms in a visual way, and adapt them when necessary. Furthermore we present a new framework on top of the existing EI architecture that allows humans to interact in any EI. It can generate a graphic user interface from the institution-specification without the requirement of any extra programming or design. However, it still allows designers to design a more sophisticated, domain specific GUI.This work is supported by the Agreement Technologies CONSOLIDER project, and CHIST-ERA project ACE, EU project 318770 PRAISE, and the CBIT project (TIN2010-16306).Peer Reviewe
The hierarchical organisation of cortical and basal-ganglia systems: a computationally-informed review and integrated hypothesis

To suitably adapt to the challenges posed by reproduction and survival, animals need to learn to select when to perform different behaviours, to have internal criteria for guiding these learning processes, and to perform behaviours efficiently once selected. To implement these processes, their brain must be organised in a suitable hierarchical fashion. Here we briefly review two types of neural/behavioural/computational literatures, focussed respectively on cortex and on sub-cortical areas, and highlight their important limitations. Then we review two computational modelling works of the authors that exemplify the problems, brain areas, experiments, main concepts and limitations of the two research threads. Finally we propose a theoretical integration of the two views, showing how this allows to solve most of the problems found by the two accounts if taken in isolation. The overall picture that emerges is that the cortical and the basal ganglia systems form two highly-organised hierarchical systems working in close synergy and jointly solving all the challenges of choice, selection, and implementation needed to acquire and express adaptive behaviour
Context-aware movie recommendations: An empirical comparison of pre-filtering, post-filtering and contextual modeling approaches

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-39878-0_13Proceedings of 14th International Conference, EC-Web 2013, Prague, Czech Republic, August 27-28, 2013.Context-aware recommender systems have been proven to improve the performance of recommendations in a wide array of domains and applications. Despite individual improvements, little work has been done on comparing different approaches, in order to determine which of them outperform the others, and under what circumstances. In this paper we address this issue by conducting an empirical comparison of several pre-filtering, post-filtering and contextual modeling approaches on the movie recommendation domain. To acquire confident contextual information, we performed a user study where participants were asked to rate movies, stating the time and social companion with which they preferred to watch the rated movies. The results of our evaluation show that there is neither a clear superior contextualization approach nor an always best contextual signal, and that achieved improvements depend on the recommendation algorithm used together with each contextualization approach. Nonetheless, we conclude with a number of cues and advices about which particular combinations of contextualization approaches and recommendation algorithms could be better suited for the movie recommendation domain.This work was supported by the Spanish Government
(TIN2011-28538-C02) and the Regional Government of Madrid (S2009TIC-1542
An emotion dimensional model based on social tags: Crossing folksonomies and enhancing recommendations

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-39878-0_9Proceedings of 14th International Conference, EC-Web 2013, Prague, Czech Republic, August 27-28, 2013.In this paper we present an emotion computational model based on social tags. The model is built upon an automatically generated lexicon that describes emotions by means of synonym and antonym terms, and that is linked to multiple domain-specific emotion folksonomies extracted from entertainment social tagging systems. Using these cross-domain folksonomies, we develop a number of methods that automatically transform tag-based item profiles into emotion-oriented item profiles. To validate our model we report results from a user study that show a high precision of our methods to infer the emotions evoked by items in the movie and music domains, and results from an offline evaluation that show accuracy improvements on model-based recommender systems that incorporate the extracted item emotional information.This work was supported by the Spanish Government
(TIN2011-28538-C02) and the Regional Government of Madrid (S2009TIC-1542)
Risks of Offline Verify PIN on Contactless Cards

Contactless card payments are being introduced around the world al- lowing customers to use a card to pay for small purchases by simply placing the card onto the Point of Sale terminal. Contactless transactions do not require veri- fication of the cardholder’s PIN. However our research has found the redundant verify PIN functionality is present on the most commonly issued contactless credit and debit cards currently in circulation in the UK. This paper presents a plausible attack scenario which exploits contactless verify PIN to give unlimited attempts to guess the cardholder’s PIN without their knowledge. It also gives experimental data to demonstrate the practical viability of the attack as well as references to support our argument that contactless verify PIN is redundant functionality which compromises the security of payment cards and the cardholder
Detection of Masqueraded Wireless Access Using 802.11 MAC Layer Fingerprints

<p>Many wireless Internet access operators prefer open local area network (WLAN) access because this reduces the need for user assistance for a variety of smaller devices. A 802.11 MAC spoofer masquerades as an authorized user and gains access by using an already whitelisted MAC address. We consider the scenario where the spoofer waits until the authorized user has finished the session, and then uses the still whitelisted MAC address for the network access. We propose and experiment with “implementation fingerprints” that can be used to detect MAC layer spoofing in this setting. We include eight different tests in the detection algorithm, resulting in 2.8 in average Hamming distance of the tests. Eleven different STA devices are tested with promising detection results. No precomputed database of fingerprints is needed.</p
The relationship between stress and conflict handling style in an ODR environment

Serie : Lecture notes in computer science, vol. 7856, ISSN 0302-9743Up until now, most approaches to Online Dispute Resolution
focused on "traditional" problems such as the generation of solutions,
the support to negotiation or the definition of strategies. Although these
problems are evidently valid and important ones, research should also
start to consider new potential issues that arise from technological evolution.
In this paper we analyse the new challenges that emerge from
resolving conflicts over telecommunications, namely in what concerns
the lack of contextual information about parties. Specifically we build
on a previous approach to stress estimation from the analysis of interaction
and behavioural patterns. From the data gathered in a previous
experiment we now trained classifiers that allow to assess stress in realtime,
in a personalized and empirical way. With these classifiers, we were
able to study how stress and conflict coping strategies evolve together.
This paper briefly describes these classifiers, focusing afterwards on the
results of the experiment
Modelling legitimate expectations

Legitimate expectation in the context of culpa in contrahendo is an important legal concept for the study of good faith and the duty to negotiate with good care. However when wanting to model it and reason about it, one finds that most existing legal formalisations do not directly account for the concept. In this paper we present a formal model that can explicitly model and reason about legitimate expectations by extending the formal InstAL legal framework. We demonstrate our extensions with the help of a private law case study which has gained wide popularity in Japanese la
Detecting conflicts in legal systems

When acting in different jurisdictions (e.g. under the laws of different countries) at the same time, it can be of great value for individuals to be able to determine whether disparities among the laws of these different systems exist and allowing them to identify the consequences that may follow from these disparities. For individuals, it is typically not of interest to find all the ways in which these legal systems differ, but rather to establish whether a particular course of action may have different legal interpretations, depending on the jurisdiction. In this paper we present a formal and computational framework that, given specific scenarios (descriptions of courses of action), can automatically detect whether these scenarios could lead to different outcomes. We demonstrate our approach by means of a private international law case-study where a company drafts a contract clause after examining the consequences in the available jurisdictions
Implementation of State Transfer Hamiltonians in Spin Chains with Magnetic Resonance Techniques

Nuclear spin systems and magnetic resonance techniques have provided a fertile platform for experimental investigation of quantum state transfer in spin chains. From the first observation of polarization transfer, predating the formal definition of quantum state transfer, to the realization of state transfer simulations in small molecules and in larger solid-state spin systems, the experiments have drawn on the strengths of nuclear magnetic resonance (NMR), in particular on its long history of well-developed control techniques. NMR implementations have been invaluable both as proof-of-principle demonstrations of quantum state transfer protocols and to explore dynamics occurring in real systems that go beyond what can be analytically solved or numerically simulated. In addition, control techniques developed in these systems to engineer the Hamiltonians required for transport can be adopted in potentially scalable quantum information processing architectures. In this contribution we describe recent results and outline future directions of research in magnetic-resonance based implementations of quantum state transfer in spin chains.National Science Foundation (U.S.) (Grant DMR-1005926)United States. Air Force Office of Scientific Researc
Handling Parallelism in a Concurrency Model

Programming models for concurrency are optimized for dealing with
nondeterminism, for example to handle asynchronously arriving events. To shield
the developer from data race errors effectively, such models may prevent shared
access to data altogether. However, this restriction also makes them unsuitable
for applications that require data parallelism. We present a library-based
approach for permitting parallel access to arrays while preserving the safety
guarantees of the original model. When applied to SCOOP, an object-oriented
concurrency model, the approach exhibits a negligible performance overhead
compared to ordinary threaded implementations of two parallel benchmark
programs.Comment: MUSEPAT 201
Cliff-Edge Consensus: Agreeing on the Precipice

International audienceThis paper presents a new form of consensus that allows nodes to agree locally on the extent of crashed regions in networks of arbitrary size. One key property of our algorithm is that it shows local complexity, i.e. its cost is independent of the size of the complete system, and only depends on the shape and extent of the crashed region to be agreed upon. In this paper, we motivate the need for such an algorithm, formally define this new consensus problem, propose a fault-tolerant solution, and prove its correctness
A Simple Separation Logic

The kinds of models that are usually considered in separation logic are structures such as words, trees, and more generally pointer structures (heaps). In this paper we introduce the separation logic of much simpler structures, viz. sets. The models of our set separation logic are nothing but valuations of classical propositional logic. Separating a valuation V consists in splitting it up into two partial valuations v 1 and v 2. Truth of a formula φ 1 * φ 2 in a valuation V can then be defined in two different ways: first, as truth of φ 1 in all total extensions of v 1 and truth of φ 2 in all total extensions of v 2; and second, as truth of φ 1 in some total extension of v 1 and truth of φ 2 in some total extension of v 2. The first is an operator of separation of resources: the update of φ 1 * φ 2 by ψ is the conjunction of the update of φ 1 by ψ and the update of φ 2 by ψ; in other words, φ 1 * φ 2 can be updated independently. The second is an operator of separation of processes: updates by ψ 1 * ψ 2 can be performed independently. We show that the satisfiability problem of our logic is decidable in polynomial space (PSPACE). We do so by embedding it into dynamic logic of propositional assignments (which is PSPACE complete). We moreover investigate its applicability to belief update and belief revision, where the separation operators allow to formulate natural requirements on independent pieces of information
Broadband cavity-enhanced absorption spectroscopy with incoherent light

Although broadband incoherent light does not efficiently couple into a high-finesse optical cavity, its transmission is readily detectable and enables applications in cavity-enhanced absorption spectroscopy in the gas phase, liquid phase and on surfaces. This chapter gives an overview of measurement principles and experimental approaches implementing incoherent light sources in cavity-enhanced spectroscopic applications. The general principles of broadband CEAS are outlined and general “pros and cons” discussed, detailing aspects like cavity mirror reflectivity calibration or the establishment of detection limits. Different approaches concerning light sources, cavity design and detection schemes are discussed and a comprehensive overview of the current literature based on a methodological classification scheme is also presented
Geometric quantization of complex Monge-Ampère Operator for certain diffusion flows

Slides disponibles sur http://www.i2m.univ-amu.fr/~jkeller/Papers/GSI13-slides.pdfInternational audienceCertain natural geometric evolution flows for Kahler metrics have been interpreted as anisotropic filtering operators. These flows are typicallygiven by highly non linear PDE and involve usually transcendental and non-constructive techniques. The main objective of this note is to show that incertain cases, Geometric Quantization theory helps to overcome these difficulties and provides new algorithms based on S.K. Donaldson’s ideas
Studying new classes of graph metrics

In data analysis, there is a strong demand for graph metrics that differ from
the classical shortest path and resistance distances. Recently, several new
classes of graph metrics have been proposed. This paper presents some of them
featuring the cutpoint additive distances. These include the path distances,
the reliability distance, the walk distances, and the logarithmic forest
distances among others. We discuss a number of connections between these and
other distances.Comment: Prepared for the Proceedings of GSI2013 - Geometric Science of
  Information (August 28-30, 2013, Paris). 9 pages, 1 figur
Integral Geometry of Linearly Combined Gaussian and Student-t, and Skew Student's t Random Fields

International audienceThe integral geometry of random fields has been investigated since the 1980s, and the analytic formulae of the Minkowski functionals (also called Lipschitz-Killing curvatures, shortly denoted LKCs) of their excursion sets on a compact subset <i>S</i> in the <i>n</i>-dimensional Euclidean space have been reported in the specialized literature for Gaussian and student-<i>t</i> random fields. Very recently, explicit analytical formulae of the Minkowski functionals of their excursion sets in the bi-dimensional case (<i>n</i> = 2) have been defined on more sophisticated random fields, namely: the <i>Linearly Combined Gaussian and Student-t</i>, and the <i>Skew Student-t random fields</i>. This paper presents the theoretical background, and gives the explicit analytic formulae of the three Minkowski functionals. Simulation results are also presented both for illustration and validation, together with a real application example on an worn engineered surface
Some results on a χ-divergence, an extended Fisher information and generalized Cramér-Rao inequalities

International audienceWe propose a modified χ<sup>β</sup>-divergence, give some of its properties, and show that this leads to the definition of a generalized Fisher information. We give generalized Cramér-Rao inequalities, involving this Fisher information, an extension of the Fisher information matrix, and arbitrary norms and power of the estimation error. In the case of a location parameter, we obtain new characterizations of the generalized q-Gaussians, for instance as the distribution with a given moment that minimizes the generalized Fisher information. Finally we indicate how the generalized Fisher information can lead to new uncertainty relations
A Riemannian Geometry in the q-Exponential Banach Manifold Induced by q-Divergences

For the family of non-parametric q-exponential statistical models, in a former paper, written by the same authors, a differentiable Banach manifold modelled on Lebesgue spaces of real random variables has been built. In this paper, the geometry induced on this manifold is characterized by q-divergence functionals. This geometry turns out to be a generalization of the geometry given by Fisher information metric and Levi-Civita connections. Moreover, the classical Amari’s α-connections appears as special case of the q −connections ∇ (q). The main result is the expected one, namely the zero curvature of the manifold.
 







Loading...









Geometric Science of InformationGeometric Science of Information
Look 
 Inside 


Chapter Metrics

Downloads1K
Provided by Bookmetrix  





Other actions

Export citation 


About this Book 


Reprints and Permissions


Add to Papers



Share
Share this content on Facebook Share this content on Twitter Share this content on LinkedI
Geometric mean algorithms based on harmonic and arithmetic iterations

The geometric mean of a series of positive numbers a1,...,an
is defined as the nth root of its product. Generalizing this
concept to positive definite matrices is not straightforward due to the noncommutativity. Based on a list of desired properties –the ALM-list– initially some recursive algorithms were proposed. Unfortunately, these algorithms were typically quite time consuming. A novel optimization based approach leads to the concept of the Karcher mean and is nowadays favored as the generalization towards matrices of the geometric mean.
It is not so well-known that one can design for two scalars an algorithm quadratically convergent to the geometric mean, solely relying on arithmetic and harmonic means. The procedure is straightforward, compute the arithmetic and harmonic mean, and iterate this procedure with these newly computed means.
Apparently, this procedure also works for two matrices. In these notes, we will propose a whole series of fast possible generalizations, and conduct numerical experiments with these algorithms. Unfortunately most of them do not satisfy all imposed ALM-constraints, but on the other hand, they converge rapidly and approximate the Karcher mean. As
such they can be used to initiate manifold optimization procedures for computing the Karcher mean.status: publishe
Structural Evaluation of AES and Chosen-Key Distinguisher of 9-Round AES-128

International audienceWhile the symmetric-key cryptography community has now a good experience on how to build a secure and efficient fixed permutation, it remains an open problem how to design a key-schedule for block ciphers, as shown by the numerous candidates broken in the related-key model or in a hash function setting. Provable security against differential and linear cryptanalysis in the related-key scenario is an important step towards a better understanding of its construction. Using a structural analysis, we show that the full AES-128 cannot be proven secure unless the exact coefficients of the MDS matrix and the S-Box differential properties are taken into account since its structure is vulnerable to a related-key differential attack. We then exhibit a chosen-key distinguisher for AES-128 reduced to 9 rounds, which solves an open problem of the symmetric community. We obtain these results by revisiting algorithmic theory and graph-based ideas to compute all the best differential characteristics in SPN ciphers, with a special focus on AES-like ciphers subject to related-keys. We use a variant of Dijkstra's algorithm to efficiently find the most efficient related-key attacks on SPN ciphers with an algorithm linear in the number of rounds
A Uniform Min-Max Theorem with Applications in Cryptography

We present a new, more constructive proof of von Neumann’s Min-Max Theorem for two-player zero-sum game — specifically, an algorithm that builds a near-optimal mixed strategy for the second player from several best-responses of the second player to mixed strategies of the first player. The algorithm extends previous work of Freund and Schapire (Games and Economic Behavior ’99) with the advantage that the algorithm runs in poly(n) time even when a pure strategy for the first player is a distribution chosen from a set of distributions over {0, 1}\(^n\) . This extension enables a number of additional applications in cryptography and complexity theory, often yielding uniform security versions of results that were previously only proved for nonuniform security (due to use of the non-constructive Min-Max Theorem).
We describe several applications, including a more modular and improved uniform version of Impagliazzo’s Hardcore Theorem (FOCS ’95), showing impossibility of constructing succinct non-interactive arguments (SNARGs) via black-box reductions under uniform hardness assumptions (using techniques from Gentry and Wichs (STOC ’11) for the nonuniform setting), and efficiently simulating high entropy distributions within any sufficiently nice convex set (extending a result of Trevisan, Tulsiani and Vadhan (CCC ’09)).Engineering and Applied Science
FLEX-MPI: An MPI Extension for Supporting Dynamic Load Balancing on Heterogeneous Non-dedicated Systems

This paper introduces FLEX-MPI, a novel runtime approach for the dynamic load balancing of MPI-based SPMD applications running on heterogeneous platforms in the presence of dynamic external loads. To effectively balance the workload, FLEX-MPI monitors the actual performance of applications via hardware counters and the MPI profiling interface—with a negligible overhead and minimal code modifications. Our results show that by using this approach the execution time of an application may be significantly reduced.This work has been partially supported by the Spanish Ministry of Science under the grant IPT-430000-2010-14.Peer ReviewedPostprint (author's final draft