JPH09146973A - Distributed hyper text controller - Google Patents

Abstract

PROBLEM TO BE SOLVED: To freely join in a class or presentation and to enable a continuous self-practice through easy operation by providing a means which switches an interlocking state wherein clients share distributed hyper texts at the same time and a noninterlocking state wherein they are not shared. SOLUTION: When the user (tutor) of an operation instructing client 27 starts a lecture in the noninterlocking state while showing, for example, distributed hyper texts to the users (student) of operation-instructed clients 28, the tutor selects the interlocking state by using the user interface of the operation instructing client 27. Namely, the interlocking state is selected by a state selecting means 35. Then, an interlocking instruction is sent to all the operation- instructed clients 28 by the interlocking instruction means 31 of the operation instructing client 27 through a communication means 3 and a network 6. The operation-instructed clients 28 receive the instruction by interlocking means 32 and their hyper text viewers 2 are placed in the interlocking state.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a distributed system having a plurality of client workstations and a plurality of server workstations connected to a network, in which a plurality of users use a distributed hypertext viewer of the client as a server. The present invention relates to a device used in a distributed hypertext system in which the hypertext data stored in the above is shared at the same time according to the situation at that time, or can be freely switched to be operated independently.

[0002]

2. Description of the Related Art FIG. 26 shows, for example, Marc Andreessen,
`` NCSA Mosaic Technical Summary Revision 2.1 May
8, 1993 "and" Getting Started with NCSA Mosaic Ma
FIG. 8 is a block diagram showing the first distributed hypertext system of the conventional example shown in FIG.
In FIG. 26, reference numeral 1 is a client workstation, which comprises a distributed hypertext viewer 2 (NCSA Mosaic Client) for operating and displaying hypertext and a communication means 3. 4 is a server workstation (http
d server) and has communication means 3 and hypertext data 5. 6 is a client workstation 1
And the server workstation 4 are networks for communicating via the communication means 3. 7 is a node of hypertext data 5 (URL: Uniform Resource Loca
8 is a link relationship of the hypertext data 5. Reference numeral 9 indicates a history table for recording the node names 10 (URL) of the hypertext data 5 accessed in the past by the distributed hypertext viewer 2 in chronological order. Also, the node 7 of the hypertext data 5 is HTML: Hyper Text Markup La
The content is described by nguage, and the node name 10 which is the link information of the jump destination is embedded.

Next, the operation of the first conventional system is shown in FIG.
It will be described based on. Start the distributed hypertext viewer 2 on the client workstation 1 connected to the network 6 and display the node name 10
Is specified by text input or a graphical user interface, the server workstation 4
The corresponding node data 7 stored therein is read out via the communication means 3 and distributed hypertext.
It is displayed on the viewer 2. Along with that, the node name 10 is recorded in the history table 9. In the read node data 7, a link relation 8 for reading the node data 7 stored in the same server workstation 4 or another server workstation 4 is described in the same manner. The node data 7 in the server workstation 4 designated according to the description is accessed. At that time, similarly, the accessed node name 10 is sequentially recorded in the history table 9. FIG.
In, the respective users of different client workstations 1 can access and display the hypertext data 5 of the same server workstation 1 or access the hypertext data 5 of different server workstations 1. It can also be displayed.

In FIG. 27, the same shared application program operates on a plurality of terminals connected to the network, processing is performed on input information from any terminal to the shared application, and the processing result is shared. A second conventional example system is a block diagram of an application sharing system disclosed in Japanese Patent Laid-Open No. 6-83785. In FIG. 27, 11 is an information processing device that inputs to the shared application, 12 is another information processing device 13 in response to an event from the information processing device 11.
An information processing device that broadcasts to the user, 14 is a shared application processing unit that is the same in the information processing devices 11 and 13, and 15 is
Shared data processed by the shared application processing means 15, 16 means for providing a shared event to be sent to the broadcast communication control means 17, and 18 for analyzing the shared event broadcast from the broadcast communication control means 17. It is an event analysis means provided to the shared application processing means 14.

Next, in the second conventional system shown in FIG. 27, for example, the users of the information processing device 11 and the information processing device 13 use the hypertext viewer as a shared application to use the information processing device 11. An operation for sharing the hypertext data, which is the shared data 15, based on a person's instruction will be described. When the hypertext viewer, which is a shared application, in the information processing device 11 refers to a node in the hypertext data, which is the shared data 15, by a node name (by clicking an anchor with a mouse), the shared application of the information processing device 11 The processing means 14 reads and displays the node data corresponding to the node name. Then, the node name is passed from the information processing device 11 to the event providing unit 16 and converted into an event corresponding to the node name. Next, the event is sent to the broadcast communication control means 17 of the information processing device 12 via the communication means 3 and the network 6. The broadcast communication control means 17 broadcasts an event to the information processing device 13 connected to the network 6. Upon receiving the event, the event analysis unit 18 of the information processing apparatus 13 analyzes the content of the event and delivers the result to the shared application processing unit 14 of the information processing apparatus 13. The shared application processing means 14 reads out the node data of the same hypertext data as the information processing apparatus 11 from the shared data 15 and displays it. By the above operation, the hypertext viewer is shared by all the information processing devices,
The same hypertext will be displayed.

FIG. 28 shows a third conventional hypertext system capable of dynamically extracting node information according to the situation at that time, which is disclosed in Japanese Patent Laid-Open No. 5-181736. In FIG. 28, hypertext nodes 19, 20, 21, 22 and a node 19
To the nodes 20, 21, and 22, and a trigger function unit 23 for parametrically setting a link 24. The trigger function unit 23 is provided with a condition part starting with “IF” and a result part starting with “then”, and the node designated by the result part corresponding to the condition part satisfying the condition is the starting point at that time. Is selected as a node related to the node 19. In the example of FIG. 28, the parameters are a, b,
If the parameters a, b, and c are both satisfied, the node 20 is selected, and if the parameters a and c are both satisfied, the node 21 is selected, and the parameters c and d are both satisfied. If so, the node 22 is designated to be selected.

While the hypertext system is operating, the parameter c,
If both d are valid, the trigger function unit 23 substitutes the parameter into each condition unit to determine whether the condition is satisfied, and in this case, selects the node 22 as related information. When the user operates a soft button or the like to request the reference of the related node, the system sets the corresponding node 22 to the referenceable state according to the selection of the trigger function unit 23.

[0008]

Since the systems related to the distributed hypertext which can be synchronously shared by a plurality of users as shown in the conventional examples 1 to 3 are configured as described above, they are as follows. There were challenges. Firstly, if the distributed hypertext shown in the first example of the conventional example is synchronously shared by a plurality of users by using the technology of the application sharing system shown in the second example of the conventional example, one distributed hypertext is distributed. By operating the text viewer, other users can share the result at the same time. However, since the operation event designated by one operator is broadcast to the distributed hypertext viewers of the client workstations 1 of other users in the same manner, each person separately distributes the distributed hypertext viewer. There is a problem in that it is impossible to freely switch between the case where the user wants to operate and the case where he wants to operate. For example, in a classroom, when a teacher advances a lecture while displaying the same distributed hypertext on all students' workstations at the same time, and uses the distributed hypertext at a certain point to perform an exercise according to the ability of each student, There was also a problem that it was not possible to freely switch and continue the exercises, such as performing individual operations for each student and returning to the common lecture using the common distributed hypertext node presented in the lecture as the starting point. .

Secondly, the hypertext capable of dynamically extracting the hypertext node information shown in the third example of the prior art makes it possible to access the related node by the parameter according to the situation at that time. Therefore, even in the case of associating with two types of nodes such as the node 25 and the node 26 shown in FIG. 29, which only have different text C parts, two nodes having almost no difference in their contents must be created and managed. There was a problem that it had to be. For example, in a classroom, when a teacher advances a lecture while displaying the same distributed hypertext on all students' workstations at the same time, to display additional simple comments and notes only on the teacher's workstation,
There was a problem that node data with comments and notes for teachers and node data without them had to be created and managed separately.

The present invention has been made to solve the above problems, and has the following objects. When performing collaborative work using distributed hypertext between users who have an explanation (operator) and an audience (operated), such as a teacher and multiple students, simultaneous hypertext sharing, that is, interlocking The purpose of the present invention is to obtain a distributed hypertext system in which a non-shared state in which individual operations can be performed independently of the state, that is, a non-linked state can be continuously and freely switched according to the situation at each time. In addition to the above, it is an object of the present invention to obtain a distributed hypertext system that the listener cannot operate without the permission of the explainer in the linked state. It is another object of the present invention to provide a distributed hypertext system capable of independently managing the past node history traced by the explainer in the linked state and the past node history traced by each person in the non-linked state. In addition, a distributed hypertext user can provide a data block that can be specified and displayed only by a specific client, and can freely add and control the display and execution of hypertext display control or link control distribution. The aim is to get a hypertext system. In addition, a distributed hypertext can be obtained which can easily describe and execute hypertext display control or link control depending on whether the distributed hypertext is linked or not linked.

[0011]

DISCLOSURE OF THE INVENTION A distributed hypertext control apparatus according to the present invention includes a server storing hypertext data distributed and arranged via a network, and a communication means for communicating the hypertext with other clients. , Hypertext viewer for operating and displaying hypertext, start / end means to specify start / end of hypertext on client, and whether to set hypertext as common operation and display target with other clients It is equipped with interlocking / non-interlocking means to specify whether to perform independent operation and display.

Furthermore, in the basic configuration, the activation / termination means for instructing the activation / termination of the hypertext is, in a specific client, activated / deactivated to another client.
As an end instruction means, and in other clients,
The own hypertext is started / closed based on the start / end instruction from a specific client.

Further, the interlocking / non-interlocking means for instructing the hypertext interlocking / non-interlocking is the interlocking / non-interlocking instructing means for another client in a specific client, and the other client is the specific client. The hypertext is linked / unlinked based on the linked / unlinked instruction from.

Furthermore, invalidation instruction means for invalidating the operation of the hypertext viewer in another client is added to a specific client, and the other client is
The operation of the hypertext viewer in the linked state is disabled based on the invalidation instruction from a specific client.

Furthermore, a node information history table in which the history of hypertext data accessed by its own hypertext viewer is recorded in the order of access, and linked / unlinked, and linked / unlinked of this node information history table. A history switching means for selecting a history of merging the both is provided, and hypertext is sequentially displayed based on the history of the node information history table selected by the history switching means.

Furthermore, the hypertext data has a link specified, and a management identifier for distinguishing a data block that can be accessed only by a specific client from a data block that can be commonly accessed by all clients is provided. The data block management identification means for identifying the management identifier of the data block, and the display / link determination / link control determination / display of the required data block based on the link designation in the identified accessible data block. Execution means are provided.

Furthermore, the hypertext data has a link specified, and a data block that can be accessed only in a linked state, a data block that can be accessed only in a non-linked state, and a data block that can be accessed in either state. Further, a status identifier for distinguishing between each client is provided, and each client is provided with a data block status identification means for identifying the status identifier of the data block, and a display / display of the necessary data block based on the link designation in the identified accessible data block. A display / link control judgment / execution means for linking is provided.

Furthermore, the hypertext data has a link specified, and a data block that can be accessed only by a specific client, a data block that can be commonly accessed by all clients, and a data block that can be accessed only in a linked state. , An identifier for distinguishing a data block that can be accessed only in a non-linked state is provided, and each client has a data block management identifying means for identifying the identifier of the data block and a link in the identified accessible data block. A display / link display / link control judgment / execution means is provided for the necessary data blocks based on the designation.

[0019]

BEST MODE FOR CARRYING OUT THE INVENTION

Embodiment 1 FIG. In the present embodiment, when a collaborative work is performed using distributed hypertext between users who have a relationship such as an explainer and an audience like a relationship between a teacher and a plurality of students,
1 shows a distributed hypertext system capable of continuously switching a hypertext interlocking state and a non-interlocking state in which individual operations can be performed. This embodiment is shown in FIGS.
4 will be described.

FIG. 1 is a schematic configuration diagram of the system of the present embodiment. In the figure, 27 is an operation instruction client that gives an operation instruction for the distributed hypertext viewer 2 in the linked state, and 28 is an operation instruction client 27.
Is an operated instruction client that operates the distributed hypertext viewer 2 according to the instruction. Reference numeral 29 is a means for instructing activation and termination of the operated instruction client 28, and 30 is a means for receiving the instruction of the operated instruction client 27 and operating the operated instruction client 28.
Means for activating and terminating the distributed hypertext viewer 2 of FIG. 3, 31 is an interlocking instructing means for the operation instruction client 27 to operate the distributed hypertext viewer 2 of the operated instruction client 28 in conjunction, and 32 is an operated instruction. The client 28 receives the interlocking instruction, and according to this instruction, the distributed hypertext viewer 2
The interlocking means 33 for operating the operation instruction client 27 is a non-interlocking operation in which the operation instructing client 27 suspends the interlocked state of the distributed hypertext viewer 2 of the operated instructed client 28 and operates the distributed hypertext viewer 2 independently for each client. Instructing means 34 is a means for receiving the non-interlocking instruction in the operated instruction client 28, and operating the distributed hypertext viewer 2 independently for each client in accordance with the instruction, and 35 is the operating instruction client 2
Reference numeral 7 indicates a state selection means for selectively switching between the interlocked state and the non-interlocked state.

Next, the outline of the operation in the first embodiment will be described with reference to FIGS. FIG. 2 is a flow chart outlining the process of starting and ending the operated instruction client 28 by the operation instruction client 27, and FIG. 7 is a flowchart showing an outline of a switching process.

In FIG. 2, the operation instruction client 27
After the distributed hypertext viewer 2 is started by a user of the user, a plurality of operated instruction clients 2 used by other users by some kind of user interface.
8 gives a start instruction. As a result, internally, the activation / termination instruction means 29 of the operation instruction client 27 issues an activation instruction to all the operated instruction clients 28 via the communication means 3 and the network 6 (step S101). Next, the operated instruction client 28 receives this activation instruction via the communication means, notifies the activation / termination means 30 and activates its own distributed hypertext viewer 2 (step S102). The same applies to the end (steps S101 and S102).

Next, assume that the current state is the non-interlocking state. In FIG. 3, when the teacher who is the user of the operation instruction client 27 starts a lecture, for example, while presenting the distributed hypertext to the student who is the user of the operated instruction client 28, first, the teacher operates The interlocking state is selected using the user interface of the instruction client 27. As a result, the state selecting means 35 internally selects the interlocking instruction (step S10).
4, S105). Next, the communication instruction means 31 of the operation instruction client 27 causes the communication means 3 and the network 6 to operate.
An interlocking instruction is issued to all operated instruction clients 28 via (step S106). In response to the above instruction from the presenter, the operated instruction client 28 of the listener,
The interlocking means 32 receives the interlocking instruction via the communication means 3, and brings its own distributed hypertext viewer 2 into the interlocking state (step 107).

