pinecone/core-2020-05-10-deduplication huggingface dataset:
A signature approach to patent classification

We propose a document signature approach to patent classification. Automatic patent classification is a challenging task because of the fast growing number of patent applications filed every year and the complexity, size and nested hierarchical structure of patent taxonomies. In our proposal, the classification of a target patent is achieved through a k-nearest neighbour search using Hamming distance on signatures generated from patents; the classification labels of the retrieved patents are weighted and combined to produce a patent classification code for the target patent. The use of this method is motivated by the fact that intuitively document signatures are more efficient than previous approaches for this task that considered the training of classifiers on the whole vocabulary feature set. Our empirical experiments also demonstrate that the combination of document signatures and k-nearest neighbours search improves classification effectiveness, provided that enough data is used to generate signatures
Oyster: A tool for fine-grained ontological annotations in free-text

Oyster is a web-based annotation tool that allows users to annotate free-text with respect to concepts defined in formal knowledge resources such as large domain ontologies. The tool has been explicitly designed to provide (manual and automatic) search functionalities to identify the best concept entities to be used for annotation. In addition, Oyster supports features such as annotations that span across non-adjacent tokens, multiple annotations per token, the identification of entity relationships and a user-friendly visualisation of the annotation including the use of filtering based on annotation types. Oyster is highly configurable and can be expanded to support a variety of knowledge resources. The tool can support a wide range of tasks involving human annotation, including named-entity extraction, relationship extraction, annotation correction and refinement
Conceptions, Purposes and Processes of Ongoing Learning across Working Life

There is a growing need for a comprehensive and informed account of how learning across working life can be conceptualised, its range of purposes outlined, and processes supporting that learning understood. Consensus exists across governments and supra-national agencies, spokespersons for industry, occupations, employees, workplaces, education systems and communities and by workers themselves that the ongoing development of occupational capacities is now required by all kinds of workers in all occupations across their working lives. This consensus arises from the recognition that not only is the knowledge required for occupational practice subject to constant change, but also the nature and form of that change are more than merely keeping up-to-date with the latest developments. Instead, many occupations are being transformed, which affects what constitutes occupational competence and extends to what is expected of those occupations by the community. Moreover, the nature and kinds of paid employment, how it is undertaken and by whom are also constantly changing. Therefore, there is a need to view workers’ ongoing development across working lives as a major education project. Given the importance of this project in securing economic and social goals, it warrants a fresh and informed approach to how these goals might be realised. The focus here is distinct from other educational projects in so far as its conceptions are far broader. The concern is to build upon both work and educational experiences, and to be open to a range of provisions of experiences and support going beyond the scope of what can be realised through the provision of experiences in educational institutions. So, this project needs to be realised not only through educational systems and institutions, but also in the circumstances where occupations are enacted (i.e., workplaces, work practices and communities). Given this necessity for ongoing learning across working life constitutes an entire educational project, there needs to be clarity about what conceptions underpin it, the kind of purposes to which it is directed and the processes used to realise these purposes. In this way, this concluding chapter draws upon contributions within this book and those from elsewhere to set out something of what comprises the educational project associated with ongoing learning across working life.Arts, Education & Law Group, School of Education and Professional StudiesFull Tex
L\'evy Processes on Quantum Permutation Groups

We describe basic motivations behind quantum or noncommutative probability,
introduce quantum L\'evy processes on compact quantum groups, and discuss
several aspects of the study of the latter in the example of quantum
permutation groups. The first half of this paper is a survey on quantum
probability, compact quantum groups, and L\'evy processes on compact quantum
groups. In the second half the theory is applied to quantum permutations
groups. Explicit examples are constructed and certain classes of such L\'evy
processes are classified.Comment: 60 page
Downstream evolution of perturbations in a zero pressure gradient turbulent boundary layer

This paper examines the evolution of perturbations generated by various trips in a zero pressure gradient turbulent boundary layer. Measurements taken using hot-wire anemometry show that the evolution of the boundary layer towards the natural state is strongly dependent on the trip geometry. In particular the mechanisms creating the boundary layer appear to depend primarily on the wall normal distribution of blockage ratio, recovering the natural properties more rapidly for a uniform distribution of blockage (wall normal cylinders) than for non-uniform blockage (sawtooth fence). The relative size of the trip with respect to the boundary layer is shown to be a second order effect. Standard behaviour (characterized by the skin friction coefficient, CfCf, the wake component, ????, and the shape factor, H) is recovered successfully 500D???75h500D???75h downstream, presenting 175%175% higher momentum thickness, ????, than the natural case for the same downstream distance
Fire detection from social media images by means of instance-based learning

