Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the results of a QBF solver not only ensures correctness, but also enables certain synthesis and verification tasks. To date the certificate of a true formula can be in the form of either a syntactic cube-resolution proof or a semantic Sk...

We present explicit formulae for the eccentric connectivity index and Wiener index of 2-dimensional square and comb lattices with open ends. The formulae for these indices of 2-dimensional square lattices with ends closed at themselves are also derived. The index for closed ends case divided by the same index for open ends case in the limit N →&infin defines a novel quantity we call compression...

BACKGROUND The effect of increasing dialysis efficiency magnifies rebound urea and the error in Kt/V determinations from single pool urea kinetics. Several formulae have been developed to calculate Kt/V taking into account the rebound urea (Kt/Vr). Smye et al. proposed a method whereby the equilibrated BUN is predicted by an additional intradialytic urea sample (Kt/VrSmye). Daugirdas et al. pro...

The framework of Multilayered Extended Semantic Networks (abbreviated: MultiNet) is one of the few knowledge representation paradigms along the line of Semantic Networks (abbreviated: SN) having a comprehensive, systematic, and publicly available documentation. The paper describes the main features of MultiNet and the standard repertoire of representational means provided by this system, the ap...

In this article a brief review of the literature on the subject is cited. The method of analysis by a finite element program is discussed in which the effect of different influential parameters are examined. The results of these computations are then compared to the corresponding empirical data and two other existing formulae for two dimensional cases. The comparisons show quite reliable and ac...

Let ts,n be the n-th positive integer number which can be written as a power p, t ≥ s, of a prime p (s ≥ 1 is fixed). Let πs(x) denote the number of prime powers p, t ≥ s, not exceeding x. We study the asymptotic behaviour of the sequence ts,n and of the function πs(x). We prove that the sequence ts,n has an asymptotic expansion comparable to that of pn (the Cipolla’s expansion).