In this linked state, when the teacher who is the user of the operation instruction client 27 operates the distributed hypertext viewer 2, the hypertext data stored in the plurality of servers 4 as shown in the first conventional example. While accessing 5 by yourself and displaying the result,
The distributed hypertext viewers 2 of all the operated instruction clients 28 are linked to the operation, the operated instruction clients 28 themselves access the same hypertext data 5 of the server 4, and the distributed hypertext viewers 2 are The same result is displayed (step S108).
In this linked state, the teacher can
Operate viewer 2 and proceed with the lesson while sharing the same hypertext screen as the students.

Next, after the course of one unit is completed, the distributed hypertext screen (node data) displayed at the end of the course is used as a starting point, and exercises according to the ability of the student are performed using the distributed hypertext. Think about what to do. At this time, the teacher uses the user interface of the operation instruction client 27 to select the non-linked state. As a result, internally, the state selection means 35 selects the non-interlocking instruction (steps S109 and S11).
0). Next, the non-interlocking instruction means 33 of the operation instruction client 27 issues the non-interlocking instruction to all the operated instruction clients 28 via the communication means 3 and the network 6 (step S111). Then, the non-interlocking means 32 receives the non-interlocking instruction via the communication means 3 of the operated instruction client 28, and brings its own distributed hypertext viewer 2 into the non-interlocking state (step 11).
2).

