Narrow stripe selective growth of InGaAlAs waveguides used for buried heterostructure lasers - art. no. 63210I

The narrow stripe selective growth of the InGaAlAs bulk waveguides and InGaAlAs MQW waveguides was first investigated. Flat and clear interfaces were obtained for the selectively grown InGaAlAs waveguides under optimized growth conditions. These selectively grown InGaAlAs waveguides were covered by specific InP layers, which can keep the waveguides from being oxidized during the fabrication of devices. PL peak wavelength shifts of 70 nm for the InGaAlAs bulk waveguides and 73 nm for the InGaAlAs MQW waveguides were obtained with a small mask stripe width varying from 0 to 40 gm, and were interpreted in considering both the migration effect from the masked region (MMR) and the lateral vapor diffusion effect (LVD). The quality of the selectively grown InGaAlAs MQW waveguides was confirmed by the PL peak intensity and the PL FWHM. Using the narrow stripe selectively grown InGaAlAs MQW waveguides, then the buried heterostructure (BH) lasers were fabricated by a developed unselective regrowth method, instead of conventional selective regrowth. The InGaAlAs MQW BH lasers exhibit good performance characteristics, with a high internal differential quantum efficiency of about 85% and an internal loss of 6.7 cm(-1).

Grey relational analysis on the relation between marine environmental factors and oxidation-reduction potential

The effects of marine environmental factors-temperature (T), dissolved oxygen (DO), salinity (S) and pH-on the oxidation-reduction potential (ORP) of natural seawater were studied in laboratory. The results show an indistinct relationship between these four factors and the ORP, but they did impact the ORP Common mathematical methods were not applicable for describing the relationship. Therefore, a grey relational analysis (GRA) method was developed. The degrees of correlation were calculated according to GRA and the values of T, pH, DO and S were 0.744, 0.710, 0.692 and 0.690, respectively. From these values, the relations of these factors to the ORP could be described and evaluated, and those of T and pH were relatively major. In general, ORP is influenced by the synergic effect of T, DO, pH and S, with no single factor having an outstanding role.

用改进的ART-2网络建立移动机器人环境模型的研究

本文应用自适应共振理论中ART-2神经网络进行移动机器人环境障碍模式识别。ART-2神经网络在处理单方向渐变的模式输入时具有模式漂移的特点，机器人在静态环境中运动依赖这种特点，但在动态环境中模式漂移的特点却会对机器人的安全造成威胁。为此，设计了一种改进的ART-2神经网络，使得移动机器人同时适应在静态和动态环境中安全运动。

含空值关系数据库中关系代数的实现

本文从空值的完全语义出发,依据空值环境下信息等价和信息相容的含义,全面定义了空值环境下运算结果完备的关系代数运算,并对空值环境下关系代数运算的有效性和完备性进行了讨论。

Tactile Sensing for Mechatronics: A State of the Art Survey

Lee M.H. and Nicholls H.R., Tactile Sensing for Mechatronics: A State of the Art Survey, Mechatronics, 9, Jan 1999, pp1-31.

Scalable Multi-Relational Association Mining

Clare, A., Williams, H. E. and Lester, N. M. (2004) Scalable Multi-Relational Association Mining. In proceedings of the 4th International Conference on Data Mining ICDM '04.

ART: An ontology based tool for the translation of papers into Semantic Web format

To be presented at SIG/ISMB07 ontology workshop: http://bio-ontologies.org.uk/index.php To be published in BMC Bioinformatics. Sponsorship: JISC

From Art to Avant Garde? Television, Formalism and the Arts Documentary in 1960's Britain

Sexton, J. (2008). From Art to Avant Garde? Television, Formalism and the Arts Documentary in 1960's Britain. In L. Mulvey and J. Sexton (Eds.), Experimental British Television (pp.89-105). Manchester: Manchester University Press. RAE2008

Integration of relational and hierarchical network information for protein function prediction

