Telling stories is different from reading out text: a speaker reponds to the listener’s feedback and incorporates this into the ongoing talk. However, current computer systems are unable to do this and instead just non-attentively read out a text, disregarding all feedback (or the absence thereof). I propose and discuss an idea for a small research project and a plan for how an attentive listen...

Completely iterative theories of Calvin Elgot formalize (potentially infinite) computations as solutions of recursive equations. One of the main results of Elgot and his coauthors is that infinite trees form a free completely iterative theory. Their algebraic proof of this result is extremely complicated. We present completely iterative algebras as a new approach to the description of free comp...

We investigate effects of galaxy-galaxy interaction on the Tully-Fisher relation. The HI linewidth in interacting galaxies is significantly broader than the CO linewidth, and the HI to CO linewidth ratio is proportional to the strength of interaction. This provides different distances to galaxies measured by the Tully-Fisher relation with the CO and HI linewidths. Distances derived from the HI ...

For the game of complete information with multiple principals and multiple common agents discussed by Prat and Rustichini (2003), we construct a general set of equilibrium transfers which implement any efficient outcome as a weakly truthful equilibrium, and the subset of such equilibria that are Pareto optimal for the principals. We provide conditions under which the general set completely char...

The algebraic regulator and filter Riccati equations of weakly coupled dticrere-rime stochastic linear control systems are completely and exactly decomposed into reduced-order continuous-time algebraic Riccati equations corresponding to the subsystems. That is, the exact solution of the global discrete algebraic Riccati equation is found in terms of the reduced-order subsystem nonsymmetric cont...

The game of pursuit and evasion, when played on graphs, is often referred to as the cops robbers. This classical version has been completely solved by Nowakowski Winkler, who gave exact class graphs for which pursuer can win (cop-win). When graph does not satisfy dismantlability property, Winkler’s Theorem apply. In this paper, we give some weaker notions cop-win robber-win graphs. particular, ...

in this paper we introduce the concept of weakly prime ternary subsemimodules of a ternary semimodule over a ternary semiring and obtain some characterizations of weakly prime ternary subsemimodules. we prove that if $n$ is a weakly prime subtractive ternary subsemimodule of a ternary $r$-semimodule $m$, then either $n$ is a prime ternary subsemimodule or $(n : m)(n : m)n = 0$. if $n$ is a $q$-...

We prove general adjoint functor theorems for weakly (co)complete $n$-categories. This class of $n$-categories includes the homotopy $\infty$-categories -- in particular, these do not admit all small (co)limits general. also introduce Brown representability (homotopy) and a theorem localizations compactly generated presentable if $n \geq 2$ stable any 1$.

In this paper we give some necessary and sufficient conditions for which each Banach lattice  is    space and we study some properties of b-weakly compact operators from a Banach lattice  into a Banach space . We show that every weakly compact operator from a Banach lattice  into a Banach space  is b-weakly compact and give a counterexample which shows that the inverse is not true but we prove ...