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

3rd International Conference on Digital Information Processing, Data Mining, and Wireless Communications (DIPDMWC)

作者： Epishkina, Anna Kogos, Konstantin Nikiforova, Natalia Natl Res Nucl Univ MEPhI Dept Cryptol & Cybersecur Moscow Russia

ISBN: (纸本)9781467393799

The purpose of this work is to show that the course, Mathematical Logic and theory of algorithms, lectured by the authors in National Research Nuclear University MEPhI (Moscow Engineering Physics Institute) is the mathematical background of the cryptology study. Bachelors and specialists information security teaching has to focus attention on the mathematical training, therefore a set of mathematical disciplines should stand before applied cryptography in the curriculum. Due to the rapid development of computer power and information communication, cryptographic techniques have change. Hence, the course of Mathematical Logic and theory of algorithms is not fixed and vice versa it is dynamically updated, since changes in cryptographic methods bring out a revision of the mathematical background.

关键词： mathematical logic theory of algorithms cryptology Boolean functions curriculum

来源：评论

学校读者我要写书评

暂无评论

The power of verification for one-parameter agents

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2009年第3期75卷 190-211页

作者： Auletta, Vincenzo De Prisco, Roberto Penna, Paolo Persiano, Giuseppe Univ Salerno Dipartimento Informat & Applicaz I-84081 Baronissi Italy

We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better than mechanisms without verification, i.e., those previously considered in the literature. These results are obtained for a number of optimization problems motivated by the Internet and recently studied in the algorithmic mechanism design literature. The characterization can be regarded as an alternative approach to existing techniques to design truthful mechanisms. The construction of such mechanisms reduces to the construction of an algorithm satisfying certain "monotonicity" conditions which. for the case of verification, are much less stringent. In other words, verification makes the construction easier and the algorithm more efficient (both computationally and in terms of approximability). (C) 2008 Elsevier Inc. All rights reserved.

关键词： Algorithmic game theory Mechanism design theory of algorithms

来源：评论

学校读者我要写书评

暂无评论

The Role of the Scientific Council "Cybernetics" of the USSR Academy of Sciences/the Russian Academy of Sciences in the Development of National Cybernetics and Computer Technology

引用

PATTERN RECOGNITION AND IMAGE ANALYSIS 2023年第4期33卷 988-1049页

作者： Amirdjanov, G. P. Gurevich, I. B. Kostyuk, F. V. Kulberg, N. S. Rudchenko, T. A. Semenov, A. L. Sotnikov, A. N. Trusova, Yu. O. Uvarov, A. Yu. Vardanyan, V. A. Yakovleva, T. V. Yashina, V. V. Zakharova, A. S. Russian Acad Sci Fed Res Ctr Comp Sci & Control Moscow 119333 Russia Russian Acad Sci Joint Supercomp Ctr Moscow 119334 Russia

The review presents the history of the creation and work of the Scientific Council "Cybernetics" (SCC)-the center for development of cybernetics in the USSR and Russia. The Council's activity is covered as a structure that coordinates scientific and technical activity in cybernetics in the country via a system of sections: about 16 public and professional bodies involving thousands of specialists. Brief information about the sections is given. The chronology of development of the SCC is discussed, in particular, information about its chairmen, starting with the renowned organizer of research and development, Academician and Admiral Axel Ivanovich Berg and the following academicians: B.N. Petrov, O.M. Belotserkovsky, A.P. Ershov, E.P. Velikhov, B.V. Bunkin, and Yu.I. Zhuravlev. The SCC's publishing activity is briefly reviewed. The second function, built into the SCC from its onset, is as a research institute conducting its own research on the most pressing scientific problems insufficiently covered by existing structures. Several main areas of research by the SCC itself and its successor, the Axel Berg Institute of Cybernetics and Educational Computing of the Federal Research Center "Computer Science and Control" of the RAS: coding and transmission of information, economic cybernetics, aircraft control, supercomputers, digital technologies in education, mathematical logic and the theory of algorithms, pattern recognition and image analysis, mathematical methods of image analysis, theoretical physics, biomedical cybernetics, and ultrasound imaging. Another function of the SCC is considered: as an incubator of new academic industrially oriented structures and the fate of one of them-the Institute of Cybernetics Problems-is traced.

