3,155 research outputs found

    Distributed Formal Concept Analysis Algorithms Based on an Iterative MapReduce Framework

    Get PDF
    While many existing formal concept analysis algorithms are efficient, they are typically unsuitable for distributed implementation. Taking the MapReduce (MR) framework as our inspiration we introduce a distributed approach for performing formal concept mining. Our method has its novelty in that we use a light-weight MapReduce runtime called Twister which is better suited to iterative algorithms than recent distributed approaches. First, we describe the theoretical foundations underpinning our distributed formal concept analysis approach. Second, we provide a representative exemplar of how a classic centralized algorithm can be implemented in a distributed fashion using our methodology: we modify Ganter's classic algorithm by introducing a family of MR* algorithms, namely MRGanter and MRGanter+ where the prefix denotes the algorithm's lineage. To evaluate the factors that impact distributed algorithm performance, we compare our MR* algorithms with the state-of-the-art. Experiments conducted on real datasets demonstrate that MRGanter+ is efficient, scalable and an appealing algorithm for distributed problems.Comment: 17 pages, ICFCA 201, Formal Concept Analysis 201

    An Incremental Learning Method to Support the Annotation of Workflows with Data-to-Data Relations

    Get PDF
    Workflow formalisations are often focused on the representation of a process with the primary objective to support execution. However, there are scenarios where what needs to be represented is the effect of the process on the data artefacts involved, for example when reasoning over the corresponding data policies. This can be achieved by annotating the workflow with the semantic relations that occur between these data artefacts. However, manually producing such annotations is difficult and time consuming. In this paper we introduce a method based on recommendations to support users in this task. Our approach is centred on an incremental rule association mining technique that allows to compensate the cold start problem due to the lack of a training set of annotated workflows. We discuss the implementation of a tool relying on this approach and how its application on an existing repository of workflows effectively enable the generation of such annotations

    Effect of heuristics on serendipity in path-based storytelling with linked data

    Get PDF
    Path-based storytelling with Linked Data on the Web provides users the ability to discover concepts in an entertaining and educational way. Given a query context, many state-of-the-art pathfinding approaches aim at telling a story that coincides with the user's expectations by investigating paths over Linked Data on the Web. By taking into account serendipity in storytelling, we aim at improving and tailoring existing approaches towards better fitting user expectations so that users are able to discover interesting knowledge without feeling unsure or even lost in the story facts. To this end, we propose to optimize the link estimation between - and the selection of facts in a story by increasing the consistency and relevancy of links between facts through additional domain delineation and refinement steps. In order to address multiple aspects of serendipity, we propose and investigate combinations of weights and heuristics in paths forming the essential building blocks for each story. Our experimental findings with stories based on DBpedia indicate the improvements when applying the optimized algorithm

    Influence of topography on tide propagation and amplification in semi-enclosed basins

    Get PDF
    An idealized model for tide propagation and amplification in semi-enclosed rectangular basins is presented, accounting for depth differences by a combination of longitudinal and lateral topographic steps. The basin geometry is formed by several adjacent compartments of identical width, each having either a uniform depth or two depths separated by a transverse topographic step. The problem is forced by an incoming Kelvin wave at the open end, while allowing waves to radiate outward. The solution in each compartment is written as the superposition of (semi)-analytical wave solutions in an infinite channel, individually satisfying the depth-averaged linear shallow water equations on the f plane, including bottom friction. A collocation technique is employed to satisfy continuity of elevation and flux across the longitudinal topographic steps between the compartments. The model results show that the tidal wave in shallow parts displays slower propagation, enhanced dissipation and amplified amplitudes. This reveals a resonance mechanism, occurring when\ud the length of the shallow end is roughly an odd multiple of the quarter Kelvin wavelength. Alternatively, for sufficiently wide basins, also PoincarĂ© waves may become resonant. A transverse step implies different wavelengths of the incoming and reflected Kelvin wave, leading to increased amplitudes in shallow regions and a shift of amphidromic points in the direction of the deeper part. Including the shallow parts near the basin’s closed end (thus capturing the Kelvin resonance mechanism) is essential to reproduce semi-diurnal and diurnal\ud tide observations in the Gulf of California, the Adriatic Sea and the Persian Gulf

    The Effect of the Environment on alpha-Al_2O_3 (0001) Surface Structures

    Full text link
    We report that calculating the Gibbs free energy of the alpha-Al_2O_3 (0001) surfaces in equilibrium with a realistic environment containing both oxygen and hydrogen species is essential for obtaining theoretical predictions consistent with experimental observations. Using density-functional theory we find that even under conditions of high oxygen partial pressure, the metal terminated surface is surprisingly stable. An oxygen terminated alpha-Al_2O_3 (0001) surface becomes stable only if hydrogen is present on the surface. In addition, including hydrogen on the surface resolves discrepancies between previous theoretical work and experimental results with respect to the magnitude and direction of surface relaxations.Comment: 4 pages including 2 figures. Submitted to Phys. Rev. Lett. Related publications can be found at http://www.fhi-berlin.mpg.de/th/paper.htm

    Dating of the oldest continental sediments from the Himalayan foreland basin

    Get PDF
    A detailed knowledge of Himalayan development is important for our wider understanding of several global processes, ranging from models of plateau uplift to changes in oceanic chemistry and climate(1-4). Continental sediments 55 Myr old found in a foreland basin in Pakistan(5) are, by more than 20 Myr, the oldest deposits thought to have been eroded from the Himalayan metamorphic mountain belt. This constraint on when erosion began has influenced models of the timing and diachrony of the India-Eurasia collision(6-8), timing and mechanisms of exhumation(9,10) and uplift(11), as well as our general understanding of foreland basin dynamics(12). But the depositional age of these basin sediments was based on biostratigraphy from four intercalated marl units(5). Here we present dates of 257 detrital grains of white mica from this succession, using the Ar-40-(39) Ar method, and find that the largest concentration of ages are at 36-40 Myr. These dates are incompatible with the biostratigraphy unless the mineral ages have been reset, a possibility that we reject on the basis of a number of lines of evidence. A more detailed mapping of this formation suggests that the marl units are structurally intercalated with the continental sediments and accordingly that biostratigraphy cannot be used to date the clastic succession. The oldest continental foreland basin sediments containing metamorphic detritus eroded from the Himalaya orogeny therefore seem to be at least 15-20 Myr younger than previously believed, and models based on the older age must be re-evaluated
    • 

    corecore