Relevant bibliographies by topics / COVRIN / Dissertations / Theses
To see the other types of publications on this topic, follow the link: COVRIN.

Dissertations / Theses on the topic 'COVRIN'

Author: Grafiati
Published: 5 June 2025
Last updated: 2 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'COVRIN.'

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

Covino, Timothy Patrick. "Stream-groundwater interactions in a mountain to valley transition: impacts on watershed hydrologic response and stream water chemistry." Thesis, Montana State University, 2005. http://etd.lib.montana.edu/etd/2005/covino/CovinoT1205.pdf.

Full text
Abstract:
As mountain headwater catchments increase in size to the meso-scale, they incorporate new landscape elements including mountain-valley transition zones. Mountain-valley transition zones form part of the mountain front, influence groundwater (GW)-stream interactions, and impact hydrologic response and stream water composition. Mountain front recharge (MFR) in mountain-valley transition zones and subsequent GW discharge to streams in the valley bottom are important hydrological processes. These GW-stream interactions are dynamic in both space and time, playing a key role in regulating the amount
APA, Harvard, Vancouver, ISO, and other styles
2

Covino, Timothy Patrick. "The role of stream network nutrient uptake kinetics and groundwater exchange in modifying the timing, magnitude, and form of watershed export." Diss., Montana State University, 2012. http://etd.lib.montana.edu/etd/2012/covino/CovinoT0512.pdf.

Full text
Abstract:
In this PhD dissertation research we sought to elucidate stream network biological and physical influences on hydrological and biogeochemical signatures observed along stream networks and at watershed outlets. Our research indicates that stream nutrient uptake and groundwater exchange processes can modify inputs from terrestrial sources and influence the timing and signature of watershed fluxes. We determined that stream nutrient uptake followed Michaelis-Menten kinetics across a broad range of systems and that land use / land cover change can alter stream nutrient uptake magnitudes. Additiona
APA, Harvard, Vancouver, ISO, and other styles
3

Funk, Amanda J. "Covering Faces." Ohio University / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1244227237.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Qiu, Feng. "Probabilistic covering problems." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/47567.

Full text
Abstract:
This dissertation studies optimization problems that involve probabilistic covering constraints. A probabilistic constraint evaluates and requires that the probability that a set of constraints involving random coefficients with known distributions hold satisfy a minimum requirement. A covering constraint involves a linear inequality on non-negative variables with a greater or equal to sign and non-negative coefficients. A variety of applications, such as set cover problems, node/edge cover problems, crew scheduling, production planning, facility location, and machine learning, in uncertain se
APA, Harvard, Vancouver, ISO, and other styles
5

Montecalvo, Federico. "General covering designs." Thesis, Queen Mary, University of London, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.610945.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Rogers, Donald Wayne III. "On Covering: Queerness." Thesis, Virginia Tech, 2020. http://hdl.handle.net/10919/99909.

Full text
Abstract:
The literature on the ethics of presenting as queer has been largely confined to a commonly acknowledged phenomenon called "passing," or fully concealing one's membership to a marginalized group. Often employed as a survival strategy, many are sympathetic to the idea that one should be able to pass if need be. With that said, many philosophers argue that it is inextricably tied to oppression in the sense that acts of passing are acts complicit with one's own oppression. Because of the usually drastic alteration to one's appearance or behavior passing encompasses, along with its connection to o
APA, Harvard, Vancouver, ISO, and other styles
7

Raaphorst, Sebastian. "Variable Strength Covering Arrays." Thèse, Université d'Ottawa / University of Ottawa, 2013. http://hdl.handle.net/10393/23684.

Full text
Abstract:
Recently, covering arrays have been the subject of considerable research attention as they hold both theoretical interest and practical importance due to their applications to testing. In this thesis, we perform the first comprehensive study of a generalization of covering arrays called variable strength covering arrays, where we dictate the interactions to be covered in the array by modeling them as facets of an abstract simplicial complex. We outline the necessary background in the theory of hypergraphs, combinatorial testing, and design theory that is relevant to the study of variable stre
APA, Harvard, Vancouver, ISO, and other styles
8

Harris, Adam. "Categoricity and covering spaces." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:2995ac5e-b535-4d18-9d6a-4f9455659f55.

Full text
Abstract:
This thesis develops some of the basic model theory of covers of algebraic curves. In particular, an equivalence between the good model-theoretic behaviour of the modular j-function, and the openness of certain Galois representations in the Tate-modules of abelian varieties is described.
APA, Harvard, Vancouver, ISO, and other styles
9

