GIST 8100 Final

Question

Which is NOT a type of location-allocation problem type?

Answer 1

Minimize Impedance

Answer 2

Optimize Cost

Answer 3

Maximize Coverage

Answer 4

Minimize Facilities

Answer 5

Exponential

Answer 6

None of the Above

Answer 7

Candidate facilities

Answer 8

Required facilities

Answer 9

Competitor facilities

Answer 10

Chosen facilities

Answer 11

Minimize Impedance

Answer 12

Maximize Coverage

Answer 13

Minimize Facilities

Answer 14

Maximize Market Share

Answer 15

Candidate Facilities

Answer 16

Chosen Facilities

Answer 17

Demand Points

Answer 18

Competitor Facilities

Answer 19

Assigns each demand point to its nearest chosen facility

Answer 20

Assigns the chosen facility as the required facility

Answer 21

Assigns the competitor facility as the chosen facility

Answer 22

Assigns the demand point class to the nearest competitor facility

Answer 23

Geary’s C

Answer 24

Anselin’s Local Moran’s I

Answer 25

all of the above

Answer 26

none of the above

Answer 27

proximity between cells

Answer 28

continuity between cells

Answer 29

number of cells

Answer 30

number of variables

Answer 31

a measure of how the cells in a raster a related to one another

Answer 32

a proximity matrix

Answer 33

a continuity matrix

Answer 34

all of the above

Answer 35

A positive spatial autocorrelation

Answer 36

A negative spatial autocorrelation

Answer 37

A random spatial autocorrelation

Answer 38

None of the above

Answer 39

It relies on too much hard math

Answer 40

It is not good for highly variable data

Answer 41

Not everyone plays chess and terms like rook, bishop, and queen are confusing

Answer 42

You need a super powerful computer to properly run the algorithm

Answer 43

Probability

Answer 44

Archaeology

Answer 45

Military Science

Answer 46

Urban Planning

Answer 47

Spelunking

Answer 48

Variations in the DEM

Answer 49

Atmospheric conditions

Answer 50

Perspective

Answer 51

Probability of visibility of a given day

Answer 52

Variations in the DEM

Answer 53

Atmospheric Conditions

Answer 54

Distances at which objects may be distinguished

Answer 55

Curvature of the Earth

Answer 56

Binary Viewshed Raster

Answer 57

Slope Raster

Answer 58

Euclidian Distance

Answer 59

Distance Decay Function

Answer 60

DEM quality/resolution

Answer 61

Long Processing Time

Answer 62

Assumes Perfect Visibility

Answer 63

Raster Size

Answer 64

security threat

Answer 65

privacy concerns and security concerns

Answer 66

sharing data allows users to feel connected to others

Answer 67

Disposable film camera

Answer 68

Wi-fi positioning systems

Answer 69

10 - 40 cm

Answer 70

Jpeg GPS Point Replacer

Answer 71

GeoTagged Photos To Points

Answer 72

GeoTagging Image To Points

Answer 73

Mobile station assisted

Answer 74

Mobile station based

Answer 75

Mobile station helper

Answer 76

80 (httpd)

Answer 77

5432 (postgresql)

Answer 78

pg_hba.conf

Answer 79

postgresql.conf

Answer 80

httpd.conf

Answer 81

workers.properties

Answer 82

Java Development Kit

Answer 83

Geospatial Engine

Answer 84

Geospatial Data Abstraction Library

Answer 85

PostgreSQL

Answer 86

All of the above

Answer 87

Integrate with existing map APIs

Answer 88

Equipped with proprietary spatial engine

Answer 89

Compatible with popular GIS formats

Answer 90

Capable of tile caching

Answer 91

Customizable layout templates

Answer 92

Undershoot

Answer 93

Instrument Inaccuracy

Answer 94

Changes over time

Answer 95

All of the above

Answer 96

GIS operation

Answer 97

None of the above

Answer 98

Taylor series approximation

Answer 99

Monte Carlo Method

Answer 100

Both a and b

Answer 101

None of the above

Answer 102

Randomly generated numbers

Answer 103

Approximation of the GIS operation

Answer 104

Numbers fall within 1 standard deviation from mean

Answer 105

All of the above

Answer 106

Identify various errors

Answer 107

Identify uncertainty sources

Answer 108

Identify source of error propagation

Answer 109

Both a and b

Answer 110

Both b and c

Answer 111

Collection

Answer 112

Classification

Answer 113

Digitization

Answer 114

Measurement

Answer 115

None of the above

Answer 116

Unmarked Set

Answer 117

Unvisited Set

Answer 118

Unnamed Set

Answer 119

Network Set

Answer 120

finds the most efficient path

Answer 121

algorithms can handle unexpected events

Answer 122

can't be used for prediction

Answer 123

can account for congestion

Answer 124

Create a buffer around a feature

Answer 125

calculate spatial stats

Answer 126

Generalize data

Answer 127

Find the shortest distance

Answer 128

Priority Queue

Answer 129

Uniform cost search

Answer 130

All of the Above

Answer 131

Every traveller takes other's choices into account

Answer 132

Making better use of the entire network

Answer 133

Not focussing on the shortest path only

Answer 134

All of the above

Answer 135

None of the above

Answer 136

provide a traveller with more than one route option

Answer 137

Evacuation planning

Answer 138

Find more scenic routes

Answer 139

All of the above

Answer 140

None of the above

Answer 141

None of the above

Answer 142

Statistical Analysis

Answer 143

Creating GUI’s

Answer 144

Plotting graphs and charts

Answer 145

Web mapping

Answer 146

readShapePoly()

Answer 147

All of the above

Answer 148

Der Spiegel

Answer 149

Washington Post

Answer 150

New York Times

Answer 151

None of the above