In this non-linked state, the teacher who is the user of the operation instruction client 27 and the students who are users of all the operated instruction clients 28 are displayed on the distributed hypertext viewer 2 used at the end of the lecture. Starting from the displayed screen (node), individual operations can be continuously performed (step 113). When shifting from the non-linked state to the linked state, the operation from step S104 is repeated.

Now, based on the outline of the configuration and operation of the first embodiment as described above, the detailed configuration for the start / end processing of the distributed hypertext viewer 2 of the operated instruction client 28 by the operation instruction client 27. And the details of its operation will be described.

In the distributed hypertext system of the present invention, FIG. 4 shows means necessary for the user of the operation instruction client 27 to start / end the operated instruction client 28, in particular the start / end instruction of the operation instruction client 27. The means 29 and the activation / termination means 30 of the operated instruction client are described in more detail in step S101 on the teacher side and step S102 on the student side in FIG.
In FIG. 4, 220 is a client name for identifying the operation instruction client itself, and 221 is a client name registration in which names for identifying all clients on the network 6 used by the distributed hypertext system of the present invention are registered. A table is shown, and the first name represents the name of the operation instruction client 27. 222
Shows a valid client name registration table in which the name of the operated instruction client 28 operable in response to the instruction of the operation instruction client 27 is registered. Further, 223 is a table in which the client name of each operated instruction client 28 itself is registered, and 224 is the operated instruction client 2
7 shows a table in which the names of 7 are registered.

Next, the detailed operation for the activation / termination processing of the distributed hypertext viewer 2 of the operated instruction client 28 by the operation instruction client 27 will be described with reference to FIGS. FIG. 5 is a flow chart of the start processing, and FIG. 6 is a flow chart of the end processing. First, the detailed operation of the startup process will be described with reference to FIGS. 4 and 5. The activation / termination instruction means 29 of the operation instruction client 27, after setting the variable N to 2, is registered in the client name registration table 221 with the command for activating the client name 220 of itself and the distributed hypertext viewer 2. The Nth client name is broadcast to all workstations on the network (S301, S302).

At this time, the operated instruction client 28
The operation instruction client 27 is waiting for an instruction (S303). The activation / termination means 30 of the operated instruction client 28 determines whether or not the broadcasted data has been sent to itself, and the operated instruction client name and the own client name 2
Compare with 23. As a result, if it has not been sent to itself, it returns to the instruction waiting state S303, and if it has been sent to itself, proceeds to the next (S304). Next, it is checked whether the broadcasted data is from a pre-registered operation instruction client, and whether it is a command for activating the distributed hypertext viewer 2 (S305, S30).
6) Otherwise, return to the instruction waiting state. If these conditions are satisfied, the distributed hypertext viewer 2 is activated (S307). Then, the operation instruction client 27 is notified of the completion of the activation process together with its own client name 30 (S308). After that, the process shifts to the next instruction waiting state from the operation instruction client 27 (S309).

After S302, the operation instruction client 27 checks whether or not the operated instruction client name notified from the operated instruction client 28 reaches the operated instruction client name within a fixed time (S310). If it has arrived, the valid client name registration table 222
The operated instruction client name is registered in (S311).
If the completion notice has not arrived, it is determined that the registered client is in an unusable state, and the process proceeds to the next process.
Then, if all the names in the client name registration table 221 have been broadcasted (S312), the activation process ends. Otherwise, increase N by 1 and add S
The process from 302 is continued. The above S301 to S313
When the processing of (1) is completed, the communication channel between the operation instruction client 27 and all operated instruction clients 28 is established and the activation of the distributed hypertext viewer 2 is completed, and the distributed hypertext system of the present invention described above is linked or unlinked. It will be in a state where it can be turned on.

Next, the detailed operation of the end process will be described with reference to FIGS. 4 and 6. Operation instruction client 2
The activation / termination instruction means 29 of 7 sets the variable N to 1, and then registers the client name 220 of itself, the command for terminating the distributed hypertext viewer 2, and the valid client name registration table 222. The N-th client name is broadcast to all operated instruction clients 28 on the network (S320, S
321).

At this time, the operated instruction client 28
The operation instruction client 27 is waiting for an instruction (S322). The activation / termination means 30 of the operated instruction client 28 determines whether or not the broadcasted data has been sent to itself, and the operated instruction client name and the own client name 2
Compare with 23. As a result, if it has not been sent to itself, it returns to the instruction waiting state S324, and if it has been sent to itself, proceeds to the next (S323). Next, it is checked whether the broadcasted data is from a pre-registered operation instruction client, and whether it is a command for terminating the distributed hypertext viewer 2 (S324, S32).
5) Otherwise, return to the instruction waiting state. If these conditions are satisfied, the distributed hypertext viewer 2 is terminated (S326).

If the operation instruction client 27 has finished broadcasting all the client names registered in the valid client name registration table 222 after S321 (S327), the end processing is ended. If not, N is incremented by 1 and the processing from S321 is continued.
When the processes of S321 to S328 are completed, the communication paths between the operation instruction client 27 and all operated instruction clients 28 are disconnected, and the distributed hypertext viewer 2 is terminated.

Next, as described above, the transition processing from the non-interlocked state to the interlocked state, the transition processing from the interlocked state to the non-interlocked state, and the interlocked processing in the interlocked state shown in FIGS. 1 and 3 will be described in detail. explain. First, an example of the representation format of one node 7 of the hypertext data 5 and the display format of the distributed hypertext viewer 2 will be described with reference to FIGS. FIG. 7 shows one node 7 of the hypertext data 5 shown in Prior Art 1,
The data (201) described by ML (Hyper Text Markup Language) is shown. 202 surrounded by <and>
The <title> of is one of what is called a tag and represents the title of this node 7, and indicates that it ends with </ title> enclosed by </ and>. HTML specifications, Impress
Since it is described in "Introduction to HTML" by Larry Aronson, etc., it is omitted here. In FIG. 7, 203 is also one of the tags, and the part 204 surrounded by 205 is
It indicates that it is linked to another node 7 called http://www.pats.melco.co.jp/iso/us.gif. The format of this linked information is generally URL (Uniform Resourc
e Locator).

FIG. 8 shows an example in which the distributed hypertext viewer 2 shown in FIG. 1 reads and displays the node data 7, which is the hypertext data 5 stored in the server 4. In particular, FIG. 8 shows the results of displaying the data of FIG. 7 with the distributed hypertext viewer 2. Underlined 207-210
Is called an anchor and indicates that it is linked to another node, and the link destination is expressed by the URL described above. 2
Reference numeral 11 denotes a button for returning to the node displayed before the node 206, and reference numeral 212 denotes a button for moving to a node next to the present node that was traced in the past. For example, "US" displayed in Distributed Hypertext Viewer 2
When the word portion 207 is clicked with a pointing device such as a mouse, the map of the United States shown in FIG. 9 appears. This map is http: //www.pat in server 4.
It is stored in s.melco.co.jp/iso/us.gif. This mechanism is exactly the same as the above-mentioned conventional technique 1.

