Готові списки джерел за темами / Topological selection

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій

Добірка наукової літератури з теми "Topological selection"

Автор: Grafiati

Опубліковано: 3 лютого 2024

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Topological selection".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Topological selection"

Hu, Shaoxiong, Hugo Maruri-Aguilar, and Zixiang Ma. "Topological techniques in model selection." Algebraic Statistics 13, no. 1 (December 31, 2022): 41–56. http://dx.doi.org/10.2140/astat.2022.13.41.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Yatsyshen, V. V., and A. Yu Gordeev. "Electrodynamic target selection techniques." Journal of «Almaz – Antey» Air and Space Defence Corporation, no. 1 (March 30, 2016): 61–68. http://dx.doi.org/10.38013/2542-0542-2016-1-61-68.

Повний текст джерела

Анотація:

We examine a new electrodynamic approach to target selection. The study shows that in the case of p-polarisation, a topological portrait of two types of angle reflectors is in a certain sense inverted in relation to that of the s-polarisation case, and consequently, evident polarisation dependence of angle reflector topological portraits may be traced.

Стилі APA, Harvard, Vancouver, ISO та ін.

Erins, Matiss. "Topological Modeling Based Diagnostic Tests Selection." Technologies of Computer Control 15 (January 16, 2015): 42. http://dx.doi.org/10.7250/tcc.2014.006.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Bahraini, Alireza, and Abdolhossein Abbassian. "Topological pattern selection in recurrent networks." Neural Networks 31 (July 2012): 22–32. http://dx.doi.org/10.1016/j.neunet.2012.02.037.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

de Vel, M. Van. "A Selection Theorem for Topological Convex Structures." Transactions of the American Mathematical Society 336, no. 2 (April 1993): 463. http://dx.doi.org/10.2307/2154358.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Scheepers, Marion, and Franklin D. Tall. "Lindelöf indestructibility, topological games and selection principles." Fundamenta Mathematicae 210, no. 1 (2010): 1–46. http://dx.doi.org/10.4064/fm210-1-1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

van de Vel, M. "A selection theorem for topological convex structures." Transactions of the American Mathematical Society 336, no. 2 (February 1, 1993): 463–96. http://dx.doi.org/10.1090/s0002-9947-1993-1169083-9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Varposhti, Marzieh, Mehdi Dehghan, and Reza Safabakhsh. "Distributed Topological Camera Selection Without Location Information." IEEE Sensors Journal 14, no. 8 (August 2014): 2579–89. http://dx.doi.org/10.1109/jsen.2014.2309797.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Song, Chaofan, Tongqiang Liu, Huan Wang, Haifeng Shi, and Zhuqing Jiao. "Multi-modal feature selection with self-expression topological manifold for end-stage renal disease associated with mild cognitive impairment." Mathematical Biosciences and Engineering 20, no. 8 (2023): 14827–45. http://dx.doi.org/10.3934/mbe.2023664.

Повний текст джерела

Анотація:

<abstract> <p>Effectively selecting discriminative brain regions in multi-modal neuroimages is one of the effective means to reveal the neuropathological mechanism of end-stage renal disease associated with mild cognitive impairment (ESRDaMCI). Existing multi-modal feature selection methods usually depend on the <italic>Euclidean</italic> distance to measure the similarity between data, which tends to ignore the implied data manifold. A self-expression topological manifold based multi-modal feature selection method (SETMFS) is proposed to address this issue employing self-expression topological manifold. First, a dynamic brain functional network is established using functional magnetic resonance imaging (fMRI), after which the betweenness centrality is extracted. The feature matrix of fMRI is constructed based on this centrality measure. Second, the feature matrix of arterial spin labeling (ASL) is constructed by extracting the cerebral blood flow (CBF). Then, the topological relationship matrices are constructed by calculating the topological relationship between each data point in the two feature matrices to measure the intrinsic similarity between the features, respectively. Subsequently, the graph regularization is utilized to embed the self-expression model into topological manifold learning to identify the linear self-expression of the features. Finally, the selected well-represented feature vectors are fed into a multicore support vector machine (MKSVM) for classification. The experimental results show that the classification performance of SETMFS is significantly superior to several state-of-the-art feature selection methods, especially its classification accuracy reaches 86.10%, which is at least 4.34% higher than other comparable methods. This method fully considers the topological correlation between the multi-modal features and provides a reference for ESRDaMCI auxiliary diagnosis.</p> </abstract>

