Hae
Aineistot 1-10 / 16
Around the Domino Problem – Combinatorial Structures and Algebraic Tools
(Turku Centre for Computer Science, 2020-07-15)
Given a finite set of square tiles, the domino problem is the question of whether is it possible to tile the plane using these tiles. This problem is known to be undecidable in the planar case, and is strongly linked to ...
An Algebraic Approach to Nivat's Conjecture
(Turku Centre for Computer Science, 2018-08-17)
This thesis introduces a new, algebraic method to study multidimensional configurations, also sometimes called words, which have low pattern complexity. This is the setting of several open problems, most notably Nivat’s ...
Regularity of minimizers and solutions with generalized Orlicz growth
(Turun yliopisto, 2020-11-21)
This thesis studies properties of minimizers of variational integrals and solutions of partial differential equations with generalized Orlicz growth (also known as Musielak– Orlicz growth). This is continuation of regularity ...
On multiobjective optimization from the nonsmooth perspective
(Turku Centre for Computer Science, 2020-09-18)
Practical applications usually have multiobjective nature rather than having only one objective to optimize. A multiobjective problem cannot be solved with a single-objective solver as such. On the other hand, optimization ...
On the k-Abelian Equivalence Relation of Finite Words
(Turku Centre for Computer Science, 2019-06-28)
This thesis is devoted to the so-called k-abelian equivalence relation of sequences of symbols, that is, words. This equivalence relation is a generalization of the abelian equivalence of words. Two words are abelian ...
Applications in bioinformatics with Markov models
(Turun yliopisto, 2018-06-01)
In this thesis we present four applications in bioinformatics with Markov models. That is, we extend the use of such models in the mathematical and statistical analysis of biological data. The data we consider are drawn ...
Cellular automata with complicated dynamics
(Turun yliopisto, 2019-12-13)
A subshift is a collection of bi-infinite sequences (configurations) of symbols where some finite patterns of symbols are forbidden to occur. A cellular automaton is a transformation that changes each configuration of a ...
Bundle methods in nonsmooth DC optimization
(Turun yliopisto, 2018-06-21)
Due to the complexity of many practical applications, we encounter optimization problems with nonsmooth functions, that is, functions which are not continuously differentiable everywhere. Classical gradient-based methods ...
Statistical methods for the analysis of high-content organotypic cancer cell culture imaging data
(Turun yliopisto, 2018-03-03)
Organotypic cancer cell cultures combined with modern imaging technology have greatly expanded the possibilities of in vitro cancer research and drug development. In fact, imaging and subsequent image analyses have become ...
On Independent Component Analysis and Supervised Dimension Reduction for Time Series
(Turun yliopisto, 2018-02-02)
The main goal of this thesis work has been to develop tools to recover hidden structures, latent variables, or latent subspaces for multivariate and dependent time series data. The secondary goal has been to write ...