pinecone/core-2020-05-10-deduplication huggingface dataset:
Continuous inverse ranking queries in uncertain streams

Session 1: Ranked SearchThis vol. is the proceedings of SSDBM 2011This paper introduces a scalable approach for continuous inverse ranking on uncertain streams. An uncertain stream is a stream of object instances with confidences, e.g. observed positions of moving objects derived from a sensor. The confidence value assigned to each instance reflects the likelihood that the instance conforms with the current true object state. The inverse ranking query retrieves the rank of a given query object according to a given score function. In this paper we present a framework that is able to update the query result very efficiently, as the stream provides new observations of the objects. We will theoretically and experimentally show that the query update can be performed in linear time complexity. We conduct an experimental evaluation on synthetic data, which demonstrates the efficiency of our approach. © 2011 Springer-Verlag Berlin Heidelberg.postprintThe 23rd International Conference on Scientific and Statistical Database Management (SSDBM 2011), Portland, OR., 20-22 July 2011. In Lecture Notes in Computer Science, 2011, v. 6809, p. 37-5
A paraconsistent multi-agent framework for dealing with normative conflicts

In a multi-agent deontic setting, normative conflicts can take a variety of different logical forms. In this paper, we present a very general characterization of such conflicts, including both intra- and inter-agent normative conflicts, conflicts between groups of agents, conflicts between obligations and permissions, and conflicts between contradictory norms. In order to account for the consistent possibility of this wide variety of conflict-types, we present a paraconsistent deontic logic, i.e. a logic that invalidates the classical principle of non-contradiction. Next, we strengthen this logic within the adaptive logics framework for defeasible reasoning. The resulting inconsistency-adaptive deontic logic interprets a given set of norms 'as consistently as possible'
Open social student modeling: Visualizing student models with parallel introspectiveviews

This paper explores a social extension of open student modeling that we call open social student modeling. We present a specific implementation of this approach that uses parallel IntrospectiveViews to visualize models representing student progress with QuizJET parameterized self-assessment questions for Java programming. The interface allows visualizing not only the student's own model, but also displaying parallel views on the models of their peers and the cumulative model of the entire class or group. The system was evaluated in a semester-long classroom study. While the use of the system was non-mandatory, the parallel IntrospectiveViews interface caused an increase in all of the usage parameters in comparison to a regular portal-based access, which allowed the student to achieve a higher success rate in answering the questions. The collected data offer some evidence that a combination of traditional personalized guidance with social guidance was more effective than personalized guidance alone. © 2011 Springer-Verlag
Towards open corpus adaptive hypermedia: A study of novelty detection approaches