Стилі APA, Harvard, Vancouver, ISO та ін.

Scheepers, Marion. "A Selection Principle and Products in Topological Groups." Axioms 11, no. 6 (June 13, 2022): 286. http://dx.doi.org/10.3390/axioms11060286.

Повний текст джерела

Анотація:

We consider the preservation under products, finite powers, and forcing of a selection-principle-based covering property of T0 topological groups. Though the paper is partly a survey, it contributes some new information: (1) The product of a strictly o-bounded group with an o-bounded group is an o-bounded group—Corollary 1. (2) In the generic extension by a finite support iteration of ℵ1 Hechler reals the product of any o-bounded group with a ground model ℵ0 bounded group is an o-bounded group—Theorem 11. (3) In the generic extension by a countable support iteration of Mathias reals the product of any o-bounded group with a ground model ℵ0 bounded group is an o-bounded group—Theorem 12.

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Topological selection"

Mezabarba, Renan Maneli. "Selection principles in hyperspaces." Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/55/55135/tde-10102018-144937/.

Повний текст джерела

Анотація:

In this work we analyze some selection principles over some classes of hyperspaces. In the first part we consider selective variations of tightness over a class of function spaces whose topologies are determined by bornologies on the space. As results, we extend several well known translations between covering properties and closure properties of the topology of pointwise convergence. In the second part we consider artificial hyperspaces that assist the analysis of productive topological properties. We emphasize the results characterizing productively ccc preorders and the characterization of the Lindelöf property via closed projections.
Neste trabalho analisamos alguns princípios seletivos quando considerados sobre alguns tipos de hiperespaços. Na primeira parte consideramos variações seletivas do tightness sobre diversos tipos de espaços de funções, cujas topologias são determinadas por bornologias no espaço. Como resultados, estendemos diversas traduções conhecidas entre propriedades de recobrimento e propriedades de convergência na topologia da convergência pontual. Na segunda parte consideramos hiperespaços artificiais que auxiliam na análise de propriedades topológicas produtivas. Destacamos os resultados que caracterizam as pré-ordens produtivamente ccc e a caracterização da propriedade de Lindelöf em termos de projeções fechadas.

Стилі APA, Harvard, Vancouver, ISO та ін.

Cuzzupe', Maria Vittoria. "Some selective and monotone versions of covering properties and some results on the cardinality of a topological space." Doctoral thesis, Università di Catania, 2017. http://hdl.handle.net/10761/3830.

Повний текст джерела

Анотація:

This thesis consists of two chapters. In the first one, we investigate some selective and monotone versions of covering properties; in particular we study two selective properties: the selective absolute star-Lindelöfness, defined by S. Bhowmik, and the selective strong star- Menger property. Furthermore, we define and study several properties related to monotone normality. In the second chapter, we give some bounds to the cardinality of particular classes of topological spaces.

Стилі APA, Harvard, Vancouver, ISO та ін.

Dhifli, Wajdi. "Topological and domain Knowledge-based subgraph mining : application on protein 3D-structures." Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2013. http://tel.archives-ouvertes.fr/tel-00946989.

Повний текст джерела

Анотація:

This thesis is in the intersection of two proliferating research fields, namely data mining and bioinformatics. With the emergence of graph data in the last few years, many efforts have been devoted to mining frequent subgraphs from graph databases. Yet, the number of discovered frequentsubgraphs is usually exponential, mainly because of the combinatorial nature of graphs. Many frequent subgraphs are irrelevant because they are redundant or just useless for the user. Besides, their high number may hinder and even makes further explorations unfeasible. Redundancy in frequent subgraphs is mainly caused by structural and/or semantic similarities, since most discovered subgraphs differ slightly in structure and may infer similar or even identical meanings. In this thesis, we propose two approaches for selecting representative subgraphs among frequent ones in order to remove redundancy. Each of the proposed approaches addresses a specific type of redundancy. The first approach focuses on semantic redundancy where similarity between subgraphs is measured based on the similarity between their nodes' labels, using prior domain knowledge. The second approach focuses on structural redundancy where subgraphs are represented by a set of user-defined topological descriptors, and similarity between subgraphs is measured based on the distance between their corresponding topological descriptions. The main application data of this thesis are protein 3D-structures. This choice is based on biological and computational reasons. From a biological perspective, proteins play crucial roles in almost every biological process. They are responsible of a variety of physiological functions. From a computational perspective, we are interested in mining complex data. Proteins are a perfect example of such data as they are made of complex structures composed of interconnected amino acids which themselves are composed of interconnected atoms. Large amounts of protein structures are currently available in online databases, in computer analyzable formats. Protein 3D-structures can be transformed into graphs where amino acids are the graph nodes and their connections are the graph edges. This enables using graph mining techniques to study them. The biological importance of proteins, their complexity, and their availability in computer analyzable formats made them a perfect application data for this thesis.

Стилі APA, Harvard, Vancouver, ISO та ін.

Pournia, Seyyedesadaf. "Exploring the Photoresponse and Optical Selection Rules in the Semiconductor Nanowires, Topological Quantum Materials and Ferromagnetic Semiconductor Nanoflakes using Polarized Photocurrent Spectroscopy." University of Cincinnati / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1627666632280473.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Yeresko, Mykhailo. "Search for antineutrino disappearance with the SoLi∂ detector : novel reconstruction, calibration and selection." Electronic Thesis or Diss., Université Clermont Auvergne (2021-...), 2022. http://www.theses.fr/2022UCFAC127.

Повний текст джерела

Анотація:

Cette thèse présente la recherche d'oscillations d'antineutrinos actifs vers des antineutrinos stériles avec le détecteur SoLi∂. Ce détecteur promeut un concept innovant basé sur un sandwich de plastiques scintillant formé de polyvinyle-toluène composite et de scintillateurs 6LiF:ZnS(Ag). Trois contributions principales à cette recherche sont rapportées dans ce document. La première concerne une nouvelle méthode de reconstruction basée sur l'algorithme ML-EM. Elle vise à transformer la réponse brute du détecteur en une liste de positions (avec des énergies dédiées) où l'interaction physique réelle dans le détecteur a eu lieu. La seconde concerne l'étalonnage en énergie du détecteur. Elle comprend à la fois l'étalonnage relatif au moyen de muons cosmiques horizontaux et l'exploration de plusieurs options pour la détermination de l'échelle d'énergie absolue. Enfin, la thèse présente une nouvelle méthode de sélection des candidats antineutrinos basée sur l'analyse de la partie électromagnétique du signal de désintégration bêta inverse et leur classement en fonction de la géométrie des événements dans le détecteur (topologies). L'analyse a été développée en aveugle et la méthode a été validée avec une petite fraction de l'échantillon de données
This thesis presents the search for active-to-sterile antineutrino oscillations with the SoLi∂ detector, which has an innovative concept based on a sandwich of composite polyvinyl-toluene and 6LiF:ZnS(Ag) scintillators. Three main contributions to this search are reported. The first one describes the new reconstruction method based on the ML-EM algorithm. It is aimed at transformation of the raw detector response to the list of positions (with dedicated energies) where actual physics interaction in the detector took place. The second one describes the energy calibration of the detector. It includes both relative calibration with the cosmic horizontal muons and exploration of several options for the absolute energy scale derivation. Finally, the thesis presents a novel method for selecting antineutrino candidates based on the analysis of the electromagnetic part of the inverse beta decay signal and categorising them according to the geometry of the events in the detector (topologies). The analysis was developed blindly and the method was validated with a small fraction of the data sample

