Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 4 of 4

Full-Text Articles in Physical Sciences and Mathematics

Implementing Educational Software And Evaluating Its Academic Effectiveness: Part Ii, Karen Jolicoeur, Dale E. Berger Oct 1988

Implementing Educational Software And Evaluating Its Academic Effectiveness: Part Ii, Karen Jolicoeur, Dale E. Berger

CGU Faculty Publications and Research

In Part I, published last month, we presented a successful classroom implementation plan for integrating educational software into elementary school classrooms. Implementing educational software successfully into classrooms is an essential prerequisite to achieving the second goal of the present research-evaluating how much students learned by using specific software programs. In Part II, we will measure how effective eight software programs were at teaching fifth grade students new fraction concepts and spelling words. In addition, we will examine the validity of teacher and student software ratings based on the effectiveness of each program.


Implementing Educational Software And Evaluating Its Academic Effectiveness: Part I, Karen Jolicoeur, Dale E. Berger Sep 1988

Implementing Educational Software And Evaluating Its Academic Effectiveness: Part I, Karen Jolicoeur, Dale E. Berger

CGU Faculty Publications and Research

Two major obstacles are responsible for the delay in getting good educational software into schools. First, software implementation is a complex process that many schools are simply not prepared to undertake. Second, there is very little empirical research available on the specific factors that make educational software effective, leaving it extremely difficult to separate good from poor quality software. We will describe a basic plan for implementing educational software into classrooms, incorporating a research design that permits educational researchers to measure the effectiveness of the software. Part I of this series of two articles presents a basic plan for implementing …


Fault Tolerance In Networks Of Bounded Degree, Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal Jan 1988

Fault Tolerance In Networks Of Bounded Degree, Cynthia Dwork, David Peleg, Nicholas Pippenger, Eli Upfal

All HMC Faculty Publications and Research

Achieving processor cooperation in the presence of faults is a major problem in distributed systems. Popular paradigms such as Byzantine agreement have been studied principally in the context of a complete network. Indeed, Dolev [J. Algorithms, 3 (1982), pp. 14–30] and Hadzilacos [Issues of Fault Tolerance in Concurrent Computations, Ph.D. thesis, Harvard University, Cambridge, MA, 1984] have shown that Ω(t) connectivity is necessary if the requirement is that all nonfaulty processors decide unanimously, where t is the number of faults to be tolerated. We believe that in forseeable technologies the number of faults will grow with the size of the …


Wide-Sense Nonblocking Networks, Paul Feldman, Joel Friedman, Nicholas Pippenger Jan 1988

Wide-Sense Nonblocking Networks, Paul Feldman, Joel Friedman, Nicholas Pippenger

All HMC Faculty Publications and Research

A new method for constructing wide-sense nonblocking networks is presented. Application of this method yields (among other things) wide-sense nonblocking generalized connectors with n inputs and outputs and size O( n log n ), and with depth k and size O( n1 + 1/k ( log n )1 - 1/k ).