FIG. 10 shows the process of transitioning from the non-interlocked state to the interlocked state, the process of transitioning from the non-interlocked state to the interlocked state, and the operation instruction from the operation instruction client 27 to the operated instruction client 28 in the interlocked state. The process, that is, S105 to 107 and S1101 to 1 in FIG.
It is a detailed block diagram for demonstrating 12 steps in more detail. In FIG. 10, reference numeral 230 denotes an operation performed in the distributed hypertext 2 of the operation instruction client 27, for example, event information such as whether a button such as 211 or 212 is pressed or an anchor such as 207 is pressed. 231 indicates the type of data, 231 indicates the data to be passed along with the event information 230, and 232 indicates the event notifying means for notifying the operated instruction client 28 of the event. Further, 233 is the event type of the operation performed by the distributed hypertext viewer 2 of the operation instruction client 27 received from the operation instruction client 27, 234 is the data received accordingly, and 235 is the means for receiving the event. Shows.

Here, with reference to FIG. 1, FIG. 3, and FIG. 8 to FIG. 12, from the operation instruction client 27 in the transition processing from the non-linked state to the linked state, the processing from the linked state to the non-linked state, and the linked state. The process up to giving an operation instruction to the operated instruction client 28 will be described in detail. FIG.
FIG. 12 is a flow chart of the transition processing from the non-interlocked state to the interlocked state and the transition processing from the interlocked state to the non-interlocked state, and FIG. 12 shows the operation instruction from the operation instruction client 27 to the operated instruction client 28 in the interlocked state. The flowchart of the process of FIG.

In FIG. 11, step S33 on the left side
0, S331, S338 to S340 are steps S in FIG.
6 shows the details of 106. That is, when the interlocking or non-interlocking instruction is selected by the state selecting means 35 of the operation instruction client 27, the interlocking instruction means 31 or the non-interlocking instruction means 33 sets the variable N to 1 (S330), and then the start / end instruction means 29. Own client name (operation instruction client name) 220, a command for setting the distributed hypertext viewer 2 in a linked or unlinked state, and an effective client name stored in the start / end instruction means 29. The N-th client name registered in the registration table 222 is broadcast to all operated instruction clients 28 on the network (S331).

Steps S332 to S33 on the right side of FIG.
7 shows details of step S107 in FIG. When the instruction from the teacher is broadcast, the operated instruction client 28 becomes the operation instruction client 27.
Is waiting for the instruction (S332). Interlocking means 32 or non-interlocking means 34 of the operated instruction client 28
Compares the received operated instruction client name with the own client name 223 to determine whether the broadcasted data is sent to itself. As a result, if it has not been sent to itself, it returns to the instruction waiting state S332, and if it has been sent to itself, it proceeds to the next (S333). Next, whether the broadcasted data is from a pre-registered operation instruction client, and whether it is a command for setting the distributed hypertext viewer 2 in the linked state or the non-linked state Check (S334, S335), otherwise return to the instruction waiting state S332. If these conditions are satisfied, the distributed hypertext viewer 2 is set to the linked state or the non-linked state (S336). Then, the operation instruction client 27 is notified that the setting process is completed (S337). After that, the operation instruction client 27 shifts to the next instruction waiting state (S332).

After S331, the operation instruction client 27 checks whether or not the interlocked state setting or non-interlocked state setting completion notification has arrived from the operated instruction client 28 (S338). Continue to, otherwise keep waiting until you receive the completion notice. Then, if all the client names registered in the valid client name registration table 222 have been broadcast (S339), the linked state or non-linked state setting process ends. Otherwise, increase N by 1 and add S
The process from 331 is continued.

FIG. 12 shows the details of the operation of step S108 of FIG. 3, and the anchor 207 of FIG. 8 or 10 displayed by the distributed hypertext viewer 2 of the operation instruction client 27 in the linked state is the mouse. A flow chart of a process until the operation instruction is notified to the operated instruction client 28 by clicking the button is shown. In FIG. 12, it is assumed that the user of the operation instruction client 27 clicks the anchor 207 displayed on the distributed hypertext viewer 2 (S3).
50). The distributed hypertext viewer 2 of the operation instruction client 27 detects an event that this anchor has been clicked, and indicates this in the event information area 233 of the interlocking instruction means 31, for example, ■ URL ■, which indicates that the anchor has been clicked. Character information is recorded (S3
51). The link destination of this anchor 207 is also shown.
Character information "http://www.pats.melco.co.jp/iso/us.gif" is recorded in the data area 231 (S352).

Next, the interlocking instruction means 31 sets the variable N to 1 (S353), and then the own client name (operation instruction client name) 220 and distributed hyper stored in the start / end instruction means 29. The event that the text viewer 2 was operated, the event information 233 indicating the type of event (in this example, the character string ■ URL ■), and the data associated with the event information (in this example, ■
http://www.pats.melco.co.jp/iso/us.gif (character string) and the Nth registered in the valid client name registration table 222 stored in the start / end instruction means 29. Broadcast the client name of the client to all operated instruction clients 28 on the network (S35).
4).

At this time, the operated instruction client 28
The operation instruction client 27 is waiting for an instruction (S355). The interlocking means 32 of the operated instruction client 28 compares the transmitted operated instruction client name with the own client name 223 to determine whether or not the broadcasted data has been sent to itself. . As a result, if it has not been sent to itself, it returns to the instruction waiting state S355, and if it has been sent to itself, it proceeds to the next (S356). Next, it is checked whether or not the broadcasted data is from the operation instruction client 27 registered in advance, and further whether or not the event is an operation of the distributed hypertext viewer 2 (S357, S358),
Otherwise, the process returns to the instruction waiting state S355. If these conditions are satisfied, the event receiving means 235 causes the event information area 233 and the data area 2 of the interlocking means 32.
The received event information and data are set in 34 (S359). Then, the operation instruction client 27 is notified of the completion of the setting process (S360). Then, based on these event information and data, node data stored in the server 4 http://www.pats.me
Start accessing lco.co.jp/iso/us.gif (S36
1). Next, the process jumps to step S366 described in FIG.

After S354, the operation instruction client 27 checks whether or not the event information and the data setting completion notification have arrived from the operated instruction client 28 (S).
362), if the completion notice has arrived, proceed to the next, otherwise continue to wait until the completion notice arrives. And
If all the client names registered in the valid client name registration table 222 have been broadcast (S363), the node data http: stored in the server 4 based on the event information and data recorded in S351 and S352. //www.pats.melco.co.jp/iso/us.g
Access of if is started (S361). Next, the process jumps to step S366 described in FIG.

Here, referring to FIGS. 8, 13 and 14, the operation instruction from the operation instruction client 27 to all the operated instruction clients 28 is completed in the interlocking state, and each client is stored in the server 4. The process of accessing and displaying the hypertext data 5 will be described in detail. FIG. 13 is a configuration diagram of a system related to this processing, and FIG. 14 is a flow chart of this processing. The left side of FIG. 14 shows the processing common to the operation instruction client 27 and the operated instruction client 28, and the right side shows the processing of the server 4 in which the hypertext data 5 is stored. The operation instruction client 27 or the operated instruction client 28 operates in step S366 shown in FIG.
Following this, information indicating the type of event stored in the event information area 230 or 233 (in this example, a character string indicating that the anchor has been clicked ■ URL ■
) To know that it is necessary to access the server (S367). Next, the data of the data area 231 or 233 (in this example, http: //www.pats.melc
o.co.jp/iso/us.gif), and using the http (Hyper Text Transfer Protocol) protocol shown in the prior art 1, http://www.pats.melco.co.jp / iso / u
A request to read the data stored in s.gif is issued (S368).