Sripadham, Shankar B. "Semantic Decomposition By Covering." Thesis, Virginia Tech, 2000. http://hdl.handle.net/10919/34335.

Full text
Abstract:
This thesis describes the implementation of a covering algorithm for semantic decomposition of sentences of technical patents. This research complements the ASPIN project that has a long term goal of providing an automated system for digital system synthesis from patents. In order to develop a prototype of the system explained in a patent, a natural language processor (sentence-interpreter) is required. These systems typically attempt to interpret a sentence by syntactic analysis (parsing) followed by semantic analysis. Quite often, the technical narrative contains grammatical errors, incompl
APA, Harvard, Vancouver, ISO, and other styles
10

Bezdek, Andras. "Packing and covering problems /." The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487266691095136.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Burroughs, Lynn Jennifer. "Approximation algorithms for covering problems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ31334.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Bryant, Roy Dale. "Covering the de Bruijn graph." Thesis, Monterey, California. Naval Postgraduate School, 1986. http://hdl.handle.net/10945/21751.

Full text
Abstract:
Random-like sequences of 0's and l's are generated efficiently by binary shift registers. The output of n-stage shift registers viewed as a sequence of binary n-tuples also give rise to a special graph called the de Bruijn graph B . The de Bruijn graph is a directed graph with 2n nodes. Each node has 2 arcs entering it and 2 arcs going out of it. Thus, there are a total of 2n+1 arcs in Bn. In this thesis, we define a cover of the de Bruijn graph, different from the usual graph theoretic cover. A cover S of the de Bruijn graph is defined as an independent subset of the nodes of Bn that satisfy
APA, Harvard, Vancouver, ISO, and other styles
13

MENDES, CARLOS RAONI DE ALENCAR. "COVERING CODES: BOUNDS AND HEURISTICS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2009. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=15365@1.

Full text
Abstract:
COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>Compreensão de dados, codificação digital da fala, telecomunicações via celular, correção de erros de transmissão, são algumas das aplicações práticas do estudo dos códigos de cobertura, um importante ramo da área da matemática denominada teoria dos códigos. Neste trabalho são abordados dois problemas de códigos de cobertura: o problema clássico de códigos de cobertura e o recente problema denominado de códigos curtos de cobertura. Apresenta-se uma aplicação da metaeurística Busca Tabu Reativa, uma importante variação da Busca Tab
APA, Harvard, Vancouver, ISO, and other styles
14

Cai, Yuanqing. "Theta representations on covering groups." Thesis, Boston College, 2017. http://hdl.handle.net/2345/bc-ir:107492.

Full text
Abstract:
Thesis advisor: Solomon Friedberg<br>Kazhdan and Patterson constructed generalized theta representations on covers of general linear groups as multi-residues of the Borel Eisenstein series. For the double covers, these representations and their (degenerate-type) unique models were used by Bump and Ginzburg in the Rankin-Selberg constructions of the symmetric square L-functions for GL(r). In this thesis, we study two other types of models that the theta representations may support. We first discuss semi-Whittaker models, which generalize the models used in the work of Bump and Ginzburg. Secondl
APA, Harvard, Vancouver, ISO, and other styles
15

Koufogiannakis, Christos. "Approximation algorithms for covering problems." Diss., [Riverside, Calif.] : University of California, Riverside, 2009. http://proquest.umi.com/pqdweb?index=0&did=1957320821&SrchMode=2&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1268338860&clientId=48051.

Full text
Abstract:
Thesis (Ph. D.)--University of California, Riverside, 2009.<br>Includes abstract. Title from first page of PDF file (viewed March 11, 2010). Available via ProQuest Digital Dissertations. Includes bibliographical references (p. 70-77). Also issued in print.
APA, Harvard, Vancouver, ISO, and other styles
16

Bliss, Adam. "Covering Numbers of the Cubes." Scholarship @ Claremont, 2003. https://scholarship.claremont.edu/hmc_theses/141.

Full text
Abstract:
How many triangles does it take to make a square? The answer is simple: two. This problem has a direct analogue in dimensions three and higher, but the answers are much harder to find. We provide new lower bounds in dimensions 4 through 13, an asymptotic lower bound which is inferior to the best known bound in high dimensions, and some new ideas which produce good upper bounds in both low and high dimensions.
APA, Harvard, Vancouver, ISO, and other styles
17

