Interactive programming method
Abstract
A PROGRAMMING METHOD OF AN INTERACTIVE SCENARIO IN MULTIPIST STORAGE MEDIA (4) IS DESCRIBED. THE INTERACTIVE SCENARIO INCLUDES A NUMBER OF TIMELY SYNCHRONIZED BOXES IN SEPARABLE DATA CURRENTS RELATED BETWEEN BY THEIR CONTENT. THE INTERACTIVE SCENARIO IS PLAYED IN AN APPLIANCE (2) THAT INCLUDES A MEANS TO SELECTLY RECOVER THE DATA CURRENTS AT A GIVEN MOMENT. A DECISION MAKING OBJECTIVE IS DEFINED FOR THE INTERACTIVE SCENARIO. ONCE THE OBJECTIVE HAS BEEN DEFINED, A SET OF RULES ARE DEVELOPED, PREFERIBLY USING THE KNOWLEDGE OF AN EXPERT, WHICH CONDUCT THE DEFINED OBJECTIVE. THESE RULES ARE RELATED HIERARCHICALLY, SO THE CONCLUSIONS OF AT LEAST SOME OF THE RULES ARE PREMISES TO OTHERS. IN ADDITION, THE RULES ARE LOGICALLY RELATED, SO THE CONCLUSION OF A RULE OR FINAL RULES CORRESPONDS TO THE DECISION MAKING OBJECTIVE. IF THE RULES REQUIRE AWARDS THAT HAVE TO BE OBTAINED, QUESTIONS ARE ASKED TO INTERACTIVELY ASK ABOUT THE PREMISES.

