Sheep rumen digestion and transmission of weedy Malva parviflora seeds

The effect of sheep digestion and mastication on Malva parviflora L. seed transmission, viability and germination was investigated. Mature M. parviflora seeds were subjected to 2 seed treatments: 'scarified', where the hard seed coat was manually cut to allow inhibition, and 'unscarified', where the hard seed coat was not cut. Seeds were placed directly into the rumen of fistulated sheep and removed at 0, 12, 24, 36 and 48 h of rumen digestion. After 12 h of in sacco exposure to digestion in the rumen, the germination of seeds that were initially scarified dropped from 99.2 to 1.4% and longer exposure periods produced no germinable seeds. In contrast, seeds that were unscarified when placed in the rumen produced over 92% germination regardless of in sacco digestion time, although manual scarification after retrieval was essential to elicit germination. In a second experiment, unscarified seeds (29000) were fed in a single meal to fistulated sheep and feces were collected at regular intervals between 6 and 120 h after feeding. Fecal subsamples were taken to determine number of seeds excreted, seed germination on agar and seed germination from feces. Major seed excretion in the feces commenced after 12 h and continued until 144 h, with peaks between 36 and 72 h after consumption. Although mastication and gut passage killed the majority of unscarified seeds, about 20% were recovered intact and over 90% of these recovered seeds were viable and could, thus, potentially form an extensive seed bank. A few excreted seeds (1%) were able to germinate directly from feces, which increased to a maximum of 10% after subsequent dry summer storage (3 months). Through information gained in this study, there is a potential to utilise livestock in an integrated weed management program for the control of M. parviflora, provided additional measures of weed control are in place such as holding periods (> 7 days) for movement of livestock from weed infested areas.

A new algorithm and refined bounds for extended gcd computation

Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.

Standard errors of fitted component means of normal mixtures

In this paper use consider the problem of providing standard errors of the component means in normal mixture models fitted to univariate or multivariate data by maximum likelihood via the EM algorithm. Two methods of estimation of the standard errors are considered: the standard information-based method and the computationally-intensive bootstrap method. They are compared empirically by their application to three real data sets and by a small-scale Monte Carlo experiment.

Mild head injury and speed of information processing: A prospective study of professional rugby league players

The sensitivity of several short tests of speed of information processing to the effects of mild head injury in rugby league football was investigated. The measures used were the Symbol Digit Modalities Test, the Digit Symbol Substitution Test, and the Speed of Comprehension Test. Two studies were conducted, the first to examine the effect of practice, the second to determine sensitivity to cognitive impairment immediately following injury. The first study established alternate form equivalence and demonstrated that performance on the Speed of Comprehension and Digit Symbol Substitution tests improved with practice, whereas the Symbol Digit Modalities test remained stable. A second study of 10 players who subsequently sustained mild head injuries showed that measures of speed of information processing were sensitive to impairment in the postacute phase, whereas an untimed task of word recognition (Spot-the-Word) was not. Speed of Comprehension was more sensitive to postinjury impairment than either the Digit Symbol Substitution or Symbol Digit Modalities tests. A repeated baseline assessment before injury using the higher score to reflect a player's potential, allowed measurement of impaired performance on sensitive tests.

Volume reduction of the corpus callosum and its relationship with deficits in interhemispheric transfer of information in recent-onset psychosis

The present study aimed to investigate the presence of corpus callosum (CC) volume deficits in a population-based recent-onset psychosis (ROP) sample, and whether CC volume relates to interhemispheric communication deficits. For this purpose, we used voxel-based morphometry comparisons of magnetic resonance imaging data between ROP (n = 122) and healthy control (n = 94) subjects. Subgroups (38 ROP and 39 controls) were investigated for correlations between CC volumes and performance on the Crossed Finger Localization Test (CFLT). Significant CC volume reductions in ROP subjects versus controls emerged after excluding substance misuse and non-right-handedness. CC reductions retained significance in the schizophrenia subgroup but not in affective psychoses subjects. There were significant positive correlations between CC volumes and CFLT scores in ROP subjects, specifically in subtasks involving interhemispheric communication. From these results, we can conclude that CC volume reductions are present in association with ROP. The relationship between such deficits and CFLT performance suggests that interhemispheric communication impairments are directly linked to CC abnormalities in ROP. (C) 2010 Elsevier Ireland Ltd. All rights reserved.

Analyzing the connectivity between regions of interest: An approach based on cluster Granger causality for NRI data analysis

