Lee, T 2003, 'Arithmetical definability over finite structures', Mathematical Logic Quarterly, vol. 49, no. 4, pp. 385-392.
View/Download from: Publisher's site
View description>>
AbstractArithmetical definability has been extensively studied over the natural numbers. In this paper, we take up the study of arithmetical definability over finite structures, motivated by the correspondence between uniform AC0 and FO(PLUS, TIMES). We prove finite analogs of three classic results in arithmetical definability, namely that < and TIMES can first‐order define PLUS, that < and DIVIDES can first‐order define TIMES, and that < and COPRIME can first‐order define TIMES. The first result sharpens the equivalence FO(PLUS, TIMES) =FO(BIT) to FO(<, TIMES) = FO(BIT), answering a question raised by Barrington et al. about the Crane Beach Conjecture. Together with previous results on the Crane Beach Conjecture, our results imply that FO(PLUS) is strictly less expressive than FO(<, TIMES) = FO(<, DIVIDES) = FO(<,COPRIME). In more colorful language, one could say that, for parallel computation, multiplication is harder than addition.
Li, S & Luo, M 2003, 'A negative answer to T. Kubiak's question', Fuzzy Sets and Systems, vol. 133, no. 3, pp. 407-409.
View/Download from: Publisher's site
View description>>
T. Kubiak raised in 1992 a question about Hausdorffness and compactness in L-topology. It is negatively solved in the present paper by constructing certain L-Hausdorffness and L-compactness axioms. (C) 2002 Elsevier Science B.V. All rights reserved.
Li, S & Luo, M 2003, 'FNS is not isomorphic to FTS', Fuzzy Sets and Systems, vol. 136, no. 1, pp. 127-131.
View/Download from: Publisher's site
View description>>
In this paper, we show that there are exactly c different simultaneously bireffective and bicoreflective subconstructs of FNS, in fact there exists a one-to-one correspondence between those subconstructs of FNS and open sets of (0,1). We also prove that
Li, S & Luo, M 2003, 'Generalized Lowen functors', Fuzzy Sets and Systems, vol. 133, no. 3, pp. 375-387.
View/Download from: Publisher's site
View description>>
According to their value ranges, L-topological spaces form different categories. Clearly, the investigation on their relationships is certainly important and necessary. Lowen was one of the first authors who had studied the relation between the category
Li, S & Zhang, D 2003, 'A Non-topologically Generated Hutton-lowen Uniformizable Space', Quaestiones Mathematicae, vol. 26, no. 4, pp. 471-477.
View/Download from: Publisher's site
View description>>
In this note, it is shown that there exist non-topologically generated spaces which are both Lowen uniformizable and Hutton uniformizable. On the other hand, the FNS-coreflection of the Hutton unit interval I(I) is neither Lowen uniformizable nor Hutton uniformizable.
Li, SJ & Ying, MS 2003, 'Extensionality of the RCC8 composition table', FUNDAMENTA INFORMATICAE, vol. 55, no. 3-4, pp. 363-385.
View description>>
This paper is mainly concerned with the RCC8 composition table entailed by the Region Connection Calculus (RCC), a well-known formalism for Qualitative Spatial Reasoning. This table has been independently generated by Egenhofer in the context of Geograph
Li, SJ & Ying, MS 2003, 'Region Connection Calculus: Its models and composition table', ARTIFICIAL INTELLIGENCE, vol. 145, no. 1-2, pp. 121-146.
View/Download from: Publisher's site
View description>>
Originating in Allen's analysis of temporal relations, the notion of composition table has become a key technique in providing an efficient inference mechanism for a wide class of theories in the field artificial intelligence. This paper is mainly about the consistency-based composition table (RCC8 CT) of the Region Connection Calculus (RCC) raised by Randell, Cui and Cohn. First we show each RCC model is a consistent model of the RCC8 CT. Then after an exhaustive analysis we show that no RCC model can be interpreted extensionally anyway and hence give a negative answer to a conjecture raised by Bennett. All these results are given in an `extensional RCC8 composition table, where we attach to each cell entry in the RCC8 CT a superscript to indicate in what circumstances an extensional interpretation is possible.
Nielsen, MA, Dawson, CM, Dodd, JL, Gilchrist, A, Mortimer, D, Osborne, TJ, Bremner, MJ, Harrow, AW & Hines, A 2003, 'Quantum dynamics as a physical resource', Physical Review A - Atomic, Molecular, and Optical Physics, vol. 67, no. 5, pp. 523011-5230119.
View/Download from: Publisher's site
Nielsen, MA, Dawson, CM, Dodd, JL, Gilchrist, A, Mortimer, D, Osborne, TJ, Bremner, MJ, Harrow, AW & Hines, A 2003, 'Quantum dynamics as a physical resource', PHYSICAL REVIEW A, vol. 67, no. 5.
View/Download from: Publisher's site
White, AG, Gilchrist, A, Pryde, GJ, O'Brien, JL, Bremner, MJ & Langford, NK 2003, 'Measuring Controlled-NOT and two-qubit gate operation', J.Opt.Soc.Am.B, vol. 24, no. 2, pp. 172-183.
View/Download from: Publisher's site
View description>>
Accurate characterisation of two-qubit gates will be critical for anyrealisation of quantum computation. We discuss a range of measurements aimed atcharacterising a two-qubit gate, specifically the CNOT gate. These measurementsare architecture-independent, and range from simple truth table measurements,to single figure measures such as the fringe visibility, parity, fidelity, andentanglement witnesses, through to whole-state and whole-gate measures achievedrespectively via quantum state and process tomography. In doing so, we examinecritical differences between classical and quantum gate operation.
Blumenstein, M, Verma, B & Basli, H 1970, 'A novel feature extraction technique for the recognition of segmented handwritten characters', Seventh International Conference on Document Analysis and Recognition, 2003. Proceedings., Seventh International Conference on Document Analysis and Recognition, IEEE Comput. Soc, pp. 137-141.
View/Download from: Publisher's site
View description>>
High accuracy character recognition techniques can provide useful information for segmentation-based handwritten word recognition systems. This research describes neural network-based techniques for segmented character recognition that may be applied to the segmentation and recognition components of an off-line handwritten word recognition system. Two neural architectures along with two different feature extraction techniques were investigated. A novel technique for character feature extraction is discussed and compared with others in the literature. Recognition results above 80% are reported using characters automatically segmented from the CEDAR benchmark database as well as standard CEDAR alphanumerics.
Yu Tao, Muthukkumarasamy, V, Verma, B & Blumenstein, M 1970, 'A texture extraction technique using 2D-DFT and Hamming distance', Proceedings Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003, Fifth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2003, IEEE Comput. Soc, pp. 120-125.
View/Download from: Publisher's site
View description>>
© 2003 IEEE. Texture analysis plays an increasingly important role in computer vision. Since the textural properties of images appear to carry useful information for discrimination purposes, it is important to develop significant features for texture. This paper presents a novel technique for texture extraction and classification. The proposed feature extraction technique uses 2D-DFT transformation. A combination of this technique and a Hamming Distance based neural network for classification of extracted features is investigated. The experimental results on a benchmark database and detailed analysis are presented.
