• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 205
  • 53
  • 33
  • 30
  • 15
  • 8
  • 7
  • 7
  • 6
  • 6
  • 3
  • 2
  • 2
  • 2
  • 1
  • Tagged with
  • 445
  • 83
  • 61
  • 51
  • 34
  • 34
  • 31
  • 30
  • 29
  • 28
  • 28
  • 27
  • 27
  • 27
  • 26
  • 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.
291

Model bezdrátové senzorové sítě realizovaný v nástroji J-Sim / Wireless Sensor Network Simulation Model in J-Sim Tool

Vrzal, Tomáš January 2010 (has links)
This thesis deals with the issue of wireless sensor networks and communication protocols. Is explained of what the network is composed, what standards are used and in what sectors are most often used. The main scope of work is to introduce with the localization algorithms using in WSN. Algorithms are clearly divided into groups according to the methods used. In work is describes the structure used simulation tools J-Sim, for creating a wireless sensor network. To create network will be then applied different localization algorithms, which must first be implemented in a simulator using Java code. All generated classes and the algorithms are detailed described in the work. Results from simulations are detailed and graphically displays for individual localization algorithms.
292

Zubní 3D skener / 3D dental scanner

Kotek, Lukáš January 2015 (has links)
The general aim of my master´s thesis is to study the actual principles of 3D scanning, the anatomy of human teeth, use of 3D scanning in dentistry and other medical fields. Another part of this thesis is about software and hardware design of 3D scanning system, which enable us to scan dental casts. This design is using webcam, projector and turntable. The principle of scanning is based on the activ triangulation. The output of 3D scanner is a horde of spots, which are used for reconstruction of a surface. The reconstructed surface is finally saved as .stl format.
293

Knihovna pro práci s tetraedrální sítí / Tetrahedral Mesh Processing Library

Hromádka, David January 2013 (has links)
Many architecure, medical and engineering applications need a spacial support for various numerical computations (i.e. FEM simulations). Tetrahedral meshes are one of perspective spatial representations for them. In this thesis, several possibilities of effective tetrahedral mesh representation for its generating and processing are described. A computer library for the mesh processing is proposed which can be characterized by memory  efficient imposition of the mesh while preserving the ability to apply topological and geometric algorithms effectively. The library is implemented in C++ language using templates. Time and space complexity of typical mesh operations is compared with CGAL library and according to measurements the proposed library has lower memory requirements than CGAL.
294

Ohodnocení okolí bodů v obraze / Parametrization of Image Point Neighborhood

Zamazal, Zdeněk January 2011 (has links)
This master thesis is focused on parametrization of image point neighborhood. Some methods for point localization and point descriptors are described and summarized. Gabor filter is described in detail. The practical part of thesis is chiefly concerned with particle filter tracking system. The weight of each particle is determined by the Gabor filter.
295

Interactive Glyph Placement for Tensor Fields: Tracking Lines in Higher Order Tensor Fields

Hlawitschka, Mario, Scheuermann, Gerik, Hamann, Bernd 04 February 2019 (has links)
Visualization of glyphs has a long history in medical imaging but gains much more power when the glyphs are properly placed to fill the screen. Glyph packing is often performed via an iterative approach to improve the location of glyphs. We present an alternative implementation of glyph packing based on a Delaunay triangulation to speed up the clustering process and reduce costs for neighborhood searches. Our approach does not require a re–computation of acceleration structures when a plane is moved through a volume, which can be done interactively. We provide two methods for initial placement of glyphs to improve the convergence of our algorithm for glyphs larger and glyphs smaller than the data set’s voxel size. The main contribution of this paper is a novel approach to glyph packing that supports simpler parameterization and can be used easily for highly efficient interactive data exploration, in contrast to previous methods.
296

Analýza obsahu webových diskuzních fór jako zdroj dat pro výzkum nových trendů v užívání psychoaktivních látek ve srovnání s daty získanými od jiných populací / Online discussion forums content analysis as a data source for research of new trends in psychoactive substance use in comparison with data from other populations

Drápalová, Eva January 2021 (has links)
Analýza obsahu webových diskuzních fór jako zdroj dat pro výzkum nových trendů v užívání psychoaktivních látek ve srovnání s daty získanými od jiných populací Mgr. Eva Drápalová ABSTRACT Background: One of the most significant new trends in substance abuse today is an unprecedented rate of new psychoactive substances (NPS) emergence on a global drug market. While collection of scientific data about the effects and risks of numerous NPS is a timely process, the substantial amount of information about the very same substances is being exchanged on drug discussion forums, creating a pool of data with a potential for research of the NPS trend. Aims: This dissertation aims to evaluate a potential of internet discussion forum content analysis methods by (i) describing and comparing the characteristics of discussion forum visitors to NPS users who do not visit such forums; and subsequently by comparing the internet forum content analysis results describing (ii) a prevalence of NPS use, (iii) effects and context of NPS use and (iv) discussed internet retailers selling NPS with data retrieved by other methods. Methods: Differences between two groups of internet survey respondents were analyzed using Pearson Chi-square and Student's t-test to address the first aim of this dissertation. Furthermore the results of both...
297

k-irreducible triangulations of 2-manifolds

