pinecone/core-2020-05-10-deduplication huggingface dataset:
Vision-based portuguese sign language recognition system

Vision-based hand gesture recognition is an area of active current research in computer vision and machine learning. Being a natural way of human interaction, it is an area where many researchers are working on, with the goal of making human computer interaction (HCI) easier and natural, without the need for any extra devices. So, the primary goal of gesture recognition research is to create systems, which can identify specific human gestures and use them, for example, to convey information. For that, vision-based hand gesture interfaces require fast and extremely robust hand detection, and gesture recognition in real time. Hand gestures are a powerful human communication modality with lots of potential applications and in this context we have sign language recognition, the communication method of deaf people. Sign lan- guages are not standard and universal and the grammars differ from country to coun- try. In this paper, a real-time system able to interpret the Portuguese Sign Language is presented and described. Experiments showed that the system was able to reliably recognize the vowels in real-time, with an accuracy of 99.4% with one dataset of fea- tures and an accuracy of 99.6% with a second dataset of features. Although the im- plemented solution was only trained to recognize the vowels, it is easily extended to recognize the rest of the alphabet, being a solid foundation for the development of any vision-based sign language recognition user interface system
On the impact of replacing a low-speed memory bus on the Maxeler platform, using the FPGA's configuration infrastructure

It is common for large hardware designs to have a number of registers or memories of which the contents have to be changed very seldom, e.g. only at startup. The conventional way of accessing these memories is using a low-speed memory bus. This bus uses valuable hardware resources, introduces long, global connections and contributes to routing congestion. Hence, it has an impact on the overall design even though it is only rarely used. A Field-Programmable Gate Array (FPGA) already contains a global communication mechanism in the form of its configuration infrastructure. In this paper we evaluate the use of the configuration infrastructure as a replacement for a low-speed memory bus on the Maxeler HPC platform. We find that by removing the conventional low-speed memory bus the maximum clock frequency of some applications can be improved by 8%. Improvements by 25% and more are also attainable, but constraints of the Xilinx reconfiguration infrastructure prevent fully exploiting these benefits at the moment. We present a number of possible changes to the Xilinx reconfiguration infrastructure and tools that would solve this and make these results more widely applicable
Dynamic Epistemic Logic as a Substructural Logic

International audienceDynamic Epistemic Logic (DEL) is an influential logical framework for reasoning about the dynamics of beliefs and knowledge. It has been related to older and more established logical frameworks. Despite these connections, DEL remains, arguably, a rather isolated logic in the vast realm of non-classical logics and modal logics. This is problematic if logic is to be viewed ultimately as a unified and unifying field and if we want to avoid that DEL goes on "riding off madly in all directions" (a metaphor used by van Benthem about logic in general). In this article, we show that DEL can be redefined naturally and meaningfully as a two-sorted substructural logic. In fact, it is even one of the most primitive substructural logics since it does not preserve any of the structural rules. Moreover, the ternary semantics of DEL and its dynamic interpretation provides a conceptual foundation for the Routley & Meyer's semantics of substructural logics
Intensionality, Definability and Computation

We look at intensionality from the perspective of computation. In particular,
we review how game semantics has been used to characterize the sequential
functional processes, leading to powerful and flexible methods for constructing
fully abstract models of programming languages, with applications in program
analysis and verification. In a broader context, we can regard game semantics
as a first step towards developing a positive theory of intensional structures
with a robust mathematical structure, and finding the right notions of
invariance for these structures.Comment: 23 page
Comparing theories: the dynamics of changing vocabulary. A case-study in
  relativity theory

