The doodle of a finitely determined map germ from R(2) to R(3)

Let f : U subset of R(2) -> R(3) be a representative of a finitely determined map germ f : (R(2), 0) -> (R(3), 0). Consider the curve obtained as the intersection of the image of the mapping f with a sufficiently small sphere s(epsilon)(2) centered at the origin in R(3), call this curve the associated doodle of the map germ f. For a large class of map germs the associated doodle has many transversal self-intersections. The topological classification of such map germs is considered from the point of view of the associated doodles. (C) 2009 Elsevier Inc. All rights reserved.

Geometria e topologia das superfícies através de recorte e colagem

Pós-graduação em Matemática Universitária - IGCE

Synthesis of Hand Exoskeletons for the Rehabilitation of Post-Stroke Patients

This dissertation presents the synthesis of a hand exoskeleton (HE) for the rehabilitation of post-stroke patients. Through the analysis of state-of-the-art, a topological classification was proposed. Based on the proposed classification principles, the rehabilitation HEs were systematically analyzed and classified. This classification is helpful to both understand the reason of proposing certain solutions for specific applications and provide some useful guidelines for the design of a new HE, that was actually the primary motivation of this study. Further to this classification, a novel rehabilitation HE was designed to support patients in cylindrical shape grasping tasks with the aim of recovering the basic functions of manipulation. The proposed device comprises five planar mechanisms, one per finger, globally actuated by two electric motors. Indeed, the thumb flexion/extension movement is controlled by one actuator whereas a second actuator is devoted to the control of the flexion/extension of the other four fingers. By focusing on the single finger mechanism, intended as the basic model of the targeted HE, the feasibility study of three different 1 DOF mechanisms are analyzed: a 6-link mechanism, that is connected to the human finger only at its tip, an 8-link and a 12-link mechanisms where phalanges and articulations are part of the kinematic chain. The advantages and drawbacks of each mechanism are deeply analyzed with respect to targeted requirements: the 12-link mechanism was selected as the most suitable solution. The dimensional synthesis based on the Burmester theory as well as kinematic and static analyses were separately done for all fingers in order to satisfy the desired specifications. The HE was finally designed and a prototype was built. The experimental results of the first tests are promising and demonstrate the potential for clinical applications of the proposed device in robot-assisted training of the human hand for grasping functions.

Topological K-classification of finitely determined map germs

We consider smooth finitely C 0-K-determined map germs f: (ℝn, 0) → (ℝp, 0) and we look at the classification under C 0-K-equivalence. The main tool is the homotopy type of the link, which is obtained by intersecting the image of f with a small enough sphere centered at the origin. When f -1(0) = {0}, the link is a smooth map between spheres and f is C 0-K-equivalent to the cone of its link. When f -1(0) ≠ {0}, we consider a link diagram, which contains some extra information, but again f is C 0-K-equivalent to the generalized cone. As a consequence, we deduce some known results due to Nishimura (for n = p) or the first named author (for n < p). We also prove some new results of the same nature. © 2012 Springer Science+Business Media Dordrecht.

Topological side-chain classification of beta-turns: Ideal motifs for peptidomimetic development

beta-turns are important topological motifs for biological recognition of proteins and peptides. Organic molecules that sample the side chain positions of beta-turns have shown broad binding capacity to multiple different receptors, for example benzodiazepines. beta-turns have traditionally been classified into various types based on the backbone dihedral angles (phi 2, psi 2, phi 3 and psi 3). Indeed, 57-68% of beta-turns are currently classified into 8 different backbone families (Type I, Type II, Type I', Type II', Type VIII, Type VIa1, Type VIa2 and Type VIb and Type IV which represents unclassified beta-turns). Although this classification of beta-turns has been useful, the resulting beta-turn types are not ideal for the design of beta-turn mimetics as they do not reflect topological features of the recognition elements, the side chains. To overcome this, we have extracted beta-turns from a data set of non-homologous and high-resolution protein crystal structures. The side chain positions, as defined by C-alpha-C-beta vectors, of these turns have been clustered using the kth nearest neighbor clustering and filtered nearest centroid sorting algorithms. Nine clusters were obtained that cluster 90% of the data, and the average intra-cluster RMSD of the four C-alpha-C-beta vectors is 0.36. The nine clusters therefore represent the topology of the side chain scaffold architecture of the vast majority of beta-turns. The mean structures of the nine clusters are useful for the development of beta-turn mimetics and as biological descriptors for focusing combinatorial chemistry towards biologically relevant topological space.

On a Syntactic Characterization of Classification with a Mind Change Bound

Most learning paradigms impose a particular syntax on the class of concepts to be learned; the chosen syntax can dramatically affect whether the class is learnable or not. For classification paradigms, where the task is to determine whether the underlying world does or does not have a particular property, how that property is represented has no implication on the power of a classifier that just outputs 1’s or 0’s. But is it possible to give a canonical syntactic representation of the class of concepts that are classifiable according to the particular criteria of a given paradigm? We provide a positive answer to this question for classification in the limit paradigms in a logical setting, with ordinal mind change bounds as a measure of complexity. The syntactic characterization that emerges enables to derive that if a possibly noncomputable classifier can perform the task assigned to it by the paradigm, then a computable classifier can also perform the same task. The syntactic characterization is strongly related to the difference hierarchy over the class of open sets of some topological space; this space is naturally defined from the class of possible worlds and possible data of the learning paradigm.

Two new atom centered fragment descriptors and scoring function enhance classification of antibacterial activity

