pinecone/core-2020-05-10-deduplication huggingface dataset:
Infinite exchangeability for sets of desirable gambles

Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We study infinite exchangeability assessments for them, and give a counterpart of de Finetti's infinite representation theorem. We show how the infinite representation in terms of frequency vectors is tied up with multivariate Bernstein (basis) polynomials. We also lay bare the relationships between the representations of updated exchangeable models, and discuss conservative inference (natural extension) under exchangeability
Model-based hand gesture tracking in ToF image sequences

This paper presents a Time-of-Flight (ToF) camera based system for hand motion and gesture tracking. A 27 degree of freedom\ud
(DOF) hand model is constructed and fleshed out by ellipsoids. This allows the synthesis of range images of the model through projective geometry. The hand pose is then tracked with a particle filter by statistically measuring the hypothetical pose against the ToF input image; where the inside/outside alignment of the hand pixels and the depth differences serve as classifying metrics. The high DOF tracking problem for the particle filter is addressed by reducing the high dimensionality of the\ud
joint angle space to a low dimensional space via Principal Component Analysis (PCA). The basis vectors are learned from a few basic model configurations and the transformations between these poses. This results in a system capable of practical hand tracking in a restricted gesture configuration space.Postprint (published version
Adjusting animation rings to human-like 3D models

In the animation process of a human-like 3D model, a skeleton must be specified to define the model’s surface deformation of its\ud
limbs. Nowadays the skeleton specification is hand made and very time consuming task. In this paper we propose a novel semi-automatic method for rigging a 3D model in an arbitrary pose using a skeleton defined in an animation datafile with no specific initial pose. First a skeleton is\ud
extracted from the voxelizated model, this skeleton is refined and transformed into a tree-data structure. Because the 3D model can be in an arbitrary pose, user interaction is required to select the five limbs correspondence (head, hands and feet), and finally a skeleton taken from an animation data file or a external source is adjusted to the geometric skeleton.Peer ReviewedPostprint (published version
Skeleton and shape adjustment and tracking in multicamera environments

In this paper we present a method for automatic body model adjustment and motion tracking in multicamera environments.We introduce a set of shape deformation parameters based on linear blend skinning,\ud
that allow a deformation related to the scaling of the distinct bones of the body model skeleton, and a deformation in the radial direction of a bone. The adjustment of a generic body model to a specific subject\ud
is achieved by the estimation of those shape deformation parameters.\ud
This estimation combines a local optimization method and hierarchical\ud
particle filtering, and uses an efficient cost function based on foreground\ud
silhouettes using GPU. This estimation takes into account anthropometric constraints by using a rejection sampling method of propagation of particles. We propose a hierarchical particle filtering method for motion tracking using the adjusted model. We show accurate model adjustment and tracking for distinct subjects in a 5 cameras set up.Postprint (published version
High Fidelity Haptic Rendering for Deformable Objects Undergoing Topology Changes

International audienceThe relevance of haptic feedback for minimally invasive surgery has been demonstrated at numerous counts. However, the proposed methods often prove inadequate to handle correct contact computation during the complex interactions or topological changes that can be found in surgical interventions. In this paper, we introduce an approach that allows for accurate computation of contact forces even in the presence of topological changes due to the simulation of soft tissue cutting. We illustrate this approach with a simulation of cataract surgery, a typical example of microsurgery
Relations among notions of complete non-malleability: indistinguishability characterisation and efficient construction without random oracles

We study relations among various notions of complete non-malleability, where an adversary can tamper with both ciphertexts and public-keys, and ciphertext indistinguishability. We follow the pattern of relations previously established for standard non-malleability. To this end, we propose a more convenient and conceptually simpler indistinguishability-based security model to analyse completely non-malleable schemes. Our model is based on strong decryption oracles, which provide decryptions under arbitrarily chosen public keys. We give the first precise definition of a strong decryption oracle, pointing out the subtleties in different approaches that can be taken. We construct the first efficient scheme, which is fully secure against strong chosen-ciphertext attacks, and therefore completely non-malleable, without random oracles.The authors were funded in part by eCrypt II (EU FP7 - ICT-2007-216646) and FCT project PTDC/EIA/71362/2006. The second author was also funded by FCT grant BPD-47924-2008
Strong knowledge extractors for public-key encryption schemes

Completely non-malleable encryption schemes resist attacks which allow an adversary to tamper with both ciphertexts and public keys. In this paper we introduce two extractor-based properties that allow us to gain insight into the design of such schemes and to go beyond known feasibility results in this area. We formalise strong plaintext awareness and secret key awareness and prove their suitability in realising these goals. Strong plaintext awareness imposes that it is infeasible to construct a ciphertext under any public key without knowing the underlying message. Secret key awareness requires it to be infeasible to produce a new public key without knowing a corresponding secret key.The authors were funded in part by eCrypt II (EU FP7 - ICT-2007-216646) and FCT project PTDC/EIA/71362/2006. The second author was also funded by FCT grant BPD-47924-2008
Towards accessible interactions with pervasive interfaces, based on human capabilities

This conference paper was published in "Computers Helping People with Special Needs, Part I" [© Springer Verlag Berlin / Heidelberg]. The original publication is available at http://www.springer.com/computer/hci/book/978-3-642-14096-9We draw on the literature, established standards and practices, contemporary funded projects and ongoing proof-of-concept work\ud
to argue for accessibility advocates to capitalise on the current paradigm\ud
shift towards ubiquitous, distributed and collaborative information systems. We discuss the contemporary interaction trends and accessibility\ud
challenges that give rise to our proposal; describe and provide an argument for capability-based development over the current, more device-\ud
focused, approach and document ongoing proof-of-concept and funded\ud
development work in this area
Accessibility of eGovernment Web Sites: Towards a Collaborative Retrofitting Approach

Published version of a chapter from the book: Computers Helping People with Special Needs.The original publication is available at www.springerlink.com: http://dx.doi.org/10.1007/978-3-642-14097-6_75Accessibility benchmarking is efficient to raise awareness and initiate competition. However, traditional benchmarking is of little avail when it comes to removing barriers from eGovernment web sites in practice. Regulations and legal enforcement may be helpful in a long-term perspective. For more rapid progress both vendors and web site maintainers are willing to take short-term action towards improvements, provided that clear advise is available. The approach of the eGovernment Monitoring project (eGovMon) integrates benchmarking as a central activity in a user-driven project. In addition to benchmarking results, several other services and background information are provided to enable the users – in this case a group of Norwegian municipalities who want to improve the accessibility of their web sites – to gain real added value from benchmarking
Evaluating the users' satisfaction using inclusive initiatives in two different environments: the university and a research conference

This paper presents evaluation results of the user’s satisfaction using the APEINTA project which main aim is to provide accessibility in education, in and out of the classroom. APEINTA is the Spanish acronym for “Aiming for an Inclusive Education based on Assistive Technology”. The APEINTA project is focused in two main inclusive proposals: first, it deals with eliminating hard of hearing students’ communication barriers in the classroom, providing them automatic real-time captioning and other mechanisms for making easy the communication with the teacher and others students; and second, it deals also in providing an accessible Web learning platform with accessible digital resources, so every student can access them in and out of the classroom
The Essence of JavaScript

We reduce JavaScript to a core calculus structured as a small-step
operational semantics. We present several peculiarities of the language and
show that our calculus models them. We explicate the desugaring process that
turns JavaScript programs into ones in the core. We demonstrate faithfulness to
JavaScript using real-world test suites. Finally, we illustrate utility by
defining a security property, implementing it as a type system on the core, and
extending it to the full language.Comment: European Conference on Object-Oriented Programming (ECOOP) 201
Functional renormalization and ultracold quantum gases

The method of functional renormalization is applied to the theoretical
investigation of ultracold quantum gases. Flow equations are derived for a Bose
gas with approximately pointlike interaction, for a Fermi gas with two
(hyperfine) spin components in the Bardeen-Cooper-Schrieffer (BCS) to
Bose-Einstein condensation (BEC) crossover and for a Fermi gas with three
components. The solution of the flow equations determine the properties of
these systems both in the few-body regime and in thermal equilibrium.
  For the Bose gas this covers the quantum phase diagram, the condensate and
superfluid fraction, the critical temperature, the correlation length, the
specific heat or sound propagation. The properties are discussed both for three
and two spatial dimensions. The discussion of the Fermi gas in the BCS-BEC
crossover concentrates on the effect of particle-hole fluctuations but
addresses the complete phase diagram. For the three component fermions, the
flow equations in the few-body regime show a limit-cycle scaling and the Efimov
tower of three-body bound states. Applied to the case of Lithium they explain
recently observed three-body loss features. Extending the calculations by
continuity to nonzero density, it is found that a new trion phase separates a
BCS and a BEC phase for three component fermions close to a common resonance.
  More formal is the derivation of a new exact flow equation for scale
dependent composite operators. This equation allows for example a better
treatment of bound states.Comment: doctoral thesis, 187 pages, 60 figure
Assembly of 3D reconfigurable hybrid MOEMS through microrobotic approach.

International audienceMicro-assembly has been identified to be a critical technology in the microsystems technology and nanotechnology. Increasing needs of MOEMS (Micro- Opto-Electro- Mechanical Systems) for microsystems conducts to development of new concepts and skilled micro-assembly stations. This paper presents a 3D microassembly station used for the reconfigurable free space micro-optical benches (RFSMOB) which are a promising type of MOEMS. Designed parts of RFS-MOB are assembled by using the developed micro-assembly station. The flexibility of the micro-assembly station provides the possibility to manipulate a variety of microcomponents. The RFS-MOB design enables to reduce adhesion forces effects during releasing operations. Experimental results are shown and validate the effectiveness of the micro-assembly station and micro-assembly strategies
Real-Time Issues in Live Migration of Virtual Machines

This paper addresses the issue of how to meet the strict timing constraints of (soft) real-time virtualized applications while the Virtual Machine (VM) hosting them is undergoing a live migration. To this purpose, it is essential that the resource requirements of a migration are identified in advance, that appropriate resources are reserved to the process, and that multiple VMs sharing the same resources are temporally isolated from each other. The first issue is dealt with by introducing a stochastic model for the migration process. The other ones by introducing a methodology making use of proper scheduling algorithms (for both CPU and network) that allow for reserving resource shares to individual VMs. Also, an extensive set of simulations have been done by using traces of a VLC video server virtualized by using KVM on Linux. The traces have been obtained by patching KVM at the kernel level, and the same patch constitutes an important step towards the complete implementation of the proposed technique. The obtained results highlight the benefits of the proposed approach
The Challenges of Multivalued "Functions"

Although, formally, mathematics is clear that a function is a single-valued object, mathematical practice is looser, particularly with n-th roots and various inverse functions. In this paper, we point out some of the looseness, and ask what the implications are, both for Artifcial Intelligence and Symbolic Computation, of these practices. In doing so, we look at the steps necessary to convert existing texts into (a) rigorous statements (b) rigorously proved statements. In particular we ask whether there might be a constant "de Bruijn factor" [18] as we make these texts more formal, and conclude that the answer depends greatly on the interpretation being placed on the symbols
Automated Reasoning and Presentation Support for Formalizing Mathematics
  in Mizar

This paper presents a combination of several automated reasoning and proof
presentation tools with the Mizar system for formalization of mathematics. The
combination forms an online service called MizAR, similar to the SystemOnTPTP
service for first-order automated reasoning. The main differences to
SystemOnTPTP are the use of the Mizar language that is oriented towards human
mathematicians (rather than the pure first-order logic used in SystemOnTPTP),
and setting the service in the context of the large Mizar Mathematical Library
of previous theorems,definitions, and proofs (rather than the isolated problems
that are solved in SystemOnTPTP). These differences poses new challenges and
new opportunities for automated reasoning and for proof presentation tools.
This paper describes the overall structure of MizAR, and presents the automated
reasoning systems and proof presentation tools that are combined to make MizAR
a useful mathematical service.Comment: To appear in 10th International Conference on. Artificial
  Intelligence and Symbolic Computation AISC 201
A formal quantifier elimination for algebraically closed fields

The final publication is available at www.springerlink.comInternational audienceWe prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We first reify the first order theory of rings and prove that quantifier elimination leads to decidability. Then we implement an algorithm which constructs a quantifier free formula from any first order formula in the theory of ring. If the underlying ring is in fact an algebraically closed field, we prove that the two formulas have the same semantic. The algorithm producing the quantifier free formula is programmed in continuation passing style, which leads to both a concise program and an elegant proof of semantic correctness
A Wiki for Mizar: Motivation, Considerations, and Initial Prototype

Formal mathematics has so far not taken full advantage of ideas from
collaborative tools such as wikis and distributed version control systems
(DVCS). We argue that the field could profit from such tools, serving both
newcomers and experts alike. We describe a preliminary system for such
collaborative development based on the Git DVCS. We focus, initially, on the
Mizar system and its library of formalized mathematics.Comment: To appear in The 9th International Conference on Mathematical
  Knowledge Management: MKM 201
Wavelet Analysis of the Turbulent LES Data of the Lid-Driven Cavity Flow

International audienceBoth Fourier and wavelet transforms are performed on data obtained from large-eddy simulations of the turbulent flow in a lid-driven cubical cavity. The analyzed data or synthetic signals are picked at three specific points inside the cavity allowing to investigate three regimes over time: laminar, transitional and turbulent. The main objective of this study is to generate and analyze synthetic signals in order to confirm the correlation between the computed physical quantities and those expected theoretically
Placing regenerators in optical networks to satisfy multiple sets of requests.

The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, regenerators must be placed in such a way that in any lightpath there are no more than d hops without meeting a regenerator. While most of the research has focused on heuristics and simulations, the first theoretical study of the problem has been recently provided in [10], where the considered cost function is the number of locations in the network hosting regenerators. Nevertheless, in many situations a more accurate estimation of the real cost of the network is given by the total number of regenerators placed at the nodes, and this is the cost function we consider. Furthermore, in our model we assume that we are given a finite set of p possible traffic patterns (each given by a set of lightpaths), and our objective is to place the minimum number of regenerators at the nodes so that each of the traffic patterns is satisfied. While this problem can be easily solved when d = 1 or p = 1, we prove that for any fixed d,p ≥ 2 it does not admit a PTASUnknown control sequence '\textsc', even if G has maximum degree at most 3 and the lightpaths have length O(d)(d). We complement this hardness result with a constant-factor approximation algorithm with ratio ln (d ·p). We then study the case where G is a path, proving that the problem is NP-hard for any d,p ≥ 2, even if there are two edges of the path such that any lightpath uses at least one of them. Interestingly, we show that the problem is polynomial-time solvable in paths when all the lightpaths share the first edge of the path, as well as when the number of lightpaths sharing an edge is bounded. Finally, we generalize our model in two natural directions, which allows us to capture the model of [10] as a particular case, and we settle some questions that were left open in [10]. \u
Private and continual release of statistics

LNCS v. 6199 is the proceedings of ICALP 2010Track CWe ask the question – how can websites and data aggregators continually release updated statistics, and meanwhile preserve each individual user’s privacy? Suppose we are given a stream of 0’s and 1’s. We propose a differentially private continual counter that outputs at every time step the approximate number of 1’s seen thus far. Our counter construction has error that is only poly-log in the number of time steps. We can extend the basic counter construction to allow websites to continually give top-k and hot items suggestions while preserving users’ privacy.postprintThe 37th International Colloquium on Automata, Languages and Programming (ICALP) 2010, Bordeaux, France, 5-10 July 2010. In Lecture Notes in Computer Science, 2010, v. 6199 pt. 2, p. 405-41
On Bisimilarity and Substitution in Presence of Replication

International audienceWe prove a new congruence result for the pi-calculus: bisimilarity is a congruence in the sub-calculus that does not include restriction nor sum, and features top-level replications. Our proof relies on algebraic properties of replication, and on a new syntactic characterisation of bisimilarity. We obtain this characterisation using a rewriting system rather than a purely equational axiomatisation. We then deduce substitution closure, and hence, congruence. Whether bisimilarity is a congruence when replications are unrestricted remains open
The positive semidefinite Grothendieck problem with rank constraint

Given a positive integer n and a positive semidefinite matrix A = (A_{ij}) of
size m x m, the positive semidefinite Grothendieck problem with
rank-n-constraint (SDP_n) is
  maximize \sum_{i=1}^m \sum_{j=1}^m A_{ij} x_i \cdot x_j, where x_1, ..., x_m
\in S^{n-1}.
  In this paper we design a polynomial time approximation algorithm for SDP_n
achieving an approximation ratio of
  \gamma(n) = \frac{2}{n}(\frac{\Gamma((n+1)/2)}{\Gamma(n/2)})^2 = 1 -
\Theta(1/n).
  We show that under the assumption of the unique games conjecture the achieved
approximation ratio is optimal: There is no polynomial time algorithm which
approximates SDP_n with a ratio greater than \gamma(n). We improve the
approximation ratio of the best known polynomial time algorithm for SDP_1 from
2/\pi to 2/(\pi\gamma(m)) = 2/\pi + \Theta(1/m), and we show a tighter
approximation ratio for SDP_n when A is the Laplacian matrix of a graph with
nonnegative edge weights.Comment: (v3) to appear in Proceedings of the 37th International Colloquium on
  Automata, Languages and Programming, 12 page
Testing non-uniform k-wise independent distributions over product spaces (extended abstract)

A distribution D over Σ1× ⋯ ×Σ n is called (non-uniform) k-wise independent if for any set of k indices {i 1, ..., i k } and for any z1zki1ik, PrXD[Xi1Xik=z1zk]=PrXD[Xi1=z1]PrXD[Xik=zk]. We study the problem of testing (non-uniform) k-wise independent distributions over product spaces. For the uniform case we show an upper bound on the distance between a distribution D from the set of k-wise independent distributions in terms of the sum of Fourier coefficients of D at vectors of weight at most k. Such a bound was previously known only for the binary field. For the non-uniform case, we give a new characterization of distributions being k-wise independent and further show that such a characterization is robust. These greatly generalize the results of Alon et al. [1] on uniform k-wise independence over the binary field to non-uniform k-wise independence over product spaces. Our results yield natural testing algorithms for k-wise independence with time and sample complexity sublinear in terms of the support size when k is a constant. The main technical tools employed include discrete Fourier transforms and the theory of linear systems of congruences.National Science Foundation (U.S.) (NSF grant 0514771)National Science Foundation (U.S.) (grant 0728645)National Science Foundation (U.S.) (Grant 0732334)Marie Curie International Reintegration Grants (Grant PIRG03-GA-2008-231077)Israel Science Foundation (Grant 1147/09)Israel Science Foundation (Grant 1675/09)Massachusetts Institute of Technology (Akamai Presidential Fellowship