No abstract

Symptom Checklist-90-Revised (SCL-90-R) scores of 209 undergraduate clients from a university-based psychology clinic were compared with those of 435 nonpatient undergraduates and with adult and adolescent norms. College student outpatients were similar to adult outpatients on the SCL-90-R. However, when compared with norms based on unscreened community samples, nonpatient undergraduates were, like adolescents, considerably more symptomatic than adults. Although nonpatient undergraduates were significantly less symptomatic than outpatient undergraduates, the two distributions overlapped considerably, which presents a high risk of misclassification. Comparison of the study samples with other published data supports the generalizability of these findings. The data's implications for the use of the SCL-90-R in evaluating symptomatology and the clinical significance of change in college students are discussed.The increasing use of measures of clinical significance for evaluating client status and change requires appropriate instruments with norms for both normal and pathological populations (Jacobson, Follette, & Revenstorf, 1984). Johnson, Ellison, and Heikkinen (1989) argued that the Symptom Checklist-90-Revised (SCL-90-R; Derogatis, 1994;Derogatis & Cleary, 1977;Derogatis, Lipman, & Covi, 1973), which is widely used for both clinical and research purposes (Beutler & Crago, 1983;Waskow & Parloff, 1975), could be useful for evaluating the psychological symptoms of university counseling center clients. Norms are available for the SCL-90-R for adult outpatients and inpatients as well as for populations of adults and adolescents labeled "nonpatient"; however, these nonpatient populations should more accurately be called "unscreened" because they did not exclude individuals who were cur-

We consider a notion of embedding digraphs on orientable surfaces, applicable to digraphs in which the indegree equals the outdegree for every vertex, i.e., Eulerian digraphs. This idea has been considered before in the context of compatible Euler tours or orthogonal A-trails by Andersen and by Bouchet. This prior work has mostly been limited to embeddings of Eulerian digraphs on predetermined surfaces and to digraphs with underlying graphs of maximum degree at most 4. In this paper, a foundation is laid for the study of all Eulerian digraph embeddings. Results are proved which are analogous to those fundamental to the theory of undirected graph embeddings, such as Duke's theorem [5], and an infinite family of digraphs which demonstrates that the genus range for an embeddable digraph can be any nonnegative integer given. We show that it is possible to have genus range equal to one, with arbitrarily large minimum genus, unlike in the undirected case. The difference between the minimum genera of a digraph and its underlying graph is considered, as is the difference between the maximum genera. We say that a digraph is upper-embeddable if it can be embedded with two or three regions and prove that every regular tournament is upper-embeddable.

No abstract

No abstract