The server 4 (referred to as http server) uses http: // ww based on the received http protocol.
Data (URL: w.pats.melco.co.jp/iso/us.gif)
The data shown in (in this example, US map data) is read and converted to the http protocol format to be returned to the distributed hypertext viewer 2 (S36).
9). Then, the converted protocol is returned to the distributed hypertext viewer of the client that issued the request (S370).

After S370, the operation instruction client 27
Alternatively, the operated instruction client 28 expands the data based on the protocol received from the http server 4 and displays the expanded data on the distributed hypertext viewer 2. The steps S368 to S371 of the above steps can be performed by using the conventional technique 1. In the above description, the operation instruction client (teacher side) and the operated instruction client (student side) are divided, but they may be equal and may be used for cooperative work. That is, all the activation / termination means may be capable of instructing activation / termination. Similarly, all the interlocking / non-interlocking means may be capable of instructing interlocking / non-interlocking.

Embodiment 2 In the present embodiment, as in the case of the teacher and a plurality of students shown in the first embodiment, when performing a collaborative work using distributed hypertext between users who have a relationship such as an explainer and an audience, the hypertext A function that can dynamically switch between the linked state and the non-linked state where individual operations can be performed, and a new function that the user of the operated instruction client cannot operate his / her distributed hypertext in the linked state. It is a distributed hypertext system with added. This embodiment will be described with reference to FIGS.

FIG. 15 is a block diagram showing an outline of the system of this embodiment. In the figure, reference numeral 36 denotes the operation instruction client 2 in the interlocked state shown in the first embodiment.
Reference numeral 7 is a disabling instruction means for disabling the operation of the distributed hypertext viewer 2 by the user of the operated instruction client 28, and 37 is an operated instruction when the operated instruction client 28 receives the instruction. Client 2
8 shows a means for ignoring the operation so that the user cannot operate the distributed hypertext viewer 2 of 8.

Next, the outline of the operation will be described with reference to FIG. In FIG. 15, when a teacher who is a user of the operation instruction client 27 starts a lecture, for example, while presenting distributed hypertext to a student who is a user of the operated instruction client 28, first, the teacher operates Using the user interface of the instruction client 27,
Select the linked state. Thereby, the interlocking instruction is internally selected by the state selecting means 35 (step S1).
04, S105). Next, the operation instruction client 27
Issues an interlocking instruction to all operated instruction clients 28 by the interlocking instruction means 31 (step S10).
6). The operated instruction client 28 that has received the linking means 32 brings the distributed hypertext viewer 2 into the linked state (S107). The operation up to this point (steps S103 to S107) is exactly the same as in the first embodiment. Now, subsequently, the operation instruction client 27 causes the invalidation instruction means 36 to transmit all the operated instruction client 2 through the communication means 3 and the network 6.
Only when it is in the linked state, an invalidation instruction is issued so that the distributed hypertext viewer cannot be operated by itself (step S114). On the other hand, the operation instruction client 27 disables the distributed hypertext viewer 2 by itself only in the interlocking state by the disabling means 37 (step S115).

In this linked state, when the teacher who is the user of the operation instruction client 27 operates the distributed hypertext viewer 2, the hypertext stored in the plurality of servers 4 as shown in the first conventional example. -Accessing the data 5 by itself and displaying the result, the distributed hypertext viewers 2 of all operated instruction clients 28 are linked to the operation, and the operated instruction client 28 itself is operated by the server 4. The same hypertext data 5 is accessed and the distributed hypertext viewer 2 displays the same result. This operation is exactly the same as in the first embodiment. Further, in this interlocking state, the student cannot move or return to his / her distributed hypertext without the instruction of the teacher (step 116). The operation of shifting from the linked state to the non-linked state (steps S109 to S113) is the same as that in the first embodiment.

Next, the invalidation instruction issued from the operation instruction client 27 shown in FIG. 16 and the invalidation operation processing of the non-instruction instruction client 28 which received it (step S
114, S115) will be described in detail with reference to FIGS. 17 and 18. FIG. 17 is a detailed block diagram of FIG.
Shows the details of the processing.

After step S107 shown in FIG. 16, the invalidation instructing means 36 of the operation instructing client 27 sets the variable N
After setting 1 to 1 (S380), start / end instruction means 2
9 own client name (operation instruction client name) 220, operated instruction client 2
8 is a command (invalidation command) that prevents the user from operating his / her distributed hypertext viewer 2 by himself.
The Nth client name registered in the valid client name registration table 222 stored in the activation / termination instruction means 29 is broadcast to all operated instruction clients 28 on the network (S381).

At this time, the operated instruction client 28
The operation instruction client 27 is waiting for an instruction (step S382). The invalidation means 37 of the operated instruction client 28 compares whether or not the broadcasted data has been sent to itself by comparing the sent operated instruction client name with the own client name 223. To do. As a result, if it has not been sent to itself, the process returns to the instruction waiting state step S382, and if it has been sent to itself, proceeds to the next step (S).
383). Next, it is determined whether the broadcasted data is from a pre-registered operation instruction client (step S384), and a command for setting the operation of the distributed hypertext viewer 2 to the invalid state. Whether or not (step S385) the current state is the interlocking state (step S386) is checked. If not, the process returns to the instruction waiting state (step S382). If all of these conditions are satisfied, the distributed hypertext viewer 2 of itself is set in a state in which it cannot be operated by itself (step S387). Then, the operation instructing client 27 is notified that the setting process is completed (step S388). After that, the operation instruction client 27 shifts to the next instruction waiting state (step S382).

The operation instruction client 27 executes step S
After 381, it is checked whether the invalidation state setting completion notification has arrived from the operated instruction client 28 (step S389). If the completion notification has arrived, the process proceeds to the next step. Otherwise, until the completion notification arrives. Keep waiting Then, if all the client names registered in the valid client name registration table 222 have been broadcast (step S390), the invalidation state setting process ends. If not, N is incremented by 1 and the processing from step S381 is continued.

Now, FIG. 19 shows an operation example of the operated instruction client 28 after the invalidation state setting process is completed as described above. When the anchor displayed on the distributed hypertext viewer 2 is clicked on the operated instruction client 28 (step S400),
It is checked whether or not it is in the linked state and the disabled state (step S401), and if so, the anchor click operation is ignored and nothing is done (step 402). As a result, in the linked state and the invalidated state, all operations of the distributed hypertext viewer 2 follow the operation instruction client 27. If the linking state and the invalidation state are not established, the anchor click is accepted and the link destination node is accessed (step S403). This operation is individually performed for each operated instruction client 28.

Embodiment 3 FIG. In the present embodiment, when a collaborative work is performed between users who have a relationship such as an instructor and an audience like a relationship between a teacher and a plurality of students, using distributed hypertext, the first embodiment or the second embodiment. 2 is an example of a distributed hypertext system capable of independently managing the past node history traced by the instructor or the node history traced by each listener. This embodiment will be described with reference to FIG.

FIG. 20 shows distributed hypertext of the operation instruction client 27 and the operated instruction client 28.
3 is a block diagram showing an internal structure of a portion of the viewer 2 relating to the present invention, and other configurations are similar to those of the first or second embodiment. 9 is the same as the first example of the conventional example, and the hypertext viewers 2 which the distributed hypertext viewer 2 has accessed in the past, respectively.
The node information history table which records the node name 10 of the data 5 in a time order is shown. Reference numeral 38 denotes an instruction flag indicating whether the node name indicating the link destination is the node name moved according to an instruction from the operation instruction client or the node name moved according to its own instruction.
In the case, 1 indicates the node name moved by the instruction from the operation instruction client, and 0 indicates the node name moved by the instruction of itself. 39, based on the link corresponding to the node name traced in the past, traverses the node history 40 traced according to the instruction of the operation instruction client, or traverses the node history 41 traced according to its own instruction, Further, the history switching means for selectively switching whether the link 42, which does not distinguish between the two, is to be moved.

