Approaches to sharing knowledge in group problem structuring

Problem-structuring techniques are an integral aspect of ‘Soft-OR’. SSM, SAST, Strategic Choice, and JOURNEY Making, all depend for their success on a group developing a shared view of a problem through some form of explicit modelling. The negotiated problem structure becomes the basis for problem resolution. Implicit to this process is an assumption that members of the group share and build their knowledge about the problem domain. This paper explores the extent to which this assumption is reasonable. The research is based on detailed records from the use of JOURNEY Making, where it has used special purpose Group Support software to aid the group problem structuring. This software continuously tracks the contributions of each member of the group and thus the extent to which they appear to be ‘connecting’ and augmenting their own knowledge with that of other members of the group. Software records of problem resolution in real organisational settings are used to explore the sharing of knowledge among senior managers. These explorations suggest a typology of knowledge sharing. The implications of this typology for problem structuring and an agenda for future research are considered.     

Inner Radius of Univalence for a Strongly Starlike Domain

 The inner radius of univalence of a domain D with Poincaré density ρ _D is the possible largest number σ such that the condition ∥ S _f ∥ _D  = sup _{w∈ D} ρ _D (w) ⁻²∥ S _f (z) ∥ ≤ σ implies univalence of f for a nonconstant meromorphic function f on D, where S _f is the Schwarzian derivative of f. In this note, we give a lower bound of the inner radius of univalence for strongly starlike domains of order α in terms of the order α. The author was partially supported by the Ministry of Education, Grant-in-Aid for Encouragement of Young Scientists, 11740088. A part of this work was carried out during his visit to the University of Helsinki under the exchange programme of scientists between the Academy of Finland and the JSPS. Received November 26, 2001; in revised form September 24, 2002 Published online May 9, 2003     

Decay and regularity for dispersive equations with constant coefficients

This article discusses some smoothing estimates of the initial value problem for dispersive equations with constant coefficients. In particular, it is shown that a certain condition for the principal part of the symbol (see the assumption (1.3) below, which is equivalent to the one “of principal type” in the paper by Ben-Artzi and Devinatz [2]) is necessary and sufficient for the maximal smoothing in space-time. Dedicated to Professor Norio Shimakura The author was supported in part by Grant-in-Aid for Scientific Research, Ministry of Education, Culture, Sports, Science and Technology, Japan (No. 13640187).     

Sets with two associative operations

In this paper we consider duplexes, which are sets with two associative binary operations. Dimonoids in the sense of Loday are examples of duplexes. The set of all permutations carries a structure of a duplex. Our main result asserts that it is a free duplex with an explicitly described set of generators. The proof uses a construction of the free duplex with one generator by planary trees.     

Vanishing of local homology

 We study the vanishing properties of local homology of complexes of modules without assuming that its homology is artinian. Using vanishing results for local homology and cohomology we prove new vanishing results for Ext- and Tor-modules. Received: 1 August 2002; in final form: 23 September 2002 / Published online: 16 May 2003 Mathematics Subject Classification (1991): 13C12, 13D07, 13D45.     

A column generation approach for the timetabling problem of Greek high schools

A column generation (CG) approach for the solution of timetabling problems is presented. This methodology could be used for various instances of the timetabling problem, although in this paper the solution of the high-school situation in Greece is presented. The results obtained show clearly that the CG approach that has been extremely successful in recent years in the solution of airline crew scheduling problems could also be very efficient and robust for the solution of timetabling problems. Several large timetabling problems corresponding to real problems have been successfully solved, with the solutions obtained feasible and of very high quality in accordance with the problem definition. In addition, none of the solutions contained any idle hour for any of the teachers, which was one of the main goals of this optimization effort.     

Die Entwicklung kausaler Hypothesen in der qualitativen Sozialforschung

The disregard of causal inference in the methodological literature about qualitative research is highly problematic, since the category of causality is closely linked to the concept of social action. However, it is also clear that causal analysis is burdened with certain difficulties and methodological challenges in the realm of social research. Some of these problems are discussed in this article using Mackie—s concept of 3 “INUS”-conditions. Thereby it will be shown that strategies of causal analysis based on comparative methods proposed for qualitative research, namely “Analytic Induction” and “Qualitative Comparative Analysis” have great difficulties in dealing adequately with these problems. They can only be solved, if case-comparative methods are combined with explorative research strategies which support the researcher in gaining access to the local knowledge of the research field.     

Dihedral crossed products of exponent 2 are abelian

We prove that assuming enough roots of unity in the base field, a central simple algebra of exponent 2 which is split by a dihedral group, is also split by certain abelian groups.