Cryptographycal protocols in the Egerfood Information System.
Čtvrtá spojená mezinárodní konference o umělém intelektu
Cubical approximation and computation of homology
The purpose of this article is to introduce a method for computing the homology groups of cellular complexes composed of cubes. We will pay attention to issues of storage and efficiency in performing computations on large complexes which will be required in applications to the computation of the Conley index. The algorithm used in the homology computations is based on a local reduction procedure, and we give a subquadratic estimate of its computational complexity. This estimate is rigorous in two...
Current developments in generative grammar
Current Status of Mathematical Publications in Japan
In the present report, we show current status of mathematical journals in Japan. Because most of their electronic edition have been loaded on various digital repositories with support of OAI-PMH, we have been able to design a subject based portal website and visual user interface which consists of harvested metadata of the journals. The outline of the portal website is reported also.
Curvature and Flow in Digital Space
We first define the curvature indices of vertices of digital objects. Second, using these indices, we define the principal normal vectors of digital curves and surfaces. These definitions allow us to derive the Gauss-Bonnet theorem for digital objects. Third, we introduce curvature flow for isothetic polytopes defined in a digital space.
Curvature computations on surfaces in -space
Curvature in image and shape processing
The laplacian operator applied to the coordinates of a manifold provides the mean curvature vector. Manipulating the metric of the manifold or interpreting its coordinates in various ways provide useful tools for shape and image processing and representation. We will review some of these tools focusing on scale invariant geometry, curvature flow with respect to an embedding of the image manifold in a high dimensional space, and object segmentation by active contours defined via the shape laplacian...
Cutting Hyperplane Arrangements.
Cutting Hyperplanes for Divide-and-Conquer.
Cutwidth of iterated caterpillars
The cutwidth is an important graph-invariant in circuit layout designs. The cutwidth of a graph G is the minimum value of the maximum number of overlap edges when G is embedded into a line. A caterpillar is a tree which yields a path when all its leaves are removed. An iterated caterpillar is a tree which yields a caterpillar when all its leaves are removed. In this paper we present an exact formula for the cutwidth of the iterated caterpillars.
Cutwidth of the de Bruijn graph
Cutwidth of the -dimensional mesh of -ary trees
Cutwidth of the r-dimensional Mesh of d-ary Trees
We prove that the cutwidth of the r-dimensional mesh of d-ary trees is of order , which improves and generalizes previous results.
Cycle and path embedding on 5-ary N-cubes
We study two topological properties of the 5-ary -cube . Given two arbitrary distinct nodes and in , we prove that there exists an - path of every length ranging from to , where . Based on this result, we prove that is 5-edge-pancyclic by showing that every edge in lies on a cycle of every length ranging from to .
Cycle and Path Embedding on 5-ary N-cubes
We study two topological properties of the 5-ary n-cube . Given two arbitrary distinct nodes x and y in , we prove that there exists an x-y path of every length ranging from 2n to 5n - 1, where n ≥ 2. Based on this result, we prove that is 5-edge-pancyclic by showing that every edge in lies on a cycle of every length ranging from 5 to 5n.
Cyclic presentations of the trivial group.
Czech-Japanese Seminar in Applied Mathematics 2008
The Special Issue of Kybernetika is devoted to the publication of selected peer-reviewed articles submitted by the participants of the Czech-Japanese Seminar in Applied Mathematics 2008 which took place on September 1-7, 2008 in Takachi-ho and Miyazaki, Japan. The Czech-Japanese Seminar in Applied Mathematics 2008 was organized by the Department of Applied Physics, Faculty of Engineering, University of Miyazaki. It was the fourth meeting in the series of the Czech-Japanese Seminars in Applied Mathematics....
D0L sequence equivalence is in for fixed alphabets
A new algorithm is presented for the D0L sequence equivalence problem which, when the alphabets are fixed, works in time polynomial in the rest of the input data. The algorithm uses a polynomial encoding of words and certain well-known properties of -rational sequences.
D0L sequence equivalence is in P for fixed alphabets
A new algorithm is presented for the D0L sequence equivalence problem which, when the alphabets are fixed, works in time polynomial in the rest of the input data. The algorithm uses a polynomial encoding of words and certain well-known properties of -rational sequences.