JP3284561B2 - Learning support system - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a learning support system , in particular, to use multimedia (hereinafter, simply referred to as "multimedia") such as audio, text, and images (including computer graphics). The present invention relates to a learning support system using a computer for learning .

[0002]

2. Description of the Related Art Conventionally, as a learning support device using multimedia, a display and a speaker as an output device, a keyboard and a mouse as an input device, and a keyboard and a mouse as input devices have been used in order to transmit learning information to humans using multimedia.
2. Description of the Related Art A computer system for learning support having a storage device for storing data is known. For example, in the IEICE Technical Report (Educational Technology: ET90-64), "A Trial of Multimedia Intelligent CAI (Computer Aided Instruction)"
In a conventional learning support device using multimedia, from the viewpoint of a learner model and a teaching strategy, development of a learning scenario according to an individual learner is attempted. However, here, when students learn interactively with the computer, it is important to take appropriate breaks,
The learner who is the user manages the work, and instructing the user on the learning time is a task of the teacher who teaches using the above-described CAI apparatus.

[0003]

Further, as is well known, in a workstation or the like, the contents of a file held by a computer are symbolized and represented by a graphical image called an "icon" on a display.
A method is adopted in which the content of the file is displayed when the user specifies the icon with a mouse or the like. In the prior art, when displaying a large number of files possessed by a computer on a display such as a workstation, there has been a problem that it is difficult to distinguish the contents of the symbolized icons and that the meaning of the symbols cannot be understood. . On the other hand, similarly, in a multi-window system such as a workstation, only a part of the document is displayed by changing the size of the window,
The display area on a screen has been reduced. In addition, the document layout function allowed the document to have a predetermined size determined by the system, so that the window displaying the document by the multi-window system could be displayed in an overlapping manner. However, in the above-described conventional technology, when the window is reduced to reduce the display area, the entire document cannot be viewed at once, and when displayed in a multi-window system, many documents cannot be displayed at the same time. The only way to compare them was to change the way the windows overlap . The present invention has been made in view of the above circumstances, and an object of the present invention is to solve the above-described problems in the related art. That is, (1) To realize a method of paying attention to the fact that the learner skips learning or excessively proceeds with learning. (2) A display on which the entire page of each document can be seen at once and all the documents can be seen so that a plurality of documents such as textbooks and reference books can be compared on a desk. Realize the display method . It is to provide a learning support system that can be used.

[0004]

The above objects of the present invention are as follows.
In a learning support system that executes information processing for learning support by managing the progress of learning, for each of a plurality of learning processes constituting the content of the learning, an allowance of a time for each learner to execute each learning process. Storage means for storing a range, measuring means for measuring the time during which the learner has performed the learning process included in the plurality of learning processes, and comparing means for comparing the measured time with the permissible period. , both as having an output means for outputting a result of the comparison
The storage means may store the learning data as the allowable range.
Upper and lower limits of the time during which the learner should execute the process
Storing a value, wherein the comparing means compares the measured time with the previous time.
Comparing the upper limit value and the lower limit value,
If the measured time is greater than the upper limit,
As a result of comparison by the comparison means, learning is delayed
The output indicating that the measured time is smaller than the lower limit value
In such a case, learning is performed as a comparison result by the comparing means.
The output indicating that the vehicle is traveling too far
Is smaller than the upper limit and larger than the lower limit,
As a result of the comparison by the comparing means, learning is performed in a predetermined progress state.
This is achieved by a learning support system characterized by performing output indicating that the user is in a state .

[0005]

In the learning support system according to the present invention,
By providing the computer with the management function of the learning time and the break time, when the learner takes a break unnecessarily long, the computer can output an output for caution. Further, in the learning support system according to the present invention, when a large number of text and image files of the computer are displayed on the display, there is provided means for reducing and displaying each file to such a size that its contents can be discriminated. As a result, a plurality of files can be displayed in a size necessary for discriminating the contents of the file by using the icon as a visible icon .

[0006]

