Publications

Browne, M, Strauss, D, Castelle, B, Blumenstein, M, Tomlinson, R & Lane, C 2006, 'Empirical estimation of nearshore waves from a global deep-water wave model', IEEE Geoscience and Remote Sensing Letters, vol. 3, no. 4, pp. 462-466.
View/Download from: Publisher's site
View description>>

Global wind-wave models such as the National Oceanic and Atmospheric Administration WaveWatch 3 (NWW3) play an important role in monitoring the world's oceans. However, untransformed data at grid points in deep water provide a poor estimate of swell characteristics at nearshore locations, which are often of significant scientific, engineering, and public interest. Explicit wave modeling, such as the Simulating Waves Nearshore (SWAN), is one method for resolving the complex wave transformations affected by bathymetry, winds, and other local factors. However, obtaining accurate bathymetry and determining parameters for such models is often difficult. When target data is available (i.e., from in situ buoys or human observers, empirical alternatives such artificial neural networks (ANNs) and linear regression may be considered for inferring nearshore conditions from offshore model output. Using a sixfold cross-validation scheme, significant wave height Hs and period were estimated at one onshore and two nearshore locations. In estimating H s at the shoreline, the validation performance of the best ANN was r = 0.91, as compared to those of linear regression (0.82), SWAN (0.78), and the NWW3 Hs baseline (0.54). © 2006 IEEE.

Browne, M, Strauss, D, Tomlinson, R & Blumenstein, M 2006, 'Objective beach-state classification from optical sensing of cross-shore dissipation profiles', IEEE Transactions on Geoscience and Remote Sensing, vol. 44, no. 11, pp. 3418-3425.
View/Download from: Publisher's site
View description>>

Remote sensing using terrestrial optical charge-coupled device cameras is a useful data collection method for geophysical measurement in the nearshore zone, where in situ measurement is difficult and time consuming. In particular, optical video sensing of the variability in human-visible surface refraction due to the nearshore incident wave field is becoming an established method for distal measurement of nearshore subtidal morphology. We report on the use of a low-mounted shore-normal camera for gathering data on cross-shore dissipative characteristics of a dynamic open beach. Data are analyzed for the purposes of classifying three of Wright and Shorts' intermediate classes of morphological beach state as determined by expert raters. Although these beach states are usually thought of as being distinctive in terms of their longshore bar variability, theory predicts that differences should also be observed in cross-shore dissipative characteristics. Three methods of generating features from statistical features from the archived optical data are described and compared in terms of their ability to discriminate between the beach states. Principal component scores of the percentile distributions were found to provide slightly better classification performance (i.e., 85%, while approximating the data using relatively fewer features), whereas classification using intensity distributions alone resulted in the worst performance, classifying 78% of beach states correctly. Class center moment profiles for each beach state were constructed, and results indicate that cross-shore wave dissipation becomes more disorganized as linear bars devolve into more complex transverse structures. © 2006 IEEE.

Brun, T, Devetak, I & Hsieh, M 2006, 'Correcting Quantum Errors with Entanglement', Science, vol. 314, no. 5798, pp. 436-439.
View/Download from: Publisher's site
View description>>

We show how entanglement shared between encoder and decoder can simplify the theory of quantum error correction. The entanglement-assisted quantum codes we describe do not require the dual-containing constraint necessary for standard quantum errorcorrecting codes, thus allowing us to quantize all of classical linear coding theory. In particular, efficient modern classical codes that attain the Shannon capacity can be made into entanglement-assisted quantum codes attaining the hashing bound (closely related to the quantum capacity). For systems without large amounts of shared entanglement, these codes can also be used as catalytic codes, in which a small amount of initial entanglement enables quantum communication.

Cao, Y & Ying, M 2006, 'Observability And Decentralized Control Of Fuzzy Discrete-Event Systems', IEEE Transactions on Fuzzy Systems, vol. 14, no. 2, pp. 202-216.
View/Download from: UTS OPUS or Publisher's site
View description>>

