Mixed partitions of sets of triples into small planes

We continue our study of partitions of the set of all ((v)(3)) triples chosen from a v-set into pairwise disjoint planes with three points per line. We develop further necessary conditions for the existence of partitions of such sets into copies of PG(2, 2) and copies of AG(2, 3), and deal with the cases v = 13, 14, 15 and 17. These partitions, together with those already known for v = 12, 16 and 18, then become starters for recursive constructions of further infinite families of partitions. (C) 2004 Elsevier B.V. All rights reserved.

Partitioned likelihood support and the evaluation of data set conflict

In simultaneous analyses of multiple data partitions, the trees relevant when measuring support for a clade are the optimal tree, and the best tree lacking the clade (i.e., the most reasonable alternative). The parsimony-based method of partitioned branch support (PBS) forces each data set to arbitrate between the two relevant trees. This value is the amount each data set contributes to clade support in the combined analysis, and can be very different to support apparent in separate analyses. The approach used in PBS can also be employed in likelihood: a simultaneous analysis of all data retrieves the maximum likelihood tree, and the best tree without the clade of interest is also found. Each data set is fitted to the two trees and the log-likelihood difference calculated, giving partitioned likelihood support (PLS) for each data set. These calculations can be performed regardless of the complexity of the ML model adopted. The significance of PLS can be evaluated using a variety of resampling methods, such as the Kishino-Hasegawa test, the Shimodiara-Hasegawa test, or likelihood weights, although the appropriateness and assumptions of these tests remains debated.

Genes, morphology and agreement: congruence in Australian anthracine bee flies (Diptera : Bombyliidae : Anthracinae)

Almost half of the 4547 described bee flies (Bombyliidae: Diptera) in the world belong to the subfamily Anthracinae, with most of the world's diversity in three cosmopolitan tribes: Villini, Anthracini and Exoprosopini. Molecular data from 815 base pairs of 16S mitochondrial DNA and morphological characters from species-groups of these tribes in Australia were analysed cladistically. The results show that the relationships between the anthracine tribes reflect those found in a previous morphological analysis. The genera of the Anthracinae in Australia are monophyletic, except for Ligyra Newman, and are assigned to tribes. Although simultaneous analysis of the combined molecular and morphological data produced clades found in both separate analyses, the different data sources are significantly incongruent. We use phylogenetic measures to examine support for the relationships among the Australian Anthracinae inferred by the molecular and morphological data.

Effects of high temperature on the growth and composition of sugarcane internodes

Sugarcane grown in the Ord River district of Western Australia has lower sucrose content than expected from earlier trials and experience in other irrigated districts. High temperatures have been hypothesised as a possible cause. The effects of high temperature (above 32 degrees C) on growth and carbon partitioning were investigated. A temperature regime of (25-38 degrees C) was compared with (23-33 degrees C). In one experiment, 7-month-old plants of cvv. Q117 and Q158 were subjected to the treatments for 2 months. In another experiment, the plants were allowed to regrow (ratoon) for 6 months. In both experiments, the higher temperature resulted in more, shorter internodes and higher moisture content. Most internodes from plants in the higher temperature treatment had lower sucrose content than internodes from the lower temperature. On a dry mass basis the internodes from the plants in the higher temperature had proportionately more fibre and hexoses but lower sucrose. Combined with an increased number of nodes in a stem of similar or shorter length this would result in higher stalk fibre and lower sucrose content. The data provided evidence that sugarcane partitions less carbon to stored sucrose when grown under high compared with low temperatures. The two cultivars partitioned carbon between soluble (sugars) and insoluble (fibre) fractions to different degrees. These experiments also indicate that the current models describing leaf appearance and perhaps sugarcane growth at temperatures above 32 degrees C, in general, need revision.

Maple tools for the Kurzweil integral

Riemann sums based on delta fine partitions are illustrated with a Maple procedure

BM+-tree: A hyperplane-based index method for high-dimensional metric spaces

In this paper, we propose a novel high-dimensional index method, the BM+-tree, to support efficient processing of similarity search queries in high-dimensional spaces. The main idea of the proposed index is to improve data partitioning efficiency in a high-dimensional space by using a rotary binary hyperplane, which further partitions a subspace and can also take advantage of the twin node concept used in the M+-tree. Compared with the key dimension concept in the M+-tree, the binary hyperplane is more effective in data filtering. High space utilization is achieved by dynamically performing data reallocation between twin nodes. In addition, a post processing step is used after index building to ensure effective filtration. Experimental results using two types of real data sets illustrate a significantly improved filtering efficiency.

Right ventricle extraction by low level and model-based algorithm

In this paper we present an algorithm as the combination of a low level morphological operation and model based Global Circular Shortest Path scheme to explore the segmentation of the Right Ventricle. Traditional morphological operations were employed to obtain the region of interest, and adjust it to generate a mask. The image cropped by the mask is then partitioned into a few overlapping regions. Global Circular Shortest Path algorithm is then applied to extract the contour from each partition. The final step is to re-assemble the partitions to create the whole contour. The technique is deemed quite reliable and robust, as this is illustrated by a very good agreement between the extracted contour and the expert manual drawing output.