关键词： Scientific Council "Cybernetics" of the USSR Academy of Sciences cybernetics computer science scientific research management Academy of Sciences Institute of Cybernetics Problems of the USSR Academy of Sciences PSRG "School-1" Axel Berg VA Melnikov EP Velikhov pattern recognition image analysis mathematical logic theory of algorithms theoretical physics biomedical cybernetics

来源：评论

学校读者我要写书评

暂无评论

CONTINUOUS RELAXATION AND LOCAL MAXIMA SELECTION - CONDITIONS FOR EQUIVALENCE

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1981年第2期3卷 117-127页

作者： ZUCKER, SW LECLERC, YG MOHAMMED, JL MEMBER IEEE Department of Electrical Engineering Computer Vision and Graphics Laboratory McGill University Montreal P.Q. Canada

Relaxation labeling processes are a class of iterative algorithms for using contextual information to reduce local ambiguities. This paper introduces a new perspective toward relaxation-that of considering it as a process for reordering labels attached to nodes in a graph. This new perspective is used to establish the formal equivalence between relaxation and another widely used algorithm, local maxima selection. The equivalence specifies conditions under which a family of cooperative relaxation algorithms, which generalize the well-known ones, decompose into purely local ones. Since these conditions are also sufficient for guaranteeing the convergence of relaxation processes, they serve as stopping criteria. We feel that equivalences such as these are necessary for the proper application of relaxation and maxima selection in complex speech and vision understanding systems.

关键词： Computer vision Algorithm design and analysis Labeling Iterative algorithms Convergence Speech Machine vision Wide area networks Histograms Computer graphics Author Keywords theory of algorithms Computer vision histogram peak selection local computations relaxation

来源：评论

学校读者我要写书评

暂无评论

PHYSARUM MACHINE: IMPLEMENTATION OF A KOLMOGOROV-USPENSKY MACHINE ON A BIOLOGICAL SUBSTRATE

引用

PARALLEL PROCESSING LETTERS 2007年第4期17卷 455-467页

作者： Adamatzky, Andrew Univ W England Fac Comp Engn & Math Sci Bristol BS16 1QY Avon England

We implement a Kolmogorov-Uspensky machine on the Plasmodium of the slime mold Physarum polycephalum. We provide experimental findings on realization of the machine instructions, illustrate basic operations, and eleme... 详细信息

关键词： nature inspired computing theory of computation Plasmodium theory of algorithms

来源：评论

学校读者我要写书评

暂无评论

Initial segments of effectively finite orders

引用

MATHEMATICAL NOTES 1997年第5-6期61卷 793-795页

作者： Solovev, VD KAZAN VI LENIN STATE UNIV INST MATH & MECHKAZANRUSSIA

来源：评论

学校读者我要写书评

暂无评论

ON THE EXISTENCE OF FAIR MATCHING algorithms

引用

theory AND DECISION 1989年第3期26卷 305-322页

作者： MASARANI, F GOKTURK, SS ST JOHNS UNIV DEPT ECON JAMAICA NY 11439 USA

We analyze the Gale-Shapley matching problem within the context of Rawlsian justice. Defining a fair matching algorithm by a set of 4 axioms (Gender Indifference, Peer Indifference, Maximin Optimality, and Stability), we show that not all preference profiles admit a fair matching algorithm, the reason being that even this set of minimal axioms is too strong in a sense. Because of conflict between Stability and Maximin Optimality, even the algorithm which generates the mutual agreement match, paradoxically, has no chance to be fair.

