2018 QUARTER 04

A B C D E F G H I K L M N O P R S T U V W
AM-42 - The Classic Transportation Problem

The classic transportation problem concerns minimizing the cost of transporting a single product from sources to destinations. It is a network-flow problem that arises in industrial logistics and is considered as a special case of linear programming. The total number of units produced at each source, the total number of units required at each destination and the cost to transport one unit from each source to each destination are the basic inputs. The objective is to minimize the total cost of transporting the units produced at sources to meet the demands at destinations. The problem solution includes three basic steps: 1) finding an initial basic feasible solution, 2) checking if the current solution is optimal (with the lowest costs), and 3) improving the current solution through iteration. Modeling and solving the classic transportation problem rely strongly on network models, least-cost path algorithms, and location-allocation analysis in the field of geographic information science (GIScience). Thus, it represents a key component in the network analytics and modeling area of GIS&T.

KE-29 - The geospatial community
  • Describe possible benefits to an organization by participating in a given society that is related to GIS&T
  • Discuss the value or effect of participation in societies, conferences, and informal communities to entities managing enterprise GIS
  • Identify conferences that are related to GIS&T
KE-30 - The geospatial industry
  • Assess the involvement of non-GIS companies (e.g., Microsoft, Google) in the geospatial industry
  • Describe three applications of geospatial technology for different workforce domains (e.g., first responders, forestry, water resource management, facilities management)
  • Explain why software products sold by U.S. companies may predominate in foreign markets, including Europe and Australia
  • Describe the U.S. geospatial industry including vendors, software, hardware and data
DM-09 - The hexagonal model
  • Illustrate the hexagonal model
  • Explain the limitations of the grid model compared to the hexagonal model
  • Exemplify the uses (past and potential) of the hexagonal model
GS-01 - The legal regime
  • Discuss ways in which the geospatial profession is regulated under the U.S. legal regime
  • Compare and contrast the relationship of the geospatial profession and the U.S. legal regime with similar relationships in other countries
DM-15 - The network model
  • Define the following terms pertaining to a network: Loops, multiple edges, the degree of a vertex, walk, trail, path, cycle, fundamental cycle
  • List definitions of networks that apply to specific applications or industries
  • Create an adjacency table from a sample network
  • Explain how a graph can be written as an adjacency matrix and how this can be used to calculate topological shortest paths in the graph
  • Create an incidence matrix from a sample network
  • Explain how a graph (network) may be directed or undirected
  • Demonstrate how attributes of networks can be used to represent cost, time, distance, or many other measures
  • Demonstrate how the star (or forward star) data structure, which is often employed when digitally storing network information, violates relational normal form, but allows for much faster search and retrieval in network databases
  • Discuss some of the difficulties of applying the standard process-pattern concept to lines and networks
  • Demonstrate how a network is a connected set of edges and vertices
FC-20 - The power of maps
  • Describe how maps such as topographic maps are produced within certain relations of power and knowledge
  • Discuss how the choices used in the design of a road map will influence the experience visitors may have of the area
  • Explain how legal issues impact the design and content of such special purpose maps as subdivision plans, nautical charts, and cadastral maps
  • Exemplify maps that illustrate the provocative, propagandistic, political, and persuasive nature of maps and geospatial data
  • Demonstrate how different methods of data classification for a single dataset can produce maps that will be interpreted very differently by the user
  • Deconstruct the silences (feature omissions) on a map of a personally well known area
  • Construct two maps about a conflict or war producing one supportive of each side’s viewpoint
KE-01 - The process of GIS&T design
  • Describe the major approaches to the design of geospatial systems
  • Analyze past cases to identify best practices of design and implementation
  • Compare and contrast the relative merits of the use-case driven and architecture-centric design processes
DM-07 - The Raster Data Model

The raster data model is a widely used method of storing geographic data. The model most commonly takes the form of a grid-like structure that holds values at regularly spaced intervals over the extent of the raster. Rasters are especially well suited for storing continuous data such as temperature and elevation values, but can hold discrete and categorical data such as land use as well.  The resolution of a raster is given in linear units (e.g., meters) or angular units (e.g., one arc second) and defines the extent along one side of the grid cell. High (or fine) resolution rasters have comparatively closer spacing and more grid cells than low (or coarse) resolution rasters, and require relatively more memory to store. Active research in the domain is oriented toward improving compression schemes and implementation for alternative cell shapes (such as hexagons), and better supporting multi-resolution raster storage and analysis functions.

DM-12 - The spaghetti model
  • Identify a widely-used example of the spaghetti model (e.g., AutoCAD DWF, ESRI shapefile)
  • Write a program to read and write a vector data file using a common published format
  • Explain the conditions under which the spaghetti model is useful
  • Explain how the spaghetti data model embodies an object-based view of the world
  • Describe how geometric primitives are implemented in the spaghetti model as independent objects without topology

Pages