Search results for "descent"
showing 10 items of 99 documents
Práctica 3. Toma de las medidas boxing de la montura. Cálculo de los descentramientos de las lentes.
2018
Toma de las medidas boxing de la montura. Cálculo de los descentramientos de las lentes.
Equivalence classes of permutations modulo descents and left-to-right maxima
2014
Abstract In a recent paper [2], the authors provide enumerating results for equivalence classes of permutations modulo excedances. In this paper we investigate two other equivalence relations based on descents and left-to-right maxima. Enumerating results are presented for permutations, involutions, derangements, cycles and permutations avoiding one pattern of length three.
Some properties of [tr(Q2p)]12p with application to linear minimax estimation
1990
Abstract A nondifferentiable minimization problem is considered which occurs in linear minimax estimation. This problem is solved by replacing the nondifferentiable maximal eigenvalue of a real nonnegative definite matrix Q with [tr( Q 2 p )] 1/2 p . It is shown that any descent algorithm with inexact step-length rule can be used to obtain linear minimax estimators for the parameter vector of a parameter-restricted linear model.
Weight Adaptation Stability of Linear and Higher-Order Neural Units for Prediction Applications
2018
This paper is focused on weight adaptation stability analysis of static and dynamic neural units for prediction applications. The aim of this paper is to provide verifiable conditions in which the weight system is stable during sample-by-sample adaptation. The paper presents a novel approach toward stability of linear and higher-order neural units. A study of utilization of linear and higher-order neural units with the foundations on stability of the gradient descent algorithm for static and dynamic models is addressed.
Empresas multiservicios y centros especiales de empleo
2017
Power de la ponencia general en la Jornada de Negociación Colectiva 2017 organizada por UGT-PV. Analiza la extensión de las empresas multiservicios, sus desafíos para los sindicatos y las vías para atacar la precariedad laboral en las mismas.
Popularity of patterns over $d$-equivalence classes of words and permutations
2020
Abstract Two same length words are d-equivalent if they have same descent set and same underlying alphabet. In particular, two same length permutations are d-equivalent if they have same descent set. The popularity of a pattern in a set of words is the overall number of copies of the pattern within the words of the set. We show the far-from-trivial fact that two patterns are d-equivalent if and only if they are equipopular over any d-equivalence class, and this equipopularity does not follow obviously from a trivial equidistribution.
A Region-based Gauss-Newton Approach to Real-Time Monocular Multiple Object Tracking
2018
We propose an algorithm for real-time 6DOF pose tracking of rigid 3D objects using a monocular RGB camera. The key idea is to derive a region-based cost function using temporally consistent local color histograms. While such region-based cost functions are commonly optimized using first-order gradient descent techniques, we systematically derive a Gauss-Newton optimization scheme which gives rise to drastically faster convergence and highly accurate and robust tracking performance. We furthermore propose a novel complex dataset dedicated for the task of monocular object pose tracking and make it publicly available to the community. To our knowledge, it is the first to address the common and…
Descent distribution on Catalan words avoiding a pattern of length at most three
2018
Catalan words are particular growth-restricted words over the set of non-negative integers, and they represent still another combinatorial class counted by the Catalan numbers. We study the distribution of descents on the sets of Catalan words avoiding a pattern of length at most three: for each such a pattern $p$ we provide a bivariate generating function where the coefficient of $x^ny^k$ in its series expansion is the number of length $n$ Catalan words with $k$ descents and avoiding $p$. As a byproduct, we enumerate the set of Catalan words avoiding $p$, and we provide the popularity of descents on this set. Some of the obtained enumerating sequences are not yet recorded in the On-line En…
Online shortest paths with confidence intervals for routing in a time varying random network
2018
International audience; The increase in the world's population and rising standards of living is leading to an ever-increasing number of vehicles on the roads, and with it ever-increasing difficulties in traffic management. This traffic management in transport networks can be clearly optimized by using information and communication technologies referred as Intelligent Transport Systems (ITS). This management problem is usually reformulated as finding the shortest path in a time varying random graph. In this article, an online shortest path computation using stochastic gradient descent is proposed. This routing algorithm for ITS traffic management is based on the online Frank-Wolfe approach.…
Catalan words avoiding pairs of length three patterns
2021
Catalan words are particular growth-restricted words counted by the eponymous integer sequence. In this article we consider Catalan words avoiding a pair of patterns of length 3, pursuing the recent initiating work of the first and last authors and of S. Kirgizov where (among other things) the enumeration of Catalan words avoiding a patterns of length 3 is completed. More precisely, we explore systematically the structural properties of the sets of words under consideration and give enumerating results by means of recursive decomposition, constructive bijections or bivariate generating functions with respect to the length and descent number. Some of the obtained enumerating sequences are kn…