pinecone/core-2020-05-10-deduplication huggingface dataset:
DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL

We present the latest major release version 6.0 of the quantified Boolean
formula (QBF) solver DepQBF, which is based on QCDCL. QCDCL is an extension of
the conflict-driven clause learning (CDCL) paradigm implemented in state of the
art propositional satisfiability (SAT) solvers. The Q-resolution calculus
(QRES) is a QBF proof system which underlies QCDCL. QCDCL solvers can produce
QRES proofs of QBFs in prenex conjunctive normal form (PCNF) as a byproduct of
the solving process. In contrast to traditional QCDCL based on QRES, DepQBF 6.0
implements a variant of QCDCL which is based on a generalization of QRES. This
generalization is due to a set of additional axioms and leaves the original
Q-resolution rules unchanged. The generalization of QRES enables QCDCL to
potentially produce exponentially shorter proofs than the traditional variant.
We present an overview of the features implemented in DepQBF and report on
experimental results which demonstrate the effectiveness of generalized QRES in
QCDCL.Comment: 12 pages + appendix; to appear in the proceedings of CADE-26, LNCS,
  Springer, 201
Coinductive soundness of corecursive type class resolution

This work has been supported by the EPSRC grant “Coalgebraic Logic Programming for Type Inference” EP/K031864/1-2, EU Horizon 2020 grant “RePhrase: Refactoring Parallel Heterogeneous Resource-Aware Applications - a Software Engineering Approach” (ICT-644235), and by COST Action IC1202 (TACLe), supported by COST (European Cooperation in Science and Technology)Horn clauses and first-order resolution are commonly used to implement type classes in Haskell. Several corecursive extensions to type class resolution have recently been proposed, with the goal of allowing (co)recursive dictionary construction where resolution does not terminate. This paper shows, for the first time, that corecursive type class resolution and its extensions are coinductively sound with respect to the greatest Herbrand models of logic programs and that they are inductively unsound with respect to the least Herbrand models. We establish incompleteness results for various fragments of the proof system.Postprin
The Problem Distiller Tool: supporting teachers in uncovering why their students have problems understanding Threshold Concepts

In pressThis study explored the use of a web-based tool entitled ‘Problem Distiller’ designed to support teachers in uncovering why their students have problems understanding Threshold Concepts. Data collected involved interviews with two math teachers, invited to experiment the Problem Distiller tool and Think Aloud protocol. Content analysis was used to process and analyse the collected data.. Findings show that teachers found it helpful when the information they entered through the Problem Distiller was fed back as they constructed an online diagnostic quiz. Focusing on the teachers’ understanding of why the students have problems is an effective way of tackling the barriers posed by Threshold Concepts and can be integrated with existing strategies and teaching approaches.CIEC – Research Centre on Child Studies, IE, UMinho (FCT R&D unit 317), PortugalEuropean Community's Seventh Framework ProgrammeThe research leading to these results has received funding from the European Community's Seventh Framework Programme under grant agreement no. 317964 JUXTALEARN. We would like to thank the interviewed teachers for their valuable collaboration
Demonstrating that medical devices satisfy user related safety requirements

One way of contributing to a demonstration that a medical device is acceptably safe is to show that the device satisfies a set of requirements known to mitigate hazards. This paper describes experience using formal techniques to model an IV infusion device and to prove that the modelled device captures a set of requirements. The requirements chosen for the study are based on a draft proposal developed by the US Food and Drug Administration (FDA). A major contributor to device related errors are (user) interaction errors. For this reason the chosen models and requirements focus on user interface related issues.FEDER - Federación Española de Enfermedades Raras(000062)This work has been funded by the EPSRC research grant EP/G059063/1: CHI+MED (Computer–Human Interaction for Medical Devices). J. C. Campos was funded by project NORTE-07-0124-FEDER-00006
How does predicate invention affect human comprehensibility?

During the 1980s Michie defined Machine Learning in terms of two orthogonal axes of performance: predictive accuracy and comprehensibility of generated hypotheses. Since predictive accuracy was readily measurable and comprehensibility not so, later definitions in the 1990s, such as that of Mitchell, tended to use a one-dimensional approach to Machine Learning based solely on predictive accuracy, ultimately favouring statistical over symbolic Machine Learning approaches. In this paper we provide a definition of comprehensibility of hypotheses which can be estimated using human participant trials. We present the results of experiments testing human comprehensibility of logic programs learned with and without predicate invention. Results indicate that comprehensibility is affected not only by the complexity of the presented program but also by the existence of anonymous predicate symbols
Runtime Verification of Temporal Properties over Out-of-order Data
  Streams

