6 research outputs found

    Visualisation of Semantic Networks and Ontologies using

    No full text
    Abstract. This paper presents a visualisation of the ASN and ontologies using AutoCAD. The geometric coordinates of nodes are based on the semantic distances. The whole semantic network or some selected parts are visualised on the screen, similar to a cartographic “map”. Per mouse click on some node, an application may be opened, which allows reading and modifying the attributes of the corresponding objects

    Concurrency Control and Locking in Knowledge Base for Rapid Product Development

    No full text
    Abstract. Rapid Product Development (RPD) is a product-development technique that includes experts collaborating in a multi-disciplinary environment. Products consist of components. A component can be used in various products. These can be represented by a network structure (semantic network) consisting of vertices (objects) and edges (relations). Modifying a vertex can change other vertices within the network. In the Active Semantic Network (ASN) these modifications are propagated automatically. The RPD-Information is stored in the ASN knowledge base. Changes of referenced objects should be automatically taken into account within the ASN-database. Reciprocally, changes of an object attribute should lead to modifications in the referenced files. For the synchronization, object-lock mechanisms and accesscontrol to the knowledge base are necessary. The concept presented here allows locking objects and also individual attributes. Object status and attributes allow regulating the access and the necessary steps for consistency re-establishment after system crash. 1

    The genesis and early developments of Aitken\u2019s process, Shanks\u2019 transformation, the \u3b5\u2013algorithm, and related fixed point methods

    No full text
    In this paper, we trace back the genesis of Aitken\u2019s \u3942 process and Shanks\u2019 sequence transformation. These methods, which are extrapolation methods, are used for accelerating the convergence of sequences of scalars, vectors, matrices, and tensors. They had, and still have, many important applications in numerical analysis and in applied mathematics. They are related to continued fractions and Pad\ue9 approximants. We go back to the roots of these methods and analyze the original contributions. New and detailed explanations on the building and properties of Shanks\u2019 transformation and its kernel are provided. We then review their historical algebraic and algorithmic developments. We also analyze how they were involved in the solution of systems of linear and nonlinear equations, in particular in the methods of Steffensen, Pulay, and Anderson. Testimonies by various actors of the domain are given. The paper can also serve as an introduction to this domain of numerical analysis

    The genesis and early developments of Aitken’s process, Shanks’ transformation, the ε–algorithm, and related fixed point methods

    No full text
    corecore