Rojas, Ledesma Javiel. "Matching and covering with boxes." Universidad de Chile, 2018. http://repositorio.uchile.cl/handle/2250/168394.

Full text
Abstract:
Doctor en Ciencias, Mención Computación<br>El estudio de las interacciones entre cajas multi-dimensionales (es decir, hiperrectángulos d-dimensionales alineados a los ejes) ha encontrado aplicaciones en distintas áreas, incluyendo geometría computacional, bases de datos, teoría de grafos y redes. Esta tesis considera varias preguntas abiertas sobre este tema, enfocándose en tres materias fundamentales: el cálculo de emparejamientos de un conjunto de puntos con cajas, la detección de redundancias en la región cubierta por un conjunto de cajas, y el cálculo de distintas medidas de dicha región.
APA, Harvard, Vancouver, ISO, and other styles
18

Roy, Choudhury Anamitra. "Covering and packing with intervals." Thesis, IIT Delhi, 2016. http://localhost:8080/iit/handle/2074/7086.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Fors, Rasmus, and Johan Israelsson. "Socioekonomi vs. covid-19 : Sambandet mellan socioekonomiskstatus och covid-19." Thesis, Gymnastik- och idrottshögskolan, GIH, Institutionen för fysisk aktivitet och hälsa, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:gih:diva-6660.

Full text
Abstract:
Syfte. Syftet med denna studie var att undersöka om det finns ett samband mellan en individs socioekonomiska status och sannolikhet att insjukna i covid-19 hos seniorer som har deltagit i GIHs hälsoprojekt under åren 2017-2020.Metod. En retrospektiv longitudinell kohortstudie utfördes för att studera om risken att få covid-19 hängde samman med de socioekonomiska faktorerna utbildningsnivå och inkomst. Data från GIHs hälsoprojekt från upp till 4 år tillbaka har använts som baslinje. Data på utfallsmåttet, självrapporterad covid-19 infektion, samlades in vid en uppföljningsunder
APA, Harvard, Vancouver, ISO, and other styles
20

Sun, Peng, and Robert M. Freund. "Computation of Minimum Volume Covering Ellipsoids." Massachusetts Institute of Technology, Operations Research Center, 2002. http://hdl.handle.net/1721.1/5090.

Full text
Abstract:
We present a practical algorithm for computing the minimum volume n-dimensional ellipsoid that must contain m given points al,...,am C Rn . This convex constrained problem arises in a variety of applied computational settings, particularly in data mining and robust statistics. Its structure makes it particularly amenable to solution by interior-point methods, and it has been the subject of much theoretical complexity analysis. Here we focus on computation. We present a combined interior-point and active-set method for solving this problem. Our computational results demonstrate that our method
APA, Harvard, Vancouver, ISO, and other styles
21

Chen, Zhibin, and 陳智斌. "On various packing and covering problems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B43085520.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Kamath, Gautam (Gautam Chetan). "On Learning and Covering Structured Distributions." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/92966.

Full text
Abstract:
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 91-95).<br>We explore a number of problems related to learning and covering structured distributions: Hypothesis Selection: We provide an improved and generalized algorithm for selecting a good candidate distribution from among
APA, Harvard, Vancouver, ISO, and other styles
23

Rodgers, David Mark. "Covering and generating numbers for groups." Thesis, University of Cambridge, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.620236.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Rosén, Emil. "Random covering times, a simulation study." Thesis, Uppsala universitet, Analys och sannolikhetsteori, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-269338.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Hallsjö, Sven-Patrik. "Covering the sphere with noncontextuality inequalities." Thesis, Linköpings universitet, Matematik och tillämpad matematik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-103663.

Full text
Abstract:
In this Bachelor’s thesis the following question is answered: Does the inequality posed in the article Klyachko et al [2008] cover the real part of the Bloch surface of a 3D quantum system when used as in Kochen and Specker [1967]? The Klyachko inequality relies on using five measurements to show contextuality of a subset of states on the real part of the Bloch surface. These can now be used in several configurations as present in the Kochen-Specker contextuality proof, by simply rotating the measurements. We show here that these new inequalities will have subsets of violation that eventually co
APA, Harvard, Vancouver, ISO, and other styles
26

Knudson, Kevin Patrick. "Separation and covering properties of frames." Thesis, Virginia Tech, 1991. http://hdl.handle.net/10919/41991.

