An improved seeded region growing algorithm

Recently Adams and Bischof (1994) proposed a novel region growing algorithm for segmenting intensity images. The inputs to the algorithm are the intensity image and a set of seeds - individual points or connected components - that identify the individual regions to be segmented. The algorithm grows these seed regions until all of the image pixels have been assimilated. Unfortunately the algorithm is inherently dependent on the order of pixel processing. This means, for example, that raster order processing and anti-raster order processing do not, in general, lead to the same tessellation. In this paper we propose an improved seeded region growing algorithm that retains the advantages of the Adams and Bischof algorithm fast execution, robust segmentation, and no tuning parameters - but is pixel order independent. (C) 1997 Elsevier Science B.V.

Integrable open-boundary conditions for the q-deformed supersymmetric U model of strongly correlated electrons

A general graded reflection equation algebra is proposed and the corresponding boundary quantum inverse scattering method is formulated. The formalism is applicable to all boundary lattice systems where an invertible R-matrix exists. As an application, the integrable open-boundary conditions for the q-deformed supersymmetric U model of strongly correlated electrons are investigated. The diagonal boundary K-matrices are found and a class of integrable boundary terms are determined. The boundary system is solved by means of the coordinate space Bethe ansatz technique and the Bethe ansatz equations are derived. As a sideline, it is shown that all R-matrices associated with a quantum affine superalgebra enjoy the crossing-unitarity property. (C) 1998 Elsevier Science B.V.

Prediction of MHC class II-binding peptides using an evolutionary algorithm and artificial neural network

Motivation: Prediction methods for identifying binding peptides could minimize the number of peptides required to be synthesized and assayed, and thereby facilitate the identification of potential T-cell epitopes. We developed a bioinformatic method for the prediction of peptide binding to MHC class II molecules. Results: Experimental binding data and expert knowledge of anchor positions and binding motifs were combined with an evolutionary algorithm (EA) and an artificial neural network (ANN): binding data extraction --> peptide alignment --> ANN training and classification. This method, termed PERUN, was implemented for the prediction of peptides that bind to HLA-DR4(B1*0401). The respective positive predictive values of PERUN predictions of high-, moderate-, low- and zero-affinity binder-a were assessed as 0.8, 0.7, 0.5 and 0.8 by cross-validation, and 1.0, 0.8, 0.3 and 0.7 by experimental binding. This illustrates the synergy between experimentation and computer modeling, and its application to the identification of potential immunotheraaeutic peptides.

New integrable boundary conditions for the q-deformed supersymmetric U model and Bethe ansatz equations

New classes of integrable boundary conditions for the q-deformed (or two-parameter) supersymmetric U model are presented. The boundary systems are solved by using the coordinate space Bethe ansatz technique and Bethe ansatz equations are derived. (C) 1998 Elsevier Science B.V.

The nurse lecturer role in clinical practice conceptualized: helping clinical teachers provide optimal student learning

Despite the fairly wide reporting in the literature of the ma ny roles of clinical supervision by the nursing teacher, little attention has been given to conceptualizing the relative priorities these roles take during the process of supervising nursing students in clinical practice. The purpose of this paper is to consider the manifestations and implications of conflicting roles when nurse lecturers undertake clinical supervision. Previously published research will provide working examples of issues in a conceptual framework for clinical teaching.

Structure-activity relationships of omega-conotoxins MVIIA, MVIIC and 14 loop splice hybrids at N and P/Q-type calcium channels