Social media can provide valuable information to support decision making in crisis management, such as in accidents, explosions, and fires. However, much of the data from social media are images, which are uploaded at a rate that makes it impossible for human beings to analyze them. To cope with that problem, we design and implement a database-driven architecture for fast and accurate fire detection named FFireDt. The design of FFireDt uses the instance-based learning through indexed similarity queries expressed as an extension of the relational Structured Query Language. Our contributions are: (i) the design of the Fast-Fire Detection (FFireDt), which achieves efficiency and efficacy rates that rival to the state-of-the-art techniques; (ii) the sound evaluation of 36 image descriptors, for the task of image classification in social media; (iii) the evaluation of content-based indexing with respect to the construction of instance-based classification systems; and (iv) the curation of a ground-truth annotated dataset of fire images from social media. Using real data from Flickr, the experiments showed that system FFireDt was able to achieve a precision for fire detection comparable to that of human annotators. Our results are promising for the engineering of systems to monitor images uploaded to social media services.FAPESPCNPqCAPESSTIC-AmSudRESCUER project, funded by the European Commission (Grant: 614154) and by the CNPq/MCTI (Grant: 490084/2013-3)International Conference on Enterprise Information Systems - ICEIS (17. 2015 Barcelona
Implementing Multidimensional Data Warehouses into NoSQL

International audienceNot only SQL (NoSQL) databases are becoming increasingly popular and have some interesting strengths such as scalability and flexibility. In this paper, we investigate on the use of NoSQL systems for implementing OLAP (On-Line Analytical Processing) systems. More precisely, we are interested in instantiating OLAP systems (from the conceptual level to the logical level) and instantiating an aggregation lattice (optimization). We define a set of rules to map star schemas into two NoSQL models: column-oriented and document-oriented. The experimental part is carried out using the reference benchmark TPC. Our experiments show that our rules can effectively instantiate such systems (star schema and lattice). We also analyze differences between the two NoSQL systems considered. In our experiments, HBase (column-oriented) happens to be faster than MongoDB (document-oriented) in terms of loading time
Predicting pre-triage waiting time in a maternity emergency room through data mining

An unsuitable patient flow as well as prolonged waiting lists in the emergency room of a maternity unit, regarding gynecology and obstetrics care, can affect the mother and child’s health, leading to adverse events and consequences regarding their safety and satisfaction. Predicting the patients’ waiting time in the emergency room is a means to avoid this problem. This study aims to predict the pre-triage waiting time in the emergency care of gynecology and obstetrics of Centro Materno Infantil do Norte (CMIN), the maternal and perinatal care unit of Centro Hospitalar of Oporto, situated in the north of Portugal. Data mining techniques were induced using information collected from the information systems and technologies available in CMIN. The models developed presented good results reaching accuracy and specificity values of approximately 74% and 94%, respectively. Additionally, the number of patients and triage professionals working in the emergency room, as well as some temporal variables were identified as direct enhancers to the pre-triage waiting time. The imp lementation of the attained knowledge in the decision support system and business intelligence platform, deployed in CMIN, leads to the optimization of the patient flow through the emergency room and improving the quality of services
Real-Time models to predict the use of vasopressors in monitored patients

The needs of reducing human error has been growing in every field of study, and medicine is one of those. Through the implementation of technologies is possible to help in the decision making process of clinics, therefore to reduce the difficulties that are typically faced. This study focuses on easing some of those difficulties by presenting real-time data mining models capable of predicting if a monitored patient, typically admitted in intensive care, will need to take vasopressors. Data Mining models were induced using clinical variables such as vital signs, laboratory analysis, among others. The best model presented a sensitivity of 94.94%. With this model it is possible reducing the misuse of vasopressors acting as prevention. At same time it is offered a better care to patients by anticipating their treatment with vasopressors
Complexity of Steiner Tree in Split Graphs - Dichotomy Results

Given a connected graph $G$ and a terminal set $R \subseteq V(G)$, {\em
Steiner tree} asks for a tree that includes all of $R$ with at most $r$ edges
for some integer $r \geq 0$. It is known from [ND12,Garey et. al
\cite{steinernpc}] that Steiner tree is NP-complete in general graphs. {\em
Split graph} is a graph which can be partitioned into a clique and an
independent set. K. White et. al \cite{white} has established that Steiner tree
in split graphs is NP-complete. In this paper, we present an interesting
dichotomy: we show that Steiner tree on $K_{1,4}$-free split graphs is
polynomial-time solvable, whereas, Steiner tree on $K_{1,5}$-free split graphs
is NP-complete. We investigate $K_{1,4}$-free and $K_{1,3}$-free (also known as
claw-free) split graphs from a structural perspective. Further, using our
structural study, we present polynomial-time algorithms for Steiner tree in
$K_{1,4}$-free and $K_{1,3}$-free split graphs. Although, polynomial-time
solvability of $K_{1,3}$-free split graphs is implied from $K_{1,4}$-free split
graphs, we wish to highlight our structural observations on $K_{1,3}$-free
split graphs which may be used in other combinatorial problems.Comment: 12 pages, 2 figures, CALDAM 201
On hamiltonian colorings of trees

A hamiltonian coloring $c$ of a graph $G$ of order $n$ is a mapping $c$ :
$V(G) \rightarrow \{0,1,2,...\}$ such that $D(u, v)$ + $|c(u) - c(v)|$ $\geq$
$n-1$, for every two distinct vertices $u$ and $v$ of $G$, where $D(u, v)$
denotes the detour distance between $u$ and $v$ which is the length of a
longest $u,v$-path in $G$. The value $hc(c)$ of a hamiltonian coloring $c$ is
the maximum color assigned to a vertex of $G$. The hamiltonian chromatic
number, denoted by $hc(G)$, is the min{$hc(c)$} taken over all hamiltonian
coloring $c$ of $G$. In this paper, we present a lower bound for the
hamiltonian chromatic number of trees and give a sufficient condition to
achieve this lower bound. Using this condition we determine the hamiltonian
chromatic number of symmetric trees, firecracker trees and a special class of
caterpillars.Comment: 12 pages, CALDAM 2016 conference proceeding pape
Complex synchronization patterns in the human connectome network

A major challenge in neuroscience is posed by the need for relating the
emerging dynamical features of brain activity with the underlying modular
structure of neural connections, hierarchically organized throughout several
scales. The spontaneous emergence of coherence and synchronization across such
scales is crucial to neural function, while its anomalies often relate to
pathological conditions. Here we provide a numerical study of synchronization
dynamics in the human connectome network. Our purpose is to provide a detailed
characterization of the recently uncovered broad dynamic regime, interposed
between order and disorder, which stems from the hierarchical modular
organization of the human connectome. In this regime -similar in essence to a
Griffiths phase- synchronization dynamics are trapped within metastable
attractors of local coherence. Here we explore the role of noise, as an
effective description of external perturbations, and discuss how its presence
accounts for the ability of the system to escape intermittently from such
attractors and explore complex dynamic repertoires of locally coherent states,
in analogy with experimentally recorded patterns of cerebral activity.Comment: 12pages, 6 Figure
Detection of non-self-correcting nature of information cascade

We propose a method of detecting non-self-correcting information cascades in
experiments in which subjects choose an option sequentially by observing the
choices of previous subjects. The method uses the correlation function $C(t)$
between the first and the $t+1$-th subject's choices. $C(t)$ measures the
strength of the domino effect, and the limit value $c\equiv \lim_{t\to
\infty}C(t)$ determines whether the domino effect lasts forever $(c>0)$ or not
$(c=0)$. The condition $c>0$ is an adequate condition for a non-self-correcting
system, and the probability that the majority's choice remains wrong in the
limit $t\to \infty$ is positive. We apply the method to data from two
experiments in which $T$ subjects answered two-choice questions: (i) general
knowledge questions ($T_{avg}=60$) and (ii) urn-choice questions ($T=63$). We
find $c>0$ for difficult questions in (i) and all cases in (ii), and the
systems are not self-correcting.Comment: 10 pages, 4 figure
Structure of a media co-occurrence network

Social networks have been of much interest in recent years. We here focus on
a network structure derived from co-occurrences of people in traditional
newspaper media. We find three clear deviations from what can be expected in a
random graph. First, the average degree in the empirical network is much lower
than expected, and the average weight of a link much higher than expected.
Secondly, high degree nodes attract disproportionately much weight. Thirdly,
relatively much of the weight seems to concentrate between high degree nodes.
We believe this can be explained by the fact that most people tend to co-occur
repeatedly with the same people. We create a model that replicates these
observations qualitatively based on two self-reinforcing processes: (1) more
frequently occurring persons are more likely to occur again; and (2) if two
people co-occur frequently, they are more likely to co-occur again. This
suggest that the media tends to focus on people that are already in the news,
and that they reinforce existing co-occurrences
From thermal rectifiers to thermoelectric devices

We discuss thermal rectification and thermoelectric energy conversion from
the perspective of nonequilibrium statistical mechanics and dynamical systems
theory. After preliminary considerations on the dynamical foundations of the
phenomenological Fourier law in classical and quantum mechanics, we illustrate
ways to control the phononic heat flow and design thermal diodes. Finally, we
consider the coupled transport of heat and charge and discuss several general
mechanisms for optimizing the figure of merit of thermoelectric efficiency.Comment: 42 pages, 22 figures, review paper, to appear in the Springer Lecture
  Notes in Physics volume "Thermal transport in low dimensions: from
  statistical physics to nanoscale heat transfer" (S. Lepri ed.
Kinetic theory of phonons in weakly anharmonic particle chains

The aim of this review is to develop the kinetic theory of phonons in
classical particle chains to a point which allows comparing the kinetic theory
of normally conducting chains, with an anharmonic pinning potential, to the
kinetic theory of the anomalously conducting FPU chains. In addition to
reviewing existing results from the literature, we present a streamlined
derivation of the phonon Boltzmann collision operators using Wick polynomials,
as well as details about the estimates which are needed to study the effect of
the collision operator. This includes explicit solutions of the collisional
constraints, both with and without harmonic pinning. We also recall in detail
the derivation of the Green-Kubo formula for thermal conductivity in these
systems, and the relation between entropy and the Boltzmann H-theorem for the
phonon Boltzmann equations. The focus is in systems which are spatially
translation invariant perturbations of thermal equilibrium states. We apply the
results to obtain detailed predictions from kinetic theory for the Green-Kubo
correlation functions, and hence the thermal conductivities, of the chain with
a quartic pinning potential as well as the standard FPU-beta chain.Comment: 47 pages, 2 figures. v2: additional references, corrected misprints,
  and fixed problems with the layout. v3: to appear in the Springer Lecture
  Notes in Physics volume "Thermal transport in low dimensions: from
  statistical physics to nanoscale heat transfer" (S. Lepri ed.) v4: added
  support details into Acknowledgment
Thermal conductivity in harmonic lattices with random collisions

International audienceWe review recent rigorous mathematical results about the macroscopic behaviour of harmonic chains with the dynamics perturbed by a random exchange of velocities between nearest neighbor particles. The random exchange models the effects of nonlinearities of anharmonic chains and the resulting dynamics have similar macroscopic behaviour. In particular there is a superdiffusion of energy for unpinned acoustic chains. The corresponding evolution of the temperature profile is governed by a fractional heat equation. In non-acoustic chains we have normal diffusivity, even if momentum is conserved
North Atlantic Rhodolith Beds

Aggregations of living unattached corallines, previously often referred to as nodules, were given the name rhodoliths by Bosselini and Ginsburg ( 1971 ). Adey and MacIntyre ( 1973 ) provided an early discussion of their genesis and distribution. Such aggregations have long been known as maerl in the North East Atlantic, a Breton term for unattached thalli that lack a shell or pebble core (Irvine and Chamberlain 1994 ). Here, we provide an overview of rhodolith/maerl occurrence in the colder/temperate waters of the North Atlantic and summarize the distribution, species composition, biodiversity and ecological importance of these habitats
Effects of Ocean Warming and Acidification on Rhodolith/Maërl Beds

Coralline algae are expected to be adversely impacted by global warming and ocean acidification, although there has been no synthesis of these effects on habitat-forming species. We compiled published responses of maërl and rhodolith-forming species to ocean acidification and warming. Although the response is variable among species, their recruitment, growth, health and survival are usually negatively affected under elevated CO2. Most studies show that coralline algal calcification is adversely affected under near-future ocean acidification scenarios and that in combination with a 1–3 °C increase in seawater temperature this has an even larger impact. Most research has involved relatively short-term experiments on single species, which makes it difficult to predict long-term effects at the ecosystem level because the impact of global changes on coralline algal habitats will depend on the direct impacts on individual species and the indirect effects of altered interspecific interactions. Studies in areas with naturally high CO2 levels show that coralline algae are adversely affected by long-term acidification through increased competition from non-calcified competitors. Coralline algal habitats such as vermetid reefs, coralligene and beds of rhodoliths or maerl are likely to decline in the near future as higher CO2 levels benefit fleshy algae and corrosive waters reduce calcareous habitat complexity and associated biodiversity
Bulk and Boundary Invariants for Complex Topological Insulators: From
  K-Theory to Physics

This monograph offers an overview on the topological invariants in fermionic
topological insulators from the complex classes. Tools from K-theory and
non-commutative geometry are used to define bulk and boundary invariants, to
establish the bulk-boundary correspondence and to link the invariants to
physical observables.Comment: Monograph in Springer Series in Mathematical Physics Studies, see
  ISBN below. Correction of a few remaining typos. ISBN 978-3-319-29350-9,
  eBook ISBN 978-3-319-29351-6, (Springer, 2016
Decentralized Control for Optimizing Communication with Infeasible Regions

In this paper we present a decentralized gradient-based controller that optimizes communication between mobile aerial vehicles and stationary ground sensor vehicles in an environment with infeasible regions. The formulation of our problem as a MIQP is easily implementable, and we show that the addition of a scaling matrix can improve the range of attainable converged solutions by influencing trajectories to move around infeasible regions. We demonstrate the robustness of the controller in 3D simulation with agent failure, and in 10 trials of a multi-agent hardware experiment with quadrotors and ground sensors in an indoor environment. Lastly, we provide analytical guarantees that our controller strictly minimizes a nonconvex cost along agent trajectories, a desirable property for general multi-agent coordination tasks.United States. Army Research Office (Grant W911NF-08-2-0004