Term
Term ended
Projected expiry passed 22 September 2015, 11 years ago.
- Priority
- Filed
- Published
- Projected expiry
- Today
10 claims: 5 independent, 5 dependent
- 1ES 2 201 118 T3 REIVINDICACIONES 1. Un método para proporcionar programas interactivos basados en sistemas expertos a un terminal interactivo de forma tal que se consigue un alto nivel de respuesta en conversación y de interactividad, comprendiendo el método:definir (10) un objetivo para el programa basado en sistema experto;desarrollar reglas (12) que conduzcan al objetivo definido, comprendiendo las reglas al menos una premisa y una conclusión, por las que las reglas están relacionadas jerárquicamente entre sí en cuanto que una conclusión de al menos una de las reglas es una premisa de otra regla;formar preguntas (13) correspondiendo cada pregunta a una premisa que requiere una respuesta del usuario para determinar la existencia de la premisa;establecer un mapa de correspondencia entre las preguntas y las reglas con una pluralidad de cadenas de datos para generar un programa interactivo (15), conteniendo la pluralidad de cadenas de datos unas tramas, y estando las tramas sincronizadas en tiempo entre las cadenas de datos y conteniendo al menos una trama (200) que contiene una parte (210) de información y una parte (220) de órdenes;y almacenar las cadenas de datos (16) en un medio de almacenamiento interactivo de forma tal que el programa interactivo basado en sistemas expertos sea recuperable para proporcionarlo a un terminal interactivo.
- 2Un método como se reivindica en la reivindicación 1, que comprende además:trasladar las preguntas y reglas a un diagrama (14) de árbol jerárquico, en el cual las reglas están organizadas lógicamente y relacionadas entre sí utilizando ramas;establecer un mapa de correspondencia entre el diagrama del árbol jerárquico y una pluralidad de cadenas de datos (101-105) para generar el programa interactivo, estando establecida la correspondencia del diagrama del árbol jerárquico y la pluralidad de cadenas de datos en una secuencia predeterminada y teniendo cada cadena de datos una o más tramas (200) relacionadas en contenido, donde las tramas representan e implantan completamente las ramas del diagrama de flujo jerárquico.
- 3Un método como se reivindica en la reivindicación 1 o la reivindicación 2, en el que el programa interactivo basado en sistemas expertos es proporcionado a un terminal interactivo utilizando una o más cadenas de datos asignadas dinámicamente con el fin de conservar la capacidad de canales, comprendiendo además el método:identificar un número de cadenas de datos (101) que han de transmitirse durante un intervalo (T0-T1) de trama, correspondiendo el número al número de tramas sincronizadas en el tiempo durante el intervalo de trama que contiene una parte de información y una parte de órdenes;transmitir el número identificado de cadenas de datos dinámicamente durante un intervalo de trama en curso por un medio interactivo a un terminal interactivo, donde solamente son transmitidas aquellas cadenas de datos que tienen una trama con una parte de información y una parte de órdenes, durante el intervalo de trama en curso.
- 4Un método como se reivindica en cualquier reivindicación precedente, en el que algunas de las tramas contienen partes de información y partes de órdenes, y otras de las tramas contienen segmentos de sincronización del programa, comprendiendo además el método:plegar las tramas que contienen partes de información y partes de órdenes de al menos una cadena de datos en las tramas de otras cadenas de datos que contienen solamente segmentos de sincronización del programa, donde el número total de cadenas de datos requeridas se reduce para incluir al menos una cadena de datos compactada;y almacenar el número reducido de cadenas de datos, incluyendo la cadena de datos compactada, en el medio de almacenamiento interactivo.
- 5Un método para recibir un programa interactivo basado en sistemas expertos en un terminal interactivo, comprendiendo el programa interactivo una pluralidad de cadenas de datos (101-105), comprendiendo el método:recibir la pluralidad de cadenas de datos, teniendo cada una de las cadenas de datos una pluralidad de tramas (200) sincronizadas en tiempo, donde cada trama contiene reglas y preguntas incrustadas del sistema experto, estando las reglas relacionadas jerárquicamente entre sí y comprendiendo al menos una premisa y una conclusión;seleccionar una trama de una sola cadena de datos de la pluralidad de cadenas de datos proporcionadas utilizando un selector (3) de señales de señales, por lo que la trama seleccionada comprende una pregunta;ES 2 201 118 T3 presentar la pregunta al usuario a través de un dispositivo interactivo (9) de salida;recibir una entrada del usuario como respuesta a la pregunta presentada;determinar una trama siguiente jerárquicamente relacionada con la trama seleccionada, estando basada la siguiente trama determinada en la entrada recibida del usuario y en la trama seleccionada;y obtener la trama siguiente utilizando un selector de señales, donde la trama siguiente contiene otra pregunta o una conclusión para una regla del sistema experto.
- 6Un método como se reivindica en la reivindicación 5, en el que el paso de obtener la trama siguiente comprende:interpretar la entrada del usuario recibida y la trama seleccionada para asegurarse de la situación de la trama siguiente;elegir una cadena de datos que corresponda a la situación interpretada, donde la cadena de datos seleccionada es elegida a partir de la pluralidad de cadenas de datos (101-105) que incluye la cadena de datos única.
- 7Un terminal interactivo para recibir un programa interactivo basado en sistemas expertos, comprendiendo dicho terminal interactivo:medios (2) para recibir una o más cadenas de datos, teniendo cada una de las cadenas de datos una pluralidad de tramas sincronizadas en el tiempo que comprenden premisas, preguntas y conclusiones que representan reglas de una base de reglas jerárquicas, estando formada la base de reglas jerárquicas de manera que al menos una premisa de una regla es una conclusión de otra regla;un selector (3) de señales para seleccionar una trama entre las cadenas de datos suministradas, donde la trama seleccionada comprende instrucciones que indican una pregunta;medios (7) para recibir la trama seleccionada y generar una pregunta interactiva basada en las instrucciones de la trama recibida;un dispositivo interactivo (9) de salida para presentar al usuario la pregunta generada;medios (6) para recibir una entrada del usuario como respuesta a la pregunta interactiva generada;y medios que utilizan el selector de señales para obtener una trama siguiente a partir de la cadena de datos suministrada, donde la trama siguiente contiene otra pregunta o una conclusión a una regla del sistema experto.
- 8Un terminal interactivo como se reivindica en la reivindicación 7, que comprende además:medios (5) de almacenamiento para almacenar cadenas de datos interactivos, estando compuestos los datos interactivos almacenados por unas tramas sincronizadas en el tiempo que comprenden premisas, preguntas y conclusiones que representan reglas de una base de reglas jerárquicas, estando formada la base de reglas jerárquicas de manera que al menos una premisa de una regla es una conclusión de otra regla;recibiendo dichos medios (7) una trama seleccionada por dicho selector (3) de señales o bien una trama de dichos medios (5) de almacenamiento, y generando la pregunta interactiva basándose en las instrucciones de la trama recibida.
- 9Un terminal interactivo como se reivindica en la reivindicación 7 o la reivindicación 8, en el que dichos medios (7) para generar una pregunta comprenden unos medios de almacenamiento para almacenar al menos una o más preguntas.
- 10Un terminal interactivo como se reivindica en cualquiera de las reivindicaciones 7 a 9, que comprende además un procesador, conectado a dichos medios receptores (7) para interpretar la trama recibida y ejecutar las instrucciones contenidas en la trama recibida. NOTA INFORMATIVA:Conforme a la reserva del art. 167.2 del Convenio de Patentes Europeas (CPE) y a la Disposición Transitoria del RD 2424/1986, de 10 de octubre, relativo a la aplicación del Convenio de Patente Europea, las patentes europeas que designen a España y solicitadas antes del 7-10-1992, no producirán ningún efecto en España en la medida en que confieran protección a productos químicos y farmacéuticos como tales. Esta información no prejuzga que la patente esté o no incluida en la mencionada reserva.
Independent claims10
607 paragraphs in 24 sections, as filed
ES 2 201 118 T3
DESCRIPTION
Interactive programming procedure.
The present invention relates to a method for providing interactive programs based on expert systems and to a method and an interactive terminal for receiving interactive programs based on expert systems.
"Interactive" systems are known in the art, particularly in the context of interactive television or telephone systems. In most cases, the “interactivity” provided by these systems allows the user of the system to control what is seen or heard on the system by pressing buttons on a bidirectional controller or a touch-tone keypad. However, these systems provide only a low level of response to the conversation.
Systems that emulate interactive conversation are also known in the art. These systems use a variety of different techniques to achieve interactive conversation, and have typically had limited success in conversations that were more than just question and answer sessions. In the context of multiple-choice response systems for children, there are examples of such systems in US Patent Nos. 2,921,385; 3,020,360; 2,826,828; 3,623,238; 3,546,791; 3,273,260; 3,665,615; 3,245,157; 3,284,923; 3,538,621; 3,477,144; 3,708,891; 3,255,536; 2,777,901; 2,908,767; 3,774,316; 3,194,895; 3,484,950; 3,343,280 and 3,763,577, for example.
Various interactive television systems have also been developed. For example, US Patent Nos. 4,264,924, 4,264,925 and 4,507,680 disclose interactive cable television systems. US Patent No. 5,585,858 describes an interactive system that is usable by both conventional viewers and interactive viewers. Other examples of television using interactivity are described in US Patent Nos. 4,602,279; 4,847,700; 4,573,072; 4,847,698; 4,847,699 and 4,918,516, for example. These systems generally require a separate microprocessor to perform selection and memory functions and are not concerned with expert systems analysis.
Although such prior systems have the flexibility and memory characteristics to establish customized interactive environments, they do not provide interactive programming that allows the programming of complex, media-independent interactive conversations in which the interactive conversation includes expert analysis of user-specific problems, for example , financial analysis services, document creation point of sale marketing systems, etc.
Some of these systems that are capable of expert analysis are known in the computer field as rule-based expert systems. In a rule-based expert system, a knowledge base provides expert-quality solutions to problems in a specified area. Generally, the information in the knowledge base is drawn from human experts and the system tries to emulate their problem solving methodology. With their inherent limitations (see "Computer Engineering Handbook" or "Computer Engineering Handbook" by CH Chen, Editor, McGraw-Hill, Inc. pages 9.1-9-35), such systems are useful for expert analysis in certain situations. These expert systems have not been implemented on an interactive basis to a large audience.
EP-A-0460867 provides an expert system in a computer terminal that uses multimedia to present information and receive commands from the user. This expert system is primarily designed to help a person perform equipment maintenance tasks.
What is needed is a system that can take interactive systems to the next level, a level that allows for a more complex and therefore meaningful conversation and interaction between the system and the user. Such a system would perform expert analysis and would be usable by a large number of people simultaneously and would not be limited to any particular transmission technology.
According to a first aspect of the present invention, a method is provided for delivering interactive programs based on expert systems to an interactive terminal such that a high level of response in conversations and interactivity is achieved, the method comprising:
define a goal for the expert system program;
developing rules that lead to the defined goal, the rules comprising at least one premise and one conclusion by which the rules are hierarchically related to each other in that a conclusion of at least one of the rules is a premise of another rule;
form questions, each question corresponding to a premise that requires a user response to determine the existence of the premise;
establish a correspondence map between the questions and the rules in a plurality of data strings to generate an interactive program, the plurality of data strings containing frames, being synchronized
ES 2 201 118 T3 the frames in time between the data streams and at least one of the frames containing an information part and a command part; and storing the data strings in an interactive storage medium such that the interactive program based on expert systems is retrievable to be provided to a computer terminal.
The invention also extends to a method for receiving an interactive program based on expert systems in an interactive terminal, the interactive program comprising a plurality of data strings, the method comprising:
receive the plurality of data chains, each data chain having a plurality of frames synchronized in time, where the frames contain embedded rules and questions from the expert system, the rules being hierarchically related to each other and comprising at least one premise and one conclusion ;
selecting a frame from a single data string of the plurality of provided data strings using a signal selector, whereby the selected frame comprises a question; presenting the question to a user through an interactive output device;
receive user input in response to the question presented;
determining the next frame hierarchically related to the selected frame, the next determined frame being based on input received from the user and the selected frame; and get the next frame using the signal selector, whereby the next frame contains another question or a conclusion for an expert system rule.
According to a further aspect of the present invention, an interactive terminal is provided for receiving an interactive program based on expert systems, said interactive terminal comprising:
means for receiving one or more data strings, each data string having a plurality of time-synchronized frames comprising premises, questions and conclusions representing rules of a hierarchical rule base, the hierarchical rule base being formed such that at least one premise of one rule is a conclusion of another rule;
a signal selector for selecting a frame from the provided data strings, wherein the selected frame comprises instructions indicating a question;
means for receiving the selected frame and generating an interactive question based on the instructions of the received frame;
an interactive output device for presenting the generated question to a user;
means for receiving an input from the user in response to the generated interactive question; and means using the signal selector to obtain a next frame from the provided data stream, where the next frame contains another question or a conclusion to an expert system rule.
The embodiments of the invention allow the preparation and presentation of an interactive scenario comprising a plurality of time-synchronized separable data strings that are related in content to one another. The data strings can be broadcast on a transmission medium or stored on a storage medium. The interactive scenario is designed for playback on an apparatus comprising means for selectively retrieving the data streams from the storage medium or the transmitted signal; the selected data strings are chosen as a result of expert analysis.
In the scheduling method, a decision-making objective is defined for the interactive scenario. This can be, for example, diagnosing a problem, or creating a document based on information entered by a user. Once the objective is defined, a set of rules is developed that will logically lead to the defined objective. Each rule has one or more premises and a conclusion. Rules are hierarchically related in that the conclusions of at least one of the rules are premises for other rules. Furthermore, the rules are logically related to the objective in that the conclusion of at least one of the rules corresponds to the decision-making objective.
Usually the premises of the rules are translated into questions; that are presented to the user. Questions can be multiple-choice, true-false, or in short answer form. However, premises that are not dependent on the user (that is, those determined by the conclusions of one or more rules) do not need to be translated into questions because user responses are unnecessary.
ES 2 201 118 T3
From the hierarchical rules and questions (if necessary), a hierarchical tree can be created to implement the rules. The hierarchical tree contains branches that are dependent on the answer to a question asked of the user or the existence of a premise.
A correspondence map is established between the hierarchical tree and a plurality of time-synchronized frames, located in a plurality of data strings. Preferably, each frame has an information field corresponding to a question, a premise, a conclusion, an informational message, or combinations thereof. A command part of each frame may contain frame identification data and information relating to the rule. This information may instruct the interactive terminal to switch to certain strings depending on the user's response, it may instruct the interactive terminal to store and / or perform functions on a variable, or it may contain a software instruction for the interactive terminal. Each frame preferably comprises a complete message that provides a response corresponding to the string selection. Alternatively, the frames may refer to internal or external storage available to the interactive terminal containing pre-stored messages.
In one embodiment, the frames are placed in the chains in a predetermined sequence according to the hierarchical tree to provide a continuous flow of interactive conversation to ultimately achieve the decision-making goal. An information part of some of the frames contains questions requesting interactive answers from the user. The user's interactive responses correspond to other associated frames that contain additional questions, premises or conclusions related to previously presented questions.
In the simplest embodiment, the placement of the frames in the data streams corresponds to the hierarchical tree. Because the structure of the program may not necessarily require the use of all channels at any given time, a dynamic embodiment is disclosed that dynamically varies the number of channels in use based on the needs of the expert analysis embedded in the program. In a further embodiment, chain switching commands and efficient frame placement preserve channel capacity by making frame locations correspond to "folded" branches of the hierarchical tree. This results in a system with fewer branches of the hierarchical tree and therefore fewer data strings.
The data strings that contain the frames are stored in a storage medium, thus preserving the hierarchical interactive scenario for future evocation and presentation. When the hierarchical interactive scenario is to be presented, the storage medium recalls the stored data strings and provides them to an interactive terminal sequentially at frame intervals. In a preferred embodiment, the storage medium provides only the data strings containing useful information, thus dynamically allocating the data strings. The interactive terminal collects one frame at a time from the supplied data strings and interactively presents the questions, conclusions, or informational messages contained in the collected frame to one or more users. Users respond to questions by entering a response, which is interpreted by the interactive terminal in conjunction with the command portion of the collected frame. The interactive terminal will continue with the interactive presentation using the result of the interpretation to obtain the next frame of the same, or different, data string, according to the command part of the collected frame. The user will be presented with the appropriate frames until the entire interactive scenario has been completed.
The embodiments of the invention are capable of providing expert analysis in real-time interactive chat mode in a manner that is appropriate for mass distribution.
The invention reinforces the personalized responses returned by an interactive system through the provision of expert analysis embedded primarily in interactive programming.
The embodiments of the invention have the advantage that interactive programming can be provided for an expert system in a way that requires little processing at the interactive terminal.
The embodiments of the present invention will be described hereinafter, by way of example, with reference to the accompanying drawings, in which:
Figure 1 shows a block diagram of the apparatus for implementing an interactive expert system of the invention;
Figure 2 is a block diagram showing the steps in a method of programming an interactive expert system of the invention;
Figure 3 is a hierarchical graph of a rule base of an interactive expert system, described herein as Example 1;
Figure 4 is a hierarchical tree diagram of the hierarchical chart of Figure 3;
Figure 5 represents the situation of the frames in five data streams in an embodiment for carrying out the hierarchical tree of Figure 4;
Figure 6 represents a generalized presentation of the situations of the frames of Figure 5, in a way that illustrates the hierarchical nature of the embodiment;
Figure 7 depicts a generalized representation of an alternative embodiment employing compressed branches of the hierarchical tree to accomplish the hierarchical tree of Figure 4 using only tree data strings; and Figures 8A, 8B, 8C and 8D represent a generalized representation of the situations of the frames and the contents to carry out the Example 2.
Referring now to the detailed drawings, and initially to Figure 1, the embodiments of the invention employ an interactive terminal (2) to receive and select between interactive data streams for interactive media (4) in order to display them. to a user on a screen (9). The terminal (2) contains an infrared remote receiver (6) to receive user input from the infrared remote control (8). The receiver (6) is connected to a signal selector (3) that selects the data chain and the frame that will be received in the interactive terminal (2). A presentation generator (7) is connected to the signal selector (3) to generate an interactive presentation based on the received data string. In an alternative embodiment, an optional storage device (5) is used to present pre-stored messages, as instructed by the received frame of the selected data stream.
The terminal (2) is a multi-track playback device, or a storage device or a multi-channel reception device. Data streams are independent channels or tracks of audio, video, graphics, or other data from interactive media (4). The interactive media (4) can be any of the following: a multi-track audio tape; a multi-track videotape; a video tape or a transmitted signal having a single video channel and multiple audio and / or graphics channels; multiple video channels; a single video signal that has multiple compressed and multiplexed video channels in it; a bidirectional video system in which the content of a single video channel can be switched at the head end based on user input sent from a user location; a randomly accessible storage medium (i.e., a magnetic disk or tape, a CD-ROM or other optical storage medium, or any other type of random access storage medium); or any type of storage medium on which separate audio or video tracks can be stored for later transmission. All of the above transmission schemes of the present invention can be implemented as analog or digital signals and be sent over any transmission medium including cable, satellite, television broadcasts, microwaves, or personal communication networks. For example, the audio channels can be transmitted in series, parallel, or in any suitable way, as described in US Patent No. 5,585,858.
If the interactive media (4) is randomly accessible, the interactive conversation chains are physically stored on an individual track on the disk, either in contiguous or non-contiguous files. In conjunction with a disk drive, or with an interface appropriate to the type of storage medium in use, the information stored on each track is delivered to a user of the system in a manner close to real time. In one embodiment, multiple video channels are stored on CD-ROM or Videodisk, and the video controller manages the separation of the multiple channels for selective display.
In a preferred embodiment, the interactive media (4) comprises one or more cable television channels, each of which contains a transmitted audio and video signal. Using a multiple choice controller (8), the user is able to selectively answer questions, the answers are their inputs in the expert system that governs a switch between the channels in the middle (4) to conventionally present the information from each channel on the screen (10).
If audio or video tapes are used as multi-track media (4), or a CD-ROM or disk storage is used, the medium should preferably be removable from the playback media so that different interactive expert systems can be inserted. and be used in the system. This makes it possible to register a library of prerecorded media, covering a wide range of topics. For example, the medium (4) may contain expert analysis for product selection, diagnosis, document creation, etc. The system may employ a microprocessor to read the tracks from a randomly accessible medium, if such a medium is used.
As described below, although the present invention emulates memory functions during operation, a complex microprocessor is not required to perform these memory functions. Logic and memory functions are achieved through hierarchical rule-based programming. However, a detailed example of the invention is described (Example 2) that uses a microprocessor to manage memory functions to provide a more complex degree of expert analysis.
The interactive conversation is preferably seen and / or heard by the user using a conventional television screen, and / or a loudspeaker or headphones. If the conversations stored in the multi-track medium are in digital form, that is, on CD-ROM magnetic disk, or digital audio tape (DAT), the interactive terminal (2) contains a digital-to-analog converter to convert the strings of digital information into analog signals that can be delivered to a conventional audio / video display or speaker.
ES 2 201 118 T3
Although not required, the storage device (5) can be used by the interactive terminal (2) when the data from the interactive medium (4) contains instructions that instruct the terminal to present "canned" interactive messages stored in the device ( 5) storage.
The multiple choice controller (8) can be an infrared remote control, or it can be any other appropriate device for selecting an interactive answer to a question. Depending on the particular application, inputs can be provided via a keyboard or even a touch screen. Once the answer is entered, the system can change data strings appropriately, store the answer for future branching, or run an algorithm using the answer. Alternatively, with the present invention a multiple choice controller (8) is not necessary if the interactive terminal incorporates buttons that allow the user to make selections on the terminal itself.
As previously indicated, although prior art interactive systems are capable of engaging users in relatively simple interactive conversations, and emulating memory functions, the prior art does not disclose a method for creating an interactive program that is capable of performing expert analysis or complex functions.
The present system emulates a computerized expert system by presenting an interactive program without using a microprocessor to keep track of all user responses. Furthermore, the video display screen that is preferred in the present invention provides a more realistic expert analysis by allowing the system to explain how and why a particular conclusion was reached, present recommended products, and show how to achieve a necessary repair once that the system has concluded that such a repair is necessary.
1. Implementation of a rule base
In order to properly program the interactive expert system, a rule base must be defined. This allows the system to emulate the decision-making process of a human expert at a remote location, that is, at the interactive terminal and on the television screen. By locating the present system in remote locations, the interactive expert system enables complex problems to be solved during independent interactive conversations with many users. The present invention presents a way of organizing deep knowledge in an interactive programming methodology to ensure proper emulation of the decision-making process.
Figure 2 shows a flow chart of the method of the present invention for implementing an interactive expert system. First, the objectives of the expert system are defined in step 10. Next, the appropriate human knowledge is extracted to achieve these objectives, in step 11. Informational papers, experts and other sources are consulted to determine this knowledge. From human knowledge, a hierarchical rule base is defined in step 12. The hierarchical rule base is an organizational characterization of human knowledge.
The rule base consists of a number of rules. The rules comprise the map of correspondence of the conclusions with one or more premises. The rule base is formulated to implement the human knowledge defined in step 11 and solve the objectives defined in step 10. The rule base is hierarchical because at least one premise of a rule is a conclusion of at least one other rule. Table 1, illustrated below, is an example of a rule base. Figure 3 illustrates a graphical representation of the rule base in Table 1.
If a rule assumes a premise that is determinative of the user, the premise is translated into a question in step 13. The interactive system presents the question to the user to determine if the premise is satisfied. For example, if the premise of a rule is "the car is red", the corresponding question "is the car red?" to request the user's response on whether the premise is satisfied. The question need not be a mirror of the premise, but could be anything that proves or disproves the existence of the premise. For example, the question might be "is the car blue?" If an affirmative answer is received, the interactive terminal will know that the premise "the car is red" is not satisfied. If a negative answer is received, other questions must be presented, until the interactive terminal has enough information to determine if the premise is satisfied.
The remaining rules, premises, and questions are then formed in a hierarchical tree diagram, step 14. The hierarchical tree diagram generally represents a logical solution to the problem (using branches) and corresponds to the rule base and questions. An example of a hierarchical tree diagram is shown in Figure 4.
A mapping is established between the hierarchical tree diagram and a plurality of data strings, step 15. The data strings contain frames that are time synchronized between the data strings. The frames contain information on the relationships of the data strings that depend on user input. In essence, the data strings represent and implement the branches of the tree diagram. Figure 5 depicts a series of data strings on a mapping map to the hierarchical tree diagram of Figure 4. In a preferred embodiment, the mapping map step includes a "folding" step of the tree diagram. hierarchical. The "folding" step reduces the number of data strings required by causing branching between data strings that are no longer needed to implement the hierarchical tree diagram, thus preserving channel capacity. An example of a "fold" is shown in Figures 6-7. Figure 7 represents a folding form of the embodiment represented in Figure 6.
ES 2 201 118 T3
Finally, the data strings are stored in an appropriate storage device, step 16. In a preferred embodiment described below, the data strings are stored in a manner that allows dynamic retrieval of the data strings. In this embodiment, an indicator relative to these strings containing information is also stored. During recovery, only those strings identified by the indicator are retrieved.
The following two examples will be used to show the method of the invention:
1) A simple expert system to diagnose a problem that occurs in a stereo system, the problem being that excessive noise and distortion is heard through the speakers.
2) A point of sale kiosk that includes a microprocessor to help the user choose a tennis racket.
As previously mentioned and illustrated in Figure 2, the first step in the programming process of an interactive expert system is to define the objectives and the decision-making algorithm of the system 10. The objectives define the type of expert advice that the system provides the user. More specifically, the system objectives define an end point, final decision, or product of the expert system. Referring to example (1) above, the goal is to analyze user responses to questions and determine the most likely reasons why stereo speakers contain excessive noise and distortion. In example (2), the system inquires about the user's playing habits and personal characteristics, and recommends a tennis racket that is the most appropriate for the user's playing style and experience.
In the first example, a rule base is defined to determine the cause of excess noise output from the speakers of a stereo system as illustrated in Table 1.
TABLE 1
Rule Base for Stereo System Diagnostic Example
Rule 1: If the outputs pick up a clean signal, and the speaker wire isn't picking up noise, then the problem is with the speakers.
Rule 2: If the speaker wire picks up noise, then the problem is with the speaker wire.
Rule 3: If the patch cord picks up noise, then the problem is with the patch cord.
Rule 4: If the volume control knob, or the balance knob, or the tone control knobs are causing noise, then the problem is with the brushes on the knobs.
Rule 5: If the headphone output has no noise, and the interconnect cable is not picking up noise, then the outputs are picking up a clean signal.
In this simple example, the rules for locating the source of a problem are defined in a stereo system where the audio signal from the speakers contains excessive noise and distortion. Each rule contains at least one premise and one conclusion. The premise corresponds to the previous sentences that begin with "yes". The conclusion corresponds to the sentence that follows "then." For example, in rule 1, the premises are (1) "the outputs pick up a clean signal" and (2) "the speaker wire picks up no noise." The bottom line is "the problem is with the speakers." The premises are translated into questions, preferably presented to the user through a display monitor either before storage, or after receipt by the interactive terminal. For rule 1, the question may be (1) "Do the speaker cables pick up noise when the cables move when the stereo is playing?" The question is preferably not that short, but provides a detailed interactive presentation, as shown below in Table 2. The premise (2) for rule 1 depends hierarchically on the result of rule 5, and uses the result of rule 5 as its premise without requiring the use of a question. However, the two premises of rule 5 require questions. A hierarchical relationship occurs because the conclusion of rule 5 "the outputs are getting a clean signal" is used as a premise of rule 1.
Once the rules have been defined, they are organized into a hierarchical rulebase of the type illustrated graphically in Figure 3. The hierarchical rulebase graph visually illustrates the hierarchical organization of the premises and conclusions. In order to code an expert system in a multichannel television system and take advantage of the parallelism of multiple channels, the parallelism must be identified in the knowledge base. Parallelism are points in the logic of the system at which decision-making paths are separated based on the existence of a premise. Because the premises are often translated into questions, it is also correct to define a parallelism such as that which occurs at the points in the logic of the system where the decision-making paths separate.
ES 2 201 118 T3 decisions based on the answers to the questions. For example, using the hierarchical graph illustrated in Figure 3, the answer to the premise "speaker cables do not pick up noise" establishes parallel paths. If the speaker cables are not picking up noise, a path is established to determine if the problem is the speaker (rule 1). If the speaker cables pick up noise, a parallel path is established to inform the user that the problem is in the speaker cable (22). These two paths are mutually exclusive. Consequently, an important aspect of efficient encoding of a multi-data string system is to identify mutually exclusive paths that can be encoded in parallel in the data strings. Once the hierarchical chart is constructed and parallelism identified, a mapping can be established between the implementation of the expert system and a multi-data string format, and the resulting interactive presentation can be stored on a storage medium.
In addition to simply recording the questions and conclusions, the system can include the possibility of explanations that is implemented in the interactive presentation. This is possible because of the hierarchical relationship between the rules. In any conclusion, the previous premises are satisfied, since those premises must have been fulfilled to reach the conclusion. For example, the system need not merely state that “the noise is caused by the speaker”, but rather should respond more informatively that “the noise is caused by the speaker because the speaker wires do not pick up the noise, the output of the headset has no noise, and the interconnection cables do not pick up noise ”. Therefore, each rule provides a context for the explanation given in the expert system. The user is informed of the basis that underlies the opinion of the expert system. The system thus emulates the dialogue between the user of the system and an expert.
The rulebase is preferably organized so that the premise that is most likely to fail or that is easiest to confirm is tested first. This provides the opportunity to remove a rule (and thus conserve valuable space in the middle) as soon as possible in the search. In rule 1 of the stereo example, the premise "the speaker cables do not pick up noise" (20) should be tested before "the outputs are receiving a clean signal" (21), because the determination of the premise (20) will solve rule 2.
As in conventional systems based on expert systems, there is always a certain ambiguity in the rule base. This occurs because the premises are often unable to pass a positive test. For example, in rule 5, the premise "the headphone output has no noise" (23) may be true, but the conclusion "the outputs are receiving a clean signal" may be false if the noise is originated by a later stage of the amplifier located behind the internal receiver of signals of the earphone. Thus, as with all expert systems, the heuristic nature of the system causes the system to be only as good as the underlying rule base. This problem can be mitigated to some extent in an alternative embodiment of the present invention by using a processor and assigning probabilities to maps of correspondence between the premises, user responses and conclusions. In the preferred embodiment, only those ambiguities that are known in advance can be compensated by defining a field along the graph and including explanatory messages about the ambiguity in this field, that is: "the system cannot determine what is wrong based on the information you have entered. Please check the service manual or call your authorized dealer ”.
two. Hierarchical tree diagram
Referring to Figure 4, once the expert rule base and hierarchical graph are constructed, some or all of the premises are translated into questions, and a hierarchical decision tree is developed for interactive presentation. This enables the interactive provider to structure the interactive presentation in a format that is capable of being easily received and accessed by one or more interactive terminals.
Figure 4 illustrates a simple hierarchical tree diagram of the rule base of Table 1 and the hierarchical graph of Figure 3. As previously described, the premise "speaker cables do not pick up noise" is first presented. Rule 1, since it is determinative of the result of Rule 2. Thus, the first branch of the tree (41) is a question "Do the speaker cables pick up noise?" (Table 2, below, shows a more complete indication of how the actual question preferably appears). This question is presented to the user with a presentation monitor (9). If the user indicates through the user interface (8) that the speaker cables pick up noise, then according to rule 2, the problem is in the speaker cables (43). Therefore, if a “yes” answer is received from the interactive session, the tree branches with a data chain to explain that the problem is in the speaker cables (43).
If the speaker cables do not pick up noise, the first premise of rule 1 is satisfied and the interactive presentation proceeds to branch (42) to inquire about the second premise. The second premise is a conclusion of rule 5, and therefore the system must generate a question related to rule 5. As the premise of rule 5 "interconnections do not capture noise", is determinative of rule 3, this premise it is processed first. Thus, the second branch (42) presents the question “do the interconnections capture noise?”. If the interactive input indicates that the interconnections pick up noise, rule 3 is satisfied, and the interactive terminal presents a summary of the problem, stating that "the problem is in the interconnections" (44).
If the interconnections do not generate noise, indicated by the interactive response of the user, the first premise of rule 5 is satisfied, and a question directed to the second premise is generated for presentation to the user. The decision tree goes to branch (45) and asks the user “do the headphone outputs contain noise?”. If the answer
ES 2 201 118 T3 interactive is "no", all the conditions of rule 1 are satisfied and the user can be presented with the conclusion that "the problem is in the loudspeaker" (46).
If the user had responded interactively that the headphone outputs contained noise, the premises of rules 1-3 and 5 would not have been satisfied and the presentation should proceed to the next untested rule, rule 4. Although rules 1 and 5 required two premises to be met (a logical "AND" function), rule 4 differs in that it is satisfied if any of the three previous conditions are met (a logical "OR" function). To determine whether a premise of rule 4 is satisfied, only one question needs to be generated that covers all three alternatives. Therefore, the decision tree branches to a question (47) that specifies "Does the balance control, volume control, or tone control generate noise?" If the answer is affirmative, the problem is in the brushes of the rotary controls and the presentation goes on to a representation of this conclusion (48), “the problem is in the brushes of the control knob that generates the noise”.
If the interactive user input indicates that the noise is not caused by the volume, balance, and tone controls, then none of the required premises of rules 1-5 are met. At this point, the tree can branch to other more detailed questions, or the presentation can inform the user "the problem is probably in the electronics, see your authorized dealer for repair" (49).
Once the hierarchical tree diagram has been constructed, storing the interactive presentation for later recall is a simple matter. To store the interactive presentation, time-synchronized data strings containing frames are generated and stored.
3. Data strings
Once a hierarchical tree diagram has been constructed, similar to that illustrated in Figure 4, the premises, questions, conclusions and associated informative statements are mapped to the data strings. The information is embedded in the data streams in a plurality of frames, each frame comprising messages that are seen and / or heard in response to the selection of the data stream on which the frame is embedded. Each of the frames of the various data strings comprises questions, conclusions, statements based on the conclusions of the premises, and associated information messages to provide the context for the questions, premises and conclusions. The content of the strings is related in real time, so that the user's choices presented in response to a premise result in a switch to data strings that are hierarchically related according to the hierarchical rulebase graph or in the context of the premise resulting from the channel switching. The frames of the various tracks are related in real time and in content, so that an expert analysis takes place when the medium is played and the user answers the questions related to the premises of the expert system stored in the chains.
As a channel is selected in response to an interrogation or based on the response to a previous interrogation, the information in the data stream corresponding to the particular selection is routed to the display. Embedded in the selected data string at the time the selection takes place, there is a raster segment that has content corresponding to the selected answer for the previous question. Explanatory questions, premises, conclusions, and messages may generally be contained in any or all of the various tracks, as long as they are properly timed so as to retain a time relationship as described herein.
Referring to Figure 5, a representation of data strings and frames is shown embodying the hierarchical diagram of Figure 4. Figure 5 shows five data strings (101-105). Although five data strings are shown in this embodiment, more or less can be arranged as needed. Each of the data strings (101-105) contains a first frame (200). Each frame (200) contains an information part (210) and a command part (220). The data strings 101-105 need not be formatted so that the command part 220 follows the information part 210, as illustrated in Figure 5, but can be formatted in any known way. currently for a person skilled in the art. For example, the command part (220) may precede the information part (210) or it may be interleaved with the information part (210).
The information portion (210) preferably contains a representation of a conclusion or a question. For example, the information part (210) may state that "the problem is the speaker" (246) or that "do you hear noise at the headphone output?" (245). The questions will prompt an interactive response from the user. Even conclusions may require interactive input, such as "the problem is with the speaker, press a key to continue."
Information portion 210 is not limited to text, but may also contain graphics, video, audio, or instruction codes. For example, the information part (210) may contain a graphic or video representation of a man and a woman with an audio accompaniment of a voice asking "what is your gender?" "Enter 1 for male and 2 for female." Alternatively, the information part (210) may contain an instruction code that refers to memory locations in a storage device (5) available to the interactive terminal. The interactive place uses the instruction code to refer to the corresponding storage place to access the “canned” interactive data.
ES 2 201 118 T3
In analogous embodiments, the information portion (210) is preferably included in the vertical blanking range of a conventional television signal or in an exclusive channel. These and other acceptable techniques are disclosed in US Patent No. 5,585,858.
The command part (220) is preferably used both in the control functions of the interactive terminal (20) and to define the hierarchical relationship between the frames (200). Command portion 220 contains branching data concerning the interactive terminal's response to user-specified inputs. For example, command portion 220 may contain algorithmic codes to match user input with system responses embodied in separate data strings. Coding can also be more complicated. For example, relative addressing of data strings can be used ("switch to lower third string"), variable assignments can be represented ("if user presses 1, store 3 in variable X"), and other can be included. well-known instructions in an interactive processor. The complexity of the order is tailored to the complexity of the interactive terminal that processes the order. Of course, a suitable encoding can be used to preserve the size of the command part. Alternatively, the commands may contain codes that identify macros stored in the interactive terminal, the macros comprising the branching algorithms as described above.
Because the command part (220) contains the information that defines the relationship between frames (200), the frames (200) retain the hierarchical relationships of the hierarchical tree diagram (Figure 4).
Returning to Figure 5, the hierarchical branches take place by means of switching between data strings. It is evident that the hierarchical relationship between the frames is directly analogous to that of the branches in figure 4. In figure 5, the information parts (241, 242, 245 and 247) correspond to the questions (41, 42, 43 , 45 and 47) of the figure
Four. The yes / no branches of the questions in figure 4 are preserved in the command fields (341, 342, 345 and 347) of the frames illustrated in figure 5. For example, if the answer to the question “are they capturing noise interconnections? " (42) (figure 4) is "No", then the tree diagram goes to the branch "Does the headphone output contain any noise?" (Four. Five). In Figure 5, the question 42 of Figure 4 is stored in the information part 242, and the instructions on where to branch that depend on the input are stored in the command part 342. Command portion 342 remains on channel 101 if the answer is "no" and switches to channel 102 if the answer is "yes". This is in correlation with the hierarchical tree diagram in Figure 4. In figure 5, the conclusions represented in the information parts (243, 244, 246, 248 and 249) correspond to the conclusions (43, 44, 46, 48 and 49) of the hierarchical tree diagram illustrated in figure 4.
Figure 5 shows an embodiment in which the frames of the different data streams are synchronized. The frames are synchronously located in frame intervals between T1, T2, T3, T4 and T5. As represented, the period between T3 and T4 appears longer than the period between T1 and T2. In a preferred embodiment, the time slots are not required to be identical, but only that the frames be synchronous. All the frames in Figure 5 are shown synchronous even though parts of the frames may have different lengths, such as the information parts (242 and 243).
Because the number of actual branches in a given interactive scenario varies depending on the user's interactive responses, the interactive scenario ends at different times. For example, in Figure 5, the user has completed the interactive program in frame (243, 343) where the problem is the speaker wires. If the user had indicated that the speaker cables were not the cause of the problem, the user would be interacting with the frame (242, 342). In this example, the interactive provider has included "program synchronization segments" in the frames that do not correspond to logical branches in the hierarchical tree diagram. The program sync segments are inserted into the channels to maintain a synchronous relationship between the channels for later branching. This is done by placing an order that remains in the current chain in the order portion (343) of the final frame (243, 343). The information part comprises an informational message that is not required to be related to the rule base, but is included to maintain system synchronization. The frames subsequent to the synchronization segments of the program have additional informational messages in the information part and orders to stay on the current channel in the information part. Alternatively, if the problem is resolved in frame (243, 343), a code could order branching to a separate, non-illustrated channel that provides common programming or additional instructional video until the end of the expert interaction.
It may not be desirable to maximize chain efficiency by reducing the number of parallel tree branches when encoding a hierarchical rule base in a hierarchical tree diagram, especially when multiple users are simultaneously involved in the interactive presentation. By purposely coding an inefficient hierarchical tree diagram (using many data strings), the interactive program is structured to conclude at the same time (or almost at the same time) for the various possible interactive responses, reducing the need for synchronization segments of the Program. For example, if an interactive broadcast of a television program takes half an hour to conclude for User A and fifteen minutes to complete for User B, User B would be unhappy to watch fifteen minutes of synchronized segments of the program. Of course, the program sync segments may be another short interactive program, which would not be available to user A. It is important, therefore, to recognize that one of ordinary skill in the art may wish to make a compromise between the number of strings and the amount of time it takes to resolve the various decision branches of the tree to reach an overall conclusion.
ES 2 201 118 T3
In the final frames of the data streams, which take place at time T4, all possible branches of the hierarchical tree diagram have been presented. The command portion of the final frames of each data stream may contain a command to switch to a single data stream, so that the next interactive presentation can begin. The frames at times T4 and T 'contain a part (350) of commands that instruct the interactive terminal to switch to the data stream (101). This is desirable to conserve storage and media space. Actually, the data strings are preferably structured such that they are dynamically allocated, as described immediately below.
Four. Dynamic mapping of data strings
In a preferred embodiment, the data streams are dynamically arranged from the interactive medium (4). The number of data strings actually supplied to the interactive terminal is only the number of data strings that actually contain information. This results in a substantial saving in channel capacity, in the embodiment where the data streams are channel coded for transmission.
Referring to Figure 2, the step of establishing a correspondence map between the hierarchical tree diagram and the data strings and frames synchronized in time (15), entails the establishment of a correspondence map only between the data strings. that are required for the interactive scenario. For each frame interval it is only necessary to send the data strings that actually contain information. For example, referring to Figure 4, the first step is to determine if the speaker wires are bad (41). This requires a single string frame of data. Therefore, in the first frame interval T0-T1 (Figure 5), only the data string (101) is provided to the interactive terminal. The frame intervals are illustrated in Figures 5 and 8 as the intervals between T0, T1, T2, ... Tn.
In one embodiment, when the frames containing information are initially stored (in the information and command part), an indicator of which frames of the data string contain the information is also stored. This can be achieved in a number of different ways. First, an index containing the number of data strings during each frame interval can be stored in the interactive medium (4). For each frame interval, the index would inform the interactive medium (4) of the number of data strings that contain information and therefore the number of data strings that must be generated for transmission. Alternatively, the index could comprise a list of data strings for each subsequent frame interval and whether data strings should be generated for each frame interval.
A second method of storing an indication of the data strings to be generated for transmission during a particular time interval is the encoding of the command part of each frame with a field that identifies the data strings that will be available in the interval. subsequent frame. This method is advantageous because the interactive terminal (2) receives a frame containing information pertaining to the number of incoming frames. The interactive terminal can use this information to configure itself with respect to data string switches.
A third method of storing an indication of the data strings to be generated is the encoding of the command part of a frame of a data string designated with an index field (as described above) that identifies the data strings that they will be available in the subsequent frame interval. For example, the data string (101) of figure 5 could contain an index field in each frame to inform the interactive medium (4) how many data strings should be generated. As the interactive terminal (2) may not receive the data string that contains the index field (depending on the user's interactive input), the interactive medium may not receive any indication of the number of data strings that will be displayed in the interval next frame, unlike the second method above. However, the invention will continue to work, since it is not necessary for the interactive terminal (2) (although desirable in order to configure the interactive terminal (2) in advance) to know which data strings will be provided in the next frame interval. . The interactive terminal simply switches to a data stream identified by the command portion of the frame and by the interactive response of the user.
With reference to Figure 5, at time T0 the interactive provider only needs to supply a single data string, at T1 two data strings, at T2 three data strings and so on until five data strings are required at time T4. Thus, the interactive system is able to dynamically assign the data strings between a single channel and as many channels as necessary. If the data chains were supplied in television channels, the number of channels required in the first moments (T0 and T1) is effectively reduced. For example, four strings / channels are required for a question referring to four age ranges, while two strings / channels are required for a binary or polar question (that is, a yes / no question). Referring to questions 5 and 8, the parts of the data strings labeled "not used" are preferably not supplied during their corresponding frame intervals, dynamically reducing the number of data strings.
Alternatively, the interactive terminal can continue to process the previous data string when a new interactive presentation is to take place. In this example, redundant messages are placed on multiple data strings so that all users receive the same initial presentations regardless of which data string the user completed within the interactive scenario above. This alternative embodiment
ES 2 201 118 T3 is stream inefficient in that all channels are used throughout the interactive presentation, rather than just at the end, as in the previous embodiment.
A modification of this alternative embodiment is that the introductory messages to additional interactive presentations present information relative to previous interactive presentations. In this case, not all users receive identical presentations when they start a new interactive schedule. As there are many possible orders to be placed in the order part of the frames, a dynamic allocation of the data strings and a great flexibility to build the hierarchical tree diagram, the invention is very flexible and can be organized in numerous configurations.
The data strings (101-105) need not be stored synchronously, but can be stored in any way known to those skilled in the art. The storage or recording method is not critical to the invention, as long as it is sufficient to enable the retrieval method to read the stored data strings synchronously.
5. Frame synchronization and branching in data chains
Referring again to FIG. 5, frame and sync content is depicted as it occurs in the data streams (101-105). At time T0, the user has finished a previous interactive presentation and is beginning to interact with the stereo problem resolution presentation. Since all the previous frames that take place at time T 'contain instructions (350) to switch to the chain (101), the interactive terminal processes only a single data chain (101). At time T1, the interactive terminal remains on chain (101) or switches to chain (102) depending on the user's response to question (241) made at time T0. At time T1, the interactive terminal receives the strings (101) and (102) regardless of the user's selection. It is not necessary for the terminal to process all incoming data strings. The interactive terminal is only required to perform a simple switching operation and processing of the selected data string. This continues until time T4 when all possible branches of the tree have been presented. The frames at time T4 all have a command portion (350) instructing the interactive terminal to switch to the chain (101) at the conclusion of the presentation. Thus, at time T5, the interactive processor is processing the string (101) again.
Another reason to start and end on a single data string is that it makes other data strings available for error handling. For example, in Figure 5, frame (230, 330) is directed to a presentation dealing with a situation where the user had not selected "yes" or "no" as instructed by frame (241, 341 ). The information part (230) contains a message such as "you have not selected" yes "or" no ", therefore, it is assumed that you pressed" no "..."
Table 2 shows a possible script for the information part of the frames represented in figure 5 and of the questions illustrated in figure 4. It is understood that this example represents the audio part of the program and that the appropriate video may also be included in the information part of each frame. The information or instructions included in the command part of the frames are shown enclosed in braces {}.
String numbers 101-105 in Table 2 correspond to strings 101-105 in Figure 5, while times T'-T5 also correspond to times T'-T5 illustrated in Figure 5. The frames numbered in Figure 5 also appears in Table 2, in their corresponding positions, although they have not been numbered separately in the Table.
(Table goes to next page)
ES 2 201 118 T3
<img file="ES2201118T3_D0001.tif" />
ES 2 201 118 T3 β
Ό • Η
U (β g
-Η
XJ β
Ο υ
(Μ
<td></td><td>Cad 105</td><td colspan="3">(not used)</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td colspan="3">(not used)</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td>Cad 104</td><td>(not</td><td colspan="2">used)</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>(not</td><td colspan="2">used)</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td></td><td>• rl</td><td></td><td>» • P</td><td> ©</td><td></td><td>I</td><td></td><td>> Η</td><td>ο</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td> 05</td><td></td><td></td><td></td><td></td>
<td></td><td></td><td>β</td><td>laugh</td><td> 3</td><td> 2.</td><td>laugh</td><td>• Ρ</td><td> 0</td><td> 0</td><td> 0</td><td>Η</td><td></td><td></td><td></td><td></td><td></td><td></td><td>ίδ</td><td> ©</td><td rowspan="2"> *3</td><td> ©</td><td></td><td></td><td></td>
<td></td><td></td><td></td><td></td><td>P</td><td>σ</td><td> 0</td><td>laugh</td><td> 44</td><td>'ϋ</td><td> 44</td><td></td><td>β</td><td></td><td></td><td>• Ρ</td><td></td><td></td><td>g</td><td>Ε</td><td> 05</td><td></td><td></td><td></td>
<td></td><td></td><td>r-1</td><td>P</td><td></td><td rowspan="2"> 03</td><td></td><td> &</td><td rowspan="2">\ <δ</td><td>• Η</td><td> ©</td><td>• Ρ</td><td>β)</td><td></td><td></td><td> 05</td><td>β</td><td></td><td></td><td> 05</td><td>Ο</td><td>laugh</td><td></td><td>Ρ</td><td></td>
<td></td><td></td><td></td><td>• P</td><td>β</td><td></td><td>ε</td><td> 3</td><td> 05</td><td>ta</td><td></td><td></td><td>β</td><td></td><td><δ</td><td></td><td> 05</td><td></td><td>CU</td><td> 43</td><td></td><td>β</td><td></td>
<td></td><td></td><td>β</td><td>m</td><td> ©</td><td> 05</td><td>Q</td><td><δ</td><td> 44</td><td>Ρ</td><td></td><td></td><td>ίδ</td><td></td><td> '0</td><td></td><td>ρ</td><td></td><td rowspan="2">Ό</td><td>Λ</td><td></td><td> <3</td><td> ©</td><td>δ</td><td></td>
<td></td><td></td><td></td><td> ©</td><td></td><td>laugh</td><td>υ</td><td></td><td>ta</td><td></td><td> 05</td><td></td><td>υ</td><td></td><td>• Ρ</td><td> 05</td><td> &</td><td>β</td><td>Ο</td><td> 3</td><td rowspan="2">Ο</td><td>ο</td><td rowspan="2"> □</td><td></td>
<td></td><td></td><td></td><td>r ~ |</td><td>P</td><td>Χί</td><td></td><td>rt</td><td> 05</td><td>r — i</td><td>υ</td><td>'Ρ</td><td>Ν</td><td></td><td>κ</td><td> ></td><td></td><td>Ό</td><td> 01</td><td>Ρ</td><td>σ *</td><td>Ό</td><td></td>
<td></td><td></td><td>• rl</td><td> ©</td><td>or</td><td><δ</td><td></td><td> 05</td><td></td><td> 05</td><td>«Δ</td><td> 05</td><td> 0)</td><td></td><td> 05</td><td>I heard</td><td>OR</td><td>• Ρ</td><td> 05</td><td rowspan="2">to</td><td rowspan="2"> 05</td><td>Ρ</td><td> ©</td><td> ©</td><td></td>
<td></td><td></td><td>β</td><td></td><td></td><td>ϋ</td><td>Ί3</td><td></td><td> 0</td><td></td><td>λ;</td><td rowspan="2">Ρ</td><td>β</td><td></td><td>fi</td><td>β</td><td></td><td>ta</td><td></td><td>ίδ</td><td></td><td>fi</td><td></td>
<td> 0</td><td></td><td rowspan="2"> 0</td><td> 0</td><td> 0</td><td rowspan="2"> 03</td><td></td><td>Ο</td><td>Ρ</td><td>β</td><td></td><td><δ</td><td></td><td> 0</td><td> 8</td><td> 05</td><td>ρ</td><td> .0</td><td>laugh</td><td> 3</td><td>ρ</td><td></td><td> ©</td><td> <*)</td>
<td rowspan="2">ώ</td><td></td><td> 05</td><td>β</td><td>Ρ</td><td></td><td>Ρ</td><td> 05</td><td> 0</td><td>Ρ</td><td></td><td></td><td>υ</td><td></td><td> 3</td><td> 0</td><td>ίδ</td><td> 05</td><td> ©</td><td>cu</td><td> ©</td><td rowspan="2">to</td><td>ο</td>
<td></td><td>Τ3</td><td>• rl</td><td rowspan="2">N</td><td> 0</td><td>Ο</td><td><δ</td><td> '05</td><td></td><td>Τί</td><td><δ</td><td></td><td></td><td>fi</td><td> 01</td><td> &</td><td>Ρ</td><td rowspan="2">or</td><td></td><td></td><td>g</td><td>ρ</td><td></td>
<td>Μ</td><td></td><td> ©</td><td> ¿</td><td>«Η</td><td> 44</td><td> 44</td><td> 44</td><td> 0</td><td>β</td><td>to</td><td> 4)</td><td></td><td> 05</td><td> 0</td><td></td><td>ta</td><td>OR</td><td>Ρ</td><td> 0</td><td>β</td><td> ©</td><td></td>
<td>\ <and</td><td></td><td>α</td><td>σ</td><td> 0</td><td rowspan="2"><δ</td><td>OR</td><td>β</td><td>ω</td><td>• rl</td><td> <0</td><td></td><td>to</td><td></td><td>Ρ</td><td>laugh</td><td> 05</td><td>• Ρ</td><td> 05</td><td>ε</td><td> ©</td><td>υ</td><td> ©</td><td>laugh</td><td>β</td>
<td></td><td></td><td> 0</td><td></td><td> ></td><td> 2</td><td>• Ρ</td><td> 05</td><td>Λ</td><td>β</td><td> 03</td><td></td><td></td><td>β</td><td></td><td>Ρ</td><td rowspan="2">τ3</td><td>OR</td><td>• Ρ</td><td>laugh</td><td></td><td>Οι</td><td>or</td><td rowspan="2"> ©</td>
<td></td><td></td><td>• rl</td><td> 0)</td><td> ©</td><td>Ίί</td><td>rg</td><td>OR</td><td></td><td>ε</td><td>υ</td><td></td><td>C3</td><td></td><td>• Ρ</td><td>OR</td><td>β</td><td></td><td>β</td><td></td><td> 0</td><td rowspan="2"> ©</td><td> ©</td>
<td>ω</td><td></td><td>OR</td><td> 5</td><td> 44</td><td> 3</td><td>Ο</td><td rowspan="2">ίδ</td><td>laugh</td><td>ίδ</td><td></td><td>> Ί</td><td></td><td></td><td></td><td>'OR</td><td> 05</td><td></td><td></td><td>'Ρ</td><td> &</td><td></td><td>ρ</td><td> ©</td>
<td rowspan="2"> 0)</td><td></td><td>OR</td><td>ν '</td><td>r-1</td><td>Ο</td><td>Ρ</td><td> 0</td><td>ϋ</td><td>β</td><td rowspan="2"> 0</td><td>• Ρ</td><td></td><td> 05</td><td>β</td><td>ε</td><td></td><td> 05</td><td>Ε</td><td rowspan="2">ίδ</td><td> ©</td><td>β</td><td></td><td>OR</td>
<td></td><td> ©</td><td rowspan="2">'P</td><td> ©</td><td><δ</td><td>to</td><td>ί — ι</td><td rowspan="2">Ο</td><td></td><td> '0</td><td> 05</td><td></td><td>'OR</td><td>ίδ</td><td> 05</td><td> 0</td><td></td><td></td><td>ρ</td><td> '0</td><td>fi</td><td>Ν</td>
<td></td><td></td><td>ι — i</td><td rowspan="2"> 05</td><td>ω</td><td> 05</td><td></td><td>β</td><td>• Η</td><td>β</td><td></td><td></td><td></td><td>β</td><td></td><td> 0</td><td>Τ '</td><td></td><td> ©</td><td>β</td><td>-Ρ</td><td> ©</td><td> ©</td>
<td>laugh</td><td></td><td>to?</td><td>P</td><td></td><td>Ρ</td><td></td><td>ϋ</td><td>β</td><td> 03</td><td></td><td></td><td></td><td> 01</td><td>υ</td><td>Λ</td><td>• Ρ</td><td> 0</td><td></td><td>Ρ</td><td> ©</td><td></td><td>• Ρ</td><td>β</td>
<td><υ</td><td></td><td> 6}</td><td>'OR</td><td>Ό</td><td> >4</td><td></td><td>Ρ</td><td> 5</td><td></td><td>Ρ</td><td>Ρ</td><td>laugh</td><td></td><td> «</td><td></td><td>ίδ</td><td>fi</td><td>laugh</td><td>σι</td><td> 05</td><td>Ρ</td><td> ©</td><td>β.</td><td rowspan="2"> ©</td>
<td rowspan="2">• ϋ</td><td></td><td rowspan="2">s</td><td>β</td><td></td><td></td><td>r-í</td><td> 0</td><td>ίδ</td><td> 05</td><td> 0</td><td>Ρ</td><td>Ο</td><td></td><td>laugh</td><td> 0</td><td> ,«</td><td>Ρ</td><td>Ο</td><td> ©</td><td>• Ρ</td><td> ©</td><td>β</td><td>θ '</td>
<td></td><td> 0</td><td> 01</td><td> 05</td><td> 05</td><td>Ίΐ</td><td>β</td><td>S</td><td>Ρ</td><td>ίδ</td><td>Η</td><td></td><td>Λ</td><td>Ί3</td><td> 0</td><td>υ</td><td>OR</td><td>X!</td><td>XJ</td><td>Μί</td><td> 0</td><td>laugh</td><td>ρ</td>
<td></td><td>π</td><td> 45</td><td>Οι</td><td> 05</td><td>X</td><td></td><td><δ</td><td>OR</td><td>Ο</td><td> 05</td><td>to</td><td></td><td></td><td>ίδ</td><td>'Ρ</td><td>fi</td><td> '05</td><td></td><td></td><td> 05</td><td>• Ρ</td><td> 0</td><td> ©</td><td> ©</td>
<td rowspan="3">CO</td><td>ο</td><td></td><td> 3</td><td>r-1</td><td> 03</td><td>β</td><td></td><td rowspan="2">Μ</td><td>• Ο</td><td>• Η</td><td></td><td>Λ</td><td></td><td>υ</td><td>β</td><td rowspan="2">to</td><td></td><td> >»</td><td rowspan="2">05 β.</td><td rowspan="2">τ3</td><td rowspan="2">τι</td><td>Ρ</td><td>β</td><td></td>
<td>Ρ</td><td> 0</td><td>w</td><td>η</td><td> 3</td><td>(δ</td><td>• Ρ</td><td></td><td> *3</td><td>Η</td><td></td><td></td><td></td><td>Ρ</td><td> 05</td><td></td><td> ©</td><td rowspan="2">OR</td><td></td>
<td></td><td>to</td><td></td><td><δ</td><td>Ρ</td><td> 44</td><td>β</td><td> 2</td><td></td><td></td><td></td><td> 0</td><td></td><td> 03</td><td></td><td><δ</td><td></td><td></td><td> &</td><td> ©</td><td> ©</td><td>Ρ</td><td></td>
<td>-Η</td><td></td><td></td><td></td><td>or</td><td>CU</td><td>Ο</td><td> 0</td><td>Ί3</td><td>Ο</td><td>ιδ</td><td> 05</td><td>-Ρ</td><td></td><td>υ</td><td>β</td><td>OR</td><td>Ο</td><td>Λ</td><td></td><td>'ίδ</td><td>Ρ</td><td>β</td><td> ©</td><td></td>
<td rowspan="2">XJ</td><td> 3</td><td></td><td> 03</td><td></td><td></td><td> «</td><td> 4-5</td><td>ίδ</td><td>Ύ></td><td>r-í</td><td> 05</td><td></td><td></td><td>laugh</td><td> 05</td><td>• Ρ</td><td>Ό</td><td> 05</td><td> ©</td><td>Ν</td><td> ©</td><td></td><td> ©</td><td>Ρ</td>
<td> <£</td><td> 45</td><td></td><td> ©</td><td></td><td>β</td><td>β</td><td>ϋ</td><td>β</td><td></td><td></td><td></td><td> 03</td><td></td><td>υ</td><td>U4</td><td>-Ρ</td><td>β</td><td>fi</td><td>• Ρ</td><td>β</td><td></td><td></td><td> ©</td>
<td>Ü3</td><td>Λ</td><td> <</td><td>fi</td><td>β</td><td> 0</td><td>ϋ</td><td>• Η</td><td>Ή</td><td>ίδ</td><td>β</td><td> 3</td><td>ίδ</td><td>ο</td><td>• Ρ</td><td><δ</td><td>• Ρ</td><td> 3</td><td>Ρ</td><td> 05</td><td>β</td><td> ©</td><td> ©</td><td>β</td><td>β</td>
<td>Ό α</td><td>ϋ</td><td></td><td> 3</td><td> 05</td><td>'OR</td><td>Ο</td><td> 03</td><td>Μί</td><td> 0</td><td> 05</td><td>CU</td><td>υ</td><td>laugh</td><td>CQ</td><td>Λ</td><td>β</td><td>fi</td><td>βί</td><td>β</td><td>σ</td><td> 8</td><td>τ3</td><td>CU</td><td>β</td>
<td> 5)</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td rowspan="2">Ρ ίδ</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>β</td><td></td><td></td><td>fi</td><td><ΰ</td><td></td><td></td><td></td><td> 05</td><td>β</td><td>Ο</td><td></td><td></td><td></td><td></td><td></td><td>Ο</td><td></td><td>3 OR</td><td></td><td></td><td></td><td></td><td></td>
<td>Ή</td><td></td><td></td><td> $</td><td>laugh</td><td></td><td></td><td></td><td>r-í</td><td> 05</td><td> '05</td><td></td><td>(δ</td><td>Ρ</td><td>«Δ</td><td></td><td></td><td>Ρ</td><td> 05</td><td></td><td>β</td><td></td><td></td><td></td><td></td>
<td rowspan="2">Ό</td><td></td><td>r- |</td><td> 3</td><td></td><td></td><td><δ</td><td> 01</td><td>Λ</td><td>Μ</td><td>laugh</td><td></td><td>υ</td><td>to</td><td>Ρ</td><td></td><td></td><td>laugh</td><td>β</td><td></td><td> 0?</td><td></td><td></td><td></td><td></td>
<td></td><td> 0</td><td> 5</td><td> 05</td><td></td><td>υ</td><td> 05</td><td>«Δ</td><td> 0</td><td> 05</td><td></td><td></td><td>ε</td><td>β</td><td></td><td></td><td> 05</td><td> 6*</td><td> 0</td><td></td><td></td><td></td><td></td><td></td>
<td></td><td></td><td>Ό</td><td></td><td><δ</td><td></td><td>ϋ</td><td>Η</td><td>XI</td><td>Μί</td><td></td><td></td><td>rP</td><td>Π</td><td>ίδ</td><td>β</td><td></td><td>β</td><td></td><td>* Ρ</td><td>Η</td><td></td><td></td><td></td><td></td>
<td>r-í</td><td></td><td></td><td> 0</td><td>fi</td><td> 0</td><td>fi</td><td>XI</td><td> 0</td><td>Ρ</td><td> 03</td><td></td><td> 05</td><td>OR</td><td>Ρ <</td><td> 05</td><td></td><td> 05</td><td>«Ί</td><td>υ</td><td></td><td></td><td></td><td></td><td></td>
<td> 0)</td><td></td><td> 05</td><td>Ό</td><td> 44</td><td>τι</td><td rowspan="2">to</td><td>(δ</td><td>Ρ</td><td> 05</td><td> 0</td><td></td><td></td><td></td><td>ίδ</td><td></td><td></td><td> 05</td><td>'Ρ</td><td>• Ρ</td><td></td><td></td><td> 03</td><td></td><td></td>
<td rowspan="2">ΰ</td><td></td><td>I heard</td><td>• P</td><td>β</td><td>β</td><td>OR</td><td>to</td><td> 44</td><td> ></td><td></td><td></td><td> 0</td><td></td><td>fi</td><td></td><td>fi</td><td>Λ</td><td> ></td><td>R</td><td></td><td>ο</td><td></td><td></td>
<td></td><td>laugh</td><td> 3</td><td> 05</td><td>ίδ</td><td> '©</td><td></td><td></td><td>β</td><td>Ρ</td><td></td><td><δ</td><td></td><td>Ν</td><td> 05</td><td></td><td></td><td>ίδ</td><td>fi</td><td>β</td><td></td><td>Η</td><td></td><td></td>
<td></td><td></td><td>Λ</td><td>P</td><td>* rt</td><td>υ</td><td> 44</td><td> 01</td><td> 01</td><td>• Η</td><td>Ρ</td><td> 05</td><td>you</td><td>Ν</td><td> 0</td><td>Ο</td><td></td><td>fi</td><td> ©</td><td> 05</td><td>β</td><td></td><td></td><td></td><td></td>
<td>ο</td><td></td><td> ©</td><td></td><td>ε</td><td> 0</td><td> 05</td><td> 0</td><td> 05</td><td></td><td>• Ρ</td><td> 0</td><td> 0</td><td>Ρ</td><td> ></td><td> 15</td><td></td><td> 0</td><td> ·\4</td><td> ©</td><td></td><td></td><td>β</td><td></td><td></td>
<td></td><td></td><td>or</td><td>fi</td><td></td><td> 44</td><td> 05</td><td>laugh</td><td></td><td>ίδ</td><td> 05</td><td>β</td><td>r-í</td><td> ></td><td><δ</td><td>β</td><td></td><td>X</td><td></td><td></td><td> <6</td><td></td><td> ©</td><td></td><td></td>
<td></td><td></td><td></td><td> ©</td><td> ©</td><td></td><td></td><td></td><td></td><td>r-í</td><td> <5</td><td><δ</td><td> 0</td><td>ίδ</td><td>Ρ</td><td>ίδ</td><td></td><td>ίδ</td><td></td><td> 05</td><td>laugh</td><td></td><td></td><td></td><td></td>
<td> &</td><td></td><td> 05</td><td> □</td><td> ></td><td> '©</td><td>Λ</td><td>β</td><td>Ν</td><td></td><td>to</td><td>υ</td><td> □</td><td>Ρ</td><td>laugh</td><td></td><td></td><td>Λ</td><td>(δ</td><td>Ό</td><td></td><td></td><td> ©</td><td></td><td></td>
<td> £</td><td></td><td> 0</td><td> ©</td><td> 0</td><td> 44</td><td>Ε</td><td> 05</td><td>ρ</td><td>β</td><td> ©</td><td>fi</td><td></td><td></td><td>ίδ</td><td></td><td></td><td></td><td>ε</td><td></td><td> ©</td><td></td><td>Ο</td><td></td><td></td>
<td rowspan="2"><ϋ</td><td>OJ</td><td>H</td><td> 45</td><td> 3</td><td> 01</td><td> 0</td><td></td><td> ></td><td> 05</td><td>• ρ</td><td> 01</td><td>fi</td><td>β</td><td></td><td> 05</td><td></td><td>ίδ</td><td> 05</td><td><δ</td><td> ©</td><td></td><td>Ν</td><td></td><td></td>
<td>Ο</td><td></td><td></td><td>ε</td><td> 05</td><td></td><td> 05</td><td>ίδ</td><td> 44</td><td>τ5</td><td>ο</td><td></td><td></td><td> 05</td><td>CU</td><td></td><td>ρ</td><td>laugh</td><td>τ3</td><td></td><td></td><td> ©</td><td></td><td></td>
<td>-η</td><td>rl</td><td> ©</td><td>N</td><td></td><td rowspan="2"> »3</td><td>Λ</td><td> 44</td><td> 44</td><td>to</td><td></td><td></td><td>Ρ</td><td>r-í</td><td>τί</td><td></td><td></td><td>εη</td><td>X</td><td>β</td><td> 0</td><td> ©</td><td>β</td><td></td><td></td>
<td rowspan="2"> 0)</td><td></td><td></td><td> 0</td><td> 05</td><td> <5</td><td>β</td><td></td><td>ίδ</td><td> 05</td><td> 05</td><td>Ρ</td><td> 05</td><td></td><td></td><td></td><td> 05</td><td> 0</td><td> 05</td><td></td><td>β</td><td> ©</td><td></td><td></td>
<td></td><td>OR*</td><td> ></td><td>Ο</td><td><δ</td><td>Ρ</td><td> 05</td><td>ίδ</td><td>OR</td><td>Ό</td><td>Ο</td><td> 05</td><td>Τ3</td><td> 05</td><td> 0</td><td></td><td>laugh</td><td>Ρ</td><td>• Ρ</td><td>Ρ</td><td>ο</td><td></td><td></td><td></td>
<td></td><td></td><td></td><td>Λ</td><td> *-1</td><td></td><td rowspan="2">to</td><td>Ε</td><td></td><td></td><td></td><td>OR</td><td>• Ρ</td><td></td><td>laugh</td><td>TS</td><td></td><td>ίδ</td><td>to</td><td>Ρ</td><td> '05</td><td>Ν</td><td>ρ</td><td></td><td></td>
<td>r-1</td><td>*you</td><td> 0</td><td>P</td><td></td><td>• rl</td><td> 05</td><td>laugh</td><td> 05</td><td>β</td><td>• Ρ</td><td>m</td><td> 05</td><td>Λ</td><td>Λ</td><td>Γ3</td><td></td><td></td><td></td><td>Ρ</td><td></td><td> 05</td><td></td><td></td>
<td rowspan="3">(OR β Μ</td><td>you</td><td> ©</td><td>laugh</td><td> 0</td><td>C</td><td>r-1</td><td> 1—1</td><td> 05</td><td>to</td><td>• Ρ</td><td>Μ</td><td>β</td><td>Η</td><td>ίδ</td><td>laugh</td><td>Ο</td><td> 05</td><td> 3</td><td>ίδ</td><td> ©</td><td> ©</td><td>to</td><td></td><td></td>
<td>υ</td><td> ></td><td> ©</td><td>Ό</td><td>β</td><td>Μ</td><td>XI</td><td>* ϋ</td><td>ο</td><td> 0</td><td>Ρ</td><td>V3</td><td>Λ</td><td>υ</td><td>laugh</td><td>Η</td><td>S</td><td> 03</td><td>laugh</td><td>W</td><td>laugh</td><td></td><td></td><td></td>
<td></td><td></td><td> 01</td><td></td><td>Μ</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>Η</td><td></td><td></td><td></td><td></td>
<td>β</td><td></td><td> 1</td><td> 0</td><td></td><td> 0</td><td>r-1</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td> 0</td><td></td><td></td><td>fi</td><td></td><td></td><td>Μ</td><td></td><td></td><td></td><td></td>
<td rowspan="2"> &</td><td></td><td> ©</td><td></td><td>(δ</td><td> 44</td><td rowspan="2"> ®</td><td></td><td></td><td> 05</td><td></td><td></td><td>η</td><td></td><td>ΤΙ</td><td>-Ρ</td><td>* Ρ</td><td> 2</td><td></td><td> ©</td><td>Ό</td><td></td><td>fi</td><td></td><td></td>
<td></td><td>P</td><td>Λ</td><td>Ό</td><td> ©</td><td>'ίδ</td><td>Η</td><td>OR</td><td></td><td></td><td>ο</td><td> >1</td><td>β</td><td>Ρ</td><td> 01</td><td>τδ</td><td></td><td> 0</td><td rowspan="2"> 2</td><td></td><td> ©</td><td></td><td></td>
<td rowspan="2">β</td><td></td><td>laugh</td><td> ©</td><td> 3</td><td>β</td><td> 0</td><td> 44</td><td> 05</td><td><δ</td><td></td><td></td><td>Η</td><td></td><td><δ</td><td>β</td><td></td><td><δ</td><td></td><td>laugh</td><td></td><td>to</td><td></td><td></td>
<td></td><td> ©</td><td>or</td><td>Ο</td><td>You</td><td></td><td> 85</td><td></td><td>X!</td><td></td><td>laugh</td><td></td><td>Ν</td><td>β</td><td>ίδ</td><td>Ρ</td><td>ο</td><td></td><td></td><td>τ3</td><td></td><td></td><td></td><td></td>
<td>ε</td><td></td><td></td><td></td><td> ©</td><td> 0</td><td>0Y</td><td> 05</td><td>β</td><td></td><td></td><td></td><td></td><td>ο</td><td>OR</td><td></td><td>ρ</td><td>• Ρ</td><td></td><td>β</td><td>• Ρ</td><td></td><td>laugh</td><td>ο</td><td></td>
<td rowspan="2">ns</td><td></td><td>laugh</td><td> 01</td><td> 01</td><td></td><td> 44</td><td></td><td> 05</td><td>OR</td><td></td><td>• Ρ</td><td></td><td> ></td><td>• Ρ</td><td>Η</td><td> ></td><td>Μί</td><td></td><td> 05</td><td>laugh</td><td></td><td></td><td>Η</td><td></td>
<td></td><td> 0)</td><td> 0</td><td></td><td>cu</td><td>β</td><td> 0</td><td></td><td>YOU</td><td></td><td> 05</td><td> 05</td><td>ίδ</td><td>ο</td><td> 2</td><td></td><td>• Ρ</td><td></td><td></td><td><δ</td><td></td><td>• Ρ</td><td rowspan="2">Λ</td><td></td>
<td>Μ</td><td></td><td>Ό</td><td></td><td> >,</td><td>you</td><td>Η</td><td> 05</td><td> 0</td><td>fi</td><td></td><td></td><td>• Ρ</td><td>Ρ</td><td>β</td><td> *3</td><td>Λ</td><td>laugh</td><td></td><td>β</td><td> ©</td><td> (*«</td><td> ©</td><td></td>
<td rowspan="2">-OR</td><td></td><td></td><td></td><td></td><td>Ρ</td><td> □</td><td>fi</td><td>• Η</td><td>«Δ</td><td></td><td></td><td>Χ2</td><td>r-í</td><td> 3</td><td></td><td>Ρ</td><td>to</td><td></td><td>Ό</td><td rowspan="2"> ©</td><td>Ρ</td><td></td><td rowspan="2"> 0</td><td></td>
<td></td><td> 05</td><td> 01</td><td> ©</td><td></td><td></td><td> '05</td><td></td><td>β</td><td></td><td>'Ρ</td><td> 6</td><td><δ</td><td>Ρ</td><td> «</td><td>ίδ</td><td>ε</td><td></td><td>Ρ</td><td> 0</td><td></td><td></td>
<td rowspan="2">β</td><td></td><td> 0)</td><td> 0</td><td> 43</td><td></td><td><δ</td><td> 44</td><td></td><td> □</td><td></td><td> 03</td><td></td><td></td><td></td><td>τί</td><td>to</td><td>(δ</td><td></td><td> ©</td><td>laugh</td><td> '9</td><td>'Ρ</td><td>• Ρ</td><td></td>
<td></td><td>laugh</td><td>g</td><td rowspan="2"> 05 3</td><td rowspan="2"> «</td><td>laugh</td><td> 01</td><td>ίδ</td><td></td><td></td><td></td><td>υ</td><td>laugh</td><td>β</td><td>• Ρ</td><td></td><td></td><td> ©</td><td>Ρ</td><td rowspan="2">ίδ</td><td> ©</td><td> ©</td><td>Λ</td><td></td>
<td>Γ ~ 1</td><td></td><td>Λ</td><td> ©</td><td></td><td rowspan="2"> 05</td><td>ϋ</td><td>β</td><td></td><td>ίδ</td><td></td><td> 0)</td><td>Ό)</td><td>laugh</td><td>fi</td><td>laugh</td><td> 05</td><td>OR</td><td>OR</td><td rowspan="2"> ©</td><td>faith</td><td></td>
<td></td><td></td><td> ©</td><td>Λ</td><td>Ρ</td><td>β</td><td></td><td></td><td>Ό</td><td></td><td>Μ</td><td> 03</td><td>Ό</td><td>Ρ</td><td>ίδ</td><td>or</td><td> 05</td><td>υ</td><td>Ρ</td><td rowspan="2"> ©</td><td>• Ρ</td><td> ©</td><td></td>
<td rowspan="2">(OR</td><td></td><td rowspan="2"> 0</td><td>or</td><td> &</td><td>δ</td><td>Ρ</td><td>laugh</td><td>β</td><td></td><td></td><td><δ</td><td></td><td></td><td> 05</td><td> 05</td><td>τι</td><td>Ό</td><td>ρ</td><td> ©</td><td>Μί</td><td>Ρ</td><td> □</td><td></td>
<td></td><td>P</td><td>ε</td><td> 44</td><td> 0</td><td> 05</td><td> 3</td><td> 05</td><td></td><td rowspan="2">to</td><td>-Ρ</td><td> 05</td><td> 05</td><td></td><td><δ</td><td></td><td>ζ</td><td>-Ρ</td><td></td><td>• Ρ</td><td> ©</td><td></td><td></td>
<td rowspan="2">Ό</td><td></td><td> 01</td><td>cu</td><td>Ο</td><td>ϋ</td><td>Π3</td><td></td><td></td><td>Ρ</td><td></td><td> 05</td><td></td><td></td><td>(δ</td><td>υ</td><td>Ρ</td><td>ίδ</td><td>TS</td><td>Ί5</td><td>laugh</td><td>CU</td><td> 03</td><td></td>
<td></td><td> 0</td><td>s</td><td rowspan="2">υ</td><td> 05</td><td>ίδ</td><td>Ο</td><td> 05</td><td> 0</td><td></td><td> 03</td><td></td><td>Χί</td><td> 01</td><td>laugh</td><td></td><td>Ρ</td><td>Ρ</td><td rowspan="2">ίδ</td><td>ίδ</td><td> &</td><td></td><td></td><td></td>
<td rowspan="2">Ο</td><td></td><td></td><td>or</td><td>β</td><td>Ν</td><td> *3</td><td></td><td>Ρ</td><td></td><td></td><td></td><td>ίδ</td><td> 05</td><td></td><td>Μί</td><td>Ρ</td><td>laugh</td><td>Ρ</td><td>Ε</td><td>co</td><td>• Ρ</td><td></td>
<td></td><td></td><td rowspan="2">or</td><td></td><td>η</td><td>• rl</td><td>you</td><td>ο</td><td> 05</td><td></td><td> >.</td><td>laugh</td><td> □</td><td>β</td><td> 01</td><td>• Ρ</td><td>β</td><td> ©</td><td>Κ</td><td>ο</td><td> ©</td><td></td><td> ©</td><td></td>
<td rowspan="2">Ό</td><td></td><td> ©</td><td> 3</td><td rowspan="2"> 0</td><td> 3</td><td>ίδ</td><td></td><td>• Η</td><td></td><td></td><td>Ο</td><td></td><td> 0</td><td> 0</td><td>laugh</td><td> 05</td><td></td><td></td><td> 52</td><td></td><td></td><td></td><td></td>
<td></td><td> 3</td><td></td><td> '0</td><td> 3</td><td>β</td><td></td><td>Ί3</td><td></td><td> 0</td><td>Η</td><td>r-í</td><td>♦ Ρ</td><td>ε</td><td>to</td><td>Ό</td><td> ©</td><td>κΝ</td><td>g</td><td>β</td><td> 0</td><td> *</td><td></td>
<td>• Η</td><td></td><td rowspan="2">c</td><td>β</td><td></td><td rowspan="2">05 β</td><td> 44</td><td>υ</td><td> ,</td><td></td><td></td><td>fi</td><td></td><td> 4)</td><td></td><td> 05</td><td>Ε</td><td rowspan="2">'ίδ</td><td>Ο</td><td></td><td>Ο</td><td> ©</td><td>β</td><td>Η</td><td></td>
<td>β</td><td></td><td> ©</td><td>χ</td><td>β</td><td></td><td> 0</td><td><δ</td><td></td><td></td><td>β</td><td></td><td> 05</td><td>Λ</td><td> 3</td><td>laugh</td><td> 0</td><td>ο</td><td rowspan="2"> ©</td><td rowspan="2"></td><td>Ο</td><td></td>
<td rowspan="2"></td><td></td><td> ©</td><td>• H</td><td>you</td><td> &</td><td></td><td>Ρ</td><td>Τ5</td><td>r-í</td><td></td><td><δ</td><td rowspan="2"> 41</td><td> 05</td><td>β</td><td>Ρ</td><td></td><td>Ρ</td><td rowspan="2">β</td><td>Ό</td><td></td><td>Η</td><td></td>
<td></td><td> □</td><td>Λ</td><td>β</td><td></td><td rowspan="2">ω</td><td> 0</td><td>β</td><td></td><td></td><td>Μ</td><td>to</td><td>η</td><td>Ρ</td><td> 3</td><td> 05</td><td>• Ρ</td><td> ©</td><td>Ό</td><td>Ρ</td><td></td><td></td>
<td>4J</td><td></td><td>ace</td><td></td><td> 0</td><td> 05</td><td>Ό</td><td> 05</td><td>β</td><td></td><td><δ</td><td>ίδ</td><td> &</td><td>υ</td><td>you·</td><td> 05</td><td> 15</td><td> 4)</td><td> 3</td><td></td><td></td><td> ©</td><td>S</td><td></td>
<td>β</td><td>Η</td><td>p</td><td>fy</td><td>OR</td><td> 05</td><td></td><td>«Δ</td><td>• rl</td><td> 05</td><td></td><td>to</td><td>υ</td><td></td><td>Ρ</td><td> 1</td><td></td><td rowspan="2"></td><td></td><td>Ρ</td><td>Ρ</td><td>Ρ</td><td>β)</td><td> ©</td><td></td>
<td rowspan="2">ο</td><td>Ο</td><td> <0</td><td>m5</td><td>ρ</td><td>Η</td><td rowspan="2"> 0</td><td>υ</td><td>Ο</td><td></td><td></td><td></td><td>Ν</td><td> 0</td><td> «</td><td> 0</td><td>β</td><td>δ</td><td></td><td> ©</td><td> ©</td><td></td><td rowspan="2"> <8</td><td></td>
<td></td><td rowspan="2">cu</td><td>p</td><td> 05</td><td>XI</td><td>• Η</td><td>β</td><td> >.</td><td></td><td>laugh</td><td> 05</td><td>fi</td><td>Ρ</td><td>α</td><td> 05</td><td> •3</td><td>g</td><td>laugh</td><td></td><td>laugh</td><td>Η</td><td></td>
<td>ο</td><td></td><td> 05</td><td> 44</td><td>(δ</td><td></td><td>Μί</td><td>TS</td><td></td><td></td><td></td><td></td><td> 05</td><td>β</td><td></td><td></td><td>Ρ</td><td>Ο</td><td> ©</td><td> 3</td><td>β</td><td rowspan="2"> ©</td><td> □</td><td></td>
<td></td><td>«S</td><td></td><td rowspan="2"> 01</td><td>β</td><td rowspan="2">ϋ</td><td>Q</td><td>• Η</td><td>Ο</td><td> 0</td><td>ί '.</td><td> 05</td><td> 3</td><td>β</td><td>• Ρ</td><td></td><td>Ρ</td><td> 3</td><td>υ</td><td rowspan="2"> 5?</td><td>OR</td><td>OR</td><td>Ν</td><td></td>
<td></td><td> 9</td><td>β</td><td></td><td rowspan="2">υ</td><td></td><td>Ρ</td><td>Ό</td><td> 0</td><td> 01</td><td></td><td rowspan="2">Λ</td><td></td><td>β</td><td><δ</td><td>Η</td><td rowspan="2">Ή</td><td>• Ρ</td><td>• Ρ</td><td> ©</td><td> 32</td><td></td>
<td></td><td></td><td> 3)</td><td>N</td><td></td><td> 01</td><td>CU</td><td>CU</td><td></td><td>Ρ</td><td></td><td></td><td> 05</td><td> 05</td><td>laugh</td><td></td><td>Ρ **</td><td>Ρ</td><td>Ρ</td><td>laugh</td><td>β</td><td></td>
<td><υ</td><td> «</td><td>-rl</td><td>or</td><td> 05</td><td>ο</td><td> 05</td><td>Ε</td><td> 05</td><td>β</td><td> 05</td><td>β</td><td> 05</td><td> 05</td><td>ίδ</td><td>• Ρ</td><td> 3</td><td>laugh</td><td> ©</td><td>Ο</td><td> 3</td><td>β</td><td>β</td><td> §</td><td></td>
<td>Ό</td><td>υ</td><td> »</td><td> ></td><td>Ό</td><td>Η</td><td>Ό</td><td>(δ</td><td>Ρ</td><td>δ</td><td> 05</td><td>Λ</td><td>cu</td><td>ω</td><td>laugh</td><td>Χ3</td><td>υ</td><td> 05</td><td> ©</td><td> ♦\5</td><td>ίδ</td><td> ©</td><td>CU</td><td>Ε</td><td></td>
<td>β Ό</td><td> 0</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>-Η</td><td> 0*</td><td>laugh</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td> 03</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>β Ο</td><td>• rl Η</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>Η</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
ES 2 201 118 T3
Ό
<td></td><td>Chain 105</td><td colspan="20">(not used)</td>
<td>OR</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td> 1)</td><td></td><td></td><td>ι — 1</td><td> (0</td><td>φ</td><td>I</td><td></td><td> |</td><td></td><td>γ4</td><td></td><td></td><td>φ</td><td></td><td></td><td></td><td> (0</td><td></td><td></td><td></td><td></td>
<td rowspan="2">Μ</td><td></td><td></td><td>Φ</td><td>Μ</td><td>Ό</td><td>you</td><td></td><td> (0</td><td>rd</td><td> (0</td><td>you</td><td> 0</td><td>Ί3</td><td>• Η</td><td>r4</td><td></td><td> 0</td><td>you</td><td></td><td></td><td></td>
<td></td><td></td><td>Ό</td><td> 0</td><td></td><td>• Η</td><td> 0</td><td>Μ</td><td>Φ</td><td>ε</td><td> 3</td><td>τι</td><td></td><td>σι</td><td>Φ</td><td></td><td> <0</td><td>Φ</td><td></td><td></td><td></td>
<td>\ <D</td><td></td><td>φ</td><td></td><td>, β</td><td>φ</td><td>Ο</td><td></td><td>m</td><td></td><td>W</td><td>ε</td><td>you</td><td> 0</td><td>-Η</td><td></td><td></td><td>CU</td><td></td><td>tn</td><td></td><td></td>
<td>4J</td><td></td><td>Λ</td><td>Μ</td><td>φ</td><td> 0</td><td>Ε</td><td>φ</td><td></td><td>Í0</td><td> 0</td><td></td><td> ?0</td><td>τι</td><td> 0</td><td>you</td><td>σ</td><td></td><td>Í0</td><td>or</td><td></td><td></td>
<td>U3</td><td></td><td>Φ</td><td> 0</td><td></td><td>Ί3</td><td></td><td>CU</td><td>ι-4</td><td>m</td><td>you</td><td>rd</td><td>ε</td><td>β</td><td>Ο</td><td> '0</td><td> 01</td><td> 03</td><td>or</td><td>rd</td><td></td><td></td>
<td rowspan="2"> 0)</td><td></td><td>Ό</td><td>• Η</td><td>φ</td><td>you</td><td>Φ</td><td></td><td>Φ</td><td>α</td><td></td><td>Φ</td><td></td><td> 3</td><td>• υ</td><td>• rl</td><td> 0</td><td></td><td>N</td><td></td><td></td><td></td>
<td></td><td></td><td>Μ</td><td> 0</td><td> (0</td><td>you</td><td> (0</td><td></td><td>η</td><td>r — 1</td><td></td><td>ι — 1</td><td>ε</td><td></td><td>Φ</td><td>Ί3</td><td></td><td>Φ</td><td> <0</td><td></td><td></td>
<td></td><td></td><td> 0</td><td>Φ</td><td>ε</td><td>b</td><td> 0</td><td>τ</td><td></td><td>UI</td><td>Φ</td><td>Φ</td><td>Φ</td><td></td><td></td><td></td><td>β</td><td></td><td>you</td><td></td><td></td><td></td>
<td>i<sup>1 1</sup> i</td><td></td><td>T3</td><td>JJ</td><td> 9!</td><td></td><td>• rl</td><td> (0</td><td> (0</td><td></td><td> ></td><td>JJ</td><td></td><td>rd</td><td> <·></td><td> 0</td><td>f0</td><td> «.</td><td>g</td><td> 4)</td><td></td><td></td>
<td rowspan="2">you</td><td></td><td>• rl</td><td>you</td><td>Λ</td><td>Φ</td><td>υ</td><td></td><td>β</td><td> «</td><td>• rl</td><td>you</td><td> «.</td><td>Φ</td><td>β</td><td>4J</td><td>and</td><td> 0</td><td></td><td>• rl</td><td></td><td></td>
<td></td><td> 3</td><td>• rl</td><td>OR</td><td> 0</td><td>OR</td><td>jj</td><td> 0</td><td> £0</td><td>you</td><td>Φ</td><td>you</td><td></td><td>OR</td><td>Φ</td><td></td><td>you</td><td>M</td><td>Λ</td><td></td><td></td>
<td>TS</td><td></td><td>fi</td><td></td><td>Μ</td><td>r- |</td><td>φ</td><td>β</td><td>• Η</td><td>JJ</td><td></td><td>ε</td><td>Φ</td><td> >4</td><td>JJ</td><td>Ή</td><td>Φ</td><td></td><td>ai</td><td>Is</td><td></td><td></td>
<td></td><td></td><td></td><td></td><td> 01</td><td></td><td>rd</td><td>φ</td><td>υ</td><td>you</td><td>β</td><td> (0</td><td>ε</td><td></td><td></td><td>τ?</td><td>OR</td><td> $</td><td> 0</td><td> <0</td><td></td><td></td>
<td rowspan="2"> 0</td><td></td><td>rl</td><td>Φ</td><td>ε</td><td>Φ</td><td>Φ</td><td></td><td>β</td><td> •«4</td><td>Ρ</td><td>JJ</td><td>you</td><td> «.</td><td>rd</td><td></td><td>JJ</td><td></td><td></td><td>or</td><td></td><td></td>
<td></td><td>ω</td><td>Ί3</td><td> 0</td><td>JJ</td><td>οι</td><td> <0</td><td>you</td><td> □</td><td></td><td>you</td><td>r4</td><td>φ</td><td> 4)</td><td></td><td>Φ</td><td>Í0</td><td> ·.</td><td></td><td></td><td></td>
<td>or</td><td></td><td></td><td></td><td>OR</td><td>you</td><td></td><td>you</td><td> <4-1</td><td></td><td>Í0</td><td>Φ</td><td> 0</td><td>υ</td><td>τι</td><td></td><td>Φ</td><td> 0</td><td>rd</td><td> 03</td><td></td><td></td>
<td>• rl</td><td>or</td><td> •</td><td>β</td><td></td><td>Φ</td><td></td><td>you</td><td></td><td>Φ</td><td></td><td>γ4</td><td> ></td><td>β</td><td></td><td> 0</td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td>rd</td><td> •</td><td><ι></td><td> .</td><td>ε</td><td>Μ</td><td></td><td> (0</td><td>τι</td><td>you</td><td></td><td></td><td> 3</td><td>r4</td><td>τι</td><td>Φ</td><td>H</td><td>• rl</td><td>• r |</td><td></td><td></td>
<td>4-i</td><td></td><td></td><td>Ό</td><td> 0</td><td><ΰ</td><td> 0</td><td>Φ</td><td>tn</td><td></td><td>Φ</td><td>Φ</td><td>rd</td><td>r — 1</td><td>ρ</td><td>• Η</td><td>τ3</td><td></td><td> 03</td><td> 01</td><td></td><td></td>
<td>ω</td><td>you</td><td>ε</td><td>Φ</td><td> 04</td><td>τ3</td><td>Μ</td><td>τι</td><td> (0</td><td> 0</td><td>ε</td><td>Μ</td><td>Φ</td><td> <0</td><td>Μ</td><td> 3</td><td></td><td>ai</td><td></td><td></td><td></td><td></td>
<td>\ Q</td><td> 9</td><td></td><td>OR</td><td>• rl</td><td>• Η</td><td>-OR</td><td></td><td>β</td><td>Π</td><td>you</td><td>• Η</td><td>τ3</td><td>β</td><td>JJ</td><td>β</td><td> 0</td><td>φ</td><td></td><td></td><td></td><td></td>
<td></td><td>*or</td><td> £</td><td>OR</td><td> 3</td><td> 04</td><td>you</td><td>ε</td><td></td><td>τι</td><td>γ4</td><td>σι</td><td></td><td></td><td>you</td><td></td><td></td><td>r4</td><td> •</td><td></td><td></td><td></td>
<td>C-5</td><td>you</td><td> 2</td><td> 0</td><td></td><td>Μ0</td><td> 0</td><td> (0</td><td> 0</td><td> (0</td><td> 0</td><td></td><td> 0</td><td>φ</td><td> 0</td><td> <0</td><td>• rl</td><td>you</td><td>'rd</td><td>OR</td><td></td><td></td>
<td>cn</td><td>or</td><td>EC</td><td>PU</td><td>Φ</td><td>Μ</td><td>OR</td><td>JJ</td><td>you</td><td>β</td><td> ></td><td> >1</td><td>τι</td><td>τι</td><td>υ</td><td>you</td><td>cn</td><td>CU</td><td>Φ</td><td>rd</td><td></td><td></td>
<td>ftí</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>-H</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>You</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td> (0</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td></td><td> 0</td><td></td><td> ¿</td><td>Φ</td><td> 0</td><td>'Φ</td><td> 0</td><td>Φ</td><td></td><td></td><td>Í0</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>r-Í</td><td></td><td>Φ</td><td></td><td> 0</td><td>Ό</td><td>τι</td><td>JJ</td><td>φ</td><td>Η</td><td></td><td> 0</td><td>τ3</td><td></td><td>you</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>OJ</td><td></td><td>Λ</td><td> (1)</td><td> 04</td><td></td><td>φ</td><td>Φ</td><td>φ</td><td></td><td>γ4</td><td>Μ</td><td>φ</td><td></td><td>φ</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>rrd</td><td></td><td> 3</td><td>τι</td><td></td><td>Φ</td><td>Τ3</td><td>ω</td><td>φ</td><td></td><td> (0</td><td> 0</td><td>you</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>(J</td><td></td><td>Λ</td><td></td><td>you</td><td> 3</td><td>you</td><td></td><td>τ</td><td> 0</td><td>you</td><td></td><td> 0</td><td></td><td> (0</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td></td><td></td><td>Ν</td><td>φ</td><td> □</td><td>φ</td><td>ω</td><td></td><td> 3</td><td>OR</td><td>ρ</td><td></td><td></td><td>υ</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td> 0</td><td>Γ0</td><td>you</td><td> (0</td><td></td><td> 51</td><td> ></td><td> ()</td><td>β</td><td>S</td><td></td><td>Μ</td><td>φ</td><td></td><td>Ν</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td>or</td><td>Go</td><td> 04</td><td>Μ</td><td> &</td><td></td><td> <</td><td> '10</td><td> (0</td><td>Μ</td><td>JJ</td><td>S.</td><td></td><td>Φ</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td>H</td><td>σι</td><td> <0</td><td>Φ</td><td></td><td>φ</td><td></td><td>JJ</td><td></td><td>Φ</td><td> 0</td><td>σ '</td><td> «</td><td>you</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>sx</td><td></td><td>φ</td><td>α</td><td> ></td><td></td><td> 0</td><td>φ</td><td>Φ</td><td>φ</td><td> ></td><td></td><td></td><td>Μ</td><td> <0</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td> £</td><td>you</td><td>rd</td><td></td><td>ί — 1</td><td> ¢0</td><td>r4</td><td>Ό</td><td>Φ</td><td>τι</td><td>r4</td><td>Go</td><td> <0</td><td>• Η</td><td>ε</td><td> •</td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td> 3</td><td>φ</td><td> 0</td><td> 0</td><td>ε</td><td></td><td></td><td></td><td></td><td> 0</td><td>Φ</td><td>ε</td><td>Ρ<sup>1</sup></td><td>Η</td><td>S</td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td> *0</td><td></td><td>τι</td><td>φ</td><td>Φ</td><td>Φ</td><td>Φ</td><td> 0</td><td>φ</td><td>φ</td><td>rd</td><td>Φ</td><td>Μ</td><td>φ</td><td>η</td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>'OR</td><td>you</td><td>φ</td><td>• rl</td><td>φ</td><td></td><td> 3</td><td>Φ</td><td>φ</td><td> 0</td><td>φ</td><td> ¿</td><td>r4</td><td>you</td><td>ΡΜ</td><td>ο</td><td></td><td></td><td></td><td></td><td></td><td></td>
<td><and</td><td>υ</td><td>S</td><td></td><td> 0</td><td>β</td><td> &</td><td> 0</td><td> 0</td><td>φ</td><td> 0</td><td> &</td><td>β</td><td>Φ</td><td></td><td>γ4</td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>r — j</td><td></td><td> 1</td><td></td><td></td><td></td><td></td><td> <0</td><td></td><td></td><td></td><td></td><td></td><td></td><td> >1</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td> 1)</td><td></td><td>φ</td><td></td><td></td><td></td><td>φ</td><td>| Μ</td><td></td><td></td><td></td><td>Φ</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td></td><td> 3</td><td></td><td></td><td></td><td>φ</td><td> (0</td><td> «0</td><td></td><td></td><td>τι</td><td>φ</td><td></td><td>(Λ</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>nd</td><td></td><td>β</td><td> 10</td><td> (0</td><td>you</td><td>JJ</td><td> 0</td><td> 0</td><td></td><td> 0</td><td></td><td> (0</td><td></td><td>W</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td></td><td></td><td></td><td>Ή</td><td>'φ</td><td>β</td><td></td><td> 0</td><td></td><td> 0</td><td> 0</td><td>JJ</td><td> «.</td><td></td><td></td><td>β</td><td></td><td></td><td></td><td></td><td></td>
<td> ^4</td><td></td><td>φ</td><td>α)</td><td> 0</td><td>Η</td><td>φ</td><td> 0</td><td></td><td></td><td>ε</td><td>φ</td><td>Φ</td><td>ε</td><td>rd</td><td></td><td>Φ</td><td></td><td></td><td></td><td></td><td></td>
<td></td><td></td><td>Μ</td><td>τι</td><td>• σ</td><td>Λ</td><td>you</td><td>φ</td><td>φ</td><td></td><td> 0</td><td>Μ</td><td>Φ</td><td> 0</td><td>you</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td></td><td> 0</td><td></td><td>η</td><td>ΐ</td><td>η</td><td>Μ</td><td>ε</td><td></td><td>OR</td><td>'Φ</td><td></td><td>υ</td><td> 0</td><td></td><td>Í0</td><td></td><td></td><td></td><td></td><td></td>
<td>r ^ 4</td><td></td><td>ε</td><td>φ</td><td> 04</td><td> 10</td><td> 04</td><td>'φ</td><td></td><td></td><td></td><td>JJ</td><td>Φ</td><td>you</td><td>U3</td><td></td><td>Φ</td><td></td><td></td><td></td><td></td><td></td>
<td></td><td>C3</td><td> 0</td><td>V</td><td></td><td>JJ</td><td>ε</td><td>JJ</td><td> 0</td><td></td><td>φ</td><td>Φ</td><td>τι</td><td></td><td></td><td></td><td>N</td><td></td><td></td><td></td><td></td><td></td>
<td>rp</td><td>or</td><td>α</td><td></td><td></td><td></td><td> 0</td><td>φ</td><td>Τ3</td><td></td><td>τι</td><td>Φ</td><td></td><td></td><td> *</td><td></td><td>Φ</td><td></td><td></td><td></td><td></td><td></td>
<td> £</td><td>rd</td><td></td><td>Λ</td><td>φ</td><td> 0</td><td>OR</td><td>φ</td><td>• rl</td><td></td><td>you</td><td></td><td>τι</td><td> ··</td><td>Μ</td><td></td><td>you</td><td></td><td></td><td></td><td></td><td></td>
<td> £5</td><td></td><td> 0</td><td> (0</td><td>φ</td><td> (0</td><td></td><td></td><td>you</td><td></td><td>φ</td><td>Φ</td><td><β</td><td>φ</td><td> 4)</td><td> «</td><td>m</td><td></td><td></td><td></td><td></td><td></td>
<td>tO</td><td> (4</td><td>Τ3</td><td> □</td><td> 0</td><td> 0</td><td> 01</td><td>you</td><td> 0</td><td></td><td> ></td><td>Φ</td><td>Τ3</td><td> 10</td><td>Φ</td><td>r4</td><td>F</td><td></td><td></td><td></td><td></td><td></td>
<td></td><td>s</td><td>you</td><td></td><td> 0</td><td> 0</td><td>OR</td><td> 01</td><td>φ</td><td></td><td></td><td>JJ</td><td>rl</td><td>Φ</td><td>β</td><td>γ4</td><td>H</td><td></td><td></td><td></td><td></td><td></td>
<td></td><td>*or</td><td> 3</td><td>οι</td><td> ></td><td>• η</td><td> 0</td><td></td><td></td><td> •</td><td>Η</td><td>β</td><td>rd</td><td>Μ</td><td> 0</td><td>Φ</td><td>Φ</td><td> 03</td><td></td><td></td><td></td><td></td>
<td></td><td> (8</td><td>α</td><td> 0</td><td> <0</td><td>Φ</td><td>4J</td><td>φ</td><td>β</td><td> 0</td><td>Y</td><td>φ</td><td> 10</td><td> <0</td><td>• rl</td><td>Μ</td><td>CU</td><td>OR</td><td></td><td></td><td></td><td></td>
<td>to</td><td>Ό</td><td>or</td><td> ></td><td>JJ</td><td>ε</td><td> 0</td><td>Τ3</td><td>you</td><td>τ!</td><td></td><td>β</td><td>or</td><td>ε</td><td>you</td><td> &</td><td></td><td>rd</td><td></td><td></td><td></td><td></td>
<td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td></td><td></td><td></td><td> 1</td><td></td><td> 1</td><td></td><td></td><td></td><td></td><td> 0</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>you</td><td></td>
<td></td><td></td><td></td><td> 1</td><td></td><td></td><td> 0</td><td>I</td><td></td><td></td><td> 1</td><td>φ</td><td>Φ</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td>Φ</td><td></td>
<td>CD</td><td></td><td> 0</td><td> 0</td><td>γ4</td><td> *</td><td> 0</td><td></td><td></td><td></td><td>♦ Η</td><td> 0</td><td>TJ</td><td>Φ</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>T3</td><td></td><td>τ3</td><td>Μ</td><td> <0</td><td>Μ</td><td>CU</td><td> 10</td><td></td><td>Φ</td><td>ε</td><td> '4)</td><td></td><td>Í0</td><td> «.</td><td></td><td>τι</td><td></td><td></td><td>-r |</td><td> <0</td><td></td>
<td></td><td></td><td></td><td> 04</td><td>Φ</td><td> <0</td><td></td><td></td><td>you</td><td>η</td><td>you</td><td>JJ</td><td>Φ</td><td>Ο</td><td>4Y</td><td>β</td><td>υ</td><td></td><td>M</td><td>JJ</td><td>or</td><td></td>
<td> • 11</td><td></td><td>you</td><td></td><td></td><td></td><td>φ</td><td> 01</td><td>φ</td><td>Τ3</td><td> 03</td><td>Φ</td><td>Φ</td><td>Μ</td><td>Φ</td><td> 10</td><td>r4</td><td></td><td>Φ</td><td>g</td><td>N</td><td></td>
<td>σ</td><td></td><td>Η</td><td>you</td><td> <0</td><td>you</td><td>φ</td><td> 0</td><td>τι</td><td>• rl</td><td></td><td>W</td><td>OR</td><td> <0</td><td> 0</td><td> ></td><td>Φ</td><td></td><td>• rd</td><td> 0</td><td>Φ</td><td></td>
<td>T)</td><td></td><td></td><td> '0</td><td></td><td>OR</td><td></td><td></td><td>φ</td><td> 3</td><td>Φ</td><td></td><td>OR</td><td>ε</td><td>W</td><td></td><td> ></td><td></td><td> 3,</td><td>υ</td><td>s</td><td></td>
<td>-H</td><td></td><td></td><td>Ή</td><td></td><td>• rl</td><td>(Η</td><td></td><td>you</td><td>Η</td><td> 3</td><td>Μ</td><td> ></td><td></td><td></td><td> «·</td><td></td><td></td><td>σ '</td><td></td><td> <0</td><td></td>
<td></td><td></td><td> <0</td><td> 01</td><td>Φ</td><td>μ</td><td>ε</td><td>φ</td><td>you</td><td>4J</td><td> &</td><td>Y</td><td> (0</td><td>Φ</td><td> 0</td><td>r4</td><td></td><td></td><td>rd</td><td>i®</td><td>F</td><td></td>
<td>β</td><td>rd</td><td>Λ</td><td>Μ</td><td>τ</td><td>you</td><td>φ</td><td>4J</td><td></td><td>Φ</td><td></td><td></td><td>JJ</td><td>τ5</td><td>ε</td><td>r4</td><td></td><td></td><td> (0</td><td></td><td>H</td><td></td>
<td> 0)</td><td>OR</td><td></td><td> 0</td><td></td><td>Í0</td><td></td><td>you</td><td> <</td><td>Φ</td><td>Φ</td><td></td><td>r4</td><td></td><td> 0</td><td>Φ</td><td>you</td><td></td><td>you</td><td> 10</td><td>Φ</td><td></td>
<td>I)</td><td>H</td><td> 0</td><td>JJ</td><td>φ</td><td></td><td> 0</td><td>Φ</td><td>φ</td><td>τι</td><td>τί</td><td>φ</td><td>Í0</td><td>τι</td><td>υ</td><td>you</td><td>Φ</td><td></td><td>or</td><td>CU</td><td>CU</td><td></td>
<td></td><td></td><td>you</td><td>Φ</td><td>JJ</td><td></td><td> 0</td><td>ε</td><td>Φ</td><td></td><td> 0</td><td>Ρ</td><td></td><td> «0</td><td></td><td> 03</td><td>Φ</td><td></td><td></td><td></td><td></td><td></td>
<td>AND</td><td>you</td><td></td><td></td><td>you</td><td>Φ</td><td> 0</td><td>φ</td><td>υ</td><td> 0</td><td>Φ</td><td> 0</td><td>Φ</td><td>τι</td><td>φ</td><td></td><td>JJ</td><td></td><td>Φ</td><td> <0</td><td></td><td></td>
<td> 0</td><td></td><td> 0</td><td>Ό</td><td>Φ</td><td>τι</td><td>Α</td><td></td><td> 0</td><td> (0</td><td> 3</td><td>JJ</td><td>τι</td><td>• rl</td><td>φ</td><td> -</td><td>Φ</td><td></td><td>Φ</td><td>rd</td><td>Ki</td><td>r-%</td>
<td>rj</td><td></td><td>ε</td><td></td><td>* ϋ</td><td></td><td></td><td>λ</td><td> ></td><td>JJ</td><td>fy</td><td>φ</td><td>you</td><td>Η</td><td>r4</td><td>W</td><td> 14</td><td> •</td><td>Γ— |</td><td> 0</td><td> <0</td><td>rd</td>
<td></td><td>you</td><td> 0</td><td></td><td>Φ</td><td> 10</td><td></td><td> (0</td><td> 10</td><td>Φ</td><td>Φ</td><td>Ή</td><td>φ</td><td> (0</td><td> (0</td><td>or</td><td>Φ</td><td>Φ</td><td>you</td><td>Φ</td><td> 3</td><td>OR</td>
<td>r — í</td><td>OR</td><td>OR</td><td>β</td><td>α</td><td>Τ3</td><td> <0</td><td>Λ</td><td>4J</td><td>Φ</td><td></td><td>you</td><td> . ></td><td>OR</td><td>JJ</td><td>bi</td><td>τι</td><td>you</td><td>cu</td><td>JJ</td><td>you</td><td>rd</td>
<td> 0)</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>τ)</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>P¡</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td> '0</td><td> 0</td><td>Η</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>-H</td><td>R</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td> 3</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>or</td><td>H</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
ES 2 201 118 T3
Ό 7)
O. W a · aa β o «w
<td></td><td> 0)</td><td>tn</td><td> 0</td><td> 41</td><td></td><td>you</td><td>OR</td><td>ri</td><td>you</td><td>you</td><td> <8</td><td></td><td>-ri</td><td>P</td><td>M</td><td>tn</td><td>you</td><td>p</td><td></td><td>you</td><td>you</td>
<td></td><td>Μ</td><td>or</td><td>fc</td><td>xt</td><td>T3</td><td></td><td>Ux</td><td>you</td><td>P</td><td>r — i</td><td>you</td><td> <8</td><td>ri</td><td>P</td><td>'you</td><td></td><td>μ</td><td> 0</td><td>you</td><td></td><td>T3</td>
<td></td><td rowspan="2">'(OR</td><td></td><td> 0</td><td></td><td> <8</td><td></td><td></td><td></td><td> 33</td><td>r — i</td><td>OR</td><td></td><td></td><td>you</td><td>P</td><td>tn</td><td>tn</td><td>J></td><td>B</td><td>you</td><td>you</td>
<td></td><td>ei</td><td>Ό</td><td>you</td><td>You</td><td> 0</td><td> 03</td><td>you</td><td>• rl</td><td>♦ rl</td><td>Ή</td><td>P</td><td> 03</td><td>I heard</td><td> 03</td><td>•you*</td><td>you</td><td>you</td><td>you</td><td></td><td>ts</td>
<td></td><td> 4-4</td><td> 3</td><td></td><td> 0</td><td> <0</td><td> &</td><td> 0</td><td> 3</td><td>ri</td><td>Λ</td><td>υ</td><td> (8</td><td>or</td><td>you</td><td>ω</td><td></td><td></td><td>P</td><td>P</td><td>p</td><td>you</td>
<td></td><td>ω</td><td>δ</td><td> *</td><td>You</td><td>• ri</td><td>ε</td><td>You</td><td>σι</td><td></td><td>υ</td><td>you</td><td> £</td><td></td><td>You</td><td></td><td>OR</td><td>you</td><td></td><td>tn</td><td>f3</td><td></td>
<td></td><td>Q</td><td>• χ,</td><td>'you</td><td>you</td><td>or</td><td>(OR</td><td>you</td><td>you</td><td> 03</td><td>υ</td><td>r — i</td><td>you</td><td></td><td></td><td>ω</td><td></td><td></td><td>p</td><td> 0</td><td>you</td><td>or</td>
<td></td><td></td><td>you</td><td>•or</td><td> (8</td><td> 3</td><td>• Η</td><td> (8</td><td>to</td><td>υ</td><td> 03</td><td> 0</td><td>r-1</td><td>you</td><td>H</td><td>υ</td><td>OR</td><td>you</td><td>or</td><td>P</td><td> 0</td><td>you</td>
<td></td><td>r — i</td><td>or</td><td> <</td><td> £</td><td>ω</td><td>Ρ</td><td>and</td><td></td><td>•or</td><td><u</td><td> 03</td><td>«H</td><td>to</td><td>M</td><td>rt¡</td><td>IT IS</td><td>χ</td><td>I heard</td><td>to</td><td></td><td></td>
<td></td><td>you</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td>Ό</td><td></td><td></td><td></td><td></td><td></td><td></td><td>Οι</td><td></td><td> 0</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td></td><td></td><td></td><td></td><td></td><td> 0</td><td></td><td> 0</td><td></td><td>μ</td><td>OR</td><td></td><td></td><td>you</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td rowspan="2"> 0</td><td></td><td>(OR</td><td></td><td>you</td><td>you</td><td></td><td>Ό</td><td></td><td>δ)</td><td>r — i</td><td></td><td> 8)</td><td>you</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td></td><td> 2,</td><td> 0</td><td>Rh</td><td>you</td><td></td><td>• Η</td><td></td><td>to</td><td></td><td> 03</td><td>ε</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td>Ο</td><td></td><td>σ *</td><td> 01</td><td>Λ</td><td></td><td></td><td>you</td><td></td><td></td><td>or</td><td>you</td><td></td><td>and</td><td></td><td>or</td><td></td><td></td><td></td><td></td><td></td>
<td></td><td></td><td></td><td></td><td>you</td><td> <8</td><td>C</td><td></td><td>J4</td><td></td><td>w</td><td>ε</td><td></td><td>you</td><td>• ri</td><td></td><td>P</td><td></td><td></td><td></td><td></td><td></td>
<td></td><td>4J</td><td></td><td> 0</td><td>you</td><td> 34</td><td>I heard</td><td></td><td>• Η</td><td></td><td>M</td><td>or</td><td> 0</td><td> 3</td><td>or</td><td></td><td>P</td><td></td><td></td><td></td><td></td><td></td>
<td></td><td></td><td></td><td>r — i</td><td>P</td><td> 0</td><td></td><td></td><td>Ρ</td><td></td><td> «</td><td>or</td><td>P</td><td> &</td><td>OR</td><td></td><td> 0</td><td></td><td></td><td></td><td></td><td></td>
<td></td><td>U3</td><td></td><td></td><td></td><td>Μ</td><td> 0</td><td></td><td>Ρ</td><td></td><td>You</td><td></td><td>you</td><td></td><td>you</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td></td><td>Ό</td><td></td><td>P</td><td> 4)</td><td>to</td><td>or</td><td></td><td> 03</td><td></td><td> 3</td><td> 0</td><td> <8</td><td>N</td><td> 0</td><td></td><td>you</td><td></td><td></td><td></td><td></td><td></td>
<td></td><td>you</td><td></td><td>you</td><td> 3</td><td></td><td>♦ Η</td><td></td><td>• Η</td><td></td><td></td><td>you</td><td>p</td><td>(OR</td><td>or</td><td></td><td> 14</td><td></td><td></td><td></td><td></td><td></td>
<td>you'</td><td>m</td><td></td><td>you Ή</td><td>σ</td><td>w you</td><td>Μ Ρ</td><td></td><td>τί</td><td></td><td> (8</td><td> 0</td><td>p</td><td> ></td><td>P</td><td></td><td>you you"</td><td></td><td></td><td></td><td></td><td></td>
<td>Ό</td><td></td><td></td><td>Cn</td><td> <0</td><td></td><td>α</td><td></td><td>you</td><td></td><td>OR</td><td>or</td><td>OR</td><td>you</td><td> 0</td><td></td><td></td><td></td><td></td><td></td><td></td><td></td>
<td>• rl</td><td>• Η</td><td></td><td> $</td><td>υ</td><td> 0</td><td> '4!</td><td></td><td> 83</td><td></td><td>You</td><td>you</td><td>α</td><td> £</td><td>-ri</td><td></td><td> 0</td><td></td><td></td><td></td><td></td><td></td>
<td></td><td rowspan="2">Τ3</td><td></td><td>S</td><td>P</td><td>to</td><td>rrj</td><td></td><td></td><td></td><td>• ri</td><td>rt</td><td></td><td>• H</td><td>you</td><td></td><td>P</td><td> 0</td><td></td><td></td><td></td><td></td>
<td>or</td><td></td><td>• H</td><td><s</td><td>σ *</td><td>you</td><td> •</td><td> <8</td><td></td><td>You</td><td> 0</td><td> ».</td><td></td><td>g</td><td></td><td> 83</td><td> ></td><td></td><td></td><td></td><td></td>
<td>π5</td><td></td><td></td><td></td><td>You</td><td></td><td></td><td> 03</td><td></td><td></td><td> 0</td><td> ></td><td> 03</td><td> '0</td><td></td><td></td><td>-H</td><td>-r |</td><td></td><td></td><td></td><td></td>
<td></td><td>r-Η</td><td></td><td> 0</td><td></td><td> 0</td><td>you</td><td><u</td><td>you</td><td></td><td>to</td><td> 0</td><td> 0</td><td>M</td><td>you</td><td></td><td></td><td>p</td><td></td><td></td><td></td><td></td>
<td></td><td></td><td></td><td>Xf</td><td> 03</td><td><U</td><td>ε</td><td>p</td><td>b</td><td></td><td></td><td></td><td>P</td><td>Qq</td><td>you</td><td></td><td></td><td>OR</td><td></td><td></td><td></td><td></td>
<td>β</td><td>Φ</td><td></td><td>you</td><td> 0</td><td>Ρ</td><td>(OR</td><td>you</td><td> <8</td><td></td><td>μ</td><td> 0</td><td>μ</td><td></td><td></td><td>or</td><td>'you</td><td>you</td><td></td><td></td><td></td><td></td>
<td>-Η</td><td>Ό</td><td></td><td>you</td><td>ri</td><td>υ</td><td>r — 1</td><td> 0</td><td>r — j</td><td></td><td>you</td><td> >.</td><td> 83</td><td>you</td><td>'you</td><td>CU</td><td>P</td><td>μ</td><td></td><td></td><td></td><td></td>
<td></td><td></td><td></td><td>I heard</td><td></td><td></td><td>Ρ</td><td>you</td><td>r — i</td><td></td><td> -9</td><td></td><td>to</td><td>r — i</td><td>P</td><td>-rl</td><td> 03</td><td>you</td><td>H</td><td></td><td></td><td></td>
<td></td><td rowspan="2"> 0</td><td></td><td></td><td>s</td><td> ♦</td><td>ρ</td><td>or</td><td></td><td></td><td>to</td><td> «</td><td>X</td><td></td><td>You</td><td>you</td><td>you</td><td>p</td><td>OR</td><td></td><td></td><td></td>
<td></td><td></td><td> 0</td><td> 0</td><td> 03</td><td>Μ</td><td>to</td><td> 0</td><td> ♦</td><td>P</td><td>you</td><td>you</td><td>you</td><td>you</td><td> 5·</td><td></td><td>you</td><td></td><td></td><td></td><td></td>
<td>ο</td><td></td><td></td><td>you</td><td>υ</td><td>δ)</td><td>to</td><td></td><td> 2,</td><td>yes,</td><td></td><td>σ</td><td></td><td> 3</td><td>you</td><td>you</td><td></td><td>• rl</td><td></td><td></td><td></td><td></td>
<td rowspan="2">υ</td><td>η.</td><td> «<#*</td><td></td><td></td><td>ri</td><td></td><td> 0</td><td></td><td>You</td><td>OR</td><td></td><td> 83</td><td>σ '</td><td>P</td><td></td><td>μ</td><td></td><td>you</td><td></td><td></td><td>you</td>
<td>Β<sup>1</sup></td><td>or</td><td></td><td>r — i</td><td>Λ</td><td>you</td><td>or</td><td></td><td> (8</td><td>you</td><td>you</td><td>OR</td><td></td><td></td><td>you</td><td>or</td><td>you</td><td></td><td></td><td></td><td>T3</td>
<td></td><td></td><td>rl</td><td>you</td><td> <8</td><td>• Η</td><td> 3</td><td></td><td> 0</td><td>N</td><td></td><td>You</td><td>ri</td><td>δ)</td><td> 0</td><td>to</td><td> ></td><td>g</td><td>you</td><td></td><td></td><td>you</td>
<td></td><td> 0)</td><td></td><td>P</td><td>ε</td><td>you</td><td></td><td> 03</td><td>P</td><td>-rl</td><td> 0</td><td>μ</td><td></td><td>Η</td><td>or</td><td></td><td>you</td><td>you</td><td></td><td></td><td></td><td> 03</td>
<td></td><td></td><td>you</td><td>fci</td><td></td><td> 0</td><td> 0</td><td>υ</td><td>you</td><td>P</td><td>P</td><td>flí</td><td>you</td><td> 44</td><td>• ri</td><td>you</td><td>M4</td><td>P</td><td></td><td></td><td></td><td>you</td>
<td></td><td>Γ ©</td><td>δ</td><td>i<sup>0</sup></td><td> '<8</td><td>to</td><td>Ρ</td><td>r — i</td><td>• H</td><td> 0</td><td>you</td><td> 3</td><td>you</td><td>• rl</td><td></td><td>You</td><td></td><td>tn</td><td> £</td><td></td><td></td><td></td>
<td></td><td>φ</td><td>* ΰ</td><td>P</td><td>P</td><td>you</td><td>you</td><td></td><td> 01</td><td>P</td><td>you</td><td> 5</td><td>υ</td><td> 03</td><td>-H</td><td></td><td>μ</td><td> 0</td><td>you</td><td></td><td></td><td>or</td>
<td><ύ</td><td></td><td>you</td><td>you</td><td> 03</td><td>• Η</td><td>you</td><td> 0</td><td> 3</td><td> 3</td><td>• rl</td><td> 0</td><td>you</td><td> 0</td><td>P</td><td> 0</td><td>OR</td><td>Y</td><td>or</td><td></td><td></td><td>CJ</td>
<td> 3</td><td>r — i</td><td> □</td><td>or</td><td>you</td><td>Ό</td><td>b</td><td>You</td><td>w</td><td>you</td><td> 03</td><td>P</td><td>Λ</td><td>to</td><td>you</td><td>P</td><td>I heard</td><td>to</td><td></td><td></td><td></td><td></td>
OQ
Ο.
XJ
Ό • Η <β β β 4J
Μ (β '0)! Β
<td></td><td></td><td>P</td><td></td><td>1 • rl</td><td>μ</td><td></td><td>i</td><td></td><td>mu</td><td></td><td>t you</td><td>t</td><td></td><td>you</td><td></td>
<td></td><td></td><td> 83</td><td></td><td>P</td><td>you</td><td></td><td> 03</td><td>μ</td><td>P</td><td>you</td><td>P</td><td>or</td><td></td><td>or</td><td></td>
<td>you</td><td></td><td></td><td> ></td><td>μ</td><td>You</td><td></td><td>(OR</td><td> 0</td><td> 03</td><td>μ</td><td>m</td><td>you</td><td></td><td>N</td><td></td>
<td>P</td><td>you</td><td>μ</td><td>you</td><td>you</td><td> 3</td><td> 3</td><td></td><td>I heard</td><td>(OR</td><td>you</td><td>OR</td><td>μ</td><td></td><td>you</td><td></td>
<td>m</td><td></td><td>you</td><td>P</td><td> ></td><td>you</td><td> 83</td><td>you</td><td></td><td></td><td>to</td><td>P</td><td>you</td><td></td><td>you</td><td></td>
<td>you</td><td>μ</td><td> ></td><td>you</td><td>«Rl</td><td>μ</td><td></td><td>ε</td><td> «</td><td> *</td><td></td><td>to</td><td>P</td><td></td><td> 3</td><td>-H</td>
<td>ri</td><td>you</td><td>r — i</td><td></td><td>Xf</td><td>to</td><td>you</td><td>you</td><td>η</td><td>μ</td><td> 0</td><td></td><td>you</td><td></td><td></td><td>OR</td>
<td>you</td><td>You</td><td>or</td><td>Λ</td><td></td><td>you</td><td>μ</td><td>P</td><td>OR</td><td> 0</td><td>P</td><td> 0</td><td>• H</td><td>OR</td><td>P</td><td>rl</td>
<td></td><td> 3</td><td> 03</td><td>OR</td><td> 4)</td><td></td><td>Λ</td><td> 03</td><td>P</td><td> ></td><td>EQ</td><td>P</td><td></td><td> ></td><td>you</td><td></td>
<td> 0</td><td>s</td><td>you</td><td>μ</td><td> 3</td><td> 0</td><td>or</td><td>• rl</td><td>'you</td><td>you</td><td>• ri</td><td>P</td><td>you</td><td>• H</td><td>to</td><td>you</td>
<td>s</td><td>you</td><td>μ</td><td>to</td><td>£ j</td><td>You</td><td>CO</td><td> 03</td><td>P</td><td>P</td><td>Rh</td><td> 0</td><td>b</td><td>P</td><td></td><td><u</td>
ES 2 201 118 T3
6. Folding the branches of the hierarchical tree diagram
Note that in Figure 5, the branches of the hierarchical tree diagram require the use of five data strings (101-105) at time T4. Although the system is capable of dynamically assigning data strings, there is another preferred way to reduce the number of data strings.
Figure 6 shows a generalized hierarchical tree graph of the hierarchical tree diagram depicted in Figure 4 and the data strings illustrated in Figure 5. The locations of the data strings are illustrated in dotted lines in Figure 6. The Information portions 210 of frames 200 are illustrated in FIG. 6 with similar numbering to that in FIG. 5. The command portions, where illustrated, are shown as branches in the tree chart.
Because information chains are capable of carrying branching instructions, and due to the hierarchical nature of the expert system, the number of chains can be reduced by "folding" the branches of the hierarchical tree. The "folding" solution simply optimizes the required number of chains required by making use of the timing segments of the program.
Figure 7 illustrates an example of "folding" the hierarchical tree of Figure 6. Instead of remaining in the data stream (103) after the information part (244), the command part (344) can instruct to the interactive terminal to switch to the data string (102). This normally leads to an incorrect presentation because string 102 is associated with the conclusion that the problem is with the speaker cables 243, while the conclusion represented at 244 is that the problem is with the interconnects. However, the intermediate frames (251, 351 and 252, 352) are transition or program synchronization frames that are not chain-specific. The completion frame is displayed at 243 and is erased by the program synchronization segment 251. At time T3, the user might not have seen the frame (243) if the frame (244) had been presented to the user due to the hierarchy of the system. Therefore, the interactive terminal can safely switch to the data stream 102 at time T3. Now, the two possible conclusions have been presented to the user and the interactive terminal is presenting non-specific program information segments in the frame (261, 361). This erases data chain (103) and allows branching from frame (245, 345) to chain (103) instead of chain (104). Thus, the branch from frame (245) has been folded into chain (103). Similarly, frame (261, 361) can be instructed to branch to chain (101) at time T4. This frees a weft from the chain (102) so that the weft (248, 348) can be folded on the chain (102) and the weft (249, 349) can be folded on the chain (103). Thus, the number of chains has been reduced from five to three. The value of this technique is the conservation of the number of chains required, thus conserving valuable channel capacity in a transmission system. In this case, only three channels would be necessary.
The concept of "folding" need not resemble a physical fold of a branch in the hierarchical tree diagram, but includes juxtaposition of frames and provision of chain breaks to decrease the number of data chains required.
Although Figure 7 discloses a very simple example, it will be clear to those skilled in the art that extremely complex interactive expert systems can be developed without a microprocessor to provide high levels of interactivity. For example, this type of system is applicable to financial analysis, the creation of documents (for example, wills, contracts, rentals, etc.) or fault detection. The more media chains available, the greater degree of parallelism and complex rule base and global expert system can be achieved.
Systems such as those described above can be implemented, for example, as point of sale kiosks. In a kiosk deployment, n channels of a program can be deployed on a video cassette that is contained in a video cassette player in the kiosk. A keyboard, touch screen or voice recognition technology at the entrance of the kiosk allows users to enter their selections. Alternatively, the interactive program could be implemented as a how-to system on a video-on-demand system.
In Table 3, a script of an interactive expert system is shown to help a person choose the appropriate tennis racket. Such a program could be used as a marketing tool in sporting goods stores, and the video portion of the program could include a celebrity to help the user select a racket. Due to the large number of factors involved in making the appropriate racquet decision (which could potentially require a large number of channels or would be extremely long), a microprocessor is used to direct the storage of information in memory based on user responses. An algorithm is used to determine which racket is appropriate based on the contents of memory once all the pertinent information has been gathered. Encoding in the middle tells the microprocessor to store the appropriate data as needed. The microprocessor also directs the switching between the channels as appropriate. It is important to note that this example can be implemented using techniques described with reference to Example 1, without the need for a microprocessor. For example, instead of storing user information in memory locations, the interactive program could branch to an entirely different data set each time input was required.
ES 2 201 118 T3
Figure 8 shows as a second example a generalized diagram of the location and contents of the frames, similar to figure 5, comprising figures 8A, 8B, 8C and 8D. As can be seen in the plot diagram of figure 8, the system asks for the user's age at time T0, gender at time T1, experience at time T2, category at time T3, hit level at time T4, game frequency at time T5 and weight at time T6. At time T7, the racket algorithm is executed and rackets are recommended at times T8 and T9. At time T10, the string tension is recommended. At time T11 a cuff size is suggested based on the previous response to gender. At time T12 a second racket is recommended based on frequency of use. Due to space restrictions, Figure 8 shows an abbreviated version of the content of the frames. A more descriptive description of this example is provided in Table 3 below.
This example differs from Example 1 in that the user's interactive responses are the letters AD instead of yes / no responses 1 or 2. It should be understood that any type of input can be used, including exclusive keys. The microprocessor in this embodiment contains multiple memory locations, addresses # 1- # 4 to store information entered by the user for later calculation.
Unlike Example 1, the command part of the frames contain instructions regarding the change of channels and the storage of information in the variables. In this example, the command portion is used throughout the presentation to instruct the microprocessor on storing variables and switching strings. Furthermore, in this example the command portion of the frame instructs the microprocessor to "switch" to the same channel rather than "stay" on the same channel, as appropriate. One of ordinary skill in the art will recognize that both commands achieve the same result. As in Example 1, the information included in the command part is enclosed in braces {}. Furthermore, the data strings and frames can be further "folded" or coded from the hierarchical tree diagram, although they are not specifically part of the example in this case.
The rule base and hierarchical diagrams in this example are not illustrated, as Table 3 and Figure 8 clearly represent the frame relationships.
(Table goes to next page)
ES 2 201 118 T3
TABLE 3:
<td colspan="5">Script for the frame content of the Tennis Racket Selection Example.</td>
<td>Weather</td><td>Chain 101</td><td>Chain 102</td><td>Chain 103</td><td>Chain 104</td>
<td>T ' TO</td><td>{change to 101} Hello, I am the Mr. Professional Tennis and I'm here to help you to choose the appropriate tennis racket. All you have what to do is answer me some How many questions and I will recommend exactly what it will be better for you. In first place, how old have? Under of 15, enter A, from 15-40, enter B, from 4160, enter C. Above 60, enter D. Answer now. {If A, change to 101. If B, change</td><td>{change to 101} (not used)</td><td>{change to 101} (not used)</td><td>{change to 101} (not used)</td>
ES 2 201 118 T3
TABLE 3 (continued) s
<td colspan="5">Script for the frame content of the Tennis Racket Selection Example.</td>
<td>Weather</td><td>Chain 101</td><td>Chain 102</td><td>Chain 103</td><td>Chain 104</td>
<td></td><td>at 102, if C, face-</td><td></td><td></td><td></td>
<td></td><td>good to 103, if D,</td><td></td><td></td><td></td>
<td></td><td>change to 104)</td><td></td><td></td><td></td>
<td>YOU</td><td>Thanks. I can see</td><td>Thanks. I can see</td><td>Thanks. I can see</td><td>Thanks. I can see</td>
<td></td><td>that has less than</td><td>that you are</td><td>that you are</td><td>what are you for</td>
<td></td><td>15 years old.</td><td>between 15 and 40 years</td><td>between 41 and 60 years</td><td>over 60</td>
<td></td><td>Never is enough</td><td>old. This</td><td>old. I started</td><td>year old.</td>
<td></td><td>soon to learn</td><td>you therefore in</td><td>to enjoy more</td><td>Did you know ...</td>
<td></td><td>der tennis. {Put</td><td>the best of thu-</td><td>of tennis when</td><td>there are people who</td>
<td></td><td>+1 in memory</td><td>go.</td><td>I was over 60.</td><td>play tennis</td>
<td></td><td>#l) Are you</td><td>{Put 0 in the</td><td>{Put +2 on</td><td>90s and even</td>
<td></td><td>male (enter</td><td>memory #l}</td><td>memory # 1}</td><td>more?.</td>
<td></td><td>A) or woman (intro-</td><td>Are you male</td><td>Are you male</td><td>{Put + 4n the</td>
<td></td><td>duzca B) ?. For</td><td>(enter A) or</td><td>(enter A) or</td><td>memory #l}</td>
<td></td><td>please indicate it.</td><td>woman (enter</td><td>woman (enter</td><td>Are you male</td>
<td></td><td>{If A, change to</td><td>B) ?. Please</td><td>B) ?. Please</td><td>(enter A) or</td>
<td></td><td>101, if B, change</td><td>Please indicate it. {If A,</td><td>Please indicate it. {if A,</td><td>woman (enter</td>
<td></td><td>to 102}</td><td>change to 101, yeah</td><td>change to 101, yeah</td><td>B) ?. Please</td>
<td></td><td></td><td>B, change to 102}</td><td>B, change to 102}</td><td>Please indicate it. {if A,</td>
<td></td><td></td><td></td><td></td><td>change to 101, yeah</td>
<td></td><td></td><td></td><td></td><td>B, change to 102}</td>
<td>T2</td><td>Thank my Lord.</td><td>Thank Mrs</td><td>(not used)</td><td>(not used)</td>
<td></td><td>{Add 0 to</td><td>{Add +2 the memo-</td><td></td><td></td>
<td></td><td>memory # 1; put</td><td>ria # 1; put Y</td><td></td><td></td>
<td></td><td>X in memory</td><td>in memory # 2}</td><td></td><td></td>
<td></td><td># 2} How long</td><td>How long</td><td></td><td></td>
<td></td><td>has been playing</td><td>has been playing</td><td></td><td></td>
<td></td><td>tennis?</td><td>tennis?</td><td></td><td></td>
<td></td><td>Less than 1 year.</td><td>Less than 1 year,</td><td></td><td></td>
<td></td><td>enter A, from</td><td>enter A, from</td><td></td><td></td>
<td></td><td>1-3 years, intro-</td><td>1-3 years, intro-</td><td></td><td></td>
<td></td><td>Duzca B, 3-5 years old,</td><td>Duzca B, 3-5 years.</td><td></td><td></td>
<td></td><td>enter C, plus</td><td>enter C, plus</td><td></td><td></td>
<td></td><td>5-year-old, intro-</td><td>5-year-old, intro-</td><td></td><td></td>
ES 2 201 118 T3
TABLE 3 (continued):
<td colspan="6">Script for the frame content of the Tennis Racket Selection Example.</td>
<td>Weather</td><td>Chain 101</td><td>Chain 102</td><td>Chain</td><td> 103</td><td>Chain 104</td>
<td></td><td>Duzca D. Please</td><td>Duzca D. Please</td><td></td><td></td><td></td>
<td></td><td>Please indicate it.</td><td>Please indicate it.</td><td></td><td></td><td></td>
<td></td><td>{If A, change to</td><td>{if A, change to</td><td></td><td></td><td></td>
<td></td><td>101, if B, change</td><td>101, if B, change</td><td></td><td></td><td></td>
<td></td><td>to 102, if C, change</td><td>to 102, if C, change</td><td></td><td></td><td></td>
<td></td><td>good to 103, if D,</td><td>good to 103, if D,</td><td></td><td></td><td></td>
<td></td><td>change to 104}</td><td>change to 104}</td><td></td><td></td><td></td>
<td>T3</td><td>{Add +3 to</td><td>{Add +2 to</td><td>{Add +1 to</td><td>the</td><td>{Add 0 to</td>
<td></td><td>memory #l}</td><td>memory #l}</td><td>memory #l}</td><td></td><td>memory #l}</td>
<td></td><td>Here is a neophyte.</td><td>From 1 to 3 years.</td><td>3 to 5 years.</td><td>Already</td><td>More than 5 years.</td>
<td></td><td>What kind of play-</td><td>Pretty new in</td><td>is being</td><td>bas-</td><td>Obviously you</td>
<td></td><td>dor are you in</td><td>this.What kind of</td><td>so good.</td><td>What</td><td>enjoy the te-</td>
<td></td><td>how much do you graduate-</td><td>player are you</td><td colspan="2">type of player is</td><td>nis. What kind of</td>
<td></td><td>tion?</td><td>as for gra-</td><td colspan="2">you as for</td><td>player are you</td>
<td></td><td>Championship - In-</td><td>duation?</td><td>graduation?</td><td></td><td>as for gra-</td>
<td></td><td>troduce DA -</td><td>Championship - In-</td><td>Championship -</td><td>In-</td><td>duation?</td>
<td></td><td>enter AB -</td><td>break DA-</td><td>troduce D</td><td>TO -</td><td>Championship - In-</td>
<td></td><td>enter BC -</td><td>enter AB -</td><td>enter A</td><td>B -</td><td>troduce DA -</td>
<td></td><td>enter C</td><td>enter BC -</td><td>enter B</td><td>C -</td><td>enter AB -</td>
<td></td><td>Please state-</td><td>enter C</td><td>enter C</td><td></td><td>enter BC -</td>
<td></td><td>it.</td><td>Please state-</td><td colspan="2">Please state-</td><td>enter C</td>
<td></td><td>{If A, change to</td><td>it.</td><td>it.</td><td></td><td>Please state-</td>
<td></td><td>102, if B, change</td><td>{If A, change to</td><td colspan="2">{if A, change to</td><td>it.</td>
<td></td><td>to 103, if C changes</td><td>102, if B, change</td><td colspan="2">102, if B, change</td><td>{If A, change to</td>
<td></td><td>to 104, if D changes</td><td>to 103, if C changes</td><td>at 103, if C</td><td>change</td><td>102, if B, change</td>
<td></td><td>to 101}</td><td>to 104, if D changes</td><td>to 104, if D</td><td>change</td><td>to 103, if C changes</td>
<td></td><td></td><td>to 101}</td><td>to 101}</td><td></td><td>to 104, if D changes</td>
<td></td><td></td><td></td><td></td><td></td><td>to 101}</td>
ES 2 201 118 T3
TABLE 3 (continued) s
<td colspan="5">Script for the frame content of the Tennis Racket Selection Example.</td>
<td>Weather</td><td>Chain 101</td><td>Chain 102</td><td>Chain 103</td><td>Chain 104</td>
<td>T4</td><td>{Add 0 to</td><td>{Add 1 to</td><td>{Add 3 to</td><td>{Add 5 to</td>
<td></td><td>memory #l}</td><td>memory #l)</td><td>memory #l}</td><td>memory #l}</td>
<td></td><td>Which one of these</td><td>Which one of these</td><td>Which one of these</td><td>Which one of these</td>
<td></td><td>better describes the</td><td>better describes the</td><td>better describes the</td><td>better describes the</td>
<td></td><td>way he plays?</td><td>way he plays?</td><td>way he plays?</td><td>way he plays?</td>
<td></td><td>Stick it hard</td><td>Stick it hard</td><td>Stick it hard</td><td>Stick it hard</td>
<td></td><td>many times,</td><td>many times.</td><td>many times,</td><td>many times.</td>
<td></td><td>Enter A,</td><td>Enter A,</td><td>Enter A,</td><td>Enter A, '</td>
<td></td><td>Stick it hard</td><td>Stick it hard</td><td>Stick it hard</td><td>Stick it hard</td>
<td></td><td>occasionally,</td><td>occasionally,</td><td>occasionally,</td><td>occasionally,</td>
<td></td><td>enter B,</td><td>enter B,</td><td>enter B,</td><td>enter B,</td>
<td></td><td>hit it hard</td><td>hit it hard</td><td>hit it hard</td><td>hit it hard</td>
<td></td><td>rarely, intro-</td><td>rarely, intro-</td><td>rarely, intro-</td><td>rarely, intro-</td>
<td></td><td>duzca C, never the</td><td>duzca C, never the</td><td>duzca C, never the</td><td>duzca C, never the</td>
<td></td><td>hit hard, in-</td><td>hit hard, in-</td><td>hit hard, in-</td><td>hit hard, in-</td>
<td></td><td>troducate D.</td><td>troducate D.</td><td>troducate D.</td><td>troducate D.</td>
<td></td><td>{If A, change to</td><td>{If A, change to</td><td>{If A, change to</td><td>{If A, change to</td>
<td></td><td>101, if B, change</td><td>101, if B, change</td><td>101, if B, change</td><td>101, if B, change</td>
<td></td><td>to 102, if C, change</td><td>to 102, if C, change</td><td>to 102, if C, change</td><td>to 102, if C, change</td>
<td></td><td>good to 103, if D,</td><td>good to 103, if D,</td><td>good to 103, if D,</td><td>good to 103, if D,</td>
<td></td><td>change to 104}</td><td>change to 104}</td><td>change to 104}</td><td>change to 104}</td>
<td>T5</td><td>{Add 0 to</td><td>{Add +1 to</td><td>{Add +2 to</td><td>{Add +3 to</td>
<td></td><td>memory # 1.</td><td>memory # 1.</td><td>memory # 1.</td><td>memory # 1.</td>
<td></td><td>Put a 1 in the</td><td>Put a 2 in the</td><td>Put a 3 in the</td><td>Put a 4 in the</td>
<td></td><td>memory # 3)</td><td>memory # 3)</td><td>memory # 3)</td><td>memory # 3)</td>
<td></td><td>How often</td><td>How often</td><td>How often</td><td>How often</td>
<td></td><td>cia play? One time</td><td>cia play? One time</td><td>cia play? One time</td><td>cia play? One time</td>
<td></td><td>a week or</td><td>a week or</td><td>a week or</td><td>a week or</td>
<td></td><td>less, enter</td><td>less, enter</td><td>less, enter</td><td>less, enter</td>
<td></td><td>A, twice a</td><td>A, twice a</td><td>A, twice a</td><td>A, twice a</td>
<td></td><td>week, enter</td><td>week, enter</td><td>week, introduce</td><td>week, enter</td>
<td></td><td>B, three times a</td><td>B, three times a</td><td>B, three times a</td><td>B, three times a</td>
<td></td><td>week, enter</td><td>week, enter</td><td>week, enter</td><td>week, enter</td>
ES 2 201 118 T3
TABLE 3 (continued):
<td colspan="5">Script for the frame content of the Tennis Racket Selection Example.</td>
<td>Weather</td><td>Chain 101</td><td>Chain 102</td><td>Chain 103</td><td>Chain 104</td>
<td></td><td>C, more than three</td><td>C, more than three</td><td>C, more than three</td><td>C, more than three</td>
<td></td><td>times a week,</td><td>times a week,</td><td>times a week,</td><td>times a week,</td>
<td></td><td>Enter D.</td><td>Enter D.</td><td>Enter D.</td><td>Enter D.</td>
<td></td><td>{if A, change to</td><td>{if A, change to</td><td>{If A, change to</td><td>{If A, change to</td>
<td></td><td>101, if B, change</td><td>101, if yes, change</td><td>101, if B, change</td><td>101, if B, change</td>
<td></td><td>at 102, if C, face-</td><td>at 102, if C, face-</td><td>at 102, if C, face-</td><td>at 102, if C, face-</td>
<td></td><td>good to 103, if D,</td><td>good to 103, if D,</td><td>good to 103, if D,</td><td>good to 103, if D,</td>
<td></td><td>change to 104}</td><td>change to 104}</td><td>change to 104}</td><td>change to 104}</td>
<td>T6</td><td>{Add +2 to</td><td>{Add +1 to</td><td>{Add +1 to</td><td>{Add 0 to</td>
<td></td><td>Memory # 1: Put</td><td>Memory # 1: Put</td><td>Memory # 1: Put</td><td>Memory # 1: Put</td>
<td></td><td>a J in the</td><td>a J in the</td><td>a K in the</td><td>a K in the</td>
<td></td><td>memory # 4}</td><td>memory # 4}</td><td>memory # 4}</td><td>memory # 4}</td>
<td></td><td>Hey! Once a</td><td>| Hey! Twice a</td><td>Three times a</td><td>Fantastic. This</td>
<td></td><td>week is not enough</td><td>the week is not</td><td>week is enough</td><td>Is superior. How-</td>
<td></td><td>cient. Go to</td><td>enough. Try</td><td>so good, but</td><td>I played the more</td>
<td></td><td>play more when</td><td>from playing 3 times to</td><td>four times is</td><td>better health have-</td>
<td></td><td>out.</td><td>week.</td><td>best.</td><td>drá.</td>
<td></td><td>How much does it weigh?</td><td>How much does it weigh?</td><td>How much does it weigh?</td><td>How much does it weigh?</td>
<td></td><td>11.5 - 46 kg -</td><td>11.5 - 46 kg -</td><td>11.5 - 46 kg -</td><td>11.5 - 46 kg -</td>
<td></td><td>Enter A</td><td>Enter A</td><td>Enter A</td><td>Enter A</td>
<td></td><td>46.5 - 69 kg -</td><td>46.5 - 69 kg -</td><td>46.5 - 69 kg -</td><td>46.5 - 69 kg -</td>
<td></td><td>Enter B</td><td>Enter B</td><td>Enter B</td><td>Enter B</td>
<td></td><td>69.5 - 92 kg -</td><td>69.5 - 92 kg -</td><td>69.5 - 92 kg -</td><td>69.5 - 92 kg -</td>
<td></td><td>Enter C</td><td>Enter C</td><td>Enter C</td><td>Enter C</td>
<td></td><td>More than 92 kg -</td><td>More than 92 kg -</td><td>More than 92 kg -</td><td>More than 92 kg -</td>
<td></td><td>Enter D</td><td>Enter D</td><td>Enter D</td><td>Enter D</td>
<td></td><td>{If A, change to</td><td>{If A, change to</td><td>{If A, change to</td><td>{If A, change to</td>
<td></td><td>101, if B, change</td><td>101, if B, change</td><td>101, if B, change</td><td>101, if B, change</td>
<td></td><td>at 102, if C, face-</td><td>at 102, if C, face-</td><td>at 102, if C, face-</td><td>at 102, if C, face-</td>
<td></td><td>good to 103, if D,</td><td>good to 103, if D,</td><td>good to 103, if D,</td><td>good to 103, yes D,</td>
<td></td><td>change to 104}</td><td>change to 104}</td><td>change to 104}</td><td>change to 104}</td>
ES 2 201 118 T3
TABLE 3 (continued):
<td colspan="5">Script for the frame content of the Tennis Racket Selection Example.</td>
<td>Weather</td><td>Chain 101</td><td>Chain 102</td><td>Chain 103</td><td>Chain 104</td>
<td>T7</td><td>(Add +2 to</td><td>{Add +1 to</td><td>{Add 0 to</td><td>{Add +4 to</td>
<td></td><td>memory #l)</td><td>memory #l)</td><td>memory #l)</td><td>memory #l)</td>
<td></td><td>Now I have your</td><td>Now I have your</td><td>Now I have your</td><td>Now I have your</td>
<td></td><td>information and</td><td>information and</td><td>information and</td><td>information and</td>
<td></td><td>I can evaluate what</td><td>I can evaluate what</td><td>I can evaluate what</td><td>I can evaluate what</td>
<td></td><td>racket type,</td><td>racket type,</td><td>racket type,</td><td>racket type,</td>
<td></td><td>fist and tension of</td><td>fist and tension of</td><td>fist and tension of</td><td>fist and tension of</td>
<td></td><td>the strings is the</td><td>the strings is the</td><td>the strings is the</td><td>the strings is the</td>
<td></td><td>better for you.</td><td>better for you.</td><td>better for you.</td><td>better for you.</td>
<td></td><td>{if memory # 1</td><td>{if memory # 1</td><td>{if memory # 1</td><td>{if memory # 1</td>
<td></td><td>is> +26, change to</td><td>is> +26, change to</td><td>is> +26, change to</td><td>is> +26, change to</td>
<td></td><td>102; if memory</td><td>102; if memory</td><td>102; if memory</td><td>102; if memory</td>
<td></td><td># 1 is> 17 and <25,</td><td># 1 is> 17 and <25,</td><td># 1 is> 17 and <25,</td><td># 1 is 17 and <25,</td>
<td></td><td>change to 103; Yes</td><td>change to 103; Yes</td><td>change to 103; Yes</td><td>change to 103; Yes</td>
<td></td><td>memory # 1 is</td><td>memory # 1 is</td><td>memory # 1 is</td><td>memory # 1 is</td>
<td></td><td>> 14 and <16 change to</td><td>14 and <16 change to</td><td>14 and <16 change to</td><td>14 and <16 change to</td>
<td></td><td>104; in another case,</td><td>104; in another case,</td><td>104; in another case,</td><td>104; in another case,</td>
<td></td><td>change to 101)</td><td>change to 101}</td><td>change to 101}</td><td>change to 101}</td>
<td>T8</td><td>The following ra-</td><td>I recommend the</td><td>I recommend the</td><td>I recommend the</td>
<td></td><td>what is the model</td><td>pattern racket</td><td>pattern racket</td><td>pattern racket</td>
<td></td><td>more appropriate for</td><td>Zenith 206</td><td>Zenith 208</td><td>Zenith 210</td>
<td></td><td>you. {if memory # 1 is <13 and> 10, change to 102, yeah memory # 1 is 9 and <5, change to 103; if memory # 1 is <4, change to 104)</td><td>{change to 10l)</td><td>{change to 101}</td><td>{change to 101}</td>
ES 2 201 118 T3
TABLE 3 (continued):
<td colspan="5">Script for the frame content of the Tennis Racket Selection Example.</td>
<td>Weather</td><td>Chain 101</td><td>Chain 102</td><td>Chain 103</td><td>Chain 104</td>
<td>T9</td><td>You will find</td><td>I recommend the</td><td>I recommend the</td><td>I recommend the</td>
<td></td><td>the racket before-</td><td>model 212 of</td><td>model 214 of</td><td>model 216 of</td>
<td></td><td>rior as the most</td><td>Zenith.</td><td>Zenith.</td><td>Zenith.</td>
<td></td><td>appropriate for your</td><td>{if memory # 3</td><td>{if memory # 3</td><td>{if memory # 3</td>
<td></td><td>needs,</td><td>= 1, change to 101;</td><td>= 1, change to 101;</td><td>= 1, change to 101;</td>
<td></td><td>(if memory # 3</td><td>if memory # 3 =</td><td>yes memory # 3 =</td><td>if memory # 3 =</td>
<td></td><td>= 1, change to 101;</td><td>2, change to 102;</td><td>2, change to 102;</td><td>2, change to 102;</td>
<td></td><td>if memory # 3 =</td><td>if memory # 3 =</td><td>if memory # 3 =</td><td>if memory # 3 =</td>
<td></td><td>2, change to 102;</td><td>3, change to 103;</td><td>3, change to 103;</td><td>3, change to 103;</td>
<td></td><td>if memory # 3 =</td><td>if memory # 3 =</td><td>if memory # 3 =</td><td>if memory # 3 =</td>
<td></td><td>3, change to 103; if memory # 3 = 4, change to 104. }</td><td>4, change to 104,}</td><td>4, change to 104.}</td><td>4, change to 104.}</td>
<td>UNCLE</td><td>The tension of the</td><td>The tension of the</td><td>The tension of the</td><td>The tension of the</td>
<td></td><td>strings should be</td><td>strings should be</td><td>strings should be</td><td>strings should be</td>
<td></td><td>fixed at 19.78 kg</td><td>fixed at 23 kg</td><td>fixed at 25.3 kg</td><td>fixed at 29.9 kg</td>
<td></td><td>(if memory # 2</td><td>{if memory # 2</td><td>{if memory # 2</td><td>{if memory # 2</td>
<td></td><td>= X, change to</td><td>= X, change to</td><td>= X, change to</td><td>»X, change to</td>
<td></td><td>101; if memory</td><td>101; if memory</td><td>101; if memory</td><td>101; if memory</td>
<td></td><td># 2 = Y, change to</td><td># 2 = Y, change to</td><td># 2 = Y, change to</td><td># 2 = Y, change to</td>
<td></td><td> 102}</td><td> 102}</td><td> 102}</td><td> 102}</td>
<td>Til</td><td>How are you male, choose the fist model plus width for men. {If memory # 4 = J, change to 101; if memory # 4 = K, change to 102}</td><td>How are you woman, choose the fist model slim for women. {if memory # 4 = J, change to 101; if memory # 4 = K, change to 102}</td><td>(not used) . ...........</td><td>(not used)</td>
ES 2 201 118 T3
TABLE 3 (continued):
<td>Script</td><td colspan="4">for the content of frames of the Example of selection of the</td>
<td colspan="2"></td><td colspan="3">tennis racket.</td>
<td>Weather</td><td>Chain 101</td><td>Chain 102</td><td>Chain 103</td><td>Chain 104</td>
<td>T12</td><td>How you play</td><td>Based on the</td><td>(not used)</td><td>(not used)</td>
<td></td><td>at least 3 times</td><td>number of times</td><td></td><td></td>
<td></td><td>per week maybe</td><td>per week that</td><td></td><td></td>
<td></td><td>should buy</td><td>you play one</td><td></td><td></td>
<td></td><td>two equal rackets</td><td>racket must be</td><td></td><td></td>
<td></td><td>them in case it breaks</td><td>enough. Yes</td><td></td><td></td>
<td></td><td>a cord. This</td><td>take good care</td><td></td><td></td>
<td></td><td>gives you 15%</td><td>of her, must</td><td></td><td></td>
<td></td><td>discount on the</td><td>last you around</td><td></td><td></td>
<td></td><td>second racket.</td><td>2 years.</td><td></td><td></td>
<td></td><td>It has been a pleasure</td><td>It has been a pleasure</td><td></td><td></td>
<td></td><td>help you select</td><td>help you select</td><td></td><td></td>
<td></td><td>play a racket</td><td>play a racket</td><td></td><td></td>
<td></td><td>tennis. What</td><td>tennis. What</td><td></td><td></td>
<td></td><td>have a nice day.</td><td>have a nice day.</td><td></td><td></td>
<td></td><td>{Change ajlOl)</td><td>{Change to 101}</td><td></td><td></td>
Although the present invention has been described in detail with respect to certain embodiments and examples, variations and modifications exist that are within the scope of the present invention, as defined in the following claims.
Contents24
11 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11
14 members in 9 offices
Priority claims2
| Document | Office | Kind | Date |
|---|---|---|---|
| 19940311019 | United States of America | – | |
| 31101994 | United States of America | A |
Members14
| Document | Office | Kind | |
|---|---|---|---|
| CA2200577A1 | Canada | A1 | |
| WO9609588A1 | World Intellectual Property Organization (WIPO) | A1 | |
| AU3638395A | Australia | A | |
| US5632007A | United States of America | A | |
| EP0782730A1 | European Patent Office (EPO) | A1 | |
| EP0782730A4 | European Patent Office (EPO) | A4 | |
| EP0782730B1 | European Patent Office (EPO) | B1 | |
| AT243335T | Austria | T | |
| ATE243335T1 | Austria | T1 | |
| DE69531106D1 | Germany | D1 | |
| DK0782730T3 | Denmark | T3 | |
| ES2201118T3This record | Spain | T3 | |
| DE69531106T2 | Germany | T2 | |
| CA2200577C | Canada | C |
Numbers
- Publication
- 2201118
- Application
- 95933897
Titles2
- Spanish
- PROCEDIMIENTO INTERACTIVO DE PROGRAMACION.
- English
- INTERACTIVE PROGRAMMING PROCEDURE.
Classification
- CPC, 2
- G06N5/04
- G06F16/3329
- IPC, 2
- G06F17 30
- G06N5 04