1,764 research outputs found

    PSYX 120.01: Introduction to Psychological Research Methods

    Get PDF

    PSYX 330.50: Child Development

    Get PDF

    De-extinction: A Hopeful Dream or Hopeless Nightmare

    Get PDF
    This is an essay about de-extinction and what we should and should not do in order to remedy this

    A multistage linear array assignment problem

    Get PDF
    The implementation of certain algorithms on parallel processing computing architectures can involve partitioning contiguous elements into a fixed number of groups, each of which is to be handled by a single processor. It is desired to find an assignment of elements to processors that minimizes the sum of the maximum workloads experienced at each stage. This problem can be viewed as a multi-objective network optimization problem. Polynomially-bounded algorithms are developed for the case of two stages, whereas the associated decision problem (for an arbitrary number of stages) is shown to be NP-complete. Heuristic procedures are therefore proposed and analyzed for the general problem. Computational experience with one of the exact problems, incorporating certain pruning rules, is presented with one of the exact problems. Empirical results also demonstrate that one of the heuristic procedures is especially effective in practice

    Adapting iterative algorithms for solving large sparse linear systems for efficient use on the CDC CYBER 205

    Get PDF
    Adapting and designing mathematical software to achieve optimum performance on the CYBER 205 is discussed. Comments and observations are made in light of recent work done on modifying the ITPACK software package and on writing new software for vector supercomputers. The goal was to develop very efficient vector algorithms and software for solving large sparse linear systems using iterative methods
    corecore