In 1986, I. Mikenberg, N. da Costa and R. Chuaqui introduced the semantic notion of quasi-truth defined by means of partial structures. In such structures, the predicates are seen as triples of pairwise disjoint sets: the set of tuples which satisfies, does not satisfy and can satisfy or not the predicate, respectively. The syntactical counterpart of the logic of partial truth is a rather compl...

The convergence properties of the absolute single-molecule configurational entropy and the correction terms used to estimate it are investigated using microsecond molecular dynamics simulation of a peptide test system and an improved methodology. The results are compared with previous applications for systems of diverse chemical nature. It is shown that (i) the effect of anharmonicity is small,...

Let F be a class of finite groups, p a prime and π a set of some primes. A finite group G is called a p-quasi-F-group (respectively, by π-quasi-F-group) provided that for every F-eccentric G-chief factor H/K of order divisible by p (respectively, by at least one prime in π), the automorphisms of H/K induced by all elements of G are inner. In this paper, we obtain the characterizations of p-quas...

Let PR(X) denote the hyperspace of non-empty finite subsets a topological space X with Pixley-Roy topology. In this paper, we investigate quasi-Rothberger property in PR(X). We prove that for X, followings are equivalent: (1) is quasi-Rothberger; (2) satisfies S1(?rc f?h,?wrc f?h); (3) separable and each co-finite subset S1(?pc f?h,?wpc (4) PR(Y) Y X. also characterize quasi-Menger quasi-Hurewi...

We compare empirical convergence of Monte Carlo and quasi Monte Carlo estimates of the H-period forecasts using the Cox-Ingersoll-Ross square root diffusion model. The behaviour of the quasi Monte Carlo estimates in high dimensions (H = 250) using both Euler scheme and the Brownian bridge discretisation is analysed. We find that quasi Monte Carlo estimator displays much higher convergence rate ...

A classical result in the theory of Hopf algebras concerns the uniqueness and existence of inte-grals: for an arbitrary Hopf algebra, the integral space has dimension ≤ 1, and for a finite dimensional Hopf algebra, this dimension is exaclty one. We generalize these results to quasi-Hopf algebras and dual quasi-Hopf algebras. In particular, it will follow that the bijectivity of the antipode fol...

A topological graph is k-quasi-planar if it does not contain k pairwise crossing edges. A topological graph is simple if every pair of its edges intersect at most once (either at a vertex or at their intersection). In 1996, Pach, Shahrokhi, and Szegedy [16] showed that every n-vertex simple k-quasi-planar graph contains at most O ( n(logn) ) edges. This upper bound was recently improved (for la...

We introduce the notion of quasi-Feistel network, which is generalization of the Feistel network, and contains the Lai-Massey scheme as an instance. We show that some of the works on the Feistel network, including the works of Luby-Rackoff, Patarin, Naor-Reingold and Piret, can be naturally extended to our setting. This gives a new proof for theorems of Vaudenay on the security of the Lai-Masse...

Put differently, let D = {x1, . . . , x`} and consider the random variables Yi = hK(xi) (where K is uniform). If H is pairwise independent then each Yi is uniformly distributed, and moreover the random variables Y1, . . . , Y` are pairwise independent; i.e., for any i 6= j the random variables Yi and Yj are independent. We show a simple construction of a pairwise-independent family for D = R = ...