The generation of animated human figures especially in crowd scenes has many applications in such domains as the special effects industry, computer games or for the simulation of the evacuation from crowded areas. Automation in action creation eliminates the need for human labour, which shortens the task of generation of the crowd scenes and also reduces the costs. This paper addresses a shortc...

 Let $R$ be a ring‎, ‎and let $n‎, ‎d$ be non-negative integers‎. ‎A right $R$-module $M$ is called $(n‎, ‎d)$-projective if $Ext^{d+1}_R(M‎, ‎A)=0$ for every $n$-copresented right $R$-module $A$‎. ‎$R$ is called right $n$-cocoherent if every $n$-copresented right $R$-module is $(n+1)$-coprese-nted‎, ‎it is called a right co-$(n,d)$-ring if every right $R$-module is $(n‎, ‎d)$-projective‎. ‎$R$...

We propose a weakly supervised temporal action localization algorithm on untrimmed videos using convolutional neural networks. Our algorithm learns from video-level class labels and predicts temporal intervals of human actions with no requirement of temporal localization annotations. We design our network to identify a sparse subset of key segments associated with target actions in a video usin...

> We propose a modiication L 1 of the action description language A. The language L 1 allows representation of hypothetical situations and hypothetical occurrence of actions (as in A) as well as representation of actual occurrences of actions and observations of the truth values of uents in actual situations. The corresponding entailment relation formalizes various types of common-sense reasoni...

Relative exactness modulo a polynomial map and algebraic (C p , +)-actions Abstract Let F = (f 1 , .., f q) be a polynomial dominating map from C n to C q. In this paper we study the quotient T 1 (F) of polynomial 1-forms that are exact along the generic fibres of F , by 1-forms of type dR + a i df i , where R, a 1 , .., a q are polynomials. We prove that T 1 (F) is always a torsion C[t 1 , ......

We compare different algebraic structures in twisted equivariant K-theory for proper actions of discrete groups. After the construction a module structure over untwisted K-theory, we prove completion Theorem Atiyah–Segal type K-theory. Using universal coefficient theorem, cocompletion Borel K-homology

Software patterns enable an efficient transfer of design experience by documenting common solutions to recurring design problems. However, given the steadily growing number of patterns in the literature and online repositories, it can be hard for non-experts to select patterns appropriate to their needs, or even to be aware of the existing patterns. We describe an implicit culture approach for ...