Next, the operation of the distributed hypertext viewer 2 of the operated instruction client 28 will be described with reference to FIG. It is assumed that the current state has just changed to the linked state shown in the first embodiment. When the node name 201 to be displayed is designated by text input or a graphical user interface or the like, the corresponding node data stored in the server 4 is read out and displayed on the distributed hypertext viewer 2. At the same time, the node name 201 is recorded in the link information history table 9. Furthermore, the node displayed at this time is in the linked state at that time, so the operation instruction client 27
The instruction flag 38 is set to 1. Similarly, if the node name 202 and the node name 203 are continuously accessed and displayed in the linked state, the relationship between the link information history table 9 and the instruction flag 38 is as shown in FIG. 20 (up to the node name 203). This relationship is the same for all operated instruction clients 28.

Immediately after accessing the node name 203, it is assumed that the node name 203 is brought into the non-linked state. Node name 2 to display next
When 04 is designated, the node data corresponding to it stored in the server 4 is read out and displayed on the distributed hypertext viewer 2 as in the above. At the same time, the node name 204 is recorded in the link information history table 9. Furthermore, the node displayed at this time is
Since the state at that time is the non-interlocking state, the operated instruction client 28 has instructed by itself, and the instruction flag 38 is set to 0. The node name at this time is different for each other operated instruction client 28.

Similarly, assuming that the node 210 is accessed and displayed, the relationship between the node information history table 9 and the instruction flag 38 is as shown in FIG. 20 (node name 210
Until). Now, in this state, the operated instruction client 2
When 8 users traverse the node history that was traced in the past using the distributed hypertext viewer 2, 39:
According to the value of the instruction flag, three types of node history 40, 4
1, 42 are generated, and the user can selectively select any one of them. With this mechanism, for example, it is possible to reproduce the distributed hypertext that the teacher explained and displayed during the lecture and the distributed hypertext that was operated by himself / herself in a non-interlocking state such as an exercise or a combination of both. Other operations are the same as those in the first or second embodiment, and will not be repeated.

Embodiment 4 According to the present embodiment, when a collaborative work is performed between users who have a relationship such as an explainer and an audience, such as a relationship between a teacher and a plurality of students, by using the distributed hypertext, the first embodiment or the second embodiment. In the invention shown in 1, the distributed hypertext system is an example of a distributed hypertext system capable of performing hypertext display control or link control according to the user of the distributed hypertext. This embodiment will be described with reference to FIG.

FIG. 21 is a block diagram showing a portion for performing hypertext display control or link control according to a user of the distributed hypertext. The configuration of the other parts is similar to that of the first or second embodiment, and will not be described. In FIG. 21, 43 is 1
The hypertext data for the node is shown and described in the hypertext markup language. Also, 4
Reference numeral 4 denotes a data block capable of displaying (display control) or validating an anchor (link control) by the viewer only when the distributed hypertext viewer 2 of the operation instruction client 27 accesses this portion.
Is a data block that can be display-controlled or link-controlled by the viewer only when the distributed hypertext viewer 2 of the operated instruction client 28 accesses this part. 46 is a display control that is accessed by any client. , Or a data block that can be link-controlled. Reference numeral 47 is a data block management identification means for analyzing the contents of the hypertext data when accessing the hypertext data 5 of the server and determining which data block is included.
Is a display / link control determining means for determining whether the block determined by 47 is display control or link control by itself, and 49 is a display / link for executing display control or link control corresponding to the determination result. The control execution means is shown.

First, an operation example of the operation instruction client 27 will be described. When the user of the operation instruction client 27 specifies and accesses the distributed hypertext node 43 using the distributed hypertext viewer 2, the hypertext node 43 manages the data block via the communication means 3 and the network 6. Identification means 47
Is read in. The data block management identification means 47
This data is analyzed and, for example, as shown in FIG. 21, the data block 1 (44), the data block 2 (45), and the data block 3 (46) are analyzed by the management identifier in the text.
It is configured with. Then, this analysis result is transferred to the display / link control determination means 48, and it is determined that the controllable data blocks are 44 and 46. This result is displayed / link control execution means 49
When delivered and executed, the distributed hypertext viewer 2 displays the data block 1 (44) and the data block 3 (46) in the display format. If there is an anchor indicating that there is a link destination in this displayed data block, this anchor is validated. At this time, the data block 2 (45) is not displayed. Therefore, the anchor in it is also invalid.

Next, an operation example of the operated instruction client 28 will be described. When the user of the operation instruction client 27 in the linked state and the user of the operated instruction client 28 in the non-linked state specify and access the distributed hypertext node 43 using the distributed hypertext viewer 2. , Hypertext node 4
3 is read by the data block management identifying means 47, similarly to the operation instruction client. The data block management identifying means 47 analyzes this data and uses the identifier in the text to identify the data block 1 (4) as shown in FIG.
4) and data block 2 (45) and data block 3
(46) is identified. Then, this analysis result is passed to the display / link control judgment means 48, and further this result is passed to the display / link control execution means 49, and when it is executed, the distributed hypertext viewer 2 receives the data block 2 (45) and the data. Block 3
The display format of (46) is displayed. If there is an anchor indicating that there is a link destination in this displayed data block, this anchor is validated. At this time, the data block 1 (44) is not displayed. Therefore, the anchor in it is also invalid. Other operations are the same as those in the first or second embodiment, and will not be repeated.

Embodiment 5. The present embodiment is a combination of the above-described third and fourth embodiments. That is, in use between a teacher and a plurality of students, each client is provided with a node information history table recorded separately for interlocking / non-interlocking, and a history switching means 39 for selecting either or both of the merged histories, and further the data block identification. Means, determination means for display link control, and execution means are provided.

The operation of the apparatus of this configuration is the same as in the third and fourth embodiments.
Will be a combination of. That is, in the linked state, the linked node history 40 is selected, and the data blocks 2 and 3 are displayed on the operated instruction client. Further, in the non-linked state, the non-linked node history 41 is selected, and the data blocks 2 and 3 are displayed on the operated instruction client. Since the details of the operation have been described in the previous embodiment,
Here, the description is omitted.

Embodiment 6 FIG. According to the present embodiment, when a collaborative work is performed between a teacher and a plurality of students by using distributed hypertext, in the invention described in the first or second embodiment, a linked state or a non-linked state is set. It is an example of a distributed hypertext system capable of performing hypertext display control or link control according to the hypertext.
This embodiment will be described with reference to FIGS. 22 and 23.

22 and 23 are block diagrams of a part for performing hypertext display control or link control according to the state of the distributed hypertext (linked state or non-linked state). In the linked state, respectively. It shows the case of the non-interlocking state. The configuration of the other parts is similar to that of the first or second embodiment, and will not be described.

22 and 23, reference numeral 50 denotes hypertext data for one node, which is described in the hypertext markup language. Also, 51
Is only available when the distributed hypertext viewer 2 of any client accesses this part,
A data block that can be displayed (display control) or enabled by the viewer (link control), 52
Is a data block that can be display-controlled or link-controlled by the viewer only when the distributed hypertext viewer 2 of an arbitrary client accesses it in a non-interlocking state. 53 is accessed from any state. The data block which can be display-controlled or link-controlled is shown. Further, 54 is a data block state identification means for analyzing the contents of the hypertext data when accessing the hypertext data 5 of the server and determining which data block is included, 55
Is a display / link control determining means for determining whether the block determined by 54 is display control or link control by itself, and 56 is a display / link for executing display control or link control corresponding to the determination result. The control execution means is shown.

