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

Modal logics for local and global similarity relations

Fundamenta Informaticae 1997年第3-4期31卷 295-304页

作者： Deneva, Ana Vakarelov, Dimiter Dept. Math. Logic Lab. Appl. Logic Fac. of Math. and Computer Science Sofia University bout James Bouchier 5 1126 Sofia Bulgaria

来源：评论

学校读者我要写书评

暂无评论

Bipartite Coverings of Graphs

引用

Combinatorics Probability and Computing 1997年第3期6卷 349-352页

作者： Rödl, Vojtech Ruciński, Andrzej Dept. of Math. and Computer Science Emory University Atlanta GA 30322 United States Fac. of Math. and Computer Science Adam Mickiewicz University Poznań Poland

In this note we give a probabilistic proof of the existence of an n-vertex graph Gn, n = 1,2,..., such that, for some constant c > 0, the edges of Gn cannot be covered by n - c log n complete bipartite subgraphs of...

In this note we give a probabilistic proof of the existence of an n-vertex graph G_n, n = 1,2,..., such that, for some constant c > 0, the edges of G_n cannot be covered by n - c log n complete bipartite subgraphs of G_n. This result improves a previous bound due to F. R. K. Chung and is the best possible up to a constant.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Box-Cox metric for nearest neighbour classification improvement (vol 30, pg 273, 1997)

引用

PATTERN RECOGNITION 1997年第7期30卷 1251-1251页

作者： VanDerHeiden, R Groen, FCA TNO Phys. and Electronics Laboratory 2509 JG The Hague P.O. Box 96864 Netherlands Fac. of Math. and Computer Science University of Amsterdam Watergraafsmeer 1098 SJ Amsterdam Kruislaan 403 Netherlands

ReferencesReferences AbstractThe Nearest Neighbour rule is a distribution-free classification method. In the literature it has been shown, however, that the performance of the method improves if complex, often locally defined metrics are chosen. In this paper we demonstrate that in many real world discrimination problems comparable or even better classification results can be obtained with a simple global metric based on the Box-Cox transformation. In three case studies this is demonstrated: synthetic data, the IRIS data and real radar data. In the latter experiment, a large reduction in classification error of more than a fac.or four is achieved. Copyright 1997 Pattern Recognition Society.

关键词： Discrimination Nearest Neighbour method Box-Cox transformation Metric Radar Range profiles Target recognition

来源：评论

学校读者我要写书评

暂无评论

Combining region splitting and edge detection through guided Delaunay image subdivision

Combining region splitting and edge detection through guided...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： T. Gevers A.W.N. Smeulders Fac. of Math. & Comput. Sci. Amsterdam Univ. Netherlands Faculty of Mathematics & Computer Science University of Amsterdam Amsterdam Netherlands

In this paper, an adaptive split-and-merge segmentation method is proposed. The splitting phase of the algorithm employs the incremental Delaunay triangulation competent of forming grid edges of arbitrary orientation, and position. The tessellation grid, defined by the Delaunay triangulation, is adjusted to the semantics of the image data by combining similarity and difference information among pixels. Experimental results on synthetic images show that the method is robust to different object edge orientations, partially weak object edges and very noisy homogeneous regions. Experiments on a real image indicate that the method yields good segmentation results even when there is a quadratic sloping of intensities particularly suited for segmenting natural scenes of man-made objects.

关键词： Image edge detection Image segmentation Pixel Noise robustness math.matics computer science Layout Statistics Grid computing Design methodology

来源：评论

学校读者我要写书评

暂无评论

A model for simulation of nuclear physics processes

引用

International Journal of Modelling and Simulation 1997年第4期17卷 276-282页

作者： Hartati, S. Nickerson, B.G. DeMille, G.R. Department of Physics Fac. of Math. and Natural Sciences Gajah Mada University Yogyakarta Indonesia Faculty of Computer Science University of New Brunswick Fredericton NB E3B 5A3 P.O. Box 4400 Canada Department of Physics University of New Brunswick Canada Fac. of Math. and Natural Sciences Gajah Mada University Yogyakarta Indonesia University of New Brunswick Canada Rensselaer Polytechnic Institute United States

