On the relative complexity of labelled modal tableaux

We investigate the relative complexity of two free-variable labelled modal tableaux(KEM and Single Step Tableaux, SST). We discuss the reasons why p-simulation is not a proper measure of the relative complexity of tableaux-like proof systems, and we propose an improved comparison scale (p-search-simulation). Finally we show that KEM p-search-simulates SST while SST cannot p-search-simulate KEM.

Growing semiconductor nanocrystals directly in a conducting polymer

We describe a single step method to synthesise lead sulphide (PbS) nanocrystals directly in the conjugated polymer poly (2-methoxy-5-(2'-ethyl-hexyloxy)-p-phenylene vinylene) (MEH-PPV). This method allows size control of the nanocrystal via co-solvent ratios. We find good agreement between nanocrystal sizes determined by transmission electron microscopy and sizes theoretically determined from the absorption edge of the nanocrystals. Finally we show that this synthesis technique is not restricted to MEH-PPV and demonstrate that nanocrystals can be grown in Poly(3-hexylthiophene-2,5-diyl) (P3HT). (C) 2005 Elsevier B.V. All rights reserved.

Mechanisms of acetohydroxyacid synthases

Acetohydroxyacid synthases are thiamin diphosphate- (ThDP-) dependent biosynthetic enzymes found in all autotrophic organisms. Over the past 4-5 years, their mechanisms have been clarified and illuminated by protein crystallography, engineered mutagenesis and detailed single-step kinetic analysis. Pairs of catalytic subunits form an intimate dimer containing two active sites, each of which lies across a dimer interface and involves both monomers. The ThDP adducts of pyruvate, acetaldehyde and the product acetohydroxyacids can be detected quantitatively after rapid quenching. Determination of the distribution of intermediates by NMR then makes it possible to calculate individual forward unimolecular rate constants. The enzyme is the target of several herbicides and structures of inhibitor-enzyme complexes explain the herbicide-enzyme interaction.

The production of male of-only offspring in beef cattle - a proof of principle project

The Australian beef industry places the greatest value in bulls, in comparison to cows, for prime beef production. Male carcasses can be sold for a larger profit due to their increased muscle mass. This project aims to demonstrate the feasibility of producing male animals that can sire male only offspring, through a transgenic approach in mice that could later be translated into livestock production systems. The mouse Sry (Sex determining region on the Y) gene has been shown to provide the initiating molecular signal leading to male sex determination in mammals. Sry has also been shown to cause sex reversal in XX mice transgenic for the gene. In this project Sry will be targeted to a locus not subject to X-inactivation on the X chromosome of XY mice. These mice will be bred to determine how the transgene is passed on, to determine expression of the transgene, and to assess its activity in causing XX sex reversal. The male mice transgenic for the Sry gene on their X chromosome will be produced using tetraploid aggregation, which in a single step produces 100% ES cell derived embryos. The same target locus can later be used to introduce the bovine SRY gene onto the X chromosome of bovidae species and using germ cell transplantation produce sex reversed animals. This would bypass the need for expensive chimera crosses and provide farmers with a stud bull capable of producing only sons.

Expansion-based algorithms for finding single pair shortest path on surface

Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path planning system, and surface nearest neighbor query in spatial database, etc. Currently, to solve the problem, existing algorithms must traverse the entire polyhedral surface. With the rapid advance in areas like Global Positioning System (CPS), Computer Aided Design (CAD) systems and laser range scanner, surface models axe becoming more and more complex. It is not uncommon that a surface model contains millions of polygons. The single pair shortest path problem is getting harder and harder to solve. Based on the observation that the single pair shortest path is in the locality, we propose in this paper efficient methods by excluding part of the surface model without considering them in the search process. Three novel expansion-based algorithms are proposed, namely, Naive algorithm, Rectangle-based Algorithm and Ellipse-based Algorithm. Each algorithm uses a two-step approach to find the shortest path. (1) compute an initial local path. (2) use the value of this initial path to select a search region, in which the global shortest path exists. The search process terminates once the global optimum criteria are satisfied. By reducing the searching region, the performance is improved dramatically in most cases.