Search results for "Finite set"
showing 10 items of 101 documents
Matheuristics for the irregular bin packing problem with free rotations
2017
[EN] We present a number of variants of a constructive algorithm able to solve a wide variety of variants of the Two-Dimensional Irregular Bin Packing Problem (2DIBPP). The aim of the 2DIBPP is to pack a set of irregular pieces, which may have concavities, into stock sheets (bins) with fixed dimensions in such a way that the utilization is maximized. This problem is inspired by a real application from a ceramic company in Spain. In addition, this problem arises in other industries such as the garment industry or ship building. The constructive procedure presented in this paper allows both free orientation for the pieces, as in the case of the ceramic industry, or a finite set of orientation…
A Stochastic Search on the Line-Based Solution to Discretized Estimation
2012
Published version of a chapter in the book: Advanced Research in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-31087-4_77 Recently, Oommen and Rueda [11] presented a strategy by which the parameters of a binomial/multinomial distribution can be estimated when the underlying distribution is nonstationary. The method has been referred to as the Stochastic Learning Weak Estimator (SLWE), and is based on the principles of continuous stochastic Learning Automata (LA). In this paper, we consider a new family of stochastic discretized weak estimators pertinent to tracking time-varying binomial distributions. As opposed to the SLWE, our p…
Sufficient conditions for coincidence in ℓ1 multifacility location problems
1997
We consider the problem of finding the optimal way of locating a finite number of facilities in a finite dimensional space, in order to minimize a weighted sum of the distances between these and other pre-existent facilities which are already positioned. We study the specific case where distance is measured in the @?"1, giving a new sufficient condition for identifying groups of facilities whose position will coincide at optimality.
Solving the pentahedron problem
2015
Nowadays, all geometric modelers provide some tools for specifying geometric constraints. The 3D pentahedron problem is an example of a 3D Geometric Constraint Solving Problem (GCSP), composed of six vertices, nine edges, five faces (two triangles and three quadrilaterals), and defined by the lengths of its edges and the planarity of its quadrilateral faces. This problem seems to be the simplest non-trivial problem, as the methods used to solve the Stewart platform or octahedron problem fail to solve it. The naive algebraic formulation of the pentahedron yields an under-constrained system of twelve equations in eighteen unknowns. Even if the use of placement rules transforms the pentahedron…
Deflation-Based FastICA With Adaptive Choices of Nonlinearities
2014
Deflation-based FastICA is a popular method for independent component analysis. In the standard deflation-base d approach the row vectors of the unmixing matrix are extracted one after another always using the same nonlinearities. In prac- tice the user has to choose the nonlinearities and the efficiency and robustness of the estimation procedure then strongly depends on this choice as well as on the order in which the components are extracted. In this paper we propose a novel adaptive two- stage deflation-based FastICA algorithm that (i) allows one to use different nonlinearities for different components and (ii) optimizes the order in which the components are extracted. Based on a consist…
Tunnel effect and symmetries for Kramers–Fokker–Planck type operators
2011
AbstractWe study operators of Kramers–Fokker–Planck type in the semiclassical limit, assuming that the exponent of the associated Maxwellian is a Morse function with a finite number n0 of local minima. Under suitable additional assumptions, we show that the first n0 eigenvalues are real and exponentially small, and establish the complete semiclassical asymptotics for these eigenvalues.
Fokker Planck equation solved in terms of complex fractional moments
2014
Abstract In this paper the solution of the Fokker Planck (FPK) equation in terms of (complex) fractional moments is presented. It is shown that by using concepts coming from fractional calculus, complex Mellin transform and related ones, the solution of the FPK equation in terms of a finite number of complex moments may be easily found. It is shown that the probability density function (PDF) solution of the FPK equation is restored in the whole domain, including the trend at infinity with the exception of the value of the PDF in zero.
CODING PARTITIONS OF REGULAR SETS
2009
A coding partition of a set of words partitions this set into classes such that whenever a sequence, of minimal length, has two distinct factorizations, the words of these factorizations belong to the same class. The canonical coding partition is the finest coding partition that partitions the set of words in at most one unambiguous class and other classes that localize the ambiguities in the factorizations of finite sequences. We prove that the canonical coding partition of a regular set contains a finite number of regular classes and we give an algorithm for computing this partition. From this we derive a canonical decomposition of a regular monoid into a free product of finitely many re…
On the implementation of weno schemes for a class of polydisperse sedimentation models
2011
The sedimentation of a polydisperse suspension of small rigid spheres of the same density, but which belong to a finite number of species (size classes), can be described by a spatially one-dimensional system of first-order, nonlinear, strongly coupled conservation laws. The unknowns are the volume fractions (concentrations) of each species as functions of depth and time. Typical solutions, e.g. for batch settling in a column, include discontinuities (kinematic shocks) separating areas of different composition. The accurate numerical approximation of these solutions is a challenge since closed-form eigenvalues and eigenvectors of the flux Jacobian are usually not available, and the characte…
Coexistence of periods in a bifurcation
2012
Abstract A particular type of order-to-chaos transition mediated by an infinite set of coexisting neutrally stable limit cycles of different periods is studied in the Varley–Gradwell–Hassell population model. We prove by an algebraic method that this kind of transition can only happen for a particular bifurcation parameter value. Previous results on the structure of the attractor at the transition point are here simplified and extended.