• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 45
  • 20
  • 17
  • 7
  • 4
  • 4
  • 3
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 121
  • 19
  • 15
  • 10
  • 10
  • 9
  • 9
  • 8
  • 8
  • 8
  • 8
  • 8
  • 8
  • 7
  • 7
  • 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.
61

Overlap of Global Köppen-Geiger Climates, Biomes, and Soil Orders

Rohli, Robert V., Joyner, T. Andrew, Reynolds, Stephen J., Ballinger, Thomas J. 04 March 2015 (has links)
Climate types, biome types, and soil orders are commonly used among physical geographers in research and to describe natural environmental characteristics. However, little attempt has been made to quantify the percentage of global land surface that is covered by combinations of climate types, biomes, and soil orders. This research overlays a world map of 31 climate types produced based on the Köppen-Geiger criteria using gridded NCAR/NCEP reanalysis monthly mean surface air temperature and precipitation data from 1981 to 2010 with global maps of eight biomes adapted from World Wildlife Federation and 12 soil orders from United States Natural Resources Conservation Service. Areas covered by each of the 2976 combinations are then calculated. Results suggest that, as expected, a few climate/biome/soil combinations are most common, such as desert climate/desert biome/entisols, tundra climate/tundra biome/gelisols, and desert climate/desert biome/aridisols. The local nature of soil properties causes small enclaves of unexpected combinations of climate, biome, and soils, and the 10 most extensive climate/biome/soil combinations occupy only one-quarter of the global land surface. The strong correspondence between climate and biome types validates the Köppen-Geiger criteria for categorizing climates based on vegetation realms, even today, despite the general paucity of data available when the criteria were established.
62

Validation of Criteria Used to Predict Warfarin Dosing Decisions

Thomas, Nicole 13 May 2004 (has links) (PDF)
People at risk for blood clots are often treated with anticoagulants, warfarin is such an anticoagulant. The dose's effect is measured by comparing the time for blood to clot to a control time called an INR value. Previous anticoagulant studies have addressed agreement between fingerstick (POC) devices and the standard laboratory, however these studies rely on mathematical formulas as criteria for clinical evaluations, i.e. clinical evaluation vs. precision and bias. Fourteen such criteria were found in the literature. There exists little consistency among these criteria for assessing clinical agreement, furthermore whether these methods of assessing agreement are reasonable estimates of clinical decision-making is unknown and has yet to be validated. One previous study compared actual clinical agreement by having two physicians indicate a dosing decision based on patient history and INR values. This analysis attempts to justify previously used mathematical criteria for clinical agreement. Generalized additive models with smoothing spline estimates were calculated for each of the 14 criteria and compared to the smoothing spline estimate for the method using actual physician decisions (considered the "gold standard"). The area between the criteria method spline and the gold standard method spline served as the comparison, using bootstrapping for statistical inference. Although some of the criteria methods performed better than others, none of them matched the gold standard. This stresses the need for clinical assessment of devices.
63

Two-Dimensional Convex Hull Algorithm Using the Iterative Orthant Scan / Tvådimensionell Convex Hull Algoritm Med Iterativ Orthant Scan

Freimanis, Davis, Hongisto, Jonas January 2017 (has links)
Finding the minimal convex polygon on a set of points in space is of great interest in computer graphics and data science. Furthermore, doing this efficiently is financially preferable. This thesis explores how a novel variant of bucketing, called the Iterative orthant scan, can be applied to this problem. An algorithm implementing the Iterative orthant scan was created and implemented in C++ and its real-time and asymptotic performance was compared to the industry standard algorithms along with the traditional textbook convex hull algorithm. The worst-case time complexity was shown to be a logarithmic term worse than the best teoretical algorithm. The real-time performance was 47.3% better than the traditional algorithm and 66.7% worse than the industry standard for a uniform square distribution. The real-time performance was 61.1% better than the traditional algorithm and 73.4% worse than the industry standard for a uniform triangular distribution. For a circular distribution, the algorithm performed 89.6% worse than the traditional algorithm and 98.7% worse than the industry standard algorithm. The asymptotic performance improved for some of the distributions studied. Parallelization of the algorithm led to an average performance improvement of 35.9% across the tested distributions. Although the created algorithm exhibited worse than the industry standard algorithm, the algorithm performed better than the traditional algorithm in most cases and shows promise for parallelization. / Att hitta den minsta konvexa polygonen för en mängds punkter är av intresse i ett flertal områden inom datateknik. Att hitta denna polygon effektivt är av ekonomiskt intresse. Denna rapport utforskar hur metoden Iterative orthant scan kan appliceras på problemet att hitta detta konvexa hölje. En algoritm implementerades i C++ som utnyttjar denna metod och dess prestanda jämfördes i realtid såsom asymptotiskt mot den traditionella och den mest använda algoritmen. Den nya algoritmens asymptotiska värsta fall visades vara ett logaritmiskt gradtal sämre än den bästa teoretiska algoritmen. Realtidsprestandan av den nya algoritmen var 47,3% bättre än den traditionella algoritmen och 66,7% sämre än den mest använda algoritmen för fyrkantsdistribution av punkterna. Realtidsprestandan av den nya algoritmen var 61,1% bättre än den traditionella algoritmen och 73,4% sämre än den mest använda algoritmen för triangulär distribution av punkterna. För cirkulär distribution var vår algoritm 89,6% sämre än den traditionella algoritmen och 98,7% sämre än den vanligaste algoritmen. Parallellisering av vår algoritm ledde i medel till en förbättring på 35,9%. För vissa typer av fördelningar blev denna prestanda bättre. Även då algoritmen hade sämre prestanda än den vanligaste algoritmen, så är det ett lovande steg att prestandan var bättre än den traditionella algoritmen.
64

