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-3426.
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-H 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 thetheory of quantum error correction. The entanglement-assisted quantum codes wedescribe do not require the dual-containing constraint necessary for standardquantum error correcting codes, thus allowing us to ``quantize'' all ofclassical linear coding theory. In particular, efficient modern classical codesthat attain the Shannon capacity can be made into entanglement-assisted quantumcodes attaining the hashing bound (closely related to the quantum capacity).For systems without large amounts of shared entanglement, these codes can alsobe used as catalytic codes, in which a small amount of initial entanglementenables quantum communication.
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
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: 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 of transformation. However, an interesting phenomenon called partial entanglement recovery shows that it is possible to recover some amount of entanglement by adding another entangled state and transforming the two entangled states collectively. In this paper, we are mainly concerned with the feasibility of partial entanglement recovery. The basic problem we address is whether a given state is useful in recovering entanglement lost in a specified transformation. In the case where the source and target states of the original transformation satisfy the strict majorization relation, a necessary and sufficient condition for partial entanglement recovery is obtained. For the general case we give two sufficient conditions. We also give an efficient algorithm for the feasibility of partial entanglement recovery in polynomial time. As applications, we establish some interesting connections between partial entanglement recovery and the generation of maximally entangled states, quantum catalysis, mutual catalysis, and multiple-copy entanglement transformation. © 2006 IEEE.
Duan, R-Y, Ji, Z-F, Feng, Y & Ying, M-S 2006, 'Some issues in quantum information theory', JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, vol. 21, no. 5, pp. 776-789.
View/Download from: 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 - Atomic, Molecular, and Optical Physics, vol. 74, no. 1, pp. 1-5.
View/Download from: Publisher's site
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 coding are derived. We also construct the optimal protocol which saturates the upper bound in each case. © 2006 The American Physical Society.
Feng, Y, Duan, R & Ji, Z 2006, 'Optimal dense coding with arbitrary pure entangled states', Phys. Rev. A, vol. 74, no. 1, p. 012310.
View/Download from: Publisher's site
View description>>
We examine dense coding with an arbitrary pure entangled state sharingbetween the sender and the receiver. Upper bounds on the average successprobability in approximate dense coding and on the probability of conclusiveresults in unambiguous dense coding are derived. We also construct the optimalprotocol which saturates the upper bound in each case.
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: Publisher's site
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 71, 042319 (2005), namely that the latter can be completely implemented by the former, indicates that catalyst-assisted transformation is strictly more powerful than multiple-copy transformation. For the purely probabilistic setting we find, however, these two kinds of transformations are geometrically equivalent in the sense that the sets of pure states that can be converted into a given pure state with maximal probabilities not less than a given value have the same closure, regardless of whether catalyst-assisted transformation or multiple-copy transformation is used. © 2006 The American Physical Society.
Feng, Y, Duan, R, Ji, Z & Ying, M 2006, 'Probabilistic bisimilarities between quantum processes', Information and Computation, vol. 2007, p. 205.
View/Download from: Publisher's site
View description>>
Modeling and reasoning about concurrent quantum systems is very importantboth for distributed quantum computing and for quantum protocol verification.As a consequence, a general framework describing formally the communication andconcurrency in complex quantum systems is necessary. For this purpose, wepropose a model qCCS which is a natural quantum extension of classicalvalue-passing CCS with the input and output of quantum states, and unitarytransformations and measurements on quantum systems. The operational semanticsof qCCS is given based on probabilistic labeled transition system. Thissemantics has many different features compared with the proposals in literaturein order to describe input and output of quantum systems which are possiblycorrelated with other components. Based on this operational semantics, weintroduce the notions of strong probabilistic bisimilarity and weakprobabilistic bisimilarity between quantum processes and discuss someproperties of them, such as congruence under various combinators.
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. © Springer-Verlag 2006.
GREEN, S, BLUMENSTEIN, M, BROWNE, M & TOMLINSON, R 2006, 'THE DETECTION OF PERSONS IN CLUTTERED BEACH SCENES USING DIGITAL VIDEO IMAGERY AND NEURAL NETWORK-BASED CLASSIFICATION', International Journal of Computational Intelligence and Applications, vol. 06, no. 02, pp. 149-160.
View/Download from: Publisher's site
View description>>
This paper presents an investigation into the detection and quantification of persons in real-world beach scenes for the automated monitoring of public recreation areas. Aside from the obvious use of video and digital imagery for surveillance applications, this research focuses on the analysis of images for the purpose of predicting trends in the intensity of public usage at beach sites in Australia. The proposed system uses image enhancement and segmentation techniques to detect objects in cluttered scenes. Following these steps, a newly proposed feature extraction technique is used to represent salient information in the extracted objects for training of a neural network. The neural classifier is used to distinguish the extracted objects between 'person' and 'non-person' categories to facilitate analysis of tourist activity. Encouraging results are presented for person classification on a database of real-word beach scene images.
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, ZF, Feng, Y, Duan, RY & Ying, MS 2006, 'Boundary effect of deterministic dense coding', PHYSICAL REVIEW A, vol. 73, no. 3, pp. 1-3.
View/Download from: Publisher's site
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 d2 -1 cannot be the maximal alphabet size of any isometric deterministic dense coding schemes utilizing d -level partial entanglement. © 2006 The American Physical Society.
Ji, ZF, Feng, Y, Duan, RY & Ying, MS 2006, 'Identification and distance measures of measurement apparatus', PHYSICAL REVIEW LETTERS, vol. 96, no. 20, pp. 1-4.
View/Download from: Publisher's site
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. Based on these results, a brief discussion on the problem of how to appropriately define distance measures of measurements is also provided. © 2006 The American Physical Society.
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.
Li, S 2006, 'On Topological Consistency and Realization', Constraints, vol. 11, no. 1, pp. 31-51.
View/Download from: 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', The Journal of Logic and Algebraic Programming, vol. 66, no. 2, pp. 195-211.
View/Download from: 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: 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', Phys. Rev. A., vol. 74, no. 5, p. 052313.
View/Download from: Publisher's site
View description>>
A major challenge for quantum computation in ion trap systems is scalableintegration of error correction and fault tolerance. We analyze a distributedarchitecture with rapid high fidelity local control within nodes and entangledlinks between nodes alleviating long-distance transport. We demonstratefault-tolerant operator measurements which are used for error correction andnon-local gates. This scheme is readily applied to linear ion traps whichcannot be scaled up beyond a few ions per individual trap but which have accessto a probabilistic entanglement mechanism. A proof-of-concept system ispresented which is within the reach of current experiment.
Wei, Z, Ji, Z & Ying, M 2006, 'Majorization in quantum adiabatic algorithms', PHYSICAL REVIEW A, vol. 74, no. 4, pp. 1-7.
View/Download from: Publisher's site
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 universally in quantum adiabatic algorithms. In this paper, a rigorous analysis of the majorization arrow in a special class of quantum adiabatic algorithms is carried out. In particular, we prove that for any adiabatic algorithm of this class, step-by-step majorization of the ground state holds exactly. For the actual state, we show that step-by-step majorization holds approximately, and furthermore that the longer the running time of the algorithm, the better the approximation. © 2006 The American Physical Society.
Xia, L & Li, S 2006, 'On minimal models of the Region Connection Calculus', Fundamenta Informaticae, vol. 69, no. 4, pp. 427-446.
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 applications. In a recent paper, Li et al. (2004) initiate a study of countable models that can be constructed step by step from finite models. Of course, some basic problems are left unsolved, for example, how many non-isomorphic countable RCC models are there? This paper investigates these problems and obtains the following results: (i) the exotic RCC model described by Gotts (1996) is isomorphic to the minimal model given by Li and Ying (2004); (ii) there are continuum many non-isomorphic minimal RCC models, where a model is minimal if it can be isomorphically embedded in each RCC model.
Armand, S, Blumenstein, M & Muthukkumarasamy, V 1970, 'Off-line Signature Verification based on the Modified Direction Feature', 18th International Conference on Pattern Recognition (ICPR'06), 18th International Conference on Pattern Recognition (ICPR'06), IEEE, 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 1970, 'Off-line Signature Verification using the Enhanced Modified Direction Feature and Neural-based Classification', The 2006 IEEE International Joint Conference on Neural Network Proceedings, The 2006 IEEE International Joint Conference on Neural Network Proceedings, IEEE, pp. 684-691.
View/Download from: Publisher's site
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.
Brun, T, Devetak, I & Hsieh, M 1970, 'Entanglement-assisted quantum error correction', The 6th Asian Conference on Quantum Information Science (AQIS06), BeiJing, China.
Deaho Cha, Blumenstein, M, Hong Zhang & Dong-Sheng Jeng 1970, 'Improvement of an Artificial Neural Network Model using Min-Max Preprocessing for the Prediction of Wave-induced Seabed Liquefaction', The 2006 IEEE International Joint Conference on Neural Network Proceedings, The 2006 IEEE International Joint Conference on Neural Network Proceedings, IEEE, pp. 4577-4581.
View/Download from: Publisher's site
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.
Fortnow, L, Lee, T & Vereshchagin, N 1970, 'Kolmogorov Complexity with Error', Springer Berlin Heidelberg, pp. 137-148.
View/Download from: Publisher's site
Green, S & Blumenstein, M 1970, 'An Exhaustive Search Strategy for Detecting Persons in Beach Scenes using Digital Video Imagery and Neural Network-based Classification', The 2006 IEEE International Joint Conference on Neural Network Proceedings, The 2006 IEEE International Joint Conference on Neural Network Proceedings, IEEE, pp. 2439-2444.
View/Download from: Publisher's site
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 1970, 'Qubit Transport and Fault-tolerant Architectures in Silicon', 2006 International Conference on Nanoscience and Nanotechnology, 2006 International Conference on Nanoscience and Nanotechnology, IEEE, 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 1970, '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, AUSTRALIA, Brisbane, pp. 655-+.
Laplante, S, Lee, T & Szegedy, M 1970, 'THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS', computational complexity, Springer Science and Business Media LLC, pp. 163-196.
View/Download from: Publisher's site
Li, S 1970, '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 Berlin Heidelberg, Guilin, China, pp. 252-264.
View/Download from: 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 1970, 'A Novel Avalanche Free Single Photon Detector', 2006 Sixth IEEE Conference on Nanotechnology, 2006 Sixth IEEE Conference on Nanotechnology, IEEE, pp. 742-745.
View/Download from: Publisher's site
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.
