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

Annual IEEE Conference on Computational Complexity

作者： E. Dantsin T. Eiter G. Gottlob A. Voronkov Steklov Math. Inst. St. Petersburg Russia AG Informatik University of Giessen Giessen Germany Information Systems Department Technical University of of Vienna Vienna Austria Computing Science Department University of Uppsala Uppsala Sweden

This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results on plain logic programming (pure Horn clause programs), more recent results on various important extensions of logic programming are surveyed. These include logic programming with different forms of negation, disjunctive logic programming, logic programming with equality, and constraint logic programming. The complexity of the unification problem is also addressed.

关键词： Logic programming Knowledge representation Database languages Complexity theory math.matics computer languages Approximation algorithms computer science Application software Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Gamma-type results and other related properties of Poisson processes

引用

ADVANCES IN APPLIED PROBABILITY 1996年第2期28卷 340-340页

作者： Moller, J Zouev, S Aalborg University Inst. Natl. Rech. Info. en Automat. Dept. of Math. and Computer Science Aalborg University DK-9220 Aalborg F. Bajers Vej 7E Denmark Inst. Natl. Rech. Info. en Automat. 06902 Sophia-Antipolis Cedex 2004 route des Lucioles France

Families of Poisson processes defined on general state spaces and with the intensity measure scaled by a positive parameter are investigated. In particular, mean value relations with respect to the scale parameter are established and used to derive various Gamma-type results for certain geometric characteristics determined by finite subprocesses. In particular, we deduce Miles' complementary theorem. Applications of the results within stochastic geometry and particularly for random tessellations are discussed.

关键词： Complementary theorem Delaunay tessellation Gamma distribution Hyperplane tessellations Palm probabilities Poisson flat processes Poisson point processes Slivnyak's theorem Stochastic geometry Tessellation characteristics Voronoi tessellation

来源：评论

学校读者我要写书评

暂无评论

Efficient determination of shape from multiple images containing partial information

Efficient determination of shape from multiple images contai...

引用

13th International Conference on Pattern Recognition, ICPR 1996

作者： Basri, Ronen Grove, Adam Jacobs, David Department of Applied Math. Weizmann Inst. of Science Rehovot 76 100 Israel NEC Research Institute 4 Independence Way Princeton NJ 08540 United States

ISBN: (纸本)081867282X

We consider the problem of reconstructing the shape of an object from multiple images related by translations, when only small portions of the object can be observed in each image. Lindenbaum and Bruckstein (1988) have considered this problem in the specific case where the translating object is seen by small sensors, for application to the understanding of insect vision. Their solution is limited by the fact that its run time is exponential in the number of images and sensors. We show that the problem can be solved in time that is polynomial in the number of sensors, but is in fact NP complete when the number of images is unbounded. We therefore consider the special case of convex objects, which we can solve efficiently even when many images are used. © 1996 IEEE.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Theoretical study of the energy level structure of ions of the isoelectronic series of gallium

引用

Optics and Spectroscopy (English translation of Optika i Spektroskopiya) 1996年第4期81卷 483-483页

作者： Zilitis, V.A. Inst. of Math./Info. Science Latvian University Riga LV-1459 Latvia

The energies of the 42P- and 42D-levels are calculated for 50 ions of the isoelectronic series of gallium (from Ga to No71+) on the basis of the relativistic method of self-consistent field with the superposition of t...

The energies of the 4²P- and 4²D-levels are calculated for 50 ions of the isoelectronic series of gallium (from Ga to No⁷¹⁺) on the basis of the relativistic method of self-consistent field with the superposition of the 4s⁴p² configuration taken into account. The Dirac-Fock equations are resolved with the subsequent diagonalization of the energy matrix. As a result, 12 energy levels are obtained. Classification of these levels is complicated by the fact that a great number of level crossings are observed along the isoelectronic series of gallium. The results obtained are compared with the experiment and with the calculations of other authors as well as with the single-configurational calculation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Iterations of paracontractions and firmly nonexpansive operators with applications to feasibility and optimization

引用

Optimization 1996年第4期37卷 323-339页

作者： Censor, Y. Reich, S. Dept. of Math. and Computer Science University of Haifa Mt. Carmel 31905 Haifa Israel Department of Mathematics Technion-Israel Inst. of Technology 32000 Haifa Israel

A generalized "measure of distance" defined by Df(x, y): = f(x) - f(y) - 〈∇f(y), x - y〉, is generated from any member f of the class of Bregman functions. Although it is not, technically speaking, a distan... 详细信息

A generalized "measure of distance" defined by D_f(x, y): = f(x) - f(y) - 〈∇f(y), x - y〉, is generated from any member f of the class of Bregman functions. Although it is not, technically speaking, a distance function, it has been used in the past to define and study projection operators. In this paper we give new definitions of paracontractions, convex combinations, and firmly nonexpansive operators, based on D_f(x, y), and study sequential and simultaneous iterative algorithms employing them for the solution of the problem of finding a common asymptotic fixed point of a family of operators. Applications to the convex feasibility problem, to optimization and to monotone operator theory are also included.

