检索结果-内蒙古大学图书馆

Linear-time recognition of connectivity of binary images on 1-bit inter-cell communication cellular automaton

PARALLEL COMPUTING 2001年第5期27卷 587-599页

作者： Umeo, H Osaka Electrocommun Univ Fac Informat Sci & Technol Dept Engn Informat Osaka 5728530 Japan

We introduce a new class of two-dimensional cellular automata (CAs) whose inter-cell communication is restricted to 1-bit and propose a linear-time connectivity recognition algorithm for two-dimensional binary images. Precisely, it is shown that a set of two-dimensional connected binary images of size m x n can be recognized in 2(m + n) + O(1) steps by a two-dimensional CA with 1-bit inter-cell communication. (C) 2001 Elsevier Science B.V. All rights reserved.

关键词： cellular automaton connectivity recognition algorithm parallel connectivity-preserving shrinking algorithm 1-bit inter-cell communication cellular algorithm

来源：评论

学校读者我要写书评

暂无评论

CELIP - A cellular LANGUAGE FOR IMAGE-PROCESSING

引用

PARALLEL COMPUTING 1990年第1期14卷 99-109页

作者： HASSELBRING, W Universität-GH-Essen Fachbereich 6 Informatik/Software Engineering Schützenbahn 70 4300 Essen 1 FRG

cellular automata might be implemented as programmable special-purpose processors controoled by universal computer systems. This configuration is appropriate, because in general only special tasks of complex problems are efficiently parallelizable. Many task for image processing like window operators for filtering, smoothing or edge detection may be presented in a way particularly suitable for cellular automata. In this paper we present CELIP, a cellular Language for Image Processing. It has been developed for prototyping cellular algorithms for image processing.

关键词： cellular algorithm cellular automaton image processing Parallel computer programming language SIMD

来源：评论

学校读者我要写书评

暂无评论

A LATTICE MODEL FOR cellular (SYSTOLIC) algorithmS

引用

PARALLEL COMPUTING 1986年第3期3卷 251-258页

作者： KATONA, E Research Group on Automata Theory Hungarian Academy of Sciences H-6720 Szeged Hungary

In this paper a lattice model (here ‘lattice’ means a net of points) is introduced for homogeneous cellular algorithms. On the basis of this model a transformation methodology is developed, which makes it possible to produce many different versions of a given cellular algorithm. These versions may have quite different structural properties, but they perform the same computation as the original algorithm. In this way a great variety of cellular algorithms can be offered to choose the best version in practice and, on the other hand, cellular algorithms can be classified according to their inherent structures.

关键词： cellular algorithm design of algorithms Systolic algorithm

来源：评论

学校读者我要写书评

暂无评论

cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem

引用

DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS 2017年第4期27卷 609-640页

作者： Vahidipour, S. Mehdi Meybodi, Mohammad Reza Esnaashari, Mehdi Univ Kashan Dept Comp Fac Elect & Comp Engn Kashan Iran Inst Res Fundamental Sci IPM Sch Comp Sci POB 19395-5746 Tehran Iran Amirkabir Univ Technol Comp Engn & Informat Technol Dept Tehran Iran KN Toosi Univ Technol Dept Comp Engn Tehran Iran

In a Petri net, a decision point is raised when two or more transitions are simultaneously enabled in a given marking. The decision to be made at such a point is the selection of an enabled transition for firing. Decision making in Petri nets is accomplished by a so called controlling mechanism. Whenever a Petri net is used to represent an algorithm, the application of a different controlling mechanism results in a different instance of that algorithm. Recently, an adaptive controlling mechanism has been introduced for Petri nets in which several learning automata are used as decision makers during the evolution of the Petri nets. A Petri net with this adaptive controlling mechanism is referred to as APN-LA. Using APN-LA, one may be able to design adaptive algorithms to solve problems. There are problems for which designing a single APN-LA is tedious and results in a large and complex model. One class of such problems is the cellular problem, in which an identical algorithm must be executed in each cell and the solution to the problem is generated from the cooperation of these identical algorithms. To avoid having large and complex APN-LAs for cellular problems, a cellular adaptive Petri net called CAPN-LA is proposed in this paper, which consists of a cellular structure and a number of identical APN-LAs. In CAPN-LA, each APN-LA represents the algorithm which must be executed in each cell, and the required cooperation between the neighboring cells is handled by means of cooperation between the APN-LAs in those cells. The notation of expediency for this model is defined, and, using the steady-state analysis of the behavior of the CAPN-LA model, conditions under which this model is expedient are stated. A measure of expediency is defined for comparing different CAPN-LAs according to their expected reward;a CAPN-LA which receives a higher expected reward is regarded as more expedient. The proposed CAPN-LA is then used to design different algorithms for the classic prob

关键词： AdaptivePetri net Learning automata cellular algorithm Graph-based problems Vertex coloring (VC) problem

来源：评论

学校读者我要写书评

暂无评论

CEPROL - A cellular PROGRAMMING LANGUAGE

引用

PARALLEL COMPUTING 1985年第4期2卷 327-333页

作者： SEUTTER, F Institut für Theoretische und Praktische Informatik Technische Universität Braunschweig 3300 Braunschweig Fed. Rep. Germany

Realized cellular automata may be operated by universal computer systems as programmable special-purpose processors for parallelizable problems. Because of their architecture (local neighbourhood, small storage size per cell, they are well suited for processing systolic algorithms. A cellular programming language — named CEPROL — is presented which offers means for programming and controlling cellular automata processing such algorithms.

关键词： cellular algorithm cellular automation Parallel computer programming language systolic algorithm

来源：评论

学校读者我要写书评

暂无评论

A PARALLEL O(LOG N) algorithm FOR THE DRAWING OF ALGEBRAIC-CURVES IN AN N X N SQUARE

引用

INFORMATION PROCESSING LETTERS 1986年第5期23卷 221-226页

作者： SOMMERHALDER, R VANWESTRHENEN, SC Department of Mathematics and Informatics Technical University Delft Julianalaan 132 2628 BL Delft The Netherlands

A description is given of a parallel O(log n) algorithm for the drawing of algebraic curves in the digital plane. The algorithm, which contains a systolic subroutine, is implemented in a parallel computer structure called pyramid cellular automation. The constructibility of conics and particularly of circles in O(log n) time follows are considered as a special case. Thus, Sakoda's (1981) exact circle problem is solved by an O(log n) algorithm. Finally, it is shown that every construction with ruler and compasses in the Euclidean plane can be executed in O(log n) time. This holds because every such construction is a sequence of one of the following O(log n) basic constructions, namely, drawing a line through 2 given points, drawing a circle with given center and radius, and constructing intersection points of these curves.

关键词： Parallel processing cellular spaces pyramid cellular automaton systolic algorithm cellular algorithm exact circle problem self-organizing automata

来源：评论

学校读者我要写书评

暂无评论

Synchronizing square arrays in optimum-time

引用

INTERNATIONAL JOURNAL OF GENERAL SYSTEMS 2012年第6期41卷 617-631页

作者： Umeo, Hiroshi Osaka Electrocommun Univ Osaka Japan

The firing squad synchronization problem on cellular automata has been studied extensively for more than 50 years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional (1D) arrays but also 2D arrays. In this paper, we construct a survey on a design and implementation of optimum-time synchronization algorithms for 2D square arrays.

关键词： cellular automaton firing squad synchronization problem FSSP cellular algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：