共查询到20条相似文献,搜索用时 15 毫秒
1.
The main contribution of the present article consists of new 3D parallel and symmetric thinning schemes which have the following qualities: They are effective and sound, in the sense that they are guaranteed to preserve topology. This guarantee is obtained thanks to a theorem on critical kernels; They are powerful, in the sense that they remove more points, in one iteration, than any other symmetric parallel thinning scheme; They are versatile, as conditions for the preservation of geometrical features (e.g., curve extremities or surface borders) are independent of those accounting for topology preservation; They are efficient: we provide in this article a small set of masks, acting in the grid ?3, that is sufficient, in addition to the classical simple point test, to straightforwardly implement them. 相似文献
2.
Tom Conlon 《Artificial Intelligence Review》1992,6(3):285-324
If you are familiar with Prolog but not with Parlog then this tutorial is aimed at you. In what follows I attempt to: ? explain the basics of Parlog ? demonstrate that Parlog programs can be powerful and elegant ? discuss the relationship of Parlog to Prolog, and ? identify some resources which will take you further. These are what I call ‘four steps to Parlog’. 相似文献
3.
We settle all relativized questions of the relationships between the following five propositions:
- P = NP.
- P = UP.
- P = NP $\cap$ coNP.
- All disjoint pairs of NP sets are P-separable.
- All disjoint pairs of coNP sets are P-separable.
4.
Dr.-Ing. Rolf Reinema 《WIRTSCHAFTSINFORMATIK》2002,44(4):367-373
The RoomComputer is an embedded system and as such offers unprecedented chances to manage buildings. Several RoomComputers can be networked via the Intra-/Internet, which makes it possible to monitor, control, and manage rooms and buildings on a unified worldwide accessible platform, irrespective of any particular local technology. It can be easily installed in any building and gives access to a full set of services. It implements a distributed system, which provides secure and controlled access to services like
- control of light, heating, ventilation, air and climate
- communication facilities like unified messaging, telephone, fax, etc.
- reservation of rooms and required resources
- localization of persons and equipment within rooms and buildings
- entrance control (i.e. locking/unlocking doors)
- organization of maintenance and house keeping, and
- charging and billing.
5.
Valery M. Tsourikov 《AI & Society》1993,7(1):62-77
Inventive Machine project is the matter of discussion. The project aims to develop a family of AI systems for intelligent support of all stages of engineering design. Peculiarities of the IM project:
- deep and comprehensive knowledge base — the theory of inventive problem solving (TIPS)
- solving complex problems at the level of inventions
- application in any area of engineering
- structural prediction of engineering system development
6.
This paper presents a kernel language KLND on the basis of analysing the kernel languagerequirements of new generation computer systems. These requirements are: the ability ofknow-ledge processing, the parallelism, the elegant mathematical properties of the comput-ation model which is appropriate for working as the basis of the novel architecture design, andthe suitability for writing large scale softwares. The main features of KLND are as follows: 1. several new language concepts. 2. the modularity, 3. the unification of logical and functional programming styles, 4. the exploitation of the parallelism. 5. the introduction of the type concept, 6. the introduction of the storage concept. 相似文献
7.
María Victoria Cengarle Luis Mandel Martin Wirsing Heiner Brand Klaus Däßler Thekla Schneider 《Higher-Order and Symbolic Computation》1992,4(4):319-369
A DIN Kernel LISP Draft (DKLisp) has been developed by DIN as Reaction to Action D1 (N79), short term goal, of ISO WG16. It defines a subset language, as compatible as possible with the ANSICommon-Lisp draft, but also with theEuLisp draft. It combines the most important LISP main stream features in a single, compact, but nevertheless complete language definition, which thereby could be well suited as basis for a short term InternationalLisp Standard. Besides the functional and knowledge processing features, the expressive power of the language is well comparable with contemporary procedural languages, as e.g. C++ (of course without libraries). Important features ofDKLisp are: to be a “Lisp-1,” but allowing an easy “Lisp-2” transformation; to be a simple, powerful and standardized educationalLisp; to omit all features, which are unclean or in heavy discussion; DKLisp programs run nearly unchanged inCommon-Lisp; DKLisp contains a simple object and package system; DKLisp contains those data classes and control structures also common to most modernLisp and non-Lisp languages; DKLisp offers a simple stream I/O; DKLisp contains a clean unified hierarchical class/type system; DKLisp contains the typical “Lisp-features” in an orthogonal way; DKLisp allows and encourages really small but powerful implementations; DKLisp comes in levels, so allowing ANSICommon-Lisp to be an extension ofDKLisp level-1. The present is the second version of the proposal, namely version 1.2, with slight differences with respect to the one sent to ISO. Sources of such changes were the remarks generously sent by many readers of the previous attempt. 相似文献
8.
Foued Ameur Paul Fischer Klaus -U. Höffgen Friedhelm Meyer auf der Heide 《Acta Informatica》1996,33(5):621-630
A pac-learning algorithm isd-space bounded, if it stores at mostd examples from the sample at any time. We characterize thed-space learnable concept classes. For this purpose we introduce the compression parameter of a concept classb and design our Trial and Error Learning Algorithm. We show: b isd-space learnable if and only if the compression parameter ofb is at mostd. This learning algorithm does not produce a hypothesis consistent with the whole sample as previous approaches e.g. by Floyd, who presents consistent space bounded learning algorithms, but has to restrict herself to very special concept classes. On the other hand our algorithm needs large samples; the compression parameter appears as exponent in the sample size. We present several examples of polynomial time space bounded learnable concept classes: - all intersection closed concept classes with finite VC-dimension. - convexn-gons in ?2. - halfspaces in ?n. - unions of triangles in ?2. We further relate the compression parameter to the VC-dimension, and discuss variants of this parameter. 相似文献
9.
Scale-space behaviour of local extrema and blobs 总被引:4,自引:0,他引:4
Tony Lindeberg 《Journal of Mathematical Imaging and Vision》1992,1(1):65-99
10.
M. Pellegrini 《Algorithmica》1993,9(5):471-494
We present a uniform approach to problems involving lines in 3-space. This approach is based on mapping lines inR 3 into points and hyperplanes in five-dimensional projective space (Plücker space). We obtain new results on the following problems:
- Preprocessn triangles so as to answer efficiently the query: “Given a ray, which is the first triangle hit?” (Ray- shooting problem). We discuss the ray-shooting problem for both disjoint and nondisjoint triangles.
- Construct the intersection of two nonconvex polyhedra in an output sensitive way with asubquadratic overhead term.
- Construct the arrangement ofn intersecting triangles in 3-space in an output-sensitive way, with asubquadratic overhead term.
- Efficiently detect the first face hit by any ray in a set of axis-oriented polyhedra.
- Preprocessn lines (segments) so as to answer efficiently the query “Given two lines, is it possible to move one into the other without crossing any of the initial lines (segments)?” (Isotopy problem). If the movement is possible produce an explicit representation of it.
11.
12.
The application of glass in the microsystems technology becomes more and more important. Therefore, it is necessary to combine special microstrutturable glasses with various other materials (e.g. joining with silicon by anodic bonding, joining with metals by electroforming, joining with polymers by glueing, joining with various other glasses by brazing or diffusion welding). In order to increase the use of glass in the microsystems technology especially four fields of research are important: -development of special glasses with various properties -technologies of microstructuring -technologies of joining -application These four topics are main research fields performed at the Institute of Glass/Ceramics-Technology and will be described in this paper. 相似文献
13.
This paper presents an assumption/commitment specification technique and a refinement calculus for networks of agents communicating asynchronously via unbounded FIFO channels in the tradition of Kahn. We define two types of assumption/commitment specifications, namely simple and general specifications. It is shown that semantically, any deterministic agent can be uniquely characterized by a simple specification, and any nondeterministic agent can be uniquely characterized by a general specification. We define two sets of refinement rules, one for simple specifications and one for general specifications. The rules are Hoare-logic inspired. In particular the feedback rules employ invariants in the style of a traditional while-rule. Both sets of rules have been proved to be sound and also (semantic) relative complete. Conversion rules allow the two logics to be combined. This means that general specifications and the rules for general specifications have to be introduced only at the point in a system development where they are really needed. 相似文献
14.
The general specifications and design for a High-Speed General Information Management System, HSGIMS, to serve as the basis for a Global Information Network are given. Some of the key specifications that have been confirmed in experiments with a prototype of the HSGIMS are:
- Information (or data) and Question-type (or logical data) independence.
- Very small bounded search times that are independent of the amount of information that is managed and can be computed exactly.
- A fool-proof security system that can be used to protect databases against viruses and can also be easily invoked to deny unauthorized access by users.
- Efficient use of all storage and communications resources.
15.
There are many expert systems that use experimental knowledge for diagnostic analysis and design. However, there are two problems for systems using only experiential knowledge:
- unexpected problems cannot be solved and
- acquiring experiential knowledge from human experts is difficult.
- inheritance for representation of objects,
- new primitive representations to describe discontinuous change, and
- control features for effective reasoning.
16.
Stable semantics for disjunctive programs 总被引:1,自引:0,他引:1
Teodor C. Przymusinski 《New Generation Computing》1991,9(3-4):401-424
We introduce the stable model semantics fordisjunctive logic programs and deductive databases, which generalizes the stable model semantics, defined earlier for normal (i.e., non-disjunctive) programs. Depending on whether only total (2-valued) or all partial (3-valued) models are used we obtain thedisjunctive stable semantics or thepartial disjunctive stable semantics, respectively. The proposed semantics are shown to have the following properties: ? For normal programs, the disjunctive (respectively, partial disjunctive) stable semantics coincides with thestable (respectively,partial stable) semantics. ? For normal programs, the partial disjunctive stable semantics also coincides with thewell-founded semantics. ? For locally stratified disjunctive programs both (total and partial) disjunctive stable semantics coincide with theperfect model semantics. ? The partial disjunctive stable semantics can be generalized to the class ofall disjunctive logic programs. ? Both (total and partial) disjunctive stable semantics can be naturally extended to a broader class of disjunctive programs that permit the use ofclassical negation. ? After translation of the programP into a suitable autoepistemic theory \( \hat P \) the disjunctive (respectively, partial disjunctive) stable semantics ofP coincides with the autoepistemic (respectively, 3-valued autoepistemic) semantics of \( \hat P \) . 相似文献
17.
This article describes the actual applications of XML in the context of Business- Intelligence-Systems (BI). The potentials and synergies of XML and BI will be emphasized.
- XML applications can be found within all levels of BI-systems.
- The application of core-standards will be introduced as well as the possibilities of BI specific-standards.
- The discussion of the impact of XML for BI-systems follows along the dimensions: externalisation, integration, standardisation and rationalization.
18.
We study the problem of computing canonical forms for graphs and hypergraphs under Abelian group action and show tight complexity bounds. Our approach is algebraic. We transform the problem of computing canonical forms for graphs to the problem of computing canonical forms for associated algebraic structures, and we develop parallel algorithms for these associated problems.
- In our first result we show that the problem of computing canonical labelings for hypergraphs of color class size 2 is logspace Turing equivalent to solving a system of linear equations over the field $\mathbb {F} _{2}$ . This implies a deterministic NC 2 algorithm for the problem.
- Similarly, we show that the problem of canonical labeling graphs and hypergraphs under arbitrary Abelian permutation group action is fairly well characterized by the problem of computing the integer determinant. In particular, this yields deterministic NC 3 and randomized NC 2 algorithms for the problem.
19.
In this paper we give efficient parallel algorithms for a number of problems from computational geometry by using versions of parallel plane sweeping. We illustrate our approach with a number of applications, which include: General hidden-surface elimination (even if the overlap relation contains cycles). CSG boundary evaluation. Computing the contour of a collection of rectangles. Hidden-surface elimination for rectangles. There are interesting subproblems that we solve as a part of each parallelization. For example, we give an optimal parallel method for building a data structure for line-stabbing queries (which, incidentally, improves the sequential complexity of this problem). Our algorithms are for the CREW PRAM, unless otherwise noted. 相似文献
20.
We define a class ofn-ary relations on strings called the regular prefix relations, and give four alternative characterizations of this class:
- the relations recognized by a new type of automaton, the prefix automata,
- the relations recognized by tree automata specialized to relations on strings,
- the relations between strings definable in the second order theory ofk successors,
- the smallest class containing the regular sets and the prefix relation, and closed under the Boolean operations, Cartesian product, projection, explicit transformation, and concatenation with Cartesian products of regular sets.