Embodiments of the present invention will be described below in detail with reference to the drawings. First, a first embodiment of the present invention will be described with reference to FIGS. FIG. 2 is a configuration diagram of a learning support device using multimedia according to an embodiment of the present invention. As is apparent from the figure, the learning support apparatus shown in this embodiment includes a computer 1201, an image scanner 1202, an optical disk device 1203, a disk device 1204, and a speaker system 120.
5, a display 1206, a keyboard 1207, and a mouse 1208. The computer 1201 is provided with a clock 1209, and the current time can be read into the program when requested by a program in the computer 1201. FIG. 3 is a diagram illustrating a configuration example of a learning time management table corresponding to a user (learner) used by a computer to manage the learning time and the break time in the learning progress. In this learning time management table, the user ID (1301) can be registered, and learning time management for each user can be performed by distinguishing a plurality of users by the user ID (1301). It is. Here, n learning processes are provided in time series for all the learning contents, and the learning process of the learning process number i (1302) of the n-divided learning contents is Pi. The lap time in the learning process Pi is a difference between the end time t of the learning process Pi and the start time t ₀ of the learning process Pi, and the lower limit of the allowable range of the lap time is tmin.
(i) (1303), and the upper limit is set as tmax (i) (1304). Further, the standard value of the accumulated time from the learning start time is T
(i) (1305), and the transition of the accumulated time actually required for learning is sequentially recorded as S (i) (1306). tmin (i) (1303),
tmax (i) (1304), T (i) (1305) and S (i) (1306) are
It is a variable with the learning process number i (1301) as a parameter,
tmax (i) (1304), tmin (i) (1303) and T (i) (1305)
Is set to an initial value adapted to the learning content. S
(i) In (1306), “0” is set as an initial value. Also,
To record how far the previous learning process has progressed,
The learning process number i (1307) to be learned next time can be recorded. Here, “1” is set as an initial value before learning is performed for the first time. Furthermore, the accumulated time S after learning
UM (1308) can be recorded, and “0” is set as an initial value before learning is performed for the first time. When the learning is restarted after the learning is interrupted, this value is read, the cumulative time is added, and recorded when the learning is interrupted again.

FIG. 1 is a PAD diagram of an algorithm in which a computer manages the learning time and the break time in the progress of learning. When the user ID is input and learning is started, or learning is resumed after the previous learning was interrupted, the current time t ₀ is input and the accumulated time SUM is read (step 11).
01). Next, a learning process number i for which learning is to be resumed is read (step 1102), whereby learning Pi can be executed.
(1104). At the end of the i-th learning process Pi, the current time t
Is read (step 1105), the accumulated time SUM (1308) is updated (steps 1106 and 1107), and as described below,
The learning progress state is output (step 1108). Next, the lap time (t−
If (t ₀ ) is larger than tmax (i), the learning is delayed (step 1110), and the lap time (t−
If (t ₀ ) is smaller than t min (i), it means that the learning has advanced too much (step 1111), and the lap time (t−t ₀ )
Is greater than tmin (i) and less than tmax (i),
It is in a predetermined learning progress state (step 1112), and processing corresponding to each is performed. Thereafter, the value of i is incremented (step 1113), and the current time t is substituted into t ₀ as the next learning process start time (step 1114). If the learning is interrupted (step 1115), the incremented i
Is stored in the learning time management table (step 1116),
It can be interrupted by substituting (n + 1) for i (step 1117). At this time, the accumulated time is also recorded (step 111).
8). Until the learning process number i becomes the end number n + 1 (step 1103), the next learning process is executed (step 1).
104). By the means as described above, it is possible to give an advice to the user according to the learning progress of the individual. Further, by recording the accumulated time SUM, the delay time and the remaining time viewed from the entire learning can be displayed.

FIG. 4 is an example of an image diagram of the screen configuration of the display output by the above-described learning progress state output algorithm (step 1108). Here, a two-dimensional graph is shown in which the horizontal axis represents the learning process number i (1302) (1401) and the vertical axis represents the accumulated learning time SUM (1308) (1402). The standard cumulative time (1
403) and the transition of the actually required accumulated time (1306) can be displayed by comparison. Fig. 5 shows the learning progress status output algorithm
FIG. 2 is a PAD diagram showing (step 1108 in FIG. 1). The horizontal axis sets and displays the learning process number (1302) (step 1501), and the vertical axis sets and displays the accumulated learning time (1306) (step 1501).
2). Then, the standard cumulative time set in advance according to the learning content is displayed as a graph (step 1503), and the transition of the actually required cumulative time (1306) is displayed up to the current learning process i (step 1504), A two-dimensional graph that can compare the two is constructed.