Answer 152

GlobalMapper

Answer 153

None of the above

Answer 154

Collection Conditions

Answer 155

Data processing and Handling

Answer 156

Number of bands

Answer 157

Complex structures

Answer 158

Reflective material types

Answer 159

Nearby Vegetation

Answer 160

Geometric correction

Answer 161

Radiometric correction

Answer 162

Topographic Normalization

Answer 163

All of the above

Answer 164

It can’t be used to detect change in multispectral datasets

Answer 165

It is difficult to determine threshold value

Answer 166

It produces poor results when applied to forestry applications

Answer 167

None of the above

Answer 168

Change Vector Analysis

Answer 169

Post-classification

Answer 170

Image differencing

Answer 171

Image multiplication

Answer 172

Feature classes

Answer 173

Raster datasets

Answer 174

All of the above

Answer 175

Change direction

Answer 176

Change rotation

Answer 177

Change ratio

Answer 178

Change integration

Answer 179

At least one band has an input pixel DN value of 0

Answer 180

No change in DN value in at least one band

Answer 181

No change in DN value over all bands

Answer 182

Fortunes Algorithm

Answer 183

Divide and Conquer

Answer 184

Construction Algorithm

Answer 185

Dijkstra’s Algorithm

Answer 186

To create a rainfall surface

Answer 187

To determine the nearest pub to BCIT

Answer 188

To determine paths of least resistance

Answer 189

All of the above

Answer 190

Fortunes Algorithm

Answer 191

Divide and Conquer

Answer 192

Construction Algorithm

Answer 193

Dijkstra’s Algorithm

Answer 194

a way of dividing space where objects in an area are more related to each other than the area that surrounds them

Answer 195

a type of analytic geometry, which uses coordinates

Answer 196

a type of synthetic geometry, which does not use coordinates

Answer 197

a way of dividing space where objects in that space are closer to the object it surrounds than any other object

Answer 198

Both A and B

Answer 199

Both C and D

Answer 200

a closed space

Answer 201

a open or closed space

Answer 202

a concave space

Answer 203

one dimensional space

Answer 204

have internal angles greater than 180 degrees

Answer 205

are an open space with angles less than 180 degrees

Answer 206

are entirely contained, defined by each of its edges

Answer 207

can only be strict convex polygons

Answer 208

Triangle Fans

Answer 209

Triangle Strips

Answer 210

Intersect 3D

Answer 211

Add Z information

Answer 212

Line Of Sight

Answer 213

Layer 3D To Feature Class

Answer 214

Multipatch is a 3D geometry data type

Answer 215

Retain Multipatch textures by storing in a Geodatabase

Answer 216

Multipatch is viewable in 3D on ArcMap

Answer 217

Rings are 3D polygons defined by a bounded area

Answer 218

Triangle strips

Answer 219

Triangle fans

Answer 220

Multipatch

Answer 221

Height values

Answer 222

Surface area

Answer 223

All of above

Answer 224

Space-Time Composite

Answer 225

Event-Based Spatiotemporal Model

Answer 226

None of the above

Answer 227

Near real time data is slightly less accurate

Answer 228

Near real time data has a delay before imported into a GIS

Answer 229

None of the above

Answer 230

Raster Planning

Answer 231

Spatial Analyst

Answer 232

Animation Tools

Answer 233

None of the Above

Answer 234

Space-Time Composite

Answer 235

Event-Based Spatiotemporal Mode

Answer 236

None of the above

Answer 237

Mandelbrot Set

Answer 238

Kalender Set

Answer 239

Koch Curve Set

Answer 240

Cantor Set

Answer 241

Assigns a midpoint between the corner points

Answer 242

Assigns the first corner point

Answer 243

Assigns a mean value for the mid points

Answer 244

Assigns a center value for the square

Answer 245

Assigns a midpoint between the corner points

Answer 246

Assigns the first corner point

Answer 247

Assigns a mean value for the mid points

Answer 248

Assigns a center value for the square

Answer 249

output raster name

Answer 250

number of topological dimensions

Answer 251

number of intermediate images to save

Answer 252

number of fractal dimensions

Answer 253

Spectral Synthesis Method

Answer 254

Diamond Square Algorithm

Answer 255

Hausdorff Method

Answer 256

Kargers Algorithm

Answer 257

an object looks like another object

Answer 258

an objects subset looks like the whole object

Answer 259

an object looks like a fractals subset

Answer 260

a fractals subset looks like the whole

	Erstellt von Sven Koberwitz vor mehr als 9 Jahre

Nächster

GIST 8100 Final

Beschreibung

Zusammenfassung der Ressource

Frage 1

Frage 2

Frage 3

Frage 4

Frage 5

Frage 6

Frage 7

Frage 8

Frage 9

Frage 10

Frage 11

Frage 12

Frage 13

Frage 14

Frage 15

Frage 16

Frage 17

Frage 18

Frage 19

Frage 20

Frage 21

Frage 22

Frage 23

Frage 24

Frage 25

Frage 26

Frage 27

Frage 28

Frage 29

Frage 30

Frage 31

Frage 32

Frage 33

Frage 34

Frage 35

Frage 36

Frage 37

Frage 38

Frage 39

Frage 40

Frage 41

Frage 42

Frage 43

Frage 44

Frage 45

Frage 46

Frage 47

Frage 48

Frage 49

Frage 50

Frage 51

Frage 52

Frage 53

Frage 54

Frage 55

Frage 56

Frage 57

Frage 58

Frage 59

Frage 60

Frage 61

Frage 62

Frage 63

Frage 64

Frage 65

Frage 66

Frage 67

Frage 68

Frage 69

Frage 70

Frage 71

Frage 72

Frage 73

Frage 74

Frage 75

Frage 76