Fuzzy discrete-event systems as a generalization of (crisp) discrete-event systems have been introduced in order that it is possible to effectively represent uncertainty, imprecision, and vagueness arising from the dynamic of systems. A fuzzy discrete-ev

Cao, Y & Ying, M 2006, 'Similarity-Based Supervisory Control Of Discrete-Event Systems', IEEE Transactions On Automatic Control, vol. 51, no. 2, pp. 325-330.
View/Download from: UTS OPUS or Publisher's site
View description>>

Due to the appearance of uncontrollable events in discrete-event systems, one may wish to replace the behavior leading to the uncontrollability of pre-specified language by some quite similar one. To capture this similarity, we introduce metric to tradit

Cole, JH, Devitt, SJ & Hollenberg, LCL 2006, 'Precision characterization of two-qubit Hamiltonians via entanglement mapping', Journal of Physics A: Mathematical and General, vol. 39, no. 47, pp. 14649-14658.
View/Download from: Publisher's site
View description>>

We demonstrate a method to characterize the general Heisenberg Hamiltonian with non-uniform couplings by mapping the entanglement it generates as a function of time. Identification of the Hamiltonian in this way is possible as the coefficients of each operator control the oscillation frequencies of the entanglement function. The number of measurements required to achieve a given precision in the Hamiltonian parameters is determined and an efficient measurement strategy designed. We derive the relationship between the number of measurements, the resulting precision and the ultimate discrete error probability generated by a systematic mis-characterization. This has important implications when implementing two-qubit gates for fault-tolerant quantum computation. © 2006 IOP Publishing Ltd.

Devitt, SJ, Cole, JH & Hollenberg, LCL 2006, 'Scheme for direct measurement of a general two-qubit Hamiltonian', Physical Review A - Atomic, Molecular, and Optical Physics, vol. 73, no. 5.
View/Download from: Publisher's site
View description>>

The construction of two-qubit gates appropriate for universal quantum computation is of enormous importance to quantum-information processing. Building such gates is dependent on accurate knowledge of the interaction dynamics between two-qubit systems. This paper will present a systematic method for reconstructing the full two-qubit interaction Hamiltonian through experimental measures of concurrence. This not only gives a convenient method for constructing two qubit quantum gates, but can also be used to experimentally determine various Hamiltonian parameters in physical systems. We show explicitly how this method can be employed to determine the first- and second-order spin-orbit corrections to the exchange coupling in quantum dots. © 2006 The American Physical Society.

Devitt, SJ, Fowler, AG & Hollenberg, LCL 2006, 'Robustness of shor's algorithm', Quantum Information and Computation, vol. 6, no. 7, pp. 616-629.
View description>>

Shor's factorisation algorithm is a combination of classical pre- and post-processing and a quantum period finding (QPF) subroutine which allows an exponential speed up over classical factoring algorithms. We consider the stability of this subroutine when exposed to a discrete error model that acts to perturb the computational trajectory of a quantum computer. Through detailed state vector simulations of an appropriate quantum circuit, we show that the error locations within the circuit itself heavily influences the probability of success of the QPF subroutine. The results also indicate that the naive estimate of required component precision is too conservative. © Rinton Press.

Duan, R, Feng, Y & Ying, M 2006, 'Partial Recovery Of Quantum Entanglement', IEEE Transactions On Information Theory, vol. 52, no. 7, pp. 3080-3104.
View/Download from: UTS OPUS or Publisher's site
View description>>

Suppose Alice and Bob try to transform an entangled state shared between them into another one by local operations and classical communications. Then in general a certain amount of entanglement contained in the initial state will decrease in the process

Duan, R, Ji, Z, Feng, Y & Ying, M 2006, 'Some Issues In Quantum Information Theory', Journal Of Computer Science And Technology, vol. 21, no. 5, pp. 776-789.
View/Download from: UTS OPUS or Publisher's site
View description>>

Quantum information theory is a new interdisciplinary research field related to quantum mechanics, computer science, information theory, and applied mathematics. It provides completely new paradigms to do information processing tasks by employing the pri

