Orthogonal space-time block coding over time-selective fading channels: a PIC detector for the Gi systems

All the orthogonal space-time block coding (O-STBC) schemes are based on the following assumption: the channel remains static over the entire length of the codeword. However, time selective fading channels do exist, and in many cases the conventional O-STBC detectors can suffer from a large error floor in the high signal-to-noise ratio (SNR) cases. This paper addresses such an issue by introducing a parallel interference cancellation (PIC) based detector for the Gi coded systems (i=3 and 4).

Characterisation of soils containing naturally occurring radioactive material (NORM) using in situ and rapid laboratory techniques. Case study: South Terras, Cornwall

In situ analysis has become increasingly important for contaminated land investigation and remediation. At present, portable techniques are used mainly as scanning tools to assess the spread and magnitude of the contamination, and are an adjunct to conventional laboratory analyses. A site in Cornwall, containing naturally occurring radioactive material (NORM), provided an opportunity for Reading University PhD student Anna Kutner to compare analytical data collected in situ with data generated by laboratory-based methods. The preliminary results in this paper extend the author‟s poster presentation at last September‟s GeoSpec2010 conference held in Lancaster.

Using zero-norm constraint for sparse probability density function estimation

A new sparse kernel probability density function (pdf) estimator based on zero-norm constraint is constructed using the classical Parzen window (PW) estimate as the target function. The so-called zero-norm of the parameters is used in order to achieve enhanced model sparsity, and it is suggested to minimize an approximate function of the zero-norm. It is shown that under certain condition, the kernel weights of the proposed pdf estimator based on the zero-norm approximation can be updated using the multiplicative nonnegative quadratic programming algorithm. Numerical examples are employed to demonstrate the efficacy of the proposed approach.

Minimum norm regularization of descriptor systems by mixed output feedback

We study the regularization problem for linear, constant coefficient descriptor systems Ex' = Ax+Bu, y1 = Cx, y2 = Γx' by proportional and derivative mixed output feedback. Necessary and sufficient conditions are given, which guarantee that there exist output feedbacks such that the closed-loop system is regular, has index at most one and E+BGΓ has a desired rank, i.e., there is a desired number of differential and algebraic equations. To resolve the freedom in the choice of the feedback matrices we then discuss how to obtain the desired regularizing feedback of minimum norm and show that this approach leads to useful results in the sense of robustness only if the rank of E is decreased. Numerical procedures are derived to construct the desired feedback gains. These numerical procedures are based on orthogonal matrix transformations which can be implemented in a numerically stable way.

Construction of a Festuca pratensis BAC library for map-based cloning in Festulolium substitution lines

Introgression in Festulolium is a potentially powerful tool to isolate genes for a large number of traits which differ between Festuca pratensis Huds. and Lolium perenne L. Not only are hybrids between the two species fertile, but the two genomes can be distinguished by genomic in situ hybridisation and a high frequency of recombination occurs between homoeologous chromosomes and chromosome segments. By a programme of introgression and a series of backcrosses, L. perenne lines have been produced which contain small F. pratensis substitutions. This material is a rich source of polymorphic markers targeted towards any trait carried on the F. pratensis substitution not observed in the L. perenne background. We describe here the construction of an F. pratensis BAC library, which establishes the basis of a map-based cloning strategy in L. perenne. The library contains 49,152 clones, with an average insert size of 112 kbp, providing coverage of 2.5 haploid genome equivalents. We have screened the library for eight amplified fragment length polymorphism (AFLP) derived markers known to be linked to an F. pratensis gene introgressed into L. perenne and conferring a staygreen phenotype as a consequence of a mutation in primary chlorophyll catabolism. While for four of the markers it was possible to identify bacterial artificial chromosome (BAC) clones, the other four AFLPs were too repetitive to enable reliable identification of locus-specific BACs. Moreover, when the four BACs were partially sequenced, no obvious coding regions could be identified. This contrasted to BACs identified using cDNA sequences, when multiple genes were identified on the same BAC.

Multi-agent based modeling and simulation of complex system in hospital

This study puts forward a method to model and simulate the complex system of hospital on the basis of multi-agent technology. The formation of the agents of hospitals with intelligent and coordinative characteristics was designed, the message object was defined, and the model operating mechanism of autonomous activities and coordination mechanism was also designed. In addition, the Ontology library and Norm library etc. were introduced using semiotic method and theory, to enlarge the method of system modelling. Swarm was used to develop the multi-agent based simulation system, which is favorable for making guidelines for hospital's improving it's organization and management, optimizing the working procedure, improving the quality of medical care as well as reducing medical charge costs.

Joint multiple dictionary learning for tensor sparse coding

Traditional dictionary learning algorithms are used for finding a sparse representation on high dimensional data by transforming samples into a one-dimensional (1D) vector. This 1D model loses the inherent spatial structure property of data. An alternative solution is to employ Tensor Decomposition for dictionary learning on their original structural form —a tensor— by learning multiple dictionaries along each mode and the corresponding sparse representation in respect to the Kronecker product of these dictionaries. To learn tensor dictionaries along each mode, all the existing methods update each dictionary iteratively in an alternating manner. Because atoms from each mode dictionary jointly make contributions to the sparsity of tensor, existing works ignore atoms correlations between different mode dictionaries by treating each mode dictionary independently. In this paper, we propose a joint multiple dictionary learning method for tensor sparse coding, which explores atom correlations for sparse representation and updates multiple atoms from each mode dictionary simultaneously. In this algorithm, the Frequent-Pattern Tree (FP-tree) mining algorithm is employed to exploit frequent atom patterns in the sparse representation. Inspired by the idea of K-SVD, we develop a new dictionary update method that jointly updates elements in each pattern. Experimental results demonstrate our method outperforms other tensor based dictionary learning algorithms.