We present a monitoring approach for verifying systems at runtime. Our
approach targets systems whose components communicate with the monitors over
unreliable channels, where messages can be delayed or lost. In contrast to
prior works, whose property specification languages are limited to
propositional temporal logics, our approach handles an extension of the
real-time logic MTL with freeze quantifiers for reasoning about data values. We
present its underlying theory based on a new three-valued semantics that is
well suited to soundly and completely reason online about event streams in the
presence of message delay or loss. We also evaluate our approach
experimentally. Our prototype implementation processes hundreds of events per
second in settings where messages are received out of order.Comment: long version of the CAV 2017 pape
Ascertaining Uncertainty for Efficient Exact Cache Analysis

Static cache analysis characterizes a program's cache behavior by determining
in a sound but approximate manner which memory accesses result in cache hits
and which result in cache misses. Such information is valuable in optimizing
compilers, worst-case execution time analysis, and side-channel attack
quantification and mitigation.Cache analysis is usually performed as a
combination of `must' and `may' abstract interpretations, classifying
instructions as either `always hit', `always miss', or `unknown'. Instructions
classified as `unknown' might result in a hit or a miss depending on program
inputs or the initial cache state. It is equally possible that they do in fact
always hit or always miss, but the cache analysis is too coarse to see it.Our
approach to eliminate this uncertainty consists in (i) a novel abstract
interpretation able to ascertain that a particular instruction may definitely
cause a hit and a miss on different paths, and (ii) an exact analysis, removing
all remaining uncertainty, based on model checking, using
abstract-interpretation results to prune down the model for scalability.We
evaluated our approach on a variety of examples; it notably improves precision
upon classical abstract interpretation at reasonable cost
Verified compilation of space-efficient reversible circuits

The generation of reversible circuits from high-level code is an important
problem in several application domains, including low-power electronics and
quantum computing. Existing tools compile and optimize reversible circuits for
various metrics, such as the overall circuit size or the total amount of space
required to implement a given function reversibly. However, little effort has
been spent on verifying the correctness of the results, an issue of particular
importance in quantum computing. There, compilation allows not only mapping to
hardware, but also the estimation of resources required to implement a given
quantum algorithm, a process that is crucial for identifying which algorithms
will outperform their classical counterparts. We present a reversible circuit
compiler called ReVerC, which has been formally verified in F* and compiles
circuits that operate correctly with respect to the input program. Our compiler
compiles the Revs language to combinational reversible circuits with as few
ancillary bits as possible, and provably cleans temporary values.Comment: Proceedings version. New section on eager cleanup, general
  streamlinin
Conformal symmetry breaking operators for anti-de Sitter spaces

For a pseudo-Riemannian manifold $X$ and a totally geodesic hypersurface $Y$,
we consider the problem of constructing and classifying all linear differential
operators $\mathcal{E}^i(X) \to \mathcal{E}^j(Y)$ between the spaces of
differential forms that intertwine multiplier representations of the Lie
algebra of conformal vector fields. Extending the recent results in the
Riemannian setting by Kobayashi-Kubo-Pevzner [Lecture Notes in Math.~2170,
(2016)], we construct such differential operators and give a classification of
them in the pseudo-Riemannian setting where both $X$ and $Y$ are of constant
sectional curvature, illustrated by the examples of anti-de Sitter spaces and
hyperbolic spaces.Comment: 18 page
Quantum non-malleability and authentication

In encryption, non-malleability is a highly desirable property: it ensures
that adversaries cannot manipulate the plaintext by acting on the ciphertext.
Ambainis, Bouda and Winter gave a definition of non-malleability for the
encryption of quantum data. In this work, we show that this definition is too
weak, as it allows adversaries to "inject" plaintexts of their choice into the
ciphertext. We give a new definition of quantum non-malleability which resolves
this problem. Our definition is expressed in terms of entropic quantities,
considers stronger adversaries, and does not assume secrecy. Rather, we prove
that quantum non-malleability implies secrecy; this is in stark contrast to the
classical setting, where the two properties are completely independent. For
unitary schemes, our notion of non-malleability is equivalent to encryption
with a two-design (and hence also to the definition of Ambainis et al.). Our
techniques also yield new results regarding the closely-related task of quantum
authentication. We show that "total authentication" (a notion recently proposed
by Garg, Yuen and Zhandry) can be satisfied with two-designs, a significant
improvement over the eight-design construction of Garg et al. We also show
that, under a mild adaptation of the rejection procedure, both total
authentication and our notion of non-malleability yield quantum authentication
as defined by Dupuis, Nielsen and Salvail.Comment: 20+13 pages, one figure. v2: published version plus extra material.
  v3: references added and update
Hypersurfaces in weighted projective spaces over finite fields with
  applications to coding theory

We consider the question of determining the maximum number of
$\mathbb{F}_q$-rational points that can lie on a hypersurface of a given degree
in a weighted projective space over the finite field $\mathbb{F}_q$, or in
other words, the maximum number of zeros that a weighted homogeneous polynomial
of a given degree can have in the corresponding weighted projective space over
$\mathbb{F}_q$. In the case of classical projective spaces, this question has
been answered by J.-P. Serre. In the case of weighted projective spaces, we
give some conjectures and partial results. Applications to coding theory are
included and an appendix providing a brief compendium of results about weighted
projective spaces is also included
Max-Plus-Linear Systems for Modeling and Control of Manufacturing Problems

In this chapter, the dynamics of manufacturing systems is characterized through the occurrence of events such as parts entering or leaving machines. Furthermore, we assume that the relations between events are expressed by synchronizations (i.e., conditions of the form: for all k ≥ l, occurrence k of event e2 is at least τ units of time after occurrence k − l of event e1). Note that this assumption often holds when the considered manufacturing system is functioning under a predefined schedule. First, we discuss the modeling of such systems by linear state-space models in the (max,+)-algebra (due to this property, such systems are often called (max,+)-linear systems). Second, standard open-loop and closed-loop control structures for (max,+)-linear systems are recalled. These control structures lead to a trade-off between the rapidity of systems and their internal buffer sizes. Some techniques to influence this trade-off are presented
Big Data and Fog Computing

Fog computing serves as a computing layer that sits between the edge devices
and the cloud in the network topology. They have more compute capacity than the
edge but much less so than cloud data centers. They typically have high uptime
and always-on Internet connectivity. Applications that make use of the fog can
avoid the network performance limitation of cloud computing while being less
resource constrained than edge computing. As a result, they offer a useful
balance of the current paradigms. This article explores various aspects of fog
computing in the context of big data.Comment: To Appear as a contribution in Encyclopedia of Big Data Technologies,
  Sherif Sakr and Albert Zomaya eds., Springer Nature, 201
Gradient-Based Multiobjective Optimization with Uncertainties

In this article we develop a gradient-based algorithm for the solution of
multiobjective optimization problems with uncertainties. To this end, an
additional condition is derived for the descent direction in order to account
for inaccuracies in the gradients and then incorporated in a subdivison
algorithm for the computation of global solutions to multiobjective
optimization problems. Convergence to a superset of the Pareto set is proved
and an upper bound for the maximal distance to the set of substationary points
is given. Besides the applicability to problems with uncertainties, the
algorithm is developed with the intention to use it in combination with model
order reduction techniques in order to efficiently solve PDE-constrained
multiobjective optimization problems.Comment: 26 pages, 10 figure
Robot transparency:Improving understanding of intelligent behaviour for designers and users

Autonomous robots can be difficult to design and understand. Designers have difficulty decoding the behaviour of their own robots simply by observing them. Naive users of robots similarly have difficulty deciphering robot behaviour simply through observation. In this paper we review relevant robot systems architecture, design, and transparency literature, and report on a programme of research to investigate practical approaches to improve robot transparency. We report on the investigation of real-time graphical and vocalised outputs as a means for both designers and end users to gain a better mental model of the internal state and decision making processes taking place within a robot. This approach, combined with a graphical approach to behaviour design, offers improved transparency for robot designers. We also report on studies of users’ understanding, where significant improvement has been achieved using both graphical and vocalisation transparency approaches
A flexible component-based robot control architecture for hormonal modulation of behaviour and affect

This document is the Accepted Manuscritpt of a paper published in Proceedings of 18th Annual Conference, TAROS 2017, Guildford, UK, July 19???21, 2017. Under embargo. Embargo end date: 20 July 2018. The final publication is available at Springer via https://link.springer.com/chapter/10.1007%2F978-3-319-64107-2_36. ?? 2017 Springer, Cham.In this paper we present the foundations of an architecture that will support the wider context of our work, which is to explore the link between affect, perception and behaviour from an embodied perspective and assess their relevance to Human Robot Interaction (HRI). Our approach builds upon existing affect-based architectures by combining artificial hormones with discrete abstract components that are designed with the explicit consideration of influencing, and being receptive to, the wider affective state of the robot
From Vision to Grasping: Adapting Visual Networks

Grasping is one of the oldest problems in robotics and is still considered challenging, especially when grasping unknown objects with unknown 3D shape. We focus on exploiting recent advances in computer vision recognition systems. Object classification problems tend to have much larger datasets to train from and have far fewer practical constraints around the size of the model and speed to train. In this paper we will investigate how to adapt Convolutional Neural Networks (CNNs), traditionally used for image classification, for planar robotic grasping. We consider the differences in the problems and how a network can be adjusted to account for this. Positional information is far more important to robotics than generic image classification tasks, where max pooling layers are used to improve translation invariance. By using a more appropriate network structure we are able to obtain improved accuracy while simultaneously improving run times and reducing memory consumption by reducing model size by up to 69%
A Model-Checking approach to analyse temporal failure propagation with altaRica

The design of complex safety critical systems raises new technical challenges for the industry. As systems become more complex-and include more and more interacting functions|it becomes harder to evaluate the safety implications of local failures and their possible propagation through a whole system. That is all the more true when we add time to the problem, that is when we consider the impact of computation times and delays on the propagation of failures. We describe an approach that extends models developed for Safety Analysis with timing information and provide tools to reason on the correctness of temporal safety conditions. Our approach is based on an extension of the AltaRica language where we can associate timing constraints with events and relies on a translation into a realtime model-checking toolset. We illustrate our method with an example that is representative of safety architectures found in critical systems
The role of ontologies and decision frameworks in computer-interpretable guideline execution

Computer-Interpretable Guidelines (CIGs) are machine readable representations of Clinical Practice Guidelines (CPGs) that serve as the knowledge base in many knowledge-based systems oriented towards clinical decision support. Herein we disclose a comprehensive CIG representation model based on Web Ontology Language (OWL) along with its main components. Additionally, we present results revealing the expressiveness of the model regarding a selected set of CPGs. The CIG model then serves as the basis of an architecture for an execution system that is able to manage incomplete information regarding the state of a patient through Speculative Computation. The architecture allows for the generation of clinical scenarios when there is missing information for clinical parameters.FCT - Fundação para a Ciência e a Tecnologia (SFRH/BD/85291/ 2012)info:eu-repo/semantics/publishedVersio
Optimizing egalitarian performance in the side-effects model of
  colocation for data center resource management

In data centers, up to dozens of tasks are colocated on a single physical
machine. Machines are used more efficiently, but tasks' performance
deteriorates, as colocated tasks compete for shared resources. As tasks are
heterogeneous, the resulting performance dependencies are complex. In our
previous work [18] we proposed a new combinatorial optimization model that uses
two parameters of a task - its size and its type - to characterize how a task
influences the performance of other tasks allocated to the same machine.
  In this paper, we study the egalitarian optimization goal: maximizing the
worst-off performance. This problem generalizes the classic makespan
minimization on multiple processors (P||Cmax). We prove that
polynomially-solvable variants of multiprocessor scheduling are NP-hard and
hard to approximate when the number of types is not constant. For a constant
number of types, we propose a PTAS, a fast approximation algorithm, and a
series of heuristics. We simulate the algorithms on instances derived from a
trace of one of Google clusters. Algorithms aware of jobs' types lead to better
performance compared with algorithms solving P||Cmax.
  The notion of type enables us to model degeneration of performance caused by
using standard combinatorial optimization methods. Types add a layer of
additional complexity. However, our results - approximation algorithms and good
average-case performance - show that types can be handled efficiently.Comment: Author's version of a paper published in Euro-Par 2017 Proceedings,
  extends the published paper with addtional results and proof
Runtime-assisted shared cache insertion policies based on re-reference intervals

Processor speed is improving at a faster rate than the speed of main memory, which makes memory accesses increasingly expensive. One way to solve this problem is to reduce miss ratio of the processor’s last level cache by improving its replacement policy. We approach the problem by co-designing the runtime system and hardware and exploiting the semantics of the applications written in data-flow task-based programming models to provide hardware with information about the task types and task data-dependencies. We propose the Task-Type aware Insertion Policy, TTIP, which uses the runtime system to dynamically determine the best probability per task type for bimodal insertion in the recency stack and the static Dependency-Type aware Insertion Policy, DTIP, that inserts cache lines in the optimal position taking into account the dependency types of the current task. TTIP and DTIP perform similarly or better than state-of-the-art replacement policies, while requiring less hardware.This work has been supported by the RoMoL ERC Advanced Grant (GA 321253), by the European HiPEAC Network of Excellence,\ud
by the Spanish Ministry of Science and Innovation (contract TIN2015-65316-P),\ud
by Generalitat de Catalunya (contracts 2014-SGR-1051 and 2014-SGR-1272). V. Dimic has been partially supported by AGAUR of the Government of Catalonia (contract 2017 FI B 00855). M. Moretó has been partially supported by the Ministry of Economy and Competitiveness under Juan de la Cierva postdoctoral fellowship number JCI-2012-15047. M. Casas has been supported by the Secretary for Universities and Research of the Ministry of Economy and Knowledge of the Government of Catalonia and the Cofund programme of the Marie Curie Actions of the 7th R&D Framework Programme of the European Union (contract 2013 BP B 00243).Peer ReviewedPostprint (author's final draft