Feng, Y, Duan, R & Ji, Z 2006, 'Optimal Dense Coding With Arbitrary Pure Entangled States', Physical Review A, vol. 74, no. 1, pp. 1-5.
View/Download from: UTS OPUS
View description>>

We examine dense coding with an arbitrary pure entangled state sharing between the sender and the receiver. Upper bounds on the average success probability in approximate dense coding and on the probability of conclusive results in unambiguous dense codi

Feng, Y, Duan, R & Ying, M 2006, 'Relation Between Catalyst-Assisted Transformation And Multiple-Copy Transformation For Bipartite Pure States', Physical Review A, vol. 74, no. 4, pp. 1-7.
View/Download from: UTS OPUS
View description>>

We show that in some cases, catalyst-assisted entanglement transformation cannot be implemented by multiple-copy transformation for pure states. This fact, together with the result we obtained in R. Y. Duan, Y. Feng, X. Li, and M. S. Ying, Phys. Rev. A 7

Fogelman, S, Blumenstein, M & Zhao, H 2006, 'Estimation of chemical oxygen demand by ultraviolet spectroscopic profiling and artificial neural networks', Neural Computing and Applications, vol. 15, no. 3-4, pp. 197-203.
View/Download from: Publisher's site
View description>>

A simple method based on the mathematical treatment of spectral absorbance profiles in conjunction with artificial neural networks (ANNs) is demonstrated for rapidly estimating chemical oxygen demand (COD) values of wastewater samples. In order to improve spectroscopic analysis and ANN training time as well as to reduce the storage space of the trained ANN algorithm, it is necessary to decrease the ANN input vector size by extracting unique characteristics from the raw input pattern. Key features from the spectral absorbance pattern were therefore selected to obtain the spectral absorbance profile, reducing the ANN input vector from 160 to 10 selected inputs. The results indicate that the COD values obtained from the selected absorbance profiles agreed well with those obtained from the entire absorbance pattern. The spectral absorbance profile technique was also compared to COD values estimated by a multiple linear regression (MLR) model to validate whether ANNs were better and more robust models for rapid COD analysis. It was found that the ANN model predicted COD values closer to standard COD values than the MLR model.

Fogelman, S, Zhao, H & Blumenstein, M 2006, 'A rapid analytical method for predicting the oxygen demand of wastewater.', Analytical and bioanalytical chemistry, vol. 386, no. 6, pp. 1773-1779.
View/Download from: Publisher's site
View description>>

In this study, an investigation was undertaken to determine whether the predictive accuracy of an indirect, multiwavelength spectroscopic technique for rapidly determining oxygen demand (OD) values is affected by the use of unfiltered and turbid samples, as well as by the use of absorbance values measured below 200 nm. The rapid OD technique was developed that uses UV-Vis spectroscopy and artificial neural networks (ANNs) to indirectly determine chemical oxygen demand (COD) levels. It was found that the most accurate results were obtained when a spectral range of 190-350 nm was provided as data input to the ANN, and when using unfiltered samples below a turbidity range of 150 NTU. This is because high correlations of above 0.90 were obtained with the data using the standard COD method. This indicates that samples can be measured directly without the additional need for preprocessing by filtering. Samples with turbidity values higher than 150 NTU were found to produce poor correlations with the standard COD method, which made them unsuitable for accurate, real-time, on-line monitoring of OD levels.

Greentree, AD, Devitt, SJ & Hollenberg, LCL 2006, 'Quantum-information transport to multiple receivers', PHYSICAL REVIEW A, vol. 73, no. 3.
View/Download from: Publisher's site

Ji, Z, Feng, Y, Duan, R & Ying, M 2006, 'Boundary Effect Of Deterministic Dense Coding', Physical Review A, vol. 73, no. 3, pp. 1-3.
View/Download from: UTS OPUS
View description>>

We present a rigorous proof of an interesting boundary effect of deterministic dense coding first observed by S. Mozes, J. Oppenheim, and B. Reznik [Phys. Rev. A 71, 012311 (2005)]. Namely, it is shown that d(2)-1 cannot be the maximal alphabet size of a

