3,063 research outputs found

    A Hierarchical Bayesian Trust Model based on Reputation and Group Behaviour

    No full text
    In many systems, agents must rely on their peers to achieve their goals. However, when trusted to perform an action, an agent may betray that trust by not behaving as required. Agents must therefore estimate the behaviour of their peers, so that they may identify reliable interaction partners. To this end, we present a Bayesian trust model (HABIT) for assessing trust based on direct experience and (potentially unreliable) reputation. Although existing approaches claim to achieve this, most rely on heuristics with little theoretical foundation. In contrast, HABIT is based on principled statistical techniques; can be used with any representation of behaviour; and can assess trust based on observed similarities between groups of agents. In this paper, we describe the theoretical aspects of the model and present experimental results in which HABIT was shown to be up to twice as accurate at predicting trustee performance as an existing state-of-the-art trust model

    Puromycin Sensitivity of Ribosomal Label after Incorporation of 14C-Labelled Amino Acids into Isolated Mitochondria from Neurospora crassa

    Get PDF
    Radioactive amino acids were incorporated into isolated mitochondria from Neurospora crassa. Then the mitochondrial ribosomes were isolated and submitted to density gradient centrifugation. A preferential labelling of polysomes was observed. However, when the mitochondrial suspension was treated with puromycin after amino acid incorporation, no radioactivity could be detected in either the monosomes or the polysomes. The conclusion is drawn that isolated mitochondria under these conditions do not incorporate significant amounts of amino acids into proteins of their ribosomes

    The ART of IAM: The Winning Strategy for the 2006 Competition

    No full text
    In many dynamic open systems, agents have to interact with one another to achieve their goals. Here, agents may be self-interested, and when trusted to perform an action for others, may betray that trust by not performing the actions as required. In addition, due to the size of such systems, agents will often interact with other agents with which they have little or no past experience. This situation has led to the development of a number of trust and reputation models, which aim to facilitate an agent's decision making in the face of uncertainty regarding the behaviour of its peers. However, these multifarious models employ a variety of different representations of trust between agents, and measure performance in many different ways. This has made it hard to adequately evaluate the relative properties of different models, raising the need for a common platform on which to compare competing mechanisms. To this end, the ART Testbed Competition has been proposed, in which agents using different trust models compete against each other to provide services in an open marketplace. In this paper, we present the winning strategy for this competition in 2006, provide an analysis of the factors that led to this success, and discuss lessons learnt from the competition about issues of trust in multiagent systems in general. Our strategy, IAM, is Intelligent (using statistical models for opponent modelling), Abstemious (spending its money parsimoniously based on its trust model) and Moral (providing fair and honest feedback to those that request it)

    The ART of IAM: The Winning Strategy for the 2006 Competition

    No full text
    In many dynamic open systems, agents have to interact with one another to achieve their goals. Here, agents may be self-interested, and when trusted to perform an action for others, may betray that trust by not performing the actions as required. In addition, due to the size of such systems, agents will often interact with other agents with which they have little or no past experience. This situation has led to the development of a number of trust and reputation models, which aim to facilitate an agent's decision making in the face of uncertainty regarding the behaviour of its peers. However, these multifarious models employ a variety of different representations of trust between agents, and measure performance in many different ways. This has made it hard to adequately evaluate the relative properties of different models, raising the need for a common platform on which to compare competing mechanisms. To this end, the ART Testbed Competition has been proposed, in which agents using different trust models compete against each other to provide services in an open marketplace. In this paper, we present the winning strategy for this competition in 2006, provide an analysis of the factors that led to this success, and discuss lessons learnt from the competition about issues of trust in multiagent systems in general. Our strategy, IAM, is Intelligent (using statistical models for opponent modelling), Abstemious (spending its money parsimoniously based on its trust model) and Moral (providing fair and honest feedback to those that request it)

    Partial survival and inelastic collapse for a randomly accelerated particle

    Full text link
    We present an exact derivation of the survival probability of a randomly accelerated particle subject to partial absorption at the origin. We determine the persistence exponent and the amplitude associated to the decay of the survival probability at large times. For the problem of inelastic reflection at the origin, with coefficient of restitution rr, we give a new derivation of the condition for inelastic collapse, r<rc=eπ/3r<r_c=e^{-\pi/\sqrt{3}}, and determine the persistence exponent exactly.Comment: 6 page

    A record-driven growth process

    Full text link
    We introduce a novel stochastic growth process, the record-driven growth process, which originates from the analysis of a class of growing networks in a universal limiting regime. Nodes are added one by one to a network, each node possessing a quality. The new incoming node connects to the preexisting node with best quality, that is, with record value for the quality. The emergent structure is that of a growing network, where groups are formed around record nodes (nodes endowed with the best intrinsic qualities). Special emphasis is put on the statistics of leaders (nodes whose degrees are the largest). The asymptotic probability for a node to be a leader is equal to the Golomb-Dickman constant omega=0.624329... which arises in problems of combinatorical nature. This outcome solves the problem of the determination of the record breaking rate for the sequence of correlated inter-record intervals. The process exhibits temporal self-similarity in the late-time regime. Connections with the statistics of the cycles of random permutations, the statistical properties of randomly broken intervals, and the Kesten variable are given.Comment: 30 pages,5 figures. Minor update

    Elemental Abundance Ratios in Stars of the Outer Galactic Disk. IV. A New Sample of Open Clusters

    Get PDF
    We present radial velocities and chemical abundances for nine stars in the old, distant open clusters Be 18, Be 21, Be 22, Be 32, and PWM 4. For Be 18 and PWM 4, these are the first chemical abundance measurements. Combining our data with literature results produces a compilation of some 68 chemical abundance measurements in 49 unique clusters. For this combined sample, we study the chemical abundances of open clusters as a function of distance, age, and metallicity. We confirm that the metallicity gradient in the outer disk is flatter than the gradient in the vicinity of the solar neighborhood. We also confirm that the open clusters in the outer disk are metal-poor with enhancements in the ratios [alpha/Fe] and perhaps [Eu/Fe]. All elements show negligible or small trends between [X/Fe] and distance (< 0.02 dex/kpc), but for some elements, there is a hint that the local (RGC < 13 kpc) and distant (RGC > 13 kpc) samples may have different trends with distance. There is no evidence for significant abundance trends versus age (< 0.04 dex/Gyr). We measure the linear relation between [X/Fe] and metallicity, [Fe/H], and find that the scatter about the mean trend is comparable to the measurement uncertainties. Comparison with solar neighborhood field giants shows that the open clusters share similar abundance ratios [X/Fe] at a given metallicity. While the flattening of the metallicity gradient and enhanced [alpha/Fe] ratios in the outer disk suggest a different chemical enrichment history to the solar neighborhood, we echo the sentiments expressed by Friel et al. that definitive conclusions await homogeneous analyses of larger samples of stars in larger numbers of clusters. Arguably, our understanding of the evolution of the outer disk from open clusters is currently limited by systematic abundance differences between various studies.Comment: Accepted for publication in A

    Universal statistics of wave functions in chaotic and disordered systems

    Full text link
    We study a new statistics of wave functions in several chaotic and disordered systems: the random matrix model, band random matrix model, the Lipkin model, chaotic quantum billiard and the 1D tight-binding model. Both numerical and analytical results show that the distribution function of a generalized Riccati variable, defined as the ratio of components of eigenfunctions on basis states coupled by perturbation, is universal, and has the form of Lorentzian distribution.Comment: 6 Europhys pages, 2 Ps figures, new version to appear in Europhys. Let

    One dimensional drift-diffusion between two absorbing boundaries: application to granular segregation

    Full text link
    Motivated by a novel method for granular segregation, we analyze the one dimensional drift-diffusion between two absorbing boundaries. The time evolution of the probability distribution and the rate of absorption are given by explicit formulae, the splitting probability and the mean first passage time are also calculated. Applying the results we find optimal parameters for segregating binary granular mixtures.Comment: RevTeX, 5 pages, 6 figure
    corecore