308 research outputs found

    The religious guidance of southern highland youth at the Berry Schools

    Full text link
    Thesis (Ph.D.)--Boston UniversityThe adequacy of any program of education depends upon the results produced. This dissertation has been an attempt to discover specific evidences in the program of education at the Berry Schools which would be valuable to those who are guiding the religious growth of Southern Highland youth. In order to do this certain criteria have been established, that there might be a basis for a comparison with this program. Several educational approaches could have been made and the conclusions of the accompanying evaluation would have corresponded to the particular approach. The trend of thought of leading religious educators such as William Clayton Bower, George A. Coe, Paul H. Vieth, Ernest J. Chave, and Roy A. Burkhart has been followed in setting up the criteria for this comparison. It is referred to as the creative approach

    The mission of the Christian church in the southern highlands

    Full text link
    Thesis (M.A.)--Boston University, 194

    Interactive Supercomputing with MIT Matlab

    Get PDF
    This paper describes MITMatlab, a system that enables users of supercomputers or networked PCs to work on large data sets within Matlab transparently. MITMatlab is based on the Parallel Problems Server (PPServer), a standalone 'linear algebra server' that provides a mechanism for running distributed memory algorithms on large data sets. The PPServer and MITMatlab enable high-performance interactive supercomputing. With such a tool, researchers can now use Matlab as more than a prototyping tool for experimenting with small problems. Instead, MITMatlab makes is possible to visualize and operate interactively on large data sets. This has implications not only in supercomputing, but for Artificial Intelligence applicatons such as Machine Learning, Information Retrieval and Image Processing

    Tree-Independent Dual-Tree Algorithms

    Full text link
    Dual-tree algorithms are a widely used class of branch-and-bound algorithms. Unfortunately, developing dual-tree algorithms for use with different trees and problems is often complex and burdensome. We introduce a four-part logical split: the tree, the traversal, the point-to-point base case, and the pruning rule. We provide a meta-algorithm which allows development of dual-tree algorithms in a tree-independent manner and easy extension to entirely new types of trees. Representations are provided for five common algorithms; for k-nearest neighbor search, this leads to a novel, tighter pruning bound. The meta-algorithm also allows straightforward extensions to massively parallel settings.Comment: accepted in ICML 201

    Contra- Rotating Ducted Axial Flow Compressor

    Get PDF

    Statistical relational learning with soft quantifiers

    Get PDF
    Quantification in statistical relational learning (SRL) is either existential or universal, however humans might be more inclined to express knowledge using soft quantifiers, such as ``most'' and ``a few''. In this paper, we define the syntax and semantics of PSL^Q, a new SRL framework that supports reasoning with soft quantifiers, and present its most probable explanation (MPE) inference algorithm. To the best of our knowledge, PSL^Q is the first SRL framework that combines soft quantifiers with first-order logic rules for modelling uncertain relational data. Our experimental results for link prediction in social trust networks demonstrate that the use of soft quantifiers not only allows for a natural and intuitive formulation of domain knowledge, but also improves the accuracy of inferred results

    Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension

    Full text link
    We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum dimension of a bounded face, then the number of vertices of the polyhedron is O(n^d) and the total number of bounded faces of the polyhedron is O(n^d^2). For inputs in general position the number of bounded faces is O(n^d). For any fixed d, we show how to compute the set of all vertices, how to determine the maximum dimension of a bounded face of the polyhedron, and how to compute the set of bounded faces in polynomial time, by solving a polynomial number of linear programs

    Food site residence time and female competitive relationships in wild gray-cheeked mangabeys (Lophocebus albigena)

    Get PDF
    Authors of socioecological models propose that food distribution affects female social relationships in that clumped food resources, such as fruit, result in strong dominance hierarchies and favor coalition formation with female relatives. A number of Old World monkey species have been used to test predictions of the socioecological models. However, arboreal forest-living Old World monkeys have been understudied in this regard, and it is legitimate to ask whether predominantly arboreal primates living in tropical forests exhibit similar or different patterns of behavior. Therefore, the goal of our study was to investigate female dominance relationships in relation to food in gray-cheeked mangabeys (Lophocebus albigena). Since gray-cheeked mangabeys are largely frugivorous, we predicted that females would have linear dominance hierarchies and form coalitions. In addition, recent studies suggest that long food site residence time is another important factor in eliciting competitive interactions. Therefore, we also predicted that when foods had long site residence times, higher-ranking females would be able to spend longer at the resource than lower-ranking females. Analyses showed that coalitions were rare relative to some other Old World primate species, but females had linear dominance hierarchies. We found that, contrary to expectation, fruit was not associated with more agonism and did not involve long site residence times. However, bark, a food with a long site residence time and potentially high resource value, was associated with more agonism, and higher-ranking females were able to spend more time feeding on it than lower-ranking females. These results suggest that higher-ranking females may benefit from higher food and energy intake rates when food site residence times are long. These findings also add to accumulating evidence that food site residence time is a behavioral contributor to female dominance hierarchies in group-living species
    • …
    corecore