In this paper, we propose a CLIR method which employs a Web directory provided in multiple language versions (such as Yahoo!). In the proposed method, feature terms are first extracted from Web documents for each category in the source and the target languages. In advance, category matching is conducted in order to category pairs between categories across languages. Using these category pairs, ...

Let C be a category with finite colimits, and let (E ,M) be a factorisation system on C with M stable under pushouts. Writing C;M for the symmetric monoidal category with morphisms cospans of the form c → m ←, where c ∈ C and m ∈ M, we give method for constructing a category from a symmetric lax monoidal functor F : (C;M,+) → (Set,×). A morphism in this category, termed a decorated corelation, ...

Most neural network (NN) models of human category learning use a gradient-based learning method, which assumes that locally-optimal changes are made to model parameters on each learning trial. This method tends to underpredict variability in individual-level cognitive processes. In addition many recent models of human category learning have been criticized for not being able to replicate rapid ...

We present a way of constructing a Quillen model structure on a full subcategory of an elementary topos, starting with an interval object with connections and a certain dominance. The advantage of this method is that it does not require the underlying topos to be cocomplete. The resulting model category structure gives rise to a model of homotopy type theory with identity types, Σand Π-types, a...

In this paper, by considering the notion of extended BCK-module, we define the concepts of free extended BCK-module, free object in category of extended BCK-modules and we state and prove some related results. Specially, we define the notion of idempotent extended BCK-module and we get some important results in free extended BCK-modules. In particular, in category of idempotent extended BCK-mod...

in this work, we describe an adjunction between the comma category of set-based monads under the v -powerset monad and the category of associative lax extensions of set-based monads to the category of v -relations. in the process, we give a general construction of the kleisli extension of a monad to the category of v-relations.