2018 QUARTER 02

A B C D E F G H I K L M N O P R S T U V W
GS-22 - Implications of distributed GIS&T
  • Describe the advantages and disadvantages to an organization in using GIS portal information from other organizations
  • Describe how inter-organization GIS portals may impact or influence issues related to social equity, privacy and data access
  • Discuss how distributed GIS&T may affect the nature of organizations and relationships among institutions
  • Suggest the possible societal and ethical implications of distributed GIS&T
KE-26 - Incorporating GIS&T into existing job classifications
  • Select two effective methods of overcoming resistance to change
  • Illustrate how methods for overcoming resistance to change can aid implementation of a GIS
  • Explain how resistance to change and the need to standardize operations when trying to incorporate GIS&T can promote inclusion into existing job classifications
PD-02 - Integer programming
  • Explain why integer programs are harder to solve than linear programs
  • Differentiate between a linear program and an integer program
DM-24 - Integrated models
  • Discuss the contributions of early attempts to integrate the concepts of space, time, and attribute in geographic information, such as Berry (1964) and Sinton (1978)
  • Determine whether phenomena or applications exist that are not adequately represented in an existing comprehensive model
  • Discuss the degree to which these models can be implemented using current technologies
  • Design data models for specific applications based on these comprehensive general models
  • Illustrate major integrated models of geographic information, such as Peuquet’s triad, Mennis’ pyramid, and Yuan’s three-domain
AM-74 - Interchange heuristics
  • Define alternatives to the Tietz and Bart heuristic
  • Outline the Tietz and Bart interchange heuristic
  • Describe the process whereby an element within a random solution is exchanged, and if it improves the solution, it is accepted, and if not, it is rejected and another element is tried until no improvement occurs in the objective function value
AM-75 - Interchange with probability
  • Explain how the process to break out local optima can be based on a probability function
  • Outline the TABU heuristic
AM-16 - Interpolation methods
  • Identify the spatial concepts that are assumed in different interpolation algorithms
  • Compare and contrast interpolation by inverse distance weighting, bi-cubic spline fitting, and kriging
  • Differentiate between trend surface analysis and deterministic spatial interpolation
  • Explain why different interpolation algorithms produce different results and suggest ways by which these can be evaluated in the context of a specific problem
  • Design an algorithm that interpolates irregular point elevation data onto a regular grid
  • Outline algorithms to produce repeatable contour-type lines from point datasets using proximity polygons, spatial averages, or inverse distance weighting
  • Implement a trend surface analysis using either the supplied function in a GIS or a regression function from any standard statistical package
  • Describe how surfaces can be interpolated using splines
  • Explain how the elevation values in a digital elevation model (DEM) are derived by interpolation from irregular arrays of spot elevations
  • Discuss the pitfalls of using secondary data that has been generated using interpolations (e.g., Level 1 USGS DEMs)
  • Estimate a value between two known values using linear interpolation (e.g., spot elevations, population between census years)
AM-17 - Intervisibility
  • Define “intervisibility”
  • Outline an algorithm to determine the viewshed (area visible) from specific locations on surfaces specified by DEMs
  • Perform siting analyses using specified visibility, slope, and other surface related constraints
  • Explain the sources and impact of errors that affect intervisibility analyses
AM-08 - Kernels and density estimation
  • Describe the relationships between kernels and classical spatial interaction approaches, such as surfaces of potential
  • Outline the likely effects on analysis results of variations in the kernel function used and the bandwidth adopted
  • Explain why and how density estimation transforms point data into a field representation
  • Explain why, in some cases, an adaptive bandwidth might be employed
  • Create density maps from point datasets using kernels and density estimation techniques using standard software
  • Differentiate between kernel density estimation and spatial interpolation
AM-37 - Knowledge discovery
  • Explain how spatial data mining techniques can be used for knowledge discovery
  • Explain how a Bayesian framework can incorporate expert knowledge in order to retrieve all relevant datasets given an initial user query
  • Explain how visual data exploration can be combined with data mining techniques as a means of discovering research hypotheses in large spatial datasets

Pages