Incremental Computation of Concept Diagrams
نویسنده
چکیده
Suppose a formal context K = (G,M, I) is given, whose concept lattice B(K) with an attribute-additive concept diagram is already known, and an attribute column C = (G, {n} , J) shall be inserted to or removed from it. This document introduces and proves an incremental update algorithm for both tasks.
منابع مشابه
Deletion in abstract Voronoi diagrams in expected linear time
Updating an abstract Voronoi diagram in linear time, after deletion of one site, has been an open problem for a long time. Similarly for various concrete Voronoi diagrams of generalized sites, other than points. In this paper we present a simple, expected linear-time algorithm to update an abstract Voronoi diagram after deletion. We introduce the concept of a Voronoi-like diagram, a relaxed ver...
متن کاملFeature-based Development of State Transition Diagrams with Property Preservation
In this paper, we consider incremental development of state transition diagrams by adding features, which add new states and transitions. The goal is to capture when properties of a state transition diagram are preserved when adding a feature. We classify several typical cases of such state transition diagram extensions and show when commonly used properties are preserved. In some cases, we add...
متن کاملTopology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments
We introduce an algorithm for computing Voronoi diagrams of points, straight-line segments and circular arcs in the two-dimensional Euclidean plane. Based on a randomized incremental insertion, we achieve a Voronoi algorithm that runs in expected time O(n log n) for a total of n points, segments and arcs, if at most a constant number of segments and arcs is incident upon every point. Our theore...
متن کاملRemoving an Incidence from a Formal Context
We analyze changes in the structure of a concept lattice corresponding to a context resulting from a given context with a known concept lattice by removing exactly one incidence. We identify the set of concepts affected by the removal and show how they can be used for computing concepts in the new concept lattice. We present algorithms for incremental computation of the new concept lattice, wit...
متن کاملSeismic Design of Steel Structures Based on Ductility and Incremental Nonlinear Dynamic Analysis
In this paper a simple tool for seismic design of steel structures for a selected ductility level is presented. For this purpose, a consistent set of earthquakes is selected and sorted based on the maximum acceleration of ground surface. The selected records are applied as the base motion to a single-degree-of-freedom system with strain hardening and the maximum response acceleration is determi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014