The gap equations for spin singlet and triplet ferromagnetic superconductors

We derive gap equations for superconductivity in coexistence with ferromagnetism. We treat singlet and triplet states With either equal spin pairing (ESP) or opposite spin pairing (OSP) states, and study the behaviour of these states as a function of exchange splitting. For the s-wave singlet state we find that our gap equations correctly reproduce the Clogston-Chandrasekhar limiting behaviour and the phase diagram of the Baltensperger-Sarma equation (excluding the FFLO region). The singlet superconducting order parameter is shown to be independent of exchange splitting at zero temperature, as is assumed in the derivation of the Clogston-Chandrasekhar limit. P-wave triplet states of the OSP type behave similarly to the singlet state as a function of exchange splitting. On the other hand, ESP triplet states show a very different behaviour. In particular, there is no Clogston-Chandrasekhar limiting and the superconducting critical temperature, T-C, is actually increased by exchange splitting.

The rearrangements of naphthyinitrenes: UV/Vis and IR spectra of azirines, cyclic ketenimines, and cyclic nitrile ylides

Ar matrix photolysis of 1- and 2-naphthyl azides 3 and 4 at 313 nm initially affords the singlet naphthyl nitrenes, (1)1 and (1)2. Relaxation to the corresponding lower energy, persistent triplet nitrenes (3)1 and (3)2 competes with cyclization to the azirines 15 and 18, which can also be formed photochemically from the triplet nitrenes. On prolonged irradiation, the azirines can be converted to the seven-membered cyclic ketenimines 10 and 13, respectively, as described earlier by Dunkin and Thomson. However, instead of the o-quinoid ketenimines 16 and 19, which are the expected primary ring-opening products of azirines 15 and 18, respectively, we observed their novel bond-shift isomers 17 and 20, which may be formally regarded as cyclic nitrile ylides. The existence of such ylidic heterocumulenes has been predicted previously, but this work provides the first experimental observation of such species. The factors which are responsible for the special stability of the ylidic species 17 and 20 are discussed.

Seronegative spondyloarthropathies: To lump or split?

The advent of novel biological therapies for the treatment of rheumatic disease has renewed interest in the seronegative spondyloarthropathies (SpAs). International efforts are redefining disease classification and measures of disease activity, outcome, metrology, and imaging. However, opinion is divided between those who propose that the SpA group represents the same disease with variable expression (the lumpers) and those who consider these to be separate diseases with shared clinical features (the splitters). This review presents the evidence for both approaches.

Sensor scheduling in electronic support using Markov chains

In electronic support, receivers must maintain surveillance over the very wide portion of the electromagnetic spectrum in which threat emitters operate. A common approach is to use a receiver with a relatively narrow bandwidth that sweeps its centre frequency over the threat bandwidth to search for emitters. The sequence and timing of changes in the centre frequency constitute a search strategy. The search can be expedited, if there is intelligence about the operational parameters of the emitters that are likely to be found. However, it can happen that the intelligence is deficient, untrustworthy or absent. In this case, what is the best search strategy to use? A random search strategy based on a continuous-time Markov chain (CTMC) is proposed. When the search is conducted for emitters with a periodic scan, it is shown that there is an optimal configuration for the CTMC. It is optimal in the sense that the expected time to intercept an emitter approaches linearity most quickly with respect to the emitter's scan period. A fast and smooth approach to linearity is important, as other strategies can exhibit considerable and abrupt variations in the intercept time as a function of scan period. In theory and numerical examples, the optimum CTMC strategy is compared with other strategies to demonstrate its superior properties.

Modelling trickle irrigation: Comparison of analytical and numerical models for estimation of wetting front position with time

Irrigation practices that are profligate in their use of water have come under closer scrutiny by water managers and the public. Trickle irrigation has the propensity to increase water use efficiency but only if the system is designed to meet the soil and plant conditions. Recently we have provided a software tool, WetUp (http://www.clw.csiro.au/products/wetup/), to calculate the wetting patterns from trickle irrigation emitters. WetUp uses an analytical solution to calculate the wetted perimeter for both buried and surface emitters. This analytical solution has a number of assumptions, two of which are that the wetting front is defined by water content at which the hydraulic conductivity (K) is I mm day(-1) and that the flow occurs from a point source. Here we compare the wetting patterns calculated with a 2-dimensional numerical model, HYDRUS2D, for solving the water flow into typical soils with the analytical solution. The results show that the wetting patterns are similar, except when the soil properties result in the assumption of a point source no longer being a good description of the flow regime. Difficulties were also experienced with getting stable solutions with HYDRUS2D for soils with low hydraulic conductivities. (c) 2005 Elsevier Ltd. All rights reserved.

Towards effective indexing for very large video sequence database

With rapid advances in video processing technologies and ever fast increments in network bandwidth, the popularity of video content publishing and sharing has made similarity search an indispensable operation to retrieve videos of user interests. The video similarity is usually measured by the percentage of similar frames shared by two video sequences, and each frame is typically represented as a high-dimensional feature vector. Unfortunately, high complexity of video content has posed the following major challenges for fast retrieval: (a) effective and compact video representations, (b) efficient similarity measurements, and (c) efficient indexing on the compact representations. In this paper, we propose a number of methods to achieve fast similarity search for very large video database. First, each video sequence is summarized into a small number of clusters, each of which contains similar frames and is represented by a novel compact model called Video Triplet (ViTri). ViTri models a cluster as a tightly bounded hypersphere described by its position, radius, and density. The ViTri similarity is measured by the volume of intersection between two hyperspheres multiplying the minimal density, i.e., the estimated number of similar frames shared by two clusters. The total number of similar frames is then estimated to derive the overall similarity between two video sequences. Hence the time complexity of video similarity measure can be reduced greatly. To further reduce the number of similarity computations on ViTris, we introduce a new one dimensional transformation technique which rotates and shifts the original axis system using PCA in such a way that the original inter-distance between two high-dimensional vectors can be maximally retained after mapping. An efficient B+-tree is then built on the transformed one dimensional values of ViTris' positions. Such a transformation enables B+-tree to achieve its optimal performance by quickly filtering a large portion of non-similar ViTris. Our extensive experiments on real large video datasets prove the effectiveness of our proposals that outperform existing methods significantly.