WO1995004974A1 - Procede de specification des liaisons dans un systeme hypermedia - Google Patents

Procede de specification des liaisons dans un systeme hypermedia Download PDF

Info

Publication number
WO1995004974A1
WO1995004974A1 PCT/AU1994/000454 AU9400454W WO9504974A1 WO 1995004974 A1 WO1995004974 A1 WO 1995004974A1 AU 9400454 W AU9400454 W AU 9400454W WO 9504974 A1 WO9504974 A1 WO 9504974A1
Authority
WO
WIPO (PCT)
Prior art keywords
link
links
predicate
source
specifications
Prior art date
Application number
PCT/AU1994/000454
Other languages
English (en)
Inventor
Helen Lee Ashman
Janet Verbyla
Original Assignee
The Commonwealth Of Australia
Flinders Technologies Pty. Ltd.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by The Commonwealth Of Australia, Flinders Technologies Pty. Ltd. filed Critical The Commonwealth Of Australia
Priority to AU73431/94A priority Critical patent/AU7343194A/en
Publication of WO1995004974A1 publication Critical patent/WO1995004974A1/fr

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/93Document management systems
    • G06F16/94Hypermedia

Definitions

  • This invention relates to Hypermedia Management Systems, and in particular a method of determining whether in a hypermedia management system there exists one or more links, and hence one or more destination components for a given source component using a (predicate, expression) representation of a link specification.
  • Areas of application of the method include but are not limited to on-line information services, computer aided instruction, computer managed learning and multimedia information kiosks.
  • Hypermedia Management System e.g. Hypermedia Management System, Hypermedia System, Multimedia Information, information component, link, link specification and link generation.
  • Multimedia Information e.g. Hypermedia Management System, Hypermedia System, Multimedia Information, information component, link, link specification and link generation.
  • a Hypermedia System is a collection of information items, a means of displaying information items, and a means of navigating through the information collection.
  • Multimedia information is information which may exist in many media, for example, a graphic, text, sound, video each of various size.
  • a component is a discrete unit of information, i.e an information item.
  • a link represents an instance of a relationship between two or more components.
  • the source component of a link is the component currently being viewed by a user, and the destination component(s) of a link are those components related to the source component and which the user can navigate to, by traversing the link.
  • a link specification is used to determine whether a link exists from the current (source) component, and may also, when required, be used to determine the destination(s).
  • a Hypermedia Management System typically comprises a software module that provides a set of functions for navigating through multimedia information, including (but not restricted to) the following features :
  • a computed link is created by evaluating a link specification to identify source components and corresponding destination component(s) to each source component. This is in contrast to a manually -specified link in which the link must be entered directly by a user or author, and with which there is no link specification associated.
  • a dynamic link is a computed link which is computed at the last possible moment, i.e. the computation is undertaken at the time the result of the computation is needed. This is in contrast to a precomputed link in which the link is computed and the results stored for later use.
  • a predicate is a function (in the mathematical sense) which takes a component (plus variables representing the environment in which the component occurs) and returns true or false.
  • An expression is a function which takes a component (plus variables representing the environment in which the component occurs) and returns a set of components (plus associated variables representing changes in the environment).
  • HyperCard An example of a Hypermedia Management System is HyperCard, which consists of software designed for the Apple Macintosh computer to provide users with a Multimedia Information management tool. HyperCard also provides user control of movement between cards in a stack, typically by providing screen icons and buttons.
  • An example of a Hypermedia System is a HyperCard document, which consists of a series of "cards" (Multimedia Information components) associated with each other into a virtual card "stack"; each card can contain text, graphical images, and sound.
  • Hypermedia is a new, emergent technology and as yet no standards of nomenclature and definitions have been agreed upon. Also, many HMS and HS designers tend to blur the distinctions given here, for example, many researchers and designers do not differentiate between computed links and dynamic links.
  • HMSs can access many different information components which may be available in the HMS own internal memory devices or available from external sources (such as dial-up-databases and computer information storage devices as well as other HSs).
  • HMSs are intended to assist the initial creation of links by the original authors and co-ordinate to differing degrees the creation of the original links, maintenance of those links, the creation of new links by the author and the user, and the co-ordination of changes to existing links.
  • HMS designers make assumptions about the various information components it will be able to access, in regards to permanency, location, availability, format and access permissions (readability, writability). In doing so, designers accept a variety of limitations and compromises to the performance of the HMS. These compromises influence new link authorship, version management and propagation of editing changes to links involving the changed information and limitations which are acceptable in some situations.
  • Links can be either manually entered by authors and /or users, or can be computed from link specifications. Computed links can be the result of either a precomputation of link specifications or a dynamic evaluation of link specifications. Some links can be a mixture of manually entered and computed. Likewise, links can be a mixture of precomputed and dynamic. This is because the source determination part of the link specification can be implemented differently to that of the destination determination part of the link specification.
  • sources of links are either manually-entered or precomputed. Destinations of links are either manually-entered, precomputed or dynamic. More recently, precomputed sources or destinations are tending to replace manually-entered sources or destinations.
  • Links which are computed will be accurate as long as the information which was provided to them at the time of computation does not change. However in some environments, the underlying information collection does change, either occasionally or frequently. When this occurs the links created earlier may become invalid. Reconciling links with the changes in the information collection is currently an important research area in the hypermedia research community.
  • the second way is to store references to the individual components in an external file, typically by naming the file containing the component and giving an offset within the file, that offset being where the component is located within the file. That is, the references to the individual components have been externalised.
  • This second way is a core feature of the "open hypermedia systems" and an important advantage gained by this technique is that links do not have to be marked-up in the information collection, hence read-only information can be included.
  • this technique has also introduced a disadvantage, namely that editing changes in the information collection can make the link wrong. This problem now requires some corrective action in order to reconcile the links to the changed information collection. This problem does not occur when using the marking-up technique.
  • Link specifications which compute individual links. This means that it is no longer necessary to store individual pairs, but instead the link specifications now need to be stored.
  • Link specifications can comprise two parts, the source determination and destination determination parts, but a separate source determination is not commonly used in the prior art.
  • Link specifications can be stored within the HMS application software, as part of the actual software code.
  • a drawback of storing link specifications in this way is that the link specifications cannot be changed without altering the HMS application software code and recompiling it.
  • the link specifications refer to specific data structures, changes in these data structures can cause inconsistencies in the computed links, or can cause the HMS to stop working at all.
  • link specifications can be stored externally in a file (or other storage) from which the HMS retrieves them and then interprets them. These link specifications stored outside of the HMS application software code are externalised. Link specifications stored externally can be changed at any time, without the need to recompile.
  • a preferred link specification is one in which both the source determination and the destination determination are externalised.
  • Such a link specification has the following characteristics:
  • link specifications are not part of the HMS application code but are stored in a form (such as a script) that the HMS can use;
  • link specifications are stored where they may be useable by other HMSs; • links may be specified in the languages proprietary to third-party applications, thus allowing information stored in these third-party applications to be accessed by the HMS, and allowing the HMS to make use of the specialist computational facilities of third-party applications;
  • link specifications can be analysed by high-level intelligent applications, for the purposes of finding the 'best' representation of the link specification (link optimisation);
  • link specifications can be expressed in a language (such as Standard Query Language, Prolog etc) which is interpretable by some third-party application (such as Oracle, or a Prolog interpreter). In this way, it becomes possible to create link specifications which link information between third-party applications. This is called the interoperability of the HMS with third-party applications.
  • Link specifications are representations of groups of individual links as mathematical relations, and may be expressed as pairs of computation, one for each of the source and destination determinations. Link specifications need not be computed dynamically, however link specifications are a necessary (but not sufficient) condition for the implementation of fully dynamic links.
  • link specification Any representation of a link specification as a mathematical relation must define the source set, the destination set and the instances (links) that comprise the relation (link specification). There are many possible ways to represent a mathematical relation, and for hypermedia purposes, some are better than others. However, fully dynamic linking can only be implemented when the source set is defined with a predicate. The procedure implicit in almost all hypermedia link processes is the testing of whether a component (unit of information) currently on display is able to participate in a link.
  • a link is a form of context-sensitive query.
  • hypermedia link usage consists of asking "does this component have a link attached to it?" and if the answer is affirmative, then optionally requesting to be taken to the destination component(s) represented by the one or more links attached or associated with the component.
  • the (expression, expression) representation contradicts the basic process of hypermedia, that is, a user will be at a particular component and ask "what links are there from this component?".
  • the (expression, expression) representation computes all of the sources for a particular link specification and then tests whether the component the user is interested in forms part of that set. But the user is not interested in what other components also belong to the same source set, they only want to know about the component they are currently viewing. To compute the entire source set when only one component is likely to be used represents a predominantly redundant computation.
  • the linking process does not require the entire source set to exist, but rather, it only requires that the current component can be tested for membership in that source set. This can be done with one predicate for each relationship (i.e. for each link specification).
  • the invention uses a (predicate, expression) representation of a link specification.
  • the predicate is a computation which comprises the necessary and sufficient conditions that the component must satisfy in order to be a source for the link specification.
  • the set of sources for the link specification never becomes out of date because it is never fully computed. Only the component in which the user is interested is tested for whether it is a source for the link specification, and no redundant computation occurs at all.
  • the set C is not restricted in any way by limitations of object size or type, but a component is essentially any discrete unit of information.
  • the ENV set implicitly has an infinite number of dimensions, although most applications will only make use of a finite subspace of the ENV set in their computations (eg aspects such as navigational history, users preferences etc).
  • link specifications are fully externalised, so that they are abstracted from the link management software, allowing them to be modified. This principle is permitted to some extent by the script based systems, where scripts represent the externalisation of the destination determination, and in some cases, some filtering of the fixed source set (i.e. some part of the source determination procedure).
  • the link representation used is the (expression, expression) representation, which involves a computationally costly source determination process, which is evaluated as a precomputed link source, not a dynamic link source, precisely because of the expense involved in this computation.
  • the invention uses the (predicate, expression) representation, saving substantial amounts of computation expense in the source determination process, and as a result can be used dynamically. Hence it can avoid the need to store the results of precomputed link specifications, with the associated need for corrections after the information collection has been changed.
  • the invention is a method in a hypermedia management system of determining whether a current component is a source of one or more of a set of link specifications comprising the following step, a) applying the predicate P of each link specification of the said set to the current component, where the predicate P represents the conditions that the current component must satisfy to be a source component for the link specification, and returning true or false.
  • a further step in the method evaluates an expression E corresponding to every predicate P
  • the method comprises the further step, b) assuming the predicate P has evaluated to true in step a, then the corresponding expression E computes one or more destination components associated with the current component.
  • each link specification is represented by a (predicate, expression) pair.
  • Fig. 1 depicts the use of step a and, optionally, step b of the invention.
  • Fig. 2 depicts the use of step a followed, where possible, by step b of the invention.
  • Tables 1 and 2 describes two ways of evaluating the source determination part of a set of link specifications to determine whether a specific component c (and its associated environment e) is the source of at least one link. Both table 1 and table 2 are embodiments of step a of the invention. There may be other embodiments of step a of the invention.
  • Table 1 evaluates the source determination part of all members of the set of link specifications, returning true if at least one predicate returns true.
  • Table 2 evaluates source determination parts of successive members of the set of link specification, stopping this procedure when one predicate returns true, or when no further link specifications are available for evaluation.
  • step b of the invention represents the destination determination part of the link specification and is available for use after step a has returned true for the current component (and its associated environment).
  • step b of the invention There are numerous possible ways to implement step b of the invention. In the embodiment described in table 3, it is assumed that the user or HMS has made a selection of the available link specifications for that component (and its associated environment).
  • Fig. 1 depicts one linking process, in which the source determination process of applying the predicate P of each link specification of the set of all link specifications to the current component (each predicate P represents the conditions that the current component must satisfy to be a source component for the link specification, and returning true or false).
  • This process 10 can be implemented with either of tables 1 or 2, or with another implementation altogether.
  • the destination determination process 20 consists of evaluating the corresponding expression E to compute one or more destination components associated with the current component, which can be represented by table 3, or by another implementation altogether.
  • the user must explicitly request 15 the destination determination process 20, for a component for which the source determination process have returned true. This is done by choosing one member of the link specification set.
  • the way in which choices can be presented to the user can vary greatly. One way is to present all choices and permit the user to make an unassisted selection. Alternatively, the HMS could 'rank' the choices, implicitly suggesting which link the user may find most useful.
  • Fig. 2 depicts another linking process, in which the source determination process 30 of applying the predicate P of each link specification of the set of all link specifications to the current component (each predicate P represents the conditions that the current component must satisfy to be a source component for the link specification, and returning true or false).
  • This process 30 can be implemented with either of tables 1 or 2, or with another implementation altogether.
  • the destination determination process 20 consists of evaluating the corresponding expression E to compute one or more destination components associated with the current component, which can be represented by table 3, or by another implementation altogether.
  • the invention has been tested in two prototypes.
  • the first prototype named FLINKMAN
  • FLINKMAN is a newly-constructed HMS.
  • the second prototype involves the modification of an existing HMS to use the invention.
  • the Geographic Multimedia Information System (GHIS) had a hypermedia linking capability based on the (expression, expression) representation of link specifications.
  • GHIS was modified to make use of the (predicate, expression) representation.
  • the GHIS prototype is described in H.L. Ashman and G.R. Chase, Link Management in a Geographic Hypermedia Information System, Proceedings of 4th Australian Conference on Information Systems, University of Queensland, pp 327-334, September 1993.
  • link specification model addresses many of the requirements relating to existing, heterogeneous or commercial information retrieval systems, notably the important issues of automatic information accession, interoperability and information exchange and local site retrieval requirements.
  • the invention can be used to integrate into HMSs specialist applications such as those with fast text-based operations, full (text) querying capability, knowledge-based reasoning capacity, and as the technology becomes available, more advanced applications allowing graphics-based querying.