BACKGROUND:In the current climate of high-throughput computational biology, the inference of a protein's function from related measurements, such as protein-protein interaction relations, has become a canonical task. Most existing technologies pursue this task as a classification problem, on a term-by-term basis, for each term in a database, such as the Gene Ontology (GO) database, a popular rigorous vocabulary for biological functions. However, ontology structures are essentially hierarchies, with certain top to bottom annotation rules which protein function predictions should in principle follow. Currently, the most common approach to imposing these hierarchical constraints on network-based classifiers is through the use of transitive closure to predictions.RESULTS:We propose a probabilistic framework to integrate information in relational data, in the form of a protein-protein interaction network, and a hierarchically structured database of terms, in the form of the GO database, for the purpose of protein function prediction. At the heart of our framework is a factorization of local neighborhood information in the protein-protein interaction network across successive ancestral terms in the GO hierarchy. We introduce a classifier within this framework, with computationally efficient implementation, that produces GO-term predictions that naturally obey a hierarchical 'true-path' consistency from root to leaves, without the need for further post-processing.CONCLUSION:A cross-validation study, using data from the yeast Saccharomyces cerevisiae, shows our method offers substantial improvements over both standard 'guilt-by-association' (i.e., Nearest-Neighbor) and more refined Markov random field methods, whether in their original form or when post-processed to artificially impose 'true-path' consistency. Further analysis of the results indicates that these improvements are associated with increased predictive capabilities (i.e., increased positive predictive value), and that this increase is consistent uniformly with GO-term depth. Additional in silico validation on a collection of new annotations recently added to GO confirms the advantages suggested by the cross-validation study. Taken as a whole, our results show that a hierarchical approach to network-based protein function prediction, that exploits the ontological structure of protein annotation databases in a principled manner, can offer substantial advantages over the successive application of 'flat' network-based methods.

Bring ART into the ACT

ACT is compared with a particular type of connectionist model that cannot handle symbols and use non-biological operations that cannot learn in real time. This focus continues an unfortunate trend of straw man "debates" in cognitive science. Adaptive Resonance Theory, or ART, neural models of cognition can handle both symbols and sub-symbolic representations, and meets the Newell criteria at least as well as these models.

Biased ART: A Neural Architecture that Shifts Attention Toward Previously Disregarded Features Following an Incorrect Prediction

Memories in Adaptive Resonance Theory (ART) networks are based on matched patterns that focus attention on those portions of bottom-up inputs that match active top-down expectations. While this learning strategy has proved successful for both brain models and applications, computational examples show that attention to early critical features may later distort memory representations during online fast learning. For supervised learning, biased ARTMAP (bARTMAP) solves the problem of over-emphasis on early critical features by directing attention away from previously attended features after the system makes a predictive error. Small-scale, hand-computed analog and binary examples illustrate key model dynamics. Twodimensional simulation examples demonstrate the evolution of bARTMAP memories as they are learned online. Benchmark simulations show that featural biasing also improves performance on large-scale examples. One example, which predicts movie genres and is based, in part, on the Netflix Prize database, was developed for this project. Both first principles and consistent performance improvements on all simulation studies suggest that featural biasing should be incorporated by default in all ARTMAP systems. Benchmark datasets and bARTMAP code are available from the CNS Technology Lab Website: http://techlab.bu.edu/bART/.

On the Relationship Between the Generalized Equality Classifier and ART 2 Neural Networks

In this paper, we introduce the Generalized Equality Classifier (GEC) for use as an unsupervised clustering algorithm in categorizing analog data. GEC is based on a formal definition of inexact equality originally developed for voting in fault tolerant software applications. GEC is defined using a metric space framework. The only parameter in GEC is a scalar threshold which defines the approximate equality of two patterns. Here, we compare the characteristics of GEC to the ART2-A algorithm (Carpenter, Grossberg, and Rosen, 1991). In particular, we show that GEC with the Hamming distance performs the same optimization as ART2. Moreover, GEC has lower computational requirements than AR12 on serial machines.

ART-EMAP: A Neural Network Architecture for Learning and Prediction by Evidence Accumulation

This paper introduces ART-EMAP, a neural architecture that uses spatial and temporal evidence accumulation to extend the capabilities of fuzzy ARTMAP. ART-EMAP combines supervised and unsupervised learning and a medium-term memory process to accomplish stable pattern category recognition in a noisy input environment. The ART-EMAP system features (i) distributed pattern registration at a view category field; (ii) a decision criterion for mapping between view and object categories which can delay categorization of ambiguous objects and trigger an evidence accumulation process when faced with a low confidence prediction; (iii) a process that accumulates evidence at a medium-term memory (MTM) field; and (iv) an unsupervised learning algorithm to fine-tune performance after a limited initial period of supervised network training. ART-EMAP dynamics are illustrated with a benchmark simulation example. Applications include 3-D object recognition from a series of ambiguous 2-D views.