Ji, Z, Feng, Y, Duan, R & Ying, M 2006, 'Identification And Distance Measures Of Measurement Apparatus', Physical Review Letters, vol. 96, no. 20, pp. 1-4.
View/Download from: UTS OPUS
View description>>

We propose simple schemes that can perfectly identify projective measurement apparatuses secretly chosen from a finite set. Entanglement is used in these schemes both to make possible the perfect identification and to improve the efficiency significantly

Li, S 2006, 'A complete classification of topological relations using the 9-intersection method', International Journal of Geographical Information Science, vol. 20, no. 6, pp. 589-610.
View/Download from: UTS OPUS or Publisher's site
View description>>

Formalization of topological relations between spatial objects is an important aspect of spatial representation and reasoning. The well-known 9-Intersection Method (9IM) was previously used to characterize topological relations between simple regions, i.e. regions with connected boundary and exterior. This simplified abstraction of spatial objects as simple regions cannot model the variety and complexity of spatial objects. For example, countries like Italy may contain islands and holes. It is necessary that existing formalisms, 9IM in particular, cover this variety and complexity. This paper generalizes 9IM to cope with general regions, where a (general) region is a non-empty proper regular closed subset of the Euclidean plane. We give a complete classification of topological relations between plane regions. For each possible relation we either show that it violates some topological constraints and hence is non-realizable or find two plane regions it relates. Altogether 43 (out of 512) relations are identified as realizable. Among these, five can be realized only between exotic (plane) regions, where a region is exotic if there is another region that has the same boundary but is not its complement. For all the remaining 38 relations, we construct configurations by using sums, differences and complements of discs.

Li, S 2006, 'A complete classification of topological relations using the 9-intersection method', International Journal of Geographical Information Science, vol. 20, no. 6, pp. 589-610.
View/Download from: Publisher's site
View description>>

Formalization of topological relations between spatial objects is an important aspect of spatial representation and reasoning. The well-known 9-Intersection Method (9IM) was previously used to characterize topological relations between simple regions, i.e. regions with connected boundary and exterior. This simplified abstraction of spatial objects as simple regions cannot model the variety and complexity of spatial objects. For example, countries like Italy may contain islands and holes. It is necessary that existing formalisms, 9IM in particular, cover this variety and complexity. This paper generalizes 9IM to cope with general regions, where a (general) region is a non-empty proper regular closed subset of the Euclidean plane. We give a complete classification of topological relations between plane regions. For each possible relation we either show that it violates some topological constraints and hence is non-realizable or find two plane regions it relates. Altogether 43 (out of 512) relations are identified as realizable. Among these, five can be realized only between exotic (plane) regions, where a region is exotic if there is another region that has the same boundary but is not its complement. For all the remaining 38 relations, we construct configurations by using sums, differences and complements of discs. © 2006 Taylor & Francis Group, LLC.

Li, S 2006, 'On Topological Consistency And Realization', Constraints, vol. 11, no. 1, pp. 31-51.
View/Download from: UTS OPUS or Publisher's site
View description>>

Topological relations are important in various tasks of spatial reasoning, scene description and object recognition. The RCC8 spatial constraint language developed by Randell, Cui and Cohn (1992) is widely recognized as of particular importance in both t

Li, S & Li, Y 2006, 'On The Complemented Disk Algebra', Journal Of Logic And Algebraic Programming, vol. 66, no. 2, pp. 195-211.
View/Download from: UTS OPUS or Publisher's site
View description>>

The importance of relational methods in temporal and spatial reasoning has been widely recognised in the last two decades. A quite large part of contemporary spatial reasoning is concerned with the research of relation algebras generated by the

Li, S & Wang, H 2006, 'RCC8 binary constraint network can be consistently extended', Artificial Intelligence, vol. 170, no. 1, pp. 1-18.
View/Download from: UTS OPUS or Publisher's site
View description>>

