pinecone/core-2020-05-10-deduplication huggingface dataset:
Explicating ways of consensus-making in science and society: distinguishing the academic, the interface and the meta-consensus

In this chapter, we shed new light on the epistemic struggle between establishing consensus and acknowledging plurality, by explicating different ways of consensus-making in science and society and examining the impact hereof on their field of intersection, i.e. consensus conferences (in particular those organized by the National Institute of Health). We draw a distinction between, what we call, academic and interface consensus, to capture the wide appeal to consensus in existing literature. We investigate such accounts - i.e. from Miriam Solomon, John Beatty and Alfred Moore, and Boaz Miller - as to put forth a new understanding of consensus-making, focusing on the meta-consensus. We further defend how (NIH) consensus conferences enable epistemic work, through demands of epistemic adequacy and contestability, contrary to the claim that consensus conferences miss a window for epistemic opportunity (Solomon M, The social epistemology of NIH consensus conferences. In: Kincaid H, McKitrick J (ed) Establishing medical reality: methodological and metaphysical issues in philosophy of medicine. Springer, Dordrecht, 2007). Paying attention to the dynamics surrounding consensus, moreover, allows us to illustrate how the public understanding of science and the public use of the ideal of consensus could be well modified
Probabilistic Diffeomorphic Registration: Representing Uncertainty

This paper presents a novel mathematical framework for representing
uncertainty in large deformation diffeomorphic image registration. The Bayesian
posterior distribution over the deformations aligning a moving and a fixed
image is approximated via a variational formulation. A stochastic differential
equation (SDE) modeling the deformations as the evolution of a time-varying
velocity field leads to a prior density over deformations in the form of a
Gaussian process. This permits estimating the full posterior distribution in
order to represent uncertainty, in contrast to methods in which the posterior
is approximated via Monte Carlo sampling or maximized in maximum a-posteriori
(MAP) estimation. The frame-work is demonstrated in the case of landmark-based
image registration, including simulated data and annotated pre and
intra-operative 3D images
Proving termination of programs automatically with AProVE

AProVE is a system for automatic termination and complexity proofs of Java, C, Haskell, Prolog, and term rewrite systems (TRSs). To analyze programs in high-level languages, AProVE automatically converts them to TRSs. Then, a wide range of techniques is employed to prove termination and to infer complexity bounds for the resulting TRSs. The generated proofs can be exported to check their correctness using automatic certifiers. For use in software construction, we present an AProVE plug-in for the popular Eclipse software development environment
Proving termination and memory safety for programs with Pointer Arithmetic

Proving termination automatically for programs with explicit pointer arithmetic is still an open problem. To close this gap, we introduce a novel abstract domain that can track allocated memory in detail. We use it to automatically construct a symbolic execution graph that represents all possible runs of the program and that can be used to prove memory safety. This graph is then transformed into an integer transition system, whose termination can be proved by standard techniques. We implemented this approach in the automated termination prover AProVE and demonstrate its capability of analyzing C programs with pointer arithmetic that existing tools cannot handle
Optimal Tableaux Method for Constructive Satisfiability Testing and
  Model Synthesis in the Alternating-time Temporal Logic ATL+

We develop a sound, complete and practically implementable tableaux-based
decision method for constructive satisfiability testing and model synthesis in
the fragment ATL+ of the full Alternating time temporal logic ATL*. The method
extends in an essential way a previously developed tableaux-based decision
method for ATL and works in 2EXPTIME, which is the optimal worst case
complexity of the satisfiability problem for ATL+ . We also discuss how
suitable parametrizations and syntactic restrictions on the class of input ATL+
formulae can reduce the complexity of the satisfiability problem.Comment: 45 page
Clausal Resolution for Modal Logics of Confluence

We present a clausal resolution-based method for normal multimodal logics of
confluence, whose Kripke semantics are based on frames characterised by
appropriate instances of the Church-Rosser property. Here we restrict attention
to eight families of such logics. We show how the inference rules related to
the normal logics of confluence can be systematically obtained from the
parametrised axioms that characterise such systems. We discuss soundness,
completeness, and termination of the method. In particular, completeness can be
modularly proved by showing that the conclusions of each newly added inference
rule ensures that the corresponding conditions on frames hold. Some examples
are given in order to illustrate the use of the method.Comment: 15 pages, 1 figure. Preprint of the paper accepted to IJCAR 201
The Fractal Dimension of SAT Formulas

Modern SAT solvers have experienced a remarkable progress on solving
industrial instances. Most of the techniques have been developed after an
intensive experimental testing process. Recently, there have been some attempts
to analyze the structure of these formulas in terms of complex networks, with
the long-term aim of explaining the success of these SAT solving techniques,
and possibly improving them.
  We study the fractal dimension of SAT formulas, and show that most industrial
