This paper presents a new algorithm for polymorphic type inferencing involving the let contruct of ML. It avoids the gen operation of the algorithm W of Damas and Milner. This new algorithm is a closer counterpart to the proof-theoretic formulation of the ML typing discipline than other approaches. Sketches of the proofs of correctness, including completeness for the let case, are also given. T...

E|Bt −Bs| = cp|t− s| , s, t ∈ [0, 1], with cp = E(|G|), G ∼ N (0, 1), and, consequently, almost all sample paths of B are Hölder continuous of any order α ∈ (0,H). The study of stochastic differential equations driven by B has been considered by using several methods. For instance, in [22] one uses fractional calculus of same type as in [25]; in [2] one uses rough paths theory introduced in [11...

Godunov type schemes form a special class of transport projection methods for the approximate solution of nonlinear hyperbolic conservation laws. We study the convergence rate of such schemes in the context of scalar conservation laws. We show how the question of consistency for Godunov type schemes can be answered solely in terms of the behavior of the associated projection operator. Namely, w...

and introduction. The condensed detachment rule, or rule D, was first proposed by Carew Meredith in the 1950's for propositional logic based on implication. It is a combination of modus ponens with a "minimal" amount of substitution. We shall give a precise detailed statement of rule D. (Some attempts in the published literature to do this have been inaccurate.) The D-completeness question for ...

abstract background and objective: proficiency testing schemes as a part of quality system in clinical and research laboratory centers provides the opportunity to evaluate the quality of test results. in this paper, we try to introduce the proficiency testing schemes as a useful method for achieving standardization and homogenization of test results in clinical and research laboratory centers. ...

This work addresses the characterization of homomorphic encryption schemes both in terms of security and design. In particular, we are interested in currently existing fully homomorphic encryption (FHE) schemes and their common structures and security. Our main contributions can be summarized as follows: – We define a certain type of homomorphic encryption that we call shift-type and identify i...

In this work, we investigate two finite difference schemes to solve for nonlinear Burgers’ type equations. the first stage, define numerical methods Secondly, solutions are obtained and compared with exact solutions. comparison other defined results in literature, it is deduced a conclusive way that reliable convenient alternative solving