Morphological classification of microtidal sand and gravel beaches

A new classification of microtidal sand and gravel beaches with very different morphologies is presented below. In 557 studied transects, 14 variables were used. Among the variables to be emphasized is the depth of the Posidonia oceanica. The classification was performed for 9 types of beaches: Type 1: Sand and gravel beaches, Type 2: Sand and gravel separated beaches, Type 3: Gravel and sand beaches, Type 4: Gravel and sand separated beaches, Type 5: Pure gravel beaches, Type 6: Open sand beaches, Type 7: Supported sand beaches, Type 8: Bisupported sand beaches and Type 9: Enclosed beaches. For the classification, several tools were used: discriminant analysis, neural networks and Support Vector Machines (SVM), the results were then compared. As there is no theory for deciding which is the most convenient neural network architecture to deal with a particular data set, an experimental study was performed with different numbers of neuron in the hidden layer. Finally, an architecture with 30 neurons was chosen. Different kernels were employed for SVM (Linear, Polynomial, Radial basis function and Sigmoid). The results obtained for the discriminant analysis were not as good as those obtained for the other two methods (ANN and SVM) which showed similar success.

An updated evolutionary classification of CRISPR–Cas systems

The evolution of CRISPR–cas loci, which encode adaptive immune systems in archaea and bacteria, involves rapid changes, in particular numerous rearrangements of the locus architecture and horizontal transfer of complete loci or individual modules. These dynamics complicate straightforward phylogenetic classification, but here we present an approach combining the analysis of signature protein families and features of the architecture of cas loci that unambiguously partitions most CRISPR–cas loci into distinct classes, types and subtypes. The new classification retains the overall structure of the previous version but is expanded to now encompass two classes, five types and 16 subtypes. The relative stability of the classification suggests that the most prevalent variants of CRISPR–Cas systems are already known. However, the existence of rare, currently unclassifiable variants implies that additional types and subtypes remain to be characterized.

Propuesta de una nueva clasificación de los oligoelementos para su aplicación en nutrición, oligoterapia, y otras estrategias terapéuticas

Objetivos: 1) Proponer una nueva clasificación de los oligoelementos fundamentada en el estudio detallado de las investigaciones más recientes sobre los mismos; 2) ofrecer información detallada y actualizada sobre todos los oligoelementos. Resultados: el análisis de todos los resultados de investigación consultados pone de manifiesto que los avances en las técnicas de análisis molecular permiten dilucidar la importancia que presentan ciertos oligoelementos para la salud humana. Se ofrece un análisis detallado de la función catalítica que podrían tener determinados elementos no considerados hasta ahora como esenciales o posiblemente esenciales, gracias al uso de plataformas informáticas que permiten el análisis integrado de datos sobre enzimas. Asimismo se presenta información integrada y actualizada del papel fisiológico, cinéticas y metabolismo, fuentes dietéticas y factores que propician la carencia o la toxicidad de cada uno de los oligoelementos. Conclusiones: La Oligoterapia plantea el uso de oligoelementos catalíticamente activos con fines terapéuticos. La nueva clasificación de oligoelementos planteada en este trabajo será de interés para diversos sectores profesionales: médicos y demás personal sanitario, nutricionistas, farmacéuticos, etc. Así podrán diseñarse nuevas estrategias terapéuticas que permitan paliar la sintomatología de diversas patologías, en particular las enfermedades carenciales y metabólicas.

Growing Neural Gas approach for obtaining homogeneous maps by restricting the insertion of new nodes

The Growing Neural Gas model is used widely in artificial neural networks. However, its application is limited in some contexts by the proliferation of nodes in dense areas of the input space. In this study, we introduce some modifications to address this problem by imposing three restrictions on the insertion of new nodes. Each restriction aims to maintain the homogeneous values of selected criteria. One criterion is related to the square error of classification and an alternative approach is proposed for avoiding additional computational costs. Three parameters are added that allow the regulation of the restriction criteria. The resulting algorithm allows models to be obtained that suit specific needs by specifying meaningful parameters.

A new betweenness centrality measure based on an algorithm for ranking the nodes of a network

We propose and discuss a new centrality index for urban street patterns represented as networks in geographical space. This centrality measure, that we call ranking-betweenness centrality, combines the idea behind the random-walk betweenness centrality measure and the idea of ranking the nodes of a network produced by an adapted PageRank algorithm. We initially use a PageRank algorithm in which we are able to transform some information of the network that we want to analyze into numerical values. Numerical values summarizing the information are associated to each of the nodes by means of a data matrix. After running the adapted PageRank algorithm, a ranking of the nodes is obtained, according to their importance in the network. This classification is the starting point for applying an algorithm based on the random-walk betweenness centrality. A detailed example of a real urban street network is discussed in order to understand the process to evaluate the ranking-betweenness centrality proposed, performing some comparisons with other classical centrality measures.