关键词： combinatorial optimization theory of algorithms matching fairness axiomatic justice marriage assignment markets job matching

来源：评论

学校读者我要写书评

暂无评论

EVOLVING MULTIALGEBRAS UNIFY ALL USUAL SEQUENTIAL COMPUTATION MODELS

EVOLVING MULTIALGEBRAS UNIFY ALL USUAL SEQUENTIAL COMPUTATIO...

引用

27th International Symposium on Theoretical Aspects of Computer Science (STACS)

作者： Grigorieff, Serge Valarcher, Pierre CNRS LIAFA Case 7014 F-75205 Paris 13 France Univ Paris Diderot Paris 7 F-75205 Paris 13 France Univ Paris Est LACL IUT Fontainebleau Senart F-77300 Fontainebleau France

ISBN: (纸本)9783939897163

It is well-known that Abstract State Machines (ASMs) can simulate "step-by-step" any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) simulation is not identification, 2) the ASMs simulating machines of some type do not constitute a natural class among all ASMs. We modify Gurevich's notion of ASM to that of EMA ("Evolving MultiAlgebra") by replacing the program (which is a syntactic object) by a semantic object: a functional which has to be very simply definable over the static part of the ASM. We prove that very natural classes of EMAs correspond via "literal identifications" to slight extensions of the usual machine models and also to grammar models. Though we modify these models, we keep their computation approach: only some contingencies are modified. Thus, EMAs appear as the mathematical model unifying all kinds of sequential computation paradigms.

关键词： Abstract state machines Models of machines Computability Universality Logic in computer science theory of algorithms

来源：评论

学校读者我要写书评

暂无评论

Functionals Using Bounded Information and the Dynamics of algorithms 12

Functionals Using Bounded Information and the Dynamics of Al...

引用

27th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

作者： Grigorieff, Serge Valarcher, Pierre CNRS LIAFA Paris France Univ Paris 07 Paris France Univ Paris Est LACL IUT Fontainebleau France

ISBN: (纸本)9780769547695

We consider computable functionals mapping the Baire space into the set of integers. By continuity, the value of the functional on a given function depends only on a "critical" finite part of this function. Care: there is in general no way to compute this critical finite part without querying the function on an arbitrarily larger finite part! Nevertheless, things are different in case there is a uniform bound on the size of the domain of this critical finite part. We prove that, modulo a quadratic blow-up of the bound, one can compute the value of the functional by an algorithm which queries the input function on a uniformly bounded finite part. Up to a constant factor, this quadratic blow-up is optimal. We also characterize such functionals in topological terms using uniformities. As an application of these results, we get a topological characterization of the dynamics of algorithms as modeled by Gurevich's Abstract State Machines.

关键词： Type 2 computability theory of algorithms Abstract state machines Operational semantics

来源：评论

学校读者我要写书评

暂无评论

ASMs and Operational Algorithmic Completeness of Lambda Calculus

ASMs and Operational Algorithmic Completeness of Lambda Calc...

引用

YuriFest: Symposium on Logic in Computer Science

作者： Ferbus-Zanda, Marie Grigorieff, Serge Univ Paris Diderot LIAFA Case 7014 F-75205 Paris 13 France CNRS LIAFA F-75205 Paris 13 France

ISBN: (纸本)9783642150241

We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family of computable functions (taken as primitive tools, i.e., kind of oracle functions for the algorithm), for every constant K big enough, each computation step of the algorithm can be simulated by exactly K successive reductions in a natural extension of lambda calculus with constants for functions in the above considered family. The proof is based on a fixed point technique in lambda calculus and on Gurevich sequential Thesis which allows to identify sequential deterministic algorithms with Abstract State Machines. This extends to algorithms for partial computable functions in such a. way that finite computations ending with exceptions are associated to finite reductions leading to terms with a particular very simple feature.

关键词： ASM lambda calculus theory of algorithms operational semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：