Hae
Aineistot 11-20 / 124
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 ...
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 ...
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 ...
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 ...
Independent component analysis for non-standard data structures
(Turun yliopisto, 2018-04-13)
Independent component analysis is a classical multivariate tool used for estimating independent sources among collections of mixed signals. However, modern forms of data are typically too complex for the basic theory to ...
On using distances to locate vertices: resolving sets and metric bases of graphs, two generalisations and their forced vertices
(Turun yliopisto, 2021-06-18)
A graph consists of vertices that are connected by edges. A resolving set of a graph is a subset of its vertices that gives a unique combination of distances to every vertex of the graph. We can use the distances we are ...
On location, domination and information retrieval
(Turku Centre for Computer Science, 2020-09-25)
The thesis is divided into two main branches: identifying and locatingdominating codes, and information retrieval. The former topics are motivated by the aim to locate objects in sensor networks (or other similar applications) ...
Pienemmistä ja suuremmista epäyhtälöistä
(Turun yliopisto, 2018-09-05)
Tässä matematiikan opettajalinjan pro gradu -tutkielmassa tarkastellaan epäyhtälöitä. Epäyhtälö on matemaattinen lause, joka määrittää kaksi suuretta tai lauseketta erisuuriksi ja asettaa ne suuruusjärjestykseen.
Tutkielma ...
Generalized Orlicz spaces and partial differential equations with application to image restoration
(Turun yliopisto, 2022-11-11)
The research area of this thesis is nonlinear functional analysis, a branch of Mathematics which examines questions related to qualitative aspects of solution of a differential equation, such as existence, uniqueness, ...
Combinatorics on Words. New Aspects on Avoidability, Defect Effect, Equations and Palindromes
(Turku Centre for Computer Science, 2014-04-11)
In this thesis we examine four well-known and traditional concepts of combinatorics on words. However the contexts in which these topics are treated are not the traditional ones. More precisely, the question of avoidability ...