Electric potential measurement technique (tomography) was introduced as a nondestructive method to evaluate concrete properties and durability. In this study, numerical meshless method was developed to solve a differential equation which simulates electric potential distribution for concrete with inclusion in two dimensions. Therefore, concrete samples with iron block inclusion in different loc...

The visual cryptography (VC) is a secret sharing scheme where a secret image is encoded into transparencies, and the stacking of any out of transparencies reveals the secret image. The stacking of or fewer transparencies is unable to extract any information about the secret. We discuss the additions and deletions of users in a dynamic user group. To reduce the overhead of generating and distrib...

We study the local well-posedness of nonlinear Schrödinger equation associated to Grushin operator with random initial data. To best our knowledge, no result is known in Sobolev spaces Hk when k⩽32. In this article, we prove that there exists a large family data such that, respect suitable randomization Hk, k∈(1,32], almost-sure holds. The proof relies on bilinear and trilinear estimates.

In this paper, we formalize the Menger probabilistic normed space as a category in which its objects are the Menger probabilistic normed spaces and its morphisms are fuzzy continuous operators. Then, we show that the category of probabilistic normed spaces is isomorphicly a subcategory of the category of topological vector spaces. So, we can easily apply the results of topological vector spaces...

Erhan Bayraktar University of Michigan Probabilistic Perron's method and verification without smoothness using viscosity comparison: the linear case We introduce a probabilistic version of the classical Perron's method to construct viscosity solutions to linear parabolic equations associated to stochastic differential equations. Using this method, we construct easily two viscosity (sub and supe...

We introduce a symbolic model checking procedure for Probabilistic Computation Tree Logic PCTL over labelled Markov chains as models. Model checking for probabilistic logics typically involves solving linear equation systems in order to ascertain the probability of a given formula holding in a state. Our algorithm is based on the idea of representing the matrices used in the linear equation sys...

It is well known that the emptiness problem for binary probabilistic automata and so for quantum automata is undecidable. We present the current status of the emptiness problems for unary probabilistic and quantum automata with connections with Skolem’s and positivity problems. We also introduce the concept of linear recurrence automata in order to show the connection naturally. Then, we also g...

Recent methodological developments building on partial least squares (PLS) techniques and related ideas have significantly contributed to bridging the gap between factor-based and composite-based structural equation modeling (SEM) methods. PLS-SEM is extensively used in the field of e-collaboration, as well as in many other fields where multivariate statistical analyses are employed. We compare...