Navigation e-course
A course, learner technology, applied in the field of e-learning, which can solve problems such as incorrect use of domain models, difficulties in course creation, and difficulty in use
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example
[0150] Visited(v): Vertex v has been visited;
[0151] Suggested(v): The vertex v is suggested;
[0152] CanNavigate(v): can navigate the vertex v; and
[0153] Done(v): Vertex v is completed.
[0154] If the vertex is within a learning unit (ie v.graph.type=lu), micropolicies are used to compute the predicate. The selected macro strategy is responsible for determining all other vertices.
[0155] Function used to calculate the navigation set (the displayed vertices). The function should return a collection of vertices. Policy implementation function.
[0156] For example, the following functions are:
[0157] V=StartNodes(g)={v|v is the start vertex of g} is the set of all start vertices of graph g.
[0158] Start vertices are the vertices of the graph from which navigation can be initiated according to the chosen strategy.
[0159] V=NextNodes(v)={v|v is the successor of v} is the collection of all the successor vertices of vertex v.
[0160] For micropolicies, the ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 