The fine structure of (v, 3) directed triple systems: v equivalent to 2 (mod 3)

The fine structure of a directed triple system of index lambda is the vector (c(1), c(2),...,C-lambda), where c(i) is the number of directed triples appearing precisely i times in the system. We determine necessary and sufficient conditions for a vector to be the fine structure of a directed triple system of index 3 for upsilon = 2 (mod 3).

Directed evolution of mammalian cytochrome P450 enzymes involved in xenobiotic metabolism

Directed evolution of cytochrome P450 enzymes represents an attractive means of generating novel catalysts for specialized applications. Xenobiotic-metabolizing P450s are particularly well suited to this approach due to their inherent wide substrate specificity. In the present study, a novel method for DNA shuffling was developed using an initial restriction enzyme digestion step, followed by elimination of long parental sequences by size-selective filtration. P450 2C forms were subjected to a single round of shuffling then coexpressed with reductase in E. coli. A sample (54 clones) of the resultant library was assessed for sequence diversity, hemo- and apoprotein expression, and activity towards the substrate indole. All mutants showed a different RFLP pattern compared to all parents, suggesting that the library was free from contamination by parental forms. Haemoprotein expression was detectable in 45/54 (83%) of the mutants sampled. Indigo production was less than or comparable to the activities of one or more of the parental P450s, but three mutants showed indirubin production in excess of that seen with any parental form, representing a gain of function. In conclusion, a method is presented for the effective shuffling of P450 sequences to generate diverse libraries of mutant P450s containing a high proportion of correctly folded hemoprotein, and minimal contamination with parental forms.

Site-directed mutagenesis of dimethylsulfoxide reductase from Rhodobacter capsulatus: The critical roles of tyrosine-114 and tryptophan-116

The crystal structure of six functionally-distinct enzymes of the DMSO reductase family of molybdenum enzymes has revealed that the tertiary structure of the polypeptide that binds the bis(MGD)Mo cofactor is highly conserved. Differences in the catalytic properties of enzymes of this family are almost certainly dependent upon differences in the structure ofthe MO active site. In DMSO reductase from Rhodobacter species tryptophan- 116 (W 116) hydrogen-bonds to an 0x0 group coordinated to the MO ion. In addition a second amino acid side chain from tyrosine-114 (Y 114) is in close proximity to the 0x0 group. We have investigated the role of Y 114 and W 116 in DMSO reductase using site-directed mutagenesis,

Snakes and kittens in the grass: No evidence for preferential processing of fear-relevant animals in visual search

Ohman and colleagues provided evidence for preferential processing of pictures depicting fear-relevant animals by showing that pictures of snakes and spiders are found faster among pictures of fiowers and mushrooms than vice versa and that the speed of detecting fear-relevant animals was not affected by set size whereas the speed of detecting fiowers/mushrooms was. Experiment 1 replicated this finding. Experiment 2, however, found similar search advantages when pictures of cats and horses or of wolves and big cats were to be found among pictures of flowers and mushrooms. Moreover, Experiment 3, in a within subject comparison, failed to find faster identification of snakes and spiders than of cats and horses among flowers and mushrooms. The present findings seem to indicate that previous reports of preferential processing of pictures of snakes and spiders in a visual search task may reflect a processing advantage for animal pictures in general rather than fear-relevance.

2-perfect directed m-cycle systems can be equationally defined for m=3,4, and 5 only

It is shown that quasigroups constructed using the standard construction from 2-perfect directed m-cycle systems are precisely the finite members of a variety if and only if m=3, 4 or 5.

Self-Directed Behavioral Family Intervention for Parents of Oppositional Children in Rural and Remote Areas

Twenty-four parents of oppositional preschoolers were randomly assigned to either a self-directed behavioral family intervention condition (SD) or to a waitlist control group (WL). The self-directed parent training program based on self-regulation principles, consisted of a written information package and weekly telephone consultations for 10 weeks. At posttest, in comparison to the WL group, children in the SD group had lower levels of behavior problems on parent report measures of child behavior. At posttreatment, parents in the SD condition reported increased levels of parenting competence and lower levels of dysfunctional parenting practices as compared to parents in the WL condition. In addition, mothers reported lower levels of anxiety, depression, and stress as compared to mothers in the WL condition at posttreatment. Using mother's reports, gains in child behavior and parenting practices achieved at posttreatment were maintained at 4-month follow-up.

The application of adaptive partitioned random search in feature selection problem

Feature selection is one of important and frequently used techniques in data preprocessing. It can improve the efficiency and the effectiveness of data mining by reducing the dimensions of feature space and removing the irrelevant and redundant information. Feature selection can be viewed as a global optimization problem of finding a minimum set of M relevant features that describes the dataset as well as the original N attributes. In this paper, we apply the adaptive partitioned random search strategy into our feature selection algorithm. Under this search strategy, the partition structure and evaluation function is proposed for feature selection problem. This algorithm ensures the global optimal solution in theory and avoids complete randomness in search direction. The good property of our algorithm is shown through the theoretical analysis.

Asymmetric page split generalized index search trees for formal concept analysis

Formal Concept Analysis is an unsupervised machine learning technique that has successfully been applied to document organisation by considering documents as objects and keywords as attributes. The basic algorithms of Formal Concept Analysis then allow an intelligent information retrieval system to cluster documents according to keyword views. This paper investigates the scalability of this idea. In particular we present the results of applying spatial data structures to large datasets in formal concept analysis. Our experiments are motivated by the application of the Formal Concept Analysis idea of a virtual filesystem [11,17,15]. In particular the libferris [1] Semantic File System. This paper presents customizations to an RD-Tree Generalized Index Search Tree based index structure to better support the application of Formal Concept Analysis to large data sources.

Feasibility of an evidence-based literature search service for general practitioners

Objective: To test the feasibility of an evidence-based clinical literature search service to help answer general practitioners' (GPs') clinical questions. Design: Two search services supplied GPs who submitted questions with the best available empirical evidence to answer these questions. The GPs provided feedback on the value of the service, and concordance of answers from the two search services was assessed. Setting: Two literature search services (Queensland and Victoria), operating for nine months from February 1999. Main outcome measures: Use of the service; time taken to locate answers; availability of evidence; value of the service to GPs; and consistency of answers from the two services. Results: 58 GPs asked 160 questions (29 asked one, 11 asked five or more). The questions concerned treatment (65%), aetiology (17%), prognosis (13%), and diagnosis (5%). Answering a question took a mean of 3 hours 32 minutes of personnel time (95% Cl, 2.67-3.97); nine questions took longer than 10 hours each to answer, the longest taking 23 hours 30 minutes. Evidence of suitable quality to provide a sound answer was available for 126 (79%) questions. Feedback data for 84 (53%) questions, provided by 42 GPs, showed that they appreciated the service, and asking the questions changed clinical care. There were many minor differences between the answers from the two centres, and substantial differences in the evidence found for 4/14 questions. However, conclusions reached were largely similar, with no or only minor differences for all questions. Conclusions: It is feasible to provide a literature search service, but further assessment is needed to establish its cost effectiveness.