Dissertations / Theses on the topic 'Upper number'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 25 dissertations / theses for your research on the topic 'Upper number.'
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.
Van, Hirtum Annemie. "Moderate Reynolds number flow. Application to the human upper airways." Habilitation à diriger des recherches, Université de Grenoble, 2011. http://tel.archives-ouvertes.fr/tel-00747213.
Full textEngelhardt, Toni, Robert Jedicke, Peter Vereš, Alan Fitzsimmons, Larry Denneau, Ed Beshore, and Bonnie Meinke. "An Observational Upper Limit on the Interstellar Number Density of Asteroids and Comets." IOP PUBLISHING LTD, 2017. http://hdl.handle.net/10150/623256.
Full textDabrowski, Mikael. "The relationship between upper and lower body power and strength and boxers’ number of completed bouts." Thesis, Högskolan i Halmstad, Akademin för ekonomi, teknik och naturvetenskap, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-33904.
Full textLiu, Shaobin. "Characterization, geographic distribution, and number of upper Eocene impact ejecta layers and their correlations with source craters." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file 15.46 Mb., 308 p, 2006. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:3220787.
Full textBjörkström, Angela. "Is it all in their heads? : A study of the strategies used in mental arithmetic by Swedish pupils in their last years of the obligatory school and in the upper secondary school." Thesis, Mälardalen University, School of Education, Culture and Communication, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-4615.
Full textCompetence in mental arithmetic is recognised by many as essential to be active participants in the fast flowing, high technological society we live in today. Many have noticed pupils’ unwillingness to set their calculators aside and practice this aspect of mathematics when possible. Furthermore, some studies show that pupils’ ability to compute mentally deteriorates as they pass through the school system. Through testing classes in a Swedish obligatory school and an upper secondary school, the aim of this thesis is to see if the goals set by The National [Swedish] Agency for Education regarding mental arithmetic, are being fulfilled. Through using questionnaires to collect the strategies and ideas of the pupils, a wide range of problematic mathematical misconceptions became evident. These are highlighted since they are important aspects teachers should be aware of. The results of this study show that the obligatory school classes are far from reaching the goals set for them whereas the upper secondary classes show good results. Furthermore, there is an apparent improvement in their progression, resulting in a fulfilment the official goals. Many pupils however, seem reluctant to rely on their mental arithmetic capabilities and resort to algorithmic strategies. Other problems to emerge are in carrying out table calculations and in a lack of number sense when deeming if the answers are reasonable.
Holt, Tracy Lance. "On the Attainability of Upper Bounds for the Circular Chromatic Number of K4-Minor-Free Graphs." Digital Commons @ East Tennessee State University, 2008. https://dc.etsu.edu/etd/1916.
Full textConlon, D. "Upper bounds for Ramsey numbers." Thesis, University of Cambridge, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.597892.
Full textMurru, Serena. "On the upper semicontinuity of HSL numbers." Thesis, University of Sheffield, 2016. http://etheses.whiterose.ac.uk/15770/.
Full textMohammed, Dilbak. "Generalised Frobenius numbers : geometry of upper bounds, Frobenius graphs and exact formulas for arithmetic sequences." Thesis, Cardiff University, 2015. http://orca.cf.ac.uk/98161/.
Full textHerrmann, Gerrit [Verfasser], and Stefan [Akademischer Betreuer] Friedl. "Sutured manifolds, L²-Betti numbers and an upper bound on the leading coefficient / Gerrit Herrmann ; Betreuer: Stefan Friedl." Regensburg : Universitätsbibliothek Regensburg, 2019. http://d-nb.info/1191990095/34.
Full textKidwell, Ann-Sofie. "Gymnasieelevers uppfattningar om negativa tal och vilka strategier som synliggörs i deras beräkningar : En fenomenografisk studie." Thesis, KTH, Lärande, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-257532.
Full textFrom an early age we learn to use positive numbers. We can put two numbers together and get a bigger number or subtract a number from another to get a smaller number. For example,young children learn that two plus two apples will be four apples and that if you have three pears and remove two you have one pear left. It is easy to visualize the numbers in front of you. Something that is not as obvious is calculations such four minus five. How can one have four pears and subtract five? Negative numbers rarely appear in everyday problems, but it is still something we are required to learn in school. The purpose of the work described in this report is to examine the upper secondary school pupils' perceptions of negative numbers and as the theoretical framework a phenomenographic approach is used. To find out what different perceptions pupils may have about negative numbers, eight pupils were interviewed. They were all in their second year in upper secondary school and study mathematics at the (Swedish) level 2b. The survey intended to answer the following question: How do upper secondary school students perceive negative numbers and what strategies are made visible in their calculations? What different categories of descriptions about negative numbers can be distinguished? A qualitative study was preformed of the collected material using a phenomenographic analysis. After the analysis, five distinctly different description categories could be distinguished, where all categories, except the last one, results in the student using some form of strategy as help when performing calculations containing negative numbers: (1) Minus minus becomes plus, (2) Negative numbers are explained by metaphors, (3) Calculations become easier if the terms in an expression are moved around, (4) Negative numbers are on the other side zero, and (5) Experience of uncertainty about negative numbers. The results can help math teachers understand the challenges students face when calculating with negative numbers. For example, the pupils do not think it is natural or enough to describe a number as negative, which may be because they are used to mathematics which can beexplained by concrete examples. This is something that math teacher should be aware of.
Müller, Jan. "Kondenzační technika a odvody spalin." Master's thesis, Vysoké učení technické v Brně. Fakulta stavební, 2014. http://www.nusl.cz/ntk/nusl-226844.
Full textLiu, Ting-Wei, and 劉庭崴. "Upper Bounds on k-rainbow Domination Number of Sierpiński Graphs." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/edz49c.
Full text明志科技大學
工業工程與管理系碩士班
102
The k-rainbow domination is a variant of the classical domination problem in graphs and is defined as follows. Given an undirected graph G = (V, E), we have a set C with k colors and assign an arbitrary subset of these colors to each vertex of G. If a vertex is assigned an empty set, then the union of color sets of its neighbors must be C. This assignment is called the k-rainbow dominating function of G. The minimum sum of numbers of assigned colors over all vertices of G is called the k-rainbow domination number of G. In this paper, we give some algorithms to determine the k-rainbow dominating sets on Sierpiński graphs with k ∈ {2, 3, 4}, and we have the upper bounds of k-rainbow domination number on Sierpiński graph where k ∈ {2, 3, 4}.
Kuo, Wenling, and 郭玟伶. "An Upper Bound for the Circular Chromatic Number of Mycielski Graphs." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/10891479438170228481.
Full text大葉大學
資訊工程學系碩士在職專班
94
In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski ([15]) developed a graph transformation that transforms a graph G into a new graph (G), we now call the Mycielskian of G. For t
Lai, Hsing-Hsueh, and 賴星學. "An Upper Bound of the Routing Number of Circular Complete Graphs." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/35239183713088052739.
Full text淡江大學
中等學校教師在職進修數學教學碩士學位班
104
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In this paper, we study and prove the routing number of circular complete graph K_(p/q) is rt(K_(p/q) )≤2q, "for all" p≥3q,p,q∈Z^+.
JHANG, JIAN-FANG, and 張健芳. "A Study of Number Sense in the Upper Grades of Elementary School." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/btw3d7.
Full textShelestunova, Veronika. "Upper Bounds for the Number of Integral Points on Quadratic Curves and Surfaces." Thesis, 2010. http://hdl.handle.net/10012/5087.
Full textCheng, Chih-Ren, and 鄭至人. "An Upper Bound for the Number of Generators of an Ideal in ZCm." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/6a9nzp.
Full text國立中央大學
數學系
105
In 1966, P. M. Cohn introduced the concept of a generalized Euclidean ring, inspired by the property that any invertible matrix over a Euclidean ring can be row-reduced to the dentity matrix by elementary matrices. In 1984, Dennis, Magurn and Vaserstein proved that the integral group ring ZCm of finite cyclic group Cm is generalized Euclidean. It is well known that a Euclidean ring is quasi-Euclidean and a quasi-Euclidean ring is generalized Euclidean. In this thesis, we construct a finitely generated nonprincipal ideal of ZG for nontrivial abelian group G to show that ZG is neither Euclidean nor quasi-Euclidean. Moreover, we give an upper bound for the number of generators of an ideal in ZCm. The case m being a power of a prime is treated more seriously. In the final chapter, following the Wedderburn-Artin Theorem, we give a more accessible proof than Bass' to show that a semilocal ring has stable rank one, hence it is a generalized Euclidean ring.
Chien, I.-Sheng, and 錢奕升. "Using repeat-number to estimate the upper bound of IC-index on paths." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/05613695179027129524.
Full text國立東華大學
應用數學系
103
Let G be a graph and f : V (G) → N be a coloring on G. Define f(G)=∑_(x∈V(G))f(x).Suppose for all α∈{1,2,...,f(G)} there is a connected subgraph H of G, that ∑_(x∈V(H))f(x)=α , then f is said to be an IC-coloring of G.And the IC-index M(G) is defined as M(G) = max{f(G)|f is an IC-coloring of G}. Let us focus on the case that G = P_n, a path of length n. Previous results gives us the upper bound n(n+1)/2 -1 of M(P_n), which is a loose estimation. In this study,we introduce a new approach, exploiting the property of repeat- number, to make a tighter estimation of the upper bound of M(P_n),that M(Pn) <= n(n+1)/2 − 23 if n <= 14.
"On the Attainability of Upper Bounds for the Circular Chromatic Number of K4-Minor-Free Graphs." East Tennessee State University, 2008. http://etd-submit.etsu.edu/etd/theses/available/etd-0330108-142731/.
Full textAssmann, Denise. "On the spatio-temporal distribution of aerosol particles in the upper troposphere and lowermost stratosphere." 2018. https://ul.qucosa.de/id/qucosa%3A33973.
Full textSubmicrometer aerosol particles in the upper troposphere and lowermost stratosphere (UT/LMS) influence the Earth's radiation budget directly and, more important, indirectly, by acting as cloud condensation nuclei and by changing trace gas concentrations through heterogeneous chemical processes. Since 1997, regular in situ measurements of UT/LMS particles have been conducted by the Leibniz Institute for Tropospheric Research, Leipzig, Germany, using the world-wide unique IAGOS-CARIBIC observatory (www.iagos.org/iagos-caribic) onboard a passenger aircraft. In this thesis, UT/LMS aerosol particle number concentrations and the submicrometer aerosol particle size distribution as measured by three condensation particle counters (CPCs) and one Optical Particle Size Spectrometer (OPSS) are discussed. Before analyzing the measurement data from the UT/LMS region a throughout characterization of the IAGOS-CARIBIC OPSS with respect to the counting efficiency was carried out in the laboratory for the OPSS-relevant particle size range of 140 nm to 1040 nm diameter. After calibration with polystyrene latex (PSL) particles a theoretical response function, representative for the UT/LMS, was calculated with Mie theory to ensure a correct data analysis. The statistical analysis of the IAGOS-CARIBIC OPSS and CPC data gives a good overview of existing particle number concentrations in the UT/LMS and ensures a statistically sound data analysis. On this basis a detailed characterization of the spatio-temporal distribution of Aitken and accumulation mode particle number concentrations in the UT/LMS was carried out for the first time. This analysis includes global maps with median values, probability density functions for specific flight routes, and longitudinal distributions of the particle size distribution. Also a first comparison with the global climate model ECHAM-HAM was conducted. The analysis showed that the aerosol distributions are mainly influenced by large-scale circulation patterns which were, in gererel terms, well reflected by the global climate model. Moreover, seasonal vertical cross-sections for particle number concentrations, the potential temperature, and the equivalent latitude were generated. The results are interpreted with respect to aerosol microphysics and cross-tropopause transport using IAGOS-CARIBIC trace gases like ozone and water vapor. The influence of clouds in the troposphere and the different stratosphere-troposphere exchange processes are clearly visible. Furthermore, the influence of the major transport processes into the UT/LMS region on the aerosol particle number concentrations was investigated: the Brewer-Dobson circulation, warm conveyor belts, isentropic transport, and tropical deep convective cloud outflow. In the past this was done only for atmospheric trace gases, but now for the first time for aerosol particles. The findings presented in this study represent a comprehensive characterization of the Aitken and accumulation mode particle number concentration in the UT/LMS and the influence of stratospheric-tropospheric exchange processes on these particles. These findings may help to evaluate and improve predictions of particle number concentrations by climate models and finally the calculation of the Earth's radiation budget and its change over the years.
"On the (upper) line-distinguishing and (upper) harmonious chromatic numbers of a graph." Thesis, 2009. http://hdl.handle.net/10210/2359.
Full textIn this dissertation we study two types of colourings, namely line-distinguishing colourings and harmonious colourings. A line-distinguishing colouring of a graph G is a k-colouring of the vertices of G such that no two edges have the same colour. The line-distinguishing chromatic number G is defined as the smallest k such that G has a line-distinguishing k-colouring. A harmonious colouring of a graph G is a proper k-colouring of the vertices of G such that no two edges have the same colour, i.e. no two adjacent vertices can have the same colour. The harmonious chromatic number hG is defined as the smallest k such that G has a line-distinguishing k-colouring. In Chapter 0 we discuss some of the terminology and definitions used later on in our study. In Chapter 1 we introduce line-distinguishing colourings and consider the line-distinguishing chromatic number of certain familiar classes of graphs such as trees, paths, cycles and complete graphs. We also consider graphs with line-distinguishing chromatic number G equal to the usual chromatic number G, and we compare G with the chromatic index G of a graph. In Chapter 2 we mostly discuss minimal line-distinguishing (MLD) colourings. We consider minimal line-distinguishing colourings and graphs of diameter two as well as classes of regular MLD-colourable graphs. We also introduce the concept of distance regular graphs and discuss minimal line-distinguishing colourings in these graphs. In Chapter 3 we introduce a new parameter, namely the upper line-distinguishing chromatic number H G of a graph. We investigate H G for paths and cycles, and consider graphs with small upper line-distinguishing chromatic numbers. In Chapter 4 we consider the second type of colouring studied in this dissertation, namely harmonious colourings. We define the harmonious chromatic number hG and determine hG for certain classes of graphs such as paths, trees, cycles and complete graphs. In Chapter 5 we discuss upper and lower bound for hG. In Chapter 6 we discuss the upper harmonious chromatic number HG of a graph, and we determine HG for paths and cycles. We also consider graphs satisfying HG G 1. The purpose of this study is to compile a resource which will give a thorough and well-integrated background on line-distinguishing and harmonious colourings. It is also intended to lay the groundwork for further doctoral studies in the field of colourings.
Lin, Chin-Hua, and 林至華. "New Upper Bounds on Feedback Vertex Numbers in Butterflies." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/37342067790246998592.
Full text國立中正大學
資訊工程研究所
90
In this paper we give new upper bounds on feedback vertex numbers in butterflies and toroidal butterflies. The graphs considered are undirected graphs of bounded degree and widely used as inter- connection networks. We give algorithms to find approximating minimum feedback vertex sets. The new upper bounds are better than previous results.
Yao-Wei, Tsai, and 蔡耀瑋. "On The Upper Limits Of Subsequences On The Numbers Of Runs." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/06863218228453096325.
Full text國立中央大學
數學系
82
Neumann (cf.Feller(1950,p.210),或 Chow 和 Teicher (1988,p61))證 明一個關於連段數定理, 但是它並不一定被任何的子序列所滿足, Quall(1974)The law of the iterated logarithm on arbitrary sequences for stationary Gaussian processes and Browian motion. Ann.Probab. 5,724-739.提出 "Thinner Subsequences" 之觀念,經由 Chow, Teicher, Wei 和 Yu (1981) Iterated logarithm laws with random subsequences, Z. Wahr- scheinlichkeitstheorie verw. Geb. 57,235-251,的論文, 我們亦利用稀疏子序列來證明滿足Neumann 結果的 子序列成立之充要條件. Neumann (cf.Feller(1950,p.210),or Chow and Teicher (1988,p61)) proved that a theorem on Numbers Of Runs, but it not satisfied by any subsequences, by Qualls(1974) "The law of the iterated logarithm on arbitrary sequences for stationary Gaussian processes and Browian motion. Ann. Probab. 5,724-739" appending the concept about "Thinner Subsequences" and pattern after Chow, Teicher, Wei and Yu (1981) "Iterated logarithm laws with random subsequences, Z. Wahrscheinlichkeitstheorie verw. Geb. 57,235-251", we also use thinner subsequences to prove a theorem about Neumann's result that satisfies sufficient and necessary conditions.
Kobera, Marek. "Qualitative properties of radiation magnetohydrodynamics." Doctoral thesis, 2016. http://www.nusl.cz/ntk/nusl-352088.
Full text