pinecone/core-2020-05-10-deduplication huggingface dataset:
Group Strategyproof Pareto-Stable Marriage with Indifferences via the
  Generalized Assignment Game

We study the variant of the stable marriage problem in which the preferences
of the agents are allowed to include indifferences. We present a mechanism for
producing Pareto-stable matchings in stable marriage markets with indifferences
that is group strategyproof for one side of the market. Our key technique
involves modeling the stable marriage market as a generalized assignment game.
We also show that our mechanism can be implemented efficiently. These results
can be extended to the college admissions problem with indifferences
Verifying Array Manipulating Programs by Tiling

Formally verifying properties of programs that manipulate arrays in loops is
computationally challenging. In this paper, we focus on a useful class of such
programs, and present a novel property-driven verification method that first
infers array access patterns in loops using simple heuristics, and then uses
this information to compositionally prove universally quantified assertions
about arrays. Specifically, we identify tiles of array accesses patterns in a
loop, and use the tiling information to reduce the problem of checking a
quantified assertion at the end of a loop to an inductive argument that checks
only a slice of the assertion for a single iteration of the loop body. We show
that this method can be extended to programs with sequentially composed loops
and nested loops as well. We have implemented our method in a tool called
Tiler. Initial experiments show that Tiler outperforms several state-of-the-art
tools on a suite of interesting benchmarks.Comment: Published in SAS 201
Measuring the Accuracy of Object Detectors and Trackers

The accuracy of object detectors and trackers is most commonly evaluated by
the Intersection over Union (IoU) criterion. To date, most approaches are
restricted to axis-aligned or oriented boxes and, as a consequence, many
datasets are only labeled with boxes. Nevertheless, axis-aligned or oriented
boxes cannot accurately capture an object's shape. To address this, a number of
densely segmented datasets has started to emerge in both the object detection
and the object tracking communities. However, evaluating the accuracy of object
detectors and trackers that are restricted to boxes on densely segmented data
is not straightforward. To close this gap, we introduce the relative
Intersection over Union (rIoU) accuracy measure. The measure normalizes the IoU
with the optimal box for the segmentation to generate an accuracy measure that
ranges between 0 and 1 and allows a more precise measurement of accuracies.
Furthermore, it enables an efficient and easy way to understand scenes and the
strengths and weaknesses of an object detection or tracking approach. We
display how the new measure can be efficiently calculated and present an
easy-to-use evaluation framework. The framework is tested on the DAVIS and the
VOT2016 segmentations and has been made available to the community.Comment: 10 pages, 7 Figure
Epi-two-dimensional flow and generalized enstrophy

The conservation of the enstrophy ($L^2$ norm of the vorticity $\omega$)
plays an essential role in the physics and mathematics of two-dimensional (2D)
Euler fluids. Generalizing to compressible ideal (inviscid and barotropic)
fluids, the generalized enstrophy $\int_{\Sigma(t)} f(\omega/\rho)\rho\, d^2
x$, ($f$ an arbitrary smooth function, $\rho$ the density, and $\Sigma(t)$ an
arbitrary 2D domain co-moving with the fluid) is a constant of motion, and
plays the same role. On the other hand, for the three-dimensional (3D) ideal
fluid, the helicity $\int_{M} {V}\cdot\omega\,d^3x$, ($V$ the flow velocity,
$\omega=\nabla\times V$, and ${M}$ the three-dimensional domain containing the
fluid) is conserved. Evidently, the helicity degenerates in a 2D system, and
the (generalized) enstrophy emerges as a compensating constant. This transition
of the constants of motion is a reflection of an essential difference between
2D and 3D systems, because the conservation of the (generalized) enstrophy
imposes stronger constraints, than the helicity, on the flow. In this paper, we
make a deeper inquiry into the helicity-enstrophy interplay: the ideal fluid
mechanics is cast into a Hamiltonian form in the phase space of Clebsch
parameters, generalizing 2D to a wider category of epi-2D flows (2D embedded in
3D has zero helicity, while the converse is not true -- our epi-2D category
encompasses a wider class of zero-helicity flows); how helicity degenerates and
is substituted by a new constant is delineated; and how a further generalized
enstrophy is introduced as a constant of motion applying to epi-2D flow is
described
Solitary waves in the Nonlinear Dirac Equation