There are several first-order logic (FOL) axiomatizations of special
relativity theory in the literature, all looking essentially different but
claiming to axiomatize the same physical theory. In this paper, we elaborate a
comparison, in the framework of mathematical logic, between these FOL theories
for special relativity. For this comparison, we use a version of mathematical
definability theory in which new entities can also be defined besides new
relations over already available entities. In particular, we build an
interpretation of the reference-frame oriented theory SpecRel into the
observationally oriented Signalling theory of James Ax. This interpretation
provides SpecRel with an operational/experimental semantics. Then we make
precise, "quantitative" comparisons between these two theories via using the
notion of definitional equivalence. This is an application of logic to the
philosophy of science and physics in the spirit of Johan van Benthem's work.Comment: 27 pages, 8 figures. To appear in Springer Book series Trends in
  Logi
Exploring the Space of IR Functions

International audienceIn this paper we propose an approach to discover functions for IR ranking from a space of simple closed-form mathematical func-tions. In general, all IR ranking models are based on two basic variables, namely, term frequency and document frequency. Here a grammar for generating all possible functions is defined which consists of the two above said variables and basic mathematical operations -addition, sub-traction, multiplication, division, logarithm, exponential and square root. The large set of functions generated by this grammar is filtered by check-ing mathematical feasibility and satisfiability to heuristic constraints on IR scoring functions proposed by the community. Obtained candidate functions are tested on various standard IR collections and several sim-ple but highly efficient scoring functions are identified. We show that these newly discovered functions are outperforming other state-of-the-art IR scoring models through extensive experimentation on several IR collections. We also compare the performance of functions satisfying IR constraints to those which do not, and show that the former set of func-tions clearly outperforms the latter one 3
A comparison of approaches for measuring cross-lingual similarity of wikipedia articles

Wikipedia has been used as a source of comparable texts for a range of tasks, such as Statistical Machine Translation and Cross-Language Information Retrieval. Articles written in different languages on the same topic are often connected through inter-language-links. However, the extent to which these articles are similar is highly variable and this may impact on the use of Wikipedia as a comparable resource. In this paper we compare various language-independent methods for measuring cross-lingual similarity: character n-grams, cognateness, word count ratio, and an approach based on outlinks. These approaches are compared against a baseline utilising MT resources. Measures are also compared to human judgements of similarity using a manually created resource containing 700 pairs of Wikipedia articles (in 7 language pairs). Results indicate that a combination of language-independent models (char-n-grams, outlinks and word-count ratio) is highly effective for identifying cross-lingual similarity and performs comparably to language-dependent models (translation and monolingual analysis).Peer ReviewedPreprin
Sentiment analysis and the impact of employee satisfaction on firm earnings

Prior text mining studies of corporate reputational sentiment based on newswires, blogs and Twitter feeds have mostly captured reputation from the perspective of two groups of stakeholders - the media and consumers. In this study we examine the sentiment of a potentially overlooked stakeholder group, namely, the firm's employees. First, we present a novel dataset that uses online employee reviews to capture employee satisfaction. We employ LDA to identify salient aspects in employees' reviews, and manually infer one latent topic that appears to be associated with the firm's outlook. Second, we create a composite document by aggregating employee reviews for each firm and measure employee sentiment as the polarity of the composite document using the General Inquirer dictionary to count positive and negative terms. Finally, we define employee satisfaction as a weighted combination of the firm outlook topic cluster and employee sentiment. The results of our joint aspect-polarity model suggest that it may be beneficial for investors to incorporate a measure of employee satisfaction into their method for forecasting firm earnings
New Challenges in Grid Generation and Adaptivity for Scientific Computing

This volume collects selected contributions from the “Fourth Tetrahedron Workshop on Grid Generation for Numerical Computations”, which was held in Verbania, Italy in July 2013. The previous editions of this Workshop were hosted by the Weierstrass Institute in Berlin (2005), by INRIA Rocquencourt in Paris (2007), and by Swansea University (2010).
This book covers different, though related, aspects of the field: the generation of quality grids for complex three-dimensional geometries; parallel mesh generation algorithms; mesh adaptation, including both theoretical and implementation aspects; grid generation and adaptation on surfaces – all with an interesting mix of numerical analysis, computer science and strongly application-oriented problems
Internet-Based Therapies for Child and Adolescent Emotional and Behavioral Problems