A second embodiment of the present invention will be described with reference to FIGS. In the second embodiment, a document reduction display function described below is added to the apparatus shown in the first embodiment. FIG. 6 is an overall PAD diagram of the document reduction display method. For example, when the mouse button is picked in the mouse reception area provided at the lower right of the document (step 2101), the processing is performed by the algorithm based on the entire flow of FIG. That is, initial coordinates (x ₀ , y ₀ ) at the lower right of the document when the mouse button is picked are input (step 210).
2) Then, the user moves the mouse while holding down the mouse button, and at the lower right position of the document of the size to be reduced,
Release the mouse button (step 2103). As a result, the coordinates (x ₁ , y ₁ ) after moving the mouse are input as the lower right coordinates of the document desired by the user (step 2104), and the number of pixels (Δx, Δy) to be reduced in the x, y directions Are Δx =
x ₀ −x ₁ , Δy = y ₀ −y ₁ (Step 210)
Five). After that, the user selects a deletion selection algorithm (Step 2106) that determines a pixel to be deleted from (Δx, Δy) and a reduced image generation algorithm (Step 2107) that deletes the selected pixel to create a reduced image. The image reduced to the size to be displayed is displayed (step 2108). As mentioned above,
Details of the deletion selection algorithm (step 2106) and the reduced image generation algorithm (step 2107) will be described below. FIG. 7 is a PAD diagram of the deletion selection algorithm (step 2106) at the time of compression in the x direction. The configuration of the original image to be reduced is represented by a two-dimensional array A as pixel data.
[X, y] and a two-dimensional array FLAG_A [x, y] that stores a flag for determining a pixel to be deleted (step 2201). First, a counter for counting the number of pixels to be deleted is set to “0” (step 2202), and all flags are set to “1”.
The pixels with the flag “1” remain, and the pixels with the flag “0” are deemed to be deleted. For each row in the x direction of A [x, y], a function ramd () that generates a random number from 0 to 1 gives
Sorting is performed so that it is sequentially removed with a probability of Δx / x
(Step 2204) The flag corresponding to the selected pixel is set to “0” (Step 2206). If the flag is once set to "0", it is not counted (step 220).
Five). This operation is repeated until a pixel to be deleted Δx is selected at random from the x pixels, that is, the counter is ΔΔ
It repeats until it becomes x (step 2203). It should be noted that a deletion pixel selection algorithm at the time of compression in the y direction (step 210)
6) is achieved by the same operation as the compression in the x direction.
As described above, after the pixel to be deleted is marked with the flag, a reduced image is generated by a reduced image generation algorithm (step 2107) for deleting the selected pixel and creating a reduced image.

FIG. 8 is a PAD diagram of the reduced image generation algorithm in the x direction (step 2107 in FIG. 6). FLAG_
Only those having a value of A [j, i] of "1" are determined (step 230).
1) The value of A [j, i] is transferred to WORK_A (step 2)
As a result, (x−Δx) * y reduced images of two-dimensional pixel data are generated in WORK_A. Note that the reduced image generation algorithm at the time of compression in the y direction is achieved by the same operation as compression in the x direction. FIG. 9 shows x, y
In both directions, a screen generation image is shown regarding the transition of the pixel when reduced. Reference numeral 2401 denotes a conceptual display of the original image before reduction, which will be described with one alphabet corresponding to one pixel. At 2402, the same number of pixels are randomly and randomly selected from each row in the x-direction using random numbers as the coordinates of the pixels to be deleted in the x-direction.
Marked. Regarding the coordinates of the deleted pixel flag (2402) marked with a cross, in 2403, the corresponding pixels can be reduced from the original image 2401 and an image compressed in the x direction can be generated. Next, similarly to the image 2404 compressed in the x direction, the coordinates of pixels to be deleted in the y direction in the
Using a random number, the same number of pixels were selected at random from each row in the y direction, and the coordinates flag was marked with a cross. Regarding the coordinates marked with a cross in the deletion pixel flag 2405,
At 2406, corresponding pixels can be reduced from the image 2404 compressed in the x direction to generate an image compressed in the y direction. Through the above steps, an image 2406 compressed in both the x and y directions can be generated. FIG.
This is an example of screen reduction display, in which original data of a document in a work memory is reduced to a size specified by a user, written in a frame memory, and one or a plurality of documents are displayed on a single screen in an arbitrary size. In the case of a color image, RG
The same operation is repeated for the B3 color, but here, for simplicity of expression, it is expressed by an algorithm for a single color. It is easy to extend this algorithm for color images.