The RCC8 constraint language developed by Randell et al. has been popularly adopted by the Qualitative Spatial Reasoning and GIS communities. The recent observation that RCC8 composition table describes only weak composition instead of composition raises questions about Renz and Nebel's maximality results about the computational complexity of reasoning with RCC8. This paper shows that any consistent RCC8 binary constraint network (RCC8 network for short) can be consistently extended. Given ?, an RCC8 network, and z, a fresh variable, suppose xTyset membership, variant? and T is contained in the weak composition of R and S. This means that we can add two new constraints xRz and zSy to ? without changing the consistency of the network. The result guarantees the applicability to RCC8 of one key technique, (Theorem 5) of [J. Renz, B. Nebel, On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus. Artificial Intelligence 108 (1999) 69123], which allows the transfer of tractability of a set of RCC8 relations to its closure under composition, intersection, and converse.

Oi, DKL, Devitt, SJ & Hollenberg, LCL 2006, 'Scalable error correction in distributed ion trap computers', PHYSICAL REVIEW A, vol. 74, no. 5.
View/Download from: Publisher's site

Rohde, PP & Ralph, TC 2006, 'Error models for mode mismatch in linear optics quantum computing', PHYSICAL REVIEW A, vol. 73, no. 6.
View/Download from: UTS OPUS or Publisher's site

Rohde, PP & Ralph, TC 2006, 'Modelling photo-detectors in quantum optics', JOURNAL OF MODERN OPTICS, vol. 53, no. 11, pp. 1589-1603.
View/Download from: UTS OPUS or Publisher's site

Rohde, PP, Ralph, TC & Munro, WJ 2006, 'Practical limitations in optical entanglement purification', PHYSICAL REVIEW A, vol. 73, no. 3.
View/Download from: UTS OPUS or Publisher's site

Wang, G & Ying, M 2006, 'Unambiguous Discrimination Among Quantum Operations', Physical Review A, vol. 73, no. 4, pp. 1-5.
View/Download from: UTS OPUS
View description>>

We address the problem of unambiguous discrimination among a given set of quantum operations. The necessary and sufficient condition for them to be unambiguously distinguishable is derived in the cases of single use and multiple uses, respectively. For t

Wei, Z & Ying, M 2006, 'A Modified Quantum Adiabatic Evolution For The Deutsch-Jozsa Problem', Physics Letters A, vol. 354, no. 4, pp. 271-273.
View/Download from: UTS OPUS or Publisher's site
View description>>

Deutsch-Jozsa algorithm has been implemented via a quantum adiabatic evolution by S. Das et al. [S. Das, R. Kobes, G. Kunstatter, Phys. Rev. A 65 (2002) 062310]. This adiabatic algorithm gives rise to a quadratic speed up over classical algorithms. We sh

Wei, Z & Ying, M 2006, 'A Relation Between Fidelity And Quantum Adiabatic Evolution', Physics Letters A, vol. 356, no. 4-5, pp. 312-315.
View/Download from: UTS OPUS or Publisher's site
View description>>

Recently, some quantum algorithms have been implemented by quantum adiabatic evolutions. In this Letter, we discuss the accurate relation between the running time and the distance of the initial state and the final state of a kind of quantum adiabatic ev

Wei, Z & Ying, M 2006, 'Majorization In Quantum Adiabatic Algorithms', Physical Review A, vol. 74, no. 4, pp. 1-7.
View/Download from: UTS OPUS
View description>>

The majorization theory has been applied to analyze the mathematical structure of quantum algorithms. An empirical conclusion by numerical simulations obtained in the previous literature indicates that step-by-step majorization seems to appear universall

Xia, L & Li, S 2006, 'On Minimal Models Of The Region Connection Calculus', Fundamenta Informaticae, vol. 69, no. 4, pp. 427-446.
View/Download from: UTS OPUS
View description>>

Region Connection Calculus (RCC) is one primary formalism of qualitative spatial reasoning. Standard RCC models are continuous ones where each region is infinitely divisible. This contrasts sharply with the predominant use of finite, discrete models in a

Ying, M 2006, 'Linguistic Quantifiers Modeled By Sugeno Integrals', Artificial Intelligence, vol. 170, no. 6-7, pp. 581-606.
View/Download from: UTS OPUS or Publisher's site
View description>>