Full text
Abstract:
<p>We present the concept of a frame and the related notion of spatiality. We consider the classical separation axioms in the frame setting and relate these to frame covering properties. Finally, a determination of which covering properties and separation axioms imply spatiality of a frame is made.</p><br>Master of Science
APA, Harvard, Vancouver, ISO, and other styles
27

Hua, Liyan. "Shortest Path - Capacitated Maximum Covering Problems." The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1275477591.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Chen, Zhibin. "On various packing and covering problems." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B43085520.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Bhowmick, Santanu. "Multi-covering problems and their variants." Diss., University of Iowa, 2017. https://ir.uiowa.edu/etd/5418.

Full text
Abstract:
In combinatorial optimization, covering problems are those problems where given a ground set and a family of subsets of the ground set, the objective is to find a minimum cost set of subsets whose union contains the ground set. We consider covering problems in the context of Computational Geometry, which is a subfield of Computer Science that deals with problems associated with geometric objects such as points, lines, disks, polygons etc. In particular, geometric covering is an active research area, where the ground set and the family of subsets are induced by geometric objects. Covering probl
APA, Harvard, Vancouver, ISO, and other styles
30

Aden, Libin, and Vidhata Dhokia. "Intensivvårdssjuksköterskorna och kampen mot COVID-19 : Intensivvårdssjuksköterskors upplevelser under COVID-19 pandemin." Thesis, Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-84002.

Full text
Abstract:
Bakgrund: I december 2019 upptäcktes ett virus i Wuhan, Kina. Mars år 2020 deklarerade WHO Coronavirus disease som en pandemi. Viruset orsakade ARDS och patienterna var i behov av mekanisk ventilation. Intensivvårdens kapacitet överskreds och verksamheten omstrukturerades för att bemöta det ökade patientflödet. Intensivvårdssjuksköterskans arbetsbelastning ökade och grundutbildade sjuksköterskor samt anestesisjuksköterskor omplacerades för att öka personaltätheten. Syfte: Att beskriva intensivvårdssjuksköterskors upplevelser av att arbeta på intensivvårdsavdelningar med patienter med diagnosti
APA, Harvard, Vancouver, ISO, and other styles
31

Kurnaz, Guzin. "Covering Sequences And T,k Bentness Criteria." Phd thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/12610504/index.pdf.

Full text
Abstract:
This dissertation deals with some crucial building blocks of cryptosystems in symmetric cryptography<br>namely the Boolean functions that produce a single-bit result for each possible value of the m-bit input vector, where m&gt<br>1. Objectives in this study are two-fold<br>the first objective is to develop relations between cryptographic properties of Boolean functions, and the second one is to form new concepts that associate coding theory with cryptology. For the first objective, we concentrate on the cryptographic properties of Boolean functions such as balancedness, correlation immunity,
APA, Harvard, Vancouver, ISO, and other styles
32

Umetani, Shunji, Mutsunori Yagiura, and 睦憲 柳浦. "RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM." 日本オペレーションズ・リサーチ学会, 2007. http://hdl.handle.net/2237/11724.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

坂内, 真三. "versal Galois covering について". 名古屋大学多元数理科学研究科, 2006. http://hdl.handle.net/2237/14142.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Maltais, Elizabeth Jane. "Graph-dependent Covering Arrays and LYM Inequalities." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/34434.

Full text
Abstract:
The problems we study in this thesis are all related to covering arrays. Covering arrays are combinatorial designs, widely used as templates for efficient interaction-testing suites. They have connections to many areas including extremal set theory, design theory, and graph theory. We define and study several generalizations of covering arrays, and we develop a method which produces an infinite family of LYM inequalities for graph-intersecting collections. A common theme throughout is the dependence of these problems on graphs. Our main contribution is an extremal method yielding
APA, Harvard, Vancouver, ISO, and other styles
35

Bauckmann, Jana, Ziawasch Abedjan, Ulf Leser, Heiko Müller, and Felix Naumann. "Covering or complete? : Discovering conditional inclusion dependencies." Universität Potsdam, 2012. http://opus.kobv.de/ubp/volltexte/2012/6208/.

Full text
Abstract:
Data dependencies, or integrity constraints, are used to improve the quality of a database schema, to optimize queries, and to ensure consistency in a database. In the last years conditional dependencies have been introduced to analyze and improve data quality. In short, a conditional dependency is a dependency with a limited scope defined by conditions over one or more attributes. Only the matching part of the instance must adhere to the dependency. In this paper we focus on conditional inclusion dependencies (CINDs). We generalize the definition of CINDs, distinguishing covering and complete
APA, Harvard, Vancouver, ISO, and other styles
36