A third embodiment will be described with reference to FIGS. In the third embodiment, a mouse pointing function in a moving image as described below is added to the apparatus shown in the first embodiment. FIG. 11 is a block diagram of the display control for controlling the display screen.
05, CRT controller 1 (3103), CRT controller 2 (3106), TV synchronization circuit 3101, video frame 3102, mixer memory 3104, frame memory 3107, processor 3108
It is composed of The TV synchronization circuit 3101 synchronizes with the analog signal input of the moving image and digitizes it.
The data is sequentially written into the video frame 3102 corresponding to the pixel specified by the mixer memory 3104. On the other hand, computer graphics, text characters, and the like are written to the frame memory 3107. Video frame 3102, frame memory 31
To write to 07, processor 3108 sends an instruction and CR
T controller 1 (3108), CRT controller 2 (3106)
Is controlled by The arrangement in which the image of the video frame 3102 and the image of the frame memory 3107 are output to the CRT 3105 is synthesized based on the moving image display area information defined in the mixer memory 3104 by the processor 3108. FIG. 12 shows the data structure of the mouse reception area. In the present embodiment, in order to display a related description of the moving object or the object on the screen by directly pointing the object such as a mouse with a mouse, in this embodiment,
A method in which the mouse receiving area can be moved according to the movement of the object is used. The change of the object on the time axis according to the movement of the object of interest
It was recorded as X coordinate 3202 and Y coordinate 3203. Also, as an address for displaying the related description of the object, one table including the link destination address 3204 is prepared, and as many tables as the number of objects desired to be designated on the screen are prepared. The description to be displayed is changed according to the target pointed by the user with the mouse.
The procedure for creating and processing this table is as follows:
explain.

FIG. 13 is a PAD diagram showing an algorithm for creating the above-mentioned table. First, a start time at which a moving image is started to be read is read (step 3301). Next, a command "VTR-play" for playing a moving image is executed (step 3).
302). Thereafter, "VTR-stop" is executed, and the process waits for a mouse input until the moving image stops (step 3303). Until the mouse is input, the time is read and the time from when the moving image is started to be counted is counted (step 3310). here,
When the object of interest whose motion is to be recorded appears, move the mouse while pressing the mouse button (Step 3305) according to the object whose motion is to be recorded, and the computer reads the mouse coordinates (Step 3306).
Record (step 3308) and read the current time
(Step 3307), time data is also recorded (Step 330)
8). The recording operation (step 3308) ends by releasing the mouse button (step 3305). Then, "VTR-s
"top" to stop the movie (step 3309). One table is completed by adding the link destination address 3204 to the input time (3201) and coordinate data (3202, 3203). Recording the movement of another object can be realized by playing the moving image again and using the same means. Means for performing control such as playing or stopping a moving image using a computer is described in, for example, JP-A-2-148217, “CD-R
As described in "OM disc reproducing apparatus", the details are omitted here.

FIG. 14 is a PAD diagram showing an overall algorithm for receiving mouse pointing by incorporating the table created by the above means. First,
The start time at which the moving image is started to be read is read (step 3401).
Next, a command “VTR-play” for playing a moving image is executed (step 3402). Then, "VTR-stop" is executed, and it waits for a mouse input until the moving image stops (step 3403). The current time is read until the mouse enters (step 3407), and when the time reaches the time to end the moving image (step 3408), "VTR-stop" is executed to stop the moving image (step 3409). Before that, if there is any doubt about the object in the moving image while the user is looking at the screen, the user directly points with the mouse. When the mouse button is pressed (step 3404), “VTR-pause” is executed to freeze the moving image (step 3405). Coordinate data (3202, 320
Using the 3) and the time data (3201), a mouse region determination algorithm (step 3406) determines which table object the user is pointing to. After the determination, if there is a corresponding object, the corresponding screen is displayed with reference to the link destination address 3204. After the display ends or after the determination, if there is no corresponding object, "V
TR-pause ”is released and the continuation of the moving image is played. FIG. 15 is a PAD diagram showing the above-described mouse region determination algorithm. The computer records the mouse coordinates (Xm, Ym) (step 3).
501) and read the table data (step 350
2). The current time T is read (step 3503), and ± Xd and ± Yd of the coordinates X (i) and Y (i) of the object of interest corresponding to the time T (i) (3505) corresponding to that time are read. A rectangular area is set (step 3507). Xd, Yd
Is a play based on the size of the object of interest.
If the mouse coordinates (Xm, Ym) are within the above-described rectangular area (step 3508), the moving image is stopped (step 3509), the link destination address 3204 is referenced (step 3510), and the corresponding screen or sound is output. I do. After completion of the processing of the link destination address 3204, or if the mouse coordinates are not within the rectangular area (step 3508), it is assumed that the user has pointed to a screen for which no explanation screen or the like is prepared, and "VT
R-pause ”is released (step 3511), and the continuation of the moving image is played. By the above means, it is possible to receive mouse pointing in a moving image.

