The notion of program-computable function on a universal algebra is formalized through the notion of conditional term. This leads to a somewhat new approach to the study of traditional algebraic problems related to bo...
详细信息
The notion of program-computable function on a universal algebra is formalized through the notion of conditional term. This leads to a somewhat new approach to the study of traditional algebraic problems related to both universal classes and specific finite algebras, and also enables one to pose and investigate the problem of the computation resources of universal algebras.
The problem of knowledge computation has been put forward and stated in detail by dissecting the characteristics of industrial process control in this paper. A kind of theory of knowledge computation for intelligent p...
详细信息
ISBN:
(纸本)0780342534
The problem of knowledge computation has been put forward and stated in detail by dissecting the characteristics of industrial process control in this paper. A kind of theory of knowledge computation for intelligent process control has been proposed to overcome the difficulties in the intelligent control for industrial processes. The theory bases on the characteristics of knowledge that can be quantified and numerically calculated to represent the space-time causality in intelligent process control system. The intents and methodology of the knowledge computation theory for intelligent process control have been presented. In the architecture of the theory, the computational properties of knowledge in intelligent process control can be described in three aspects: computation theory, algorithm and realizing method. The problems of knowledge representation, correspondent reasoning mechanism and knowledge acquisition strategy have been studied also.
A computation theory is proposed for the orientation-selective simple cells of the striate cortex. The theory consists of three parts: (a) a probabilistic computation theory based on MRFs and the MAP estimation princi...
详细信息
ISBN:
(纸本)3540630473
A computation theory is proposed for the orientation-selective simple cells of the striate cortex. The theory consists of three parts: (a) a probabilistic computation theory based on MRFs and the MAP estimation principle which is assumed to be carried out by the visual pathway lying between the lateral geniculate nuclei and the simple cells;(b) a deterministic parallel algorithm which compute the MAP estimation approximately;and (c) a neural implementation of the algorithm.
The proceedings contain 49 papers from the Fundamentals of computation theory: 15th International Symposium, FCT 2005. The topics discussed include: the complexity of querying external memory and streaming data;the sm...
详细信息
The proceedings contain 49 papers from the Fundamentals of computation theory: 15th International Symposium, FCT 2005. The topics discussed include: the complexity of querying external memory and streaming data;the smoothed analysis of algorithms;path coupling using stopping times;biautomatic semigroups;deterministic automata on unranked trees;generic density and small span theorem;a faster and simpler 2-approximation algorithm for block sorting;on the power of unambiguity in alternating machines;improved algorithms and complexity results for power domination in graphs;perfect reconstruction of black pixels revisited;completeness and compactness of quantitative domains;and tree automata and discrete distributed games.
Programmable devices and EDA (electronic design automation) software tools are widely used to design today's digital systems. Many introductory digital systems courses are aware of the trend and integrate the tech...
详细信息
Programmable devices and EDA (electronic design automation) software tools are widely used to design today's digital systems. Many introductory digital systems courses are aware of the trend and integrate the technology, especially HDL (hardware description language) and synthesis software, into their curriculums. Introducing basic concepts of computation theory, including computability and algorithm complexity, can help students to understand the capability and fundamental limitations of the software and thus to utilize it in a more efficient manner. The computation theory will also provide a new perspective and shed light on many issues encountered in digital design.
The proceedings contain 41 papers. The topics discussed include: rewriting systems with data;spiking neural p systems: some characterizations;a largest common d-dimensional subsequence of two d-dimensional strings;ana...
详细信息
ISBN:
(纸本)9783540742395
The proceedings contain 41 papers. The topics discussed include: rewriting systems with data;spiking neural p systems: some characterizations;a largest common d-dimensional subsequence of two d-dimensional strings;analysis of approximation algorithms for k-set cover using factor-revealing linear programs;a novel information transmission problem and its optimal solution;local testing of message sequence charts is difficult;the complexity of membership problems for circuits over sets of positive numbers;pattern matching in protein-protein interaction graphs;a string-based model for simple gene assembly;on the computational power of genetic gates with interleaving semantics: the power of inhibition and degradation;factorization of fuzzy automata;factorization forests for infinite words;the quantum query complexity of weakly recognizable tree languages;and productivity of stream definitions.
暂无评论