- 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.
Search results
Showing 381 to 390 of 1694 (0.062 seconds)Spelling suggestions: "subject:"eomputer barograms"" "subject:"eomputer _programs""
| 381 |
Design of a retargetable compiler for digital signal processorsDe, Subrato Kumar 05 1900 (has links)
No description available.
|
| 382 |
Two-dimensional, compressible time-dependent nozzle flowSheppard, Richard Roy 08 1900 (has links)
No description available.
|
| 383 |
Computerized evaluations of the relative abilities of parametric methods to correlate and extrapolate long-time creep-rupture dataRaut, Pravin Kamalakar 05 1900 (has links)
No description available.
|
| 384 |
Testing Cobol programs by mutationHanks, Jeanne Marie 05 1900 (has links)
No description available.
|
| 385 |
Computer assisted communication of a systematic design method : an augmentation of capabilityBrown, Bruce Edward, Jr. 05 1900 (has links)
No description available.
|
| 386 |
Pile-structure interaction in GTSTRUDLFernandez, Carlos Javier 08 1900 (has links)
No description available.
|
| 387 |
A comparison and evaluation of five energy analysis micro-computer programs for architects : ASEAM, CALPAS3, CARRIER E20-II, ENERCAL6, and LOADCALStevens, Richard M. 05 1900 (has links)
No description available.
|
| 388 |
Analysis of non-paraboloidal reflector antennasPokuls, Ralph. January 1984 (has links)
No description available.
|
| 389 |
A computer simulation of fatigue crack initiation in engineering components /Nguyen, Hai Viet. January 1985 (has links)
No description available.
|
| 390 |
A computational approach to the cartographic dot distribution problemHickey, Mutahar January 1993 (has links)
In the field of cartography, there is occasionally a need to create a distribution of dots on a map. These dots should give an impression of the density of some countable object set. This type of map is called a "Dot Distribution Map".Up to the current time, if the dots are to represent reality at all, they have to be placed by hand by a cartographer using a digitizing tablet or other input device. This is due to the fact that a census of a region gives only a total, yet it is known that the densities vary within that region. A cartographer can look at all the data available about a region and then can make judgements about how the densities will change within the region. He then can place dots which represent his interpretation of reality.This thesis states that there exists an algorithm which would assign dots to a map based upon the common belief that the density will gradate smoothly from one region with one census value to another region with a different census value.The approach taken was to relate the Map regions to polygons and to then subdivide the polygons into triangles. These triangles would then be subdivided into six children recursively and the data stored in a hex-tree. This is the current level of development. the next steps will be:Generate a surface above the 2-D map based upon the known input data of counts for the various regions.From the centroid for each existing leaf on the Hex-Tree, find the corresponding Zi value from the surface information. From each of these leaves, recursively subdivide the triangle further until the number of dots indicated by the Zt. value can be placed on the map. / Department of Computer Science
|
Page generated in 0.0863 seconds