The topological viewpoint on spaces of phenotypes presented in Stadler et al. (J Theor Biol 213:241-274, 2001) is revisited, and a quantified version is proposed. While necessary probabilistic information can be encoded in a topological- like fashion, it turns out that it is not reflected adequately by the concept of continuity. We propose alternative models, but the behavior of maps make these...

A viewpoint on the weight-6 error patterns of the algebraic decoding of the (89, 45, 17) quadratic residue (QR) code with reducible generator polynomial, proposed by Truong et al. (2008), is presented in this paper. Some weight-6 error patterns will cause a zero value in the syndrome S1. However, in this case, the inverse-free Berlekamp-Massey (IFBM) algorithm is still valid to determine the er...

where λ is the Lagrange multiplier and ψ = 0 the holonomic constraint. The first practical algorithm for constrained dynamics was called SHAKE [3]. In this algorithm the Lagrange multiplier was calculated from the viewpoint, that no exact discrete solution could be obtained. Thus the constraints were satisfied by inserting the discrete propagator into the holonomic constraint, ψ(t+ h) = 0. This...

A directed polymer model has been used by Alcaraz et al to reflect properties related to models of quantum entanglement in far from equilibrium stationary states. Here we calculate exactly one property related to entanglement: the average height of the polymer from the surface. In doing so we extend a well known method of exact solution for directed polymer models. Of interest from the polymer ...

this study tries to show that how viewpoint functions in discourse. as it will be clarified, it is highly related to the intention of the speaker/writer, and as a result, the orientation (s)he adopts in the discourse. deictic markers function as discourse markers to fix and anchor time, place, agent, and other discursive elements. in this way, the viewpoint adopted by the enunciator/utterer is ...

In the \(\textsc {Max} r\text {-}\textsc {SAT}{}\) problem, input is a CNF formula with n variables where each clause disjunction of at most r literals. The objective to compute an assignment which satisfies as many clauses possible. While there are polynomial-time approximation algorithms for this we take viewpoint space complexity following [Biswas et al., Algorithmica 2021] and design sublin...

a dialogue between myself and my hallucinations. The publication of this book brought me letters from people who wanted to know how a nurse could work efficiently while being a schizophrenic. Getting the schizophrenic a job and helping him to keep it are very important tasks for psychiatrists and social workers. The way has been paved by the setting up of workshops within hospitals, so that pat...

is the statement asserting that any infinite subtree of has an path or antichain. In this paper, we study computational strength theorem from a reverse mathematical viewpoint. We prove robust, is, there exist several characterizations, some which already appear in literature, namely, introduced by Dorais et al. [8], and where tree antichain Conidis [6]. show computationally very weak, it admits...

This paper begins a series studying D-modules on the Feigin-Frenkel semi-infinite flag variety from the perspective of the Beilinson-Drinfeld factorization (or chiral) theory. Here we calculate Whittaker-twisted cohomology groups of Zastava spaces, which are certain finite-dimensional subvarieties of the affine Grassmannian. We show that such cohomology groups realize the nilradical of a Borel ...