In the present work, we consider the existence, stability, and dynamics of
solitary waves in the nonlinear Dirac equation. We start by introducing the
Soler model of self-interacting spinors, and discuss its localized waveforms in
one, two, and three spatial dimensions and the equations they satisfy. We
present the associated explicit solutions in one dimension and numerically
obtain their analogues in higher dimensions. The stability is subsequently
discussed from a theoretical perspective and then complemented with numerical
computations. Finally, the dynamics of the solutions is explored and compared
to its non-relativistic analogue, which is the nonlinear Schr{\"o}dinger
equation. A few special topics are also explored, including the discrete
variant of the nonlinear Dirac equation and its solitary wave properties, as
well as the PT-symmetric variant of the model
Nonnegative Factorization of a Data Matrix as a Motivational Example for
  Basic Linear Algebra

We present a motivating example for matrix multiplication based on factoring
a data matrix. Traditionally, matrix multiplication is motivated by
applications in physics: composing rigid transformations, scaling, sheering,
etc. We present an engaging modern example which naturally motivates a variety
of matrix manipulations, and a variety of different ways of viewing matrix
multiplication. We exhibit a low-rank non-negative decomposition (NMF) of a
"data matrix" whose entries are word frequencies across a corpus of documents.
We then explore the meaning of the entries in the decomposition, find natural
interpretations of intermediate quantities that arise in several different ways
of writing the matrix product, and show the utility of various matrix
operations. This example gives the students a glimpse of the power of an
advanced linear algebraic technique used in modern data science
Representing uncertainty regarding satisfaction degrees using possibility distributions

Evaluating flexible criteria on data leads to degrees of satisfaction. If a datum is uncertain, it can be uncertain to which degree it satisfies the criterion. This uncertainty can be modelled using a possibility distribution over the domain of possible degrees of satisfaction. In this work, we discuss the meaningfulness thereof by looking at the semantics of such a representation of the uncertainty. More specifically, it is shown that defuzzification of such a representation, towards usability in (multi-criteria) decision support systems, corresponds to expressing a clear attitude towards uncertainty (optimistic, pessimistic, cautious, etc.
A new mathematical model for environmental monitoring and assessment

Versão dos Autores para este artigo.In this paper we are concerned with a quantitative method of Landscape Ecology. More in details we consider an environmental system distributed in landscape units (ecological sectors) and we propose a new mathematical model in order to implement a method for the evaluation of the ecological state of the system under investigation. After having performed a stability analysis of the model, we apply the proposed procedure first by considering separately each landscape unit and then extending our investigation to the system as a whole, by taking into account the connections between all the landscape units themselves. Our investigation includes some numerical computations that were performed for a Northern district of the Turin Province, using an approximation procedure that should avoid stiffness problems.National Group GNFM of INdAM, Italyinfo:eu-repo/semantics/publishedVersio
An Active Learning Approach to the Falsification of Black Box
  Cyber-Physical Systems

Search-based testing is widely used to find bugs in models of complex
Cyber-Physical Systems. Latest research efforts have improved this approach by
casting it as a falsification procedure of formally specified temporal
properties, exploiting the robustness semantics of Signal Temporal Logic. The
scaling of this approach to highly complex engineering systems requires
efficient falsification procedures, which should be applicable also to black
box models. Falsification is also exacerbated by the fact that inputs are often
time-dependent functions. We tackle the falsification of formal properties of
complex black box models of Cyber-Physical Systems, leveraging machine learning
techniques from the area of Active Learning. Tailoring these techniques to the
falsification problem with time-dependent, functional inputs, we show a
considerable gain in computational effort, by reducing the number of model
simulations needed. The goodness of the proposed approach is discussed on a
challenging industrial-level benchmark from automotive.Comment: 15 pages, 2 figure
Task-Node Mapping in an Arbitrary Computer Network Using SMT Solver

The problem of mapping (assigning) application tasks to processing nodes in a distributed computer system for spacecraft is investigated in this paper. The network architecture is developed in the project ‘Scalable On-Board Computing for Space Avionics’ (ScOSA) at the German Aerospace Center (DLR). In ScOSA system the processing nodes are connected to a network with an arbitrary topology. The applications are structured as directed graphs of periodic and aperiodic tasks that exchange messages. In this paper a formal definition of the mapping problem is given. We demonstrate several ways to formulate it as a satisfiability modulo theories (SMT) problem and then use Z3, a state-of-the-art SMT solver, to produce the mapping. The approach is evaluated on a mapping problem for an optical navigation application as well as on a set of randomly generated task graphs
Formal verification of CNL health recommendations

This research is partially supported by EPSRC grant EP/M014290/1.Clinical texts, such as therapy algorithms, are often described in natural language and may include hidden inconsistencies, gaps and potential deadlocks. In this paper, we propose an approach to identify such problems with formal verification. From each sentence in the therapy algorithm we automatically generate a parse tree and derive case frames. From the case frames we construct a state-based representation (in our case a timed automaton) and use a model checker (here UPPAAL) to verify the model. Throughout the paper we use an example of the algorithm for blood glucose lowering therapy in adults with type 2 diabetes to illustrate our approach.Postprin
The phrase 'The Great War' in british discourse during world war one

The association of the term ‘The Great War’ with World War One, if it began 100 years ago, could be seen as telling, not only about attitudes at the time (and whether it meant ‘jolly big’ or ‘jolly good’), but about our retrospective attitudes to those who were involved. Through an examination of propaganda, periodicals, political statements and specific pre-war literature, an assumption that as a phrase it is indicative of jingoistic and bellicose hysteria generated by influential politicians for the gullible citizens of whichever participant nation, can be shown as a misleading simplification. Instead, with a concentration on Britain, a study of its use by statesmen such as Asquith and Lloyd George, the very particular circumstances under which it appeared in Punch magazine, and the overt zeal some advocates of war with Germany displayed from several years before 1914, is revealing of very different public standpoints among supporters of the war.info:eu-repo/semantics/publishedVersio
Louis-Ferdinand Destouches’ Medical Writing: an Apologia for Industrial and Social Modernization

This article proposes an analysis of the medical writings of Louis-Ferdinand Destouches. These writings reveal a critical reflection, in no way a whitewash, on hygiene and public health problems imposed by the war of 14–18. These medical writings, immediate post-war products, show thinking which is in line with the social and ideological ideas we find in Semmelweis, the first of the texts collected in Celine Book 3 (The Basedowine closes collection). Contemporary with the debates of the 20s, he questioned medical theses dedicated to the glorification of industrial and social modernization. Here is presented and clarified some data on their acceptance by the medical profession, the development of Destouches’ career, and his vision of his profession, concluding that these medical writings can be considered embryonic of the views of the man who would become Louis-Ferdinand Céline. Written, mostly, on behalf of the League of Nations during the period 1924–1932, these medical writings, like his medical history, provide the main leitmotifs that will illustrate the Celinian universe: miserable conditions, poverty, alcoholism and human degradation, all the things that made it difficult to exercise the profession of doctor in the urban-industrial society of the early twentieth century.

Medicine was my calling (…) Since I was a child I have dreamed of becoming a doctor, I dreamed of healing people (…)

(Céline, 1961, p. 207)info:eu-repo/semantics/publishedVersio
Bulk Insertions into xBR+ -trees

Bulk insertion refers to the process of updating an existing index by inserting a large batch of new data, treating the items of this batch as a whole and not by inserting these items one-by-one. Bulk insertion is related to bulk loading, which refers to the process of creating a non-existing index from scratch, when the dataset to be indexed is available beforehand. The xBR + -tree is a balanced, disk-resident, Quadtree-based index for point data, which is very efficient for processing spatial queries. In this paper, we present the first algorithm for bulk insertion into xBR+ -trees. This algorithm incorporates extensions of techniques that we have recently developed for bulk loading xBR+ -trees. Moreover, using real and artificial datasets of various cardinalities, we present an experimental comparison of this algorithm vs. inserting items one-by-one for updating xBR+ -trees, regarding performance (I/O and execution time) and the characteristics of the resulting trees. We also present experimental results regarding the query-processing efficiency of xBR+ -trees built by bulk insertions vs. xBR+ -trees built by inserting items one-by-one
RkNN Query Processing in Distributed Spatial Infrastructures: A Performance Study

The Reverse k-Nearest Neighbor (RkNN) problem, i.e. finding all objects in a dataset that have a given query point among their corresponding k-nearest neighbors, has received increasing attention in the past years. RkNN queries are of particular interest in a wide range of applications such as decision support systems, resource allocation, profile-based marketing, location-based services, etc. With the current increasing volume of spatial data, it is difficult to perform RkNN queries efficiently in spatial data-intensive applications, because of the limited computational capability and storage resources. In this paper, we investigate how to design and implement distributed RkNN query algorithms using shared-nothing spatial cloud infrastructures as SpatialHadoop and LocationSpark. SpatialHadoop is a framework that inherently supports spatial indexing on top of Hadoop to perform efficiently spatial queries. LocationSpark is a recent spatial data processing system built on top of Spark. We have evaluated the performance of the distributed RkNN query algorithms on both SpatialHadoop and LocationSpark with big real-world datasets. The experiments have demonstrated the efficiency and scalability of our proposal in both distributed spatial data management systems, showing the performance advantages of LocationSpark
Tableaux for Policy Synthesis for MDPs with PCTL* Constraints

Markov decision processes (MDPs) are the standard formalism for modelling
sequential decision making in stochastic environments. Policy synthesis
addresses the problem of how to control or limit the decisions an agent makes
so that a given specification is met. In this paper we consider PCTL*, the
probabilistic counterpart of CTL*, as the specification language. Because in
general the policy synthesis problem for PCTL* is undecidable, we restrict to
policies whose execution history memory is finitely bounded a priori.
  Surprisingly, no algorithm for policy synthesis for this natural and
expressive framework has been developed so far. We close this gap and describe
a tableau-based algorithm that, given an MDP and a PCTL* specification, derives
in a non-deterministic way a system of (possibly nonlinear) equalities and
inequalities. The solutions of this system, if any, describe the desired
(stochastic) policies.
  Our main result in this paper is the correctness of our method, i.e.,
soundness, completeness and termination.Comment: This is a long version of a conference paper published at TABLEAUX
  2017. It contains proofs of the main results and fixes a bug. See the
  footnote on page 1 for detail
Cost model for Pregel on GraphX

The graph partitioning strategy plays a vital role in the overall execution of an algorithm in a distributed graph processing system. Choosing the best strategy is very challenging, as no one strategy is always the best fit for all kinds of graphs or algorithms. In this paper, we help users choosing a suitable partitioning strategy for algorithms based on the Pregel model by providing a cost model for the Pregel implementation in Spark-GraphX. The cost model shows the relationship between four major parameters: (1) input graph (2) cluster configuration (3) algorithm properties and (4) partitioning strategy. We validate the accuracy of the cost model on 17 different combinations of input graph, algorithm, and partition strategy. As such, the cost model can serve as a basis for yet to be developed optimizers for Pregel.Peer ReviewedPostprint (author's final draft
Formalising opencypher Graph Queries in Relational Algebra

Graph database systems are increasingly adapted for storing and processing
heterogeneous network-like datasets. However, due to the novelty of such
systems, no standard data model or query language has yet emerged.
Consequently, migrating datasets or applications even between related
technologies often requires a large amount of manual work or ad-hoc solutions,
thus subjecting the users to the possibility of vendor lock-in. To avoid this
threat, vendors are working on supporting existing standard languages (e.g.
SQL) or creating standardised languages.
  In this paper, we present a formal specification for openCypher, a high-level
declarative graph query language with an ongoing standardisation effort. We
introduce relational graph algebra, which extends relational operators by
adapting graph-specific operators and define a mapping from core openCypher
constructs to this algebra. We propose an algorithm that allows systematic
compilation of openCypher queries.Comment: ADBIS conference (21st European Conference on Advances in Databases
  and Information Systems) The final publication is available at Springer via
  https://doi.org/10.1007/978-3-319-66917-5_1
New threats for old manufacturing problems: Secure IoT-enabled monitoring of legacy production machinery

The digitization of manufacturing through the introduction of Industrie 4.0 technologies creates additional business opportunities and technical challenges. The integration of such technologies on legacy production machinery can upgrade them to become part of the digital and smart manufacturing environment. A typical example is that of industrial monitoring and maintenance, which can benefit from internet of things (IoT) solutions. This paper presents the development of an-IoT-enabled monitoring solution for machine tools as part of a remote maintenance approach. While the technical challenges pertaining to the development and integration of such solutions in a manufacturing environment have been the subject of relevant research in the literature, the corresponding new security challenges arising from the introduction of such technologies have not received equal attention. Failure to adequately handle such issues is a key barrier to the adoption of such solutions by industry. This paper aims to assess and classify the security aspects of integrating IoT technology with monitoring systems in manufacturing environments and propose a systematic view of relevant vulnerabilities and threats by taking an IoT architecture point of view. Our analysis has led to proposing a novel modular approach for secure IoT-enabled monitoring for legacy production machinery. The introduced approach is implemented on a case study of machine tool monitoring, highlighting key findings and issues for further research
Service innovation and performance in Mexican service SMEs

This empirical research investigates the influence of service innovation on the performance of service SMEs, especially within the context of a country with an emerging economy as it is the case of Mexico. Data were collected through a survey instrument designed and distributed among service SMEs in the Aguascalientes state of Mexico to test a hypothesis formulated from the literature review conducted. The instrument was validated using Confirmatory Factor Analysis, Cronbach’s alpha test and the Composite Reliability Index to ensure its reliability. The hypothesis was tested using structural equation modelling (SEM) using an as input 308 valid responses obtained from the survey. In general, the results obtained show that service innovation has a positive and significant effect on the performance of service SMEs. Specific research related to service innovation in service SMEs is limited. This paper therefore fills this research gap by expanding the limited body of knowledge in this field
Lean manufacturing and environmental performance – exploring the impact and relationship

The relationship between Lean Manufacturing and Environmental Performance has attracted much debate but at the same time lack of empirical evidence leaves haphazard opinions on this matter. The objective of this paper is therefore to pro-vide some insight into the impact of Lean Manufacturing on Environmental Per-formance and the existing relationship of these two concepts. Four semi-structured interviews with industrial and academic experts provided a solid ground to suggest that the relationship does exist, despite the fact that these two concepts were developed independently from each other. Being the exploratory nature of this study and its purpose to ignite further research, it does not employ a quantitative approach. The results of this study can help managers to better un-derstand and concurrently tackle both the economic and environmental challenges faced by their organizations