Since quantifiers have the ability of summarizing the properties of a class of objects without enumerating them, linguistic quantification is a very important topic in the field of high level knowledge representation and reasoning. This paper introduces

Zhang, C, Feng, Y & Ying, M 2006, 'Unambiguous Discrimination Of Mixed Quantum States', Physics Letters A, vol. 353, no. 4, pp. 300-306.
View/Download from: UTS OPUS or Publisher's site
View description>>

The problem of unambiguous discrimination between mixed quantum states is addressed by isolating the part of each mixed state which has no contribution to discrimination and by employing the strategy of set discrimination of pure states. A necessary and

Zhang, C, Ying, M & Qiao, B 2006, 'Optimal universal programmable detectors for unambiguous discrimination', Phys. Rev. A, vol. 74, pp. 042308-042308.
View/Download from: Publisher's site
View description>>

We discuss the problem of designing unambiguous programmable discriminators for any n unknown quantum states in an m-dimensional Hilbert space. The discriminator is a fixed measurement that has two kinds of input registers: the program registers and the data register. The quantum state in the data register is what users want to identify, which is confirmed to be among the n states in program registers. The task of the discriminator is to tell the users which state stored in the program registers is equivalent to that in the data register. First, we give a necessary and sufficient condition for judging an unambiguous programmable discriminator. Then, if $m=n$, we present an optimal unambiguous programmable discriminator for them, in the sense of maximizing the worst-case probability of success. Finally, we propose a universal unambiguous programmable discriminator for arbitrary n quantum states.

Zhang, C, Ying, M & Qiao, B 2006, 'Universal Programmable Devices For Unambiguous Discrimination', Physical Review A, vol. 74, no. 4, pp. 1-9.
View/Download from: UTS OPUS
View description>>

We discuss the problem of designing unambiguous programmable discriminators for any n unknown quantum states in an m-dimensional Hilbert space. The discriminator is a fixed measurement that has two kinds of input registers: the program registers and the

Armand, S, Blumenstein, M & Muthukkumarasamy, V 2006, 'Off-line signature verification based on the modified direction feature', Proceedings - International Conference on Pattern Recognition, pp. 509-512.
View/Download from: Publisher's site
View description>>

Signature identification and verification has been a topic of interest and importance for many years in the area of biometrics. In this paper we present an effective method to perform off-line signature verification and identification. To commence the process, the signature's contour is first determined from its binary representation. Unique structural features are subsequently extracted from the signature's contour through the use of a novel combination of the Modified Direction Feature (MDF) in conjunction with additional distinguishing features to train and test two Neural Network-based classifiers. A Resilient Back Propagation neural network and a Radial Basis Function neural network were compared. Using a publicly available database of 2106 signatures containing 936 genuine and 1170 forgeries, we obtained a verification rate of 91.12%. © 2006 IEEE.

Armand, S, Blumenstein, M & Muthukkumarasamy, V 2006, 'Off-line signature verification using the enhanced modified direction feature and neural-based classification', IEEE International Conference on Neural Networks - Conference Proceedings, pp. 684-691.
View description>>

Signatures continue to be an important biometric for authenticating the identity of human beings. This paper presents an effective method to perform off-line signature verification using unique structural features extracted from the signature's contour. A novel combination of the Modified Direction Feature (MDF) and additional distinguishing features such as the centroid, surface area, length and skew are used for classification. A Resilient Backpropagation (RBP) neural network and a Radial Basis Function (RBF) network were compared in terms of verification accuracy. Using a publicly available database of 2106 signatures (936 genuine and 1170 forgeries), verification rates of 91.21% and 88.0% were obtained using RBF and RBP respectively. © 2006 IEEE.

Barreiro, JT, Peters, NA, Kwiat, PG, Langford, NK & White, AG 2006, 'Joint polarization and spatial-mode entanglement of photons', Optics InfoBase Conference Papers.
View description>>

Simultaneous multidimensional entanglement can improve quantum communi-cation protocols, measurements and fundamental studies. Using photons from parametric downconversion, we demonstrate a source of joint polarization and spatial-mode entangle-ment, and characterize the state by tomographic reconstruction. © 2005 Optical Society of America.

