Segui questo link per vedere altri tipi di pubblicazioni sul tema: Minimum number of individuals.
Tesi sul tema "Minimum number of individuals"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Vedi i top-37 saggi (tesi di laurea o di dottorato) per l'attività di ricerca sul tema "Minimum number of individuals".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Vedi le tesi di molte aree scientifiche e compila una bibliografia corretta.
1
Parmentier, Sandy. "Une nouvelle méthode d'estimation du nombre minimum d'individus(NMI) par une approche allométrique : le NMI par exclusions. : applications aux séries ostéologiques de la région Provence-Alpes-Côte d'Azur". Thesis, Aix-Marseille 2, 2010. http://www.theses.fr/2010AIX20698/document.
Testo completoAbstract (sommario):
L’estimation du Nombre Minimum d’Individus (NMI) constitue une étape essentielle de l’étude des ensembles osseux, à la fois en contexte funéraire et médico-légal. En anthropologie funéraire, cette estimation va permettre d’affiner les profils paléodémographiques mais aussi de proposer de meilleures hypothèses quant à la gestion et l’utilisation de l’espace funéraire, tandis qu’en anthropologie médico-légale, elle revêt un intérêt majeur en vue de l’identification des victimes et des implications judiciaires qui en résultent.Les méthodes actuellement connues permettant d’estimer le NMI possèdent certaines limites dépendantes de la subjectivité des critères utilisés. Considérant ces limites, nous proposons une nouvelle méthode mise en place via une approche biométrique basée sur le principe de l’allométrie. A partir d’une sélection de 136 mesures ostéométriques, nous avons calculé les paramètres de 18360 équations de régressions linéaires permettant d’obtenir la prédiction d’une mesure biométrique à partir d’une autre ainsi que les bornes de l’intervalle de prédiction individuelle à 99% associé.Nous avons élaboré un outil informatique de tests itératifs permettant d’obtenir, à partir de l’exclusion très hautement probable d’appartenance des os à un même individu, une estimation du NMI.Les résultats du NMI par exclusions obtenus dans diverses applications montrent que ce NMI se révèle être particulièrement performant dans de nombreux cas.Au final, nous proposons une nouvelle méthode, objective et fiable, d’estimation du Nombre Minimum d’Individus - le NMI par exclusions - pouvant être utilisée aussi bien en contexte funéraire que dans un cadre médico-légalEstimation of the Minimum Number of Individuals (MNI) constitutes an essential stage of the study of commingled remains, both in physical and forensic anthropology. In physical anthropology, this estimation allow to improve paleodemographic profiles but also to propose better hypotheses as for the management and the use of the funeral space, whereas in forensic anthropology, it takes a major interest in identification procedures of victims and in the judicial involvement which result from it.Nowadays used methods estimating the MNI possess certain limits dependent on the subjectivity of the used criteria. Considering these limits, we propose a new method organized through a biometric approach based on the allometric principle. From a selection of 136 osteometric measures, we calculated the parameters of 18360 equations of linear regressions allowing us to obtain the prediction of a biometric measure from another one as well as the borders of the interval of individual prediction at 99 %.We elaborated a computer tool of iterative tests allowing to obtain, from the very highly likely exclusion from membership of bones in the same individual, an estimation of the MNI.The results of the MNI by exclusions obtained in different applications show that this NMI is particularly successful in numerous cases.In the final, we propose a new method, objective and reliable, of estimation of the Minimum Number of Individuals - the MNI by exclusions - useful as well in archaeological and forensic context
2
Zhang, Shiyu. "Lens design using a minimum number of glasses". Diss., The University of Arizona, 1994. http://hdl.handle.net/10150/186835.
Testo completoAbstract (sommario):
Currently, there are hundreds of optical glasses available from glass manufacturers. Due to increasing environmental limitations on the use of certain raw materials used to make these glasses, there is now an economic desire to minimize the number of glasses used in lens design. This dissertation presents the results of a study to create a suggested universal catalogue that contains the minimum number of glasses needed to satisfy most possible lens designs. Three different lens libraries were studied using the global optimization method and the most frequently chosen glasses were then compiled into the suggested universal glass catalogue. Two highly different systems, a nearly symmetric double Gauss lens, and a highly asymmetric eyepiece are used in the glass selection process. As part of this study, the relationship between the error function and the number of glasses chosen is studied, and in addition, a glass range study is also carried out. A suggested universal glass catalogue constructed from this study that contains nine glasses is presented.
3
Owens, Kayla Denise. "Properties of the Zero Forcing Number". BYU ScholarsArchive, 2009. https://scholarsarchive.byu.edu/etd/2216.
Testo completoAbstract (sommario):
The zero forcing number is a graph parameter first introduced as a tool for solving the minimum rank problem, which is: Given a simple, undirected graph G, and a field F, let S(F,G) denote the set of all symmetric matrices A=[a_{ij}] with entries in F such that a_{ij} doess not equal 0 if and only if ij is an edge in G. Find the minimum possible rank of a matrix in S(F,G). It is known that the zero forcing number Z(G) provides an upper bound for the maximum nullity of a graph. I investigate properties of the zero forcing number, including its behavior under various graph operations.
4
Akbari-Dilmaghani, Rahim. "Design methods for cellular neural networks with minimum number of cloning templates coefficients". Thesis, University College London (University of London), 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.286671.
Testo completo
5
Miao, Cheng Hsi. "The design of phased synthetic aperture imaging systems using a minimum number of elements". Diss., The University of Arizona, 1991. http://hdl.handle.net/10150/185625.
Testo completoAbstract (sommario):
The research described in this report resulted from my participation in the design study for the Phased-Array Imaging Telescope. To maintain high transmission, a practical system should contain a minimum number of components. This consideration leads to the concept of shared symmetries between the subtelescope and final collector. This report presents an approach to the design of such arrays, and examines the implications of including aspheric correction for the telescope array. As expected, the number of elements in this correction design concept seems to work well. Four array systems based on this concept are presented; each uses only one spherical mirror as the beam collector. The effects of changing the primary mirror's relative aperture, and of changing the system length, on the symmetry and order of aberrations arising from the use of an eccentric aspheric, are explained in this report. The subtle limitations of techniques for adding special surfaces for decentered aspheric correction to optical design programs are discussed as well. Two additional design concepts are examined and compared. A preliminary tolerancing analysis is performed, and error budgets developed. An adaptive element is considered for relaxing the alignment and fabrication tolerances.
6
Sinkovic, John Henry. "The Minimum Rank Problem for Outerplanar Graphs". BYU ScholarsArchive, 2013. https://scholarsarchive.byu.edu/etd/3722.
Testo completoAbstract (sommario):
Given a simple graph G with vertex set V(G)={1,2,...,n} define S(G) to be the set of all real symmetric matrices A such that for all i not equal to j, the ijth entry of A is nonzero if and only if ij is in E(G). The range of the ranks of matrices in S(G) is of interest and can be determined by finding the minimum rank. The minimum rank of a graph, denoted mr(G), is the minimum rank achieved by a matrix in S(G). The maximum nullity of a graph, denoted M(G), is the maximum nullity achieved by a matrix in S(G). Note that mr(G)+M(G)=|V(G)| and so in finding the maximum nullity of a graph, the minimum rank of a graph is also determined. The minimum rank problem for a graph G asks us to determine mr(G) which in general is very difficult. A simple graph is planar if there exists a drawing of G in the plane such that any two line segments representing edges of G intersect only at a point which represents a vertex of G. A planar drawing partitions the rest of the plane into open regions called faces. A graph is outerplanar if there exists a planar drawing of G such that every vertex lies on the outer face. We consider the class of outerplanar graphs and summarize some of the recent results concerning the minimum rank problem for this class. The path cover number of a graph, denoted P(G), is the minimum number of vertex-disjoint paths needed to cover all the vertices of G. We show that for all outerplanar graphs G, P(G)is greater than or equal to M(G). We identify a subclass of outerplanar graphs, called partial 2-paths, for which P(G)=M(G). We give a different characterization for another subset of outerplanar graphs, unicyclic graphs, which determines whether M(G)=P(G) or M(G)=P(G)-1. We give an example of a 2-connected outerplanar graph for which P(G) ≥ M(G).A cover of a graph G is a collection of subgraphs of G such that the union of the edge sets of the subgraphs is equal to the E(G). The rank-sum of a cover C of G is denoted as rs(C) and is equal to the sum of the minimum ranks of the subgraphs in C. We show that for an outerplanar graph G, there exists an edge-disjoint cover of G consisting of cliques, stars, cycles, and double cycles such that the rank-sum of the cover is equal to the minimum rank of G. Using the fact that such a cover exists allows us to show that the minimum rank of a weighted outerplanar graph is equal to the minimum rank of its underlying simple graph.
7
Khazaka, Rami, Marius Grundmann, Marc Portail, Philippe Vennéguès, Marcin Zielinski, Thierry Chassagne, Daniel Alquier e Jean-François Michaud. "Realization of minimum number of rotational domains in heteroepitaxied Si(110) on 3C-SiC( 001)". American Institute of Physics, 2016. https://ul.qucosa.de/id/qucosa%3A31228.
Testo completoAbstract (sommario):
Structural and morphological characterization of a Si(110) film heteroepitaxied on 3C-SiC(001)/
Si(001) on-axis template by chemical vapor deposition has been performed. An antiphase domain
(APD) free 3C-SiC layer was used showing a roughness limited to 1 nm. This leads to a smooth Si
film with a roughness of only 3 nm for a film thickness of 400 nm. The number of rotation domains
in the Si(110) epilayer was found to be two on this APD-free 3C-SiC surface. This is attributed to
the in-plane azimuthal misalignment of the mirror planes between the two involved materials. We
prove that fundamentally no further reduction of the number of domains can be expected for the
given substrate. We suggest the necessity to use off-axis substrates to eventually favor a single domain
growth.
8
Lezowski, Pierre. "Questions d’euclidianité". Thesis, Bordeaux 1, 2012. http://www.theses.fr/2012BOR14642/document.
Testo completoAbstract (sommario):
Nous étudions l'euclidianité des corps de nombres pour la norme et quelques unes de ses généralisations. Nous donnons en particulier un algorithme qui calcule le minimum euclidien d'un corps de nombres de signature quelconque. Cela nous permet de prouver que de nombreux corps sont euclidiens ou non pour la norme. Ensuite, nous appliquons cet algorithme à l'étude des classes euclidiennes pour la norme, ce qui permet d'obtenir de nouveaux exemples de corps de nombres avec une classe euclidienne non principale. Par ailleurs, nous déterminons tous les corps cubiques purs avec une classe euclidienne pour la norme. Enfin, nous nous intéressons aux corps de quaternions euclidiens. Après avoir énoncé les propriétés de base, nous étudions quelques cas particuliers. Nous donnons notamment la liste complète des corps de quaternions euclidiens et totalement définis sur un corps de nombres de degré au plus deuxWe study norm-Euclideanity of number fields and some of its generalizations. In particular, we provide an algorithm to compute the Euclidean minimum of a number field of any signature. This allows us to study the norm-Euclideanity of many number fields. Then, we extend this algorithm to deal with norm-Euclidean classes and we obtain new examples of number fields with a non-principal norm-Euclidean class. Besides, we describe the complete list of pure cubic number fields admitting a norm-Euclidean class. Finally, we study the Euclidean property in quaternion fields. First, we establish its basic properties, then we study some examples. We provide the complete list of Euclidean quaternion fields, which are totally definite over a number field with degree at most two
9
Spangenberg, Ulrich. "Development of a robust output-only strain based damage detection technique for wing-like structures, requiring a minimum number of sensors". Diss., University of Pretoria, 2009. http://hdl.handle.net/2263/30065.
Testo completoAbstract (sommario):
In recent years more emphasis has been placed on in-situ condition based monitoring of engineering systems and structures. Aerospace components are manufactured from composite materials more often. Structural health monitoring (SHM) systems are required in the aerospace industry to monitor the safety and integrity of the structure and will ensure that composites reach its full potential within the industry. Damage detection techniques form an integral part of such SHM systems. With this work a damage detection technique is developed for intended eventual use on composite structures, but starting first on isotropic structures. The damage mechanism that is of interest is delamination damage in composites. A simple numerical equivalent is implemented here however. Two damage indicators, the strain cumulative damage factor (SCDF) and the strain-frequency damage level (SFDL) are introduced. The respective damage indicators are calculated from output-only strain and acceleration response data. The effectiveness of the system to detect damage in the structure is critically evaluated and compared to other damage detection techniques such as the natural frequency method. The sensitivity to damage and performance of both these indicators is examined numerically by evaluating two deterministic damage cases. The numerical study is enhanced through the use of an updated finite element model. The minimum number of sensors capable of detecting the presence and locate damage spatially is determined from numerical simulations. Monte Carlo type analysis is performed by letting the damaged area vary stochastically and calculating the respective damage indicators. The model updating procedure from measured mobility frequency response functions (FRFs) is described. The application of the technique to real structures is examined experimentally. Two test structures with two different damage scenarios are examined. The spatial location and presence of damage can be established from both the SCDF and SFDL values, respectively. The spatial location obtained from the SCDF values corresponded to the known damage location for both the numerical and experimental study. The SFDL proved to be more sensitive than the natural frequency method and could be used to calculate the level of damage within the structure.Dissertation (MEng)--University of Pretoria, 2009.
Mechanical and Aeronautical Engineering
unrestricted
10
Sandgren, Johanna. "Array-based Genomic and Epigenomic Studies in Healthy Individuals and Endocrine Tumours". Doctoral thesis, Uppsala universitet, Institutionen för kirurgiska vetenskaper, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-129533.
Testo completoAbstract (sommario):
The human genome is a dynamic structure, recently recognized to present with significant large-scale structural variation. DNA-copy number changes represent one common type of such variation and is found both between individuals and within the somatic cells of the same individual, especially in disease states like cancer. Apart from DNA-rearrangements, epigenomic changes are increasingly acknowledged as important events in the maintenance of genomic integrity. In this thesis, different array-based methods have been applied for global genomic and epigenomic profiling of both normal and cancer cells. In paper I, a genomic microarray was established and used to determine DNA-copy number variants (CNVs) in a cohort of 76 healthy individuals from three ethnic populations. We identified 315 CNV regions that in total encompassed ~3,5% of the genome. In paper II, the array was utilized to discover CNVs within several differentiated tissues from the same subject. Six variants were identified providing evidence for somatic mosaicism. In paper III and IV we studied pheochromocytomas and paragangliomas, rare endocrine tumours that most often present as benign and sporadic with unclear genetic/epigenetic cause. Genome-wide DNA-copy number analysis of 53 benign and malignant samples in paper III revealed numerous common and novel chromosomal regions of losses and gains. High frequencies of relatively small overlapping regions of deletions were detected on chromosome 1p arm, encompassing several candidate tumour suppressor genes. In paper IV, an epigenomic map for two histone modifications associated with silent (H3K27me3) or active (H3K4me3) gene transcription, was generated for one malignant pheochromocytoma. Integrated analysis of global histone methylation, copy number alterations and gene expression data aided in the identification of candidate tumour genes. In conclusion, the performed studies have contributed to gain knowledge of CNVs in healthy individuals, and identified regions and genes which are likely associated with the development and progression of pheochromocytoma/paraganglioma.
11
Ma, Zheng. "Impeller Power Draw Across the Full Reynolds Number Spectrum". University of Dayton / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=dayton1406766474.
Testo completo
12
Nathu, Nazim. "Changes in selected physiological, biochemical and body composition variables, associated with minimum threshold levels of physical training in normal middle-aged sedentary individuals". Thesis, University of Ulster, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.252893.
Testo completo
13
Frööjd, Thomas, e Olof Rydström. "Is free choice efficient? Will the large number of funds in the Swedish individual accounts system make individuals choose non-effectively?" Thesis, Uppsala University, Department of Economics, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-5965.
Testo completo
14
Pragada, Siva Ramakrishna. "Minimizing the number of collectors to measure uniformity from center pivot systems". Manhattan, Kan. : Kansas State University, 2008. http://hdl.handle.net/2097/903.
Testo completo
15
Lezowski, Pierre. "Questions d'Euclidianité". Phd thesis, Université Sciences et Technologies - Bordeaux I, 2012. http://tel.archives-ouvertes.fr/tel-00765252.
Testo completoAbstract (sommario):
Nous étudions l'euclidianité des corps de nombres pour la norme et quelques unes de ses généralisations. Nous donnons en particulier un algorithme qui calcule le minimum euclidien d'un corps de nombres de signature quelconque. Cela nous permet de prouver que de nombreux corps sont euclidiens ou non pour la norme. Ensuite, nous appliquons cet algorithme à l'étude des classes euclidiennes pour la norme, ce qui permet d'obtenir de nouveaux exemples de corps de nombres avec une classe euclidienne non principale. Par ailleurs, nous déterminons tous les corps cubiques purs avec une classe euclidienne pour la norme. Enfin, nous nous intéressons aux corps de quaternions euclidiens. Après avoir énoncé les propriétés de base, nous étudions quelques cas particuliers. Nous donnons notamment la liste complète des corps de quaternions euclidiens et totalement définis sur un corps de nombres de degré au plus deux.
16
Yeo, Ronald A., Sephira G. Ryman, den Heuvel Martijn P. van, Reus Marcel A. de, Rex E. Jung, Jessica Pommy, Andrew R. Mayer et al. "Graph Metrics of Structural Brain Networks in Individuals with Schizophrenia and Healthy Controls: Group Differences, Relationships with Intelligence, and Genetics". Cambridge University Press, 2016. https://tud.qucosa.de/id/qucosa%3A70691.
Testo completoAbstract (sommario):
Objectives: One of the most prominent features of schizophrenia is relatively lower general cognitive ability (GCA). An emerging approach to understanding the roots of variation in GCA relies on network properties of the brain. In this multi-center study, we determined global characteristics of brain networks using graph theory and related these to GCA in healthy controls and individuals with schizophrenia.
Methods: Participants (N = 116 controls, 80 patients with schizophrenia) were recruited from four sites. GCA was represented by the first principal component of a large battery of neurocognitive tests. Graph metrics were derived from diffusion-weighted imaging.
Results: The global metrics of longer characteristic path length and reduced overall connectivity predicted lower GCA across groups, and group differences were noted for both variables. Measures of clustering, efficiency, and modularity did not differ across groups or predict GCA. Follow-up analyses investigated three topological types of connectivity—connections among high degree “rich club” nodes, “feeder” connections to these rich club nodes, and “local” connections not involving the rich club. Rich club and local connectivity predicted performance across groups. In a subsample (N = 101 controls, 56 patients), a genetic measure reflecting mutation load, based on rare copy number deletions, was associated with longer characteristic path length.
Conclusions: Results highlight the importance of characteristic path lengths and rich club connectivity for GCA and provide no evidence for group differences in the relationships between graph metrics and GCA.
17
Ruengvirayudh, Pornchanok. "A Monte Carlo Study of Parallel Analysis, Minimum Average Partial, Indicator Function, and Modified Average Roots for Determining the Number of Dimensions with Binary Variables in Test Data: Impact of Sample Size and Factor Structure". Ohio University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou151516919677091.
Testo completo
18
Jorge, Grasiele Cristiane 1983. "Reticulados q-ários e algébricos". [s.n.], 2012. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306602.
Testo completoAbstract (sommario):
Orientador: Sueli Irene Rodrigues CostaTese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Cientifica
Made available in DSpace on 2018-08-19T16:10:47Z (GMT). No. of bitstreams: 1 Jorge_GrasieleCristiane_D.pdf: 3823740 bytes, checksum: 772a88bd2136b4afb884a6e824f37bce (MD5) Previous issue date: 2012
Resumo: O uso de códigos e reticulados em teoria da informação e na "chamada criptografia pós-quântica" vem sendo cada vez mais explorado. Neste trabalho estudamos temas relacionados a estas duas vertentes. A análise de reticulados foi feita via as métricas euclidiana e da soma. Para a métrica euclidiana, estudamos um algoritmo que procura pela treliça mínima de um reticulado com sub-reticulado ortogonal. No caso bidimensional foi possível caracterizar todos os sub-reticulados ortogonais de um reticulado racional qualquer. No estudo de reticulados via métrica da soma, trabalhamos com duas relações entre códigos e reticulados, conhecidas como "Construção A" e "Construção B". Generalizamos a Construção B para uma classe de códigos q-ários... Observação: O resumo, na íntegra, poderá ser visualizado no texto completo da tese digital
Abstract: The use of codes and lattices in Information Theory and in the so-called "Post-quantum Cryptography" has been increasingly explored. In this work we have studied topics related to these two aspects. The analysis of lattices was made via Euclidean and sum metrics. For the Euclidean metric we studied an algorithm that searches for a minimum trellis of a lattice with orthogonal sublattice. In the two-dimensional case it has been possible to characterize all orthogonal sublattices of any rational lattice. In the study of lattices via sum metric, we worked with two relations between codes and lattices, the so-called "Construction A " and "Construction B". We generalized Construction B for the class of q-ary codes...Note: The complete abstract is available with the full electronic document
Doutorado
Matematica
Doutor em Matemática
19
Ferrari, Agnaldo José 1969. "Reticulados algébricos : abordagem matricial e simulações". [s.n.], 2012. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306601.
Testo completoAbstract (sommario):
Orientador: Sueli Irene Rodrigues CostaTese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica
Made available in DSpace on 2018-08-20T11:38:10Z (GMT). No. of bitstreams: 1 Ferrari_AgnaldoJose_D.pdf: 2344410 bytes, checksum: faa96ccdd8ff4ec461abc4f69d6cc999 (MD5) Previous issue date: 2012
Resumo: Neste trabalho abordamos a construção de reticulados usando propriedades da Teoria Algébrica dos Números. Enfocamos a construção de alguns reticulados com características especiais, conhecidos na literatura, via reticulados ideais, através de uma abordagem matricial e algorítmica...Observação: O resumo, na íntegra, poderá ser visualizado no texto completo da tese digital
Abstract: In this work we approach lattice constructions using properties of algebraic number theory. One focus is on the construction of some well known lattices via ideal lattices, through a matrix and algorithmic approach...Note: The complete abstract is available with the full electronic document
Doutorado
Matematica Aplicada
Doutor em Matemática Aplicada
20
Hartlová, Alena. "Vývoj sociálního pojištění z hlediska odvození plateb do veřejného rozpočtu". Master's thesis, Vysoká škola ekonomická v Praze, 2007. http://www.nusl.cz/ntk/nusl-4119.
Testo completoAbstract (sommario):
This thesis deals with the development of social insurance, specifically with health insurance and social security, from the standpoint of transfer of insurance-generated monies to the state budget. It presents the significance of social insurance in its current form and an analysis of the principal changes it has undergone in the last fifteen years. It particularly examines changes in the definition of participants in social insurance and changes in the use and structure of bases of measurement in individual insurance subsystems. This thesis also includes an analysis of these changes which seeks to analyze the past and potential impact of shifts in basic factors which influence the amount of money flowing from insurance to the state budget (such as minimum wage, average wage and number of paying participants) on individual participants in social insurance.
21
Akyurek, Alper Sinan. "Swim: A New Multicast Routing Algorithm For Wireless Networks". Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613348/index.pdf.
Testo completoAbstract (sommario):
In this work, a new multicast routing algorithm for wireless networks is presented. The algorithm, called SWIM (Source-initiated WIreless Multicast), is a depth-optimal multicast tree formation algorithm. SWIM is fully distributed and has an average computational complexity of O(N 2 ). SWIM forms a shared tree from the source(s) to destinationsyet, as a by-product, it creates a multicast mesh structure by maintaining alternative paths at every tree node. This makes SWIM suitable for both ad hoc networks and access networks with multiple gateways. An extension to the main algorithm is presented for the use in dynamic networks with mobility and/or dynamic destination group. Performance of SWIM is studied with simulations and is compared to other algorithms in the literature. Due to depth optimality, SWIM achieves a lower average and maximum delay than the compared algorithms. The throughput performance is found to be high. Working capability with rateless codes are also studied.
22
Nelson, Cindy. "An archaeozoological and ethnographic investigation into animal utilisation practices of the Ndzundza Ndebele of the Steelpoort River Valley, South Africa, 1700 AD – 1900 AD". Diss., 2009. http://hdl.handle.net/2263/28332.
Testo completoAbstract (sommario):
Focussing on Archaeozoological faunal analysis, this dissertation aims to investigate the animal food utilization practices of the Ndzundza Ndebele by combining archaeozoologcial methods, archaeological data, ethnographic and historic information. The Ndzundza Ndebele inhabited three different sites in the Steelpoort River Valley during c. 1700 AD – 1900 AD. They were forced to relocate from KwaMaza and Esikhunjini to KoNomtjarhelo as a result of continual fighting between themselves and contemporary Iron Age/Historic communities, the British and the Boers during this period. I aim to identify the animal species utilized by the Ndzundza Ndebele in addition to whether or not the hostile and politically unstable period had any effect on Ndzundza animal food procurement, use and discard. Additionally I investigate whether the faunal remains recovered from the three sites can be used to identify ethnic affiliations, gender roles and ritual use with regards to animals and/or animal parts. Ultimately, I aim to demonstrate that faunal remains cannot be fully understood and interpreted without incorporating relevant ethnographic and/or historic information and as comprehensive an archaeological context as possible. CopyrightDissertation (MA)--University of Pretoria, 2009.
Anthropology and Archaeology
unrestricted
23
Lin, Chin-Hung, e 林晉宏. "Applications of zero forcing number to the minimum rank problem". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/15455102121346800002.
Testo completo
24
Shih, Chih-Min, e 施志民. "Construction of All Tournaments with The Minimum Number of Upsets". Thesis, 2013. http://ndltd.ncl.edu.tw/handle/83505520359549324935.
Testo completoAbstract (sommario):
碩士國立臺灣科技大學
資訊管理系
101
In a tournament, there are n players v_1, v_2, ..., v_n such that each pair of distinct players v_i and v_j is joined in only one game and no game is permitted to end in a tie. The score of v_i, denoted by s_i, is the total number of games that v_i wins. The score sequence of a tournament is a non-decreasing integer sequence S=(s_1, s_2, ..., s_n) with s_1 <= s_2 <=... <= s_n. We say that an upset occurs in a tournament if there are two players v_i and v_j with i
25
Li, Ying 1963 Mar 3. "A PMAC motor drive with a minimum number of sensors / Li Ying". 2002. http://hdl.handle.net/2440/21858.
Testo completoAbstract (sommario):
"October 2002"Bibliography: p. 219-228.
xi, 229 p. : ill. (some col.), plates (col.) ; 30 cm.
Title page, contents and abstract only. The complete thesis in print form is available from the University Library.
Proposes a robust indirect position sensing technique implemented in real time using a DSP based motor controller. This is based on a rotor position estimation using the measured phase voltages and currents of the motor. An incremental algorithm is used to estimate the flux linkage increments, which eliminates the integration involved in the flux linkage estimation. This feature provides a wider operating speed range and robustness.
Thesis (Ph.D.)--University of Adelaide, Dept. of Electrical and Electronic Engineering, 2002
26
Wei, Po-Sun, e 魏伯珊. "Balancing a Complete Signed Graph by Changing Minimum Number of Edge Signs". Thesis, 2012. http://ndltd.ncl.edu.tw/handle/40274147250963197905.
Testo completoAbstract (sommario):
碩士國立中正大學
資訊工程研究所
100
A signed graph is a simple undirected graph G = (V,E) in which each edge is labeled by a sign either +1 or -1. A signed graph is balanced if every cycle has even numbers of negative edges. In this thesis we study the problem of balancing a complete signed graph by changing minimum number of edge signs. We give a simple algorithm for nding a solution agreeing one half of the edges. We also design a branch-and-bound algorithm and show the worst-case time complexity is O(n · 2^min{n,k}), in which n = |V| and k is the minimum number of changing edges. By experiments on random graphs, we show that our branch-and-bound algorithm is much faster than a trivial one.
27
"Finding the minimum test set with the optimum number of internal probe points". Chinese University of Hong Kong, 1996. http://library.cuhk.edu.hk/record=b5888785.
Testo completoAbstract (sommario):
by Kwan Wai Wing Eric.Thesis (M.Phil.)--Chinese University of Hong Kong, 1996.
Includes bibliographical references.
ABSTRACT
ACKNOWLEDGMENT
LIST OF FIGURES
LIST OF TABLES
Chapter Chapter 1 --- Introduction
Chapter 1.1 --- Background --- p.1-1
Chapter 1.2 --- E-Beam testing and test generation algorithm --- p.1-2
Chapter 1.3 --- Motivation of this research --- p.1-4
Chapter 1.4 --- Out-of-kilter Algorithm --- p.1-6
Chapter 1.5 --- Outline of the remaining chapter --- p.1-7
Chapter Chapter 2 --- Electron Beam Testing
Chapter 2.1 --- Background and Theory --- p.2-1
Chapter 2.2 --- Principles and Instrumentation --- p.2-4
Chapter 2.3 --- Implication of internal IC testing --- p.2-6
Chapter 2.4 --- Advantage of Electron Beam Testing --- p.2-7
Chapter Chapter 3 --- An exhaustive method to minimize test sets
Chapter 3.1 --- Basic Principles --- p.3-1
Chapter 3.1.1 --- Controllability and Observability --- p.3-1
Chapter 3.1.2 --- Single Stuck at Fault Model --- p.3-2
Chapter 3.2 --- Fault Dictionary --- p.3-4
Chapter 3.2.1 --- Input Format --- p.3-4
Chapter 3.2.2 --- Critical Path Generation --- p.3-6
Chapter 3.2.3 --- Probe point insertion --- p.3-8
Chapter 3.2.4 --- Formation of Fault Dictionary --- p.3-9
Chapter Chapter 4 --- Mathematical Model - Out-of-kilter algorithm
Chapter 4.1 --- Network Model --- p.4-1
Chapter 4.2 --- Linear programming model --- p.4-3
Chapter 4.3 --- Kilter states --- p.4-5
Chapter 4.4 --- Flow change --- p.4-7
Chapter 4.5 --- Potential change --- p.4-9
Chapter 4.6 --- Summary and Conclusion --- p.4-10
Chapter Chapter 5 --- Apply Mathematical Method to minimize test sets
Chapter 5.1 --- Implementation of OKA to the Fault Dictionary --- p.5-1
Chapter 5.2 --- Minimize test set and optimize internal probings / probe points --- p.5-5
Chapter 5.2.1 --- Minimize the number of test vectors --- p.5-5
Chapter 5.2.2 --- Find the optimum number of internal probings --- p.5-8
Chapter 5.2.3 --- Find the optimum number of internal probe points --- p.5-11
Chapter 5.3 --- Fixed number of internal probings/probe points --- p.5-12
Chapter 5.4 --- True minimum test set and optimum probing/ probe point --- p.5-14
Chapter Chapter 6 --- Implementation and work examples
Chapter 6.1 --- Generation of Fault Dictionary --- p.6-1
Chapter 6.2 --- Finding the minimum test set without internal probe point --- p.6-5
Chapter 6.3.1 --- Finding the minimum test set with optimum internal probing --- p.6-10
Chapter 6.3.2 --- Finding the minimum test set with optimum internal probe point --- p.6-24
Chapter 6.4 --- Finding the minimum test set by fixing the number of internal probings at 2 --- p.6-26
Chapter 6.5 --- Program Description --- p.6-35
Chapter Chapter 7 --- Realistic approach to find the minimum solution
Chapter 7.1 --- Problem arising in exhaustive method --- p.7-1
Chapter 7.2 --- Improvement work on existing test generation algorithm --- p.7-2
Chapter 7.3 --- Reduce the search set --- p.7-5
Chapter 7.3.1 --- Making the Fault Dictionary from existing test generation algorithm --- p.7-5
Chapter 7.3.2 --- Making the Fault Dictionary by random generation --- p.7-9
Chapter Chapter 8 --- Conclusions
Chapter 8.1 --- Summary of Results --- p.8-1
Chapter 8.2 --- Further Research --- p.8-5
REFERENCES --- p.R-1
Chapter Appendix A --- Fault Dictionary of circuit SC1 --- p.A-1
Chapter Appendix B --- Fault Dictionary of circuit SC7 --- p.B-1
Chapter Appendix C --- Simple Circuits Layout --- p.C-1
28
Chiang, Pei-Jung, e 江佩蓉. "A study on the Tactile Number Recognition for Individuals with Visual Impairment". Thesis, 2009. http://ndltd.ncl.edu.tw/handle/80646677113494642799.
Testo completoAbstract (sommario):
碩士大同大學
工業設計學系(所)
97
The purpose of this study was to explore the performance of recognition for tactile numbers applied to buttons of elevator. The effect can take care of all of the visually impaired and provide favorable frame of reference for tactile marked for a variety of products. There were two experiments in this study. The first experiment was to explore the performance of tactile number recognition not only by measuring the recognition rate and the recognition time but also asking the subjects to predict the possible reasons for this kind of tactile illusion. The 12 blindfolded sighted students were asked to recognize 4 different tactile number sheets which had 40 randomized numbers in each. The ANOVA showed that the number without a circle frame had the better recognition rate and time than the number with a frame, and also the male subjects had the better performance than the female. The font with an equal width in all strokes had the significantly lower recognition time than the font without an equal width in all strokes but not at the recognition rate. There was no different found between vertical and horizontal arrangements. The illusion pairs and error rate were: 1 mistaken for 7 (11.7%); 9 mistaken for 0 (10.2%); 6 mistaken for 0 (8.7%); 8 mistaken for 6 (5.3%); 3 mistaken for 5 (4.9%); 7 mistaken for 1 (4.5%); 5 mistaken for 3 (3.7%). The major reasons for these mistakes were subjectively considered to be the number frame, font, size, and tactile height. The experiment 2 were「elevator control buttons experiment」which simulate operate of the elevator contro1 buttons with 15 participants who were visual impairment to recognize 8 different tactile number sheets. The ANOVA showed that 「arrangement of buttons」 and the 「rows of buttons」without significant differences in recognition time and recognition error.『Recognition time』and『Recognition error』from the levels of cognitive category factor shown significant differences, the people just know Braille had the best performance. The performance of people who just know Arabic numerals was the worst. Recognition time』 and 『Recognition error』from the levels of recognition method factor shown significant differences, The performance of people who recognition only by tactile numbers was the worst. The results and conclusions might be referred at the design of elevator control buttons and other related research.
29
Liu, Tsung-En, e 劉宗恩. "Control and Implementation of Grid-Connected PMSG System with Minimum Number of Power Switches". Thesis, 2018. http://ndltd.ncl.edu.tw/handle/b73zfv.
Testo completoAbstract (sommario):
碩士國立交通大學
電控工程研究所
107
In this thesis, the control and implementation of grid-connected PMSG system with minimum number of power switches is presented. Compared with the traditional generator circuit architecture, this thesis reduces the number of switches to the minimum, but at the same time can still achieve the function of rectification and power generation into the grid. The grid-connected half-bridge converter can be controlled by using two IGBT switches. The purpose of the control is to stabilize the DC link voltage and correct the input current to the same phase as the input voltage to achieve power factor correction. In the case of permanent magnet synchronous generators, four IGBT switches are used to adjust the amount of constant torque current to adjust the power that the generator can provide, and to correct the input currents into sine waves. The proposed circuit and control system is implemented in Texas Intruments Digital Signal Processor(DSP) TMS320F28335 chip. Through simulation and implementation, it is verified that the control and implementation of grid-connected PMSG system with minimum number of power switches does have its functionality.
30
Elzinga, Randall J. "The Minimum Witt Index of a Graph". Thesis, 2007. http://hdl.handle.net/1974/682.
Testo completoAbstract (sommario):
An independent set in a graph G is a set of pairwise nonadjacent vertices, and the maximum size, alpha(G), of an independent set in G is called the independence number.
Given a graph G and weight matrix A of G with entries from some field F, the maximum dimension of an A-isotropic subspace, known as the Witt index of A, is an upper bound on alpha(G). Since any weight matrix can be used, it is natural to seek the minimum upper bound on the independence number of G that can be achieved by a weight matrix. This
minimum, iota_F^*(G), is called the minimum Witt index of G over F, and the resulting bound, alpha(G)<= iota_F^*(G), is called
the isotropic bound.
When F is finite, the possible values of iota_F^*(G) are determined and the graphs that attain the isotropic bound are characterized. The characterization is given in terms of graph classes CC(n,t,c)
and CK(n,t,k) constructed from certain spanning subgraphs called C(n,t,c)-graphs and K(n,t,k)-graphs. Here t is the term rank
of the adjacency matrix of G.
When F=R, the isotropic bound is known as the Cvetkovi\'c bound. It is shown that it is sufficient to consider a finite number of
weight matrices A when determining iota_R^*(G) and that, in many cases, two weight values suffice. For example, if the vertex set of G can be covered by alpha(G) cliques, then G attains the Cvetkovi\'c bound with a weight matrix with two weight values.
Inequalities on alpha and iota_F^* resulting from graph operations such as sums, products, vertex deletion, and vertex identification are examined and, in some cases, conditions that imply equality are proved. The equalities imply that the problem of determining whether or not alpha(G)=iota_F^*(G) can be reduced to that of determining iota_F^*(H) for certain crucial graphs H found from G.Thesis (Ph.D, Mathematics & Statistics) -- Queen's University, 2007-09-04 15:38:47.57
31
Teoh, Zi-Han, e 張子涵. "A Comprehensive Database Integrating Copy Number Variation Profile in Healthy Individuals and Human Cancer". Thesis, 2019. http://ndltd.ncl.edu.tw/handle/jgc479.
Testo completoAbstract (sommario):
碩士國立臺灣大學
生醫電子與資訊學研究所
107
Copy number variation (CNV) is a region with structural variation in which the genomic copy numbers (CN) differs when compared to the reference genome. It is classically defined as a genomic segment that consists of at least 1000 base pairs of sequence alterations. In human genome, CNV may cause genomic imbalance by regulating gene expression levels through dosage effect and has been associated with multiple disease, including cancer. Thus far, many researchers have studied the relationship between cancer and CNV, providing intriguing insights into CNV roles as cancer biomarker. Despite an intensive increase in the amount of related biological validation experiments, the distinct lack of an integrated resource that supports highly-efficient CNV research has drive our study to construct a comprehensive online database to simplify the data mining, retrieval, and analysis processes of CNV investigations. In this study, we integrate the CNV profiles of healthy populations, cancer patients, and cancer cell lines from various sources. The baseline CNV frequency of 22155 genes serving as comparisons benchmark were established, and we constructed the CNV profile of 70 types of human cancer. We further demonstrate the potential application of this system by analyzing CNV data from 542 lung adenocarcinoma patients. With the provision of an easy query and online submission analysis schema, we expect that this database would serve as an important tool to assist researchers in uniformly processing, comparing and retrieving CNV data, as well as in facilitating the clinical interpretation and discoveries of significant CNVs.
32
Doan, Trung Duy. "Proper connection number of graphs". Doctoral thesis, 2018. https://tubaf.qucosa.de/id/qucosa%3A31245.
Testo completoAbstract (sommario):
The concept of \emph{proper connection number} of graphs is an extension of proper colouring and is motivated by rainbow connection number of graphs. Let $G$ be an edge-coloured graph. Andrews et al.\cite{Andrews2016} and, independently, Borozan et al.\cite{Borozan2012} introduced the concept of proper connection number as follows: A coloured path $P$ in an edge-coloured graph $G$ is called a \emph{properly coloured path} or more simple \emph{proper path} if two any consecutive edges receive different colours. An edge-coloured graph $G$ is called a \emph{properly connected graph} if every pair of vertices is connected by a proper path. The \emph{proper connection number}, denoted by $pc(G)$, of a connected graph $G$ is the smallest number of colours that are needed in order to make $G$ properly connected. Let $k\geq2$ be an integer. If every two vertices of an edge-coloured graph $G$ are connected by at least $k$ proper paths, then $G$ is said to be a \emph{properly $k$-connected graph}. The \emph{proper $k$-connection number} $pc_k(G)$, introduced by Borozan et al. \cite{Borozan2012}, is the smallest number of colours that are needed in order to make $G$ a properly $k$-connected graph.
The aims of this dissertation are to study the proper connection number and the proper 2-connection number of several classes of connected graphs. All the main results are contained in Chapter 4, Chapter 5 and Chapter 6.
Since every 2-connected graph has proper connection number at most 3 by Borozan et al. \cite{Borozan2012} and the proper connection number of a connected graph $G$ equals 1 if and only if $G$ is a complete graph by the authors in \cite{Andrews2016, Borozan2012}, our motivation is to characterize 2-connected graphs which have proper connection number 2. First of all, we disprove Conjecture 3 in \cite{Borozan2012} by constructing classes of 2-connected graphs with minimum degree $\delta(G)\geq3$ that have proper connection number 3. Furthermore, we study sufficient conditions in terms of the ratio between the minimum degree and the order of a 2-connected graph $G$ implying that $G$ has proper connection number 2. These results are presented in Chapter 4 of the dissertation.
In Chapter 5, we study proper connection number at most 2 of connected graphs in the terms of connectivity and forbidden induced subgraphs $S_{i,j,k}$, where $i,j,k$ are three integers and $0\leq i\leq j\leq k$ (where $S_{i,j,k}$ is the graph consisting of three paths with $i,j$ and $k$ edges having an end-vertex in common).
Recently, there are not so many results on the proper $k$-connection number $pc_k(G)$, where $k\geq2$ is an integer. Hence, in Chapter 6, we consider the proper 2-connection number of several classes of connected graphs. We prove a new upper bound for $pc_2(G)$ and determine several classes of connected graphs satisfying $pc_2(G)=2$. Among these are all graphs satisfying the Chv\'tal and Erd\'{o}s condition ($\alpha({G})\leq\kappa(G)$ with two exceptions). We also study the relationship between proper 2-connection number $pc_2(G)$ and proper connection number $pc(G)$ of the Cartesian product of two nontrivial connected graphs.
In the last chapter of the dissertation, we propose some open problems of the proper connection number and the proper 2-connection number.
33
Manzoor, Shaukat. "INCREASES IN THE NUMBER OF FROST- FREE DAYS ACROSS CANADA DURING WINTER PERIOD". Thesis, 2013. http://hdl.handle.net/10214/7445.
Testo completoAbstract (sommario):
An annual analysis of data from 11 weather stations across Canada was examined for temporal changes in the number of frost free days (FFDs) per winter. From 1940 to 2009, Canada has experienced an increase in the number of FFDs with an average of 12 days in 100 years. The numbers of FFDs per winter increased exponentially when mean WDMT rises steadily. The best fit normal distribution function of WDMT in recent decades has shifted toward the hotter part of the curve.
The predicted numbers of FFDs per winter from the exceedance probability (EP) has increased exponentially when mean WDMT rise steadily. The EP model displayed a close comparison between the predicted and the measured number of FFDs. The EP model also provides a useful tool for making predictions about the increase in the number of frost-free days at any single station, given the rate of rise in minimum temperatures
34
NESNÍDALOVÁ, Kristýna. "Vliv minimální mzdy na disponibilní příjmy fyzické osoby". Master's thesis, 2019. http://www.nusl.cz/ntk/nusl-394624.
Testo completoAbstract (sommario):
The thesis focuses on minimum wage. The aim of the work is to evaluate the impact of the growth of the minimum wage on disposable incomes of natural persons from employment and self-employed activity from 2011 to 2019. Subsequently, there are suggested measures to help reduce the levies on the income of individuals, thus maintaining the highest disposable income.
35
Mehrabidavoodabadi, Saeed. "Geometric optimization problems on orthogonal polygons: hardness results and approximation algorithms". 2015. http://hdl.handle.net/1993/30984.
Testo completoAbstract (sommario):
In this thesis, we design and develop new approximation algorithms and complexity results for three guarding and partitioning problems on orthogonal polygons; namely, guarding orthogonal polygons using sliding cameras, partitioning orthogonal polygons so as to minimize the stabbing number and guarding orthogonal terrains using vertex guards.
We first study a variant of the well-known art gallery problem in which sliding cameras are used to guard the polygon. We consider two versions of this problem: the Minimum- Cardinality Sliding Cameras (MCSC) problem in which we want to guard P with the minimum number of sliding cameras, and the Minimum-Length Sliding Cameras (MLSC) problem in which the goal is to compute a set S of sliding cameras for guarding P so as to minimize the total length of trajectories along which the cameras in S travel. We answer questions posed by Katz and Morgenstern (2011) by presenting the following results: (i) the MLSC problem is polynomially tractable even for orthogonal polygons with holes, (ii) the MCSC problem is NP-complete when P is allowed to have holes, and (iii) an O(n)-time exact algorithm for the MCSC problem on monotone polygons.
We then study a conforming variant of the problem of computing a partition of an orthogonal polygon P into rectangles whose stabbing number is minimum over all such partitions of P. The stabbing number of such a partition is the maximum number of rectangles intersected by any orthogonal line segment inside the polygon. In this thesis, we first give an O(n log n)-time algorithm that solves this problem exactly on histograms. We then show that the problem is NP-hard for orthogonal polygons with holes, providing the first hardness result for this problem. To complement the NP-hardness result, we give a 2-approximation algorithm for the problem on both polygons with and without holes.
Finally, we study a variant of the terrain guarding problem on orthogonal terrains in which the objective is to guard the vertices of an orthogonal terrain with the minimum number of vertex guards. We give a linear-time algorithm for this problem under a directed visibility constraint.February 2016
36
Turcotte, Jérémie. "Le jeu de policiers-voleur sur différentes classes de graphes". Thesis, 2020. http://hdl.handle.net/1866/25478.
Testo completoAbstract (sommario):
Réalisé avec le support financier du Conseil de recherches en sciences naturelles et en génie du Canada (CRSNG) et du Fonds de Recherche du Québec – Nature et technologies (FRQNT).Ce mémoire étudie le jeu de policiers-voleur et contient trois articles, chacun portant sur une classe de graphes spécifique. Dans le premier chapitre, la notation et les définitions de base de la théorie de graphe qui nous serons utiles sont introduites. Bien que chaque article comporte une introduction citant les concepts et résultats pertinents, le premier chapitre de ce mémoire contient aussi une introduction générale au jeu de policiers-voleur et présente certains des résultats majeurs sur ce jeu. Le deuxième chapitre contient l’article écrit avec Seyyed Aliasghar Hosseini et Peter Bradshaw portant sur le jeu de policiers-voleurs sur les graphes de Cayley abéliens. Nous améliorons la borne supérieure sur le cop number de ces graphes en raffinant les méthodes utilisées précédemment par Hamidoune, Frankl et Bradshaw. Le troisième chapitre présente l’article concernant le cop number des graphes 2K2-libres. Plus précisément, il est prouvé que 2 policiers peuvent toujours capturer le voleur sur ces graphes, prouvant ainsi la conjecture de Sivaraman et Testa. Finalement, le quatrième chapitre est l’article écrit avec Samuel Yvon et porte sur les graphes qui ont cop number 4. Nous montrons que tous ces graphes ont au moins 19 sommets. En d’autres mots, 3 policiers peuvent toujours capturer le voleur sur tout graphe avec au plus 18 sommets, ce qui répond par la négative à une question de Andreae formulée en 1986. Un pan important de la preuve est faite par ordinateur; ce mémoire contient donc une annexe comprenant le code utilisé.
This thesis studies the game of cops and robbers and consists of three articles, each considering a specific class of graphs. In the first chapter, notation and basic definitions of graph theory are introduced. Al- though each article has an introduction citing the relevant concepts and results, the first chapter of this thesis also contains a general introduction to the game of cops and robbers and presents some of its major results. The second chapter contains the paper written with Seyyed Aliasghar Hosseini and Peter Bradshaw on the game of cops and robbers on abelian Cayley graphs. We improve the upper bound on the cop number of these graphs by refining the methods used previously by Hamidoune, Frankl and Bradshaw. The third chapter presents the paper concerning the cop number of 2K2-free graphs. More precisely, it is proved that 2 cops can always catch the robber on these graphs, proving a conjecture of Sivaraman and Testa. Finally, the fourth chapter is the paper written with Samuel Yvon which deals with graphs of cop number 4. We show that such graphs have at least 19 vertices. In other words, 3 cops can always catch the robber on any graph with at most 18 vertices, which answers in the negative a question by Andreae from 1986. An important part of the proof is by computer; this thesis thus has an appendix containing the code used.
37
Gernhardt, Johannes. "Paläopathologische Untersuchungen an prähistorischen Zähnen und Kieferfragmenten – ein Beitrag zur zahnmedizinisch-epidemiologischen Rekonstruktion einer neolithischen Population aus Erwitte-Schmerlecke (Soest, Galeriegrab I)". Doctoral thesis, 2019. http://hdl.handle.net/21.11130/00-1735-0000-0003-C192-D.
Testo completo