To see the other types of publications on this topic, follow the link: Topological features.
Dissertations / Theses on the topic 'Topological features'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 26 dissertations / theses for your research on the topic 'Topological features.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Shi, Dayu. "Computing Topological Features for Data Analysis." The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu1512079255367232.
Full text
2
Fan, Fengtao. "Computing Topological Features of Data and Shapes." The Ohio State University, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=osu1385999908.
Full text
3
Busaryev, Oleksiy. "On Computing and Tracking Geometrical and Topological Features." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1354679582.
Full text
4
Munoz, De Las Heras Alberto. "Non-Hermitian and Topological Features of Photonic Systems." Doctoral thesis, Università degli studi di Trento, 2022. https://hdl.handle.net/11572/331092.
Full textAbstract:
This Thesis is devoted to the study of topological phases of matter in optical platforms, focusing on non-Hermitian systems with gain and losses involving nonreciprocal elements, and fractional quantum Hall liquids where strong interactions play a central role.In the first part we investigated nonlinear Taiji micro-ring resonators in passive and active silicon photonics setups. Such resonators establish a unidirectional coupling between the two whispering-gallery modes circulating in their perimeter. We started by demonstrating that a single nonlinear Taiji resonator coupled to a bus waveguide breaks Lorentz reciprocity. When a saturable gain is added to a single Taiji resonator, a sufficiently strong unidirectional coupling rules out the possibility of lasing in one of the whispering-gallery modes with independence of the type of optical nonlinearity and gain saturation displayed by the material. This can be regarded as a dynamical time-reversal symmetry breaking. This effect is further enhanced by an optical Kerr nonlinearity. We showed that both ring and Taiji resonators can work as optical isolators over a broad frequency band in realistic operating conditions. Our proposal relies on the presence of a strong pump in a single direction: as a consequence four-wave mixing can only couple the pump with small intensity signals propagating in the same direction. The resulting nonreciprocal devices circumvent the restrictions imposed by dynamic reciprocity. We then studied two-dimensional arrays of ring and Taiji resonators realizing quantum spin-Hall topological insulator lasers. The strong unidirectional coupling present in Taiji resonator lattices promotes lasing with a well-defined chirality while considerably improving the slope efficiency and reducing the lasing threshold. Finally, we demonstrated that lasing in a single helical mode can be obtained in quantum spin-Hall lasers of Taiji resonators by exploiting the optical nonlinearity of the material. In the second part of this Thesis we dived into more speculative waters and explored fractional quantum Hall liquids of cold atoms and photons. We proposed strategies to experimentally access the fractional charge and anyonic statistics of the quasihole excitations arising in the bulk of such systems. Heavy impurities introduced inside a fractional quantum Hall droplet will bind quasiholes, forming composite objects that we label as anyonic molecules. Restricting ourselves to molecules formed by one quasihole and a single impurity, we find that the bound quasihole gives a finite contribution to the impurity mass, that we are able to ascertain by considering the first-order correction to the Born-Oppenheimer approximation. The effective charge and statistical parameter of the molecule are given by the sum of those of the impurity and the quasihole, respectively. While the mass and charge of such objects can be directly assessed by imaging the cyclotron orbit described by a single molecule, the anyonic statistics manifest as a rigid shift of the interference fringes in the differential scattering cross section describing a collision between two molecules.
5
Karatzas, Dimosthenis A. "Text segmentation in web images using colour perception and topological features." Thesis, University of Liverpool, 2003. https://eprints.soton.ac.uk/263525/.
Full textAbstract:
The research presented in this thesis addresses the problem of Text Segmentation in Web images. Text is routinely created in image form (headers, banners etc.) on Web pages, as an attempt to overcome the stylistic limitations of HTML. This text however, has a potentially high semantic value in terms of indexing and searching for the corresponding Web pages. As current search engine technology does not allow for text extraction and recognition in images, the text in image form is ignored. Moreover, it is desirable to obtain a uniform representation of all visible text of a Web page (for applications such as voice browsing or automated content analysis). This thesis presents two methods for text segmentation in Web images using colour perception and topological features. The nature of Web images and the implicit problems to text segmentation are described, and a study is performed to assess the magnitude of the problem and establish the need for automated text segmentation methods. Two segmentation methods are subsequently presented: the Split-and-Merge segmentation method and the Fuzzy segmentation method. Although approached in a distinctly different way in each method, the safe assumption that a human being should be able to read the text in any given Web Image is the foundation of both methods’ reasoning. This anthropocentric character of the methods along with the use of topological features of connected components, comprise the underlying working principles of the methods. An approach for classifying the connected components resulting from the segmentation methods as either characters or parts of the background is also presented.
6
Ren, Zheng. "Case Studies on Fractal and Topological Analyses of Geographic Features Regarding Scale Issues." Thesis, Högskolan i Gävle, Samhällsbyggnad, GIS, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:hig:diva-23996.
Full textAbstract:
Scale is an essential notion in geography and geographic information science (GIScience). However, the complex concepts of scale and traditional Euclidean geometric thinking have created tremendous confusion and uncertainty. Traditional Euclidean geometry uses absolute size, regular shape and direction to describe our surrounding geographic features. In this context, different measuring scales will affect the results of geospatial analysis. For example, if we want to measure the length of a coastline, its length will be different using different measuring scales. Fractal geometry indicates that most geographic features are not measurable because of their fractal nature. In order to deal with such scale issues, the topological and scaling analyses are introduced. They focus on the relationships between geographic features instead of geometric measurements such as length, area and slope. The scale change will affect the geometric measurements such as length and area but will not affect the topological measurements such as connectivity. This study uses three case studies to demonstrate the scale issues of geographic features though fractal analyses. The first case illustrates that the length of the British coastline is fractal and scale-dependent. The length of the British coastline increases with the decreased measuring scale. The yardstick fractal dimension of the British coastline was also calculated. The second case demonstrates that the areal geographic features such as British island are also scale-dependent in terms of area. The box-counting fractal dimension, as an important parameter in fractal analysis, was also calculated. The third case focuses on the scale effects on elevation and the slope of the terrain surface. The relationship between slope value and resolution in this case is not as simple as in the other two cases. The flat and fluctuated areas generate different results. These three cases all show the fractal nature of the geographic features and indicate the fallacies of scale existing in geography. Accordingly, the fourth case tries to exemplify how topological and scaling analyses can be used to deal with such unsolvable scale issues. The fourth case analyzes the London OpenStreetMap (OSM) streets in a topological approach to reveal the scaling or fractal property of street networks. The fourth case further investigates the ability of the topological metric to predict Twitter user’s presence. The correlation between number of tweets and connectivity of London named natural streets is relatively high and the coefficient of determination r2 is 0.5083. Regarding scale issues in geography, the specific technology or method to handle the scale issues arising from the fractal essence of the geographic features does not matter. Instead, the mindset of shifting from traditional Euclidean thinking to novel fractal thinking in the field of GIScience is more important. The first three cases revealed the scale issues of geographic features under the Euclidean thinking. The fourth case proved that topological analysis can deal with such scale issues under fractal way of thinking. With development of data acquisition technologies, the data itself becomes more complex than ever before. Fractal thinking effectively describes the characteristics of geographic big data across all scales. It also overcomes the drawbacks of traditional Euclidean thinking and provides deeper insights for GIScience research in the big data era.
7
Delaney, Matthew. "A cellular automaton-based system for the identification of topological features of carotid artery plaques." Thesis, University of Northampton, 2014. http://nectar.northampton.ac.uk/7249/.
Full textAbstract:
The formation of a plaque in one or both of the internal carotid arteries poses a serious threat to the lives of those in whom it occurs. This thesis describes a technique designed to detect level of occlusion and provide topological information about such plaques. In order to negate the cost of specialised hardware, only the sound produced by blood-flow around the occlusion is used; this raises problems that prevent the application of existing medical imaging techniques, however, these can be overcome by the application of a nonlinear technique that takes full advantage of the discrete nature of digital computers. Results indicate that both level of occlusion and presence or absence of various topological features can be determined in this way. Beginning with a review of existing work in medical-imaging and in more general but related techniques, the EPI process of Friden (2004) is identified as the strongest approach to a situation where it is desirable to work with both signal and noise yet avoid the computational cost and other pitfalls of established techniques. The remained of the thesis discusses attempts to automate the EPI process which, in the form given by Frieden (2004), requires a degree of human mathematical creative problem-solving. Initially, a numerical-methods inspired approach based on genetic algorithms was attempted but found to be both computationally costly and insufficiently true to the nature of the EPI equations. A second approach, based on the idea of creating a formal system allowing entropy, direction and logic to be manipulated together proved to lack certain key properties and require an amount of work beyond the scope of the project described in this thesis in order to be extended into a form that was usable for the EPI process. The approach upon which the imaging system described is ultimately built is based on an abstracted form of constraint-logic programming resulting in a cellular-automaton based model which is shown to produce distinct images for different sizes and topologies of plaque in a reliable and human-interpretable way.
8
Agerberg, Jens. "Statistical Learning and Analysis on Homology-Based Features." Thesis, KTH, Matematisk statistik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-273581.
Full textAbstract:
Stable rank has recently been proposed as an invariant to encode the result of persistent homology, a method used in topological data analysis. In this thesis we develop methods for statistical analysis as well as machine learning methods based on stable rank. As stable rank may be viewed as a mapping to a Hilbert space, a kernel can be constructed from the inner product in this space. First, we investigate this kernel in the context of kernel learning methods such as support-vector machines. Next, using the theory of kernel embedding of probability distributions, we give a statistical treatment of the kernel by showing some of its properties and develop a two-sample hypothesis test based on the kernel. As an alternative approach, a mapping to a Euclidean space with learnable parameters can be conceived, serving as an input layer to a neural network. The developed methods are first evaluated on synthetic data. Then the two-sample hypothesis test is applied on the OASIS open access brain imaging dataset. Finally a graph classification task is performed on a dataset collected from Reddit.<br>Stable rank har föreslagits som en sammanfattning på datanivå av resultatet av persistent homology, en metod inom topologisk dataanalys. I detta examensarbete utvecklar vi metoder inom statistisk analys och maskininlärning baserade på stable rank. Eftersom stable rank kan ses som en avbildning i ett Hilbertrum kan en kärna konstrueras från inre produkten i detta rum. Först undersöker vi denna kärnas egenskaper när den används inom ramen för maskininlärningsmetoder som stödvektormaskin (SVM). Därefter, med grund i teorin för inbäddning av sannolikhetsfördelningar i reproducing kernel Hilbertrum, undersöker vi hur kärnan kan användas för att utveckla ett test för statistisk hypotesprövning. Slutligen, som ett alternativ till metoder baserade på kärnor, utvecklas en avbildning i ett euklidiskt rum med optimerbara parametrar, som kan användas som ett ingångslager i ett neuralt nätverk. Metoderna utvärderas först på syntetisk data. Vidare utförs ett statistiskt test på OASIS, ett öppet dataset inom neuroradiologi. Slutligen utvärderas metoderna på klassificering av grafer, baserat på ett dataset insamlat från Reddit.<br><p>QC 20200523</p>
9
Nuzhnaya, Tatyana. "ANALYSIS OF ANATOMICAL BRANCHING STRUCTURES." Diss., Temple University Libraries, 2015. http://cdm16002.contentdm.oclc.org/cdm/ref/collection/p245801coll10/id/322471.
Full textAbstract:
Computer and Information Science<br>Ph.D.<br>Development of state-of-the-art medical imaging modalities such as Magnetic Resonance Imaging, Computed Tomography, Galactography, MR Diffusion Tensor Imaging, and Tomosynthesis plays an important role for visualization and assessment of anatomical structures. Included among these structures are structures of branching topology such as the bronchial tree in chest computed tomography images, the blood vessels in retinal images and the breast ductal network in x-ray galactograms and the tubular bone patterns in dental radiography. Analysis of such images could help reveal abnormalities, assist in estimating a risk of diseases such as breast cancer and COPD, and aid in the development of realistic anatomy phantoms. This thesis aims at the development of a set of automated methods for the analysis of anatomical structures of tree and network topology. More specifically, the two main objectives include (i) the development of analysis framework to explore the association between topology and texture patterns of anatomical branching structures and (ii) the development of the image processing methods for enhanced visualization of regions of interest in anatomical branching structures such as branching nodes.<br>Temple University--Theses
10
林德華 and Tak-wah Lam. "Topological data structure and algorithms for cell-complex based non-manifold form feature modeling." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1994. http://hub.hku.hk/bib/B3121244X.
Full text
11
Lam, Tak-wah. "Topological data structure and algorithms for cell-complex based non-manifold form feature modeling /." Hong Kong : University of Hong Kong, 1994. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19672214.
Full text
12
Johnston, Martin. "A distributed memory model for the construction of topologically ordered feature maps." Thesis, University of York, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.304078.
Full text
13
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.
Full textAbstract:
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.
14
Mandal, Sayan. "Applications of Persistent Homology and Cycles." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1591811236244813.
Full text
15
Santos, Dalí Freire Dias dos. "Recuperação de imagens: similaridade parcial baseada em espectro de grafo e cor." Universidade Federal de Uberlândia, 2012. https://repositorio.ufu.br/handle/123456789/12531.
Full textAbstract:
Traditionally, local shape descriptors or color and texture based descriptors are used
to describe the content of images. Although, these solutions achieving good results, they
are not able to distinguish scenes that contain objects with the same colors, but with a
different spatial organization or do not supports partial matching. In this work we focus
on a particular case of the partial matching that is to find individual objects in images
that contain various objects.
Since the color is one of the most visually distinguishable properties, we propose a
new descriptor based only on color able to find pictures of objects that are contained in
other images. Although our descriptor has shown better results when compared to related
works, this new color descriptor is not able to discriminate objects topologically different
but having the same colors. To overcome this problem, we also propose a new approach
to the partial matching of images that combine color and topological features on a single
descriptor. This new descriptor, first performs a simplification process of the original
image, which identifies the color regions that make up the image. Then, we represent
the spatial information among the color regions using a topological graph, where vertices
represent the color regions and the edges represent the spatial connections between them.
To calculate the descriptor from this graph representation, we use the spectral theory of
graphs, avoiding the need to make a direct comparison between graphs. To support the
partial matching, we propose a decomposition of the main graph into several subgraphs,
and also calculate descriptors for these subgraphs.<br>Tradicionalmente, descritores de forma, ou descritores baseados em cor e textura,
são utilizados para descrever o conteúdo visual das imagens. Embora essas abordagens
apresentem bons resultados, elas não são capazes de diferenciar adequadamente imagens
que contêm objetos com as mesmas cores, mas com organização espacial diferente ou não
suportam a pesquisa parcial de imagens. Neste trabalho focamos em um caso particular
da pesquisa parcial de imagens, que é encontrar objetos em imagens que contenham vários
objetos, não deixando de lado a pesquisa total (encontrar imagens similares à original).
Dado que a cor é uma das propriedades visuais mais discriminativas, propomos um
novo descritor baseado somente em cor capaz de encontrar imagens de objetos que estão
contidos em outras imagens. Embora tenha apresentado melhores resultados quando
comparado a trabalhos correlatos, esse novo descritor de cor não é capaz de discriminar
objetos topologicamente diferentes mas que possuam as mesmas cores. Com o intuito
de resolver esse problema, também propomos uma nova abordagem para a recuperação
parcial de imagens que combina características topológicas e de cor em um único descritor.
Esse novo descritor primeiramente realiza um processo de simplificação da imagem
original, onde são identificadas as regiões de cor que compõem a imagem. Após esse processo
de simplificação, a organização espacial das regiões de cor previamente identificadas
é representada por meio de um grafo topológico, onde os vértices representam as regiões
de cor e as arestas representam as conexões entre essas regiões. O descritor topológico
é então calculado a partir do grafo de topologia utilizando a teoria espectral de grafos,
evitando a necessidade de se realizar uma comparação direta entre grafos. Para suportar a
pesquisa parcial de imagens, é realizada uma decomposição do grafo principal em diversos
subgrafos.<br>Mestre em Ciência da Computação
16
Chambers, Erin Wolf. "Computing interesting topological features /." 2008. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3337719.
Full textAbstract:
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.<br>Source: Dissertation Abstracts International, Volume: 69-11, Section: B, page: 6905. Adviser: Jeff Erickson. Includes bibliographical references (leaves 90-97) Available on microfilm from Pro Quest Information and Learning.
17
Sridharan, Ajay Promodh. "Topological features of online social networks." Thesis, 2011. http://hdl.handle.net/1828/3396.
Full textAbstract:
The first-order properties like degree distribution of nodes and the clustering co-efficient have been the prime focus of research in the study of structural properties of networks. The presence of a power law in the degree distribution of nodes has been considered as an important structural characteristic of social and information networks. Higher-order structural properties such as edge embeddedness may also play a more important role in many on-line social networks but have not been studied before. In this research, we study the distribution of higher-order structural properties of a network, such as edge embeddedness, in complex network models and on-line social networks. We empirically study the embeddedness distribution of a variety of network models and theoretically prove that a recently-proposed network model, the random $k$-tree, has a power-law embedded distribution. We conduct extensive experiments on the embeddedness distribution in real-world networks and provide evidence on the correlation between embeddedeness and communication patterns among the members in an on-line social network.<br>Graduate
18
Cangemi, Loris Maria. "Environmental effects on dynamics and topological features of quantum systems." Tesi di dottorato, 2020. http://www.fedoa.unina.it/13041/1/Cangemi_LorisMaria_32.pdf.
Full textAbstract:
Theoretical models of quantum systems in the presence of their environment find many applications, ranging from condensed matter physics to quantum information science and quantum thermodynamics. In the field of macroscopic quantum systems, the Caldeira-Leggett model has been employed to study the effects of thermal baths on the coherence properties of superconducting qubits. However, if the quantum system of interest consists of many electrons in a solid, the role of the environment can be played by a quantum field of lattice vibrations, i.e. phonons, modeled by means of noninteracting bosons .
In this work, we studied widely known models of quantum systems linearly coupled to their bosonic environment, ranging from simple driven two-level systems, i.e. qubits, to many electrons systems.
Our approach has been focused on interesting model parameter ranges where well-established weak-coupling approximations fail in describing the physics involved. Indeed, these regimes are interesting and accessible to experiments. In the case of a driven qubit in contact with its environment, strong coupling effects in system-bath interactions, decoherence and crossover to totally incoherent tunneling dynamics have been studied. In addition, by considering prototypical models of fermionic systems strongly coupled to phonons on a lattice, we studied how topological features can be dramatically modified in the presence of electron-phonon interaction.
19
MONTEFUSCO, FRANCESCO. "Reverse Engineering Biological Interaction Networks by Exploiting Prior Knowledge and Topological Features." Doctoral thesis, 2010. http://hdl.handle.net/11577/2837579.
Full text
20
"Grouping and search efficiency in emergent features and topological properties in human vision." Thesis, 2010. http://hdl.handle.net/1911/62078.
Full textAbstract:
A series of three experiments were designed to test for Emergent Features, which, in Gestalt psychology, are indicative of grouping. By using basic elements such as dots or lines and building EFs sequentially, while maintaining the original discrimination constant, it was possible to compare the strength of different EFs. Proximity, Orientation, Symmetry, Linearity, Surroundedness, Inside/Outside relationship, Collinearity, Parallelism, Inflection Point and Closure were tested. A Configural Superiority Effect (CSE, where the RT in a composite condition is shorter than the RT in a singleton condition) was diagnostic of the presence of an EF in an Odd Quadrant task. Proximity, Orientation, Linearity, inside/Outside and Collinearity produced CSEs and thus behave as basic in human vision. Mixed results were obtained for Symmetry and Parallelism. Further, Inflection Point and Closure were only suggested in the stimuli, so they cannot be ruled out as EFs.
21
Lee, Ya-Neng, and 李雅能. "Using Topological Features of Cells to Predict Lymph Node Metastasis of Colorectal Cancer." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/pxp47t.
Full textAbstract:
碩士<br>國立交通大學<br>生物資訊及系統生物研究所<br>106<br>Recently, the factors such as alternation in dietary, life style, gene and genetic diseases has made the incident rate of colorectal cancer raised rapidly and colorectal cancer has already become the most morbidity cancers in Taiwan at present. Cancer cells may transfer to
other organs through the lymphatic nearby colon as suffering from colorectal cancer. At present, the way to diagnose the colorectal cancer grading in clinic still depends on observing cytology in biopsy by pathologist whether there is metastasis or not. Nowadays, there has existed many applications in techniques of image classification and the similar issues with automatic classification in histopathological images have been widely studied for detecting
cancer. This study uses the techniques of image processing and combines the subsets of topological features of cells to conduct the training and classification steps in SVM. After that, the model is used to predict lymph node metastasis of colorectal cancer. The WSIs of lymph node nearby colon used in this study were provided by China
Medical University. In this study uses the lymph nodes’ WSIs from patient 1 as training data. According to the result of feature selection, the optimal model used to predict metastasis is constructed by using 3 topological features. As the performance of predicting test data by
using this optimal model, the AUC of 10-fold cross validation from training data is 0.9858; the AUC of predicting test data from same patient is 0.9919; the performance of AUC in cross subject is 0.8979 and the accuracy of predicting test data from patients without colorectal cancer is 95.68%. According to these results, this optimal model shows great performance in identifying histopathological images. Finally, plotting the heat map according to decision value from libsvm tools is used to express the lymph node metastasis of colorectal cancer.
22
Liu, Bo-Yi, and 劉伯怡. "Applying the Topological Relationshis of Form Features to Retrieve Component Designs from a CAD System." Thesis, 1996. http://ndltd.ncl.edu.tw/handle/02843441816893723403.
Full text
23
Liao, Hsien-Yang, and 廖先陽. "A study of protein complexes topological features by integrating protein complexes and protein-protein interaction data." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/jazgbx.
Full textAbstract:
碩士<br>國立虎尾科技大學<br>光電與材料科技研究所<br>97<br>Interaction dense regions in the protein-protein interaction (PPI) network could possibly be identified as a protein complex. In this thesis we extended a pseudo-clique algorithm to merge two dense regions with different sizes [7]. It is found that this approach could predict more protein complexes, achieving a Jaccard`s coefficient of 0.2 for size equal or larger than five, comparing with the randomized PPI version.
By integrating the protein complexes data, and PPI records, we study the interaction topology among the subunits for all the human protein complexes, a total of 653 protein complexes, provided by BOND.
Two topological parameters are defined to test whether protein complex are found in PPI dense region or not. The first parameter is called the density of interaction, which describes the experimental recorded PPI among the subunits of a protein complex relative to the maximum possible PPI (i.e. clique). The second parameter is called the degree of connected subunits, which characterizes the largest connected cluster of subunits for a protein complex.
Our results show that around 18% of the whole human protein complexes has a density of interaction over 90%, and the rest of the complexes account for density of interaction ranging from 0% to 90%. For the second parameter, our study shows that around 27% of the whole human protein complexes has a degree of connectivity over 90%, and has a range from 0% to 90% respectively. These two results indicate that the number of the protein complex with high density is not very much, we infer that this result has the great possibility due to the incompleteness of the PPI data.
Furthermore, we identified sets of common subunits, so-called core module, for all the human protein complexes. These sets of core modules have a size of two to ten subunits. The probability of repeated occurrence (twice) of a core module with a size of larger than two is calculated. It is estimated that the probability of a core module occurs more than twice is zero nearly. To further characterize a core module, we did a pairwise functional comparison, using the BOND database, among the core module subunits, it is found that frequently occurred, larger size core module, tends to have a higher functional similarity, where a core module of size 10 has the highest Jaccard`s coefficient. It is suggested that these core modules could possibly have important biological functions.
24
Lo, Chao-yuan, and 羅詔元. "Topological Connection Analyses of Feature Detection for Imagery and Airborne LIDAR Data." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/45614544359210653742.
Full textAbstract:
博士<br>國立中央大學<br>土木工程學系<br>102<br>Edges and corners are important components in constructing planimetric planes and 3-dimensional facades. Feature geometry can also support related processes for advanced analyses including data registration, image matching, object modeling, and change detection. Conventional methods have focused on the threshold operation or primitive comparison to identify features. Because these predefined constraints may require optimization according to prior experience for various targets, however, a new, alternative for feature detection without threshold selection is needed. Because one edge should suffice for the specific geometry and connected elements, the proposed scheme in this study analyzed the local relief with topological connection criteria instead of threshold operation to improve the detection ability and automation. In image processing, one constant threshold was used for Gaussian smoothing (a method adopted in related works) to detect edges, and image corners were specifically addressed. In comparison, LIDAR (LIght Detection and Ranging) processing uses one fixed relief threshold to detect 3-dimensional lines, including parapets on rooftops, from airborne LIDAR data without surface determination and intersection. This relief threshold was related to the minimum wall height, and in the validation process the detected features were compared with references identified through visual perception. Based on these comparisons, the proposed scheme achieved higher automation without losing detection quality.
25
Martí, Sánchez María 1970. "Classes of algebraic surfaces with special features." Doctoral thesis, 2009. http://hdl.handle.net/10451/1649.
Full textAbstract:
Tese de doutoramento, Matemática (Geometria e Topologia), Universidade de Lisboa, Faculdade de Ciências, 2009<br>Disponível no documento<br>Fundação para a Ciência e Tecnologia (FCT) and Center for Mathematical Analysis, Geometry and Dynamical Systems of Instituto Superior Técnico, Universidade Técnica de Lisboa
26
Αλεξανδρίδης, Ζαχαρίας. "Επίλυση του προβλήματος sudoku με χρήση ευφυών τεχνικών από εκπαιδευτικό ρομπότ". Thesis, 2010. http://nemertes.lis.upatras.gr/jspui/handle/10889/4228.
Full textAbstract:
Στη διπλωματική λύνουμε το πρόβλημα του sudoku με χρήση του εκπαιδευτικού ρομπότ της Lego, το LEGO Mindstorm NXT. Το εκπαιδευτικό ρομπότ αυτό δεν έχει συγκεκριμένη μορφή αλλά αποτελείται από αλληλοσυνδεόμενα μεταξύ τους πλαστικά μέρη. Με χρήση αυτών κατασκευάσαμε ένα όχημα που αποτελεί παραλλαγή οχήματος από άλλη εργασία. Το όχημα αυτό μπορεί να κινείται μόνο μπροστά και πίσω. Διαθέτει έναν βραχίονα που μπορεί να κινεί δεξιά-αριστερά και στον οποίο εφαρμόζεται ένας αισθητήρας φωτεινότητας. Τέλος, στον βραχίονα υπάρχει θέση για στυλό.
Το πρόβλημα του sudoku που δίνεται στο ρομπότ είναι εκτυπωμένο σε ένα χαρτί Α4. Το ρομπότ αναλαμβάνει να το αναγνωρίσει με τον αισθητήρα, να το επιλύσει και να το αποτυπώσει με τη χρήση του στυλό. Για την επίτευξη αυτού του στόχου επιστρατεύονται αλγόριθμοι ρομποτικής και αλγόριθμοι τεχνητής νοημοσύνης. Συγκεκριμένα για την πλοήγηση του οχήματος εφαρμόζεται μετρική και τοπολογική πλοήγησης, στη συνέχεια για την αναγνώριση του προβλήματος και την ταυτοποίηση κάθε εικόνας που λαμβάνεται υλοποιήσαμε αλγόριθμους μορφολογικής επεξεργασία και τέλος για την επίλυση του προβλήματος sudoku υλοποιήσαμε και συγκρίναμε δύο αλγόριθμους, την αναζήτησης κατά βάθος και την αναζήτηση κατά βάθος με διάδοση περιορισμών. Οι τελικοί αλγόριθμοι που αναπτύχθηκαν διαπιστώσαμε ότι πετυχαίνουν το σκοπό τους αφού το όχημα αναγνωρίζει τους αριθμούς του δοσμένου προβλήματος με ποσοστό επιτυχίας 95%, λύνει τα περισσότερα προβλήματα σε λιγότερο από ένα δευτερόλεπτο και συμπληρώνει επιτυχώς τα κελιά του sudoku με τους σωστούς αριθμούς.
Πέρα από αυτές τη σύγκριση των αλγορίθμων θεωρούμε ότι η μελέτη ενός τέτοιου συστήματος είναι ιδανική για εισαγωγή σε θέματα ρομποτικής και μπορεί να χρησιμοποιηθεί ως εκπαιδευτικό εργαλείο πειραματισμού. Μάλιστα ο κώδικας μας σχολιάζεται επαρκώς σε αυτή την εργασία για να είναι ευκολότερη η κατανόηση του. Εκτός αυτού έχουμε αναπτύξει και πρόγραμμα αλληλεπίδρασης χρήστη-ρομπότ μέσω κονσόλας.<br>We solve the problem of sudoku using the educational robot LEGO Mindstorm NXT, made by LEGO. This educational robot doesn't have specific form but consists of interlinked plastics. We constructed a vehicle that is a variant from another work. This vehicle can move only forward and back. It has an arm that can move side to side and is equipped with a light sensor and a marker.
The problem of sudoku is given to the robot in printed form on a A4 paper. The robot at first recognize the problem with the sensor, then it resolves it and finally writes the solution down by using the pen. To achieve this goal we implemented various algorithms. Specifically, we studied robotic algorithms such as metric and topological navigation. Moreover, to identify the printed problem we processed every captured image morphologically and finally to solve the sudoku instance we implemented and compared two methods, first-depth search and first-depth search with constraint propagation. We should mention that our code is written in Java for the lejOS firmware. The final code is capable of recognizing the numbers of the given problem with a success rate of 95%, solving most problems in less than a second and completing the cells on the paper with the correct numbers.
Finally, we have developed an accompanying program that is usable for debugging purposes and for calibrating the robot. Even more, it can be used as education tool.