Kernel language KLND

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.     

Separability and one-way functions

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.

We make the first widespread use of variations of generic oracles to achieve the necessary relativized worlds.     

Risoluzione di un sistema di equazioni non lineari con metodo numerico ai minimi quadrati

We introduce a numerical method for solving nonlinear algebraic equations related to linear least squares fitting with moving weights. The method considered introduces little overhead in the process. The approach is based on updating two matrices so that the product is an approximation of the inverse Jacobian. We may expect:

1. The tecnique performs good for stochastic systems
2. We never may yield an unbounded correction
3. We can use the algorithm for ill-conditioned, also completely singular problems.

Numerical results are given. It seems that experimental efficiency of the method compares well with mostly used iterative algorithms.     

Sweep methods for parallel computational geometry

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.     

Enhanced qualitative physical reasoning system: Qupras

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:

1. unexpected problems cannot be solved and
2. acquiring experiential knowledge from human experts is difficult.

To solve these problems, general principles or basic knowledge must be added to expert systems in addition to the experimental knowledge. In response, we previously proposed Qupras (Qualitative physical reasoning system) as a framework for basic knowledge. This system has two knowledge representations, one related to physical laws and the other to objects. By using this knowledge, Qupras reasons about the relations among physical objects, and predicts the next state of a physical phenomenon. Recently, we have improved some of Qupras’ features, and this pater desctibes the following main enhancements:

1. inheritance for representation of objects,
2. new primitive representations to describe discontinuous change, and
3. control features for effective reasoning.

     

Regular prefix relations

We define a class ofn-ary relations on strings called the regular prefix relations, and give four alternative characterizations of this class:

1. the relations recognized by a new type of automaton, the prefix automata,
2. the relations recognized by tree automata specialized to relations on strings,
3. the relations between strings definable in the second order theory ofk successors,
4. 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.

We give concrete examples of regular prefix relations, and a pumping argument for prefix automata. An application of these results to the study of inductive inference of regular sets is described.     

Experiences with software specification and verification using LP,the Larch proof assistant

We sketch a method for deduction-oriented software and system development. The method incorporates formal machine-supported specification and verification as activities in software and systems development. We describe experiences in applying this method. These experiences have been gained by using the LP, the Larch proof assistant, as a tool for a number of small and medium size case studies for the formal development of software and systems. LP is used for the verification of the development steps. These case studies include

? quicksort

? the majority vote problem

? code generation by a compiler and its correctness

? an interactive queue and its refinement into a network.

The developments range over levels of requirement specifications, designs and abstract implementations. The main issues are questions of a development method and how to make good use of a formal tool like LP in a goal-directed way within the development. We further discuss the value of advanced specification techniques, most of which are deliberately not supported by LP and its notation, and their significance in development, Furthermore, we discuss issues of enhancement of a support system like LP and the value and the practicability of using formal techniques such as specification and verification in the development process in practice.     

A globally convergent algorithm based on imbedding and parametric optimization

The continuation method, well-established for the solution of nonlinear equations is extended to restricted optimization problems. Only the locally active restrictions are considered along the homotopy path. It is assumed that there are only finitely many critical points, i. e. that there are only finitely many changes of the index set of active restrictions. The globally convergent algorithm which we present proceeds in three stages:

1. Within each stability region, the solution is computed by the classical continuation method.
2. On the boundary of a stability region, a critical point \(\bar t\) is determined.
3. A new active index set is determined when \(\bar t\) is passed.

For the class of convex problems, the hypotheses for the convergence of the algorithm may be secured. The algorithm is applied to several examples.     

RaumComputer

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

1. control of light, heating, ventilation, air and climate
2. communication facilities like unified messaging, telephone, fax, etc.
3. reservation of rooms and required resources
4. localization of persons and equipment within rooms and buildings
5. entrance control (i.e. locking/unlocking doors)
6. organization of maintenance and house keeping, and
7. charging and billing.

     

An approach to the DIN Kernel Lisp definition

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.     

Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm

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.

     

Software system for automatic interpretation of ionosphere sounding data

The present paper is concerned with methods and algorithms of the software system for the automatic interpretation of radio physics information, as acquired by an FMCW ionosonde (at the Institute of Solar-Terrestrial Physics, Siberian Branch, Russian Academy of Sciences), which provides for vertical sounding (VS) and oblique sounding (OS) of the ionosphere. The following problems were considered within this problem:

1. preprocessing to suppress noise from images and improve amplitude characteristics
2. data compression using a cellular automaton
3. interpretation of VS and OS ionograms.

The method of interpreting ionograms is based on using simulation data for the frequency dependences of the long-term prediction propagation characteristics and the results of processing experimental data.     

Ray shooting on triangles in 3-space

We present a uniform approach to problems involving lines in 3-space. This approach is based on mapping lines inR ³ into points and hyperplanes in five-dimensional projective space (Plücker space). We obtain new results on the following problems:

1. 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.
2. Construct the intersection of two nonconvex polyhedra in an output sensitive way with asubquadratic overhead term.
3. Construct the arrangement ofn intersecting triangles in 3-space in an output-sensitive way, with asubquadratic overhead term.
4. Efficiently detect the first face hit by any ray in a set of axis-oriented polyhedra.
5. 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.

     

Contrary to time conditionals in Talmudic logic

We consider conditionals of the form A ? B where A depends on the future and B on the present and past. We examine models for such conditional arising in Talmudic legal cases. We call such conditionals contrary to time conditionals. Three main aspects will be investigated:

1. Inverse causality from future to past, where a future condition can influence a legal event in the past (this is a man made causality).
2. Comparison with similar features in modern law.
3. New types of temporal logics arising from modelling the Talmudic examples.

We shall see that we need a new temporal logic,which we call Talmudic temporal logic with linear open advancing future and parallel changing past, based on two parameters for time.     

Inventive machine: Second generation

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:

1. deep and comprehensive knowledge base — the theory of inventive problem solving (TIPS)
2. solving complex problems at the level of inventions
3. application in any area of engineering
4. structural prediction of engineering system development

The systems of the second generation are described in detail     

Thinking in parallel: four steps to Parlog

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’.     

Powerful Parallel and Symmetric 3D Thinning Schemes Based on Critical Kernels

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 ?³, that is sufficient, in addition to the classical simple point test, to straightforwardly implement them.

     

Zur semantischen Interoperabilität in der Energiebranche: CIM IEC 61970

This contribution provides an introduction to the Common Information Model CIM which is an international standard maintained by the International Electrotechnical Commission IEC. Today’s market requirements towards the model are discussed, furthermore, we give an introduction to the history of the CIM, its serializations and scope of application. The contribution concludes with an overview of future use of the CIM for both science and commerce. Briefly, we focus on:

Message-based loose coupling of information systems

Exchange of power grid topologies with minimal communication and data overhead

Data quality assurance using ontology-based meta annotations and

Integration of heterogeneous standards in the utility domain. The contribution presents solutions to the use cases providing a better information management for the utility utilizing the Common Information Model.