families of formulas are self-similar, with a small fractal dimension. We also
show that this dimension is not affected by the addition of learnt clauses. We
explore how the dimension of a formula, together with other graph properties
can be used to characterize SAT instances. Finally, we give empirical evidence
that these graph properties can be used in state-of-the-art portfolios.Comment: 20 pages, 11 Postscript figure
Large-scale security analysis of the web: Challenges and findings

As the web expands in size and adoption, so does the interest of attackers who seek to exploit web applications and exfiltrate user data. While there is a steady stream of news regarding major breaches and millions of user credentials compromised, it is logical to assume that, over time, the applications of the bigger players of the web are becoming more secure. However, as these applications become resistant to most prevalent attacks, adversaries may be tempted to move to easier, unprotected targets which still hold sensitive user data.

In this paper, we report on the state of security for more than 22,000 websites that originate in 28 EU countries. We first explore the adoption of countermeasures that can be used to defend against common attacks and serve as indicators of "security consciousness". Moreover, we search for the presence of common vulnerabilities and weaknesses and, together with the adoption of defense mechanisms, use our findings to estimate the overall security of these websites.
Among other results, we show how a website's popularity relates to the adoption of security defenses and we report on the discovery of three, previously unreported, attack variations that attackers could have used to attack millions of users.status: publishe
jCAPTCHA: Accessible Human Validation

CAPTCHAs are a widely deployed mechanism for ensuring that a web site user is a human, and not a software agent. They ought to be relatively easy for a human to solve, but hard for software to interpret. Most CAPTCHAs are visual, and this marginalises users with visual impairments. A variety of audible CAPTCHAs have been trialled but these have not been very successful, largely because they are easily interpreted by automated tools and, at the same time, tend to be too challenging for the very humans they are supposed to verify. In this paper an alternative audio CAPTCHA, jCAPTCHA (Jumbled Words CAPTCHA), is presented. We report on the evaluation of jCAPTCHA by 272 human users, of whom 169 used screen readers, both in terms of usability and resistance to software interpretation
Communication System for Persons with Cerebral Palsy In Situ Observation of Social Interaction Following Assisted Information Request

International audiencePeople with disabilities may encounter many communication difficulties. Our main goal is to develop a communication system, called COMMOB, designed to assist people with cerebral palsy in different contexts: at home, at work and in public places. After a brief review of the different categories of as-sistive communication systems, our user-centered design approach is presented. It was tested in a public place in the context of a help request by a cerebral palsy person in a wheelchair. The result concerns particularly the response rate. The assistive power of COMMOB was rated from the respondents' and the user's point of view. The main lesson to be learned is that the most difficult was to attract the attention of people and to engage the interaction
Waypoints validation strategies in assisted navigation for visually impaired pedestrian

In Electronic Orientation Aids, the guidance process consists in two steps: first, identify the location of a visually impaired user along the expected trajectory, and second, provide her/him with appropriate instructions on directions to follow, and pertinent information about the surroundings. In urban environment, positioning accuracy is not always optimal and tracking the user's progress along the expected itinerary is often challenging. We present three new waypoint-based validation strategies to track the user's location despite low positioning accuracy. These strategies are evaluated within SIMU4NAV, a multimodal virtual environment subserving the design of Electronic Orientation Aids for visually impaired people. Results show that the proposed strategies are more robust to positioning inaccuracies, and hence more efficient to guide users
Design and evaluation of Multi-function Scanning System : a case study

We present in this paper an assistive technology of communication and command for quadriplegics. To carry out this assistive technology, a user centered design approach with the patient, his occupational therapists and his family was conducted. Various iterative versions of the prototype have been defined by means of the SOKEYTO platform to meet the needs and the abilities of the quadriplegic person. Options carried out and consecutive choice will be reported as well the difficulties to implement. The assistive technology was used by one quadriplegic person. A qualitative evaluation is also reported
EyeSchool: an educational assistive technology for people with disabilities - Passing from single actors to multiple-actor environment

Since 2005, public policy in France has strongly been encouraging young people with disabilities inclusion within the regular school system. This has found a direct application through technical innovation, intended to help students being more independent within their learning activities. In this context, the purpose of this paper is to underline the manner in which using assistive information and communication technologies may improve the inclusive education for people with disabilities. The case study we present underlines the complexity of the social world into which the use of a precise assistive tool takes it place
Earthquake-triggered subaerial landslides that caused large scale fjord sediment deformation : combined subaerial and submarine studies of the 2007 Aysen Fjord event, Chile

On 21 April 2007 (Mw 6.2) an earthquake triggered more than 500 landslides near the\ud
epicenter along the Aysén fjord, Chile. One of the major failures occurred at the Punta Cola\ud
Valley involving a volume of 20.9 million cubic meters of rock. The main rockslide was\ud
followed by a rock/debris avalanche involving talus and glacio-fluvial deposits in the slope\ud
toe and valley floor that added a volume of 7.3 million cubic meters as entrained material.\ud
About half of the material involved in the rockslide-debris avalanche reached the shoreline\ud
and entered the fjord pushing deltaic deposits offshore while inducing a shoreline retreat of\ud
100 m. The impact of the debris avalanche deformed an area of 7.6 km2 of the otherwise\ud
featureless and smooth sedimented fjord floor. The central part of the deformed area is\ud
currently deeper with respect to the undeformed floor, which suggests that between 1 and\ud
10 m of sediment were eroded from an area of 1.85 km2 due to the direct impact of the\ud
avalanche. The combination of debris avalanche impact of this and other landslides,\ud
subaqueous failures and fjord floor deformation generated a series of displacement waves\ud
within the fjord with several meters to tens of meters high run-up along the shoreline.peer-reviewe
Stochastic modeling of excitable dynamics: improved Langevin model for
  mesoscopic channel noise

Influence of mesoscopic channel noise on excitable dynamics of living cells
became a hot subject within the last decade, and the traditional biophysical
models of neuronal dynamics such as Hodgkin-Huxley model have been generalized
to incorporate such effects. There still exists but a controversy on how to do
it in a proper and computationally efficient way. Here we introduce an improved
Langevin description of stochastic Hodgkin-Huxley dynamics with natural
boundary conditions for gating variables. It consistently describes the channel
noise variance in a good agreement with discrete state model. Moreover, we show
by comparison with our improved Langevin model that two earlier Langevin models
by Fox and Lu also work excellently starting from several hundreds of ion
channels upon imposing numerically reflecting boundary conditions for gating
variables.Comment: V.M. Mladenov and P.C. Ivanov (Eds.): NDES 2014, Communications in
  Computer and Information Science, vol. 438 (Springer, Switzerland, 2014), pp.
  325-33
Fixed parameter tractable algorithms in combinatorial topology

To enumerate 3-manifold triangulations with a given property, one typically
begins with a set of potential face pairing graphs (also known as dual
1-skeletons), and then attempts to flesh each graph out into full
triangulations using an exponential-time enumeration. However, asymptotically
most graphs do not result in any 3-manifold triangulation, which leads to
significant "wasted time" in topological enumeration algorithms. Here we give a
new algorithm to determine whether a given face pairing graph supports any
3-manifold triangulation, and show this to be fixed parameter tractable in the
treewidth of the graph.
  We extend this result to a "meta-theorem" by defining a broad class of
properties of triangulations, each with a corresponding fixed parameter
tractable existence algorithm. We explicitly implement this algorithm in the
most generic setting, and we identify heuristics that in practice are seen to
mitigate the large constants that so often occur in parameterised complexity,
highlighting the practicality of our techniques.Comment: 16 pages, 9 figure
Classifying the clique-width of H-free bipartite graphs.

Let G be a bipartite graph, and let H be a bipartite graph with a fixed bipartition (B H ,W H ). We consider three different, natural ways of forbidding H as an induced subgraph in G. First, G is H-free if it does not contain H as an induced subgraph. Second, G is strongly H-free if G is H-free or else has no bipartition (B G ,W G ) with B H  ⊆ B G and W H  ⊆ W G . Third, G is weakly H-free if G is H-free or else has at least one bipartition (B G ,W G ) with TeX or TeX. Lozin and Volz characterized all bipartite graphs H for which the class of strongly H-free bipartite graphs has bounded clique-width. We extend their result by giving complete classifications for the other two variants of H-freeness
Statistical Properties of Short RSA Distribution and Their Cryptographic Applications

International audienceIn this paper, we study some computational security assump-tions involve in two cryptographic applications related to the RSA cryp-tosystem. To this end, we use exponential sums to bound the statistical distances between these distributions and the uniform distribution. We are interesting studying the k least (or most) significant bits of x e mod N , where N is a RSA modulus when x is restricted to a small part of [0, N). First of all, we provide the first rigorous evidence that the cryptographic pseudo-random generator proposed by Micali and Schnorr is based on firm foundations. This proof is missing in the original paper and do not cover the parameters chosen by the authors. Consequently, we extend the proof to get a new result closer to the parameters using a recent work of Wooley on exponential sums and we show some limitations of our technique. Finally, we look at the semantic security of the RSA padding scheme called PKCS#1 v1.5 which is still used a lot in practice. We show that parts of the ciphertexts are indistinguisable from uniform bitstrings
Toward a personalized approach for combining document relevance estimates

A large body of work in the information retrieval area has highlighted that relevance is a complex and a challenging concept. The underlying complexity appears mainly from the fact that relevance is estimated by considering multiple dimensions and that most of them are subjective since they are user-dependent. While the most used dimension is topicality, recent works risen particularly from personalized information retrieval have shown that personal preferences and contextual factors such as interests, location and task peculiarities have to be jointly considered in order to enhance the computation of document relevance. To answer this challenge, the commonly used approaches are based on linear combination schemes that rely basically on the non-realistic independency property of the relevance dimensions. In this paper, we propose a novel fuzzy-based document relevance aggregation operator able to capture the user’s importance of relevance dimensions as well as information about their interaction. Our approach is empirically evaluated and relies on the standard TREC contextual suggestion dataset involving 635 users and 50 contexts. The results highlight that accounting jointly for individual differences toward relevance dimension importance as well as their interaction introduces a significant improvement in the retrieval performance
Using DBpedia as a knowledge source for culture-related user modelling questionnaires

In the culture domain, questionnaires are often used to obtain profiles of users for adaptation. Creating questionnaires requires subject matter experts and diverse content, and often does not scale to a variety of cultures and situations. This paper presents a novel approach that is inspired by crowdwisdom and takes advantage of freely available structured linked data. It presents a mechanism for extracting culturally-related facts from DBpedia, utilised as a knowledge source in an interactive user modelling system. A user study, which examines the system usability and the accuracy of the resulting user model, demonstrates the potential of using DBpedia for generating culture-related user modelling questionnaires and points at issues for further investigation
A two-stage item recommendation method using probabilistic ranking with reconstructed tensor model

In a tag-based recommender system, the multi-dimensional <user, item, tag> correlation should be modeled effectively for finding quality recommendations. Recently, few researchers have used tensor models in recommendation to represent and analyze latent relationships inherent in multi-dimensions data. A common approach is to build the tensor model, decompose it and, then, directly use the reconstructed tensor to generate the recommendation based on the maximum values of tensor elements. In order to improve the accuracy and scalability, we propose an implementation of the -mode block-striped (matrix) product for scalable tensor reconstruction and probabilistically ranking the candidate items generated from the reconstructed tensor. With testing on real-world datasets, we demonstrate that the proposed method outperforms the benchmarking methods in terms of recommendation accuracy and scalability
Reverse engineering of model transformations for reusability

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-08789-4_14Proceedings of 7th International Conference, ICMT 2014, Held as Part of STAF 2014, York, UK, July 21-22, 2014Reuse techniques are key for the industrial adoption of Model-Driven Engineering (MDE). However, while reusability has been successfully applied to programming languages, its use is scarce in MDE and, in particular, in model transformations.
In previous works, we developed an approach that enables the reuse of model transformations for different meta-models. This is achieved by defining reusable components that encapsulate a generic transformation template and expose an interface called concept declaring the structural requirements that any meta-model using the component should fulfil. Binding the concept to one of such meta-models induces an adaptation of the template, which becomes applicable to the meta-model. To facilitate reuse, concepts need to be concise, reflecting only the minimal set of requirements demanded by the transformation.
In this paper, we automate the reverse engineering of existing transformations into reusable transformation components. To make a transformation reusable, we use the information obtained from its static analysis to derive a concept that is minimal with respect to the transformation and maximizes its reuse opportunities, and then evolve the transformation accordingly. The paper describes a prototype implementation and an evaluation using transformations from the ATL zoo.This work has been funded by the Spanish Ministry of Economy and Competitivity with project “Go Lite” (TIN2011-24139
Correctness of incremental model synchronization with triple graph grammars

In model-driven software development, we may have several models describing the same system or artifact, by providing different views on it. In this case, we say that these models are consistently integrated. Triple Graph Grammars (TGGs), defined by Schürr, are a general and powerful tool to describe (bidirectional) model transformations. In this context, model synchronization is the operation that, given two consistent models and an update or modification of one of them, finds the corresponding update on the other model, so that consistency is restored. There are different approaches to describe this operation in terms of TGGs, but most of them have a computational cost that depends on the size of the given models. In general this may be very costly since these models may be quite large. To avoid this problem, Giese and Wagner have advocated for the need of incremental synchronization procedures, meaning that their cost should depend only on the size of the given update. In particular they proposed one such procedure. Unfortunately, the correctness of their approach is not studied and, anyhow, it could only be ensured under severe restrictions on the kind of TGGs considered. In the work presented, we study the problem from a different point of view. First, we discuss what it means for a procedure to be incremental, defining a correctness notion that we call incremental consistency. Moreover, we present a general incremental synchronization procedure and we show its correctness, completeness and incrementality.Peer ReviewedPostprint (author’s final draft