A novel offline signature modeling is introduced and evaluated which attempts to advance a grid based feature extraction method uniting it with the use of an ordered powerset. Specifically, this work represents the pixel distribution of the signature trace by modeling specific predetermined paths having Chebyshev distance of two, as being members of alphabet subsets-events. In addition, it is p...

We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several measures for the complexity of graphs and analyze in which cases, bounding the measure decreases the complexity of the strategy problem on the corresponding classes of graphs. We prove or disprove that the usual powerset constr...

Background: Heat stress in the steel industry is considered as a serious threat to the health and safety of workers. A wide spectrum of complications and diseases from mild disorders such as burning sensation to fatal conditions such as thermal shock may occur due to uncontrolled thermal stress. In this study, heat stress assessment was performed according to the wet-bulb globe temperature (WBG...

We introduce a new concept of general $G$-$eta$-monotone operator generalizing the general $(H,eta)$-monotone operator cite{arvar2, arvar1}, general $H-$ monotone operator cite{xiahuang} in Banach spaces, and also generalizing $G$-$eta$-monotone operator cite{zhang}, $(A, eta)$-monotone operator cite{verma2}, $A$-monotone operator cite{verma0}, $(H, eta)$-monotone operator cite{fanghuang}...

The aim of Coalgebraic Logic is to find formalisms that allow reasoning about T-coalgebras uniformly in the functor T. Moss' seminal idea was to consider the set functor T as providing a modality ∇ T , the semantics of which is given in terms of the relation lifting of T. The latter exists whenever T preserves weak pullbacks. In joint work with Marta Bílková, Alexander Kurz and Jiří Velebil, we...

The contravariant powerset, and its generalisations Σ to the lattices of open subsets of a locally compact topological space and of recursively enumerable subsets of numbers, satisfy the Euclidean principle that φ ∧ F (φ) = φ ∧ F (>). Conversely, when the adjunction Σ(−) a Σ(−) is monadic, this equation implies that Σ classifies some class of monos, and the Frobenius law ∃x.(φ(x) ∧ ψ) = (∃x.φ(x...

The powerset construction is a standard method for converting a nondeterministic automaton into a deterministic one recognizing the same language. In this paper, we lift the powerset construction from automata to the more general framework of coalgebras with structured state spaces. Coalgebra is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor ...

We propose using five data-driven community detection approaches from social networks to partition the label space in the task of multi-label classification as an alternative to random partitioning into equal subsets as performed by RAkELd. We evaluate modularity-maximizing using fast greedy and leading eigenvector approximations, infomap, walktrap and label propagation algorithms. For this pur...