Toric codes are evaluation codes obtained from an integral convex polytope P ⊂ R and finite field Fq. They are, in a sense, a natural extension of Reed-Solomon codes, and have been studied recently in [6], [8], [9], and [12]. In this paper, we obtain upper and lower bounds on the minimum distance of a toric code constructed from a polygon P ⊂ R by examining Minkowski sum decompositions of subpo...

This paper proposes a fast algorithm for implementing the basic operation of Minkowski addition for the special case of binary three-dimensional images, using three-dimensional structuring elements of arbitrary size and shape. The application of the proposed algorithm for all the other morphological transformations is straightforward, as they can all be expressed in terms of Minkowski addition....

The parameters ∆H R, ∆S ◦ R and ∆Cp can all be calculated from knowledge of various changes in accessible surface area (ASA), which is defined as the surface traced out by a sphere, with radius equal to that of a solvent molecule, when rolled over the surface of the molecule of interest. This can also be formulated in configuration space as the Minkowski sum of the protein and the sphere, namel...

The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable assumption. Here we study the computational power of different variants of sequential P-systems. Initially we look at cooperative systems operating on symbol objects and without prioritized rules, but which allow membrane dissolut...

This article reports the use of a karaoke technique to drive the visual attention span (VAS) of subjects reading a text while listening to the text spelled aloud by a reading tutor. We tested the impact of computer-assisted synchronous reading (S+) that emphasizes words when they are uttered, vs. non-synchronous reading (S-) in a reading while listening (RWL) task. Thirty-five 6th grade pupils ...

In this paper, we use the Mittag-Leffler addition formula to solve Green function of generalized time fractional diffusion equation in whole plane and prove convergence function.

This paper gives an overview of the Gilbert-Johnson-Keerthi (GJK) algorithm, which provides an iterative method for computing the euclidian distance between two convex sets in m-dimensional space with linear time complexity. The algorithm is very versatile and several enhancements have been published since it was first introduced. Apart from some historical information, this paper will provide ...