Improving classification using a Confidence Matrix based on weak classifiers applied to OCR

This paper proposes a new feature representation method based on the construction of a Confidence Matrix (CM). This representation consists of posterior probability values provided by several weak classifiers, each one trained and used in different sets of features from the original sample. The CM allows the final classifier to abstract itself from discovering underlying groups of features. In this work the CM is applied to isolated character image recognition, for which several set of features can be extracted from each sample. Experimentation has shown that the use of CM permits a significant improvement in accuracy in most cases, while the others remain the same. The results were obtained after experimenting with four well-known corpora, using evolved meta-classifiers with the k-Nearest Neighbor rule as a weak classifier and by applying statistical significance tests.

Improving kNN multi-label classification in Prototype Selection scenarios using class proposals

Prototype Selection (PS) algorithms allow a faster Nearest Neighbor classification by keeping only the most profitable prototypes of the training set. In turn, these schemes typically lower the performance accuracy. In this work a new strategy for multi-label classifications tasks is proposed to solve this accuracy drop without the need of using all the training set. For that, given a new instance, the PS algorithm is used as a fast recommender system which retrieves the most likely classes. Then, the actual classification is performed only considering the prototypes from the initial training set belonging to the suggested classes. Results show that this strategy provides a large set of trade-off solutions which fills the gap between PS-based classification efficiency and conventional kNN accuracy. Furthermore, this scheme is not only able to, at best, reach the performance of conventional kNN with barely a third of distances computed, but it does also outperform the latter in noisy scenarios, proving to be a much more robust approach.

New Approach for Correction of Error Associated With Keratometric Estimation of Corneal Power in Keratoconus

The aim of this study was to obtain the exact value of the keratometric index (nkexact) and to clinically validate a variable keratometric index (nkadj) that minimizes this error. Methods: The nkexact value was determined by obtaining differences (DPc) between keratometric corneal power (Pk) and Gaussian corneal power (PGauss c ) equal to 0. The nkexact was defined as the value associated with an equivalent difference in the magnitude of DPc for extreme values of posterior corneal radius (r2c) for each anterior corneal radius value (r1c). This nkadj was considered for the calculation of the adjusted corneal power (Pkadj). Values of r1c ∈ (4.2, 8.5) mm and r2c ∈ (3.1, 8.2) mm were considered. Differences of True Net Power with PGauss c , Pkadj, and Pk(1.3375) were calculated in a clinical sample of 44 eyes with keratoconus. Results: nkexact ranged from 1.3153 to 1.3396 and nkadj from 1.3190 to 1.3339 depending on the eye model analyzed. All the nkadj values adjusted perfectly to 8 linear algorithms. Differences between Pkadj and PGauss c did not exceed 60.7 D (Diopter). Clinically, nk = 1.3375 was not valid in any case. Pkadj and True Net Power and Pk(1.3375) and Pkadj were statistically different (P , 0.01), whereas no differences were found between PGauss c and Pkadj (P . 0.01). Conclusions: The use of a single value of nk for the calculation of the total corneal power in keratoconus has been shown to be imprecise, leading to inaccuracies in the detection and classification of this corneal condition. Furthermore, our study shows the relevance of corneal thickness in corneal power calculations in keratoconus.

A new survey of cool supergiants in the Magellanic Clouds

Aims. In this study we conduct a pilot program aimed at the red supergiant population of the Magellanic Clouds. We intend to extend the current known sample to the unexplored low end of the brightness distribution of these stars, building a more representative dataset with which to extrapolate their behaviour to other Galactic and extra-galactic environments. Methods. We select candidates using only near infrared photometry, and with medium resolution multi-object spectroscopy, we perform spectral classification and derive their line-of-sight velocities, confirming the nature of the candidates and their membership in the clouds. Results. Around two hundred new red supergiants have been detected, hinting at a yet to be observed large population. Using near- and mid-infrared photometry we study the brightness distribution of these stars, the onset of mass-loss, and the effect of dust in their atmospheres. Based on this sample, new a priori classification criteria are investigated, combining mid- and near-infrared photometry to improve the observational efficiency of similar programs to this.

Where Are We After Five Editions?: Robot Vision Challenge, a Competition that Evaluates Solutions for the Visual Place Classification Problem

This article describes the Robot Vision challenge, a competition that evaluates solutions for the visual place classification problem. Since its origin, this challenge has been proposed as a common benchmark where worldwide proposals are measured using a common overall score. Each new edition of the competition introduced novelties, both for the type of input data and subobjectives of the challenge. All the techniques used by the participants have been gathered up and published to make it accessible for future developments. The legacy of the Robot Vision challenge includes data sets, benchmarking techniques, and a wide experience in the place classification research that is reflected in this article.