A formal knowledge representation system for nuclear physics processes, called nuclear process theory (NPT), is introduced. NPT allows modelling and simulation of nuclear physics processes. Knowledge of these processes is expressed in terms of a basic nuclear physics model and an aggregate effects model. The basic nuclear physics model is used to express knowledge of many nuclear physics processes, including fission, radioactive capture, beta positive decay, and beta negative decay. The products of these processes are expressed in either deterministic or probabilistic values. The aggregate effects model coordinates basic nuclear physics processes expressed in the basic nuclear physics model. NPT, along with the NPT simulator, can be used to reason about nuclear physics processes for approximately 3,000 different nuclides. The approach was tested using a homogeneous thermal fission reactor model. The results of modelling fission and other nuclear physics processes in a pressurized heavy water reactor fueled with a mixture of 12% U235 and 88% U236 are presented.

关键词： Knowledge representation Nondeterministic process modelling Nuclear physics reasoning Simulation and modelling

来源：评论

学校读者我要写书评

暂无评论

Monitoring the working process of a CNC-lathe with a microsystem

ITG-Fachbericht

引用

ITG-fac.bericht 1996年第138期 265-265页

作者： Sick, B. Bender, A. Fuchs, E. Lehrstuhl für Rechnerstrukturen Lehrst. Numerische Math. und Anal. Fac. for Math. and Computer Science University of Passau D-94032 Passau Innstr. 33 Germany

A new monitoring system based on microsystem technology for the cutting process of a CNC-lathe is introduced. The microsystem with integrated sensors for vibration, forces and temperature is placed onto the holding device of a cutting tool. Measuring undisturbed signals near the cutting process allows innovative signal interpretation methods to be used.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Metric Approach to Control Flow Semantics

引用

Annals of the New York Academy of sciences 1996年第1期806卷 11-27页

作者： De Bakker, J.W. De Vink, E.P. Department of Software Technology CWI NL-1090 GB Amsterdam P.O.Box 94079 Netherlands Fac. of Math. and Computer Science Vrije Universiteit NL-1081-HV Amsterdam De Boelelaan 1081a Netherlands

The authors' monograph "Control Flow Semantics" (MIT Press 1996) gives an extensive exposition of comparative programming language semantics using techniques from metric topology. In the book Banach's fixed-point theorem for complete metric spaces plays a prominent role in the construction and comparison of semantical models. Here we present the basic idea of exploiting Banach's theorem. The approach is illustrated with the definition of an operational and a denotational model for an abstract programming language with parallelism. Note: The work reported here is not novel, but intended to provide an introduction of the metric approach to programming language semantics for a nonspecialist audience.

关键词： Complete metric spaces Concurrency Operational and denotational semantics Transition systems

来源：评论

学校读者我要写书评

暂无评论

Benchmarking implementations of functional languages with 'Pseudoknot', a float-intensive benchmark

引用

Journal of Functional Programming 1996年第4期6卷 621-655页

