Family, community and politics: the fertile legacy of Michael Young

The Institute of Community Studies was set up by Michael Young in order to carry out research on politically relevant social issues, in a context free from direct political control. A research method was devised for it whereby researchers made their own values and objectives very explicit, while staying as close as possible in their reports to the concerns and language of respondents themselves. This method has often been criticized by professional sociologists: but it reflects quite well the nature of social knowledge. It has produced reports which help to increase public understanding of social processes, and provide useful guidance to policy makers. Professional sociology on the other hand has tried to develop a rigorously value-free method. As a result, though, it often seems to be tied implicitly to values shared among researchers but not more universally. Arguably this makes it harder for the general public to understand, and accept, its findings.

Parallel algorithms of the Purcell method for direct solution of linear systems

In this paper, we first demonstrate that the classical Purcell's vector method when combined with row pivoting yields a consistently small growth factor in comparison to the well-known Gauss elimination method, the Gauss–Jordan method and the Gauss–Huard method with partial pivoting. We then present six parallel algorithms of the Purcell method that may be used for direct solution of linear systems. The algorithms differ in ways of pivoting and load balancing. We recommend algorithms V and VI for their reliability and algorithms III and IV for good load balance if local pivoting is acceptable. Some numerical results are presented.

A revised classification for direct tooth-colored restorative materials

Composite resins and glass-ionomer cements were introduced to dentistry in the 1960s and 1970s, respectively. Since then, there has been a series of modifications to both materials as well as the development other groups claiming intermediate characteristics between the two. The result is a confusion of materials leading to selection problems. While both materials are tooth-colored, there is a considerable difference in their properties, and it is important that each is used in the appropriate situation. Composite resin materials are esthetic and now show acceptable physical strength and wear resistance. However, they are hydrophobic, and therefore more difficult to handle in the oral environment, and cannot support ion migration. Also, the problems of gaining long-term adhesion to dentin have yet to be overcome. On the other hand, glass ionomers are water-based and therefore have the potential for ion migration, both inward and outward from the restoration, leading to a number of advantages. However, they lack the physical properties required for use in load-bearing areas. A logical classification designed to differentiate the materials was first published by McLean et al in 1994, but in the last 15 years, both types of material have undergone further research and modification. This paper is designed to bring the classification up to date so that the operator can make a suitable, evidence-based, choice when selecting a material for any given situation.

Mesh partitioning and load balancing for distributed memory parallel systems

A method is outlined for optimising graph partitions which arise in mapping unstructured mesh calculations to parallel computers. The method employs a relative gain iterative technique to both evenly balance the workload and minimise the number and volume of interprocessor communications. A parallel graph reduction technique is also briefly described and can be used to give a global perspective to the optimisation. The algorithms work efficiently in parallel as well as sequentially and when combined with a fast direct partitioning technique (such as the Greedy algorithm) to give an initial partition, the resulting two-stage process proves itself to be both a powerful and flexible solution to the static graph-partitioning problem. Experiments indicate that the resulting parallel code can provide high quality partitions, independent of the initial partition, within a few seconds. The algorithms can also be used for dynamic load-balancing, reusing existing partitions and in this case the procedures are much faster than static techniques, provide partitions of similar or higher quality and, in comparison, involve the migration of a fraction of the data.