Barreiro, JT, Peters, NA, Langford, NK & Kwiat, PG 2006, 'Hyper-entanglement: Generation and applications', Conference on Lasers and Electro-Optics and 2006 Quantum Electronics and Laser Science Conference, CLEO/QELS 2006.
View/Download from: Publisher's site
View description>>

Producing photons entangled independently in orbital angular-momentum, polarization, and energy-time, we realize a source of "hyper"- entanglement. Such a source enables new quantum communication capabilities. We propose and demonstrate remote tunable preparation of entangled states. © 2006 Optical Society of America.

Barreiro, JT, Peters, NA, Langford, NK & Kwiat, PG 2006, 'Hyper-entanglement: Generation and applications', Optics InfoBase Conference Papers.
View description>>

Producing photons entangled independently in orbital angular-momentum, polarization, and energy-time, we realize a source of "hyper"-entanglement. Such a source enables new quantum communication capabilities. We propose and demonstrate remote tunable preparation of entangled states. © 2006 Optical Society of America.

Brun, T., Devetak, I. & Hsieh, M. 2006, 'Entanglement-assisted quantum error correction', The 6th Asian Conference on Quantum Information Science (AQIS06), BeiJing, China.

Cha, D, Blumenstein, M, Zhang, H & Jeng, DS 2006, 'Improvement of an artificial neural network model using min-max preprocessing for the prediction of wave-induced seabed liquefaction', IEEE International Conference on Neural Networks - Conference Proceedings, pp. 4577-4581.
View description>>

In the past decade, artificial neural networks (ANNs) have been widely applied to the engineering problems with a complicated system. ANNs are becoming an important alternative option for solving problems in comparison to traditional engineering solutions, which are usually involved in complicated mathematical theories. In this study, we apply an ANN model to the wave-induced seabed liquefaction problem, which is a key issue in the area of coastal and ocean engineering. Furthermore, we adopted an ANN model with preprocessing (MIN-MAX) on difficult training data. This paper demonstrates the capacity of the proposed ANN model using MIN-MAX pre-processing to provide coastal engineers with another effective tool to analyse the stability of seabed sediment. © 2006 IEEE.

Cha, D, Jeng, DS, Blumenstein, M & Zhang, H 2006, 'Evaluation of wave-induced liquefaction in a porous seabed: Using an artificial neural network and a genetic algorithm -based model', Proceedings of the International Offshore and Polar Engineering Conference, pp. 302-308.
View description>>

The evaluation of wave-induced liquefaction is one of the key factors for analysing seabed characteristics and the design of marine structures. Numerous investigations of wave-induced liquefaction have been proposed. However, most previous research has focused on complicated mathematical theories and laboratory work. In this study, we contribute an alternative approach for the prediction of the waveinduced liquefaction using an Artificial Neural Network (ANN) and a Genetic Algorithm (GA)-based model. Combined ANN and GA-based models are still a newly developed area in coastal engineering. In this study, a Genetic Algorithm-based approach is proposed to find optimal weights for the ANN model. It reduces the training time, and improves the forecasting accuracy for wave-induced maximum liquefaction depth, compared to using the normal ANN training procedure. Simulation results demonstrate the capacity of the proposed ANN model for the prediction of wave induced maximum liquefaction depth in addition to the proposal of GAs for training the ANN model. Copyright ©2006 by The International Society of Offshore and Polar Engineers.

Green, S & Blumenstein, M 2006, 'An exhaustive search strategy for detecting persons in beach scenes using digital video imagery and neural network-based classification', IEEE International Conference on Neural Networks - Conference Proceedings, pp. 2439-2444.
View description>>

This paper presents an investigation of a neural-based technique for detecting and quantifying persons in beach imagery for the purpose of predicting trends of tourist activities at beach sites. The proposed system uses various pre-processing and segmentation techniques to initially isolate potential objects in cluttered scenes. A structural feature extraction technique is then used to represent objects of interest for training a neural classifier. An exhaustive search strategy, incorporating a neural network, is proposed to effectively scan beach images to determine whether objects are "person" or "non-person". Encouraging results are presented for person detection using video imagery collected from a beach site on the coast of Australia. ©2006 IEEE.

