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

International Conference on Document Analysis and Recognition

作者： D. Madej A. Sokolowski Department of Computer Technology and Programming Bilkent University Ankara Turkey IFTR Polish Academy of Sciences Poland Academy of Economics krakow Poland and Department of Economics Bilkent University Ankara Turkey

Automatic evaluation of drawing-to-CAD conversion performance is addressed. The generating model of artificial images in the domain of cadastral maps was built. The proposed model was close to the authentic drawings on the level of graphic primitives and on the level of map understanding. The shape of the parcel was characterized by the number of corners, line lengths and respective angles. The model of a house consists of 12 random variables, while the 13th variable describes the location of the house in a parcel. The parameters of probability distributions have been estimated from the sample of 115 parcels and 127 houses. The goodness-of-fit for all distributions was very high.< >

关键词： Performance analysis Performance evaluation Image converters Shape Image generation Automatic testing Paper technology Automatic programming Graphics Random variables

来源：评论

学校读者我要写书评

暂无评论

CONCURRENT BOUNDARY-ELEMENT COMPUTATION

引用

INTERNATIONAL JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS 1993年第2期6卷 83-98页

作者： MCDOWALL, DS LEE, TW FUSCO, VF Microwave Research Group Department of Electrical and Electronic Engineering The Queen's University of Belfast Ashby Building Stranmillis Road Belfast BT9 5AH Northern Ireland U.K. D. Stewart McDowall was born in Dublin epublic of Ireland in 1967. He received the M. Eng. degree in Electrical and Electronic Engineering from the Queen's University of Belfast in 1990. In the same year he was presented with a Distinction Award from the Department of Education of Northern Ireland and he is currently pursuing his Ph.D. in the Microwave Research Group at Q.U.B. His principal research area is the electromagnetic field mapping of microwave systems using concurrient programming. He is an Associate Member of the Institute of Electrical Engineers. Lee Thaim Wee was awarded the degree of B. Eng. in Electronics from the Queen's University of Belfast in July 1991. He is currently serving in the Malaysian Armed Forces. Vincent F. Fusco was educated at the Queen's Univeristy of Belfast where he obtained the degree of Ph.D. in 1982. He has worked as a research engineer on short-range radar and radio telementry systems. Currently he is a reader in Microwave Communications in the School of Electrical Engineering and Computer Science the Queen's Univeristy of Belfast. His current research interests include non-linear microwave circuit simulation and concurrent programming techniques for electromagnetic field problems with particular emphasis on EMC applications. He has published numerous research papers in these areas. He is the author of the bookMicrowave Circuits Analysis and Computer Aided Design Prentice-Hall 1987. Dr Fusco is a Chartered Electrical Engineer and a Member of the Institute of Electrical Engineers.

A major limitation of the boundary element method (BEM) for the solution of electrical potential problems is the long computational time required. However, a large portion of the calculations involved can be viewed as being parallel in nature and can therefore be computed concurrently. This paper makes an effort to increase the efficiency of the BEM process using transputer-based multiprocessor computing techniques. The algorithms developed may equally well be applied to any multiprocessor system. The application selected to demonstrate the technique is the solution of an electrostatic problem governed by a two-dimensional Laplace equation. A parallel algorithm for problem setup and field extraction using BEM is designed and implemented on a transputer array. Special attention is directed to the utilization of the parallel processors to achieve maximum efficiency. The analysis in this work concentrates on the communication strategies for passing data between processors as well as a consideration of the workload attributed to each processor. The parallel algorithms were implemented using 3L Parallel Fortran;however, the choice of topology for the overall BEM implementation was limited by the fact that certain parts of the algorithm could only utilize a pipeline configuration of processors. Comprehensive results for the parallel BEM algorithm are given and they are encouraging, indicating that parallel processing has much to offer when applied to the boundary element method.

关键词： Boundary element method

来源：评论

学校读者我要写书评

暂无评论

TLM MODELING USING AN SIMD computer

引用

INTERNATIONAL JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS 1993年第4期6卷 299-304页

作者： TAN, CC FUSCO, VF The Queen's University of Belfast Department of Electrical & Electronic Engineering Ashby Building Stranmillis Road Belfast BT9 5AH U.K. Chun Chia Tan obtained a first-class honours degree from The Queen's University of Belfast. He was awarded an IEE prize for best final-year project. His current research interests include the modelling of electromagnetic fields using parallel processing techniques. At present Mr Tan is working as an electrical engineer in Malaysia. Vincent F. Fusco was educated at The Queen's University of Belfast where he obtained the degree of Ph.D. He has worked as a research engineer on short-range radar and radio telementry systems. Currently he is a Reader in Microwave Commnications in the School of Electrical Engineering and Computer Science The Queen's Univeristy of Belfast. His current research interests include non-linear microwave circuit simulation and concurrent programming techniques for electromagnetic field problems. He has acted as consultant to a number of major companies and has published numerous research papers in these areas. He is author of the bookMicrowave Circuits Analysis and Computer Aided Design(Prentice Hall 1987). Dr Fusco is a Chartered Electrical Engineer and a Member of the Institute of Electrical Engineers.

A major limitation of the transmission-line matrix (TLM) method used to solve Maxwell's equations is the long computation time required. The TLM scattering calculations involved can, however, be viewed as parallel in nature. This paper describes an effort to reduce computational time by using an SIMD, DAP multiprocessor computer employed to solve a two-dimensional TLM electromagnetic field formulation. A parallel algorithm based on the TLM scattering algorithm is designed and implemented using FORTRAN-PLUS Enhanced on an AMT DAP 510 machine. Here the connectivity of the DAP is exploited to simulate the intrinsic scattering behaviour on which the TLM algorithm relies. The results show that parallel processing on an SIMD machine such as the DAP is advantageous, especially for higher-order mesh sizes.

关键词： Electric lines

来源：评论

学校读者我要写书评

暂无评论

On the Complexities of Non-Horn Clause Logic programming

引用

Journal of computer Science & Technology 1992年第2期7卷 114-122页

作者：聂旭民 Institute for Programming and Logics Department of computer science State University of New York at AlbanyAlbanyNew York 12222U.S.A.

There have been active work to extend the Prolog style Horn Clause logic programming to non-Horn *** this paper,we will analyze the complexities of several such *** purpose is to understand the computational complexity of these inference *** analyses do not prove that any one system is better than the others all the *** they do suggest that one system may be better than the others for some particular *** also discuss the effect of caching.

关键词： Prolog On the Complexities of Non-Horn Clause Logic programming

来源：评论

学校读者我要写书评

暂无评论

ALGORITHMIC DEBUGGING FOR LAZY FUNCTIONAL LANGUAGES 4th

ALGORITHMIC DEBUGGING FOR LAZY FUNCTIONAL LANGUAGES

引用

4TH INTERNATIONAL SYMP ON programming LANGUAGE IMPLEMENTATION AND LOGIC programming ( PLILP 92 )

作者： NILSSON, H FRITZSON, P Programming Environments Laboratory Department of Computer and Information Science Linköping University Linköping S-581 83 Sweden

ISBN: (纸本)3540558446

Lazy functional languages have non-strict semantics and are purely declarative, i.e. they support the notion of referential transparency and are devoid of side effects. Traditional debugging techniques are, however, not suited for lazy functional languages since computations generally do not take place in the order one might expect. Since algorithmic debugging allows the user to concentrate on the declarative aspects of program semantics, and will semi-automatically find functions containing bugs, we propose to use this technique for debugging lazy functional programs. In this paper we present an algorithmic debugger for a lazy functional language and some experience in using it. Because of the non-strict semantics of lazy functional languages, arguments to functions are in general partially evaluated expressions. The user is, however, usually more concerned with the values that these expressions represent. We address this problem by providing the user with a strictified view of the execution trace whenever possible. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Complexity of unification problems with associative-commutative operators

引用

Journal of Automated Reasoning 1992年第2期9卷 261-288页

作者： Kapur, Deepak Narendran, Paliath Institute of Programming and Logics Department of Computer Science State University of New York at Albany Albany 12222 NY United States