This chapter discusses the development and evaluation of Internet-delivered cognitive behavior therapy (ICBT) in the treatment of emotional and behavior disorders in children and adolescents. Although most evaluations of ICBT to date have focused on adults, the literature regarding its use with young people is rapidly expanding. Results thus far have been strongly encouraging, with many studies showing positive outcomes in terms of reduction in symptoms associated with a broad range of psychological disorders and in enhancing emotional well-being and psychosocial functioning. However, the research is still in its early stages and it is difficult to draw firm conclusions regarding the effectiveness of ICBT with young people. The wide variation in the way that ICBT is used also makes it hard to identify the most effective formats for treatment delivery, particularly in terms of level of therapist involvement, parent participation, group online interactivity, and type of Internet material. Despite these reservations, the evidence to date provides a strong case for continued research into the development and evaluation of ICBT approaches with young people in order to determine the most effective approaches. What is clear, however, is that young people find ICBT a very appropriate method of intervention. Nevertheless, one of the big challenges is to find methods of enhancing client engagement, motivation, and compliance with the therapy content.Griffith Health, Australian Institute for Suicide Research & PreventionFull Tex
The Parameterized Complexity of Domination-type Problems and Application
  to Linear Codes

We study the parameterized complexity of domination-type problems.
(sigma,rho)-domination is a general and unifying framework introduced by Telle:
a set D of vertices of a graph G is (sigma,rho)-dominating if for any v in D,
|N(v)\cap D| in sigma and for any $v\notin D, |N(v)\cap D| in rho. We mainly
show that for any sigma and rho the problem of (sigma,rho)-domination is W[2]
when parameterized by the size of the dominating set. This general statement is
optimal in the sense that several particular instances of
(sigma,rho)-domination are W[2]-complete (e.g. Dominating Set). We also prove
that (sigma,rho)-domination is W[2] for the dual parameterization, i.e. when
parameterized by the size of the dominated set. We extend this result to a
class of domination-type problems which do not fall into the
(sigma,rho)-domination framework, including Connected Dominating Set. We also
consider problems of coding theory which are related to domination-type
problems with parity constraints. In particular, we prove that the problem of
the minimal distance of a linear code over Fq is W[2] for both standard and
dual parameterizations, and W[1]-hard for the dual parameterization.
  To prove W[2]-membership of the domination-type problems we extend the
