• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1275
  • 320
  • 207
  • 152
  • 104
  • 87
  • 40
  • 22
  • 16
  • 16
  • 14
  • 14
  • 14
  • 13
  • 13
  • Tagged with
  • 2723
  • 579
  • 315
  • 234
  • 231
  • 226
  • 219
  • 200
  • 182
  • 175
  • 166
  • 131
  • 130
  • 130
  • 128
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
401

Námitka započtení / Set-off Defence

Vaněk, Martin January 2021 (has links)
63 Set-off Defence Abstract The thesis deals with set-off from the point of view of procedural law and using the method of functional interpretation of law, strives to provide answers to questions that appear in the court proceedings in connection with its use. It builds on theorists who dealt with the issue of inducing an effect of set-off in the proceedings in the late 20th century, but also takes into account the findings of current academic community and presents the judicial conclusions reached by (not only Czech) courts. The thesis is divided into 4 chapters. The first chapter briefly deals with the substantive legislation of set-off (especially the requirements laid down for the receivables that are to be set-off, and cases where set-off is prohibited by law). A declaration of set-off as a substantive act may be decisive in assessing the admissibility of set-off in proceedings. The second chapter describes the origin of set-off in ancient Rome and the different concepts of set-off in current legal codifications, which is the result of inconsistent interpretation and reception of this institute by medieval scholars. This is reflected by Czech legal science in existence of civilian and procedural theory of offsetting. In the third chapter, the thesis deals with purely procedural aspects of set-off. The...
402

Explorando o infinito de Cantor e apresentando-o ao ensino médio /

Camargo, Bruno Aguiar Alves de January 2019 (has links)
Orientador: Marcelo Reicher Soares / Resumo: O objetivo desse trabalho é apresentar, de forma rigorosa, como a matemática aborda o conceito de infinito e propor uma sequência de atividades para que o professor possa explorar esse tema com seus alunos de forma inovadora e estimulante. Muito do que é compreendido acerca do infinito se deve às ideias desenvolvidas por Georg Cantor, que estabeleceu a teoria dos números cardinais transfinitos, gerando uma série de resultados surpreendentes, que serão apresentados ao longo dessa dissertação. Cantor descobriu que existem diversos tipos de infinito e definiu critérios para classificá-los e compará-los. Para compreender esta teoria, é fundamental recordar os conceitos básicos da teoria de conjuntos e funções. Além disso, serão apresentados formalmente os números naturais através dos axiomas de Peano, bem como suas operações e propriedades. A partir deste, será construído o conjunto dos números inteiros, racionais e reais. Dessa forma, será possível definir formalmente a noção de conjunto finito e infinito, bem como a noção de conjuntos enumeráveis, e não-enumeráveis, e estabelecer critérios para comparar a cardinalidade de tais conjuntos. O trabalho é finalizado com a apresentação de uma proposta didática voltada para os alunos de ensino médio, sustentado no relato de duas experiências de sua aplicação. O tema é abordado utilizando atividades diferenciadas e fundamentadas no cotidiano, visando com isto contribuir para que os alunos apresentem um maior interesse e uma participaçã... (Resumo completo, clicar acesso eletrônico abaixo) / Abstract: The aim of this work is to present in a rigorous way how mathematics approaches the concept of the in nite and to propose a sequence of activities so that the teacher can explore this theme with his students in an innovative and stimulating way. Much of what is understood about infinite is due to the ideas developed by Georg Cantor who established the theory of transfinite cardinal numbers generating a series of surprising results that will be presented throughout this dissertation. Cantor found that there are several types of infinite and defined criteria for classifying and comparing them. To understand this theory it is essential to remember the basic concepts of set and function theory. In addition natural numbers will be formally presented through Peano axioms as well as their operations and properties. From the natural numbers the sets of integers, rationals and reals will be constructed. Then it will be possible to formally de ne the notions of finite and infinite sets as well as the notions of countable and uncountable sets and establish criteria for comparing the cardinality of such sets. The work is concluded with the presentation of a didactic proposal aimed at high school students supported by the report of two experiences of its application. The theme is presented through difierent activities, based on daily life, aiming to contribute to the students to show more interest and participate more actively in the classes. / Mestre
403

Segmentace mikroskopických snímků pomocí level-set metod / Segmentace mikroskopických snímků pomocí level-set metod

Bílková, Zuzana January 2015 (has links)
Název práce: Segmentace mikroskopických snímků pomocí level-set metod Autor: Zuzana Bílková Katedra: Katedra numerické matematiky Vedoucí diplomové práce: RNDr. Václav Kučera, Ph.D., KNM, MFF UK Konzultant: RNDr. Jindřich Soukup, ÚTIA, AV ČR Abstrakt: Tato diplomová práce představuje novou metodu pro segmentaci snímků pořízených mikroskopem s fázovým konrastem. Cílem je oddělit buňky od pozadí. Algoritmus je založen na variační formulaci level set metod, tedy na minimalizaci funkcionálu popisujícího level set funkci. Funkcionál je minimalizován gradientním tokem popsaným evoluční parciální diferenciální rovnicí. Nejdůležitější nové myšlenky jsou inicializace pomocí prahování a nové členy ve funkcionálu, které zrychlují konvergenci a zpřesňují výsledky. Také jsme použili nové funkce napsané v jazyce C k počítání gradientu a Laplaceova operátoru. Tato implementace je třikrát rychlejší než standardní funkce v MATLABu. Dosáhli jsme lepších výsledků než algoritmy, se kterými jsme metodu porovnávali. Klíčová slova: Segmentace, level set metody, aktivní kontury Title: Segmentation of microscopic images using level set methods Author: Zuzana Bílková Department: Department of Numerical Mathematics Supervisor: RNDr....
404

Global Domination Stable Trees

Still, Elizabeth Marie, Haynes, Teresa W. 08 May 2013 (has links)
A set of vertices in a graph G is a global dominating set of G if it dominates both G and its complement G. The minimum cardinality of a global dominating set of G is the global domination number of G. We explore the effects of graph modifications (edge removal, vertex removal, and edge addition) on the global domination number. In particular, for each graph modification, we study the global domination stable trees, that is, the trees whose global domination number remains the same upon the modification. We characterize these stable trees having small global domination numbers.
405

Global Domination Stable Trees

Still, Elizabeth Marie, Haynes, Teresa W. 08 May 2013 (has links)
A set of vertices in a graph G is a global dominating set of G if it dominates both G and its complement G. The minimum cardinality of a global dominating set of G is the global domination number of G. We explore the effects of graph modifications (edge removal, vertex removal, and edge addition) on the global domination number. In particular, for each graph modification, we study the global domination stable trees, that is, the trees whose global domination number remains the same upon the modification. We characterize these stable trees having small global domination numbers.
406

Improved Pebbling Bounds

Chan, Melody, Godbole, Anant P. 06 June 2008 (has links)
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing one pebble on an adjacent vertex. A distribution of pebbles on a graph is called solvable if it is possible to place a pebble on any given vertex using a sequence of pebbling steps. The pebbling number of a graph, denoted f (G), is the minimal number of pebbles such that every configuration of f (G) pebbles on G is solvable. We derive several general upper bounds on the pebbling number, improving previous results.
407

Production of Restructured Squid and Scallops from Processing By-Products and Underutilized Species

Suklim, Kannapha 21 December 1998 (has links)
North Atlantic short-finned squid (Illex illececbrosus) is an underutilized species and calico scallops (Argopecten gibbys) do not achieved the same market value as Sea scallops due to their small size. North Atlantic short-finned squid have limited consumer acceptability due to their smaller, thinner, and more leathery texture than Atlantic long-finned squid (Loligo pealei). The market limitation of calico scallops is derived from their small size compared to other species of scallops available in the marketplace. Thus, restructuring or engineering food technology applied to these species to produce new products will result in more profit to the industry. Restructured squids were fabricated with heat-set binders according to the following combinations: starch, egg white albumin, fish sarcoplasmic protein, starch and egg white albumin, and starch and fish sarcoplasmic protein at various levels. Increasing the level of starch from 2 to 10% decrease the hardness, cohesiveness, and springiness of restructured squid. Two percent egg white albumin improved the hardness and cohesiveness, while 2% fish sarcoplasmic protein improved cohesiveness and springiness of the squid gel. The hardness, cohesiveness, and springiness of starch-based combinations decreased as a function of starch. Restructured scallops were prepared from cold-set binders: alginate and microbial transglutaminase at the 1% level with different setting times to yield the highest binding strength. At the setting temperature of 5° C, restructured scallops bound with alginate presented the greatest binding strength at 2 hr setting, while those bound with microbial transglutaminase required 24 hr to reach the maximum binding strength. Although alginate benefits the manufacturer with respect to the shorter setting time, the lower binding strength values may result in a decrease in consumer acceptability. / Master of Science
408

Numerical investigation of two-frequency forced Faraday waves / 2周波数加振のファラデー波の数値的研究

Takagi, Kentaro 23 March 2015 (has links)
京都大学 / 0048 / 新制・課程博士 / 博士(理学) / 甲第18781号 / 理博第4039号 / 新制||理||1581(附属図書館) / 31732 / 京都大学大学院理学研究科物理学・宇宙物理学専攻 / (主査)准教授 藤 定義, 教授 佐々 真一, 教授 早川 尚男 / 学位規則第4条第1項該当 / Doctor of Science / Kyoto University / DFAM
409

Locating and Total Dominating Sets in Trees.

Howard, Jamie Marie 01 May 2004 (has links) (PDF)
A set S of vertices in a graph G=(V,E) is a total dominating set of G if every vertex of V is adjacent to some vertex in S. In this thesis, we consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.
410

Skew Relative Hadamard Difference Set Groups

Haviland, Andrew 17 April 2023 (has links) (PDF)
We study finite groups $G$ having a nontrivial subgroup $H$ and $D \subset G \setminus H$ such that (i) the multiset $\{ xy^{-1}:x,y \in D\}$ has every element that is not in $H$ occur the same number of times (such a $D$ is called a {\it relative difference set}); (ii) $G=D\cup D^{(-1)} \cup H$; (iii) $D \cap D^{(-1)} =\emptyset$. We show that $|H|=2$, that $H$ has to be normal, and that $G$ is a group with a single involution. We also show that $G$ cannot be abelian. We give examples of such groups, including certain dicyclic groups, by using results of Schmidt and Ito. We describe an infinite family of dicyclic groups with these relative difference sets, and classify which groups of order up to $72$ contain them. We also define a relative difference set in dicyclic groups having additional symmetries, and completely classify when these exist in generalized quaternion groups. We make connections to Schur rings and prove additional results.

Page generated in 0.0454 seconds