Classification of pharmacologic activity of a chemical compound is an essential step in any drug discovery process. We develop two new atom-centered fragment descriptors (vertex indices) - one based solely on topological considerations without discriminating atomor bond types, and another based on topological and electronic features. We also assess their usefulness by devising a method to rank and classify molecules with regard to their antibacterial activity. Classification performances of our method are found to be superior compared to two previous studies on large heterogeneous data sets for hit finding and hit-to-lead studies even though we use much fewer parameters. It is found that for hit finding studies topological features (simple graph) alone provide significant discriminating power, and for hit-to-lead process small but consistent improvement can be made by additionally including electronic features (colored graph). Our approach is simple, interpretable, and suitable for design of molecules as we do not use any physicochemical properties. The singular use of vertex index as descriptor, novel range based feature extraction, and rigorous statistical validation are the key elements of this study.

Biomimetic (topological) pattern recognition - A new model of pattern recognition theory and its application

A new theoretical model of Pattern Recognition principles was proposed, which is based on "matter cognition" instead of "matter classification" in traditional statistical Pattern Recognition. This new model is closer to the function of human being, rather than traditional statistical Pattern Recognition using "optimal separating" as its main principle. So the new model of Pattern Recognition is called the Biomimetic Pattern Recognition (BPR)(1). Its mathematical basis is placed on topological analysis of the sample set in the high dimensional feature space. Therefore, it is also called the Topological Pattern Recognition (TPR). The fundamental idea of this model is based on the fact of the continuity in the feature space of any one of the certain kinds of samples. We experimented with the Biomimetic Pattern Recognition (BPR) by using artificial neural networks, which act through covering the high dimensional geometrical distribution of the sample set in the feature space. Onmidirectionally cognitive tests were done on various kinds of animal and vehicle models of rather similar shapes. For the total 8800 tests, the correct recognition rate is 99.87%. The rejection rate is 0.13% and on the condition of zero error rates, the correct rate of BPR was much better than that of RBF-SVM.

Topological mappings between graphs, trees and generalized trees

We present novel topological mappings between graphs, trees and generalized trees that means between structured objects with different properties. The two major contributions of this paper are, first, to clarify the relation between graphs, trees and generalized trees, a graph class recently introduced. Second, these transformations provide a unique opportunity to transform structured objects into a representation that might be beneficial for a processing, e.g., by machine learning techniques for graph classification. (c) 2006 Elsevier Inc. All rights reserved.

Topological multi-contour decomposition for image analysis and image retrieval

Successful classification, information retrieval and image analysis tools are intimately related with the quality of the features employed in the process. Pixel intensities, color, texture and shape are, generally, the basis from which most of the features are Computed and used in such fields. This papers presents a novel shape-based feature extraction approach where an image is decomposed into multiple contours, and further characterized by Fourier descriptors. Unlike traditional approaches we make use of topological knowledge to generate well-defined closed contours, which are efficient signatures for image retrieval. The method has been evaluated in the CBIR context and image analysis. The results have shown that the multi-contour decomposition, as opposed to a single shape information, introduced a significant improvement in the discrimination power. (c) 2008 Elsevier B.V. All rights reserved,

The use of classification methods for modeling the antioxidant activity of flavonoid compounds

A study using two classification methods (SDA and SIMCA) was carried out in this work with the aim of investigating the relationship between the structure of flavonoid compounds and their free-radical-scavenging ability. In this work, we report the use of chemometric methods (SDA and SIMCA) able to select the most relevant variables (steric, electronic, and topological) responsible for this ability. The results obtained with the SDA and SIMCA methods agree perfectly with our previous model, in which we used other chemometric methods (PCA, HCA and KNN) and are also corroborated with experimental results from the literature. This is a strong indication of how reliable the selection of variables is.

Complex network classification using partially self-avoiding deterministic walks

Complex networks have attracted increasing interest from various fields of science. It has been demonstrated that each complex network model presents specific topological structures which characterize its connectivity and dynamics. Complex network classification relies on the use of representative measurements that describe topological structures. Although there are a large number of measurements, most of them are correlated. To overcome this limitation, this paper presents a new measurement for complex network classification based on partially self-avoiding walks. We validate the measurement on a data set composed by 40000 complex networks of four well-known models. Our results indicate that the proposed measurement improves correct classification of networks compared to the traditional ones. (C) 2012 American Institute of Physics. [http://dx.doi.org/10.1063/1.4737515]

Pseudo-Compact Semi-Topological Groups

Митрофан М. Чобан, Петър Ст. Кендеров, Уорън Б. Муурс - Полу-топологична група (съответно, топологична група) е група, снабдена с топология, относно която груповата оперция произведение е частично непрекъсната по всяка от променливите (съответно, непрекъсната по съвкупност от променливите и обратната операция е също непрекъсната). В настоящата работа ние даваме условия, от топологичен характер, една полу-топологична група да е всъщност топологична група. Например, ние показваме, че всяка сепарабелна псевдокомпактна полу-топологична група е топологична група. Показваме също, че всяка локално псевдокомпактна полу-топологична група, чиято групова операция е непрекъсната по съвкупност от променливите е топологична група.

About Topological Groups and the Baire Property in Remainders

Александър В. Архангелски, Митрофан М. Чобан, Екатерина П. Михайлова - Изследвани са прирасти със свойството на Бер на топологични групи.

On Local Uniform Topological Algebras

2000 Mathematics Subject Classification: Primary 46H05, 46H20; Secondary 46M20.