Clinical and molecular characteristics of hereditary non-polyposis colorectal cancer families in Southeast Asia

Hereditary non-polyposis colorectal cancer (HNPCC), predominantly due to germline MLH1/MSH2 mutations, is the commonest form of hereditary colorectal cancer (CRC), but data in Asians are sparse. We sequenced the MLH1/MSH2 coding and promoter core regions in CRC patients diagnosed below age 40, and/or with multiple primary cancers or familial cancer clustering suggestive of HNPCC, and correlated deleterious mutations with clinical and tumour features. Forty-six Chinese, Malay and Indian kindreds participated. Of the 153 cancers reported in the 46 kindreds, stomach (14%) and urogenital cancers (13%) were the most common extracolonic cancers, whereas endometrial cancer comprised only 7%. Eleven different MLH1 and 12 MSH2 mutations were identified, including nine novel and four recurring mutations in the Chinese. One Indian was a compound heterozygote for an MLH1 and MSH2 mutation. The MLH1/MSH2 mutation data in the Malays and the Indians represents the first in these ethnic groups. Factors strongly associated with deleterious mutations were the Amsterdam criteria, family history of stomach or multiple primary cancers, and MSI-high tumours, whereas family history of endometrial cancer and young cancer age alone correlated poorly. Distinct clinical and molecular characteristics were identified among Asian HNPCC kindreds and may have important clinical implications.

Dynamic evolution of the genetic search region through fuzzy coding

A technique for automatic exploration of the genetic search region through fuzzy coding (Sharma and Irwin, 2003) has been proposed. Fuzzy coding (FC) provides the value of a variable on the basis of the optimum number of selected fuzzy sets and their effectiveness in terms of degree-of-membership. It is an indirect encoding method and has been shown to perform better than other conventional binary, Gray and floating-point encoding methods. However, the static range of the membership functions is a major problem in fuzzy coding, resulting in longer times to arrive at an optimum solution in large or complicated search spaces. This paper proposes a new algorithm, called fuzzy coding with a dynamic range (FCDR), which dynamically allocates the range of the variables to evolve an effective search region, thereby achieving faster convergence. Results are presented for two benchmark optimisation problems, and also for a case study involving neural identification of a highly non-linear pH neutralisation process from experimental data. It is shown that dynamic exploration of the genetic search region is effective for parameter optimisation in problems where the search space is complicated.

Deep sequencing reveals predominant expression of miR-21 amongst the small non-coding RNAs in retinal microvascular endothelial cells

The retinal vascular endothelium is essential for angiogenesis and is involved in maintaining barrier selectivity and vascular tone. The aim of this study was to identify and quantify microRNAs and other small regulatory non-coding RNAs (ncRNAs) which may regulate these crucial functions. Primary bovine retinal microvascular endothelial cells (RMECs) provide a well-characterized in vitro system for studying angiogenesis. RNA extracted from RMECs was used to prepare a small RNA library for deep sequencing (Illumina Genome Analyzer). A total of 6.8 million reads were mapped to 250 known microRNAs in miRBase (release 16). In many cases, the most frequent isomiR differed from the sequence reported in miRBase. In addition, five novel microRNAs, 13 novel bovine orthologs of known human microRNAs and multiple new members of the miR-2284/2285 family were detected. Several similar to 30 nucleotide sno-miRNAs were identified, with the most highly expressed being derived from snoRNA U78. Highly expressed microRNAs previously associated with endothelial cells included miR-126 and miR-378, but the most highly expressed was miR-21, comprising more than one-third of all mapped reads. Inhibition of miR-21 with an LNA inhibitor significantly reduced proliferation, migration, and tube-forming capacity of RMECs. The independence from prior sequence knowledge provided by deep sequencing facilitates analysis of novel microRNAs and other small RNAs. This approach also enables quantitative evaluation of microRNA expression, which has highlighted the predominance of a small number of microRNAs in RMECs. Knockdown of miR-21 suggests a role for this microRNA in regulation of angiogenesis in the retinal microvasculature. J. Cell. Biochem. 113: 20982111, 2012. (C) 2012 Wiley Periodicals, Inc.

Joint complex diversity coding and channel coding over space, time and frequency

This study provides a general diversity analysis for joint complex diversity coding (CDC) and channel coding-based space-time-frequency codeing is provided. The mapping designs from channel coding to CDC are crucial for efficient exploitation of the diversity potential. This study provides and proves a sufficient condition of full diversity construction with joint three-dimensional CDC and channel coding, bit-interleaved coded complex diversity coding and symbol-interleaved coded complex diversity coding. Both non-iterative and iterative detections of joint channel code and CDC transmission are investigated. The proposed minimum mean-square error-based iterative soft decoding achieves the performance of the soft sphere decoding with reduced complexity.

Robust visual tracking based on online learning sparse representation

Handling appearance variations is a very challenging problem for visual tracking. Existing methods usually solve this problem by relying on an effective appearance model with two features: (1) being capable of discriminating the tracked target from its background, (2) being robust to the target's appearance variations during tracking. Instead of integrating the two requirements into the appearance model, in this paper, we propose a tracking method that deals with these problems separately based on sparse representation in a particle filter framework. Each target candidate defined by a particle is linearly represented by the target and background templates with an additive representation error. Discriminating the target from its background is achieved by activating the target templates or the background templates in the linear system in a competitive manner. The target's appearance variations are directly modeled as the representation error. An online algorithm is used to learn the basis functions that sparsely span the representation error. The linear system is solved via ℓ1 minimization. The candidate with the smallest reconstruction error using the target templates is selected as the tracking result. We test the proposed approach using four sequences with heavy occlusions, large pose variations, drastic illumination changes and low foreground-background contrast. The proposed approach shows excellent performance in comparison with two latest state-of-the-art trackers.

A sequential algorithm for sparse support vector classifiers

Support vector machines (SVMs), though accurate, are not preferred in applications requiring high classification speed or when deployed in systems of limited computational resources, due to the large number of support vectors involved in the model. To overcome this problem we have devised a primal SVM method with the following properties: (1) it solves for the SVM representation without the need to invoke the representer theorem, (2) forward and backward selections are combined to approach the final globally optimal solution, and (3) a criterion is introduced for identification of support vectors leading to a much reduced support vector set. In addition to introducing this method the paper analyzes the complexity of the algorithm and presents test results on three public benchmark problems and a human activity recognition application. These applications demonstrate the effectiveness and efficiency of the proposed algorithm.


--------------------------------------------------------------------------------

Systolic array system for vector quantization using transformed sub-band coding.

The use of bit-level systolic arrays in the design of a vector quantized transformed subband coding system for speech signals is described. It is shown how the major components of this system can be decomposed into a small number of highly regular building blocks that interface directly to one another. These include circuits for the computation of the discrete cosine transform, the inverse discrete cosine transform, and vector quantization codebook search.

Application of artificial neural network techniques to low bit-rate speech coding

Research has been undertaken to investigate the use of artificial neural network (ANN) techniques to improve the performance of a low bit-rate vector transform coder. Considerable improvements in the perceptual quality of the coded speech have been obtained. New ANN-based methods for vector quantiser (VQ) design and for the adaptive updating of VQ codebook are introduced for use in speech coding applications.