Sbihi, Amine M. (Amine Mohammed). "Covering times for random walks on graphs." Thesis, McGill University, 1990. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=74538.

Full text
Abstract:
This thesis is a contribution to the covering times problems for random walks on graphs. By considering uniform random walks on finite connected graphs, the covering time is defined as the time (number of steps) taken by the random walk to visit every vertex. The motivating problem of this thesis is to find bounds for the expected covering times. We provide explicit bounds that are uniformly valid over all starting points and over large classes of graphs. In some cases the asymptotic distribution of the suitably normalized covering time is given as well.
APA, Harvard, Vancouver, ISO, and other styles
37

Lambie-Hanson, Christopher. "Covering Matrices, Squares, Scales, and Stationary Reflection." Research Showcase @ CMU, 2014. http://repository.cmu.edu/dissertations/368.

Full text
Abstract:
In this thesis, we present a number of results in set theory, particularly in the areas of forcing, large cardinals, and combinatorial set theory. Chapter 2 concerns covering matrices, combinatorial structures introduced by Viale in his proof that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. In the course of this proof and subsequent work with Sharon, Viale isolated two reflection principles, CP and S, which can hold of covering matrices. We investigate covering matrices for which CP and S fail and prove some results about the connections between such covering matri
APA, Harvard, Vancouver, ISO, and other styles
38

Aygün, Halis. "Study of covering properties in fuzzy topology." Thesis, City University London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361857.

Full text
APA, Harvard, Vancouver, ISO, and other styles
39

Sayer, Richard Michael Paul. "Covering and sheaf theories on module categories." Thesis, University of Bristol, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.285575.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Parrish, Edna L. "Generalized total and partial set covering problems." Thesis, Virginia Polytechnic Institute and State University, 1986. http://hdl.handle.net/10919/91140.

Full text
Abstract:
This thesis is concerned with the development of two generalized set covering models. The first model is formulated for the total set covering problem where cost is minimized subject to the constraint that each customer must be served by at least one facility. The second model is constructed for the partial set covering problem in which customer coverage is maximized subject to a budget constraint. The conventional formulations of both the total set covering and partial set covering problems are shown to be special cases of the two generalized models that arc developed. Appropriate solution st
APA, Harvard, Vancouver, ISO, and other styles
41

Codenotti, Giulia [Verfasser]. "Covering properties of lattice polytopes / Giulia Codenotti." Berlin : Freie Universität Berlin, 2020. http://d-nb.info/1205735569/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Hsu, Yu-Cheng 1966. "Efficient covering of general polygons by rectangles." Thesis, The University of Arizona, 1990. http://hdl.handle.net/10150/291443.

Full text
Abstract:
Covering a polygon by a set of rectangles has many applications in the VLSI CAD area. In this thesis, a new efficient algorithm to cover a polygon has been developed. It is not limited by the rectilinear restriction, but each inner angle of the polygon is at least 90 degrees. The algorithm has two phases. The first phase decomposes a non-rectilinear polygon P(n) into two parts. One part is a rectilinear polygon P(r), and the other part consists of the rest of P(n). This phase also generates a set of rectangles covering the non-rectilinear part. The time complexity of this phase is O(b∗n), wher
APA, Harvard, Vancouver, ISO, and other styles
43

Owens, Tyler. "A Covering System with Minimum Modulus 42." BYU ScholarsArchive, 2014. https://scholarsarchive.byu.edu/etd/4329.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Callor, Nickolas Brenten. "Pro-Covering Fibrations of the Hawaiian Earring." BYU ScholarsArchive, 2014. https://scholarsarchive.byu.edu/etd/4324.

Full text
Abstract:
Let H be the Hawaiian Earring, and let H denote its fundamental group. Assume (Bi) is an inverse system of bouquets of circles whose inverse limit is H. We give an explicit bijection between finite normal covering spaces of H and finite normal covering spaces of Bi. This bijection induces a correspondence between a certain family of inverse sequences of these covering spaces. The correspondence preserves the inverse limit of these sequences, thus offering two methods of constructing the same limit. Finally, we characterize all spaces that can be obtained in this fashion as a particular type of
APA, Harvard, Vancouver, ISO, and other styles
45