A fourth embodiment will be described with reference to FIGS. In the fourth embodiment, in the device shown in the first embodiment, a function of recording multimedia data displayed on the screen as a teaching material as a personal memo irrespective of the type of media is added. Yes, and will be described below. FIG. 16 is a display control block diagram for controlling a display screen according to the fourth embodiment.
6, memo storage device 4107, video frame 4102, mixer memory 4103, frame memory 4104, work memory 410
5, a user interface 4108. As already described with reference to FIG. 11, the TV synchronization circuit 3101 synchronizes with the analog signal input of the moving image, digitizes it, and sequentially writes it into the video frame 4102 corresponding to the pixel specified by the mixer memory 4103. On the other hand, computer graphics, text characters, and the like are written in the frame memory 4104.
Writing to the video frame 4102 and the frame memory 4103 is based on an instruction from the CPU 4106. Video frame 41
The CPU 4106 determines the arrangement of the image 02 and the image in the frame memory 4104 to be output to the CRT 3105 in the mixer memory.
The composition is performed based on the moving image display area information described below defined in 4103. FIG. 17 shows the display 4204,
FIG. 4 is a logical configuration diagram of a video frame 4201, a mixer memory 4202, and a frame memory 4203. Video frame 4201,
Each of the frame memories 4203 has a memory for n * m * gradations and can store data for three colors of RGB. The mixer memory 4202 has n * m * 1 bit memory. To simultaneously display the contents of the video frame 4201 and the contents of the frame memory 4203 on the display 4204,
Video frame 4201 and frame memory 4203 when outputting 4204
Which screen information to output is determined by the mixer memory 4202
Can be set. For example, the moving image display area is set to “1”, and the others are set to “0”, and when the display 4204 is output, the determination is performed for each pixel.

FIG. 18 is a PAD diagram of an algorithm capable of recording multimedia data displayed on the screen as a personal memo irrespective of the type of media. A three-dimensional array describing the contents of a video frame is represented by VTR [n,
m, 3], the three-dimensional array describing the contents of the frame memory is FLM [n, m, 3], the two-dimensional array describing the contents of the mixer memory is MIX [n, m], and a memo buffer is used. The memory is set to BUF [n, m, 3] (step 4301). Hereinafter, the operation will be described. When a user requests to take notes while learning
(Step 4302) By moving the mouse while keeping the button pressed and releasing it (Step 4304), two points (x ₀ , y ₀ ) in the diagonal direction of the rectangular area are set as the copy range requested by the user.
(x ₁ , y ₁ ) can be input (steps 4303 and 4305). The area between these two points is copied from the screen data to the memo buffer memory one pixel at a time. That is,
If the value of MIX [i, j] is “0” for the coordinates (i, j) of each pixel (step 4306), the frame memory (4203)
To the memo buffer memory (step 430).
8) If the value of MIX [i, j] is "1" (step 4306), the video frame (4201) is copied to the memo buffer memory (step 4309). Note that in the figure, k is a color parameter, for three colors of RGB, k = 1,2,
3 and the same process is repeated (steps 4307 and 431).
0). FIG. 19 is an image diagram of the buffer memory for the memo. After the above processing, the configuration of the buffer memory for the memo has a size of (x ₀ −x ₁ ) × (y ₀ −y ₁ ) for three colors RGB. Screen information can be extracted as a file. The means for reading and editing the document file for notes after extraction is
For example, Hitachi Creative Workstation 2050
OFIS / REPORT-EV (3) Grammar / Operation manual (2050-3-3
As described in 11), this operation is known as a still image capturing operation, and the details are omitted here.

[0016]