First, an operation example in the interlocked state will be described with reference to FIG. When the user of the operation instruction client 27 specifies and accesses the distributed hypertext node 50 using the distributed hypertext viewer 2, the hypertext node 50 is read by the data block state identification means 54 of each client. . The data block state identification means 54 analyzes this data and, for example, by the state identifier in the hypertext, the data block 4 (51), the data block 5 (52) and the data block 6 (53) are displayed as shown in FIG. Identify what is configured. Then, this analysis result is transferred to the display / link control determination means 55, and it is determined that the controllable data blocks are 51 and 53 in the current state (interlocking state). When this result is passed to the display / link control execution means 56 and executed, the distributed hypertext
On the viewer 2, the data block 4 (51) and the data block 6 (53) are displayed in the display format. If there is an anchor indicating that there is a link destination in this displayed data block, this anchor is validated. At this time, the data block 5 (52) is not displayed. Therefore, the anchor in it is also invalid.

Next, an operation example in the non-interlocking state is shown in FIG.
It will be described based on. However, this figure shows a case where all the clients access the node 50 of exactly the same hypertext data, although they are in the non-linked state. A user of each client uses the distributed hypertext viewer 2 to create a distributed hypertext node 5
When 0 is designated and accessed, the hypertext node 50 is read by the data block state identification means 54, this data is analyzed, and the data block 4 (51) and the data block 5 (52) are analyzed as shown in FIG. And the data block 6 (53) are identified. Then, this analysis result is passed to the display / link control determination means 55, and further, the display / link control execution means 56.
When it is delivered to the distributed hypertext viewer 2, the data block 5 (52) and the data block 6 (53) are displayed in the display format on the distributed hypertext viewer 2. If there is an anchor indicating that there is a link destination in this displayed data block, this anchor is validated. At this time, the data block 4 (51) is not displayed. Other operations are the same as those in the first or second embodiment, and will not be repeated.

Embodiment 7 This embodiment is a combination of the third and sixth embodiments. That is, in use between a teacher and a plurality of students, each client is provided with node information history tables 40, 41, 42 and history switching means 39, and further, data block identifying means 54, display / link control determining means 55, execution means. 56 are provided.

The operation of the apparatus configured as described above is a combination of the third and sixth embodiments. This has been described in detail in the operation of performing the hypertext display control or the link control according to the state of the distributed hypertext shown in the third and sixth embodiments, and thus the description thereof is omitted here.

Embodiment 8 FIG. The present embodiment is a combination of the previous Embodiments 4 and 6. When a teacher and a plurality of students collaborate using distributed hypertext, the hypertext display control or link according to the linked state or the non-linked state shown in the first or second embodiment is performed. It is a distributed hypertext system that can be controlled. This embodiment will be described with reference to FIGS. 24 and 25.

24 and 25 are hypertext display controls according to the user (user of the operation instruction client or the user of the non-operation instruction client) and the state (the linked state or the non-linked state) of the distributed hypertext. FIG. 3 is a block diagram of a part that performs link control, and shows a case of a linked state and a case of a non-linked state, respectively.

In FIGS. 24 and 25, 57 indicates hypertext data for one node. 44, 45,
51 and 52 are the same as the data blocks shown in the fourth and sixth embodiments. Reference numeral 58 is a data block for analyzing the content of the hypertext data when accessing the hypertext data 5 of the server and determining which kind of data block from the data block 1 to the data block 6 is included. The identification means, 59, is a display / link control determination means, 60 for determining whether the block determined by 58 can be display-controlled or link-controlled by itself, or whether it can be display-controlled or link-controlled in the current state. , Display that executes display control or link control corresponding to this judgment result /
The link control execution means is shown.

First, an operation example in the interlocked state will be described with reference to FIG. When the user of the operation instruction client 27 specifies and accesses the distributed hypertext node 57 using the distributed hypertext viewer 2, the node 57 is read by the data block identification means 59 in the operation instruction client 27, The data block identification means 59 analyzes this data, and based on the identifier in the data, the data block 1 (4
4), data block 2 (45), data block 4
(51) and the data block 5 (52) are identified. This analysis result is passed to the display / link control determination means 59, and 51 data blocks are controllable in the current state (interlocking state), and 44 data blocks are controllable by themselves (the operation instruction client 27).
Determine that. When this result is passed to the display / link control execution means 59 and executed, it is displayed on the distributed hypertext viewer 2 in the display format of the data block 1 (44) and the data block 4 (51). If there is an anchor indicating that there is a link destination in this displayed data block, this anchor is validated. At this time, the data block 2 (45) and the data block 5
(52) is not displayed. Therefore, the anchor in it is also invalid.

Now, in the non-operation instruction client 28,
The node 57 is read by the data block identification means 59, this data is analyzed, and as shown in FIG. 24, the data block 1 (44), the data block 2 (45), the data block 4 (51) and the data block 5 are analyzed. (52) is identified. The analysis result is passed to the display / link control determination means 59, and it is determined that the data block that can be controlled in the linked state is 51 and the data block that can be controlled by the operated instruction client 28 is 45, and the display / link is performed. The data block 2 (45) and the data block 4 (5) are transferred to the control execution means 59.
It is displayed in the display format of 1). If there is an anchor indicating that there is a link destination in this displayed data block, this anchor is validated. At this time, the data block 1 (44) and the data block 5 (52) are not displayed. Therefore, the anchor in it is also invalid.

Next, an operation example in the non-interlocking state is shown in FIG.
It will be described based on. However, this figure shows a case where all clients access the node 57 of the exact same hypertext data, although they are in the non-linked state. A user of each client uses the distributed hypertext viewer 2 to create a distributed hypertext node 5
When 7 is specified and accessed, the operation instruction client 2
At 7, the node 57 is read by the data block identification means 58, this data is analyzed, and as shown in FIG. 25, the data block 1 (44) and the data block 2 (4).
5), data block 4 (51) and data block 5
(52) is identified. This analysis result is passed to the display / link control determination means 59, and it is determined that the controllable data block is 52 in the non-interlocking state and the controllable data block is 44 in the operated instruction client 28. It is passed to the display / link control execution means 60 and displayed in the display format of the data block 1 (44) and the data block 5 (52). If there is an anchor indicating that there is a link destination in this displayed data block, this anchor is validated. At this time, the data block 2 (45) and the data block 4
(51) is not displayed.

Now, in the non-operation instruction client 28,
The node 57 is read by the data block identification means 59, this data is analyzed, and as shown in FIG. 24, the data block 1 (44), the data block 2 (45), the data block 4 (51) and the data block 5 ( 52) is identified. Then, similar to the above-described operation, the distributed hypertext viewer 2 displays the data blocks 2 (45) and 5 (52) in the display format. The same applies to valid / invalid of the following anchors.

Embodiment 9 FIG. The present embodiment is a combination of the third, fourth and sixth embodiments. That is, in use between a teacher and a plurality of students, each client is provided with node information history tables 40, 41, 42 and history switching means 39, and further, data block identifying means 58, display / link control determining means 59, and executing means. 60 is provided.

The operation of the apparatus configured as described above is the same as in the third embodiment.
4 and 6, that is, the third and eighth embodiments are combined. This has been described in detail in the operation of performing the hypertext display control or the link control according to the user and the state of the distributed hypertext shown in the third and eighth embodiments, and thus the description thereof is omitted here. To do.

[0085]

As described above, according to the present invention, the means for switching between the linked state in which the distributed hypertexts are simultaneously shared among a plurality of clients and the non-shared non-linked state in which individual operations can be performed are provided. It has the effect that you can freely participate in lessons and presentations with simple operations, and that you can continuously conduct voluntary exercises.