Cassels, Joshua, and Anant Godbole. "Covering Arrays for Equivalence Classes of Words." Digital Commons @ East Tennessee State University, 2018. https://dc.etsu.edu/honors/446.

Full text
Abstract:
Covering arrays for words of length t over a d letter alphabet are k × n arrays with entries from the alphabet so that for each choice of t columns, each of the dt t-letter words appears at least once among the rows of the selected columns. We study two schemes in which all words are not considered to be different. In the first case, words are equivalent if they induce the same partition of a t element set. In the second case, words of the same weighted sum are equivalent. In both cases we produce logarithmic upper bounds on the minimum size k = k(n) of a covering array. Most definitive result
APA, Harvard, Vancouver, ISO, and other styles
46

Bandyapadhyay, Sayan. "Digging deeper into clustering and covering problems." Diss., University of Iowa, 2019. https://ir.uiowa.edu/etd/6700.

Full text
Abstract:
Clustering problems often arise in the fields like data mining, machine learning and computational biology to group a collection of objects into similar groups with respect to a similarity measure. For example, clustering can be used to group genes with related expression patterns. Covering problems are another important class of problems, where the task is to select a subset of objects from a larger set, such that the objects in the subset "cover" (or contain) a given set of elements. Covering problems have found applications in various fields including wireless and sensor networks, VLSI, and
APA, Harvard, Vancouver, ISO, and other styles
47

Jaldeheim, Josephine, and Tomas Svensson. "Anestesisjuksköterskors upplevelser av att vårda patienter med COVID-19 på COVID-IVA : – en intervjustudie." Thesis, Linnéuniversitetet, Institutionen för hälso- och vårdvetenskap (HV), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-102451.

Full text
Abstract:
Bakgrund: COVID-19 är ett coronavirus som identifierades hos patienter med oförklarlig lunginflammation i Kina i december 2019. Sedan början av pandemin har operationsavdelningar i Sverige stängts till förmån för särskilda COVID-IVA. Anestesisjuksköterskor har flyttats från sina ordinarie arbetsplatser för att hjälpa till och stötta arbetet. Inga tidigare studier finns om anestesisjuksköterskors upplevelse av att vårda patienter med COVID-19. Syfte: Att undersöka anestesisjuksköterskors upplevelser av att vårda patienter med COVID-19 på COVID-IVA. Metod: Semistrukturerade intervjuer genomförde
APA, Harvard, Vancouver, ISO, and other styles
48

Nyström, Madeleine, and Marina Ekberg. "Med covid-19 i gymnasievalet : En kvalitativ studie om högstadieelevers gymnasieval under covid-19pandemin." Thesis, Malmö universitet, Malmö högskola, Institutionen för samhälle, kultur och identitet (SKI), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-42698.

Full text
Abstract:
Covid-19 drabbade hela världen på en mängd olika sätt. Undervisning blev på många skolor digital och gymnasiemässor ställdes in. Gymnasievalet är något som redan innan covid-19 framkallade stress och oro hos elever. Valmöjligheterna inför gymnasiet är många och tidigare forskning visar att vikten av vägledning för att kunna göra ett väl underbyggt val är stor. Syftet med denna studie är att undersöka om covid-19 har påverkat niondeklassarna på en högstadieskola i södra Sveriges gymnasieval. Vi ville även undersöka vad som har influerat elevernas gymnasieval för att
APA, Harvard, Vancouver, ISO, and other styles
49

Ковтун, А. І. "Застосування плазмаферезу при COVID-19". Thesis, БДМУ, 2022. http://dspace.bsmu.edu.ua:8080/xmlui/handle/123456789/19830.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Фисина, Костянтин Анатолійович, and Kostiantyn Anatoliyovich Fysyna. "COVID-19 air transportation strains." Thesis, National Aviation University, 2021. https://er.nau.edu.ua/handle/NAU/50777.

Full text
Abstract:
1. Abate, Megersa, Panayotis Christidis and Alloysius Joko Purwanto (2020), “Government support to airlines in the aftermath of the COVID-19 pandemic”, Journal of Air Transport Management 89:101931, URL: https://doi.org/10.1016/j.jairtraman.2020.101931 2. IEA (2020), “Changes in transport behaviour during the Covid-19 crisis”, International Energy Agency, Paris, URL: https://www.iea.org/articles/changes-in-transport behaviour-during-the-covid-19-crisis 3. International Transport Forum (2020), “Restoring air connectivity under policies to mitigate climate change”, COVID-19 Transport Brief
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'COVRIN' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography