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

Conference on Image Algebra and Morphological Image Processing V

作者： SCHMITT, M THOMSON CSF LCRF-91404 ORSAYFRANCE

ISBN: (纸本)081941624X

This paper deals with the robust extraction of line segments in noisy binary images. The principle is to find maximal geodesic arcs lying in the shape. A rigorous digital framework is first presented, then an efficient algorithm is described and results on real data presented. Some hints for filling the gaps between disconnected arcs are finally exposed.

关键词： MATHEMATICAL MORPHOLOGY GEODESIC DISTANCE sequential algorithms LINEAR STRUCTURE EXTRACTION

来源：评论

学校读者我要写书评

暂无评论

Persistent Queries in the Behavioral Theory of algorithms

引用

ACM TRANSACTIONS ON COMPUTATIONAL LOGIC 2011年第2期12卷 16-16页

作者： Blass, Andreas Gurevich, Yuri Univ Michigan Dept Math Ann Arbor MI 48109 USA Microsoft Res Redmond WA 98052 USA

We propose an extension of the behavioral theory of interactive sequential algorithms to deal with the following situation. A query is issued during a certain step, but the step ends before any reply is received. Later, a reply arrives, and later yet the algorithm makes use of this reply. By a persistent query, we mean a query for which a late reply might be used. Our proposal involves issuing, along with a persistent query, a location where a late reply is to be stored. After presenting our proposal in general terms, we discuss the modifications that it requires in the existing axiomatics of interactive sequential algorithms and in the existing syntax and semantics of abstract state machines. To make that discussion self-contained, we include a summary of this material before the modifications. Fortunately, only rather minor modifications are needed.

关键词： algorithms Languages Theory Verification Abstract state machines interactive algorithms sequential algorithms small-step algorithms step-for-step simulation

来源：评论

学校读者我要写书评

暂无评论

Ordinary interactive small-step algorithms, III

引用

ACM TRANSACTIONS ON COMPUTATIONAL LOGIC 2007年第3期8卷 16–es页

作者： Blass, Andreas Gurevich, Yuri Univ Michigan Ann Arbor MI 48109 USA

This is the third in a series of three articles extending the proof of the Abstract State Machine thesis-that arbitrary algorithms are behaviorally equivalent to abstract state machines-to algorithms that can interact with their environments during a step, rather than only between steps. As in the first two articles of the series, we are concerned here with ordinary, small-step, interactive algorithms. This means that the algorithms: (1) proceed in discrete, global steps, (2) perform only a bounded amount of work in each step, (3) use only such information from the environment as can be regarded as answers to queries, and (4) never complete a step until all queries from that step have been answered. After reviewing the previous articles' definitions of such algorithms, of behavioral equivalence, and of abstract state machines (ASMs), we prove the main result: Every ordinary, interactive, small-step algorithm is behaviorally equivalent to an ASM. We also discuss some possible variations of and additions to the ASM semantics.

关键词： algorithms theory sequential algorithms interaction postulates equivalence of algorithms abstract state machines

来源：评论

学校读者我要写书评

暂无评论

EXTENSIONAL AND INTENSIONAL MODELS FOR BOUNDED AND UNBOUNDED NONDETERMINISM

引用

LOGICAL METHODS IN COMPUTER SCIENCE 2021年第4期17卷 11:1-11:37页

作者： Laird, J. Univ Bath Dept Comp Sci Bath Avon England

We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which compute them. A fundamental result establishes that these extensional and intensional representations are equivalent, by showing how to construct the unique sequential algorithm which computes a given monotone and stable function, and describing the conditions on sequential algorithms which correspond to continuity with respect to each order. We illustrate by defining may-testing and must-testing denotational semantics for sequential functional languages with bounded and unbounded choice operators. We prove that these are computationally adequate, despite the non-continuity of the must-testing semantics of unbounded nondeterminism. In the bounded case, we prove that our continuous models are fully abstract with respect to may-testing and must-testing by identifying a simple universal type, which may also form the basis for models of the untyped lambda-calculus. In the unbounded case we observe that our model contains computable functions which are not denoted by terms, by identifying a further \weak continuity" property of the definable elements, and use this to establish that it is not fully abstract.

关键词： Nondeterminism Denotational Semantics Biorders sequential algorithms

来源：评论

学校读者我要写书评

暂无评论

Detection of the Movement of an Object From a Sequence of Images

引用

IFAC Proceedings Volumes 2000年第17期33卷 1247-1252页

作者： Gastón Lefranc Nestor González Cristián Power Universidad Católica de Valparaíso Chile Escuela de Ingeniería Eléctrica Fax: 56-32-273804 Universidad de Las Américas Chile Facultad de Ingeniería Fax: 56-2-2258520

A method is presented that allows determining the three-dimensional movement of an object starting from the analysis of a sequence of images. The mathematical model of angular relationship, gives results with small error using simple trigonometry. The method to calculate the trajectory of the movement of an object is based on the analysis of each frame, determining its location in each image, composing a line that represents the movement in time. The time of processing depends directly on the size of the analyzed images. The results are validated with video recordings carried out in laboratory and with real images.

关键词： Computer vision image processing trajectories object recognition sequential algorithms

来源：评论

学校读者我要写书评

暂无评论

On adaptive control problems of discrete-time stochastic systems

引用

IFAC Proceedings Volumes 2011年第1期44卷 12439-12444页

作者： Vyacheslav A. Vasiliev Department of Applied Mathematics and Cybernetics Tomsk State University Lenina 36 634050 Tomsk Russia

Abstract Let ( x ( t )) t ≥0 be a p -dimensional observable vector process ( p ≥ 1) with an input control process ( u ( t )) t ≥0 , described by the stochastic discrete time equation x(t + 1) = A(x(t))λ + u(t) + χ(t + 1), t ≥ 0, where the noises ξ( t ) form a sequence of zero mean random vectors having moments of all order; A( x ) is a linear matrix operator, A ( x ) : R p → R p x R q , q ≤ p and λ = (λ 1 , …, λ q )’ – vector of unknown parameters. In this paper we show how to approximate the process ( x ( t )) t ≥0 to the stable autoregressive process ( x 0 ( t )) t ≥0 with the given dynamic matrix parameter a, satisfying the equation x 0 (t + 1) = ax 0 (t) + χ(t + 1), t ≥ 0, by choosing the control process ( u ( t )) t ≥0 . More precisely, based on observation of ( x ( t )) t ≥0 , for given ε > 0 we construct an adaptive control procedure u ε = ( u ε ( t )) t ≥0 such that the corresponding observable process ( x ε ( t )) t ≥0 , x ε ( t ) = x ( t ) | u = u ε satisfies the following relations sup t≥0 E(x ɛ (t)) 2 ≤ L and sup t≥t ɛ E(x ɛ (t) - (x 0 (t)) 2 ≤ ɛ where L is some constant (independent of ε) and t ε is an unboundedly increasing as ε → 0 non-random function. The first relation ensures the stability of the object ( x ε ( t )). Examples of a scalar and two-dimensional autoregressive type linear models with unknown parameters are given. The rate ε −-1 ln ε −-1 of increase of t ε in both examples is obtained.

关键词： Adaptive control stabilization methods approximate analysis mean square accuracy parameter estimation sequential algorithms

来源：评论

学校读者我要写书评

暂无评论

Automatic Assembly Planning Based on Genetic algorithms

引用

IFAC Proceedings Volumes 1996年第1期29卷 553-558页

作者： Milad F. Sebaaly Hideo Fujimoto Nagoya Institute of Technology Department of Electromechanical Engineering Gokiso-cho Showa-ku Nagoya-shi 466 Japan

This paper introduces a new method for solving the assembly planning automation problem based on Genetic algorithms. Unlike other existing planners, the new method is not majorly sensitive to increases in product parts. The search space of assembly problems is restricted to feasible sequences only, while the GA output is stochastic in nature. To bypass this obstacle, this paper introduces a new mapping fA that transforms any randomly chosen sequence into a feasible sequence according to the assembly problem restrictions, while preserving some of its order characteristics. The algorithm GAF combining GA and fA is proved to converge when GA converges.

关键词： Assembly Factory automation Genetic algorithms Manufacturing systems Optimization problems Search methods sequential algorithms

来源：评论

学校读者我要写书评

暂无评论

Change point detection of autoregressive process with unknown parameters

引用

IFAC Proceedings Volumes 2011年第1期44卷 13215-13220页

作者： Sergey E. Vorobeychikov Yulya B. Burkatovskaya Department of Applied Mathematics and Cybernetics Tomsk State University 36 Lenin Prospekt 634050 Tomsk Russia Institute of Cybernetics Tomsk Polytechnical University 30 Lenin Prospekt 634050 Tomsk Russia

Abstract The problem of detecting the parameters change point in the autoregressive process is considered. The values of the process parameters before and after the change point are supposed to be unknown. The procedure of change point detection based on the sequential estimations of unknown parameters is proposed, procedure characteristics are studied. Results of numerical simulations are presented.

关键词： sequential algorithms change point detection weighted least square method guaranteed estimation autoregressive process

来源：评论

学校读者我要写书评

暂无评论

Optimizing regular computations based on neural networks and Graph Traversal

引用

Procedia Computer Science 2021年 186卷 337-343页

作者： O.T. Mohammed M.S. Heidari A.A. Paznikov Department of computer science knowledge and discovery Saint Petersburg Electrotechnical University “LETI” ul. Professora Popova 5 St. Petersburg 197376 Russia

In recent days we can see that multicore computers have the ability to easily manipulate digit numbers however as numbers get bigger the computation becomes more complex, the reason is that the size of both CPU registers and buses is limited. As a result, the arithmetic operations such as addition, subtraction, multiplication, and division for CPU become more complex to perform. For solving the problem of how to do computation on big digit numbers, a number of algorithms have been developed. However, the existing algorithms are noticeably slow because they operate on bits individually and are designed to run over single-core computers only. In this paper, an AI model is presented that performs a computation on tokens of 8-digit numbers to assist boost the CPU computation performance.

关键词： Node iteration algorithms sequential algorithms Parallel algorithms Neural networks

来源：评论

学校读者我要写书评

暂无评论

On-Line Adaptive Fuzzy Diagnosis System: Fusion and Supervision

引用

IFAC Proceedings Volumes 1997年第18期30卷 1195-1200页

作者： A.N. Boudaoud M.H. Masson Heudiasyc U.M.R. C.N.R.S. 6599 Université de Technologie de Compiègne B.P. 20529 60205 Compiègne Cedex France

This paper gives a description of an adaptive on-line diagnosis system for the detection of slow varying changes in dynamical systems using a fuzzy pattern recognition approach. This contribution is an extent ion of a previous paper (Boudaoud et al ., 1996), we have included in the diagnosis and supervision scheme a fusion moduleto combine the decisions of the different sources i.e. classes.

关键词： on-line diagnosis fusion fault detection sequential algorithms fuzzy sets steady states supervision dynamic systems neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：