Melzer, Sebastian 10 October 2019 (has links)
This thesis deals with k-irreducible triangulations of closed, compact 2-manifolds without boundary. A triangulation is k-irreducible, if all its closed cycles of length less than k are nullhomotopic and no edge can be contracted without losing this property. k-irreducibility is a generalization of the well-known concept of irreducibility, and can be regarded as a measure of how closely the triangulation approximates a smooth version of the underlying surface. Research follows three main questions: What are lower and upper bounds for the minimum and maximum size of a k-irreducible triangulation? What are the smallest and biggest explicitly constructible examples? Can one achieve complete classifications for specific 2-manifolds, and fixed k?
298

Grafovske metode u geometriji i geometrijske metode u grafovima / The graphs methods in geometry and the methods of geometry in graphs

Subotić Borivoj 12 February 2005 (has links)
<p>U prvoj glavi dat je prikaz osnovnih pojmova koji se koriste u tezi, sa naglaskom na osnovne pojmove teorije grafova. U drugoj glavi daju se grafovski dokazi nekih geometrijskih problema. Na primer, dajemo dokaz poznate teoreme Silvestra. iz Kombinatorne geometrije, koristeći grafove. Treće poglavlje sadrži neke geometrijske dokaze u grafovima. Na primer, poznatu Turanovu teoremu, Pikovu teoremu i drugo. U četvrtom poglavlju dajemo metodičku transformaciju prethodnih problema. Neki od problema razloženi su na delove koji se mogu prezentirati od osnovne &scaron;kole do poslediplomskih studija. Peto poglavlje sadrži komentare prethodnog, kao i preporuku UNESCO-a iz 1992. godine o obrazovanju učenika u novom milenijumu.</p> / <p>Chapter 1 contains a shoot review of the basic notions which are used in the thesis with emphasis on the basic notions of graph theory. In Chapter&nbsp; 2we present graph proofs of some geometrical problems. For example, we present some proofs of the well known theorem of Sylvester, from Combinatorial geometry, using graph methods. In Chapter 3 we present some proofs in graphs which use geometry. For example, famous Turan&rsquo;s theorem, Pick&rsquo;s theorem and some others. Chapter 4 contains methodology transformations i.e. we apply the results from the previous chapters to the situations in the clossroom. In Chapter 5 we have some comments of UNESCO, from 1992, on education of children.</p>
299

Coordinate Mark Out Using Intersecting Line Lasers

Carlsson, Jonas, Gallant, Jeremy January 2023 (has links)
In the entertainment industry, where temporary structures are erected in a new venue every day, floor markings play an important role during the set up. Today, mark out is commonly done using tape measures - a very tedious and time consuming process. This thesis explores the possibility to create a tool to assist in the mark out process, a mark out station. Two stations working in tandem would both compute their respective positions in the venue and accurately and precisely show the location of any wanted point, based on their coordinate locations. The mark out stations were built using consumer grade line lasers, stepper motors, common micro controllers and fused filament fabrication (FFF)-manufactured plastic components, as well as various other common hardware components. The software utilized already established triangulation algorithms and a custom control protocol to manage the mark out stations. A short range test on a test surface was performed with three different station placements. Placing the mark out stations in between three calibration points yielded better precision and accuracy in contrast to placing them on the edge of the surface. When placed on the edge, the calibration accuracy benefited from more calibration points, in contrast to placement in between calibration points. Next phase after successful short range testing is testing in a larger setting to conclude if this is a viable tool to assist in the mark out process. Further improvements in the calibration process and the mark out process can be made in future iterations to achieve better performance. / Inom eventbranchen, där tillfälliga strukturer reses på nya platser varje dag, spelar markeringar på golvet en viktig roll. Idag sker utmärkningen med hjälp av måttband - en väldig tidskrävande process.  Detta examnesarbete undersöker huruvida det går att utveckla ett verktyg som assisterar i denna utmärkningsprocess, en utmärkningsstation. De två stationerna som arbetar  tillsammans skulle både beräkna deras respektive positioner på spelplatsen samt noggrant och precist visa placeringen av en önskad punkt, baserad på dess koordinater.  Utmärkningsstationerna byggdes av konsumentlinjelasrar, stegmotorer, vanliga mikrokontrollers och FFF-tillverkade komponenter. Mjukvaran inkorporerar redan etablerade trianguleringsalgoritmer och ett egenskrivet kontrollprotokoll för att styra utmärkningsstationerna.  Ett test på mindre avstånd gjordes på en testyta med tre olika stationsplaceringar. Att placera stationerna mellan tre kalibreringspunkter gav bättre noggranhet och precision än när stationerna placerades på utkanten av ytan. När stationerna placerades på utkanten av ytan, ökade noggrannheten och precisionen av att lägga till ytterligare kalibreringspunkter, till skillnad från placeringen mellan kalibreringspunkterna.  Nästa fas, efter ett lyckat test på kort avstånd, är att testa på större avstånd för att undersöka om detta kan vara ett användbart vektyg inom utsättning. Ytterliggare förbättringar i kalibrerings- och utmärkningsprocessen kan göras i framtida iterationer för att uppnå en bättre prestanda.
300

Combining Node Embeddings From Multiple Contexts Using Multi Dimensional Scaling

Yandrapally, Aruna Harini 04 October 2021 (has links)
No description available.

Page generated in 0.0797 seconds