Geospatial clustering in data-rich environments: Features and issues

Geospatial clustering must be designed in such a way that it takes into account the special features of geoinformation and the peculiar nature of geographical environments in order to successfully derive geospatially interesting global concentrations and localized excesses. This paper examines families of geospaital clustering recently proposed in the data mining community and identifies several features and issues especially important to geospatial clustering in data-rich environments.

The role of physiological understanding in plant breeding; From a breeding perspective

The role of physiological understanding in improving the efficiency of breeding programs is examined largely from the perspective of conventional breeding programs. Impact of physiological research to date on breeding programs, and the nature of that research, was assessed from (i) responses to a questionnaire distributed to plant breeders and physiologists, and (ii) a survey of literature abstracts. Ways to better utilise physiological understanding for improving breeding programs are suggested, together with possible constraints to delivering beneficial outcomes. Responses from the questionnaire indicated a general view that the contribution by crop physiology to date has been modest. However, most of those surveyed expected the contribution to be larger in the next 20 years. Some constraints to progress perceived by breeders and physiologists were highlighted. The survey of literature abstracts indicated that from a plant breeding perspective, much physiological research is not progressing further than making suggestions about possible approaches to selection. There was limited evidence in the literature of objective comparison of such suggestions with existing methodology, or of development and application of these within active breeding programs. It is argued in this paper that the development of outputs from physiological research for breeding requires a good understanding of the breeding program(s) being serviced and factors affecting its performance. Simple quantitative genetic models, or at least the ideas they represent, should be considered in conducting physiological research and in envisaging and evaluating outputs. The key steps of a generalised breeding program are outlined, and the potential pathways for physiological understanding to impact on these steps are discussed. Impact on breeding programs may arise through (i) better choice of environments in which to conduct selection trials, (ii) identification of selection criteria and traits for focused introgression programs, and (iii) identifying traits for indirect selection criteria as an adjunct to criteria already used. While many breeders and physiologists apparently recognise that physiological understanding may have a major role in the first area, there appears to be relatively Little research activity targeting this issue, and a corresponding bias, arguably unjustified, toward examining traits for indirect selection. Furthermore, research on traits aimed at crop improvement is often deficient because key genetic parameters, such as genetic variation in relevant breeding populations and genetic (as opposed to phenotypic) correlations with yield or other characters of economic importance, are not properly considered in the research. Some areas requiring special attention for successfully interfacing physiology research with breeding are discussed. These include (i) the need to work with relevant genetic populations, (ii) close integration of the physiological research with an active breeding program, and (iii) the dangers of a pre-defined or narrow focus in the physiological research.

Alternatives for parallel Krylov subspace basis computation

Numerical methods related to Krylov subspaces are widely used in large sparse numerical linear algebra. Vectors in these subspaces are manipulated via their representation onto orthonormal bases. Nowadays, on serial computers, the method of Arnoldi is considered as a reliable technique for constructing such bases. However, although easily parallelizable, this technique is not as scalable as expected for communications. In this work we examine alternative methods aimed at overcoming this drawback. Since they retrieve upon completion the same information as Arnoldi's algorithm does, they enable us to design a wide family of stable and scalable Krylov approximation methods for various parallel environments. We present timing results obtained from their implementation on two distributed-memory multiprocessor supercomputers: the Intel Paragon and the IBM Scalable POWERparallel SP2. (C) 1997 by John Wiley & Sons, Ltd.

Effects of oxide promoters on metal dispersion and metal-support interactions in Ni catalysts supported on activated carbon

Various oxide-promoted Ni catalysts supported on activated carbon were prepared, and the effect of promoters on the surface structure and properties of Ni catalysts was studied. Physical adsorption (Na adsorption), thermogravimetric analysis (TGA), temperature-programmed desorption (TPD), X-ray diffraction (XRD), and X-ray photoelectron spectroscopy (XPS) were used to characterize the catalysts. It is found that nickel is fairly uniformly distributed in the pores of the carbon support. Addition of promoters produces a more homogeneous distribution of nickel ion in carbon. However, distributions of promoters in the pores are varying. Addition of promoters increases the dispersion of nickel in carbon. Promoters also change the interaction between the carbon and Ni, resulting in significantly different behaviors of catalysts under various environments. CaO and MgO promoters improve the reactivity of nickel catalysts with O-2 but retard the interaction between nickel oxide and carbon. La2O3 shows some inhibiting effect on the interactions between nickel oxide and oxygen as well as carbon.

Concurreny based transition refinement for the verification of distributed algorithms

We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.