1,252 research outputs found

    Assessing the efficiency of first-principles basin-hopping sampling

    Full text link
    We present a systematic performance analysis of first-principles basin-hopping (BH) runs, with the target to identify all low-energy isomers of small Si and Cu clusters described within density-functional theory. As representative and widely employed move classes we focus on single-particle and collective moves, in which one or all atoms in the cluster at once are displaced in a random direction by some prescribed move distance, respectively. The analysis provides detailed insights into the bottlenecks and governing factors for the sampling efficiency, as well as simple rules-of-thumb for near-optimum move settings, that are intriguingly independent of the distinctly different chemistry of Si and Cu. At corresponding settings, the observed performance of the BH algorithm employing two simple, general-purpose move classes is already very good, and for the small systems studied essentially limited by frequent revisits to a few dominant isomers.Comment: 11 pages including 8 figures; related publications can be found at http://www.fhi-berlin.mpg.de/th/th.htm

    Hiding Private Locations by Anonymizing Data

    Get PDF
    Researchers explore ways of masking private locations in the interest of making useful data publicly available

    Representation of Nelson Algebras by Rough Sets Determined by Quasiorders

    Full text link
    In this paper, we show that every quasiorder RR induces a Nelson algebra RS\mathbb{RS} such that the underlying rough set lattice RSRS is algebraic. We note that RS\mathbb{RS} is a three-valued {\L}ukasiewicz algebra if and only if RR is an equivalence. Our main result says that if A\mathbb{A} is a Nelson algebra defined on an algebraic lattice, then there exists a set UU and a quasiorder RR on UU such that ARS\mathbb{A} \cong \mathbb{RS}.Comment: 16 page

    Efficient approximation of correlated sums on data streams

    Full text link

    Efficient computation of min and max sensor values in multihop networks

    Get PDF
    Consider a wireless sensor network (WSN) where a broadcast from a sensor node does not reach all sensor nodes in the network; such networks are often called multihop networks. Sensor nodes take sensor readings but individual sensor readings are not very important. It is important however to compute aggregated quantities of these sensor readings. The minimum and maximum of all sensor readings at an instant are often interesting because they indicate abnormal behavior, for example if the maximum temperature is very high then it may be that a fire has broken out. We propose an algorithm for computing the min or max of sensor readings in a multihop network. This algorithm has the particularly interesting property of having a time complexity that does not depend on the number of sensor nodes; only the network diameter and the range of the value domain of sensor readings matter

    RADBIOMOD: A simple program for utilising biological modelling in radiotherapy plan evaluation

    Get PDF
    Abstract not availableJoe H. Chang, Christopher Gehrke, Ramachandran Prabhakar, Suki Gill, Morikatsu Wada, Daryl Lim Joon, Vincent Kho
    corecore