Abstract

Cette invention décrit un procédé pour mettre en ÷uvre une stratégie de liaisons avec l'extérieur entièrement dynamique dans un système de gestion hypermédia (HMS), en utilisant une représentation (prédicat, expression) pour chaque spécification de liaison. Ce procédé améliore les procédés précédents car le prédicat permet au système HMS de déterminer si un composant est une source pour une liaison, cette détermination s'effectuant de la manière la plus économique et efficace, en évitant les calculs superflus et en permettant une réconcicliation automatique des liaisons avec la collection d'informations sous-jacente, si des changements ont eu lieu. Selon la figure, l'utilisation d'un prédicat pour représenter le processus de détermination de la source (10) est une étape essentielle du procédé selon l'invention. L'étape suivante, le processus de détermination de la destination (20), est sujet au résultat du processus de détermination de la source et également à la sélection de l'utilisateur (15). Cette invention implique la création de liaisons au moment où elles sont nécessaires, en opposition à la pratique habituelle de précalculation des liaisons. Elle implique également l'utilisation de spécifications de liaisons, à partir desquelles les liaisons individuelles sont calculées, remplaçant le besoin de spécifier les liaisons individuelles. Ces spécifications de liaisons sont extraites du code d'application du système HMS, leur permettant d'être modifiées en tout temps et permettant l'utilisation de ces spécifications des liaisons par d'autres systèmes HMS.
PCT/AU1994/000454 1993-08-06 1994-08-08 Procede de specification des liaisons dans un systeme hypermedia WO1995004974A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU73431/94A AU7343194A (en) 1993-08-06 1994-08-08 A method of specifying links in hypermedia

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
AUPM041693 1993-08-06
AUPM0416 1993-08-06