The identification, modeling, and analysis of interactions between nodes of neural systems in the human brain have become the aim of interest of many studies in neuroscience. The complex neural network structure and its correlations with brain functions have played a role in all areas of neuroscience, including the comprehension of cognitive and emotional processing. Indeed, understanding how information is stored, retrieved, processed, and transmitted is one of the ultimate challenges in brain research. In this context, in functional neuroimaging, connectivity analysis is a major tool for the exploration and characterization of the information flow between specialized brain regions. In most functional magnetic resonance imaging (fMRI) studies, connectivity analysis is carried out by first selecting regions of interest (ROI) and then calculating an average BOLD time series (across the voxels in each cluster). Some studies have shown that the average may not be a good choice and have suggested, as an alternative, the use of principal component analysis (PCA) to extract the principal eigen-time series from the ROI(s). In this paper, we introduce a novel approach called cluster Granger analysis (CGA) to study connectivity between ROIs. The main aim of this method was to employ multiple eigen-time series in each ROI to avoid temporal information loss during identification of Granger causality. Such information loss is inherent in averaging (e.g., to yield a single ""representative"" time series per ROI). This, in turn, may lead to a lack of power in detecting connections. The proposed approach is based on multivariate statistical analysis and integrates PCA and partial canonical correlation in a framework of Granger causality for clusters (sets) of time series. We also describe an algorithm for statistical significance testing based on bootstrapping. By using Monte Carlo simulations, we show that the proposed approach outperforms conventional Granger causality analysis (i.e., using representative time series extracted by signal averaging or first principal components estimation from ROIs). The usefulness of the CGA approach in real fMRI data is illustrated in an experiment using human faces expressing emotions. With this data set, the proposed approach suggested the presence of significantly more connections between the ROIs than were detected using a single representative time series in each ROI. (c) 2010 Elsevier Inc. All rights reserved.

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.

Analysis and implementation of a new constant acceleration subcycling algorithm

An algorithm for explicit integration of structural dynamics problems with multiple time steps is proposed that averages accelerations to obtain subcycle states at a nodal interface between regions integrated with different time steps. With integer time step ratios, the resulting subcycle updates at the interface sum to give the same effect as a central difference update over a major cycle. The algorithm is shown to have good accuracy, and stability properties in linear elastic analysis similar to those of constant velocity subcycling algorithms. The implementation of a generalised form of the algorithm with non-integer time step ratios is presented. (C) 1997 by John Wiley & Sons, Ltd.

The subcycled Newmark algorithm

The popular Newmark algorithm, used for implicit direct integration of structural dynamics, is extended by means of a nodal partition to permit use of different timesteps in different regions of a structural model. The algorithm developed has as a special case an explicit-explicit subcycling algorithm previously reported by Belytschko, Yen and Mullen. That algorithm has been shown, in the absence of damping or other energy dissipation, to exhibit instability over narrow timestep ranges that become narrower as the number of degrees of freedom increases, making them unlikely to be encountered in practice. The present algorithm avoids such instabilities in the case of a one to two timestep ratio (two subcycles), achieving unconditional stability in an exponential sense for a linear problem. However, with three or more subcycles, the trapezoidal rule exhibits stability that becomes conditional, falling towards that of the central difference method as the number of subcycles increases. Instabilities over narrow timestep ranges, that become narrower as the model size increases, also appear with three or more subcycles. However by moving the partition between timesteps one row of elements into the region suitable for integration with the larger timestep these the unstable timestep ranges become extremely narrow, even in simple systems with a few degrees of freedom. As well, accuracy is improved. Use of a version of the Newmark algorithm that dissipates high frequencies minimises or eliminates these narrow bands of instability. Viscous damping is also shown to remove these instabilities, at the expense of having more effect on the low frequency response.

Simulated-annealing-based genetic algorithm for modeling the optical constants of solids

We propose a simulated-annealing-based genetic algorithm for solving model parameter estimation problems. The algorithm incorporates advantages of both genetic algorithms and simulated annealing. Tests on computer-generated synthetic data that closely resemble optical constants of a metal were performed to compare the efficiency of plain genetic algorithms against the simulated-annealing-based genetic algorithms. These tests assess the ability of the algorithms to and the global minimum and the accuracy of values obtained for model parameters. Finally, the algorithm with the best performance is used to fit the model dielectric function to data for platinum and aluminum. (C) 1997 Optical Society of America.

Assessment of immediate conservative breast surgery reconstruction: A classification system of defects revisited and an algorithm for selecting the appropriate technique

Background: Although various techniques have been used for breast conservation surgery reconstruction, there are few studies describing a logical approach to reconstruction of these defects. The objectives of this study were to establish a classification system for partial breast defects and to develop a reconstructive algorithm. Methods: The authors reviewed a 7-year experience with 209 immediate breast conservation surgery reconstructions. Mean follow-up was 31 months. Type I defects include tissue resection in smaller breasts (bra size A/B), including type IA, which involves minimal defects that do not cause distortion; type III, which involves moderate defects that cause moderate distortion; and type IC, which involves large defects that cause significant deformities. Type II includes tissue resection in medium-sized breasts with or without ptosis (bra size C), and type III includes tissue resection in large breasts with ptosis (bra size D). Results: Eighteen percent of patients presented type I, where a lateral thoracodorsal flap and a latissimus dorsi flap were performed in 68 percent. Forty-five percent presented type II defects, where bilateral mastopexy was performed in 52 percent. Thirty-seven percent of patients presented type III distortion, where bilateral reduction mammaplasty was performed in 67 percent. Thirty-five percent of patients presented complications, and most were minor. Conclusions: An algorithm based on breast size in relation to tumor location and extension of resection can be followed to determine the best approach to reconstruction. The authors` results have demonstrated that the complications were similar to those in other clinical series. Success depends on patient selection, coordinated planning with the oncologic surgeon, and careful intraoperative management.

Geometric and electronic information from the spectroscopy of six-coordinate copper(II) compounds

The ground and excited state geometry of the six-coordinate copper(II) ion is examined in detail using the CuF64- and Cu(H2O)(6)(2+) complexes as examples. A variety of spectroscopic techniques are used to illustrate the relations between the geometric and electronic properties of these complexes through the characterization of their potential energy surfaces.