Turing-way to parameterized complexity by introducing a new kind of non
deterministic Turing machine with the ability to perform `blind' transitions,
i.e. transitions which do not depend on the content of the tapes. We prove that
the corresponding problem Short Blind Multi-Tape Non-Deterministic Turing
Machine is W[2]-complete. We believe that this new machine can be used to prove
W[2]-membership of other problems, not necessarily related to dominationComment: 19 pages, 2 figure
A compositional monitoring framework for hard real-time systems

Runtime Monitoring of hard real-time embedded systems is a promising technique for ensuring that a running system respects timing constraints, possibly combined with faults originated by the software and/or hardware. This is particularly important when we have real-time embedded systems made of several components that must combine different levels of criticality, and different levels of correctness requirements. This paper introduces a compositional monitoring framework coupled with guarantees that include time isolation and the response time of a monitor for a predicted violation. The kind of monitors that we propose are automatically generated by synthesizing logic formulas of a timed temporal logic, and their correctness is ensured by construction.This work was partially supported by National Funds through FCT (Portuguese Foundation for Science and Technology) and by ERDF (European Regional Development Fund) through COMPETE (Operational Programme ’Thematic Factors of Competitiveness’), within projects Ref. FCOMP-01-0124-FEDER-022701 (CISTER), FCOMP-01-0124- FEDER-015006 (VIPCORE) and FCOMP-01-0124-FEDER-020486 (AVIACC)
Formal verification of kLIBC with the WP frama-C plug-in

This paper presents our results in the formal verification of kLIBC, a minimalistic C library, using the Frama-C/WP tool. We report how we were able to completely verify a significant number of functions from <string.h> and <stdio.h>. We discuss difficulties encountered and describe in detail a problem in the implementation of common <string.h> functions, for which we suggest alternative implementations. Our work shows that it is presently already viable to verify low-level C code, with heavy usage of pointers. Although the properties proved tend to be shallower as the code becomes of a lower-level nature, it is our view that this is an important direction towards real-world software verification, which cannot be attained by focusing on deep properties of cleaner code, written specifically to be verified.This work is funded by ERDF - European Regional Development Fund through the COMPETE Programme (operational programme for competitiveness) and by National Funds through the FCT - Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) within project FCOMP-01-0124-FEDER-020486
Conformal inversion and Maxwell field invariants in four- and
  six-dimensional spacetimes

Conformally compactified (3+1)-dimensional Minkowski spacetime may be
identified with the projective light cone in (4+2)-dimensional spacetime. In
the latter spacetime the special conformal group acts via rotations and boosts,
and conformal inversion acts via reflection in a single coordinate.
Hexaspherical coordinates facilitate dimensional reduction of Maxwell
electromagnetic field strength tensors to (3+1) from (4 + 2) dimensions. Here
we focus on the operation of conformal inversion in different
coordinatizations, and write some useful equations. We then write a conformal
invariant and a pseudo-invariant in terms of field strengths; the
pseudo-invariant in (4+2) dimensions takes a new form. Our results advance the
study of general nonlinear conformal-invariant electrodynamics based on
nonlinear constitutive equations.Comment: 10 pages, birkjour.cls, submitted for the Proceedings of the XXXIInd
  Workshop on Geometric Methods in Physics, (Bialowieza, Poland, July 2013),
  v2: minor improvement
Complete solution of a constrained tropical optimization problem with
  application to location analysis

We present a multidimensional optimization problem that is formulated and
solved in the tropical mathematics setting. The problem consists of minimizing
a nonlinear objective function defined on vectors over an idempotent semifield
by means of a conjugate transposition operator, subject to constraints in the
form of linear vector inequalities. A complete direct solution to the problem
under fairly general assumptions is given in a compact vector form suitable for
both further analysis and practical implementation. We apply the result to
solve a multidimensional minimax single facility location problem with
Chebyshev distance and with inequality constraints imposed on the feasible
location area.Comment: 20 pages, 3 figure
Cosmological models and stability

Principles in the form of heuristic guidelines or generally accepted dogma
play an important role in the development of physical theories. In particular,
philosophical considerations and principles figure prominently in the work of
Albert Einstein. As mentioned in the talk by Jiri Bicak at this conference
Einstein formulated the equivalence principle, an essential step on the road to
general relativity, during his time in Prague 1911-1912. In this talk, I would
like to discuss some aspects of cosmological models. As cosmology is an area of
physics where "principles" such as the "cosmological principle" or the
"Copernican principle" play a prominent role in motivating the class of models
which form part of the current standard model, I will start by comparing the
role of the equivalence principle to that of the principles used in cosmology.
I will then briefly describe the standard model of cosmology to give a
perspective on some mathematical problems and conjectures on cosmological
models, which are discussed in the later part of this paper.Comment: Based on a talk at the conference "Relativity and Gravitation, 100
  Years after Einstein in Prague", at Charles University, Prague, June 25-29,
  201
The Role of Responsible HRM Practices and a Culture-Related Capability on the CSR-Performance Association: A Small Firm Perspective

This chapter focuses on the role that responsible human resource management practices (HRM) play in relation to proactive corporate social responsibility (CSR) and its impact on firm performance, using evidence from small firms in the Australian manufacturing industry. The empirical evidence reveals the critical moderating contribution of responsible HRM practices in the implementation of proactive CSR and enhancement of financial performance in small firms. The study findings indicate the need for managers of small firms, who wish to boost financial competitiveness through proactive CSR, to adopt responsible HRM practices that avoid a directive approach and which foster employee participation and engagement. It is suggested that this can be done by leveraging the relative informality of work organisation and familial ties that help engender trust and reciprocity in small firms.Griffith Business School, Dept of Employment Relations and Human ResourcesFull Tex
The computational complexity of density functional theory

Density functional theory is a successful branch of numerical simulations of
quantum systems. While the foundations are rigorously defined, the universal
functional must be approximated resulting in a `semi'-ab initio approach. The
search for improved functionals has resulted in hundreds of functionals and
remains an active research area. This chapter is concerned with understanding
fundamental limitations of any algorithmic approach to approximating the
universal functional. The results based on Hamiltonian complexity presented
here are largely based on \cite{Schuch09}. In this chapter, we explain the
computational complexity of DFT and any other approach to solving electronic
structure Hamiltonians. The proof relies on perturbative gadgets widely used in
Hamiltonian complexity and we provide an introduction to these techniques using
the Schrieffer-Wolff method. Since the difficulty of this problem has been well
appreciated before this formalization, practitioners have turned to a host
approximate Hamiltonians. By extending the results of \cite{Schuch09}, we show
in DFT, although the introduction of an approximate potential leads to a
non-interacting Hamiltonian, it remains, in the worst case, an NP-complete
problem.Comment: Contributed chapter to "Many-Electron Approaches in Physics,
  Chemistry and Mathematics: A Multidisciplinary View
