4,649 research outputs found

    Magnetism in purple bronze Li0.9_{0.9}Mo6_6O17_{17}

    Full text link
    Muon spin relaxation measurements around the 25 K metal-insulator transition in Li0.9_{0.9}Mo6_6O17_{17} elucidate a profound role of disorder as a possible mechanism for this transition. The relaxation rate 1/T11/T_1 and the muon Knight shift are incompatible with the transition to a SDW state and thus exclude it.Comment: pages 2, fig 2, The conf. on strongly correlated electron systems, SCES 2004, German

    Population inversion of a NAHS mixture adsorbed into a cylindrical pore

    Full text link
    A cylindrical nanopore immersed in a non-additive hard sphere binary fluid is studied by means of integral equation theories and Monte Carlo simulations. It is found that at low and intermediate values of the bulk total number density the more concentrated bulk species is preferentially absorbed by the pore, as expected. However, further increments of the bulk number density lead to an abrupt population inversion in the confined fluid and an entropy driven prewetting transition at the outside wall of the pore. These phenomena are a function of the pore size, the non-additivity parameter, the bulk number density, and particles relative number fraction. We discuss our results in relation to the phase separation in the bulk.Comment: 7 pages, 8 Figure

    Salford postgraduate annual research conference (SPARC) 2012 proceedings

    Get PDF
    These proceedings bring together a selection of papers from the 2012 Salford Postgraduate Annual Research Conference (SPARC). They reflect the breadth and diversity of research interests showcased at the conference, at which over 130 researchers from Salford, the North West and other UK universities presented their work. 21 papers are collated here from the humanities, arts, social sciences, health, engineering, environment and life sciences, built environment and business

    A New Approach to Fuzzy-Rough Nearest Neighbour Classification

    Get PDF
    In this paper; we present a new fuzzy-rough nearest neighbour (FRNN) classification algorithm, as an alternative to Sarkar's fuzzy-rough ownership function (FRNN-O) approach. By contrast to the latter, our method uses the nearest neighbours to construct lower and ripper approximations of decision classes; and classifies test instances based on their membership to these approximations. In the experimental analysis; we evaluate our approach with both classical fuzzy-rough approximations (based on an implicator and a t-norm), as well as with the recently introduced vaguely quantified rough sets. Preliminary results are very good, and in general FRNN outperforms both FRNN-O; as well as the traditional frizzy nearest neighbour (FNN) algorithm

    Using patterns position distribution for software failure detection

    Get PDF
    Pattern-based software failure detection is an important topic of research in recent years. In this method, a set of patterns from program execution traces are extracted, and represented as features, while their occurrence frequencies are treated as the corresponding feature values. But this conventional method has its limitation due to ignore the pattern’s position information, which is important for the classification of program traces. Patterns occurs in the different positions of the trace are likely to represent different meanings. In this paper, we present a novel approach for using pattern’s position distribution as features to detect software failure. The comparative experiments in both artificial and real datasets show the effectiveness of this method

    What can(not) be measured with ton-scale dark matter direct detection experiments

    Full text link
    Direct searches for dark matter have prompted in recent years a great deal of excitement within the astroparticle physics community, but the compatibility between signal claims and null results of different experiments is far from being a settled issue. In this context, we study here the prospects for constraining the dark matter parameter space with the next generation of ton-scale detectors. Using realistic experimental capabilities for a wide range of targets (including fluorine, sodium, argon, germanium, iodine and xenon), the role of target complementarity is analysed in detail while including the impact of astrophysical uncertainties in a self-consistent manner. We show explicitly that a multi-target signal in future direct detection facilities can determine the sign of the ratio of scalar couplings fn/fpf_n/f_p, but not its scale. This implies that the scalar-proton cross-section is left essentially unconstrained if the assumption fpfnf_p\sim f_n is relaxed. Instead, we find that both the axial-proton cross-section and the ratio of axial couplings an/apa_n/a_p can be measured with fair accuracy if multi-ton instruments using sodium and iodine will eventually come online. Moreover, it turns out that future direct detection data can easily discriminate between elastic and inelastic scatterings. Finally, we argue that, with weak assumptions regarding the WIMP couplings and the astrophysics, only the dark matter mass and the inelastic parameter (i.e. mass splitting) may be inferred from the recoil spectra -- specifically, we anticipate an accuracy of tens of GeV (tens of keV) in the measurement of the dark matter mass (inelastic parameter).Comment: 31 pages, 7 figures, 7 table

    A Simple Iterative Algorithm for Parsimonious Binary Kernel Fisher Discrimination

    Get PDF
    By applying recent results in optimization theory variously known as optimization transfer or majorize/minimize algorithms, an algorithm for binary, kernel, Fisher discriminant analysis is introduced that makes use of a non-smooth penalty on the coefficients to provide a parsimonious solution. The problem is converted into a smooth optimization that can be solved iteratively with no greater overhead than iteratively re-weighted least-squares. The result is simple, easily programmed and is shown to perform, in terms of both accuracy and parsimony, as well as or better than a number of leading machine learning algorithms on two well-studied and substantial benchmarks
    corecore