Bremner, MJ, Dodd, JL, Nielsen, MA & Bacon, D 2004, 'Fungible dynamics: There are only two types of entangling multiple-qubit interactions', PHYSICAL REVIEW A, vol. 69, no. 1.
View/Download from: Publisher's site
Devitt, SJ, Fowler, AG & Hollenberg, LCL 2004, 'Robustness of Shor's algorithm', Quant. Inf. Comp., vol. 6, no. 7, pp. 616-629.
View description>>
Shor's factorisation algorithm is a combination of classical pre- andpost-processing and a quantum period finding (QPF) subroutine which allows anexponential speed up over classical factoring algorithms. We consider thestability of this subroutine when exposed to a discrete error model that actsto perturb the computational trajectory of a quantum computer. Through detailedstate vector simulations of an appropriate quantum circuit, we show that theerror locations within the circuit itself heavily influences the probability ofsuccess of the QPF subroutine. The results also indicate that the naiveestimate of required component precision is too conservative.
Duan, R, Feng, Y & Ying, M 2004, 'An Equivalence of Entanglement-Assisted Transformation and Multiple-Copy Entanglement Transformation'.
View description>>
We examine the powers of entanglement-assisted transformation andmultiple-copy entanglement transformation. First, we find a sufficientcondition of when a given catalyst is useful in producing another specifictarget state. As an application of this condition, for any non-maximallyentangled bipartite pure state and any integer $n$ not less than 4, we are ableto explicitly construct a set of $n\times n$ quantum states which can beproduced by using the given state as a catalyst. Second, we prove that for anypositive integer $k$, entanglement-assisted transformation with $k\timesk$-dimensional catalysts is useful in producing a target state if and only ifmultiple-copy entanglement transformation with $k$ copies of state is useful inproducing the same target. Moreover, a necessary and sufficient condition forboth of them is obtained in terms of the Schmidt coefficients of the target.This equivalence of entanglement-assisted transformation and multiple-copyentanglement transformation implies many interesting properties of entanglementtransformation. Furthermore, these results are generalized to the case ofprobabilistic entanglement transformations.
Duan, RY, Ji, ZF, Feng, Y & Ying, MS 2004, 'Quantum operation quantum Fourier transform and semi-definite programming', PHYSICS LETTERS A, vol. 323, no. 1-2, pp. 48-56.
View/Download from: Publisher's site
View description>>
We analyze a class of quantum operations based on a geometrical representation of d-level quantum system (or qudit for short). A sufficient and necessary condition of complete positivity, expressed in terms of the quantum Fourier transform, is found for
Feng, Y, Duan, RY & Ying, MS 2004, 'When catalysis is useful for probabilistic entanglement transformation', PHYSICAL REVIEW A, vol. 69, no. 6, pp. 1-5.
View/Download from: Publisher's site
View description>>
We determine all 2x2 quantum states that can serve as useful catalysts for a given probabilistic entanglement transformation, in the sense that they can increase the maximal transformation probability. When higher-dimensional catalysts are considered, a
Feng, YA, Duan, RY & Ying, MS 2004, 'Unambiguous discrimination between mixed quantum states', PHYSICAL REVIEW A, vol. 70, no. 1.
View/Download from: Publisher's site
Fowler, AG, Devitt, SJ & Hollenberg, LCL 2004, 'Implementation of shor's algorithm on a linear nearest neighbour qubit array', Quantum Information and Computation, vol. 4, no. 4, pp. 237-251.
View description>>
Shor's algorithm, which given appropriate hardware can factorise an integer N in a time polynomial in its binary length L, has arguably spurred the race to build a practical quantum computer. Several different quantum circuits implementing Shor's algorithm have been designed, but each tacitly assumes that arbitrary pairs of qubits within the computer can be interacted. While some quantum computer architectures possess this property, many promising proposals are best suited to realising a single line of qubits with nearest neighbour interactions only. In light of this, we present a circuit implementing Shor's factorisation algorithm designed for such a linear nearest neighbour architecture. Despite the interaction restrictions, the circuit requires just 2L + 4 qubits and to leading order requires 8L4 2-qubit gates arranged in a circuit of depth 32L3 - identical to leading order to that possible using an architecture that can interact arbitrary pairs of qubits.
Jeng, D-S, Cha, DF & Blumenstein, M 2004, 'Neural network model for the prediction of wave-induced liquefaction potential', Ocean Engineering, vol. 31, no. 17-18, pp. 2073-2086.
View/Download from: Publisher's site
View description>>
The prediction of wave-induced liquefaction has been recognised by coastal geotechnical engineers as an important factor when considering the design of marine structures. All existing models have been based on conventional approaches of engineering mechanics with limited laboratory work. In this study, we propose an alternative approach for the prediction of the maximum liquefaction depth, based on neural network (NN). Unlike previous engineering mechanics approaches, the proposed NN model is based on data learning knowledge, rather than on knowledge of mechanisms. Numerical examples demonstrate the capacity of the proposed NN model for the prediction of wave-induced liquefaction depth, which provides civil engineers with another effective tool. © 2004 Elsevier Ltd. All rights reserved.
Ji, ZF, Duan, RY & Ying, MS 2004, 'Comparability of multipartite entanglement', PHYSICS LETTERS A, vol. 330, no. 6, pp. 418-423.
View/Download from: Publisher's site
View description>>
We prove, in a multipartite setting, that it is always feasible to exactly transform a genuinely m-partite entangled pure state with sufficient many copies to any other m-partite state via local quantum operation and classical communication. This result
Langford, NK, Dalton, RB, Harvey, MD, O’Brien, JL, Pryde, GJ, Gilchrist, A, Bartlett, SD & White, AG 2004, 'Measuring Entangled Qutrits and Their Use for Quantum Bit Commitment', Physical Review Letters, vol. 93, no. 5.
View/Download from: Publisher's site
Lee, T & Romashchenko, A 2004, 'On Polynomially Time Bounded Symmetry of Information', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3153, pp. 463-475.
View/Download from: Publisher's site
View description>>
The information contained in a string x about a string y is defined as the difference between the Kolmogorov complexity of y and the conditional Kolmogorov complexity of y given x, i.e., I(x : y) = C(y) -C(y\x). From the well-known Kolmogorov-Levin Theorem it follows that I(x : y) is symmetric up to a small additive term O(log C(x, y)). We investigate if this property can hold for several versions of polynomial time bounded Kolmogorov complexity. In particular, we study symmetry of information for some variants of distinguishing complexity CD where CD(x) is the length of a shortest program which accepts x and only x;. We show relativized worlds where symmetry of information does not hold for deterministic and nondeterministic polynomial time distinguishing complexities CD and CND For nondeterministic polynomial time distinguishing with randomness, CAMD , we prove that symmetry of information holds for most pairs of strings in any set in NP. In proving this last statement we extend a recent result of Buhrman et al. [6], which may be of independent utility. © Springer-Verlag 2004. poly poly poly
Li, S & Luo, M 2004, 'A note on stratified L-real line and unit L-interval', Fuzzy Sets and Systems, vol. 147, no. 2, pp. 327-332.
View/Download from: Publisher's site
View description>>
We show that the stratified L-real line and the stratified unit L-interval have no non-trivial crisp open sets. Simple characterizations for Boolean-valued stratified L-interval and L-line are also given. (C) 2004 Elsevier B.V. All rights reserved.
Li, SJ & Ying, MS 2004, 'Generalized Region Connection Calculus', ARTIFICIAL INTELLIGENCE, vol. 160, no. 1-2, pp. 1-34.
View/Download from: Publisher's site
View description>>
The Region Connection Calculus (RCC) is one of the most widely referenced system of high-level (qualitative) spatial reasoning. RCC assumes a continuous representation of space. This contrasts sharply with the fact that spatial information obtained from physical recording devices is nowadays invariably digital in form and therefore implicitly uses a discrete representation of space. Recently, Galton developed a theory of discrete space that parallels RCC, but question still lies in that can we have a theory of qualitative spatial reasoning admitting models of discrete spaces as well as continuous spaces? In this paper we aim at establishing a formal theory which accommodates both discrete and continuous spatial information, and a generalization of Region Connection Calculus is introduced. GRCC, the new theory, takes two primitives: the mereological notion of part and the topological notion of connection. RCC and Galton's theory for discrete space are both extensions of GRCC. The relation between continuous models and discrete ones is also clarified by introducing some operations on models of GRCC. In particular, we propose a general approach for constructing countable RCC models as direct limits of collections of finite models. Compared with standard RCC models given rise from regular connected spaces, these countable models have the nice property that each region can be constructed in finite steps from basic regions. Two interesting countable RCC models are also given: one is a minimal RCC model, the other is a countable sub-model of the continuous space R2.
Li, Y & Li, S 2004, 'A Fuzzy Sets Theoretic Approach to Approximate Spatial Reasoning', IEEE Transactions on Fuzzy Systems, vol. 12, no. 6, pp. 745-754.
View/Download from: Publisher's site
View description>>
Relational composition-based reasoning has become the most prevalent method for qualitative reasoning since Allen's 1983 work on temporal intervals. Underlying this reasoning technique is the concept of a jointly exhaustive and pairwise disjoint set of relations. Systems of relations such as RCC5 and RCC8 were originally developed for ideal regions, not subject to imperfections such as vagueness or fuzziness which are found in many applications in geographic analysis and image understanding. This paper, however, presents a general method for classifying binary topological relations involving fuzzy regions using the RCC5 or the RCC8 theory. Our approach is based on fuzzy set theory and the theory of consonant random set. Some complete classifications of topological relations between fuzzy regions are also given. Furthermore, two composition operators on spatial relations between fuzzy regions are introduced in this paper. These composition operators provide reasonable relational composition-based reasoning engine for spatial reasoning involving fuzzy regions.
O'Brien, JL, Pryde, GJ, Gilchrist, A, James, DFV, Langford, NK, Ralph, TC & White, AG 2004, 'Quantum Process Tomography of a Controlled-NOT Gate', Physical Review Letters, vol. 93, no. 8.
View/Download from: Publisher's site
Pope, DT, Wiseman, HM & Langford, NK 2004, 'Adaptive phase estimation is more accurate than nonadaptive phase estimation for continuous beams of light', Physical Review A, vol. 70, no. 4.
View/Download from: Publisher's site
Qiu, DW & Ying, MS 2004, 'Characterizations of quantum automata', THEORETICAL COMPUTER SCIENCE, vol. 312, no. 2-3, pp. 479-489.
View/Download from: Publisher's site
View description>>
We define q quantum finite automata (qQFAs) and q quantum regular grammars (qQRGs), and verify that they are exactly equivalent to those measure-once quantum finite automata (MO-QFAs) in the literature. In particular, we define q quantum pushdown automat
Verma, B, Blumenstein, M & Ghosh, M 2004, 'A novel approach for structural feature extraction: Contour vs. direction', Pattern Recognition Letters, vol. 25, no. 9, pp. 975-988.
View/Download from: Publisher's site
View description>>
The paper presents a novel approach for extracting structural features from segmented cursive handwriting. The proposed approach is based on the contour code and stroke direction. The contour code feature utilises the rate of change of slope along the contour profile in addition to other properties such as the ascender and descender count, start point and end point. The direction feature identifies individual line segments or strokes from the character's outer boundary or thinned representation and highlights each character's pertinent direction information. Each feature is investigated employing a benchmark database and the experimental results using the proposed contour code based structural feature are very promising. A comparative evaluation with the directional feature and existing transition feature is included. © 2004 Elsevier B.V. All rights reserved.
Blumenstein, M 1970, 'Experience in teaching object-oriented concepts to first year students with diverse backgrounds', International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004., International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004., IEEE, pp. 704-708.
View/Download from: Publisher's site
View description>>
This paper describes the experiences in coordinating a first year programming course at Griffith University since Semester 1, 2000. In this time, the course structure and content have evolved to implement and evaluate an "objects-as-needed" approach to first year programming with the recent return to an "objects-early" approach. A variety of assessment strategies have also been employed in order to maximize student-learning outcomes. The success of the revised course has continuously been measured by evaluating student feedback and performance. Finally, a focus group-based strategy of evaluation was adopted to determine students' attitudes to the most recently implemented changes.
Blumenstein, M, Green, S, Nguyen, A & Muthukkumarasamy, V 1970, 'An experimental analysis of GAME', Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education, ITiCSE04: Innovation and Technology in Computer Science Education, ACM, pp. 67-71.
View/Download from: Publisher's site
View description>>
This paper describes the Generic Automated Marking Environment (GAME) and provides a detailed analysis of its performance in assessing student programming projects and exercises. GAME has been designed to automatically assess programming assignments written in a variety of languages based on the "structure" of the source code and the correctness of the program's output. Currently, the system is able to mark programs written in Java, C++ and the C language. To use the system, instructors are required to provide a simple "marking schema" for any given assessment item, which includes pertinent information such as the location of files and the model solution. In this research, GAME has been tested on a number of student programming exercises and assignments. The results obtained, have been analysed and compared against a human marker providing encouraging results.
Blumenstein, M, Green, S, Nguyen, A & Muthukkumarasamy, V 1970, 'An experimental analysis of GAME', ACM SIGCSE Bulletin, Association for Computing Machinery (ACM), pp. 67-71.
View/Download from: Publisher's site
View description>>
This paper describes the Generic Automated Marking Environment (GAME) and provides a detailed analysis of its performance in assessing student programming projects and exercises. GAME has been designed to automatically assess programming assignments written in a variety of languages based on the 'structure' of the source code and the correctness of the program's output. Currently, the system is able to mark programs written in Java, C++ and the C language. To use the system, instructors are required to provide a simple 'marking schema' for any given assessment item, which includes pertinent information such as the location of files and the model solution. In this research, GAME has been tested on a number of student programming exercises and assignments. The results obtained, have been analysed and compared against a human marker providing encouraging results.
Blumenstein, M, Green, S, Nguyen, A & Muthukkumarasamy, V 1970, 'GAME: A Generic Automated Marking environment for programming assessment', ITCC 2004: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, VOL 1, PROCEEDINGS, pp. 212-216.
View/Download from: Publisher's site
View description>>
In this paper, a Generic Automated Marking Environment (GAME) is proposed for assessing student programming projects and exercises with an aim to facilitate student-centred learning. GAME has been designed to automatically assess programming assignments written in a variety of languages. The system has been implemented in Java and contains marker modules that are tailored to each specific language. A framework has been set in place to enable easy addition of new marker modules to extend the system's functionality. Currently, the system is able to mark programs written in Java and the C language. To use the system, instructors are required to provide a simple "marking schema" for any given assessment item, which includes pertinent information such as the location affiles and the model solution. GAME has been tested on a number of student programming exercises and assignments providing encouraging results.
Blumenstein, M, Liu, XY & Verma, B 1970, 'A modified direction feature for cursive character recognition', 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541), 2004 IEEE International Joint Conference on Neural Networks, IEEE, pp. 2983-2987.
View/Download from: Publisher's site
View description>>
This paper describes a neural network-based technique for cursive character recognition applicable to segmentation-based word recognition systems. The proposed research builds on a novel feature extraction technique that extracts direction information from the structure of character contours. This principal is extended so that the direction information is integrated with a technique for detecting transitions between background and foreground pixels in the character image. The proposed technique is compared with the standard direction feature extraction technique, providing promising results using segmented characters from the CEDAR benchmark database.
Liu, XY & Blumenstein, M 1970, 'Experimental Analysis of the Modified Direction Feature for Cursive Character Recognition', Ninth International Workshop on Frontiers in Handwriting Recognition, Ninth International Workshop on Frontiers in Handwriting Recognition, IEEE, pp. 353-358.
View/Download from: Publisher's site
View description>>
This paper describes and analyzes the performance of a structural feature extraction technique for the recognition of segmented/cursive characters that may be used in the context of a segmentation-based, handwritten word recognition system. The Modified Direction Feature (MDF) extraction technique builds upon a previous technique proposed by the authors that extracts direction information from the structure of character contours. This principle is extended so that the direction information is integrated with a technique for detecting transitions between background and foreground pixels in the character image. The MDF technique used in conjunction with neural network classifiers provide recognition rates of up to 90.24%, which are amongst the highest in the literature. This paper also presents a detailed analysis of the characters that were the source of misclassification in the character recognition process. The characters used for experimentation were obtained from the CEDAR benchmark database. © 2004 IEEE.
Mathieson, L, King, T & Brankovic, L 1970, '2-Compromise: usability in 1-dimensional statistical database', Fifteenth Australasian Workshop on Combinatorial Algorithms, pp. 5-15.
Mathieson, L, Prieto, E & Shaw, P 1970, 'Packing Edge Disjoint Triangles: A Parameterized View', PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS, 1st International Conference on Parameterized and Exact Computation (IWPEC 2004), Springer Berlin Heidelberg, Bergen, NORWAY, pp. 127-137.
View/Download from: Publisher's site
