11,516 research outputs found

    The assessment of long-term orbital debris models

    Get PDF
    Existing long-term orbital debris models are assessed as a first step in the Air Force's effort to develop an Air Force long-term orbital debris model which can perform the following functions: (1) operate with the necessary accuracy at the relevant altitudes and orbital parameters; (2) benefit from new Air Force and non-Air Force debris measurements; and (3) accommodate current and future Air Force space scenarios. Model assessment results are shown for the NASA engineering model. The status of the NASA EVOLVE model assessment is discussed

    Novel online Recommendation algorithm for Massive Open Online Courses (NoR-MOOCs)

    Get PDF
    Massive Open Online Courses (MOOCs) have gained in popularity over the last few years. The space of online learning resources has been increasing exponentially and has created a problem of information overload. To overcome this problem, recommender systems that can recommend learning resources to users according to their interests have been proposed. MOOCs contain a huge amount of data with the quantity of data increasing as new learners register. Traditional recommendation techniques suffer from scalability, sparsity and cold start problems resulting in poor quality recommendations. Furthermore, they cannot accommodate the incremental update of the model with the arrival of new data making them unsuitable for MOOCs dynamic environment. From this line of research, we propose a novel online recommender system, namely NoR-MOOCs, that is accurate, scales well with the data and moreover overcomes previously recorded problems with recommender systems. Through extensive experiments conducted over the COCO data-set, we have shown empirically that NoR-MOOCs significantly outperforms traditional KMeans and Collaborative Filtering algorithms in terms of predictive and classification accuracy metrics

    Evidence for Nodal superconductivity in Sr2_{2}ScFePO3_{3}

    Full text link
    Point contact Andreev reflection spectra have been taken as a function of temperature and magnetic field on the polycrystalline form of the newly discovered iron-based superconductor Sr2ScFePO3. A zero bias conductance peak which disappears at the superconducting transition temperature, dominates all of the spectra. Data taken in high magnetic fields show that this feature survives until 7T at 2K and a flattening of the feature is observed in some contacts. Here we inspect whether these observations can be interpreted within a d-wave, or nodal order parameter framework which would be consistent with the recent theoretical model where the height of the P in the Fe-P-Fe plane is key to the symmetry of the superconductivity. However, in polycrystalline samples care must be taken when examining Andreev spectra to eliminate or take into account artefacts associated with the possible effects of Josephson junctions and random alignment of grains.Comment: Published versio

    CVD of CrO2: towards a lower temperature deposition process

    Get PDF
    We report on the synthesis of highly oriented a-axis CrO2 films onto (0001) sapphire by atmospheric pressure CVD from CrO3 precursor, at growth temperatures down to 330 degree Celsius, i.e. close to 70 degrees lower than in published data for the same chemical system. The films keep the high quality magnetic behaviour as those deposited at higher temperature, which can be looked as a promising result in view of their use with thermally sensitive materials, e.g. narrow band gap semiconductors.Comment: 13 pages, 4 figure

    Order preserving pattern matching on trees and DAGs

    Full text link
    The order preserving pattern matching (OPPM) problem is, given a pattern string pp and a text string tt, find all substrings of tt which have the same relative orders as pp. In this paper, we consider two variants of the OPPM problem where a set of text strings is given as a tree or a DAG. We show that the OPPM problem for a single pattern pp of length mm and a text tree TT of size NN can be solved in O(m+N)O(m+N) time if the characters of pp are drawn from an integer alphabet of polynomial size. The time complexity becomes O(mlogm+N)O(m \log m + N) if the pattern pp is over a general ordered alphabet. We then show that the OPPM problem for a single pattern and a text DAG is NP-complete

    Children as experiencers: increasing engagement, participation and inclusion for young children in the museum

    Get PDF
    This research aimed to evaluate young children’s engagement, participation and inclusion within a city museum by utilising observations and semi structured interviews with children and families. Both groups requested more interactive exhibits, sensory experiences, making and doing activities and role play opportunities. In this article, we argue for increased visibility of children’s ‘intangible heritage’(Brookshaw, 2016) and opportunities for responding which make links with children’s lives contemporarily. We further argue that museums should view children as experiencers rather than learners

    The discomforting rise of ' public geographies': a 'public' conversation.

    Get PDF
    In this innovative and provocative intervention, the authors explore the burgeoning ‘public turn’ visible across the social sciences to espouse the need to radically challenge and reshape dominant and orthodox visions of ‘the academy’, academic life, and the role and purpose of the academic
    corecore