Indefinite determiner introducing definite referent: a special use of 'yi 'one' + classifier' in Chinese

The indefinite determiner yi 'one'+ classifier' is the most approximate to an indefinite article, like the English a, in Chinese. It serves all the functions characteristic of representative stages of grammaticalization from a numeral to a generalized indefinite determiner as elaborated in the literature. It is established in this paper that the Chinese indefinite determiner has developed a special use with definite expressions, serving as a backgrounding device marking entities as of low thematic importance and unlikely to receive subsequent mentions in ensuing discourse. 'yi+ classifier' in the special use with definite expressions displays striking similarities in terms of semantic bleaching and phonological reduction with the same determiner at the advanced stage of grammaticalization characterized by uses with generics, nonspecifics and nonreferentials. An explanation is offered in terms of an implicational relation between nonreferentiality and low thematic importance which characterize the two uses of the indefinite determiner. While providing another piece of evidence in support of the claim that semantically nonreferentials and entities of low thematic importance tend to be encoded in terms of same linguistic devices in language, findings in this paper have shown how an indefinite determiner can undergo a higher degree of grammaticalization than has been reported in the literature-it expands its scope to mark not only indefinite but also definite expressions as semantically nonreferential and/or thematically unimportant. (C) 2003 Elsevier B.V. All rights reserved.

Gene-expression profiling reveals distinct expression patterns for classic versus variant Merkel cell phenotypes and new classifier genes to distinguish Merkel cell from small-cell lung carcinoma

Merkel cell carcinoma (MCC) is a rare aggressive skin tumor which shares histopathological and genetic features with small-cell lung carcinoma (SCLC), both are of neuroendocrine origin. Comparable to SCLC, MCC cell lines are classified into two different biochemical subgroups designated as 'Classic' and 'Variant'. With the aim to identify typical gene-expression signatures associated with these phenotypically different MCC cell lines subgroups and to search for differentially expressed genes between MCC and SCLC, we used cDNA arrays to pro. le 10 MCC cell lines and four SCLC cell lines. Using significance analysis of microarrays, we defined a set of 76 differentially expressed genes that allowed unequivocal identification of Classic and Variant MCC subgroups. We assume that the differential expression levels of some of these genes reflect, analogous to SCLC, the different biological and clinical properties of Classic and Variant MCC phenotypes. Therefore, they may serve as useful prognostic markers and potential targets for the development of new therapeutic interventions specific for each subgroup. Moreover, our analysis identified 17 powerful classifier genes capable of discriminating MCC from SCLC. Real-time quantitative RT-PCR analysis of these genes on 26 additional MCC and SCLC samples confirmed their diagnostic classification potential, opening opportunities for new investigations into these aggressive cancers.

A Lanczos-powered implementation of the Faber polynomial quantum time propagator for reaction probabilities

Complementing our recent work on subspace wavepacket propagation [Chem. Phys. Lett. 336 (2001) 149], we introduce a Lanczos-based implementation of the Faber polynomial quantum long-time propagator. The original version [J. Chem. Phys. 101 (1994) 10493] implicitly handles non-Hermitian Hamiltonians, that is, those perturbed by imaginary absorbing potentials to handle unwanted reflection effects. However, like many wavepacket propagation schemes, it encounters a bottleneck associated with dense matrix-vector multiplications. Our implementation seeks to reduce the quantity of such costly operations without sacrificing numerical accuracy. For some benchmark scattering problems, our approach compares favourably with the original. (C) 2004 Elsevier B.V. All rights reserved.

Quantum computing and polynomial equations over the finite field Z(2)

What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily computed set of polynomials defined over the finite field Z(2). This connection allows simple proofs to be given for two known relationships between quantum and classical complexity classes, namely BQP subset of P-#P and BQP subset of PP.

On the multicomponent polynomial solution models

The present study addresses the problem of predicting the properties of multicomponent systems from those of corresponding binary systems. Two types of multicomponent polynomial models have been analysed. A probabilistic interpretation of the parameters of the Polynomial model, which explicitly relates them with the Gibbs free energies of the generalised quasichemical reactions, is proposed. The presented treatment provides a theoretical justification for such parameters. A methodology of estimating the ternary interaction parameter from the binary ones is presented. The methodology provides a way in which the power series multicomponent models, where no projection is required, could be incorporated into the Calphad approach.

Boosting the tree augmented naive bayes classifier

The Tree Augmented Naïve Bayes (TAN) classifier relaxes the sweeping independence assumptions of the Naïve Bayes approach by taking account of conditional probabilities. It does this in a limited sense, by incorporating the conditional probability of each attribute given the class and (at most) one other attribute. The method of boosting has previously proven very effective in improving the performance of Naïve Bayes classifiers and in this paper, we investigate its effectiveness on application to the TAN classifier.

Tuning pattern classifier parameters using a genetic algorithm with an application in mobile robotics

Support vector machines (SVMs) have recently emerged as a powerful technique for solving problems in pattern classification and regression. Best performance is obtained from the SVM its parameters have their values optimally set. In practice, good parameter settings are usually obtained by a lengthy process of trial and error. This paper describes the use of genetic algorithm to evolve these parameter settings for an application in mobile robotics.