The unification problem for terms containing associative and commutative functions is of importance in theorem provers based on term rewriting and resolution methods as well as in logic programming. The complexity of determining whether two such terms are unifiable was known to be NP-hard. It is proved that the problem is NP-complete by describing a nondeterministic polynomial time algorithm for it. The case where the terms are linear and have no common variables is shown to be in P. The NP-completeness of other similar unification problems, in particular, when a function symbol is also idempotent and/or has a unit (identity), is also discussed. Finally, a table of the complexity of E-matching and E-unification problems is given. © 1992 Kluwer Academic Publishers.

关键词： associative commutative complexity equational theories idempotent identity matching NP-complete set matching Unification unit word equations

来源：评论

学校读者我要写书评

暂无评论

Intelligent system for feature- based modelling of machine parts 5th

引用

5th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 1992

作者： Lekova, Anna Batanov, Dentcho Nikolaev, Nikolay Department of Programming and Computer Applications Technical University Sofia1156 Bulgaria Artificial Intelligence Laboratory Department of Computer Science Technical University Sofia1156 Bulgaria

ISBN: (纸本)9783540556015

This paper proposes a new system for feature- based modelling- ISFBM with built in strategy for defining details by their features, realizing design process over the computational model of rule- based systems paradigm. The construction includes facts for describing the features and rules for modelling with them. The presented approach gives a flexible and convenient mechanism for modifying the model and semantic analysis of the received product. Specific characteristic is the tool for automatic generation of general features, based on the primitive ones, with which the domain of application is extended. © 1992, Springer Verlag. All rights reserved.

关键词： Knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

An object-oriented language for symbolic computationapplied to machine element analysis 92

An object-oriented language for symbolic computationapplied ...

引用

1992 International Symposium on Symbolic and Algebraic Computation, ISSAC 1992

作者： Viklund, Lars Fritzson, Peter Programming Environments Laboratory Department of Computer and Information Science Linköping University LinköpingS-581 83 Sweden

ISBN: (纸本)0897914899

In this paper we present the ObjectMath language, a hybrid language integrating object-oriented constructs with features for symbolic and numeric computation. Complex mathematical models may be implemented in a natural way using ObjectMath. Objects are used to structure models that might consist of a large number of equations while inheritance facilitates reuse of equations and formulae. The class specialization hierarchy is also used to generate specialized efficient numeric code from general symbolic equations and expressions. A first prototype of the ObjectMath programming environment has been implemented and successfully used for modeling and analyzing two different machine element analysis problems. © 1992 ACM.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Computing with lattices: An application of type classes

引用

Journal of Functional programming 1992年第4期2卷 475-503页

作者： Jones, Mark P. Programming Research Group Oxford University UK Department of Computer Science Yale University Yale Station New Haven CT 06520-2158 PO Box 2158 United Kingdom

This paper presents a simple framework for performing calculations with the elements of (finite) lattices. A particular feature of this work is the use of type classes to enable the use of overloaded function symbols within a strongly typed language. Previous applications of type classes have been in areas that are of most interest to language implementors. This paper suggests that type classes might also be useful as a general tool in the development of clear and modular programs. © 1992, Cambridge University Press. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Double-exponential complexity of computing a complete set of AC-unifiers

Double-exponential complexity of computing a complete set of...

引用

Annual Symposium on Logic in computer Science

作者： D. Kapur P. Narendran Institute of Programming and Logics Department of Computer Science State University of New York Albany Albany NY USA

An algorithm for computing a complete set of unifiers for two terms involving associative-commutative function symbols is presented. It is based on a nondeterministic algorithm given by the authors in 1986 to show the NP-completeness of associative-commutative unifiability. The algorithm is easy to understand, and its termination can be easily established. Its complexity is easily analyzed and shown to be doubly exponential in the size of the input terms. The analysis also shows that there is a double-exponential upper bound on the size of a complete set of unifiers of two input terms. Since there is a family of simple associative-commutative unification problems which have complete sets of unifiers whose size is doubly exponential, the algorithm is optimal in its order of complexity in this sense.< >

关键词： Logic programming Functional programming computer science AC generators Upper bound Algorithm design and analysis Equations Artificial intelligence Database languages History

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：