Viability of the Antitrust Per Se Illegality Rule: Schwinn Down, How Many to Go?

The impact of Sylvania on various antitrust restraints is first examined in a descriptive fashion. Then, a principled approach for dealing generally with this type of econo-legal problem is suggested

Sexual Harassment in the Workplace: a Primer

This Article is a primer for attorneys to use when advising their clients on how to address sexual harassment in the workplace. We will begin by describing the scope and severity of the sexual harassment problem. Then we will examine the recently strengthened federal law governing sexual harassment in the workplace. Finally, we will suggest policies and procedures for establishing and implementing a sexual harassment policy

DES and the Identification Problem

This article will examine the history of this drug, how it was used and regulated as well as the subsequent legal turmoil and the proffered resolutions to the quandary. The impact of these theories and of proposals to further strengthen product liability laws as a substitute for direct government intervention \u27 will also be studied

Evolving the service model for child and adolescent mental health services

A new model for a community mental health service for children and young people aged 0-18 years is described. This has been formulated after multi-level consultation including extensive user/carer involvement. The proposed model is multidisciplinary and integrated with multiagency provision, with smooth access onto and through care pathways. This model brings voluntary and statutory agencies into an integrated collaboration. It reinforces that social and emotional development and psychological functioning is everybody’s business and creates conditions where a child’s needs can be addressed on a day-to-day basis rather than through a “clinic-based model”.</jats:p

The reversing number of a diagraph

AbstractA minimum reversing set of a diagraph is a smallest sized set of arcs which when reversed makes the diagraph acyclic. We investigate a related issue: Given an acyclic diagraph D, what is the size of a smallest tournament T which has the arc set of D as a minimun reversing set? We show that such a T always exists and define the reversing number of an acyclic diagraph to be the number of vertices in T minus the number of vertices in D. We also derive bounds and exact values of the reversing number for certain classes of acyclic diagraphs