No abstract

No abstract

The paper presents an algorithm for partitioning the nodes of a weighted graph in order to minimize the interset weights. The algorithm is patterned after the branch-and-probabilistic-bound procedures of Graves and Whinston. Final partitions or solutions are characterized by probability statements like: “the probability is greater than α that a randomly selected solution is inferior to the final.” The algorithm can be used to segment computer programs and data libraries when statistics on the transition or reference rates among program or data elements are known. Numerical results demonstrate the feasibility of efficiently partitioning 50-node graphs.

The purpose of this study was to identify the strengths and challenges that emerged from the first 3 years of a high school student leadership development program located in an urban setting. This study was developed as an instrumental case study of one student leadership development program serving urban public high schools in South Central Texas. Feedback was solicited from 10 current and former participants regarding the successes and challenges they encountered within this program. Three themes emerged from these interviews: personal voice, a sense of responsibility, and building community relationships. Discussion is included regarding considerations for secondary administrators about the potential utility of this model in helping develop student leaders of color in urban settings.

An experiment or demonstration of the electroless plating of copper in a watch glass.