Haku
Viitteet 1-6 / 6
Correspondences between definability of Boolean functions and frame definability in modal logic
(2007)
Lisensiaatintyö
Lisensiaatintyö
We establish a connection between term definability of classes of Boolean functions and definability of finite modal frames. We define a bijective translation between functional terms and uniform degree-1 formulas and show ...
On Stochastic Differential Equations: Theory and Biochemical Applications
(2007)
Pro gradu -tutkielma
Pro gradu -tutkielma
The time evolution of chemical systems is traditionally modeled using deterministic ordinary differential equations. The deterministic approach, in general, describes the average time series behavior of the system, but is ...
Propositional State Transition Logics
(2008)
Valinnaisten opintojen tutkielma
Valinnaisten opintojen tutkielma
SIVUAINELAUDATUR
This paper is an introduction to a class of multimodal logics with an algebraic structure associated with modal operators. The discussion focuses on model theory, especially on the interpretation of several ...
Total Similarity Based Fuzzy Reasoning: Theory and Application
(2009)
Pro gradu -tutkielma
Pro gradu -tutkielma
Fuzzy reasoning is an efficient way to model human knowledge. It aims to mimic the decision-making of humans. The main advantage of fuzzy inference systems is that they have the ability to provide a precise conclusion based ...
Positioning with Bayesian coverage area estimates and location fingerprints
(2010)
Pro gradu -tutkielma
Pro gradu -tutkielma
A variety of commercial location based services have appeared during recent years. Location awareness is becoming more important also in environments where satellite-based positioning are not available, such as urban areas ...
On Recurrence Time
(2005)
Pro gradu -tutkielma
Pro gradu -tutkielma
The amount of the data in the world enlarges all the time and therefore efficient methods are needed for data compression. There are many different algorithms to compress the data. One class of compression algorithms are ...