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.     

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.

     

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.     

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.

     

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.     

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.

     

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

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.     

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

Truth maintenance systems and their application for verifying Expert System Knowledge Bases

Truth maintenance systems (TMSs) were introduced more than ten years ago, but recently there is an explosion of interest in them and their possible applications in different areas. In this paper we discuss truth maintenance from three perspectives:

· Truth maintenance as a data base management facility, which was in fact the original intention of the TMS.

· Truth maintenance as an inference facility, which provides a way to extend the role of the TMS in solving problems.

· Truth maintenance as a verification facility, which illustrates a new and promising application of TMSs in the area of expert systems design.

This paper is not intended to provide a complete survey on TMSs, rather it aims to present the basic ideas and functionality of TMS, and to show how different kinds of TMS can be used as a meta-environment for testing Expert System Knowledge Bases, represented as sets of production rules, for anomalies. The paper is addressed to two groups of readers: those who are looking for an introductory survey on TMSs, and those who are interested in non-conventional techniques for Expert System Knowledge Base verification.     

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.

     

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.

     

An introduction to CFEtools

Many engineering analysis problems that have the greatest value to customers fall outside the scope of existing off-the-shelf analysis tools. Typical reasons for existing tools not solving an engineering problem include:

• •not being able to model the problems in physics;
• •a coupled multidisciplinary problem;
• •assembly level physics;
• •a need to control the solution strategy;
• •a need to integrate disparate existing applications.

Enter CFEtools. CFEtools is a tool for the development of CAE applications and the enhancement of existing CAE applications. CFEtools enables the development of CAE capabilities two orders of magnitude faster than would be possible with traditional tools. For the first time, CFEtools makes custom tailored analysis solutions economically feasible. Implemented as a C++ object oriented library, CFEtools offers all the advantages of high level, plug and play models with the flexibility of a modern programming language.     

Entwicklungstendenzen im Bereich der Fahrzeugelektronik

Applications in the automobile sector, wired or unwired, are today often integrated into a network of sensors and actors as well as in service functions, visualization, and entertainment. The paper presents an innovative platform, which is applicable for automotive and automation applications. & IT systems for automobiles and for business applications took a very different development direction.

? In the automotive sector a lot of proprietary IT systems have been developed.

? The increasing requirements of automotive applications require platform concepts, which are based on open standards.

     

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.     

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.