An Optimization Strategy for Hexapod Gait Transition

Darbha, Naga Harika January 2017 (has links)
No description available.
65

ALGORITHM FOR STAIRCASE MACHINING OF NON-CONVEX POLYGONAL POCKETS WITH ISLANDS

RAMASWAMI, HEMANT January 2002 (has links)
No description available.
66

Probability modeling of industrial situations using transform techniques

Hu, Xiaohong January 1995 (has links)
No description available.
67

Izoperimetrické nerovnosti / Isoperimetric inequalities

Bártlová, Tereza January 2012 (has links)
In the present work we study isoperimetric problem and its description by isoperimetric inequality. The legend of Dido, which inspired formulation of the isoperimetric problem, is described in the first chapter. The following chapters are devoted to elementary proofs of isoperimetric inequality for polygons as well as for curves. The last chapter focuses on related problem than isoperimetric that is isodiametric problem. This is described Reuleaux polygon that constitutes a means for proof of isodiametric inequality.
68

Simulace správy informační bezpečnosti ve fakultním prostředí / Simulating information security management within a university environment

Hložanka, Filip January 2020 (has links)
This diploma thesis is concerned with simulating information security management within a university environment. It is divided into three parts. The theoretical part focuses on describing the assets which could be part of a faculty network, attacks that could target it, security processes which could protect it and users that are active within it. The analytical part then applies these segments on a real faculty network. Based on this analysis, a set of specific assets, attacks, security processes and other tasks is created in order to simulate a simplified version of the analyzed network using a sophisticated cybernetic polygon. The security of the network is then assessed after several iterations of the simulations. Its parameters are adjusted in the effort to increase its security and the module is tested on an academic employee in order to assess its effectiveness. The conclusion evaluates the possibilities of increasing the security of the simulated network as well as the usability of the cybernetic polygon in practice.
69

Možnosti ERT a GPR pro analýzu polygonálních kryogenních struktur / Using ERT and GPR in polygonal patterned ground analysis

Široký, Jakub January 2014 (has links)
Polygonal cryogenic structures cannot be investigated with conventional methods as they could be harmed during measurement. A real3D GPR and ERT non-destructive surveys were used to examine and prove applicability for topsoil covered ice-wedge pseudomorphs and coarse-grained sorted polygons (patterned ground). A list of processing tools and algorithm suitable for such environments was created and tested. The benefits of 3D measurements are illustrated on horizontal slices and pseudo3D visualisation of 3D Cube. Basic morphometry characteristics of both forms were collected. Abilities of geophysical imaging for advanced shape characterisations are discussed, too. The low-frequency measurements gave better results at both sites. Pseudomorphs, 2 wide and up to 6,5 long, were found penetrating depth bigger than 3,5 . Sorted polygons, 2,5 wide in diameter, were depicted locked by stony ring of width around 1 . Sorting depth extends up to 0,54 depth for sure, perhaps more.
70

Elastic buckling behavior of plate and tubular structures

Chattopadhyay, Arka Prabha January 1900 (has links)
Master of Science / Department of Mechanical and Nuclear Engineering / Kevin B. Lease / Xiao J. Xin / The study of buckling behavior of tubular and cellular structures has been an intriguing area of research in the field of solid mechanics. Unlike the global Euler buckling of slender structures under compressive loads, tubular and cellular structures deform with their walls buckling as individual supported plates. The aspect ratio and the dimensional characteristics of the tube define the buckling behavior of any tube structure. In this thesis, a thorough study on the buckling of polygon tubular structures with different cross sections is discussed. In the first study, the theoretical buckling formulation of a square tube using the energy method is reviewed from existing solutions in literature. The elastic critical load of a square tube derived from the theoretical solution is then compared with results of finite element elastic buckling simulations. The formation of lobes along the height of the walls at different aspect ratios of the tube is investigated and compared to theory. Also, the buckling behavior of multi-wall structures is studied and the relationship between these structures and a rectangular simply supported plate is established. A brief study on the buckling behavior of rhombic tubes is also performed. The results of the simulation match closely with the theoretical predictions. The study is then extended to quadrilateral tubes with cross-sections in the shape of square, rectangle, rhombus and parallelogram. The theory of buckling of these tubes is explicitly defined using classical plate mechanics based on the previous works presented in literature. Also, the possibility of global Euler buckling in the tubular structures after a certain critical height is discussed. The prediction from the theory is validated using extensive finite element elastic buckling simulations and experimental tests on square and rhombic tube specimens. The results of the simulations and experiments are observed to be consistent with the theory. Using the formulation of plate buckling under different boundary conditions, the buckling behavior of triangular tubes is also determined. A theoretical formulation for calculating the critical load of triangular tubes is derived. The theoretical critical loads for a range of aspect ratios are compared with corresponding finite element simulation results. The comparisons reveal high degree of similarity of the theoretical predictions with the simulations.

Page generated in 0.035 seconds