1000 resultados para Project STAR
Resumo:
Référence bibliographique : Rol, 59144
Resumo:
Référence bibliographique : Rol, 59147
Resumo:
Référence bibliographique : Rol, 59148
Resumo:
Référence bibliographique : Rol, 59386
Resumo:
Référence bibliographique : Rol, 59263
Resumo:
Référence bibliographique : Rol, 59264
Resumo:
Tuesday, January 5th, 1971
Resumo:
The cover of the project summary pamphlet for Alphies Trough.
Resumo:
The project summary for Alphies Trough.
Resumo:
This project is a quasi-experimental study involving eight classrooms in two senior elementary schools in St. Catharines, Ontario which received a Project Business Program and were pre- and post-tested to determine the growth of knowledge acquisition in the area of business concepts. Four classrooms received a Project Business treatment while four classrooms acted as a control. The Project Business Program is sponsored by Junior Achievement of Canada; it occurred during a twelveweek period, February to May 1981, and is run by business consultants who, through Action, Dialogue and Career Exploration, teach children about economics and business related topics. The consultants were matched with teacher co-ordinators in whose classrooms they taught and with whom they discussed field trips, students, lesson planning, etc. The statistical analysis of pre- and post-test means revealed a significant statistical growth in the area of knowledge acquisition on the part of those students who received the Project Business Program. This confirms that Project Business makes a difference. A search of the literature appears to advocate economic programs like Project Business, whfch are broadly based, relevant and processoriented. This program recommends itself as a model for other areas of co-operative curricular interactions and as a bridge to future trends and as a result several fruitful areas of research are suggested.
Resumo:
The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was proposed as an attractive alternative to the popular hypercube. The major advantage of the (n, k )-star network is its scalability, which makes it more flexible than the n-star as an interconnection network. In this thesis, we will focus on finding graph theoretical properties of the (n, k )-star as well as developing parallel algorithms that run on this network. The basic topological properties of the (n, k )-star are first studied. These are useful since they can be used to develop efficient algorithms on this network. We then study the (n, k )-star network from algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms for basic communication, prefix computation, and sorting, etc. A literature review of the state-of-the-art in relation to the (n, k )-star network as well as some open problems in this area are also provided.
Resumo:
Research Report Written for the Canadian Breast Cancer Foundation.
Resumo:
The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.