关键词： Asymptotic fixed point Bregman function Firmly nonexpansive Generalized distance Paracontractions Projection Repetitive control

来源：评论

学校读者我要写书评

暂无评论

On nonlinear Riemann-Hilbert boundary value problems for second order elliptic systems in the plane

引用

Applicable Analysis 1996年第3-4期63卷 331-351页

作者： Akal, M. Begehr, H. Mathematics Department Faculty of Science South Valley University Qena Egypt I. Math. Inst. FU Berlin Berlin D-14195 Arnimallee 3 Germany

In this paper the well-Known Newton's method approach, whose origin is [18] and is based on a-priori estimates, is used to solve a nonlinear Riemann-Hilbert boundary value problem for second order complex elliptic partial differential equations in the plane (Formula presented.). An a-priori estimate is established for solutions to the related linear equations. © 1996, Taylor & Francis Group, LLC.

关键词： Newton method Nonlinear partial differential equations Riemann-Hilbert problem

来源：评论

学校读者我要写书评

暂无评论

Making a Low-dimensional Representation Suitable for Diverse Tasks

引用

Connection science 1996年第2期8卷 205-205页

作者： Intrator, N. Edelman, S. School of Mathematical Sciences Sackler Faculty of Exact Sciences Tel Aviv University Tel Aviv 69978 Israel Dept. of Appl. Math. and Comp. Sci. Weizmann Institute of Science Rehovot 76100 Israel Inst. for Brain and Neural Systems Box 1843 Brown University Providence RI 02912 United States

We introduce a new approach to the training of classifiers for performance on multiple tasks. The proposed hybrid training method leads to improved generalization via a better low-dimensional representation of the problem space. The quality of the representation is assessed by embedding it in a two-dimensional space using multi-dimensional scaling, allowing a direct visualization of the results. The performance of the approach is demonstrated on a highly non-linear image classification task.

关键词： Imposing bias on neural networks Multiple-task training Transfer in neural networks

来源：评论

学校读者我要写书评

暂无评论

Laser induced phase transformations in vanadium oxides

Laser induced phase transformations in vanadium oxides

引用

LEOS Summer Topical Meetings

作者： B.K. Kotlyarchuk D.I. Popovych V.K. Savchuk V.G. Savytskiy Inst. of Appl. Problems of Mech. & Math. Acad. of Sci. Lviv Ukraine Laboratory of Laser Technology in Material Science Institute for Applied Problems of Mechanics and Mathematics National Academy of Sciences of Ukraine Lviv Ukraine Institute of Applied Physics Lviv State University Lviv Ukraine

Summary form only given, as follows. The authors show that structural and phase transformation in the V/sub 2/O/sub 5/-VO/sub 2/ system is connected with processes stimulated by laser radiation in the volume of the crystal V/sub 2/O/sub 5/. In the structure of the vanadium pentoxide there are channels in the direction [001] and [010] with effective diameter of 2 Å. Along these channels oxygen diffusion to the crystal surface takes place stimulated by the laser radiation.

关键词： Switches Laser theory Power lasers Semiconductor lasers Conductivity Materials science and technology Absorption Crystals Optical pulses Temperature

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Control distributed parameter systems with orthogonal neural network learning

引用

Informatica 1996年第4期7卷 431-454页

作者： Garliauskas, Algis Gupta, Madan M. Inst. of Mathematics and Informatics 2600 Vilnius Akademijos 4 Lithuania University of Saskatchewan Saskatoon Sask. S7N 5A9 Canada Computer Center Dept. of the USSR Acad. of Sciences Novosibirsk Russian Federation Laboratory of Neuroinformatics Instit. Math. and Inform. Lithuania Birla Engineering College Pilani India University of Warwick United Kingdom Department of Engineering Ctr. Excellence on Neuro-Vis. Res. University of Saskatchewan Saskatoon Sask. Canada Intelligent Syst. Res. Laboratory Ctr. Excellence on Neuro-Vis. Res. University of Saskatchewan Saskatoon Sask. Canada

Adaptive Control Distributed Parameter Systems (ACDPS) with adaptive learning algorithms based on orthogonal neural network methodology are presented in this paper. We discuss a modification of orthogonal least squares learning to find appropriate efficient algorithms for solution of ACDPS problems. A two times problem linked with the real time of plant control dynamic processes and the learning time for adjustment of parameters in adaptive control of unknown distributed systems is discussed. The simulation results demonstrate that the orthogonal learning algorithms on a neural network concept allow to find perfectly tracked output control distributed parameters in ACDPS and have rather a good perspective in the development of generalised ACDSP theory and practice in the future.

关键词： Adaptive control Distributed parameter system Nonlinear control Orthogonal neural network learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：