The omega-conotoxins are a set of structurally related, four-loop, six cysteine containing peptides, that have a range of selectivities for different subtypes of the voltage-sensitive calcium channel (VSCC). To investigate the basis of the selectivity displayed by these peptides, we have studied the binding affinities of two naturally occurring omega-conotoxins, MVIIA and MVIIC and a series of 14 MVIIA/MVIIC loop hybrids using radioligand binding assays for N and P/Q-type Ca2+ channels in rat brain tissue. A selectivity profile was developed from the ratio of relative potencies at N-type VSCCs (using [I-125]GVIA radioligand binding assays) and P/Q-type VSCCs (using [I-125]MVIIC radioligand binding assays). in these peptides, loops 2 and 4 make the greatest contribution to VSCC subtype selectivity, while the effects of loops 1 and 3 are negligible. Peptides with homogenous combinations of loop 2 and 4 display clear selectivity preferences, while those with heterogeneous combinations of loops 2 and 4 are less discriminatory. H-1 NMR spectroscopy revealed that the global folds of MVIIA, MVIIC and the 14 loop hybrid peptides were similar; however, several differences in local structure were identified. Based on the binding data and the 3D structures of MVIIA, GVIA and MVIIC, we have developed a preliminary pharmacophore based on the omega-conotoxin residues most Likely to interact with the N-type VSCC. (C) 1999 Academic Press.

A consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements

To translate and transfer solution data between two totally different meshes (i.e. mesh 1 and mesh 2), a consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements is presented in this paper. The proposed algorithm has the following significant advantages: (1) The use of a point-searching strategy allows a point in one mesh to be accurately related to an element (containing this point) in another mesh. Thus, to translate/transfer the solution of any particular point from mesh 2 td mesh 1, only one element in mesh 2 needs to be inversely mapped. This certainly minimizes the number of elements, to which the inverse mapping is applied. In this regard, the present algorithm is very effective and efficient. (2) Analytical solutions to the local co ordinates of any point in a four-node quadrilateral element, which are derived in a rigorous mathematical manner in the context of this paper, make it possible to carry out an inverse mapping process very effectively and efficiently. (3) The use of consistent interpolation enables the interpolated solution to be compatible with an original solution and, therefore guarantees the interpolated solution of extremely high accuracy. After the mathematical formulations of the algorithm are presented, the algorithm is tested and validated through a challenging problem. The related results from the test problem have demonstrated the generality, accuracy, effectiveness, efficiency and robustness of the proposed consistent point-searching algorithm. Copyright (C) 1999 John Wiley & Sons, Ltd.

Level-one highest weight representations of U-q[g1(1 vertical bar 1)] and associated vertex operators

We study the level-one irreducible highest weight representations of U-q[gl(1\1)] and associated q-vertex operators. We obtain the exchange relations satisfied by these vertex operators. The characters and supercharacters associated with these irreducible representations are calculated'. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

The clinical utility of the Hopkins Verbal Learning Test as a screening test for mild dementia

Objective. The purpose of this study was to determine whether the Hopkins Verbal Learning Test (HVLT) could be used as a valid and reliable screening test for mild dementia in older people, and to compare its performance to that of the Mini-Mental State Examination (MMSE). Method. Using a cross-sectional design, we studied three groups of older subjects recruited from a district geriatric psychiatry service: (1) 26 patients with DSM-IV dementia and MMSE scores of 18 or better; (2) 15 patients with psychiatric diagnoses other than dementia; and (3) 15 normal controls. The relationship of each potential cutting point on the HVLT and the MMSE was examined against the independently ascertained DSM-IV diagnoses of dementia using a Receiver Operating Characteristic (ROC) analysis. Results. The subjects consisted of 21 (37.5%) males and 35 (62.5%) females with a mean age of 74.7 (SD 6.1) years and a mean of 8.5 (SD 1.8) years of formal education. ROC analysis indicated that the optimal cutting point for detecting mild dementia in this group of subjects using the HVLT was 18/19 (sensitivity = 0.96, specificity = 0.80) and using the MMSE was 25/26 (sensitivity = 0.88, specificity = 0.93). Conclusions. The HVLT can be recommended as a valid and reliable screening test for mild dementia and as an adjunct in the clinical assessment of older people. The HVLT had better sensitivity than the MMSE in detecting patients with mild dementia, whereas the MMSE had better specificity. Copyright (C) 2000 John Wiley & Sons, Ltd.