Search results for "Machine"

Fitness diversity based adaptation in Multimeme Algorithms:A comparative study

2007

This paper compares three different fitness diversity adaptations in multimeme algorithms (MmAs). These diversity indexes have been integrated within a MmA present in literature, namely fast adaptive memetic algorithm. Numerical results show that it is not possible to establish a superiority of one of these adaptive schemes over the others and choice of a proper adaptation must be made by considering features of the problem under study. More specifically, one of these adaptations outperforms the others in the presence of plateaus or limited range of variability in fitness values, another adaptation is more proper for landscapes having distant and strong basins of attraction, the third one, …

An Introduction to Kernel Methods

2009

Machine learning has experienced a great advance in the eighties and nineties due to the active research in artificial neural networks and adaptive systems. These tools have demonstrated good results in many real applications, since neither a priori knowledge about the distribution of the available data nor the relationships among the independent variables should be necessarily assumed. Overfitting due to reduced training data sets is controlled by means of a regularized functional which minimizes the complexity of the machine. Working with high dimensional input spaces is no longer a problem thanks to the use of kernel methods. Such methods also provide us with new ways to interpret the cl…

Designing Paper Machine Headbox Using GA

2003

Abstract A non-smooth biobjective optimization problem for designing the shape of a slice channel in a paper machine headbox is described. The conflicting goals defining the optimization problem are the ones determining important quality properties of produced paper: 1) basis weight should be even and 2) the wood fibers of paper should mainly be oriented to the machine direction across the width of the whole paper machine. The novelty of the considered approach is that maximum deviations are used instead of least squares when objective functions are formed. For the solution of this problem, a multiobjective genetic algorithm based on nondominated sorting is considered. The numerical results…

Resource-constrained project scheduling: A critical activity reordering heuristic

2003

Abstract In this paper, we present a new metaheuristic algorithm for the resource-constrained project-scheduling problem. The procedure is a non-standard implementation of fundamental concepts of tabu search without explicitly using memory structures embedded in a population-based framework. The procedure makes use of a fan search strategy to intensify the search, whereas a strategic oscillation mechanism loosely related to the forward/backward technique provides the necessary diversification. Our implementation employs the topological order (TO) representation of schedules. To explore the TO vector space we introduce three types of moves, two of them based on the concept of relative critic…

Obtaining the best value for money in adaptive sequential estimation

2010

Abstract In [Kujala, J. V., Richardson, U., & Lyytinen, H. (2010). A Bayesian-optimal principle for learner-friendly adaptation in learning games. Journal of Mathematical Psychology , 54(2), 247–255], we considered an extension of the conventional Bayesian adaptive estimation framework to situations where each observable variable is associated with a certain random cost of observation. We proposed an algorithm that chooses each placement by maximizing the expected gain in utility divided by the expected cost. In this paper, we formally justify this placement rule as an asymptotically optimal solution to the problem of maximizing the expected utility of an experiment that terminates when the…

Conformal equivalence of visual metrics in pseudoconvex domains

2017

We refine estimates introduced by Balogh and Bonk, to show that the boundary extensions of isometries between smooth strongly pseudoconvex domains in $\C^n$ are conformal with respect to the sub-Riemannian metric induced by the Levi form. As a corollary we obtain an alternative proof of a result of Fefferman on smooth extensions of biholomorphic mappings between pseudoconvex domains. The proofs are inspired by Mostow's proof of his rigidity theorem and are based on the asymptotic hyperbolic character of the Kobayashi or Bergman metrics and on the Bonk-Schramm hyperbolic fillings.

Machine Morphisms And Simulation

2012

This paper examines the concept of simulation from a modelling viewpoint. How can one Mealy machine simulate the other one? We create formalism for simulation of Mealy machines. The injective s–morphism of the machine semigroups induces the simulation of machines [1]. We present the example of s–morphism such that it is not a homomorphism of semigroups. The story for the surjective s–morphisms is quite different. These are homomorphisms of semigroups but there exists the surjective s–morphism such that it does not induce the simulation.

Algebras of frequently hypercyclic vectors

2019

We show that the multiples of the backward shift operator on the spaces $\ell_{p}$, $1\leq p<\infty$, or $c_{0}$, when endowed with coordinatewise multiplication, do not possess frequently hypercyclic algebras. More generally, we characterize the existence of algebras of $\mathcal{A}$-hypercyclic vectors for these operators. We also show that the differentiation operator on the space of entire functions, when endowed with the Hadamard product, does not possess frequently hypercyclic algebras. On the other hand, we show that for any frequently hypercyclic operator $T$ on any Banach space, $FHC(T)$ is algebrable for a suitable product, and in some cases it is even strongly algebrable.

The completely distributive lattice of machine invariant sets of infnite words

2007

Some Algebraic Properties of Machine Poset of Infinite Words

2008

The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are mostly interested in algebraic properties of the underlying partially ordered set. Results considered with the existence of supremum, infimum, antichains, chains and density aspects are investigated.