As described in detail above, according to the present invention, it is possible to manage the progress of learning by a learner, and if necessary, a plurality of textbooks and reference books can be stored on a desk. Display methods that allow you to compare documents, objects in moving images, and moving objects such as people.
A mouse pointing method that allows you to directly specify the position with the mouse anywhere on the screen, and
Regarding the part that the learner wants to leave in the memo, a remarkable effect that a free memo file creation method and a device for the memo file can be realized irrespective of the type of media such as text, graphics, still images, and moving images. To play.

[0017]

[Brief description of the drawings]

FIG. 1 is a PA showing a method of managing learning time and break time in computer-assisted learning using multimedia.
FIG.

FIG. 2 is a configuration diagram of a computer-aided learning device using multimedia.

FIG. 3 is a display control block diagram.

FIG. 4 is an overall PAD diagram of a document reduction display method.

FIG. 5 is a PAD diagram of a reduced pixel selection algorithm in the document reduced display method.

FIG. 6 is a PAD diagram of a reduced image generation algorithm in the document reduced display method.

FIG. 7 is an image diagram showing an example of a screen change by a reduced pixel selection algorithm and a reduced image generation algorithm.

FIG. 8 is an example of a document reduced display.

FIG. 9 is a PAD diagram of a reduced image generation algorithm in the document reduced display method.

FIG. 10 is an image diagram illustrating an example of a change in a screen by a reduced pixel selection algorithm and a reduced image generation algorithm.

FIG. 11 is an example of a document reduced display.

FIG. 12 is a table data configuration diagram of a mouse reception area.

FIG. 13 is a PAD diagram of a table data creation algorithm of a mouse reception area.

FIG. 14 is a PAD diagram of mouse pointing in a moving image.

FIG. 15 shows a PA of a mouse reception area determination algorithm.
FIG.

FIG. 16 is a block diagram of a display control function.

FIG. 17 is a logical configuration diagram of a frame memory and a video buffer.

FIG. 18 is a PAD diagram of a processing algorithm of the cut / paste memo.

FIG. 19 is a data configuration diagram of a cut-and-paste memo.

[Explanation of symbols]

1201: computer, 1202: image scanner, 1203: optical disk device, 1204: disk device, 1205: speaker system, 1206: display, 1207: keyboard, 1208: mouse, 1209: clock.

────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Hirohide Haga 1099 Ozenji Temple, Aso-ku, Kawasaki City, Kanagawa Prefecture Hitachi Systems Development Laboratory Co., Ltd. (56) References JP-A-1-163874 (JP, A) JP-A-2-147983 (JP, A) JP-A-61-61790 (JP, A) JP-A-57-28467 (JP, U) JP-A-63-48187 (JP, U) JP-A-2-2281 (JP, A) , Y2) (58) Field surveyed (Int. Cl. ⁷ , DB name) G09B 5/00-7/12 G06F 17/60 128

Claims (5)

(57) [Claims] 1. A learning support system for executing information processing for learning support by managing the progress of learning, wherein a learner executes each learning process for each of a plurality of learning processes constituting the content of learning. Storage means for storing an allowable range of time to be performed; measuring means for measuring a time during which the learner has executed a learning process included in the plurality of learning processes; and comparing means for comparing, with an output means for outputting a result of comparison, the storage means, as the allowable range, each of said learning process
The upper and lower limits of the time that the learner should execute
The comparing means stores the measured time, the upper limit value, and
And the lower limit is compared, and the output means sets the measured time to be less than the upper limit.
If it is larger, the learning result is
If the measured time is smaller than the lower limit , the output indicating that the
Learning is progressing too much as a result of comparison by the comparison means
The output indicating that the measured time is less than the upper limit and the lower limit
If larger, as a result of comparison by the comparing means,
A learning support system for performing an output indicating that learning is in a predetermined progress state . 2. The learning support system according to claim 1, wherein the output device includes a display for displaying an image related to the learning. 3. The learning support system according to claim 2 , further comprising display control means for reducing said image in accordance with an input from said input means and displaying said image on said display. Support system. 4. The learning support system according to claim 3 , wherein said display control means displays a plurality of said reduced images on said display. 5. The learning support system according to claim 4, further comprising input means for receiving an input of said learner to said learning support system, wherein said display control means includes a plurality of display means displayed on said display. A learning support system characterized in that, among images, an image specified according to an input from the input means is displayed in an enlarged manner.