The pattern and control of reproductive development in non-astringent persimmon (Diospyros kaki L.): a review

Non-astringent persimmon is rapidly expanding as a new fruit crop in warm subtropical regions of the world, Most research and development of this fruit crop has occurred in Japan, where there is a considerable amount of published literature on its performance. Much of this information is not readily accessible to other countries and needs to be interpreted and modified for other climatic regions. This paper reviews reproductive events from floral initiation to the completion of fruit growth. The timing and significance of these events is described in relation to the phenological cycle. Method of improving flowering, reducing fruit drop and altering the fruit maturity period are discussed. (C) 1997 Elsevier Science B.V.

Genetic algorithms for continuous optimization problems - a concept of parameter-space size adjustment

The concept of parameter-space size adjustment is pn,posed in order to enable successful application of genetic algorithms to continuous optimization problems. Performance of genetic algorithms with six different combinations of selection and reproduction mechanisms, with and without parameter-space size adjustment, were severely tested on eleven multiminima test functions. An algorithm with the best performance was employed for the determination of the model parameters of the optical constants of Pt, Ni and Cr.

Sibling competition and parental control: Patterns of begging in parrots

Begging and food allocation patterns are the outcome of complex and repeated interactions between parents and young. In most systems studied, food allocation is regulated by begging and scramble competition. In contrast, little is understood about how nestling solicitation behaviours will evolve in systems where parents engage in complex patterns of food allocation. Parrots appear to be an excellent group in which to examine the shifting balance between sibling competition and parental control. Studies to date have shown that levels of sibling competition within parrot broods are low, possibly in response to parental control over food distribution. I assess what is known about the function of nestling begging in parrots and evaluate why begging signals appear to function differently in this group.

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.