Classic adaptive hypermedia systems are able to track a user's knowledge of the subject and use it to evaluate the novelty and difficulty of content encountered by the user. Our goal is to implement this functionality in an open corpus context where a domain model is not available nor is the content indexed with domain concepts. We examine methods for novelty measurement based on automatic text analysis. To compare these methods, we use an evaluation approach based on knowledge encapsulated in the structure of a textbook. Our study shows that a knowledge accumulation method adopted from the domain of intelligent tutoring systems offers a more meaningful novelty measurement than methods adapted from the area of personalized information retrieval. © 2011 Springer-Verlag
Performance prediction in recommender systems

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-22362-4_37Proceedings of 19th International Conference, UMAP 2011, Girona, Spain, July 11-15, 2011.Research on Recommender Systems has barely explored the issue of adapting a recommendation strategy to the user’s information available at a certain time. In this thesis, we introduce a component that allows building dynamic recommendation strategies, by reformulating the performance prediction problem in the area of Information Retrieval to that of recommender systems. More specifically, we investigate a number of adaptations of the query clarity predictor in order to infer the ambiguity in user and item profiles. The properties of each predictor are empirically studied by, first, checking the correlation of the predictor output with a performance measure, and second, by incorporating a performance predictor into a recommender system to produce a dynamic strategy. Depending on how the predictor is integrated with the system, we explore two different applications: dynamic user neighbour weighting and hybrid recommendation. The performance of such dynamic strategies is examined and compared with that of static ones.This work was supported by the Spanish Ministry of Science and
Innovation (TIN2008-06566-C04-02) and Dirección General de Universidades e
Investigación de la Comunidad de Madrid and Universidad Autónoma de Madrid
(CCG10-UAM/TIC-5877
Quantum Field Theory

This is the first volume of a modern introduction to quantum field theory which addresses both mathematicians and physicists ranging from advanced undergraduate students to professional scientists. The book tries to bridge the existing gap between the different languages used by mathematicians and physicists. For students of mathematics it is shown that detailed knowledge of the physical background helps to motivate the mathematical subjects and to discover interesting interrelationships between quite different mathematical topics. For students of physics, fairly advanced mathematics is presented, which is beyond the usual curriculum in physics. It is the author's goal to present the state of the art of realizing Einstein's dream of a unified theory for the four fundamental forces in the universe (gravitational, electromagnetic, strong, and weak interaction). From the reviews: "… Quantum field theory is one of the great intellectual edifices in the history of human thought. … This volume differs from other books on quantum field theory in its greater emphasis on the interaction of physics with mathematics. … an impressive work of scholarship." (William G. Faris, SIAM Review, Vol. 50 (2), 2008) "… it is a fun book for practicing quantum field theorists to browse, and it may be similarly enjoyed by mathematical colleagues. Its ultimate value may lie in encouraging students to enter this challenging interdisciplinary area of mathematics and physics. Summing Up: Recommended. Upper-division undergraduates through faculty." (M. C. Ogilvie, CHOICE, Vol. 44 (9), May, 2007
Code Pointer Masking: Hardening applications against code injection attacks

In this paper we present an efficient countermeasure against code injection attacks. Our countermeasure does not rely on secret values such as stack canaries and protects against attacks that are not addressed by state-of-the-art countermeasures of similar performance. By enforcing the correct semantics of code pointers, we thwart attacks that modify code pointers to divert the application's control flow. We have implemented a prototype of our solution in a C-compiler for Linux. The evaluation shows that the overhead of using our countermeasure is small and the security benefits are substantial.status: publishe
Adaptive wavelet-based method for simulation of electronic circuits

In this paper we present an algorithm for analog simulation of electronic
circuits involving a spline Galerkin method with wavelet-based adaptive
refinement. Numerical tests show that a first algorithm prototype, build within
a productively used in-house circuit simulator, is completely able to meet and
even surpass the accuracy requirements and has a performance close to classical
time-domain simulation methods, with high potential for further improvement.Comment: in Scientific Computing in Electrical Engineering 2010, pages
  321--328. Springer, Berlin Heidelberg, 2012. arXiv admin note: text overlap
  with arXiv:1604.0725
Memoizing a monadic mixin DSL

Modular extensibility is a highly desirable property of a domain-specific language (DSL): the ability to add new features without affecting the implementation of existing features. Functional mixins (also known as open recursion) are highly suitable for this purpose. We study the use of mixins in Haskell for a modular DSL for search heuristics used in systematic solvers for combinatorial problems, that generate optimized C++ code from a high-level specification. We show how to apply memoization techniques to tackle performance issues and code explosion due to the highly recursive nature of the mixins. As such heuristics are conventionally implemented as highly entangled imperative algorithms, our Haskell mixins are monadic. Memoization of monadic components causes further complications for us to deal with.status: publishe
Rewriting queries for web searches that use local expressions

Users often enter a local expression to constrain a web search to ageographical place. Current search engines’ capability to deal with expressionssuch as “close to” is, however, limited. This paper presents an approach thatuses topological background knowledge to rewrite queries containing localexpressions in a format better suited to standard search engines. To formalizelocal expressions, the Region Connection Calculus (RCC) is extended byadditional relations, which are related to existing ones by means of compositionrules. The approach is applied to web searches for communities in a part ofSwitzerland which are “close to” a reference place. Results show that queryrewriting significantly improves recall of the searches. When dealing withapprox. 30,000 role assertions, the time required to rewrite queries is in therange of a few seconds. Ways of dealing with a possible decrease ofperformance when operating on a larger knowledge base are discussed
Advanced Composition in Virtual Camera Control

International audienceRapid increase in the quality of 3D content coupled with the evolution of hardware rendering techniques urges the development of camera control systems that enable the application of aesthetic rules and conventions from visual media such as film and television. One of the most important problems in cinematography is that of composition, the precise placement of elements in shot. Researchers already considered this problem, but mainly focused on basic compositional properties like size and framing. In this paper, we present a camera system that automatically configures the camera in order to satisfy advanced compositional rules. We have selected a number of those rules and specified rating functions for them, then using optimisation we find the best possible camera configuration. Finally, for better results, we use image processing methods to rate the satisfaction of rules in shot
Hybridizing data stream mining and technical indicators in automated trading systems

Automated trading systems for financial markets can use data mining techniques for future price movement prediction. However, classifier accuracy is only one important component in such a system: the other is a decision procedure utilizing the prediction in order to be long, short or out of the market. In this paper, we investigate the use of technical indicators as a means of deciding when to trade in the direction of a classifier’s prediction. We compare this “hybrid” technical/data stream mining-based system with a naive system that always trades in the direction of predicted price movement. We are able to show via evaluations across five financial market datasets that our novel hybrid technique frequently outperforms the naive system. To strengthen our conclusions, we also include in our evaluation several “simple” trading strategies without any data mining component that provide a much stronger baseline for comparison than traditional buy-and-hold or sell-and-hold strategies
Discovery of Probabilistic Mappings between Taxonomies: Principles and Experiments

International audienceIn this paper, we investigate a principled approach for deﬁning and discovering probabilistic mappings between two taxonomies. First, we compare two ways of modeling probabilistic mappings which are compatible with the logical constraints declared in each taxonomy. Then we describe a generate and test algorithm which minimizes the number of calls to the probability estimator for determining those mappings whose probability exceeds a certain threshold. Finally, we provide an experimental analysis of this approach
A fair and abuse-free contract signing protocol from Boneh-Boyen signature

A fair contract signing protocol is used to enable two mistrusted parties to exchange two signatures on a given contract, in such\ud
a way that either both of them get the other party’s signature, or none of them gets anything. A new signature scheme is presented, which is a variant of Boneh and Boyen’s scheme, and building on it, we propose a new signature fair exchange protocol for which all the properties of being optimistic, setup-free and abuse-free can be proved without random oracles, and it is more efficient than the known schemes with comparable properties.Peer ReviewedPostprint (published version
Can we avoid high coupling?

It is considered good software design practice to organize source code into modules and to favour within-module connections (cohesion) over between-module connections (coupling), leading to the oft-repeated maxim "low coupling/high cohesion". Prior research into network theory and its application to software systems has found evidence that many important properties in real software systems exhibit approximately scale-free structure, including coupling; researchers have claimed that such scale-free structures are ubiquitous. This implies that high coupling must be unavoidable, statistically speaking, apparently contradicting standard ideas about software structure. We present a model that leads to the simple predictions that approximately scale-free structures ought to arise both for between-module connectivity and overall connectivity, and not as the result of poor design or optimization shortcuts. These predictions are borne out by our large-scale empirical study. Hence we conclude that high coupling is not avoidable--and that this is in fact quite reasonable
Detecting and escaping infinite loops with jolt

Infinite loops can make applications unresponsive. Potential problems include lost work or output, denied access to application functionality, and a lack of responses to urgent events. We present Jolt, a novel system for dynamically detecting and escaping infinite loops. At the user’s request, Jolt attaches to an application to monitor its progress. Specifically, Jolt records the program state at the start of each loop iteration. If two consecutive loop iterations produce the same state, Jolt reports to the user that the application is in an infinite loop. At the user’s option, Jolt can then transfer control to a statement following the loop, thereby allowing the application to escape the infinite loop and ideally continue its productive execution. The immediate goal is to enable the application to execute long enough to save any pending work, finish any in-progress computations, or respond to any urgent events.
We evaluated Jolt by applying it to detect and escape eight infinite loops in five benchmark applications. Jolt was able to detect seven of the eight infinite loops (the eighth changes the state on every iteration). We also evaluated the effect of escaping an infinite loop as an alternative to terminating the application. In all of our benchmark applications, escaping an infinite loop produced a more useful output than terminating the application. Finally, we evaluated how well escaping from an infinite loop approximated the correction that the developers later made to the application. For two out of our eight loops, escaping the infinite loop produced the same output as the corrected version of the application.25th European Conference, Lancaster, Uk, July 25-29, 2011 Proceeding
Computer certified efficient exact reals in Coq

Floating point operations are fast, but require continuous effort on the part
of the user in order to ensure that the results are correct. This burden can be
shifted away from the user by providing a library of exact analysis in which
the computer handles the error estimates. We provide an implementation of the
exact real numbers in the Coq proof assistant. This improves on the earlier
Coq-implementation by O'Connor in two ways: we use dyadic rationals built from
the machine integers and we optimize computation of power series by using
approximate division. Moreover, we use type classes for clean mathematical
interfaces. This appears to be the first time that type classes are used in
heavy computation. We obtain over a 100 times speed up of the basic operations
and indications for improving the Coq system.Comment: Proceedings of CICM11, Springer LNAI, 201
A Foundational View on Integration Problems

The integration of reasoning and computation services across system and
language boundaries is a challenging problem of computer science. In this
paper, we use integration for the scenario where we have two systems that we
integrate by moving problems and solutions between them. While this scenario is
often approached from an engineering perspective, we take a foundational view.
Based on the generic declarative language MMT, we develop a theoretical
framework for system integration using theories and partial theory morphisms.
Because MMT permits representations of the meta-logical foundations themselves,
this includes integration across logics. We discuss safe and unsafe integration
schemes and devise a general form of safe integration
Quantum algorithm for the Boolean hidden shift problem

The hidden shift problem is a natural place to look for new separations
between classical and quantum models of computation. One advantage of this
problem is its flexibility, since it can be defined for a whole range of
functions and a whole range of underlying groups. In a way, this distinguishes
it from the hidden subgroup problem where more stringent requirements about the
existence of a periodic subgroup have to be made. And yet, the hidden shift
problem proves to be rich enough to capture interesting features of problems of
algebraic, geometric, and combinatorial flavor. We present a quantum algorithm
to identify the hidden shift for any Boolean function. Using Fourier analysis
for Boolean functions we relate the time and query complexity of the algorithm
to an intrinsic property of the function, namely its minimum influence. We show
that for randomly chosen functions the time complexity of the algorithm is
polynomial. Based on this we show an average case exponential separation
between classical and quantum time complexity. A perhaps interesting aspect of
this work is that, while the extremal case of the Boolean hidden shift problem
over so-called bent functions can be reduced to a hidden subgroup problem over
an abelian group, the more general case studied here does not seem to allow
such a reduction.Comment: 10 pages, 1 figur
Partial orders and logical concept analysis to explore patterns extracted by data mining

International audienceData mining techniques are used in order to discover emerging knowledge (patterns) in databases. The problem of such techniques is that there are, in general, too many resulting patterns for a user to explore them all by hand. Some methods try to reduce the number of patterns without a priori pruning. The number of patterns remains, nevertheless, high. Other approaches, based on a total ranking, propose to show to the user the top-k patterns with respect to a measure. Those methods do not take into account the user's knowledge and the dependencies that exist between patterns. In this paper, we propose a new way for the user to explore extracted patterns. The method is based on navigation in a partial order over the set of all patterns in the Logical Concept Analysis framework. It accommodates several kinds of patterns and the dependencies between patterns are taken into account thanks to partial orders. It allows the user to use his/her background knowledge to navigate through the partial order, without a priori pruning. We illustrate how our method can be applied on two different tasks (software engineering and natural language processing) and two different kinds of patterns (association rules and sequential patterns)
Numerical model for the determination of the soil retention curve from global characteristics obtained via a centrifuge

A novel centrifuge set-up for the study of unsaturated flow characteri\-stics in porous media is examined. In this set-up, simple boundary conditions can be used, but a free moving boundary between unsaturated-saturated flow arises.
A precise and numerically efficient approximation is presented for the mathematical model based on Richards' nonlinear and degenerate equation expressed in terms of effective saturation using the Van Genuchten-Mualem approach for the soil parameters in the unsaturated zone. Sensitivity of the measurable quantities (rotational moment, center of gravity and time period to achieve quasi steady state) on the soil parameters is investigated in several numerical experiments. They show that the set-up is suitable for the determination of the soil parameters via the solution of an inverse problem in an iterative way
NL-based automated software requirements elicitation and specification

This paper presents a novel approach to automate the process of software requirements elicitation and specification. The software requirements elicitation is perhaps the most important phase of software development as a small error at this stage can result in absurd software designs and implementations. The automation of the initial phase (such as requirement elicitation) phase can also contribute to a long standing challenge of automated software development. The presented approach is based on Semantic of Business Vocabulary and Rules (SBVR), an OMG’s recent standard. We have also developed a prototype tool SR-Elicitor (an Eclipse plugin), which can be used by software engineers to record and automatically transform the natural language software requirements to SBVR software requirements specification. The major contribution of the presented research is to demonstrate the potential of SBVR based approach, implemented in a prototype tool, proposed to improve the process of requirements elicitation and specification
Differential K-theory. A survey

Generalized differential cohomology theories, in particular differential
K-theory (often called "smooth K-theory"), are becoming an important tool in
differential geometry and in mathematical physics. In this survey, we describe
the developments of the recent decades in this area. In particular, we discuss
axiomatic characterizations of differential K-theory (and that these uniquely
characterize differential K-theory). We describe several explicit
constructions, based on vector bundles, on families of differential operators,
or using homotopy theory and classifying spaces. We explain the most important
properties, in particular about the multiplicative structure and push-forward
maps and will state versions of the Riemann-Roch theorem and of Atiyah-Singer
family index theorem for differential K-theory.Comment: 50 pages, report based in particular on work done sponsored the DFG
  SSP "Globale Differentialgeometrie". v2: final version (only typos
  corrected), to appear in C. B\"ar et al. (eds.), Global Differential
  Geometry, Springer Proceedings in Mathematics 17, Springer-Verlag Berlin
  Heidelberg 201