2018 QUARTER 03

A B C D E F G H I K L M N O P R S T U V W
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
AM-29 - Kriging methods
  • Describe the relationship between the semi-variogram and kriging
  • Explain why it is important to have a good model of the semi-variogram in kriging
  • Explain the concept of the kriging variance, and describe some of its shortcomings
  • Explain how block-kriging and its variants can be used to combine data sets with different spatial resolution (support)
  • Compare and contrast block-kriging with areal interpolation using proportional area weighting and dasymetric mapping
  • Outline the basic kriging equations in their matrix formulation
  • Conduct a spatial interpolation process using kriging from data description to final error map
  • Explain why kriging is more suitable as an interpolation method in some applications than others
KE-09 - Labor and management
  • Identify the positions necessary to design and implement a GIS
  • Discuss the advantages and disadvantages of outsourcing elements of the implementation of a geospatial system, such as data entry
  • Evaluate the labor needed in past cases to build a new geospatial enterprise
  • Create a budget of expected labor costs, including salaries, benefits, training, and other expenses
DC-02 - Land records
  • Distinguish between GIS, LIS, and CAD/CAM in the context of land records management
  • Evaluate the difference in accuracy requirements for deeds systems versus registration systems
  • Exemplify and compare deed descriptions in terms of how accurately they convey the geometry of a parcel
  • Distinguish between topological fidelity and geometric accuracy in the context of a plat map
FC-32 - Learning from experience
  • Explain how knowledge of the history of the development of enterprise GIS can aid in an implementation process
  • Evaluate case studies of past GISs to identify factors leading to success and failure
  • Discuss the evolution of isolated GIS projects to enterprise GIS
GS-23 - Legal mechanisms for sharing geospatial information
  • Describe contracts, licenses, and other mechanisms for sharing geospatial data
  • Outline the terms of a licensing agreement with a local engineering consulting firm that a manager of a county government GIS office would employ if charged to recoup revenue through sale and licensure of county data
GS-03 - Liability
  • Describe the nature of tort law generally and nuisance law specifically
  • Describe strategies for managing liability risk, including disclaimers and data quality standards
  • Describe cases of liability claims associated with misuse of geospatial information, erroneous information, and loss of proprietary interests
  • Differentiate among contract liability, tort liability, and statutory liability
PD-01 - Linear programming
  • Explain the role of constraint functions using the simplex method
  • Explain the role of objective functions in linear programming
  • Describe the structure of linear programs
  • Explain the role of constraint functions using the graphical method
  • Implement linear programs for spatial allocation problems

Pages