Lieb-Robinson bounds and the simulation of time evolution of local
  observables in lattice systems

This is an introductory text reviewing Lieb-Robinson bounds for open and
closed quantum many-body systems. We introduce the Heisenberg picture for
time-dependent local Liouvillians and state a Lieb-Robinson bound that gives
rise to a maximum speed of propagation of correlations in many body systems of
locally interacting spins and fermions. Finally, we discuss a number of
important consequences concerning the simulation of time evolution and
properties of ground states and stationary states.Comment: 13 pages, 2 figures; book chapte
Spurious Modes in Dirac Calculations and How to Avoid Them

In this paper we consider the problem of the occurrence of spurious modes
when computing the eigenvalues of Dirac operators, with the motivation to
describe relativistic electrons in an atom or a molecule. We present recent
mathematical results which we illustrate by simple numerical experiments. We
also discuss open problems.Comment: Chapter to be published in the book "Many-Electron Approaches in
  Physics, Chemistry and Mathematics: A Multidisciplinary View", edited by
  Volker Bach and Luigi Delle Sit
Levy-Lieb Principle meets Quantum Monte Carlo

We review an approach where the energy functional of Density-Functional
Theory (DFT) can be determined without empiricism via a Quantum Monte Carlo
(QMC) procedure. The idea consists of a nested iterative loop where the
configurational space of the electrons in the QMC procedure is determined by a
trial oneparticle electron density; this allows then for the determination of a
first guess for the energy functional, which is then in turn used for a DFT
minimization process. This latter delivers a new electron density and the loop
is repeated iteratively until convergence is reached and thus the electronic
structure of the system determined. In essence, from the applied point of view,
such an approach is a compromise between the large computational cost but high
accuracy of QMC and the reasonable computational cost but lower accuracy of
DFT. The proposed approach goes beyond the standard Kohn-Sham method, which is
the standard in DFT, and requires neither orbitals nor the a priori
specification of the exchange and correlation functional. From the conceptual
point of view, the relevant aspect is that the 3N-dimensional wavefunction is
derived as a function(al) of the three-dimensional electron density, which is
the key principle of DFT.Comment: 14 pages, 1 figure; To appear in: "Many-Electron Approaches in
  Physics, Chemistry and Mathematics: A Multidisciplinary View", V.Bach and
  L.Delle Site Eds. Springer (2014