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     

Integrated systems I: Design principles

The following design principles are being used in an ongoing project to realize an integrated family of rule based systems that can be easily used separately or together in different combinations to solve problems common to many different disciplines. Some essential features of this family are:

1. Individual members can be used in the normal way as user-friendly rule based systems or they can be transparently invoked by other user-friendly rule based systems without interrogating users.
2. The knowledge (or rule) bases of key members do not mimic the perceived mode of human thought; therefore, they can predict events that cannot be predicted by the state-of-the-art alone.
3. The Law of Conservation of Mass/Energy is used to detect and correct computational errors.

     

Sensor data fusion

This paper reviews some knowledge representation approaches devoted to the sensor fusion problem, as encountered whenever images, signals, text must be combined to provide the input to a controller or to an inference procedure. The basic steps involved in the derivation of the knowledge representation scheme, are:

1. locate a representation, based on exogeneous context information
2. compare two representations to find out if they refer to the same object/entity
3. merge sensor-based features from the various representations of the same object into a new set of features or attributes,
4. aggregate the representations into a joint fused representation, usually more abstract than each of the sensor-related representations.

The importance of sensor fusion stems first from the fact that it is generally correct to assume that improvements in control law simplicity and robustness, as well as better classification results, can be achieved by combining diverse information sources. The second element, is that, e.g., spatially distributed sensing, or otherwise diverse sensing, does indeed require fusion as well.     

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.     

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.     

An algorithm for solving sparse Nonlinear Least Squares problems

We introduce a new method for solving Nonlinear Least Squares problems when the Jacobian matrix of the system is large and sparse. The main features of the new method are the following:

1. The Gauss-Newton equation is “partially” solved at each iteration using a preconditioned Conjugate Gradient algorithm.
2. The new point is obtained using a two-dimensional trust region scheme, similar to the one introduced by Bulteau and Vial.

We prove global and local convergence results and we present some numerical experiments.     

Einsatzpotenziale von XML in Business-Intelligence-Systemen

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.

1. XML applications can be found within all levels of BI-systems.
2. The application of core-standards will be introduced as well as the possibilities of BI specific-standards.
3. The discussion of the impact of XML for BI-systems follows along the dimensions: externalisation, integration, standardisation and rationalization.

     

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.     

High-speed tools for Global Information Management I. Information processing and retrieval

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:

1. Information (or data) and Question-type (or logical data) independence.
2. Very small bounded search times that are independent of the amount of information that is managed and can be computed exactly.
3. 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.
4. Efficient use of all storage and communications resources.

     

On the Mathematical Model of Computing Machine

In this paper,we try to introduce a constructive definition of a computing machine,called ageneral Mathematical Model of Computing Machine(MMCM).As a general MMCM it shouldinclude all known MMCM as well as all unknown MMCM.We always follow twoprinciples:(1)This general MMCM can be implemented by physical machine.(2)There is no other restriction on this general MMCM,except 1.Our conclusion is that the general MMCM is a finitely constructive and deterministicmathematical system.     

Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems

Given a rewriting system G (its alphabet, the set of productions and the axiom) one can define the language of G by

1. taking out of all strings generated by G only those which are over a distinguished subalphabet of G, or
2. translating the set of all strings generated by G by a fixed homomorphism.

The “trade-offs” between these two mechanisms for defining languages are discussed for both “parallel” rewriting systems from the developmental systems hierarchy and “sequential” rewriting systems from the Chomsky hierarchy.     

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.

     

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.     

Konsultative Assistenzsysteme für e-Government

Consultative Assistance Systems (CASS) enhance today’s transaction-oriented applications by case-driven, rule-based and interactive components geared towards individual needs of the end-user.

1. CASS supports in the resolution process with rare cases, which are typically complex in nature.
2. CASS guides the end-user in finding a solution that covers all legal and economical aspects of each case.
3. The example described in this article represents a CASS which supports the complex process of public procurement under the tendering by-laws. The application architecture used in this example can be transferred to many eGovernment scenarios.

     

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.

     

eXtensible Business Reporting Language (XBRL)

The eXtensible Business Reporting Language, or XBRL, is a royalty-free language based on XML that provides for a standardization of method and content in the exchange of business information. XBRL aims to reduce inefficiencies in data exchange and analysis, coupled with an improved comparability of information. The first taxonomies based on XBRL have:

1. identified opportunities for significant improvement in the efficiency of data exchange and automated analysis.
2. shown that comparisons between and the compatibility of information within business reports have not improved due to XBRL.

     

Designer®—Intelligent expert system for intelligent manufacturing systems design

This survey on expert systems activities and trends in Yugoslavia offers some results already obtained in the domain of manufacturing science and technology. In the scope of a long-term research project “Intelligent Manufacturing Systems (IMS)—Theory and Application” a Designer® Intelligent Expert System for mafacturing engineering has been proposed and partially developed. Designer® IES is based on new developed knowledge automata theory enhanced with cellular automata concept. Induction learning by analogy and Quasimorphism knowledge mapping from real world to model world is used to generate a reasoning structure. The Intelligent Expert System is divided into three main subsystems, with a very large knowledge base:

• •Product designer
• •Process Designer, and
• •Production Planning and Control Designer.

All these segments were developed in pilot versions of expert systems for specific groups of activities inside each of these three domains.     

On Bounded Rational Trace Languages

In this paper, for a finitely generated monoid M, we tackle the following three questions:

1. Is it possible to give a characterization of rational subsets of M which have polynomial growth?
2. What is the structure of the counting function of rational sets which have polynomial growth?
3. Is it true that every rational subset of M has either exponential growth or it has polynomial growth? Can one decide for a given rational set which of the two options holds?

We give a positive answer to all the previous questions in the case that M is a direct product of free monoids. Some of the proved results also extend to trace monoid.