Стилі APA, Harvard, Vancouver, ISO та ін.

Hiers, Nathaniel Christopher. "Equivalence of the Rothberger and k-Rothberger Games for Hausdorff Spaces." Thesis, University of North Texas, 2019. https://digital.library.unt.edu/ark:/67531/metadc1505207/.

Повний текст джерела

Анотація:

First, we show that the Rothberger and 2-Rothberger games are equivalent. Then we adjust the former proof and introduce another game, the restricted Menger game, in order to obtain a broader result. This provides an answer in the context of Hausdorff spaces for an open question posed by Aurichi, Bella, and Dias.

Стилі APA, Harvard, Vancouver, ISO та ін.

Dias, Rodrigo Roque. "Princípios de seleção, jogos topológicos e indestrutibilidade de espaços compactos." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/45/45131/tde-08112012-001644/.

Повний текст джерела

Анотація:

Este trabalho se dedica ao estudo da interação entre princípios de seleção e jogos topológicos. Isto inclui uma abordagem não-topológica destes tópicos, com aplicações à indestrutibilidade de espaços de Lindelöf e a uma versão seletiva de d-separabilidade, dentre outros. Provamos ainda a não-equivalência consistente entre indestrutibilidade e o princípio de seleção naturalmente associado a esta propriedade, o que conduz à investigação da indestrutibilidade de espaços compactos. Finalmente, mostramos que algumas afirmações que limitam a cardinalidade de espaços de Lindelöf indestrutíveis são equiconsistentes com a existência de certos tipos de grandes cardinais.
In the present work we focus on the interplay between selection principles and topological games. This includes a nontopological approach to these topics, with applications to indestructibility of Lindelöf spaces and a selective version of d-separability, among others. We also show the consistent nonequivalence between indestructibility and the selection principle naturally associated to it, which leads to an investigation of indestructibility of compact spaces. We conclude by showing that some constraints on the cardinality of Lindelöf indestructible spaces are equiconsistent with the existence of some kinds of large cardinals.

Стилі APA, Harvard, Vancouver, ISO та ін.

Dobón, Berenguer Begoña 1987. "From networks to population-specific adaptations : studying positive selection in humans." Doctoral thesis, Universitat Pompeu Fabra, 2018. http://hdl.handle.net/10803/665399.

Повний текст джерела

Анотація:

The evolution of the genome is driven, among other factors, by the composition of the genome, the functional output of the gene products, and by environmental pressures. Among the environmental factors, pathogens are one of the strongest selective pressures. In this thesis we describe two examples of this: i) the convergent evolution in immune-related genes in East Africa populations despite having different ethnical and genetic backgrounds, ii) the rapid adaptation in variants associated with differential cytokine production in the Roma people since their migration from the Indian subcontinent. We also propose that positive selection acted in the cytochrome P450 system after the out of Africa, whereas genetic drift is the main force behind the genetic variability present in taste receptors genes. Gene evolution is also affected by the location and connectivity of their products within the metabolic network. Positive selection detected at interspecific and intraspecific levels show opposite but complementary patterns: the first is detected in peripheric genes, whereas the second is detected mainly in central genes.
L'evolució del genoma depèn, entre altres factors, de la composició del genoma, del paper funcional que realitzen els productes del gen, i de les pressions mediambientals. Dins dels factors mediambientals, els patògens són una de les pressions selectives més fortes. En aquesta tesi descrivim dos exemples d’aquest fet: i) l'evolució convergent en gens amb funcions immunològiques a poblacions de l’est d'Àfrica, malgrat pertànyer a diferent grups ètnics i fons genètics, ii) la ràpida adaptació als Roma en variants associades amb la producció diferencial de citocines des de la seva migració des del subcontinent Indi. També proposem que la selecció positiva va actuar a la súper família dels citocroms després de la expansió des del continent Africà, mentre que la deriva gènica és la principal força darrere de la variabilitat genètica observada als receptors del gust. L’evolució dels gens també és veu influïda per la ubicació i connectivitat dels seus productes dins de la xarxa metabòlica. La detecció de la selecció positiva a nivell interespecífic i intraespecífic mostra un patró oposat però complementari: la primera és detectada a la perifèria de la xarxa, mentre que la segona és detectada principalment en gens centrals.

Стилі APA, Harvard, Vancouver, ISO та ін.

Boero, Ana Carolina. "Topologias enumeravelmente compactas em grupos abelianos de não torção via ultrafiltros seletivos." Universidade de São Paulo, 2011. http://www.teses.usp.br/teses/disponiveis/45/45131/tde-23082011-225107/.

Повний текст джерела

Анотація:

Assumindo a existência de $\\mathfrak c$ ultrafiltros seletivos dois a dois incomparáveis (segundo a ordem de Rudin-Keisler) provamos que o grupo abeliano livre de cardinalidade $\\mathfrak c$ admite uma topologia de grupo enumeravelmente compacta com uma seqüência não trivial convergente. Sob as mesmas hipóteses, mostramos que um grupo topológico abeliano quase livre de torção $(G, +, \\tau)$ com $|G| = |\\tau| = \\mathfrak c$ admite uma topologia independente de $\\tau$ que o torna um grupo topológico e caracterizamos algebricamente os grupos abelianos de não torção que têm cardinalidade $\\mathfrak c$ e que admitem uma topologia de grupo enumeravelmente compacta (sem seqüências não triviais convergentes). Provamos, ainda, que o grupo abeliano livre de cardinalidade $\\mathfrak c$ admite uma topologia de grupo que torna seu quadrado enumeravelmente compacto e construímos um semigrupo de Wallace cujo quadrado é, também, enumeravelmente compacto. Por fim, assumindo a existência de $2^{\\mathfrak c}$ ultrafiltros seletivos, garantimos que se um grupo abeliano de não torção e cardinalidade $\\mathfrak c$ admite uma topologia de grupo enumeravelmente compacta, então o mesmo admite $2^{\\mathfrak c}$ topologias de grupo enumeravelmente compactas (duas a duas não homeomorfas).
Assuming the existence of $\\mathfrak c$ pairwise incomparable selective ultrafilters (according to the Rudin-Keisler ordering) we prove that the free abelian group of cardinality $\\mathfrak c$ admits a countably compact group topology that contains a non-trivial convergent sequence. Under the same hypothesis, we show that an abelian almost torsion-free topological group $(G, +, \\tau)$ with $|G| = |\\tau| = \\mathfrak c$ admits a group topology independent of $\\tau$ and we algebraically characterize the non-torsion abelian groups of cardinality $\\mathfrak c$ which admit a countably compact group topology (without non-trivial convergent sequences). We also prove that the free abelian group of cardinality $\\mathfrak c$ admits a group topology that makes its square countably compact and we construct a Wallace\'s semigroup whose square is countably compact. Finally, assuming the existence of $2^$ selective ultrafilters, we ensure that if a non-torsion abelian group of cardinality $\\mathfrak c$ admits a countably compact group topology, then it admits $2^$ (pairwise non-homeomorphic) countably compact group topologies.

Стилі APA, Harvard, Vancouver, ISO та ін.

Aazi, Fatima Zahra. "Contribution à la sélection de variables par les machines à vecteurs support pour la discrimination multi-classes." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSE2180.

Повний текст джерела

Анотація:

Les avancées technologiques ont permis le stockage de grandes masses de données en termes de taille (nombre d’observations) et de dimensions (nombre de variables).Ces données nécessitent de nouvelles méthodes, notamment en modélisation prédictive (data science ou science des données), de traitement statistique adaptées à leurs caractéristiques. Dans le cadre de cette thèse, nous nous intéressons plus particulièrement aux données dont le nombre de variables est élevé comparé au nombre d’observations.Pour ces données, une réduction du nombre de variables initiales, donc de dimensions, par la sélection d’un sous-ensemble optimal, s’avère nécessaire, voire indispensable.Elle permet de réduire la complexité, de comprendre la structure des données et d’améliorer l’interprétation des résultats et les performances du modèle de prédiction ou de classement en éliminant les variables bruit et/ou redondantes.Nous nous intéressons plus précisément à la sélection de variables dans le cadre de l’apprentissage supervisé et plus spécifiquement de la discrimination à catégories multiples dite multi-classes. L’objectif est de proposer de nouvelles méthodes de sélection de variables pour les modèles de discrimination multi-classes appelés Machines à Vecteurs Support Multiclasses (MSVM).Deux approches sont proposées dans ce travail. La première, présentée dans un contexte classique, consiste à sélectionner le sous-ensemble optimal de variables en utilisant le critère de "la borne rayon marge" majorante du risque de généralisation des MSVM. Quant à la deuxième approche, elle s’inscrit dans un contexte topologique et utilise la notion de graphes de voisinage et le critère de degré d’équivalence topologique en discrimination pour identifier les variables pertinentes qui constituent le sous-ensemble optimal du modèle MSVM.L’évaluation de ces deux approches sur des données simulées et d’autres réelles montre qu’elles permettent de sélectionner, à partir d’un grand nombre de variables initiales, un nombre réduit de variables explicatives avec des performances similaires ou encore meilleures que celles obtenues par des méthodes concurrentes
The technological progress has allowed the storage of large amounts of data in terms of size (number of observations) and dimensions (number of variables). These data require new methods, especially for predictive modeling (data science), of statistical processing adapted to their characteristics. In this thesis, we are particularly interested in the data with large numberof variables compared to the number of observations.For these data, reducing the number of initial variables, hence dimensions, by selecting an optimal subset is necessary, even imperative. It reduces the complexity, helps to understand the data structure, improves the interpretation of the results and especially enhances the performance of the forecasting model by eliminating redundant and / or noise variables.More precisely, we are interested in the selection of variables in the context of supervised learning, specifically of multiclass discrimination. The objective is to propose some new methods of variable selection for multiclass discriminant models called Multiclass Support Vector Machines (MSVM).Two approaches are proposed in this work. The first one, presented in a classical context, consist in selecting the optimal subset of variables using the radius margin upper bound of the generalization error of MSVM. The second one, proposed in a topological context, uses the concepts of neighborhood graphs and the degree of topological equivalence in discriminationto identify the relevant variables and to select the optimal subset for an MSVM model.The evaluation of these two approaches on simulated and real data shows that they can select from a large number of initial variables, a reduced number providing equal or better performance than those obtained by competing methods

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Topological selection"

Parthasarathy, T. Selection Theorems and Their Applications. Springer London, Limited, 2006.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Fleischman, W. M. Set-Valued Mappings, Selections and Topological Properties of 2x: Proceedings of the Conference Held at the State University of New York at Buffalo, May 8-10, 1969. Springer, 2014.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Fleischman, W. M. Set-Valued Mappings, Selections and Topological Properties Of 2x: Proceedings of the Conference Held at the State University of New York at Buffalo, May 8-10 1969. Springer London, Limited, 2006.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ellis, Graham. An Invitation to Computational Homotopy. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780198832973.001.0001.

Повний текст джерела

Анотація:

This book is an introduction to elementary algebraic topology for students with an interest in computers and computer programming. Its aim is to illustrate how the basics of the subject can be implemented on a computer. The transition from basic theory to practical computation raises a range of non-trivial algorithmic issues and it is hoped that the treatment of these will also appeal to readers already familiar with basic theory who are interested in developing computational aspects. The book covers a subset of standard introductory material on fundamental groups, covering spaces, homology, cohomology and classifying spaces as well as some less standard material on crossed modules, homotopy 2- types and explicit resolutions for an eclectic selection of discrete groups. It attempts to cover these topics in a way that hints at potential applications of topology in areas of computer science and engineering outside the usual territory of pure mathematics, and also in a way that demonstrates how computers can be used to perform explicit calculations within the domain of pure algebraic topology itself. The initial chapters include examples from data mining, biology and digital image analysis, while the later chapters cover a range of computational examples on the cohomology of classifying spaces that are likely beyond the reach of a purely paper-and-pen approach to the subject. The applied examples in the initial chapters use only low-dimensional and mainly abelian topological tools. Our applications of higher dimensional and less abelian computational methods are currently confined to pure mathematical calculations. The approach taken to computational homotopy is very much based on J.H.C. Whitehead’s theory of combinatorial homotopy in which he introduced the fundamental notions of CW-space, simple homotopy equivalence and crossed module. The book should serve as a self-contained informal introduction to these topics and their computer implementation. It is written in a style that tries to lead as quickly as possible to a range of potentially useful machine computations.

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "Topological selection"

Allab, Kais, and Khalid Benabdeslem. "Constraint Selection for Semi-supervised Topological Clustering." In Machine Learning and Knowledge Discovery in Databases, 28–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-23780-5_12.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Chhaya, Pradeep. "Nature of Regulatory Genome: The Evolution and Natural Selection of “Genotope”." In The Topological Model of Genome and Evolution, 449–95. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-4318-0_8.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Khan, Mohammad Asif, and Frédéric Labrosse. "Visual Topological Mapping Using an Appearance-Based Location Selection Method." In Towards Autonomous Robotic Systems, 90–102. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-63486-5_12.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Puret, Arnaud, Sébastien Aupetit, Pierre Gaucher, Nicolas Monmarché, and Mohamed Slimane. "Selection by Visualization of Topological Layouts for Adapted Living Area Design." In Lecture Notes in Computer Science, 500–507. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11788713_75.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wang, Xiang, Huimin Ma, and Jiayun Hou. "Viewpoints Selection of 3D Object Recognition Based on Manifold Topological Multi-resolution Analysis Method." In Communications in Computer and Information Science, 1–9. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47791-5_1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Stalker, Iain Duncan, and Nikolai Kazantsev. "Collaborative Design and Manufacture: Information Structures for Team Formation and Coordination." In Lecture Notes in Computer Science, 93–104. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72308-8_7.

Повний текст джерела

Анотація:

AbstractOur interest here lies in supporting important, but routine and time-consuming activities that underpin success in highly distributed, collaborative design and manufacturing environments; and how information structuring can facilitate this. To that end, we present a simple, yet powerful approach to team formation, partner selection, scheduling and communication that employs a different approach to the task of matching candidates to opportunities or partners to requirements (matchmaking): traditionally, this is approached using either an idea of ‘nearness’ or ‘best fit’ (metric-based paradigms); or by finding a subtree within a tree (data structure) (tree traversal). Instead, we prefer concept lattices to establish notions of ‘inclusion’ or ‘membership’: essentially, a topological paradigm. While our approach is substantive, it can be used alongside traditional approaches and in this way one could harness the strengths of multiple paradigms.

Стилі APA, Harvard, Vancouver, ISO та ін.

Akcam, Halil, and Volker Lohweg. "Pollen Classification Based on Binary 2D Projections of Pollen Grains." In Technologien für die intelligente Automation, 273–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 2022. http://dx.doi.org/10.1007/978-3-662-64283-2_20.

Повний текст джерела

Анотація:

AbstractPollen is one of the main causes of allergic diseases in humans. Therefore, it is indispensable to develop and conduct effective treatment and prevention measures. For this purpose, detailed and differentiated information about the respective local exposure profiles for the individual patients is required. The present paper serves the purpose of testing a new approach which aims at detecting and classifying individual pollen grains by using binary 2D projection. This paper explores the question of whether and to what extent a classification of individual pollen grains is possible using this new imaging technology. To this end, using artificial pollen grains, binary 2D projections with different levels of resolution are simulated. To extract the respective features, both shape-based Fourier descriptors and topological features are used. Apart from that, Zernike moments for different orders are measured to extract the respective characteristics of the pollen grains. While the feature selection is conducted by means of a feature forward selection method, a kernel machine (Support Vector Machine) with a Gaussian kernel is used for the classification. First results of the simulation show that with a resolution of 0.1 μm, 100% of the allergologically relevant artificial pollen are classified correctly. Conversely, a lower resolution corresponds with a higher error rate in the classification.

Стилі APA, Harvard, Vancouver, ISO та ін.

Aoki, Daisuke, Hideyuki Otsuka, and Toshikazu Takata. "Cyclic Polymers Synthesized by Spontaneous Selective Cyclization Approaches." In Topological Polymer Chemistry, 319–34. Singapore: Springer Singapore, 2022. http://dx.doi.org/10.1007/978-981-16-6807-4_20.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Corcoran, Padraig, and Peter Mooney. "Topologically Consistent Selective Progressive Transmission." In Lecture Notes in Geoinformation and Cartography, 519–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19789-5_26.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Tuchscherer, G., I. Ernest, K. Rose, and M. Mutter. "Protein de novo design: Condensation of unprotected peptide blocks to topological templates via selective oxime bond formation." In Peptides, 1067–68. Dordrecht: Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-011-0683-2_362.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Topological selection"

Popov, Vladimir. "Fingerprints selection for topological localization." In INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS (ICNAAM 2016). Author(s), 2017. http://dx.doi.org/10.1063/1.4992728.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Wang, Yuanrong, Antonio Briola, and Tomaso Aste. "Topological Portfolio Selection and Optimization." In ICAIF '23: 4th ACM International Conference on AI in Finance. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3604237.3626875.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Sikri, Monika. "Web Service Selection Using Topological Metadata." In 2010 International Conference on Advances in Computer Engineering (ACE). IEEE, 2010. http://dx.doi.org/10.1109/ace.2010.60.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Visa, Ari J. E. "Topological feature map and automatic feature selection." In Aerospace Sensing, edited by Dennis W. Ruck. SPIE, 1992. http://dx.doi.org/10.1117/12.140148.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Varposhti, Marzieh, Mehdi Dehghan, and Reza Safabakhsh. "Camera selection without location information: A topological approach." In 2012 IEEE Symposium on Computers and Communications (ISCC). IEEE, 2012. http://dx.doi.org/10.1109/iscc.2012.6249325.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

GarciaMarch, M. A., M. Zacarés, J. Vijande, and A. Ferrando. "A topological charge selection rule for phase singularities." In Frontiers in Optics. Washington, D.C.: OSA, 2009. http://dx.doi.org/10.1364/fio.2009.fwh4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ozkucur, Nezih Ergin, and H. L. Akin. "Supervised feature type selection for topological mapping in indoor environments." In 2013 21st Signal Processing and Communications Applications Conference (SIU). IEEE, 2013. http://dx.doi.org/10.1109/siu.2013.6531556.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Yu, Lian, Wei Zhao, Xiangdong Fan, and Jun Zhu. "Exploring Topological Structure of Boolean Expressions for Test Data Selection." In 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (TASE). IEEE, 2009. http://dx.doi.org/10.1109/tase.2009.52.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Barradas, A. L., and M. C. R. Medeiros. "Path selection strategies for OBS networks using topological network information." In 2007 ICTON Mediterranean Winter Conference. IEEE, 2007. http://dx.doi.org/10.1109/ictonmw.2007.4446932.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kumar, Binod, Kanad Basu, Ankit Jindal, Masahiro Fujita, and Virendra Singh. "Improving post-silicon error detection with topological selection of trace signals." In 2017 IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC). IEEE, 2017. http://dx.doi.org/10.1109/vlsi-soc.2017.8203485.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!