作者： Hartel, Pieter H. Feeley, Marc Alt, Martin Augustsson, Lennart Baumann, Peter Beemster, Marcel Chailloux, Emmanuel Flood, Christine H. Grieskamp, Wolfgang Van Groningen, John H. G. Hammond, Kevin Hausman, Bogumil Ivory, Melody Y. Jones, Richard E. Kamperman, Jasper Lee, Peter Leroy, Xavier Lins, Rafael D. Loosemore, Sandra Röjemo, Niklas Serrano, Manuel Talpin, Jean-Pierre Thackray, Jon Thomas, Stephen Walters, Pum Weis, Pierre Wentworth, Peter Department of Computer Systems University of Amsterdam 1098 SJ Amsterdam Kruislaan 403 Netherlands Dept. d'Informatique et R.o. Université de Montréal Montréal Que. H3C 3J7 succursale centre-ville Canada Informatik Universität des Saarlandes 66041 Saarbrücken 11 Germany Department of Computer Systems Chalmers University of Technology 412 96 Göteborg Sweden Department of Computer Science University of Zurich 8057 Zurich Winterthurerstr. 190 Switzerland LIENS URA 1327 du CNRS Ecl. Normale Supérieure 75230 Paris Cédex 05 45 rue d'Ulm France Laboratory for Computer Science MIT Cambridge MA 02139 545 Technology Square United States Berlin University of Technology 10587 Berlin Franklinstr. 28-29 Germany Fac. of Math. and Computer Science Univ. of Nijmegen 6525 ED Nijmegen Toernooiveld 1 Netherlands Department of Computing Science Glasgow University Glasgow G12 8QQ 17 Ulybank Gardens United Kingdom Computer Science Lab. Box 1505 S-125 25 Älvsjö Sweden Computer Research Group Inst. for Sci. Computer Research Lawrence Livermore Natl. Laboratory Livermore CA 94550 P.O. Box 808 L-419 United States Department of Computer Science University of Kent at Canterbury Canterbury Kent CT2 7NF United Kingdom CWl 1098 SJ Amsterdam Kruislaan 413 Netherlands Department of Computer Science Carnegie Mellon University Pittsburgh PA 15213 5000 Forbes Avenue United States INRIA Rocquencourt Projet Cristal 78153 Le Chesnay B.P. 105 France Departamento de Informática Universidade Federal de Pernambuco Recife PE Brazil Department of Computer Science Yale University New Haven CT United States INRIA Rocquencourt Projet Icsla 78153 Le Chesnay B.P. 105 France Europ. Comp.-Indust. Research Centre D-81925 Munich Arabella Straße 17 Germany Harlequin Ltd. Barrington Hall Barrington Cambridge CB2 5RG United Kingdom Department of Computer Science University of Nottingham Nottingham NG7 2RD United Kingdom Department of Computer Science Rhodes University Grahamstown

Over 25 implementations of different functional languages are benchmarked using the same program, a floating-point intensive application taken from molecular biology. The principal aspects studied are compile time and execution time for the various implementations that were benchmarked. An important consideration is how the program can be modified and tuned to obtain maximal performance on each language implementation. With few exceptions, the compilers take a significant amount of time to compile this program, though most compilers were faster than the then current GNU C compiler (GCC version 2.5.8). Compilers that generate C or Lisp are often slower than those that generate native code directly: the cost of compiling the intermediate form is normally a large fraction of the total compilation time. There is no clear distinction between the runtime performance of eager and lazy implementations when appropriate annotations are used: lazy implementations have clearly come of age when it comes to implementing largely strict applications, such as the Pseudoknot program. The speed of C can be approached by some implementations, but to achieve this performance, special measures such as strictness annotations are required by non-strict implementations. The benchmark results have to be interpreted with care. Firstly, a benchmark based on a single program cannot cover a wide spectrum of 'typical' applications. Secondly, the compilers vary in the kind and level of optimisations offered, so the effort required to obtain an optimal version of the program is similarly varied.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A chess playing robot: lab course in robot sensor integration

A chess playing robot: lab course in robot sensor integratio...

引用

IEEE Instrumentation and Measurement Technology Conference

作者： F.C.A. Groen G.A. der Boer A. van Inge R. Stam Faculty of Mathematics and Computer Science University of Amsterdam Amsterdam Netherlands Fac. of Math. & Comput. Sci. Amsterdam Univ. Netherlands

To obtain practical experience in intelligent robotics, a laboratory course has been developed in which students have to create a chess-playing robot. The system has to detect the move of a human opponent and has to take appropriate action. Beside knowledge about the integration of sensing and control of the robot arm, the students gain experience in working in a team to realize a medium-size project. The SCIL-IMAGE package is used. It runs under UNIX and XWindows. SCIL is a multilevel environment originally developed in image processing for feasibility studies. IMAGE is an image processing package linked to SCIL. The lowest level is formed by a C-interpreter. Using this interpreter, complete C-programs can be developed. Interpreted code can be directly combined with precompiled code from incorporated libraries. If required these programs can also be compiled and linked to SCIL.< >

关键词： Robot sensing systems Programming environments Intelligent sensors Intelligent robots Packaging computer science Humans Robot control Robot programming Image processing

来源：评论

学校读者我要写书评

暂无评论

INTERSECTION OF BAER SUB-GEOMETRIES

引用

ARCHIV DER math.MATIK 1982年第3期39卷 285-288页

作者： BRUEN, AA Department of Mathematics Fac. of Science Engineering and Math. Sc. Building London Canada

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：