Hollenberg, LCL, Greentree, AD, Wellard, CJ, Fowler, AG, Devitt, SJ & Cole, JH 2006, 'Qubit transport and fault-tolerant architectures in silicon', Proceedings of the 2006 International Conference on Nanoscience and Nanotechnology, ICONN, pp. 348-350.
View/Download from: Publisher's site
View description>>

We review a new adiabatic scheme - coherent spin transport by adiabatic passage (CSTAP) - for physical qubit transport particularly suited to atomic and solid-state systems. Several applications immediately follow, including a 2D Si:P donor electron spin architecture for quantum computing, and protocols for generating entangled states across non-local qubits. © 2006 IEEE.

Hollenberg, LCL, Greentree, AD, Wellard, CJ, Fowler, AG, Devitt, SJ & Cole, JH 2006, 'Qubit Transport and Fault-tolerant Architectures in Silicon', 2006 INTERNATIONAL CONFERENCE ON NANOSCIENCE AND NANOTECHNOLOGY, VOLS 1 AND 2, International Conference on Nanoscience and Nanotechnology, IEEE, Brisbane, AUSTRALIA, pp. 655-+.

Li, S 2006, 'Combining topological and directional information: First results', Knowledge Science, Engineering And Management : Lecture Notes in Artificial Intelligence Vol 4092, International Conference on Knowledge Science, Engineering and Management, Springer-Verlag Berlin, Guilin, China, pp. 252-264.
View/Download from: UTS OPUS or Publisher's site
View description>>

Representing and reasoning about spatial information is important in artificial intelligence and geographical information science. Relations between spatial entities are the most important kind of spatial information. Most current formalisms of spatial relations focus on one single aspect of space. This contrasts sharply with real world applications, where several aspects are usually involved together. This paper proposes a qualitative calculus that combines a simple directional relation model with the well-known topological RCC5 model. We show by construction that the consistency of atomic networks can be decided in polynomial time.

Memis, OG, Kong, SC, Katsnelson, A, Tomamichel, MP & Mohseni, H 2006, 'A novel avalanche free single photon detector', 2006 6th IEEE Conference on Nanotechnology, IEEE-NANO 2006, pp. 742-745.
View description>>

We have conceived a novel single photon detector for IR wavelengths above 1 μm. The detection mechanism is based on carrier focalization and nano-injection. Preliminary measured data from unpassivated devices show a very high internal gain and low dark current at 1.55 μm at room temperature © 2006 IEEE.

Rohde, P 2006, Quantum state tomography of single photon sources in the spectral degree of freedom, https://arxiv.org/abs/quant-ph/0609005.

Wang, G & Ying, M 2006, 'Realization of positive-operator-valued measures by projective measurements without introducing ancillary dimensions'.
View description>>

We propose a scheme that can realize a class of positive-operator-valued measures (POVMs) by performing a sequence of projective measurements on the original system, in the sense that for an arbitrary input state the probability distribution of the measurement outcomes is faithfully reproduced. A necessary and sufficient condition for a POVM to be realizable in this way is also derived. In contrast to the canonical approach provided by Neumark's theorem, our method has the advantage of requiring no auxiliary system. Moreover, an arbitrary POVM can be realized by utilizing our protocol on an extended space which is formed by adding only a single extra dimension.

Wei, Z & Ying, M 2006, 'Quantum adiabatic evolutions that can't be used to design efficient algorithms'.
View description>>

Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic evolution with a interpolation path is too simple, the minimal gap between the ground state and the first excited state of this quantum adiabatic evolution is an inverse exponential distance. Thus quantum adiabatic evolutions of this kind can't be used to design efficient quantum algorithms. Similarly, we show that a quantum adiabatic evolution with a simple final hamiltonian also has a long running time, which suggests that some functions can't be minimized efficiently by any quantum adiabatic evolution with a interpolation path.