Ensuring Content‐Area Learning by Secondary Students with Learning Disabilities

Three factors tied with secondary student success in content‐area reading are demonstrated: (a) validated teacher‐focused and student‐focused interventions, (b) integrated and comprehensive service delivery systems, and (c) well‐designed, data‐based professional developmental programs. Difficult challenges face secondary students with LD and their teachers with regard to these students’ participation and success in required general education classes. Recently, instructional methods and materials have been developed and validated for promoting these students’ success. Some of them focus on how general education teachers plan and teach their content‐area courses; others focus on giving students the strategies they need to respond independently to the demands of their courses. This article describes these instructional methods, a service‐delivery model for implementing these interventions in secondary schools, and professional‐development mechanisms and administrative support that must be in place for the model to be maintained effectively.     

Toward a Programmatic Pragmatism: A Response to Naoko Saito

Naoko Saito has made a good case for emphasising the 'tragic' dimension within Dewey's pragmatism. My response suggests ways in which Saito has not gone far enough. She does not adequately move beyond 'procedural pragmatism' to a 'programmatic pragmatism' which offers substantive articulations about the human good. In addition, her emphasis on 'Emersonian perfectionism' is misguided. Both the language of 'perfectionism' and the figure of Emerson are unsuitable for the project she intends. Speaking more concretely of a 'tragic–comic meliorism' allied to the novelist Hawthorne, it is suggested, provides a more fruitful path.     

Three Supervision Modalities for Training Marital and Family Counselors

Three supervision modalities (live, delayed review, and verbal reports) in training marital and family counselors are discussed with attention given to goals, supervisory considerations, advantages, and disadvantages of each modality.     

Quantum algorithms: A?survey of some recent results

Quantum algorithms are a field of growing interest within the theoretical computer science as well as the physics community. Surprisingly, although the number of researchers working on the subject is ever-increasing, the number of quantum algorithms found so far is quite small. In fact, the task of designing new quantum algorithms has been proven to be extremely difficult. In this paper we give an overview of the known quantum algorithms and briefly describe the underlying ideas. Roughly, the algorithms presented are divided into hidden subgroup type algorithms and in amplitude amplification type algorithms. While the former deal with problems of group-theoretical nature and have the promise to yield strong separations of classical and quantum algorithms, the latter have been proved to be a prolific source of algorithms in which a polynomial speed-up as compared to classical algorithms can be achieved. We also discuss quantum algorithms which do not fall under these two categories and give a survey of techniques of general interest in quantum computing such as adiabatic computing, lower bounds for quantum algorithms, and quantum interactive proofs.