Search results for "generalization"
showing 10 items of 250 documents
Analyzing assessors and products in sorting tasks: DISTATIS, theory and applications
2007
Abstract In this paper we present a new method called distatis that can be applied to the analysis of sorting data. D istatis is a generalization of classical multidimensional scaling which allows one to analyze 3-ways distance tables. When used for analyzing sorting tasks, distatis takes into account individual sorting data. Specifically, when distatis is used to analyze the results of an experiment in which several assessors sort a set of products, we obtain two types of maps: One for the assessors and one for the products. In these maps, the proximity between two points reflects their similarity, and therefore these maps can be read using the same rules as standard metric multidimensiona…
DISTATIS: The Analysis of Multiple Distance Matrices
2006
In this paper we present a generalization of classical multidimensional scaling called DISTATIS which is a new method that can be used to compare algorithms when their outputs consist of distance matrices computed on the same set of objects. The method first evaluates the similarity between algorithms using a coefficient called the RV coefficient. From this analysis, a compromise matrix is computed which represents the best aggregate of the original matrices. In order to evaluate the differences between algorithms, the original distance matrices are then projected onto the compromise. We illustrate this method with a "toy example" in which four different "algorithms" (two computer programs …
Resolvent Estimates Near the Boundary of the Range of the Symbol
2019
The purpose of this chapter is to give quite explicit bounds on the resolvent near the boundary of Σ(p) (or more generally, near certain “generic boundary-like” points.) The result is due (up to a small generalization) to Montrieux (Estimation de resolvante et construction de quasimode pres du bord du pseudospectre, 2013) and improves earlier results by Martinet (Sur les proprietes spectrales d’operateurs nonautoadjoints provenant de la mecanique des fluides, 2009) about upper and lower bounds for the norm of the resolvent of the complex Airy operator, which has empty spectrum (Almog, SIAM J Math Anal 40:824–850, 2008). There are more results about upper bounds, and some of them will be rec…
Facilitation versus inhibition in the masked priming same-different matching task.
2011
In the past years, growing attention has been devoted to the masked priming same–different task introduced by Norris and Kinoshita (2008, Journal of Experimental Psychology: General). However, a number of researchers have raised concerns on the nature of the cognitive processes underlying this task—in particular the suspicion that masked priming effects in this task are mostly inhibitory in nature and may be affected by probe–prime contingency. To examine the pattern of facilitative/inhibitory priming effects in this task, we conducted two experiments with an incremental priming paradigm using four stimulus–onset asynchronies (13, 27, 40, and 53 ms). Experiment 1 was conducted under a pred…
Subsequent Keyframe Generation for Visual Servoing
2021
International audience; In this paper, we study the problem of autonomous and reliable positioning of a camera w.r.t. an object when only this latter is known but not the rest of the scene. We propose to combine the advantages and efficiency of a visual servoing scheme and the generalization ability of a generative adversarial network. The paper describes how to efficiently create a synthetic dataset in order to train a network that predicts an intermediate visual keyframe between two images. Subsequent predictions are used as visual features to autonomously converge towards the desired pose even for large displacements. We show that the proposed method can be used without any prior knowled…
Riccati equation-based generalization of Dawson's integral function
2007
A new generalization of Dawson's integral function based on the link between a Riccati nonlinear differential equation and a second-order ordinary differential equation is reported. The MacLaurin expansion of this generalized function is built up and to this end an explicit formula for a generic cofactor of a triangular matrix is deduced.
Pre-emption in resource-constrained project scheduling
2008
Abstract The Resource-Constrained Project Scheduling Project (RCPSP), together with some of its extensions, has been widely studied. A fundamental assumption in this basic problem is that activities in progress are non-preemptable. Very little effort has been made to uncover the potential benefits of discrete activity pre-emption, and the papers dealing with this issue have reached the conclusion that it has little effect on project length when constant resource availability levels are defined. In this paper we show how three basic elements of many heuristics for the RCPSP – codification, serial SGS and double justification – can be adapted to deal with interruption. The paper is mainly foc…
A Comparison between Habituation and Conscience mechanism in Self–Organizing Maps
2006
In this letter, a preliminary study of habituation in self-organizing networks is reported. The habituation model implemented allows us to obtain a faster learning process and better clustering performances. The liabituable neuron is a generalization of the typical neuron and can be used in many self-organizing network models. The habituation mechanism is implemented in a SOM and the clustering performances of the network are compared to the conscience learning mechanism that follows roughly the same principle but is less sophisticated.
A Geometric Algebra Based Distributional Model to Encode Sentences Semantics
2013
Word space models are used to encode the semantics of natural language elements by means of high dimensional vectors [23]. Latent Semantic Analysis (LSA) methodology [15] is well known and widely used for its generalization properties. Despite of its good performance in several applications, the model induced by LSA ignores dynamic changes in sentences meaning that depend on the order of the words, because it is based on a bag of words analysis. In this chapter we present a technique that exploits LSA-based semantic spaces and geometric algebra in order to obtain a sub-symbolic encoding of sentences taking into account the words sequence in the sentence. © 2014 Springer-Verlag Berlin Heidel…
Segmentation algorithm for non-stationary compound Poisson processes
2010
We introduce an algorithm for the segmentation of a class of regime switching processes. The segmentation algorithm is a non parametric statistical method able to identify the regimes (patches) of a time series. The process is composed of consecutive patches of variable length. In each patch the process is described by a stationary compound Poisson process, i.e. a Poisson process where each count is associated with a fluctuating signal. The parameters of the process are different in each patch and therefore the time series is non-stationary. Our method is a generalization of the algorithm introduced by Bernaola-Galván, et al. [Phys. Rev. Lett. 87, 168105 (2001)]. We show that the new algori…