Results 61 to 70 of about 69,891 (229)

A Data Set of Synthetic Utterances for Computational Personality Analysis

Scientific Data
The computational analysis of human personality has mainly focused on the Big Five personality theory, and the psychodynamic approach is almost nonexistent despite its rich theoretical grounding and relevance to various tasks. Here, we provide a data set
Yair Neuman, Yochai Cohen
doaj   +1 more source

A Category Theoretic Interpretation of Gandy's Principles for Mechanisms [PDF]

Electronic Proceedings in Theoretical Computer Science, 2019
Based on Gandy's principles for models of computation we give category-theoretic axioms describing locally deterministic updates to finite objects. Rather than fixing a particular category of states, we describe what properties such a category should ...
Joseph Razavi, Andrea Schalk
doaj   +1 more source

On Cubic Functors

Communications in Algebra, 2003
We prove that the description of cubic functors is a wild problem in the sense of the representation theory. On the contrary, we describe several special classes of such functors (2-divisible, weakly alternative, vector spaces and torsion free ones). We also prove that cubic functors can be defined locally and obtain corollaries about their projective ...
openaire   +3 more sources

Weak Homomorphisms of Coalgebras Beyond Set

Demonstratio Mathematica, 2014
We study the notion of weak homomorphisms between coalgebras of different types generalizing thereby that of homomorphisms for similarly typed coalgebras. This helps extend some results known so far in the theory of Universal coalgebra over Set.
Kianpi Maurice
doaj   +1 more source

Copower functors

Theoretical Computer Science, 2009
AbstractWe give a common generalization of two earlier constructions in [H.P. Gumm, T. Schröder, Monoid-labeled transition systems, Electronic Notes in Theoretical Computer Science 44 (1) (2001) 184–203], that yielded coalgebraic type functors for weighted, resp. fuzzy transition systems.
openaire   +2 more sources

Information Operators in Categorical Information Spaces

Information, 2010
The general theory of information (GTI) is a synthetic approach, which reveals the essence of information, organizing and encompassing all main directions in information theory.
Mark Burgin
doaj   +1 more source

Schur Functors and Motives [PDF]

K-Theory, 2004
In this article we study the class of Schur-finite motives, that is, motives which are annihilated by a Schur functor. We compare this notion to a similar one due to Kimura. In particular, we show that the motive of any curve is Kimura-finite. This last result has also been obtained by V. Guletskii.
openaire   +5 more sources

Parity functors

Journal of Knot Theory and Its Ramifications, 2022
A parity is a rule to assign labels to the crossings of knot diagrams in a way compatible with the Reidemeister moves. Parity functors can be viewed as parities which provide to each knot diagram its own coefficient group that contains parities of the crossings.
openaire   +2 more sources

T-motives

, 2016
Considering a (co)homology theory $\mathbb{T}$ on a base category $\mathcal{C}$ as a fragment of a first-order logical theory we here construct an abelian category $\mathcal{A}[\mathbb{T}]$ which is universal with respect to models of $\mathbb{T}$ in ...
Barbieri-Viale, L.
core   +1 more source

Inducing native Mackey functors to biset functors [PDF]

Journal of Pure and Applied Algebra, 2015
In this paper, we describe the induction functor from the category of native Mackey functors to the category of biset functors for a finite group $G$ over an algebraically closed field $k$ of characteristic zero. We prove two applications of this description.
openaire   +3 more sources