Sour cherry (Prunus cerasus L.) is an agriculturally valuable tree that produces fruits used in a range of culinary dishes, beverages, and other products. The progenitor species number origins sour remain unresolved. Here, we performed phylogenetic analyses plastid genomes nuclear genes from nine wild three historically important cultivars. Our identified Prunus fruticosa avium as the closest e...

It is known that the complete stability of cellular neural networks with delays is very important in applications such as processing of a moving image. In this work, we utilize the Lyapunov functional method to analyse complete stability of cellular neural networks with delay. Our result is an improvement on that in [P.P. Civalleri, M. Gilli, L. Pandolfi, On stability of cellular neural network...

Recall that one motivation for studying non-uniform computation is the hope that it might be easier to prove lower bounds in that setting. (This is somewhat paradoxical, as non-uniform algorithms are more powerful than uniform algorithms; nevertheless, since circuits are more “combinatorial” in nature than uniform algorithms, there may still be justification for such hope.) The ultimate goal he...

let $g$ be a finite $p$-soluble group‎, ‎and $p$ a sylow $p$-sub-group of $g$‎. ‎it is proved‎ ‎that if all elements of $p$ of order $p$ (or of order ${}leq 4$ for $p=2$) are‎ ‎contained in the $k$-th term of the upper central series of $p$‎, ‎then the $p$-length of‎ ‎$g$ is at most $2m+1$‎, ‎where $m$ is the greatest integer such that‎ $p^m-p^{m-1}leq k$‎, ‎and the exponent of the image of $p$...

Mundici considered the question of whether the interpolant of two propositional formulas of the form F → G can always have a short circuit description, and showed that if this is the case then every problem in NP ∩ co-NP would have polynomial size circuits. In this note we observe further consequences of the interpolant having short circuit descriptions, namely that UP ⊆ P/poly, and that every ...

We develop theory concerning non-uniform complexity in a setting in which the notion of single-pass instruction sequence considered in program algebra is the central notion. We define counterparts of the complexity classes P/poly and NP/poly and formulate a counterpart of the complexity theoretic conjecture that NP 6⊆ P/poly. In addition, we define a notion of completeness for the counterpart o...

We consider the problems of finding the lexicographically minimal (or maximal) satisfying assignment of propositional formulae for different restricted formula classes. It turns out that for each class from our framework, the above problem is either polynomial time solvable or complete for OptP . We also consider the problem of deciding if in the optimal assignment the largest variable gets val...

In this study, 30 AIDS patients without Mycobacterium avium infection were randomized to receive treatment with azithromycin (1200 mg), granulocyte-monocyte colony-stimulating factor (GM-CSF; 250 microg/m2/day for 5 days), or both agents. The M. avium killing capacity of neutrophils and monocytes harvested from each patient before intervention and during (day 4), and after therapy (day 8) was a...