Furthermore, in the interlocked state, since the listener has added a disabling instruction means that cannot operate his / her distributed hypertext viewer without the permission of the explainer, the explainer concentrates on the explanation to the listener. There is an effect that can be.

Furthermore, since means for independently managing the past node history instructed by the explainer in the interlocked state and the past node history by each operation in the non-interlocked state is added, the hypertext in the explanation by the explainer is added. There is an effect that the text can be easily reproduced and the hypertext can be easily reproduced by the listener's own operation.

Furthermore, by providing a data block that can be instructed and displayed only by a specific client, it is possible to collectively perform distributed hypertext node description according to the user, and display control and link control thereof are special. Since it is configured so that it can be performed without any operation, it is not necessary to manage the node for each user, and its display is also automatically distinguished, which makes it easy to create, manage and operate hypertext data. is there.

Furthermore, a data block which can be instructed and displayed separately according to the linked state and the non-linked state of the distributed hypertext is provided, whereby the node description can be collectively performed and its display control and link control can be performed. Since it is configured so that it can be performed without any special operation, it is not necessary to manage a node for each operating state of each distributed hypertext, and its display is automatically distinguished.
There is an effect that data can be easily created, managed and operated.

[Brief description of the drawings]

FIG. 1 is a configuration diagram showing a system including a distributed hypertext control device according to a first embodiment of the present invention.

FIG. 2 is a flowchart diagram of start-up and end operations of the system of FIG.

3 is a flow chart diagram of interlocking operation and non-interlocking operation of the system of FIG.

FIG. 4 is a diagram for explaining the operation of the activation / termination instruction means and the activation / termination means of FIG.

FIG. 5 is a flow chart of the starting operation of the means shown in FIG.

FIG. 6 is a flowchart of the ending operation of the means of FIG.

FIG. 7 is a diagram showing an example of one node of hypertext data.

FIG. 8 is a diagram showing an example of a node displayed by a hypertext viewer.

FIG. 9 is a diagram showing another example of a screen that is further pulled out by an anchor from FIG.

10 is a diagram for explaining the operation of the interlocking / non-interlocking instruction means and the interlocking / non-interlocking means of FIG.

FIG. 11 is a flowchart of the interlocking operation of the means of FIG.

FIG. 12 is a flowchart of an operation in which a corresponding screen is displayed on the client by an anchor operation during interlocking with the device of FIG.

FIG. 13 is a hypertext display during interlocking with the device of FIG.
It is a figure explaining a mode that data is processed.

FIG. 14 is a hypertext display during interlocking with the device of FIG.
It is a flowchart figure of operation | movement by which data is processed.

FIG. 15 is a configuration diagram showing a system including a distributed hypertext control device according to a second embodiment of the present invention.

FIG. 16 is a flow chart diagram of interlocking operation and non-interlocking operation according to the second embodiment of the present invention.

FIG. 17 is a diagram for explaining the operation of the invalidation instruction means and the invalidation means of FIG.

FIG. 18 is a flowchart of the invalidation instruction and invalidation processing operation of the invalidation means in FIG. 17;

19 is an operation flowchart of the operated instruction client after the processing in FIG.

FIG. 20 is a configuration diagram showing a system including a distributed hypertext control device according to a third embodiment of the present invention.

FIG. 21 is a configuration diagram showing a system including a distributed hypertext control device according to a fourth embodiment of the present invention.

FIG. 22 is a configuration diagram showing a system including a linked hypertext control device according to a sixth embodiment of the present invention.

FIG. 23 is a configuration diagram showing a system including a distributed hypertext control device in a non-linked state according to the sixth embodiment of the present invention.

FIG. 24 is a configuration diagram showing a system including a linked hypertext control device according to an eighth embodiment of the present invention.

FIG. 25 is a configuration diagram showing a system including a distributed hypertext control device in an unlinked state according to the eighth embodiment of the present invention.

FIG. 26 is a configuration diagram of a first distributed hypertext system of a conventional example.

FIG. 27 is a configuration diagram of a second application sharing system of a conventional example.

FIG. 28 is a configuration diagram of a third hypertext system of a conventional example.

FIG. 29 is an explanatory diagram showing a problem of the third hypertext system of the conventional example.

[Explanation of symbols]

1 client workstation, 2 distributed hypertext viewer, 3 communication means, 4 server workstation, 5 hypertext data, 6
Network, 7 node, 8 link, 9 node information table, 10 node name, 27 operation instruction client, 28 operated instruction client, 29 activation / termination instruction means, 30 activation / termination means, 31 interlocking instruction means, 32 interlocking means means , 33 non-interlocking instruction means, 34
Non-interlocking means, 35 state selecting means, 36 invalidation instructing means, 37 invalidating means, 38 instruction flag, 39 history switching means, 44 data block 1, 45 data block 2, 46 data block 3, 47, 54, 58
Data block identification means, 48, 55, 59 display / link control determination means, 49, 56, 60 display / link control execution means, 51 data blocks 4, 52 data blocks 5, 53 data blocks 6.

Claims (8)

[Claims] 1. A server storing hypertext data distributed and arranged via a network, a communication means for communicating the hypertext with another client, and a hypertext for operating and displaying the hypertext. The viewer and the start / end means to specify the start / end of the above hypertext on the client, and whether the above hypertext is to be operated and displayed in common with other clients, or to be released as an independent operation and displayed. A distributed hypertext control device with interlocking / non-interlocking means to specify. 2. The activation / termination means for instructing activation / termination of hypertext is
As a means for instructing start / end to another client, the other client starts / stops its own hypertext based on the start / end instruction from the specific client.
The distributed hypertext control device according to claim 1, wherein the distributed hypertext control device is terminated. 3. The interlocking / non-interlocking means for instructing hypertext interlocking / non-interlocking is a interlocking / non-interlocking instructing means for another client in a specific client, and the other client is the specific client. 2. The distributed hypertext control device according to claim 1, wherein the hypertext is linked / unlinked based on a linked / unlinked instruction from the user. 4. The invalidation instruction means for invalidating the operation of the hypertext viewer in another client is added to the specific client, and the other client is based on the invalidation instruction from the specific client. 2. The distributed hypertext control device according to claim 1, wherein the operation of the hypertext viewer in the linked state is invalidated. 5. A node information history table in which a history of hypertext data accessed by its own hypertext viewer is recorded in the order of access, and linked / unlinked, and linked / unlinked of the node information history table,
2. The distribution according to claim 1, further comprising: history switching means for selecting whether to merge the two and hypertexts are sequentially displayed based on the history of the node information history table selected by the history switching means. Hypertext controller. 6. A hypertext data has a link specified, and a management identifier is provided to distinguish a data block that can be accessed only by a specific client and a data block that can be commonly accessed by all clients. Is a data block management identification means for identifying the management identifier of the data block, and a display / link for displaying a necessary data block based on the link designation in the identified accessible data block.
2. The distributed hypertext control device according to claim 1, further comprising a link control determination / execution unit. 7. The hypertext data has a link specified, and includes a data block that can be accessed only in a linked state, a data block that can be accessed only in a non-linked state, and a data block that can be accessed in either state. A status identifier for distinguishing is provided, and each client has a data block status identification means for identifying the status identifier of the data block, and a display of a necessary data block based on the link designation in the identified accessible data block. Display that links
2. The distributed hypertext control device according to claim 1, further comprising a link control determination / execution unit. 8. A hypertext data link is specified, a data block that can be accessed only by a specific client, a data block that can be commonly accessed by all clients, and a data block that can be accessed only in a linked state. An identifier for distinguishing the data block that can be accessed only in the non-linked state is provided, and each client has a data block identifying means for identifying the identifier of the data block, and a link designation in the identified accessible data block. A display / link control determination / execution unit for displaying / linking a required data block based on the above is provided.
A distributed hypertext control device as described.