Publications (1)

Publication Number Publication Date
WO1995004974A1 true WO1995004974A1 (fr) 1995-02-16

Family

ID=3777114

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/AU1994/000454 WO1995004974A1 (fr) 1993-08-06 1994-08-08 Procede de specification des liaisons dans un systeme hypermedia

Country Status (1)

Country Link
WO (1) WO1995004974A1 (fr)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1997024684A1 (fr) * 1996-01-02 1997-07-10 Sofmap Future Design Co., Ltd. Systeme et procede d'association souple par hyperlien
FR2748362A1 (fr) * 1996-05-06 1997-11-07 Microsoft Corp Navigation hypermedia utilisant des hyperliens doux
US5781900A (en) * 1996-01-02 1998-07-14 Sofmap Future Design, Inc. Flexible hyperlink association system
EP0858632A1 (fr) * 1995-07-03 1998-08-19 Capella Computers Ltd Procede pour generer une presentation multimedia
US6581065B1 (en) 1998-02-10 2003-06-17 National Broadcasting Comany, Inc. Dynamic insertion and updating of hypertext links for internet servers
EP1999633A2 (fr) * 2006-03-09 2008-12-10 Panther Panache LLC Systemes et procedes de mise en correspondance de contenu mediatique sur sites web
USRE40731E1 (en) 1994-02-16 2009-06-09 Sentius International Corporation System and method for linking streams of multimedia data to reference material for display
US9128909B2 (en) 2007-11-09 2015-09-08 Vibrant Media, Inc. Intelligent augmentation of media content
US9165055B2 (en) 2001-08-16 2015-10-20 Sentius International, Llc Automated creation and delivery of database content

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0483576A2 (fr) * 1990-10-31 1992-05-06 International Business Machines Corporation Des services indépendants des applications permettant l'incorporation d'hypermédia
EP0566482A1 (fr) * 1992-04-17 1993-10-20 Bull S.A. Utilisation d'un protocole bidirectionnel de très haut niveau pour la communication entre un système hypermédia et une pluralité d'éditeurs
US5268846A (en) * 1991-04-10 1993-12-07 International Business Machines Corporation Method and apparatus for nonsequential multimedia data interchange in a data processing system
US5297249A (en) * 1990-10-31 1994-03-22 International Business Machines Corporation Hypermedia link marker abstract and search services
US5309564A (en) * 1992-03-19 1994-05-03 Bradley Graham C Apparatus for networking computers for multimedia applications
EP0594871A1 (fr) * 1992-10-09 1994-05-04 Fujitsu Limited Planification de séquence dans un système multimedia

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0483576A2 (fr) * 1990-10-31 1992-05-06 International Business Machines Corporation Des services indépendants des applications permettant l'incorporation d'hypermédia
US5204947A (en) * 1990-10-31 1993-04-20 International Business Machines Corporation Application independent (open) hypermedia enablement services
US5297249A (en) * 1990-10-31 1994-03-22 International Business Machines Corporation Hypermedia link marker abstract and search services
US5268846A (en) * 1991-04-10 1993-12-07 International Business Machines Corporation Method and apparatus for nonsequential multimedia data interchange in a data processing system
US5309564A (en) * 1992-03-19 1994-05-03 Bradley Graham C Apparatus for networking computers for multimedia applications
EP0566482A1 (fr) * 1992-04-17 1993-10-20 Bull S.A. Utilisation d'un protocole bidirectionnel de très haut niveau pour la communication entre un système hypermédia et une pluralité d'éditeurs
EP0594871A1 (fr) * 1992-10-09 1994-05-04 Fujitsu Limited Planification de séquence dans un système multimedia

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
H.L. ASHMAN and G.R. CHASE, Link Management in a Geographic Hypermedia Information System, PROCEEDINGS OF 4TH AUSTRALIAN CONFERENCE ON INFORMATION SYSTEM, UNIVERSITY OF QUEENSLAND, "The Geographic Multimedia Information System (GHIS)", pages 327-334, September 1993. *

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
USRE45085E1 (en) 1994-02-16 2014-08-19 Sentius International, Llc System and method for linking streams of multimedia data to reference material for display
USRE43633E1 (en) 1994-02-16 2012-09-04 Sentius International Llc System and method for linking streams of multimedia data to reference material for display
USRE40731E1 (en) 1994-02-16 2009-06-09 Sentius International Corporation System and method for linking streams of multimedia data to reference material for display
EP0858632A1 (fr) * 1995-07-03 1998-08-19 Capella Computers Ltd Procede pour generer une presentation multimedia
EP0858632A4 (fr) * 1995-07-03 2002-08-28 Capella Computers Ltd Procede pour generer une presentation multimedia
US5781900A (en) * 1996-01-02 1998-07-14 Sofmap Future Design, Inc. Flexible hyperlink association system
WO1997024684A1 (fr) * 1996-01-02 1997-07-10 Sofmap Future Design Co., Ltd. Systeme et procede d'association souple par hyperlien
US5848417A (en) * 1996-01-02 1998-12-08 Sofmap Future Design, Inc. Flexible information input and operation selection system
FR2748362A1 (fr) * 1996-05-06 1997-11-07 Microsoft Corp Navigation hypermedia utilisant des hyperliens doux
US6581065B1 (en) 1998-02-10 2003-06-17 National Broadcasting Comany, Inc. Dynamic insertion and updating of hypertext links for internet servers
US9165055B2 (en) 2001-08-16 2015-10-20 Sentius International, Llc Automated creation and delivery of database content
US10296543B2 (en) 2001-08-16 2019-05-21 Sentius International, Llc Automated creation and delivery of database content
EP1999633A4 (fr) * 2006-03-09 2010-07-14 Panther Panache Llc Systemes et procedes de mise en correspondance de contenu mediatique sur sites web
US8370455B2 (en) 2006-03-09 2013-02-05 24/7 Media Systems and methods for mapping media content to web sites
EP1999633A2 (fr) * 2006-03-09 2008-12-10 Panther Panache LLC Systemes et procedes de mise en correspondance de contenu mediatique sur sites web
US9128909B2 (en) 2007-11-09 2015-09-08 Vibrant Media, Inc. Intelligent augmentation of media content

Similar Documents

Publication Publication Date Title
Consens et al. Hy+ A hygraph-based query and visualization system
US5632022A (en) Encyclopedia of software components
Miller et al. Behavioral issues in the use of interactive systems
JP2957702B2 (ja) 関係データベーススキーマを生成する意味オブジェクトモデリングシステム
US7574652B2 (en) Methods for interactively defining transforms and for generating queries by manipulating existing query data
US5197005A (en) Database retrieval system having a natural language interface
US6154213A (en) Immersive movement-based interaction with large complex information structures
US5630127A (en) Program storage device and computer program product for managing an event driven management information system with rule-based application structure stored in a relational database
Mena et al. Ontology-based query processing for global information systems
JP3443144B2 (ja) 情報検索装置および仮想データベース管理システム
US6169985B1 (en) Method and apparatus for determining a set of database entries
Thompson et al. Practical natural language processing: The REL system as prototype
US5544298A (en) Code generation and data access system
Eckert et al. Improving object-oriented analysis
WO1995004974A1 (fr) Procede de specification des liaisons dans un systeme hypermedia
Lehto et al. The relative effectiveness of hypertext and text
Oussalah et al. Knowledge-based sentence semantic similarity: algebraical properties
Ambite et al. Data Integration and Access: The Digital Government Research Center’s Energy Data Collection (EDC) Project
Kaplan et al. Interpreting natural language database updates
Lloyd-Williams et al. Expert systems for database design: A comparative review
Codasyl Systems Committee Introduction to “feature analysis of generalized data base management systems”
Conlon et al. A natural language processing based group decision support system
King Modelling concepts for reasoning about access to knowledge
Becks et al. Exploring the semantic structure of technical document collections: A cooperative systems approach
Rohr Graphical user languages for querying information: where to look for criteria?

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AM AT AU BB BG BR BY CA CH CN CZ DE DK ES FI GB GE HU JP KE KG KP KR KZ LK LT LU LV MD MG MN MW NL NO NZ PL PT RO RU SD SE SI SK TJ TT UA US UZ VN

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): KE MW SD AT BE CH DE DK ES FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN ML MR NE SN TD TG

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: CA