US 7,496,837 B1Grant
Structural editing with schema awareness
Issue Date:2009-02-24
•36 Claims
•12 Drawing Sheets
Abstract
A markup language document has data entry fields corresponding to markup language nodes that are arranged in a hierarchical structure of parents having child nodes. The hierarchical position of each markup language node in the hierarchical structure is expressed as a corresponding fragment of the markup language. For each parent, a markup language fragment is formed so as to have a plurality of portions each corresponding to the fragment of a respective child node without repeating any fragment of the respective child nodes. Portions that respectively correspond to the child nodes are used for data entry with the data entry fields, where an electronic form is displayed on a user interface for interactive data entry. The electronic form has one or more data entry fields each corresponding to one of the data entry fields of the structured markup language document and into which data can be entered.
Metadata
Assignee
- Microsoft Corporation
Inventors
- Jean-Marie H. Larcheveque
- Anand Ramagopalrao
- Michael B. Palmer
- Alessandro Catorcini
Application Information
Application Number:US 10/837,443
Filing Date:2004-04-29
Priority Date:2004-04-29
Art Unit:2178
Classifications
IPC:
G06F17/00
Patent Drawings (12 sheets)
Description
TECHNICAL FIELD
[0001] This invention relates to the editing of structured data in a manner that provides mapping between the structured data and a visual presentation in which the structured data is interactively edited, and is more particularly related to efficiently identifying a hierarchy in the structured data, and its location, in order to support interactive data insertion or deletion.
BACKGROUND
[0002] FIG. 1 shows an environment in which a data processing application 100 is executed so as to edit a structured document by processing documents containing structured data 102. The data processing application 100 is exemplary and can generally be described as processing structured data 102 expressed in a markup language so as to transform the structured data 102 using a solution module 104 to produce transformed information. During the process, the structured data can be presented as a rendering of a visual surface 106 (also referred to here in as a document view 106) on an output device. An editing user 108 interacts with the visual surface 106, as indicated by arrow 110, using, for instance keyboard 112, mouse device 114, or some other input device. The visual surface 106 can constitute the presentation of an electronic form having data entry fields associated with the structured data 102. In this case, the editing user 108's interaction 110 can involve the editing user 108 filling information into existing data entry fields of the electronic form, inserting and filling in new fields (as in table rows) or deleting or substituting regions of the editing surface that represent data subtrees.
[0003] The structured data 102 is a markup language. By way of example, and not by way of limitation, the markup language can be represented in Extensible Markup Language (XML). Accordingly, the structured data 102 is hereinafter referred to as an XML document 102. XML, which is documented as a W3C Standard set forth in Paoli et al., 1998, W3C recommendation, enables developers to create customized tags that describe the meaning of data, as opposed to the presentation of data.
[0004] The environment in which the data processing application 100 operates includes an Extensible Stylesheet Language Transformations (XSLT) processor that translates an XML document 102 into the visual surface 106 The visual surface 106 can also comprise another XML document, or a document expressed in a presentation-oriented markup language, such as Hypertext Markup Language (HTML). XML provides tags that represent the data contained in a document. In contrast, presentation-oriented languages, such as Hypertext Markup Language (HTML), provide tags that convey the visual appearance of a document. Accordingly, these technologies complement each other; XML allows information to be efficiently transferred and processed, while HTML allows information to be presented for display.
[0005] XSLT itself uses an XML syntax. The XSLT processor performs its translation function by making reference to one or more XSLT stylesheets. The XSLT stylesheets contain a collection of rules for mapping elements in the XML document 102 to the visual surface 106 or document view 106. To perform this function, XSLT defines its operands through XPath. XPath is a general-purpose query language for addressing and filtering the elements and text of XML documents. XPath expressions can address parts of an XML document, and can manipulate strings, numbers, and booleans, etc. In the context of the XSLT processor, XPath expressions can be used to select a portion of the XML document 102 that matches a prescribed match pattern, and then perform some translation operation on that portion using a rule provided in the XSLT stylesheets. XML, XSLT, and XPath are described at length in their governing specifications provided by the World Wide Web Consortium (W3C).
[0006] The XML document 102 is composed of XML elements, each of which includes a start tag (such as <author>), an end tag (such as </author>), and information between the two tags (which is referred to as the content of the element). An element may include name-value pairs (referred to as attributes) related by an equal sign (such as MONTH=“May”). The elements in the XML document 102 have a hierarchical relationship to each other that can be represented as a data tree 116. The elements in the data tree 116 are also commonly referred to as “nodes.” All elements are nodes, but the converse is not true. As used herein, attributes, attribute values, and text content are all nodes. A so-called XML schema (not illustrated in FIG. 1 ) is a particular XML language that provides a syntactic description of an XML structure. If an XML structure is an instance of the schema that it refers, it is said to be valid according to that schema.
[0007] The solution module 104 includes a data-mapping module 118. The purpose of the data-mapping module 118 is to map the structured data 102 to the visual surface/document view 106. The data-mapping module 118 can perform this task using so-called stylesheets, such as stylesheets written using XSLT. XSLT maps the structured data 102 to a format appropriate for presentation, such as HTML, Extensible Hypertext Markup Language (XHTML), etc. In other words, documents expressed in XML include tags that are particularly tailored to convey the meaning of the data in the documents. The XSLT conversion converts the XML documents into another markup language in which the tags pertain to the visual presentation of the information contained in the documents. (To facilitate discussion, the following description assumes the use of HTML to render the documents; however, other presentation-oriented markup languages can be used to render the documents.) Because HTML is a markup language, it can be conceptualized as a view tree 120 that includes a hierarchical organization of nodes, as in the case of data tree 116. The reader is referred to the World Wide Web Consortium's specifications for background information regarding XML and XSLT. Arrow 126 represents mapping of information in the data tree 116 to information in the view tree 120.
[0008] A view-mapping module 122 enables nodes in the view tree 120 to be mapped to corresponding nodes in the data tree 116. The mapping of nodes in the view tree 120 to nodes in the data tree 116 allows the solution module 104 to correlate editing operations performed on the visual surface/document view 106 with corresponding nodes in the underling structured data 102. This allows the solution module 104 to store information entered by the editing user 108 at appropriate locations within the structured data 102 during an editing session. Arrow 124 represents the mapping of information in the view tree 120 back to associated information in the data tree 116.
[0009] By way of broad overview, the mapping module 122 provides mapping between the visual surface/document view 106 and the XML document 102 by adding annotations to the view tree 120 used to render the visual surface/document view 106. These annotations serve as references which point back to specific locations in the data tree 116. FIG. 1 represents the annotation of the visual surface/document view 106 by showing an annotated HTML document 128 being output from the solution module 104.
[0010] The visual surface/document view 106 itself has an appearance that is determined by both the information contained in the XML document 102 as well as the effects of the XSLT transformation provided by the mapping module 118. Generally, in the case of electronic forms, the visual surface/document view 106 typically includes a hierarchical structure which is related to the hierarchical structure in the XML document 102. For instance, an exemplary electronic form 130 includes multiple sections pertaining to different topics that reflect the topics in the XML document 102. (However, it is not necessary to have a one-to-one direct correspondence between the organization of the XML document 102 and the organization of the visual surface/document view 106; in other words, the transformation of the XML document 102 to the visual surface/document view 106 is generally considered non-isomorphic). Each section in the exemplary electronic form 130 can include one or more data entry fields for received input from the editing user 108, such as data entry field 132. The data entry fields are also referred to herein as “editing controls.” Different graphical components can be used to implement the editing controls, including text boxes, drop-down list boxes, list boxes, option buttons (also referred to as radio buttons), check boxes, and so on. FIG. 6 , to be described, provides an example of the visual appearance of an electronic form as it is being used by an editing user to enter and/or edit data via the data entry fields thereon.
[0011] Path 134 generally represents the routing of information entered via the electronic form 130 back to the XML document 102. In another words, the data entry fields in the electronic form 130 (such as data entry field 132) are associated with respective nodes in the data tree 116. Entry of information via electronic form 130 will therefore prompt the solution module 104 to route such information to appropriate storage locations in the data tree 116. Again, the linking between the electronic form 130 and the XML document 102 is provided by the mapping module 122.
[0012] The functionality provided by the solution module 104 is defined, in part, by a solution file, such as exemplary solution file 136 stored in storage 138. The solution file 136 essentially constitutes an electronic form template, providing all of the semantic information required to transform the XML document 102 into the visual surface/document view 106. Different XML documents may have been created by, or otherwise refer to, different electronic form templates. Accordingly, different XML documents may have different solution files associated therewith. Various techniques can be used to retrieve a solution file that is associated with a particular XML document. For instance, an appropriate solution file can be retrieved based on URN (Uniform Resource Name) or URL (Uniform Resource Locator) information contained in the header of an input XML document. That header information links the input document to a corresponding solution file. A storage 140 represents an archive for storing one or more XML documents created by, or otherwise associated with, respective solution files.
[0013] The data processing application 100 supports editing structures such as repeating sections and optional sections that are editing controls bound to XML data. When data is entered or deleted using one of these editing controls, the underlying XML data is correspondingly inserted or deleted. It is non-trivial to identify which hierarchy of XML nodes needs to be deleted or inserted and where they need to be inserted or deleted. Moreover, it is cumbersome to provide exhaustive information in a storage space (e.g., the solution file 136) so that that information can be used to resolve which hierarchy of XML nodes needs to be deleted or inserted, as well as where the hierarchy of XML nodes is to be inserted or deleted. In order to do so, the information being stored must contain a representation of all of the possible fragments for the hierarchy of XML nodes that can be inserted or deleted. Depending upon the complexity of the XML in document 102, the fragment representation can cause the information being stored to be quite large. A large collection of such information can result in a correspondingly large performance problem when loading that information into the data processing application 100.
[0014] Seen from another perspective, suppose the XML document 102 includes XML nodes in a structure seen in Table A:
[0015]
where the above notation “?” indicates an optional node, and where E is a container for F, G, and H as follows:
| TABLE A | |
|---|---|
| A | |
| B? | |
| C? | |
| D? | |
| E? | |
| F | |
| G | |
| H | |
where the above notation “?” indicates an optional node, and where E is a container for F, G, and H as follows:
[0016]
Suppose an optional section bound to the XML node E is to be inserted. In this case, depending on the presence of zero or more of the optional nodes B, C and D, the XML to insert could be one of the following four (4) fragments:
Suppose an optional section bound to the XML node E is to be inserted. In this case, depending on the presence of zero or more of the optional nodes B, C and D, the XML to insert could be one of the following four (4) fragments:
-
- [0017] One fragment rooted in E with parent D
- [0018] One fragment rooted in D with parent C
- [0019] One fragment rooted in C with parent B
- [0020] One fragment rooted in B with parent A
In general, as many separate XML fragments would be generated as the number of optional XML nodes that occur on the branch connecting the container node to the item XML node. Stated otherwise, a fragment will be generated from a corresponding item to a corresponding view side container, which may or may not be the same as the data side container, where the data side container is the XML node's parent in a corresponding XML tree. Generating all possible XML fragments, however, can be verbose if the corresponding schema for the XML document is large and/or has a high branching factor. This verbosity is due to the inability to factor the commonalities among the XML fragments and the need for a separate element for each entry. Again, the impact of this verbosity is that the performance of the user experience in editing an electronic form is poor in the presence of anisomorphic electronic form views on complex schemas for the underlying XML document 102.
[0021] It would be an advantage in the art to remove the need to express all of the possible portions of a hierarchical markup language fragment that can be inserted or deleted when editing a structured document by processing documents containing structured data (e.g., data whose structured is described by a schema) that is expressed using the markup language. This reduced expression would in turn advantageously reduce the size of the semantic information required to transform the structured data into the rendered structured document, which would in turn advantageously improve the performance of the rendering.
SUMMARY
[0022] According to one exemplary implementation, a method is described for reusing markup language fragment information that would otherwise be spread across different markup language fragments, where fragment redundancy is removed from the markup language fragment information. The method accesses schema information for a markup language document corresponding to an electronic form when the form is being used for data entry. As data is entered into and deleted from the electronic form, the markup language fragment information is used to identify markup language fragments that are correspondingly to be inserted, and view-to-data mapping as well as schema knowledge is involved in identifying nodes to be deleted. The markup language fragment information includes both the largest and the smallest markup language fragments for an insertion or substitution to be performed on an editing control of the electronic form, such as a table or an optional section. The markup language fragment information is used in conjunction with the schema information to ensure that the data entry for the electronic form will be valid. In the case of an insertion, schema information is used to take into account the possible presence or absence of optional ancestors so as to compute a valid insertion position and correctly compute the fragment to insert from the markup language fragment information. In the case of an insertion, deletion, or substitution, edit-time awareness of the schema information is used to take into account the atomic character of optional and repeated sequences of elements so as to avoid disrupting these sequences.
[0023] Related computer readable media are also described herein.
BRIEF DESCRIPTION OF THE DRAWINGS
[0024] FIG. 1 shows an exemplary data processing application that includes mapping between structured data and a visual surface.
[0025] FIG. 2 shows an exemplary solution file used in conjunction with a solution module shown in FIG. 1 .
[0026] FIG. 3 is a flow diagram illustrating exemplary relationships between design components for an electronic form application, runtime components for using an electronic form designed using the design components, and solution components that are preexisting electronic forms that can be used with the electronic form application.
[0027] FIG. 4 shows an exemplary mapping module used in the data processing application of FIG. 1 .
[0028] FIG. 5 shows an exemplary apparatus for implementing the data processing application shown in FIG. 1 .
[0029] FIG. 6 shows an exemplary user interface (UI) for editing an electronic form.
[0030] FIG. 7 a depicts an Instantiated Content Model (ICM) for the input data <B/><D/><C/> and the content model B (C|D)*E?
[0031] FIG. 7 b depicts an ICM for the input data <B/><C/><C/> and the content model B? (C D?).
[0032] FIG. 7 c depicts a set of content models with an exemplary notation for expressing possible fragments for editing controls corresponding to data entry fields in the UI of FIG. 6 .
[0033] FIG. 8 shows an exemplary procedure for generating annotations in an electronic form that provide mapping back to underlying data, and for subsequently editing the electronic form having those annotations.
[0034] FIG. 9 shows an exemplary computing environment for implementing the data processing application shown in FIG. 1 .
[0035] The same numbers are used throughout the disclosure and figures to reference like components and features. Series 100 numbers refer to features originally found in FIG. 1 , series 200 numbers refer to features originally found in FIG. 2 , series 300 numbers refer to features originally found in FIG. 3 , and so on.
DETAILED DESCRIPTION
[0036] This disclosure pertains to the rendering and editing of information based on structured input data. To provide a concrete framework for discussion, this disclosure will specifically describe the transformation of hierarchically organized data expressed in a markup language into an electronic form. The electronic form can be visually rendered and edited by an end user. An electronic forms application can be provided with all of the possible portions of the hierarchically organized data that can be inserted or deleted when visually rendering the electronic form. For efficiency sake, these possible portions are expressed using a coding that is reduces the size of the expression. An exemplary electronic form discussed herein is a product catalog, although other exemplary electronic forms are also applicable, including a timesheet, a work order, a travel log, and so on. Moreover, the concepts described herein also have application to other data processing applications besides electronic forms processing.
[0037] This disclosure is organized as follows. Section A of this disclosure describes an exemplary design strategy used to provide mapping between structured data and a visual surface. Section B describes an exemplary implementation of the design strategy discussed in Section A. Section C describes an exemplary method of operation of the implementation described in Section B. And Section D describes an exemplary computing environment that can be used to provide the implementation described in Section B.
[0038] A. Exemplary Design Strategy
[0039] Overview of Design Strategy
[0040] Because hierarchically organized data that is expressed in a markup language can be transformed into an electronic form, such electronic forms are based on marked up data, for instance XML data. When modifying the electronic forms using editing controls (e.g., filling out the form or entering data into the form), the editing user is indirectly manipulating the underlying XML tree that will be persisted when the electronic form is saved. For instance, data entry that can be made into the electronic form can be repeating sections and optional sections, each of which is an editing control that is bound to XML data. When data is entered or deleted using an editing control on the electronic form, the underlying XML data is correspondingly inserted or deleted advantageously by providing the editing process an awareness with respect to the schema for the underlying XML data. This schema awareness makes it possible to identify all the XML nodes of a sequence to delete, insert, or substitute, given one of these XML nodes. The XML tree is also validated against a corresponding XSD schema whenever it is being modified. When an editing control on an electronic form is used to enter or to delete data in data entry fields, such as on the visual surface 106 seen in FIG. 1 , it may be necessary to insert different fragments of XML depending on what XML nodes are already present in the XML tree.
[0041] For example, a fragment for inserting an address in a contact manager database is represented in the XML as:
-
- [0042] <address><state></state><zipcode></zipcode></address>.
The schema for the contact manager database specifies that an <address> node can only be a child of a <contact> node. The schema also specifies that the <contact> node can only be a child of the <contacts> node. In this case, when the fragment is inserted, a different subtree may have to be inserted depending on whether there are already <contacts> or <contact> nodes in the XML tree. Here, a first fragment would be used when the <contact> node is already in the XML tree. A different second fragment would be used when the <contacts> node is already in the XML tree, but where there is no <contact> node. A still further different fragment would be used when the <contacts> node is not in the XML tree. In summary, when one of the fragments is inserted or deleted for the address in the contacts manager database, the underlying XML data is correspondingly inserted or deleted with one of the three (3) foregoing fragments, respectively: - [0043] Fragment#1: <address><state></state><zipcode></zipcode></address>;
- [0044] Fragment#2:<contact><address>state></state><zipcode></zipcode></address><contact>; and
- [0045] Fragment#3:<contacts><contact><address><state></state><zipcode></zipcode></address></contact></contacts>.
Note, however, that in the delete case, the parent contact or contacts node would not be deleted.
- [0042] <address><state></state><zipcode></zipcode></address>.
[0046] From the above example for the address field insertion or deletion, a total of 216 characters are needed to express all possible fragments. Stated otherwise, all of the above three (3) fragments are provided at the time that the form is created (e.g., at the time when the electronic form is designed). When the editing user enters data into the electronic form (i.e., at runtime or electronic form ‘edit time’), one of the three fragments is chosen to be inserted (depending on which nodes were currently present in the XML tree). As the electronic form is created to include many form editing controls, however, the number of characters needed to express all of the possible fragments for all of the editing controls becomes unmanageably large. The proliferation of fragments, however, is not just dependent on the number of controls in the form. In a complex XML tree, a single control can produce a large amount of redundant fragment data. An unmanageably large number of characters in turn results in a user experience that is frustrating to the editing user who will be plagued with excessive response latency when interacting with a user interface to fill out the electronic form.
[0047] Rather than subjecting the editing user to excessive response latency due to the unmanageably large number of characters in the collection of all possible fragments needed at edit time for an electronic form, implementations provide for an edit time user experience in which an electronic forms application is aware of the underlying schema that corresponds to the electronic form. This awareness makes it possible to provide no more than one (1) fragment for each insertion command in the definition of the electronic form (e.g., an “.XSF” file as discussed below), thereby keeping the number of characters stored in the solution file to the absolute minimum required. When the editing user performs data entry into the electronic form at edit time, code is present at edit time that allows the electronic forms application to determine the particular portion of the ‘one (1) maximal information fragment’ that needs to be inserted into the XML tree. The term “maximal information fragment”, as used here, is intended to denote the list of data subtrees that is maximal both in size and in subtree sizes among potentially insertable fragments. This code requires the edit time to be aware of the underlying schema and uses a data structure named ‘Instantiated Content Model (ICM)’ to achieve this awareness. In the above example, the ICMs used at edit time would represent the edit-time context into which to insert the Fragment #3 as the ‘one (1) maximal information fragment’, or a part of this fragment according to the schema constraints encoded into the ICMs. ICMs encode information from a schema (e.g., the solution file 136 seen in FIG. 1 ) and represent the relations between this schema information, existing data nodes that instantiate schema elements and virtual data nodes that can be inserted to instantiate optional schema elements. As such, ICMs can be used to ensure that an electronic form will transition from one valid state to another valid state as an editing user inserts and deletes data into various edit controls (e.g., data entry fields) in an electronic form during data entry at edit time.
[0048] The above example involves three content models. If we omit the content model in which Contacts appears as an optional element. Contacts has the content model “Contact*”, and Contact in its turn has the content model “(address state zipcode)*”, where “*” indicates that the preceding characters represent zero or more nodes and where the closed parentheses indicate a group of nodes. A standard abstract syntax tree for Contact's content model is as follows.
[0049]
| TABLE B |
|---|
|
[0050] An ICM is built by matching such an abstract syntax tree with XML data. For example, matching the abstract syntax tree in Table B with the XML data “<Address>a</Address><City>c</City><Zipcode>z</Zipcode>” will yield the following structure.
[0051]
The ICM contains nodes instantiated by input nodes and uninstantiated nodes at which insertions are allowed. In addition, the semantics of the “*” node allows the deletion of any instantiated sequence.
Table B′ highlights the case where there are repeating nodes. Schema aware editing code, as implemented herein, can also deal with constructs like optional sections, choices and recursion.
| TABLE B' |
|---|
|
The ICM contains nodes instantiated by input nodes and uninstantiated nodes at which insertions are allowed. In addition, the semantics of the “*” node allows the deletion of any instantiated sequence.
Table B′ highlights the case where there are repeating nodes. Schema aware editing code, as implemented herein, can also deal with constructs like optional sections, choices and recursion.
[0052] Implementations of schema aware editing uses schema knowledge in order to accomplish the Features (i)-(iii) as follows:
-
- [0053] Feature (i): identify all the nodes of a sequence to delete, insert, or substitute, given one of these nodes;
- [0054] Feature (ii): use only the relevant parts of a fragment to insert according to an insertion context; and
- [0055] Feature (iii): based on the current selection or the command activated, find the most intuitive location in the context that allows the operation, which is generally the highest insertable position below the parent.
Feature (i) requires mapping a XML tree node to a representation of its parent's ICM. This makes it possible to determine whether it belongs to a sequence containing other nodes and, in this case, to delete the whole sequence to ensure validity and reflect the semantics of the deletion. Feature (ii) involves inserting a variable geometry fragment by identifying the sub-fragment to insert by searching for the best insertable position below the parent as per Feature (iii) and determining which siblings of this sub-fragment must be inserted to satisfy the schema.
[0056] An ICM, alternatively stated, is a tree with XML nodes representing either a regular expression operator (sequence, choice, occurrence, etc) or a XML tree node. XML tree nodes occur only in the leaves of the ICM tree. The ICM tree is constructed based on the schema. Walking the ICM tree determines the position to insert the XML node and identifies the sub-fragment that is to be inserted.
[0057] Several examples of a general nature will now be given. A particular XML fragment will be designated to contain the largest possible XML fragment that can be inserted, which is the one that can typically be inserted directly into the corresponding XML node bound to a corresponding container. A new XML attribute in the definition of the electronic form can be defined and is named in the XML examples below as ‘innerFragment’. This new XML attribute contains an XPATH relative to the fragment for the XML node that identifies the smallest fragment that can be inserted. Given these two parameters, respectively identified as the largest and smallest XML fragments that can be inserted, it is possible to identify the position of the current context within the largest fragment and to choose the right sub-tree to insert in every occasion.
EXAMPLES
A general tree
[0058] The XML describing the definition for the electronic form will be examined in the following three (3) cases that represent three (3) classes of interaction. For all three (3) classes, the three (3) cases use the following tree:
[0059]
where the notation “?” means that the preceding XML node is optional, the notation “*” means that the preceding XML node repeats from zero to an infinite number of occurrences, and the notation “+” means that one or more of the preceding XML node will be present.
| Y | |
| Z? | |
| A? | |
| choice * | |
| B? | |
| C | |
| D* | |
| E+ | |
| sequence * | |
| F+ | |
| G? | |
| H* | |
| I | |
where the notation “?” means that the preceding XML node is optional, the notation “*” means that the preceding XML node repeats from zero to an infinite number of occurrences, and the notation “+” means that one or more of the preceding XML node will be present.
[0060] Case 1: The Container is the Root XML Node
[0061] In this case, shown in Table C, there is an optional section bound to the G XML node containing a text field bound to the G XML node as well. There is no explicit containing section (e.g., the container is the root element, <Y>).
[0062]
For this case, the XML for the definition of the electronic form that would be generated is as follows:
<xsf:xmlToEdit item=“/Y/Z/A/G” container=“/Y”>
| TABLE C |
|---|
|
For this case, the XML for the definition of the electronic form that would be generated is as follows:
<xsf:xmlToEdit item=“/Y/Z/A/G” container=“/Y”>
[0063] <xsf:editWith component=“xOptional” . . . >
-
- [0064] <xsf:fragmentToInsert>
- [0065] <xsf:chooseFragment parent=“.” innerFragment=“Z/A/G”>
- [0066] <Z>
- [0067] <A>
- [0068] <F>foo</F>
- [0069] <G>bar<G>
- [0070] <I>baz</I>
- [0071] </A>
- [0072] </Z>
- [0066] <Z>
- [0073] </xsf:chooseFragment>
- [0065] <xsf:chooseFragment parent=“.” innerFragment=“Z/A/G”>
- [0074] </xsf:fragmentToInsert>
- [0064] <xsf:fragmentToInsert>
[0075] </xsf:editWith>
</xsf:xmlToEdit>
[0076] Case 2—The Container is an Ancestor of the Item
[0077] In this case, shown in Table D, an optional section bound to the G XML node with a text box bound to the ‘G’ inside it is located within a section bound to an ancestor of the G XML node (e.g., in this case the parent element, A)
[0078]
For this case, the XML for the definition of the electronic form that would be generated is as follows:
| TABLE D |
|---|
|
For this case, the XML for the definition of the electronic form that would be generated is as follows:
-
- [0079] <xsf:xmlToEdit item=“/Y/Z/A/G” container=“/Y/Z/A”>
- [0080] <xsf:editWith component=“xOptional” . . . >
- [0081] <xsf:fragmentToInsert>
- [0082] <xsf:chooseFragment parent=“.” innerFragment=“G”>
- [0083] <F>foo</F>
- [0084] <G>bar</G>
- [0085] <I>baz</I>
- [0086] </xsf:chooseFragment>
- [0087] </xsf:fragmentToInsert>
- [0081] <xsf:fragmentToInsert>
- [0088] </xsf:editWith>
- [0080] <xsf:editWith component=“xOptional” . . . >
- [0089] </xsf:xmlToEdit>
- [0079] <xsf:xmlToEdit item=“/Y/Z/A/G” container=“/Y/Z/A”>
[0090] Case 3—The Container is a Sibling of the Item
[0091] In this case, the optional section bound to the XML node G and containing the textbox bound to the XML node G is located within a section bound to the XML node B, a sibling of the XML node G, as shown in Table E.
[0092]
For this case, the XML for the definition of the electronic form that would be generated is as follows:
<xsf:xmlToEdit item=“/Y/Z/A/G” container=“/Y/Z/A/B”>
| TABLE E |
|---|
|
For this case, the XML for the definition of the electronic form that would be generated is as follows:
<xsf:xmlToEdit item=“/Y/Z/A/G” container=“/Y/Z/A/B”>
[0093] <xsf:editWith component=“xOptional” . . . >
-
- [0094] <xsf:fragmentTolnsert>
- [0095] <xsf:chooseFragment parent=“../../..” innerFragment=“Z/A/G”>
- [0096] <A>
- [0097] <F>foo</F>
- [0098] <G>bar</G>
- [0099] <I>baz</I>
- [0100] <A>
- [0096] <A>
- [0101] </Z>
- [0095] <xsf:chooseFragment parent=“../../..” innerFragment=“Z/A/G”>
- [0102] </xsf:chooseFragment>
- [0094] <xsf:fragmentTolnsert>
[0103] </xsf:fragmentToInsert>
</xsf:editWith>
</xsf:xmlToEdit>
[0104] FIG. 2 shows an exemplary composition of the solution file 136. As shown there, the solution file 136 contains a collection of files (202, 204, 206, 208, and 210) that together provide semantic information used, in part, to implement the solution module 104. This collection of files can be packaged together. In one exemplary implementation, this collection of files is referred to using an extension ‘.xsn’. A form definition file 202, also called a manifest file, forms the centerpiece of the collection. The form definition file 202 contains information about all of the other files in the solution module 104. A design component which is used when an electronic form is being created so as to contain various editing controls, including text boxes, drop-down list boxes, list boxes, option buttons (also referred to as radio buttons), check boxes, and so on. Some of these controls may be included in the forms definition file 202. This file 202 is assigned the exemplary extension ‘.xsf’. Three examples of XML code for the forms definition file 202 are given above with respect to Tables C-E and their corresponding Cases 1-3.
[0105] A schema file 204 is used to constrain and validate the XML document 102. This file is assigned the exemplary extension ‘.xsd’. View files 206 are used to transform the XML document 102, for presentation as views (visual surfaces 106). These files are used to implement the mapping module 118 discussed in connection with FIG. 1 . There can be multiple view files 206 corresponding to multiple possible views (i.e., visual surfaces 106) that the editing user 108 can select from. The view files 206 are assigned the exemplary extension ‘.xsl’. A default data file 208 contains default data that can be initially displayed in the view when an editor user 108 first opens the electronic form, and has not yet begun to edit the fields. This file 208 is assigned the exemplary extension .xml. Finally, business logic files 210 provide programming code used to implement specific editing behavior, data validation, event handlers, control of data flow, and other features. Such programs can be written in any kind of language, such as the JScript® or VBSCRIPT scripting languages. In this case, these files are assigned the exemplary extensions ‘.js’ or ‘.vb’ (for JScript® and VBSCRIPT scripting languages, respectively).
[0106] Exemplary Architecture Solution Module
[0107] FIG. 3 shows an exemplary architecture 300 for an electronic forms application that can be used to both create and fill out an electronic form. The architecture 300 includes a solution design component 302 for building a solution corresponding to a data file for which the electronic form can be used, an XML runtime component 304 to enter and view data in the electronic form, and optionally one or more exemplary XML solutions 306. Each of the components of the architecture 300 will now be discussed.
[0108] The solution design component 302 of the architecture 300, such as is seen at reference numeral 302 in FIG. 3 , allows a solution to be built. The solution design component 302 provides a user interface (UI) to handle all the design requirements for common XML solutions. The result of the solution design component 302 is the set of files that represent a corresponding XML solution file 136. The structure of the XML solution file 136 declaratively defines the output of the solution design component 302. Included in the solution design component 302 are an XSL editor and solution builder 310. Any script editor can be used to edit business logic script used in the electronic form. The supporting files 312 communicate with one or more application files 308 that are useful in building the XML solution file 136 for an XML document 102.
[0109] In one implementation, the solution design component 302 provides a WYSIWYG forms designer and editor based on XML standards that can be used for generic XML schemas. As such, XSL editor and solution builder 310 need not be characterized as including an XML editor. Moreover, notepad 314 and support files 312 need not be present.
[0110] The runtime component 304 includes an editor frame 320 that includes XML editing 322. The XML editing 322 includes capabilities for an Instantiated Content Model (ICM). The ICM, as previously disclosed, allows for a minimized expression of all of the possible portions of the XML fragments that can be inserted or deleted when the electronic form is being filled out by the editing user 108. This minimized expression in turn reduces the size of the solution infrastructure 324, discussed below, which in turn improves the performance of the rendering of the electronic form. The XML editing 322, in conjunction with the instantiated content model, enables the editing user 108 to validly fill out the electronic form without latency induced by the size of the solution infrastructure 324.
[0111] In addition to the foregoing, the editor frame 320 bidirectionally communicates with the solution infrastructure 324, such as XML solution 302 seen in FIG. 3 . Each of the solution infrastructure 324 and the XML store 316 bidirectionally communicates with one of more XML documents 330. Additionally, the solution infrastructure 324 communicates with the one or more application files 308. As seen in FIG. 2 , the XML document 102 points to the solution file 136 that should process the XML document 102 on a computing device (e.g., a personal computer). When the editing user 18 user uses the computer device to navigate to the XML document 102, the solution infrastructure 324 loads the required the solution file 136. If needed, the solution file 136 handles any contextual user interfaces (UI), runs business logic associated with the XML document 102 (e.g., business logic 210), and enforces security for all operations of the computing device.
[0112] The XML solution infrastructure 324 allows the editing user 108 of the computing device to access various XML data sources on the computing device, in an intranet, as well as on an extranet or the World Wide Web. Given the foregoing, XML Documents 330 can be displayed and edited using the XML Editing 322 of the editor frame 320.
[0113] Various exemplary solution files 340 can be provided to the editing user 108 of the computing device as part of the architecture 300, where the editing user 108 would like to see sample or exemplary solutions from which the user can learn about the data processing application 100. Exemplary solution files 340 can provide the editing user 108 with a guide for customizing electronic forms and for building new solutions based on the exemplary solutions.
[0114] The Mapping Module
[0115] FIG. 4 shows an exemplary composition of the mapping module 122 introduced in FIG. 1 . The mapping module 122 receives the structured data 102 and adds annotations to it to produce the annotated HTML document 128 (or other kind of annotated transformed document). The mapping module 122 performs this task in two Phases: Phase 1 and Phase 2. In Phase 1, the mapping module 122 takes arbitrary XSLT information (or other kind of transformation instructions) and adds mapping functions to it. These mapping functions are inserted at particular locations within the XSLT information. These mapping functions provide functionality that, when activated, generate references to specific locations within the structured XML document 102. However, in the Phase 1 itself, the mapping module 122 simply inserts these mapping functions within the XSLT information; that is, in Phase 1, the mapping module 122 does not execute the functions to return the actual references that point to appropriate parts of the structured XML document 102. In Phase 2, the mapping module 122 executes the mapping functions to provide actual values for the references.
[0116] Phase 1 is performed on the XSLT information itself, outside the context of the processing of any specific XML document. More specifically, Phase 1 can be performed once, for instance, after an electronic form has been newly created or modified, or when it has been opened for the first time by the editing user 108. This has the effect of modifying the XSLT information associated with the newly created or modified electronic form by adding mapping functions to it. Phase 2, by contrast, is performed each time a particular structured XML document 102 is rendered. In Phase 2, the mapping functions within the XSLT information are executed with respect to a particular XML document 102, to thereby produce an output HTML document 406 (or other kind of output document) that has references inserted throughout it that point back to various locations in the particular XML document 102. Thus, to summarize, Phase 1 is performed once upon the creation or modification of the XSLT information, whereas Phase 2 is performed each time a particular XML document 102 is rendered. Phase 1 can also be referred to as the “design” phase when a form is created. Phase 2 can also be referred to as the “runtime” phase (i.e., corresponding to runtime 304 seen in FIG. 3 ) as it is performed when a particular XML document 102 is rendered. Additional aspects of the above-described functionality will be described with reference to the logic illustrated in FIG. 4 .
[0117] To begin with, Phase 1 acts on so-called arbitrary XSLT information 402. The XSLT information 402 is arbitrary in the sense that it is not prepared specifically with the annotation mechanism described above in mind; in other words, the XSLT information 402 can constitute any kind of XSLT information produced by any process in any environment. The arbitrary XSLT information 402 can serve a conventional role of converting an XML document 404 into an HTML document 406 (or other kind of the document). The resultant HTML document 406 would not contain any back pointer annotations, and hence would not have the capability of mapping a resultant visual surface back to the originating XML document 404.
[0118] Phase 1 of the mapping module 122 takes this arbitrary XSLT information 402 and adds mapping functions to it. An annotation module 408 performs this role. The output of the annotation module 408 represents annotated XSLT information 410 having the mapping functions added thereto. The annotated XSLT information 410 can be stored in a storage (for example, a cache storage 412) for later use in Phase 2 (the runtime portion of the procedure).
[0119] In one implementation, the mapping functions added by the annotation module 408 can be implemented as so-called XSLT extension functions. More specifically, XSLT provides a collection of tools to accomplish certain tasks. However, the range of functions that can be performed with unsupplemented XSLT is limited; XSLT cannot perform some tasks very well, and cannot perform other tasks at all. Extension functions constitute references within the XSLT information that act as triggers to call some extended functionality to execute tasks not provided within XSLT itself. In the instant case, the extension functions, when executed, perform the task of adding references to the HTML document 128 (or a document expressed in some other structured format) that point back to respective locations in the structured XML document 102. To repeat, however, these mapping functions are not executed in Phase 1; rather, in Phase 1, they are merely inserted in the XSLT information 402 at appropriate locations.
[0120] Different strategies can be used to govern where to insert the mapping functions within the XSLT information 402. These strategies may differ from one processing environment to the next, because different processing environments may involve the processing of different types of documents having different characteristics. In the present case, an electronic form often has a nested structure. For instance, a section of the electronic form may contain a subsection, and that subsection may have its own respective subsection(s). Any of these sections and subsections can have data entry fields included therein. For example, an electronic form can include a table that defines a primary section. That table, in turn, can include multiple subsections (e.g., rows), and each row can contain multiple data entry fields. In this context, a so-called outer mapping can be used to identify a certain section or subsection in the electronic form. A so-called inner mapping can be used to specifically identify a data entry field within that section or subsection. The inner mappings thus provide the specific bindings between the data entry fields in the electronic form and the respective nodes of the structured XML document 102 associated with the data entry fields. The outer mappings provide information regarding the scope (e.g., extent) of a section or subsection that may include one or more inner mapping data entry points. In the context of the above example pertaining to the rendering of a table in the electronic form, outer mappings can be used to demarcate the table itself, as well as individual rows within the table. Inner mappings can be used to identify data entry fields within the table.
[0121] Still more specifically, the annotation module 408 can add outer mappings in the XSLT information 402 at locations representative of context changes. There are two ways to change context in XSLT: (1) using an “apply-templates” instruction; and (2) using a “for-each” instruction. The “apply-template” instruction causes the output flow of the XSLT processing to move to a new template, which is evaluated in the new context. To mark these context changes, the annotation module 408 annotates all direct children of the template nodes with mapping function calls requesting the respective identifiers (IDs) of the current context. For the “for-each” instruction, the annotation module 408 causes the output flow of the XSLT processing to move to the child of the “for-each” node. In this case, the annotation module 408 annotates all direct children of the “for-each” nodes with mapping function calls requesting the respective IDs of the current context. Generally, as is well known, the “apply-template” instruction applies a template rule deemed most suitable for processing a current node and its children. The “for each” instruction performs specified actions for a collection of nodes that satisfy a selection expression.
[0122] The annotation module 408 can add inner mappings in those cases where XSLT pulls the contents of XML nodes of the data tree 116 directly into the view tree 120. This content can be mapped directly from the view tree 120 back to the XML nodes in the data tree 116 from which they were pulled. More specifically, XSLT pulls out content using the “value-of” and “copy-of” instructions used in XSLT. The annotation module 408 marks these content grabs by adding mapping function calls requesting the IDs of the respective XML nodes in the data tree 116 being referenced. Annotations are not generated if the mapping is ambiguous. This could happen if the “value-of” instruction refers to more than one XML node in the data tree 116. Generally, as is well known, the “copy-of” instruction of XSLT copies all aspects (attributes, tags, children, etc.) of identified nodes into a result tree. The “value-of” instruction in XSLT converts the identified nodes to a string and adds this string to the result tree.
[0123] The annotation module 408 automatically adds the outer and inner mappings based on the above-described guidelines (that is, by adding mapping functions where the above-described XSLT instructions occur). This automatic annotation may not be sufficient for all situations. To address these cases, XSLT authors can “manually” modify the XSLT to include mapping functions at locations selected by the XSLT authors. Not only can XSLT authors modify the XSLT to add custom annotations, some software applications, such as an application capable of designing an electronic form, can add these custom annotations in the XSLT.
[0124] Phase 2 of the mapping procedure involves executing the mapping functions added in Phase 1 to return specific references to nodes in the data tree 116. A runtime XSLT module 414 performs this function to yield annotated output 416 having specific references added thereto. The ultimate output of the runtime XSLT module 414 is the annotated HTML document 128 (or a document expressed in some other structured format). More specifically, the extension functions added in Phase 1 provide XPath references to namespace functions. When the XSLT information 402 is processed at runtime, the runtime XSLT module 414 reads the namespace functions and calls them, passing a node list as a parameter. The runtime XSLT module 414 analyzes this node list, ensures that it is unambiguous (e.g., that it contains only one node), and returns identifiers for these nodes. The runtime XSLT module 414 writes these identifiers to a result tree, thus building the HTML document 128 having mapping references added thereto.
[0125] Additional information with respect to the mapping module 122 in FIG. 1 is disclosed in commonly assigned U.S. patent application Ser. No. 10/723,188, filed on Nov. 26, 2003, entitled “Mapping Interactive Edits Between A Visual Surface And Structured Data”, which is incorporated herein by reference in its entirety.
[0126] B. Exemplary Apparatus for Implementing Mapping
[0127] FIG. 5 shows an overview of an exemplary apparatus 500 for implementing the data processing application 100 shown in FIG. 1 . The apparatus 500 includes a computer 502 that contains one or more processing units 504 and memory 506. Among other information, the memory 506 can store an operating system 508 and the above-described data processing application 100, identified in FIG. 5 as a forms application 510. The forms application 510 can include data files 512 for storing the structured XML document 102, and a solution module 514. The solution module 514 comprises logic that specifies the appearance and behavior of the visual surface 106 as was described in connection with FIG. 1 . The logic provided by solution module 514 is, in turn, determined by a solution file (such as a solution file 136 composed of the files shown in FIGS. 1-2 ). The computer 502 is coupled to a collection of input devices 516, including the keyboard 112, mouse device 114, as well as other input devices 518. The computer 502 is also coupled to a display device 520.
[0128] In one exemplary implementation, the forms application 510 includes a design mode and an editing mode. The design mode presents design UI 522 on the display device 520 for interaction with a designing user 524. The editing mode presents editing UI 526 on the display device 520 for interaction with the editing user 108. In the design mode, the forms application 510 creates an electronic form 528, or modifies the structure of the electronic form 528 in a way that affects its basic schema. In other words, the design operation produces the solution file 136 that furnishes the electronic form 528. In the editing mode, the editing user 108 uses the electronic form 528 for its intended purpose—that is, by entering information into the electronic form 528 for a business-related purpose or other purpose.
[0129] In the design mode, the forms application 510 can be configured to depict the electronic form 528 under development using a split-screen display technique. More specifically, a forms view portion 530 of the design UI 522 is devoted to a depiction of the normal appearance of the electronic form 528. A data source view portion 532 of the visual surface is devoted to displaying a hierarchical tree 534 that conveys the organization of data fields in the electronic form 528.
[0130] An exemplary designing UI 522 can allocate the visual surface 206 into the forms view portion 530 and the data source view portion 532. As described above, the forms view portion 530 contains a depiction of the normal appearance of the electronic form 528—in this case, an exemplary form 600 seen in FIG. 6 . The electronic form can includes a plurality text box entry fields. The data source view portion 532 includes the hierarchical tree 534 showing the nested layout of the text fields presented in the electronic form.
[0131] The forms application 510 provides multiple techniques for creating the electronic form. According to one technique, the electronic form can be created from scratch by building the electronic form from successively selected editing controls. In another technique, the electronic form can be created based on any pre-existing .xsd schema document (e.g., see schema 240 in FIG. 2 ) loaded into the forms application 510. The .xsd schema is an XML file that defines the structure and content type of the XML files that are associated with it. In another technique, the electronic form can be created based on an XML document. The forms application 510 will then create a schema based on the information in the input XML file. In another technique, the electronic form can be created based on a database schema. In this case, the forms application 510 will extract the schema of the data and convert that record set to an XML representation. Still other techniques can be used to create electronic forms.
[0132] Once a form has been created, its design (and associated schema) can be further modified. For example, the forms application 510 allows the designing user 524 to modify existing editing controls used in the electronic form, or add additional editing controls.
[0133] The creation of the electronic form also creates an associated solution file. The solution file effectively forms a template that can be archived and subsequently used in a business (or other environment). FIG. 6 demonstrates an exemplary use of the exemplary electronic form 600 after it has been created in the design mode of operation of the forms application 510. More specifically, FIG. 6 shows the presentation of the exemplary electronic form 600 in the editing mode of operation of the forms application 510. In this case, the editing user 108 is entering data into the data entry fields in the editing UI 526. For instance, the editing user 108 is currently entering text 602 into a text field 610a. The editing user 108 can select a particular part of the exemplary electronic form 600 in a conventional manner, such as by pointing to and clicking on a particular field in the exemplary electronic form using the mouse device 114.
[0134] As described in Section A of this disclosure, data entry fields in the electronic form are mapped to underlying structured XML document 102—in this case, an XML document 620. This mapping is achieved via annotations added to the HTML document used to render the exemplary electronic form 600. More specifically, the annotations act as references which point to particular parts of the XML document 620 associated with the data entry fields in the exemplary electronic form 600. Through this mechanism, the data entered by the editing user 108 is routed back to the XML document 620 and stored in its data structure at appropriate locations. This mapping functionality is represented in FIG. 6 by the arrow 618.
[0135] As mentioned above, Section C, below, describes an exemplary method of operation of the implementation described in Section B. This method, in one exemplary implementation, applies an XSLT stylesheet to an XML document to create an HTML view. At least some of the HTML elements in the HTML view are associated with a specifically named attribute. The HTML elements that are associated with the specifically named attribute have respective corresponding XML nodes in the XML document, where the location of each XML node in the XML document is determined by the value of the specifically named attribute. Once edits to the HTML elements associated with the specifically named attribute have been received in an interactive session with an editing user, the received edits are saved back into the nodes in the XML document that respectively correspond to the HTML elements associated with the specifically named attribute.
[0136] Referring now to FIGS. 5-7 c, electronic form 600 is displayed in the editing UI 526 by the forms application 510 so that an editing user 108 can enter data into the depicted data entry fields of a data entry screen 628. The data entry fields on the data entry screen 628 are being used to collect information for a product catalog. Each product field 604 in the catalog can be sold by zero to an infinite number of companies. The name of each such company can be input at a data entry field 606a. Each company may or may not have a Web site, where the Web site URL is entered at data entry field 614a. Each company can have zero to an infinite number of addresses. Each address has a city data entry field 610a and a state data entry field 612a. Each address can have an alphanumeric entry in either a P.O. Box data entry field 608a′ or in a street data entry field 608a″ (e.g., one or the other, but not both). Information is kept in a schema associated with the underlying structured XML document 102 represented by the XML document 620 as to what will be considered to be valid data that can be entered into the data entry fields for the electronic form 600. Once validated, these data are then subjected to a mapping operation 618 for entry into the XML document 620. For instance, the Web site URL entered at data entry field 614a may be required to include a “WWW” character string, and to include a suffix character string such as “.com”, “.org”, “.edu”, etc. Other data entry fields may be considered valid only if numeric characters are entered, or only if a capital letter has been entered. Of course, the business logic for validation can be quite varied and can be stored so as to be associated as definitions for the electronic form 600 (i.e., in FIG. 2 , see form definition (.XSF) and business logic file 210 for storage of validation criteria).
[0137] Reference numeral 602 shows that that characters “San Jo” have been entered into the city address data entry field 610a for the company named “Acme” seen at data entry field 606a, where a street address “124 Maple Street” has been entered at data entry field 608a′. Data entry field 604a indicates that a product called a “Ratchet—1234” is provided through by the “Acme” company that has a particular address that the editing user 108 has entered at data entry fields 608a′ and 610a.
[0138] Each data entry field has a corresponding place in the XML document 620 seen in FIG. 6 . The product name data entry field 604a corresponds to the node 604b in the XML document 620. The Web site data entry field 614a corresponds to the node 614b in the XML document 620. The company name data entry field 606a corresponds to the node 606b in the XML document 620. Multiple addresses can be made for each company, as represented by the address data entry fields 608a′-612, where each company can have from zero to infinity different address data sets. In this case, these address data sets are represented in the XML document 620 by nodes 608b-612b(1−I), where from 1 to “I” different addresses can be provided for each company.
[0139] FIG. 7 a depicts an Instantiated Content Model (ICM) for the input data <B/><D/><C/> and the content model B (CID)*E?, where the pipe sign ‘|’ relates mutually exclusive elements and the question mark ‘?’ follows an optional group or element.
[0140] FIG. 7 b depicts an ICM for the input data <B/><C/><C/> and the content model B? (C D?)+, where the plus sign ‘+’ follows a group or element occurring one or more times and the question mark ‘?’ follows an optional group or element. The combination of optional elements in various relations to a repeating group yields a high number of valid insertion points that are represented as uninstantiated nodes in the ICM.
[0141] FIG. 7 c more particularly illustrates a set of content models that can correspond to the XML document 620. The product is expressed at reference numeral 604b in FIG. 7 c as “Product ::=(Company Website?)*”. The meaning of this expression is that each product can be provided by zero to an infinite number of companies 606b, where each company 606b may or may not have one (1) Web site URL 614b. Each company is expressed at reference numeral 606b in FIG. 7 c as “Company ::=(City State (PO_Box|Street))*”. The meaning of this expression is that each company can have from zero to an infinite number of addresses each of which includes a city 610b, a state 612b, and either a PO Box 608b′ or a street address 608b″. Note, however, that FIG. 7 c represents the number of the address data sets for the PO Box field 608b′ and the street address field 608b″ as ranging in number from zero to infinity.
[0142] FIG. 7 a and FIG. 7 b show an exemplary notation that is capable of expressing all of the possible fragments for all of the editing controls on the electronic form 600. Use of this notation will avoid the storage requirements otherwise needed to store each possible fragment that can be used when inserting or deleting editing controls on the electronic form 600 as well as support dynamic insertion and deletion of nodes that in the schema are defined using syntactic constructs that group nodes without a common explicit parent (e.g., repeating sequences of nodes).
[0143] The received data that is entered into the data-entry fields of the electronic form 600 by the editing user 108 must be valid in order to be associated with corresponding nodes in the XML document 620 in its relationship with the corresponding XML document 102 in accordance with the associated schema 204 (.xsd). Although not shown in FIG. 6 , but by way of further example, a data entry field that can be on the electronic form, and into which the editing user 108 can enter data, can include an editing control represented by one or more of the following: a plain text box, a drop-down list box, a list box, a check box, a rich text box, an expression box, an option button, a button, a section with controls, a section, an optional section, an optional section with controls, a repeating section with controls, a repeating section, controls in a layout table, controls, a repeating table, a bulleted list, a numbered list, a plain list, a hyperlink, a date picker, an inline picture, a linked picture, etc. Each editing control can be an Extensible Stylesheet Language (XSLT) component. Schema aware editing code, as described herein, can be used to implement at least some of the foregoing editing controls and can also deal with constructs like optional sequences, choices and recursion.
[0144] The structure of each control on the electronic form will correspond to a particular hierarchy of the data in a particular portion of the XML document 620. Thus, if the structure of the portion of hierarchical data in the XML document 620 will allow for multiple fields of data, the forms application 510 will allow for entry in corresponding multiple data entry fields, such as editing controls that will allow for repeating sections and/or a repeating table. Likewise, if the structure of the portion of hierarchical data in the XML document 620 will allow for storage of only textual data, the forms application 510 will allow for entry in a corresponding data entry field of just textual data.
[0145] C. Exemplary Method of Operation
[0146] FIG. 8 shows an exemplary procedure 800 for creating and editing an electronic form. The procedure 800 can be implemented in software or firmware, or a combination of software and firmware.
[0147] Phase 1 of the procedure 800 includes steps 802, 804, and 806. Step 802 involves receiving XSLT information. This step 802 might correspond to receiving an XSLT stylesheet created in response to the creation or modification of an electronic form, or from some other source. The XSLT information is arbitrary in the sense that it does not need to be developed specifically to accommodate the annotation functionality which is subsequently applied to it. An exemplary technique for creating an XSLT file or stylesheet in the context of electronic forms processing is described in commonly assigned U.S. patent application Ser. No. 10/395,506, filed on Mar. 24, 2003, entitled “System and Method for Designing Electronic Forms”, which is incorporated herein by reference in its entirety. Step 804 involves automatically annotating the arbitrary XSLT by adding mapping functions to it. As described above, these mapping functions can constitute extension functions added to the XSLT information at inner and outer mapping locations. Step 806 involves caching the annotated XSLT for later retrieval and use. The XSLT author can also manually add mapping functions to the XSLT information to supplement the automatic annotations added to the XSLT information. It can again be mentioned that an XSLT author can modify the XSLT to add custom annotations and some software applications—such as an application capable of designing an electronic form.
[0148] Phase 2 of the procedure 800 involves steps 808, 810, and 812. Step 808 entails receiving an XML document to be processed using the annotated XSLT information. The XML document can be considered arbitrary, like the XSLT information, in the sense that it does not have to be structured to accommodate the annotation procedure that is subsequently applied to it; any XML document will suffice. Step 810 entails executing the mapping functions in the annotated XSLT information to return specific reference values that point back to the structured data 102. Step 812 entails outputting an annotated HTML document (or some other markup language document) for display. The HTML document is annotated by including references that point back to respective locations within the structured input data 102.
[0149] Following display of the annotated HTML document, the editing user 208 can edit the displayed electronic form. Steps 814, 816, and 818 pertain to this editing operation. In step 814, the forms application 510 receives the editing user 108's commands to execute an editing operation. These commands may be the result of the user pointing to a particular part of the visual surface 106 using the mouse device 114 and then inputting data into data entry fields using the keyboard 112. Other ways of editing the electronic form can be used. Step 816 involves routing the editing user 108's input back to the source XML document 102 for storage at appropriate locations in the structured XML data. To perform this routing, the above-described mapping annotations are used to link selected parts of the visual surface with associated parts of the XML source data. Finally, in step 818, the procedure 800 involves updating the visual surface 106 to reflect the user's editing operations with respect to the visual surface 106. An exemplary technique for performing step 818 is described in commonly assigned application Ser. No. 10/404,312, filed on Mar. 31, 2003, entitled “System and Method for Incrementally Transforming and Rendering Hierarchical Data Files”, and incorporated herein by reference in its entirety.
[0150] The foregoing descriptions of FIGS. 1-8 provide implementations for making data entry using an exemplary electronic form that is displayed on a display device. As discussed above, the editing is accomplished by use of an HTML view generated by applying an XSLT stylesheet to convert an XML document into the HTML view. During the editing, data is entered into the electronic form at a data-entry field corresponding to an HTML element in the HTML view, where the HTML element is associated a specifically named attribute. The received data entered into the data-entry field of the electronic form is mapped to an XML node in the XML document, where the location of the XML node is determined by the value of the specifically named attribute.
[0151] Implementations disclosed herein allow for the expression of all of the possible fragments representing XML nodes that can be inserted in or deleted from the XML document (for example, the XML document 620 seen in FIG. 6 ) to be considerably reduced in size. This reduction is accomplished, given one of these nodes, by identifying all the nodes of an XML fragment to insert. This identification requires mapping an XML tree node to a representation of its parent's content model, which in turn makes it possible to determine whether the node belongs to a sequence containing other nodes—and in this case, the whole sequence should be deleted to ensure validity and reflect the semantics of the deletion. Then, only the relevant parts of a fragment are used to make an insertion according to the insertion context, or to make a deletion according to the deletion context. This use of only the relevant parts of a fragment involves inserting a variable geometry fragment by identifying the sub-fragment to insert by searching for the highest insertable position below the parent and determining which siblings of this sub-fragment must be inserted/deleted to satisfy the corresponding schema. The XML document can then be modified at the XML node with the received data and the display of the electronic form can be updated to reflect the received data.
[0152] The XSLT stylesheet, referenced above, includes conversion functionality that, when applied to the XML document, converts the XML document into the HTML document. Mapping functionality is also included in the XSLT stylesheet to map, and to provide information regarding relationships, between nodes of the XML document and associated nodes of the HTML document. Each node of the HTML document has a specifically named attribute and the location of the node of the XML document that is associated with a corresponding node of the HTML document is determined by the value of the specifically named attribute.
[0153] D. Exemplary Computer Environment
[0154] FIG. 9 illustrates one example of a computing environment 900 within which the above-described forms application 510 can be either fully or partially implemented. The computing environment 900 includes the general purpose computer 902 and display device 920 discussed in the context of FIG. 9 . However, the computing environment 900 can include other kinds of computer and network architectures. For example, although not shown, the computer environment 900 can include hand-held or laptop devices, set top boxes, programmable consumer electronics, mainframe computers, gaming consoles, etc. Further, FIG. 9 shows elements of the computer environment 900 grouped together to facilitate discussion. However, the computing environment 900 can employ a distributed processing configuration. In a distributed computing environment, computing resources can be physically dispersed throughout the environment.
[0155] Exemplary computer 902 includes one or more processors or processing units 904, a system memory 906, and a bus 902. The bus 902 connects various system components together. For instance, the bus 902 connects the processor 904 to the system memory 906. The bus 902 can be implemented using any kind of bus structure or combination of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. For example, such architectures can include an Industry Standard Architecture (ISA) bus, a Micro Channel Architecture (MCA) bus, an Enhanced ISA (EISA) bus, a Video Electronics Standards Association (VESA) local bus, and a Peripheral Component Interconnects (PCI) bus also known as a Mezzanine bus.
[0156] Computer 902 can also include a variety of computer readable media, including a variety of types of volatile and non-volatile media, each of which can be removable or non-removable. For example, system memory 906 includes computer readable media in the form of volatile memory, such as random access memory (RAM) 904, and non-volatile memory, such as read only memory (ROM) 906. ROM 906 includes an input/output system (BIOS) 908 that contains the basic routines that help to transfer information between elements within computer 902, such as during start-up. RAM 904 typically contains data and/or program modules in a form that can be quickly accessed by processing unit 904.
[0157] Other kinds of computer storage media include a hard disk drive 910 for reading from and writing to a non-removable, non-volatile magnetic media, a magnetic disk drive 912 for reading from and writing to a removable, non-volatile magnetic disk 914 (e.g., a “floppy disk”), and an optical disk drive 916 for reading from and/or writing to a removable, non-volatile optical disk 918 such as a CD-ROM, DVD-ROM, or other optical media. The hard disk drive 910, magnetic disk drive 912, and optical disk drive 916 are each connected to the system bus 902 by one or more data media interfaces 920. Alternatively, the hard disk drive 910, magnetic disk drive 912, and optical disk drive 916 can be connected to the system bus 902 by a SCSI interface (not shown), or other coupling mechanism. Although not shown, the computer 902 can include other types of computer readable media, such as magnetic cassettes or other magnetic storage devices, flash memory cards, CD-ROM, digital versatile disks (DVD) or other optical storage, electrically erasable programmable read-only memory (EEPROM), etc.
[0158] Generally, the above-identified computer readable media provide non-volatile storage of computer readable instructions, data structures, program modules, and other data for use by computer 902. For instance, the readable media can store the operating system 908, one or more application programs 922 (such as the forms application 510), other program modules 924, and program data 926.
[0159] The computer environment 900 can include a variety of input devices. For instance, the computer environment 900 includes the keyboard 112 and a pointing device 114 (e.g., a “mouse”) for entering commands and information into computer 902. The computer environment 900 can include other input devices (not illustrated), such as a microphone, joystick, game pad, satellite dish, serial port, scanner, card reading devices, digital or video camera, etc. Input/output interfaces 928 couple the input devices to the processing unit 904. More generally, input devices can be coupled to the computer 902 through any kind of interface and bus structures, such as a parallel port, serial port, game port, universal serial bus (USB) port, etc.
[0160] The computer environment 900 also includes the display device 920. A video adapter 930 couples the display device 920 to the bus 902. In addition to the display device 920, the computer environment 900 can include other output peripheral devices, such as speakers (not shown), a printer (not shown), etc.
[0161] Computer 902 can operate in a networked environment using logical connections to one or more remote computers, such as a remote computing device 932. The remote computing device 932 can comprise any kind of computer equipment, including a general purpose personal computer, portable computer, a server, a router, a network computer, a peer device or other common network node, etc. Remote computing device 932 can include all of the features discussed above with respect to computer 902, or some subset thereof.
[0162] Any type of network can be used to couple the computer 902 with remote computing device 932, such as a local area network (LAN) 934, or a wide area network (WAN) 936 (such as the Internet). When implemented in a LAN networking environment, the computer 902 connects to local network 934 via a network interface or adapter 938. When implemented in a WAN networking environment, the computer 902 can connect to the WAN 936 via a modem 940 or other connection strategy. The modem 940 can be located internal or external to computer 902, and can be connected to the bus 902 via serial I/O interfaces 942 other appropriate coupling mechanism. Although not illustrated, the computing environment 900 can provide wireless communication functionality for connecting computer 902 with remote computing device 932 (e.g., via modulated radio signals, modulated infrared signals, etc.).
[0163] In a networked environment, the computer 902 can draw from program modules stored in a remote memory storage device 944. Generally, the depiction of program modules as discrete blocks in FIG. 9 serves only to facilitate discussion; in actuality, the programs modules can be distributed over the computing environment 900, and this distribution can change in a dynamic fashion as the modules are executed by the processing unit 904.
[0164] Wherever physically stored, one or more memory modules 906, 914, 918, 944, etc. can be provided to store the forms application 510 programming code.
[0165] Although the invention has been described in language specific to structural features and/or methodological acts, it is to be understood that the invention defined in the appended claims is not necessarily limited to the specific features or acts described. Rather, the specific features and acts are disclosed as exemplary forms of implementing the claimed invention.
Claims
What is claimed is:
1. For a structured markup language document having a plurality of data entry fields each corresponding to a markup language node, wherein the markup language nodes are arranged in a hierarchical structure of parent nodes having child nodes and wherein the hierarchical position of each said markup language node in the hierarchical structure is expressed as a corresponding fragment of the markup language, a method comprising, for each said parent node:
forming a maximal information fragment in a electronic form definition document to encode each editable fragment of the parent node, the maximal information fragment having a plurality of portions each corresponding to the fragment of a respective said child node of the parent node without repeating any said fragment of a respective said child node; and
using the portions of the maximal information fragment respectively corresponding to the child nodes for data entry with the data entry fields, wherein:
the structured markup language document has a syntax described by a schema;
the electronic form definition document encodes schema information from the schema to achieve schema awareness at edit time; and
using the portions further comprises using the form definition document having the maximal information fragment and the schema information at edit time to determine for each data entry field a corresponding said portion of the maximal information fragment to perform data entry for the data entry field, such that data entry for each said data entry field is valid with respect to the schema.
2. The method according to claim 1, wherein two said portions correspond to the longest and the shortest said fragments of respective said child nodes.
3. The method according to claim 1, wherein the formed maximal information fragment is smaller than a combination of all possible fragments of the child nodes of the parent node.
4. The method according to claim 1, further comprising entering the data from the data entry into a structured markup language file that corresponds to the structured markup language document, wherein each said data entry field has a corresponding field in the structured markup language file.
5. The method according to claim 1, wherein each said child node has a structure selected from the group consisting of:
a sequence from zero to an infinite number of occurrences of the child node;
from one to an infinite number of occurrences of the child node;
an occurrence of the child node that is conditioned upon an occurrence of another said child node;
an occurrence of the child node that is mutually exclusive to an occurrence of another said child node;
an occurrence of the child node which must occur with an occurrence of another said child node;
a sequence from zero to an infinite number of occurrences of a group of child nodes which must occur together in a prescribed order; and
from one to an infinite number of occurrences of a group of child nodes which must occur together in a prescribed order.
6. The method according to claim 1, wherein the structured markup language document is expressed in a markup language selected from the group consisting of Standard Generalized Markup Language (SGML), HyperText Markup Language (HTML), and eXtensible Markup Language (XML).
7. The method according to claim 1, wherein using the portions of the maximal information fragment respectively corresponding to the child nodes for data entry with the data entry fields further comprises displaying an electronic form on a user interface (UI) for interactive data entry with the electronic form.
8. The method according to claim 7, wherein the formed maximal information fragment is formed when the electronic form is created.
9. The method according to claim 7, wherein the electronic form has one or more data entry fields each corresponding to one said data entry field of the structured markup language document.
10. The method according to claim 1, wherein each said data entry field on the electronic form is an editing control selected from the group consisting of one or more of:
a plain text box;
a drop-down list box;
a list box;
a check box;
a rich text box;
an expression box;
an option button;
a button;
a section with controls;
a section;
an optional section;
an optional section with controls;
a repeating section with controls;
a repeating section;
controls in a layout table;
controls;
a repeating table;
a bulleted list;
a numbered list;
a plain list;
a hyperlink;
a date picker;
an inline picture;
a linked picture;
an optional sequence;
a choice; and
a recursion.
11. The method as defined in claim 10, wherein:
the structured markup language document is expressed in XML;
the electronic form is expressed in Extensible Hypertext Markup Language (XHTML); and
each said editing control is an Extensible Stylesheet Language (XSLT) component.
12. The method as defined in claim 7, wherein forming the maximal information fragment further comprises creating the electronic form and associating the maximal information fragment with the electronic form.
13. A computer readable medium having machine readable instructions that, when executed by a computer, performs the method of claim 1.
14. A computer readable medium comprising machine readable instructions that, when executed by a computer, perform a method that uses a structured markup language document having a syntax described by a schema, the structured markup language document also having a plurality of data entry fields each corresponding to an markup language node, wherein the markup language nodes are arranged in a hierarchical structure of parent nodes having child nodes, and wherein the hierarchical position of each said markup language node in the hierarchical structure is expressed as a corresponding fragment of the markup language, the method comprising:
displaying an electronic form on a UI for interactive data entry, wherein:
the electronic form has a plurality of data entry fields respectively corresponding to data entry fields of the structured markup language document; and
the electronic form is associated with a electronic form definition document defining for each said parent node a maximal information fragment to encode each editable fragment of the parent node, the maximal information fragment for each said parent node having a plurality of portions each corresponding to the fragment of a respective said child node of the parent node, wherein:
the electronic form definition document encodes schema information from the schema to achieve schema awareness at edit time;
two said portions correspond to the longest and the shortest said fragments of respective said child nodes; and
the maximal information fragment is smaller than a combination of all possible fragments of the child nodes of the parent node;
for each said parent node, using the form definition document having the maximal information fragment and the schema information at edit time to determine for each data entry field a corresponding said portion of the maximal information fragment to perform data entry for the data entry field, such that data entry for each said data entry field is valid with respect to the schema.
15. The computer readable medium as defined in claim 14, wherein the method further comprises:
creating the electronic form;
forming the maximal information fragments in the electronic form definition document; and
associating the electronic form definition document with the electronic form.
16. The computer readable medium as defined in claim 14, wherein:
the method further comprises entering the data from the data entry into a structured markup language file that corresponds to the structured markup language document; and
each said data entry field has a corresponding field in the structured markup language file.
17. The computer readable medium as defined in claim 14, wherein each said child node has a structure selected from the group consisting of:
a sequence from zero to an infinite number of occurrences of the child node;
from one to an infinite number of occurrences of the child node;
an occurrence of the child node that is conditioned upon an occurrence of another said child node;
an occurrence of the child node that is mutually exclusive to an occurrence of another said child node;
an occurrence of the child node with must occur with an occurrence of another said child node;
a sequence from zero to an infinite number of occurrences of a group of child nodes which must occur together in a prescribed order; and
from one to an infinite number of occurrences of a group of child nodes which must occur together in a prescribed order.
18. The computer readable medium as defined in claim 14, wherein the structured markup language document is expressed in a markup language selected from the group consisting of Standard Generalized Markup Language (SGML), HyperText Markup Language (HTML), and eXtensible Markup Language (XML).
19. The computer readable medium as defined in claim 14, wherein each said data entry field on the electronic form is an editing control selected from the group consisting of one or more of:
a plain text box;
a drop-down list box;
a list box;
a check box;
a rich text box;
an expression box;
an option button;
a button;
a section with controls;
a section;
an optional section;
an optional section with controls;
a repeating section with controls;
a repeating section;
controls in a layout table;
controls;
a repeating table;
a bulleted list;
a numbered list;
a plain list;
a hyperlink;
a date picker;
an inline picture;
a linked picture;
an optional sequence;
a choice; and
a recursion.
20. The computer readable medium as defined in claim 19, wherein:
the structured markup language document is expressed in XML;
the electronic form is expressed in XHTML; and
each said editing control is an XSLT component.
21. A computer readable medium comprising instructions that, when executed by a computer, perform a method having a step of identifying a hierarchy of markup language nodes that need to be inserted or deleted, and where they need to be inserted, when data is added to or deleted from a structured markup language document, wherein:
the hierarchy of markup language nodes is an expression of all possible fragments of a hierarchical markup language that are to be inserted when rendering the structured markup language document by processing documents containing structured data that is expressed using the hierarchical markup language; and
the expression of all possible fragments is encoded in a manifest file as a single maximal information fragment that:
includes respective sub-fragments having the maximum and minimum number of characters each corresponding to one or more said markup language nodes; and
has less characters than a fragment containing all possible fragments;
the structured markup language document has a syntax described by a schema;
the manifest file encodes schema information from the schema to achieve schema awareness at edit time; and
the identifying a hierarchy of markup language nodes further comprises using the manifest file having the single maximal information fragment and the schema information at edit time to determine a corresponding portion of the single maximal information fragment to be inserted or deleted, such that the data added to or deleted from the structured markup language document is valid with respect to the schema.
22. The computer readable medium as defined in claim 21, wherein:
the structured markup language document has a plurality of data entry fields each corresponding to one said markup language node; and
each data entry field is used when data is added to or deleted from the structured markup language document using a corresponding said portion of the single maximal information fragment to perform the data entry with the data entry field.
23. The computer readable medium as defined in claim 22, wherein the single maximal information fragment does not repeat any of said sub-fragments corresponding to the one or more said markup language nodes.
24. The computer readable medium as defined in claim 22, wherein the method further comprises a step of entering the data from the data entry into a structured markup language file that corresponds to the structured markup language document, wherein each said data entry field has a corresponding field in the structured markup language file.
25. The computer readable medium as defined in claim 21, wherein the structured markup language document is expressed in a markup language selected from the group consisting of Standard Generalized Markup Language (SGML), HyperText Markup Language (HTML), and eXtensible Markup Language (XML).
26. The computer readable medium as defined in claim 21, wherein using the manifest file having the single maximal information fragment and the schema information further comprises displaying an electronic form on a UI for interactive data entry with the electronic form.
27. The computer readable medium as defined in claim 26, wherein the single maximal information fragment that is the expression of all possible fragments is formed when the electronic form is created.
28. The computer readable medium as defined in claim 26, wherein the electronic form has one or more data entry fields each corresponding to one said markup language node of the structured markup language document.
29. The computer readable medium as defined in claim 28, wherein each said data entry field on the electronic form is an editing control selected from the group consisting of one or more of:
a plain text box;
a drop-down list box;
a list box;
a check box;
a rich text box;
an expression box;
an option button;
a button;
a section with controls;
a section;
an optional section;
an optional section with controls;
a repeating section with controls;
a repeating section;
controls in a layout table;
controls;
a repeating table;
a bulleted list;
a numbered list;
a plain list;
a hyperlink;
a date picker;
an inline picture;
a linked picture;
an optional sequence;
a choice; and
a recursion.
30. The computer readable medium as defined in claim 29, wherein:
the structured markup language document is expressed in XML;
the electronic form is expressed in XHTML; and
each said editing control is an XSLT component.
31. An apparatus comprising:
means for receiving an instruction to open a structured markup language document having a plurality of data entry fields each corresponding to a markup language node, wherein:
the markup language nodes are arranged in a hierarchical structure of parent nodes having child nodes;
the hierarchical position of each said markup language node in the hierarchical structure is expressed as a corresponding fragment of the markup language; and
a maximal information fragment is associated via a data set with each said parent node and has a plurality of portions each corresponding to the fragment of a respective said child node without repeating any said fragment of a respective said child node;
means for opening the structured markup language document with the data set that includes, a presentation application and a markup-language schema, wherein portions of the structured markup language document are logically coupled with fragments of the markup-language schema, and wherein the data set further comprises a manifest of all files, the manifest encoding said maximal information fragments associated with each said parent node and schema information from the markup-language schema to achieve schema awareness at edit time;
means for executing the presentation application to render an electronic form containing data-entry fields respectively associated with:
the coupled portions; and
the data entry fields of the structured markup language document;
means for receiving data entry into the data-entry fields of the electronic form;
means for using, for each said parent node, the portions respectively corresponding to the child nodes for entering data into the structured markup language document as received from the data entry into the data-entry fields of the electronic form;
means for using one or more files in the manifest to represent at least a part of the structured markup language document in the electronic form; and
means for using at edit time one or more files in the manifest to allow a user to input data into the data-entry fields of the electronic form, including using said maximal information fragments and the schema information in the manifest to:
determine for each of the data-entry fields a corresponding said portion of said maximal information fragment associated with a respective said parent node to perform data entry for the data entry field; and
validate the data that the user inputs into the one or more data-entry fields of the electronic form with respect to the markup-language schema.
32. The apparatus as defined in claim 31, wherein the markup-language schema does not conform to a recognized standard.
33. The apparatus as defined in claim 31, wherein the markup-language schema defines an arbitrary syntax.
34. The apparatus as defined in claim 31, wherein:
the structured markup language document is written in XML;
the presentation application is written in XSLT;
the electronic form is written in XHTML; and
each said data entry field on the electronic form is an editing control that is an XSLT component.
35. The apparatus as defined in claim 34, wherein each said editing control selected from the group consisting of one or more of:
a plain text box;
a drop-down list box;
a list box;
a check box;
a rich text box;
an expression box;
an option button;
a button;
a section with controls;
a section;
an optional section;
an optional section with controls;
a repeating section with controls;
a repeating section;
controls in a layout table;
controls;
a repeating table;
a bulleted list;
a numbered list;
a plain list;
a hyperlink;
a date picker;
an inline picture;
a linked picture;
an optional sequence;
a choice; and
a recursion.
36. The apparatus as defined in claim 31, wherein each said child node has a structure selected from the group consisting of:
a sequence from zero to an infinite number of occurrences of the child node;
from one to an infinite number of occurrences of the child node;
an occurrence of the child node that is conditioned upon an occurrence of another said child node;
an occurrence of the child node that is mutually exclusive to an occurrence of another said child node;
an occurrence of the child node with must occur with an occurrence of another said child node;
a sequence from zero to an infinite number of occurrences of a group of child nodes which must occur together in a prescribed order; and
from one to an infinite number of occurrences of a group of child nodes which must occur together in a prescribed order.
Patent Citations (612)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4201978(A) | 1980-05-01 | Nally | Applicant |
| US4498147(A) | 1985-02-01 | Agnew et al. | Applicant |
| US4514800(A) | 1985-04-01 | Gruner et al. | Applicant |
| US4564752(A) | 1986-01-01 | Lepic et al. | Applicant |
| US4641274(A) | 1987-02-01 | Swank | Applicant |
| US4674040(A) | 1987-06-01 | Barker et al. | Applicant |
| US4723211(A) | 1988-02-01 | Barker et al. | Applicant |
| US4739477(A) | 1988-04-01 | Barker et al. | Applicant |
| US4815029(A) | 1989-03-01 | Barker et al. | Applicant |
| US4847749(A) | 1989-07-01 | Collins et al. | Applicant |
| US4910663(A) | 1990-03-01 | Bailey | Applicant |
| US4933880(A) | 1990-06-01 | Borgendale et al. | Applicant |
| US4962475(A) | 1990-10-01 | Hernandez et al. | Applicant |
| US5025484(A) | 1991-06-01 | Yamanari et al. | Applicant |
| US5072412(A) | 1991-12-01 | Henderson, Jr. et al. | Applicant |
| US5179703(A) | 1993-01-01 | Evans | Applicant |
| US5182709(A) | 1993-01-01 | Makus | Applicant |
| US5187786(A) | 1993-02-01 | Densmore et al. | Applicant |
| US5191645(A) | 1993-03-01 | Carlucci et al. | Applicant |
| US5195183(A) | 1993-03-01 | Miller et al. | Applicant |
| US5204947(A) | 1993-04-01 | Bernstein et al. | Applicant |
| US5206951(A) | 1993-04-01 | Khoyi et al. | Applicant |
| US5218672(A) | 1993-06-01 | Morgan et al. | Applicant |
| US5222160(A) | 1993-06-01 | Sakai et al. | Applicant |
| US5228100(A) | 1993-07-01 | Takeda et al. | Applicant |
| US5237680(A) | 1993-08-01 | Adams et al. | Applicant |
| US5249275(A) | 1993-09-01 | Srivastava | Applicant |
| US5274803(A) | 1993-12-01 | Dubin et al. | Applicant |
| US5297249(A) | 1994-03-01 | Bernstein et al. | Applicant |
| US5297283(A) | 1994-03-01 | Kelly, Jr. et al. | Applicant |
| US5313631(A) | 1994-05-01 | Kao | Applicant |
| US5313646(A) | 1994-05-01 | Hendricks et al. | Applicant |
| US5317686(A) | 1994-05-01 | Salas et al. | Applicant |
| US5333317(A) | 1994-07-01 | Dann | Applicant |
| US5339423(A) | 1994-08-01 | Beitel et al. | Applicant |
| US5339424(A) | 1994-08-01 | Fushimi | Applicant |
| US5341478(A) | 1994-08-01 | Travis, Jr. et al. | Applicant |
| US5369766(A) | 1994-11-01 | Nakano et al. | Applicant |
| US5369778(A) | 1994-11-01 | San Soucie et al. | Applicant |
| US5371675(A) | 1994-12-01 | Greif et al. | Applicant |
| US5377323(A) | 1994-12-01 | Vasudevan | Applicant |
| US5379419(A) | 1995-01-01 | Heffernan et al. | Applicant |
| US5381547(A) | 1995-01-01 | Flug et al. | Applicant |
| US5390325(A) | 1995-02-01 | Miller | Applicant |
| US5396623(A) | 1995-03-01 | McCall et al. | Applicant |
| US5408665(A) | 1995-04-01 | Fitzgerald | Applicant |
| US5410646(A) | 1995-04-01 | Tondevold et al. | Applicant |
| US5410688(A) | 1995-04-01 | Williams et al. | Applicant |
| US5412772(A) | 1995-05-01 | Monson | Applicant |
| US5434975(A) | 1995-07-01 | Allen | Applicant |
| US5436637(A) | 1995-07-01 | Gayraud et al. | Applicant |
| US5438659(A) | 1995-08-01 | Notess et al. | Applicant |
| US5440744(A) | 1995-08-01 | Jacobson et al. | Applicant |
| US5446842(A) | 1995-08-01 | Schaeffer et al. | Applicant |
| US5455875(A) | 1995-10-01 | Chevion et al. | Applicant |
| US5459865(A) | 1995-10-01 | Heninger et al. | Applicant |
| US5481722(A) | 1996-01-01 | Skinner | Applicant |
| US5497489(A) | 1996-03-01 | Menne | Applicant |
| US5504898(A) | 1996-04-01 | Klein | Applicant |
| US5517655(A) | 1996-05-01 | Collins et al. | Applicant |
| US5535389(A) | 1996-07-01 | Elder et al. | Applicant |
| US5542070(A) | 1996-07-01 | LeBlanc et al. | Applicant |
| US5550976(A) | 1996-08-01 | Henderson et al. | Applicant |
| US5551035(A) | 1996-08-01 | Arnold et al. | Applicant |
| US5555325(A) | 1996-09-01 | Burger | Applicant |
| US5572643(A) | 1996-11-01 | Judson | Applicant |
| US5572648(A) | 1996-11-01 | Bibayan | Applicant |
| US5577252(A) | 1996-11-01 | Nelson et al. | Applicant |
| US5581686(A) | 1996-12-01 | Koppolu et al. | Applicant |
| US5581760(A) | 1996-12-01 | Atkinson et al. | Applicant |
| US5602996(A) | 1997-02-01 | Powers, III et al. | Applicant |
| US5608720(A) | 1997-03-01 | Biegel et al. | Applicant |
| US5625783(A) | 1997-04-01 | Ezekiel et al. | Applicant |
| US5627979(A) | 1997-05-01 | Chang et al. | Applicant |
| US5630126(A) | 1997-05-01 | Redpath | Applicant |
| US5634121(A) | 1997-05-01 | Tracz et al. | Applicant |
| US5640544(A) | 1997-06-01 | Onodera et al. | Applicant |
| US5644738(A) | 1997-07-01 | Goldman et al. | Applicant |
| US5649099(A) | 1997-07-01 | Theimer et al. | Applicant |
| US5659729(A) | 1997-08-01 | Nielsen | Applicant |
| US5664178(A) | 1997-09-01 | Sinofsky | Applicant |
| US5668966(A) | 1997-09-01 | Ono et al. | Applicant |
| US5669005(A) | 1997-09-01 | Curbow et al. | Applicant |
| US5682536(A) | 1997-10-01 | Atkinson et al. | Applicant |
| US5689667(A) | 1997-11-01 | Kurtenbach | Applicant |
| US5689703(A) | 1997-11-01 | Atkinson et al. | Applicant |
| US5704029(A) | 1997-12-01 | Wright, Jr. | Applicant |
| US5706501(A) | 1998-01-01 | Horikiri et al. | Applicant |
| US5717939(A) | 1998-02-01 | Bricklin et al. | Applicant |
| US5721824(A) | 1998-02-01 | Taylor | Applicant |
| US5740439(A) | 1998-04-01 | Atkinson et al. | Applicant |
| US5742504(A) | 1998-04-01 | Meyer et al. | Applicant |
| US5745683(A) | 1998-04-01 | Lee et al. | Applicant |
| US5745712(A) | 1998-04-01 | Turpin et al. | Applicant |
| US5748807(A) | 1998-05-01 | Lopresti et al. | Applicant |
| US5758184(A) | 1998-05-01 | Lucovsky et al. | Applicant |
| US5758358(A) | 1998-05-01 | Ebbo | Applicant |
| US5761408(A) | 1998-06-01 | Kolawa et al. | Applicant |
| US5761683(A) | 1998-06-01 | Logan et al. | Applicant |
| US5764984(A) | 1998-06-01 | Loucks | Applicant |
| US5764985(A) | 1998-06-01 | Smale | Applicant |
| US5778372(A) | 1998-07-01 | Cordell et al. | Applicant |
| US5778402(A) | 1998-07-01 | Gipson | Applicant |
| US5784555(A) | 1998-07-01 | Stone | Applicant |
| US5790796(A) | 1998-08-01 | Sadowsky | Applicant |
| US5798757(A) | 1998-08-01 | Smith | Applicant |
| US5801701(A) | 1998-09-01 | Koppolu et al. | Applicant |
| US5802304(A) | 1998-09-01 | Stone | Applicant |
| US5806079(A) | 1998-09-01 | Rivette et al. | Applicant |
| US5815830(A) | 1998-09-01 | Anthony | Applicant |
| US5826265(A) | 1998-10-01 | Van Huben et al. | Applicant |
| US5835777(A) | 1998-11-01 | Staelin | Applicant |
| US5838906(A) | 1998-11-01 | Doyle et al. | Applicant |
| US5842018(A) | 1998-11-01 | Atkinson et al. | Applicant |
| US5845077(A) | 1998-12-01 | Fawcett | Applicant |
| US5845090(A) | 1998-12-01 | Collins, III et al. | Applicant |
| US5854630(A) | 1998-12-01 | Nielsen | Applicant |
| US5859973(A) | 1999-01-01 | Carpenter et al. | Applicant |
| US5862372(A) | 1999-01-01 | Morris et al. | Applicant |
| US5864819(A) | 1999-01-01 | De Armas et al. | Applicant |
| US5907704(A) | 1999-05-01 | Gudmundson et al. | Applicant |
| US5910895(A) | 1999-06-01 | Proskauer et al. | Applicant |
| US5911776(A) | 1999-06-01 | Guck | Applicant |
| US5915112(A) | 1999-06-01 | Boutcher | Applicant |
| US5922072(A) | 1999-07-01 | Hutchinson et al. | Applicant |
| US5929858(A) | 1999-07-01 | Shibata et al. | Applicant |
| US5940075(A) | 1999-08-01 | Mutschler, III et al. | Applicant |
| US5950010(A) | 1999-09-01 | Hesse et al. | Applicant |
| US5956481(A) | 1999-09-01 | Walsh et al. | Applicant |
| US5960199(A) | 1999-09-01 | Brodsky et al. | Applicant |
| US5963964(A) | 1999-10-01 | Nielsen | Applicant |
| US5974454(A) | 1999-10-01 | Apfel et al. | Applicant |
| US5982370(A) | 1999-11-01 | Kamper | Applicant |
| US5987480(A) | 1999-11-01 | Donohue et al. | Applicant |
| US5991710(A) | 1999-11-01 | Papineni | Applicant |
| US5991731(A) | 1999-11-01 | Colon et al. | Applicant |
| US5991877(A) | 1999-11-01 | Luckenbaugh | Applicant |
| US5995103(A) | 1999-11-01 | Ashe | Applicant |
| US5999740(A) | 1999-12-01 | Rowley | Applicant |
| US6005570(A) | 1999-12-01 | Gayraud et al. | Applicant |
| US6014135(A) | 2000-01-01 | Fernandes | Applicant |
| US6016520(A) | 2000-01-01 | Facq et al. | Applicant |
| US6018743(A) | 2000-01-01 | Xu | Applicant |
| US6026379(A) | 2000-02-01 | Haller et al. | Applicant |
| US6026416(A) | 2000-02-01 | Kanerva et al. | Applicant |
| US6031989(A) | 2000-02-01 | Cordell | Applicant |
| US6035297(A) | 2000-03-01 | Van Huben et al. | Applicant |
| US6035309(A) | 2000-03-01 | Dauerer et al. | Applicant |
| US6044205(A) | 2000-03-01 | Reed et al. | Applicant |
| US6052531(A) | 2000-04-01 | Waldin et al. | Applicant |
| US6052710(A) | 2000-04-01 | Saliba et al. | Applicant |
| US6054987(A) | 2000-04-01 | Richardson | Applicant |
| US6072870(A) | 2000-06-01 | Nguyen et al. | Applicant |
| US6078326(A) | 2000-06-01 | Kilmer et al. | Applicant |
| US6078327(A) | 2000-06-01 | Liman et al. | Applicant |
| US6078924(A) | 2000-06-01 | Ainsbury et al. | Applicant |
| US6081610(A) | 2000-06-01 | Dwork et al. | Applicant |
| US6084585(A) | 2000-07-01 | Kraft et al. | Applicant |
| US6088708(A) | 2000-07-01 | Burch et al. | Applicant |
| US6091417(A) | 2000-07-01 | Lefkowitz | Applicant |
| US6094657(A) | 2000-07-01 | Hailpern et al. | Applicant |
| US6097382(A) | 2000-08-01 | Rosen et al. | Applicant |
| US6098081(A) | 2000-08-01 | Heidorn et al. | Applicant |
| US6108637(A) | 2000-08-01 | Blumenau | Applicant |
| US6108783(A) | 2000-08-01 | Krawczyk et al. | Applicant |
| US6115646(A) | 2000-09-01 | Fiszman et al. | Applicant |
| US6121965(A) | 2000-09-01 | Kenney et al. | Applicant |
| US6122647(A) | 2000-09-01 | Horowitz | Applicant |
| US6144969(A) | 2000-11-01 | Inokuchi et al. | Applicant |
| US6151624(A) | 2000-11-01 | Teare et al. | Applicant |
| US6154128(A) | 2000-11-01 | Wookey et al. | Applicant |
| US6163772(A) | 2000-12-01 | Kramer et al. | Applicant |
| US6167521(A) | 2000-12-01 | Smith et al. | Applicant |
| US6167523(A) | 2000-12-01 | Strong | Applicant |
| US6182095(B1) | 2001-01-01 | Leymaster et al. | Applicant |
| US6188401(B1) | 2001-02-01 | Peyer | Applicant |
| US6191797(B1) | 2001-02-01 | Politis | Applicant |
| US6192367(B1) | 2001-02-01 | Hawley et al. | Applicant |
| US6195661(B1) | 2001-02-01 | Filepp et al. | Applicant |
| US6199204(B1) | 2001-03-01 | Donohue | Applicant |
| US6209128(B1) | 2001-03-01 | Gerard et al. | Applicant |
| US6216152(B1) | 2001-04-01 | Wong et al. | Applicant |
| US6219698(B1) | 2001-04-01 | Iannucci et al. | Applicant |
| US6225996(B1) | 2001-05-01 | Gibb et al. | Applicant |
| US6235027(B1) | 2001-05-01 | Herzon | Applicant |
| US6253366(B1) | 2001-06-01 | Mutschler, III | Applicant |
| US6253374(B1) | 2001-06-01 | Dresevic et al. | Applicant |
| US6263313(B1) | 2001-07-01 | Milsted et al. | Applicant |
| US6266810(B1) | 2001-07-01 | Tanaka et al. | Applicant |
| US6268852(B1) | 2001-07-01 | Lindhorst et al. | Applicant |
| US6272506(B1) | 2001-08-01 | Bell | Applicant |
| US6275227(B1) | 2001-08-01 | DeStefano | Applicant |
| US6275599(B1) | 2001-08-01 | Adler et al. | Applicant |
| US6281896(B1) | 2001-08-01 | Alimpich et al. | Applicant |
| US6282711(B1) | 2001-08-01 | Halpern et al. | Applicant |
| US6286033(B1) | 2001-09-01 | Kishinsky et al. | Applicant |
| US6292897(B1) | 2001-09-01 | Gennaro et al. | Applicant |
| US6297819(B1) | 2001-10-01 | Furst | Applicant |
| US6300948(B1) | 2001-10-01 | Geller et al. | Applicant |
| US6307955(B1) | 2001-10-01 | Zank et al. | Applicant |
| US6308179(B1) | 2001-10-01 | Petersen et al. | Applicant |
| US6308273(B1) | 2001-10-01 | Goertzel et al. | Applicant |
| US6311271(B1) | 2001-10-01 | Gennaro et al. | Applicant |
| US6321259(B1) | 2001-11-01 | Ouellette et al. | Applicant |
| US6321334(B1) | 2001-11-01 | Jerger et al. | Applicant |
| US6327628(B1) | 2001-12-01 | Anuff et al. | Applicant |
| US6331864(B1) | 2001-12-01 | Coco et al. | Applicant |
| US6342907(B1) | 2002-01-01 | Petty et al. | Applicant |
| US6343149(B1) | 2002-01-01 | Motoiwa | Applicant |
| US6343302(B1) | 2002-01-01 | Graham | Applicant |
| US6345256(B1) | 2002-02-01 | Milsted et al. | Applicant |
| US6345278(B1) | 2002-02-01 | Hitchcock et al. | Applicant |
| US6345361(B1) | 2002-02-01 | Jerger et al. | Applicant |
| US6347323(B1) | 2002-02-01 | Garber et al. | Applicant |
| US6349408(B1) | 2002-02-01 | Smith | Applicant |
| US6351574(B1) | 2002-02-01 | Yair et al. | Applicant |
| US6353926(B1) | 2002-03-01 | Parthesarathy et al. | Applicant |
| US6356906(B1) | 2002-03-01 | Lippert et al. | Applicant |
| US6357038(B1) | 2002-03-01 | Scouten | Applicant |
| US6366907(B1) | 2002-04-01 | Fanning et al. | Applicant |
| US6366912(B1) | 2002-04-01 | Wallent et al. | Applicant |
| US6367013(B1) | 2002-04-01 | Bisbee et al. | Applicant |
| US6369840(B1) | 2002-04-01 | Barnett et al. | Applicant |
| US6369841(B1) | 2002-04-01 | Salomon et al. | Applicant |
| US6374402(B1) | 2002-04-01 | Schmeidler et al. | Applicant |
| US6381742(B2) | 2002-04-01 | Forbes et al. | Applicant |
| US6381743(B1) | 2002-04-01 | Mutschler, III | Applicant |
| US6389434(B1) | 2002-05-01 | Rivette | Applicant |
| US6393456(B1) | 2002-05-01 | Ambler et al. | Applicant |
| US6396488(B1) | 2002-05-01 | Simmons et al. | Applicant |
| US6405221(B1) | 2002-06-01 | Levine et al. | Applicant |
| US6408311(B1) | 2002-06-01 | Baisley et al. | Applicant |
| US6414700(B1) | 2002-07-01 | Kurtenbach et al. | Applicant |
| US6421070(B1) | 2002-07-01 | Ramos et al. | Applicant |
| US6421656(B1) | 2002-07-01 | Cheng et al. | Applicant |
| US6425125(B1) | 2002-07-01 | Fries et al. | Applicant |
| US6429885(B1) | 2002-08-01 | Saib et al. | Applicant |
| US6434563(B1) | 2002-08-01 | Pasquali et al. | Applicant |
| US6434564(B2) | 2002-08-01 | Ebert | Applicant |
| US6442563(B1) | 2002-08-01 | Bacon et al. | Applicant |
| US6442755(B1) | 2002-08-01 | Lemmons et al. | Applicant |
| US6446110(B1) | 2002-09-01 | Lection et al. | Applicant |
| US6449617(B1) | 2002-09-01 | Quinn et al. | Applicant |
| US6457009(B1) | 2002-09-01 | Bollay | Applicant |
| US6460058(B2) | 2002-10-01 | Koppulu | Applicant |
| US6463419(B1) | 2002-10-01 | Kluss | Applicant |
| US6470349(B1) | 2002-10-01 | Heninger | Applicant |
| US6473800(B1) | 2002-10-01 | Jerger et al. | Applicant |
| US6476828(B1) | 2002-11-01 | Burkett et al. | Applicant |
| US6476833(B1) | 2002-11-01 | Moshfeghi | Applicant |
| US6477544(B1) | 2002-11-01 | Bolosky | Applicant |
| US6480860(B1) | 2002-11-01 | Monday | Applicant |
| US6487566(B1) | 2002-11-01 | Sundaresan | Applicant |
| US6490601(B1) | 2002-12-01 | Markus et al. | Applicant |
| US6493702(B1) | 2002-12-01 | Adar et al. | Applicant |
| US6501864(B1) | 2002-12-01 | Eguchi et al. | Applicant |
| US6502101(B1) | 2002-12-01 | Verprauskus et al. | Applicant |
| US6502103(B1) | 2002-12-01 | Frey et al. | Applicant |
| US6505230(B1) | 2003-01-01 | Mohan et al. | Applicant |
| US6505300(B2) | 2003-01-01 | Chan et al. | Applicant |
| US6507856(B1) | 2003-01-01 | Chen et al. | Applicant |
| US6516322(B1) | 2003-02-01 | Meredith | Applicant |
| US6519617(B1) | 2003-02-01 | Wanderski et al. | Applicant |
| USRE38070(E) | 2003-04-01 | Spies et al. | Applicant |
| US6546546(B1) | 2003-04-01 | Van Doorn | Applicant |
| US6549221(B1) | 2003-04-01 | Brown et al. | Applicant |
| US6549878(B1) | 2003-04-01 | Lowry et al. | Applicant |
| US6549922(B1) | 2003-04-01 | Srivastava et al. | Applicant |
| US6553402(B1) | 2003-04-01 | Makarios et al. | Applicant |
| US6560616(B1) | 2003-05-01 | Garber | Applicant |
| US6560620(B1) | 2003-05-01 | Ching | Applicant |
| US6560640(B2) | 2003-05-01 | Smethers | Applicant |
| US6563514(B1) | 2003-05-01 | Samar | Applicant |
| US6571253(B1) | 2003-05-01 | Thompson et al. | Applicant |
| US6578144(B1) | 2003-06-01 | Gennaro et al. | Applicant |
| US6581061(B2) | 2003-06-01 | Graham | Applicant |
| US6584469(B1) | 2003-06-01 | Chiang et al. | Applicant |
| US6584548(B1) | 2003-06-01 | Bourne et al. | Applicant |
| US6585778(B1) | 2003-07-01 | Hind et al. | Applicant |
| US6589290(B1) | 2003-07-01 | Maxwell et al. | Applicant |
| US6598219(B1) | 2003-07-01 | Lau | Applicant |
| US6603489(B1) | 2003-08-01 | Edlund et al. | Applicant |
| US6604099(B1) | 2003-08-01 | Chung et al. | Applicant |
| US6606606(B2) | 2003-08-01 | Starr | Applicant |
| US6609200(B2) | 2003-08-01 | Anderson et al. | Applicant |
| US6611822(B1) | 2003-08-01 | Beams et al. | Applicant |
| US6611840(B1) | 2003-08-01 | Baer et al. | Applicant |
| US6611843(B1) | 2003-08-01 | Jacobs | Applicant |
| US6613098(B1) | 2003-09-01 | Sorge et al. | Applicant |
| US6615276(B1) | 2003-09-01 | Mastrianni et al. | Applicant |
| US6629109(B1) | 2003-09-01 | Koshisaka | Applicant |
| US6631357(B1) | 2003-10-01 | Perkowski | Applicant |
| US6631379(B2) | 2003-10-01 | Cox | Applicant |
| US6631497(B1) | 2003-10-01 | Jamshidi et al. | Applicant |
| US6631519(B1) | 2003-10-01 | Nicholson et al. | Applicant |
| US6632251(B1) | 2003-10-01 | Rutten et al. | Applicant |
| US6635089(B1) | 2003-10-01 | Burkett et al. | Applicant |
| US6636845(B2) | 2003-10-01 | Chau et al. | Applicant |
| US6643633(B2) | 2003-11-01 | Chau et al. | Applicant |
| US6643652(B2) | 2003-11-01 | Helgeson et al. | Applicant |
| US6643684(B1) | 2003-11-01 | Malkin et al. | Applicant |
| US6651217(B1) | 2003-11-01 | Kennedy et al. | Applicant |
| US6654737(B1) | 2003-11-01 | Nunez | Applicant |
| US6654932(B1) | 2003-11-01 | Bahrs et al. | Applicant |
| US6658417(B1) | 2003-12-01 | Stakutis et al. | Applicant |
| US6658622(B1) | 2003-12-01 | Aiken et al. | Applicant |
| US6668369(B1) | 2003-12-01 | Krebs et al. | Applicant |
| US6671805(B1) | 2003-12-01 | Brown et al. | Applicant |
| US6675202(B1) | 2004-01-01 | Perttunen | Applicant |
| US6678717(B1) | 2004-01-01 | Schneider | Applicant |
| US6691230(B1) | 2004-02-01 | Bardon | Applicant |
| US6691281(B1) | 2004-02-01 | Sorge et al. | Applicant |
| US6697944(B1) | 2004-02-01 | Jones et al. | Applicant |
| US6701434(B1) | 2004-03-01 | Rohatgi | Applicant |
| US6701486(B1) | 2004-03-01 | Weber et al. | Applicant |
| US6704906(B1) | 2004-03-01 | Yankovich et al. | Applicant |
| US6711679(B1) | 2004-03-01 | Guski et al. | Applicant |
| US6720985(B1) | 2004-04-01 | Silverbrook et al. | Applicant |
| US6725426(B1) | 2004-04-01 | Pavlov | Applicant |
| US6728755(B1) | 2004-04-01 | de Ment | Applicant |
| US6735721(B1) | 2004-05-01 | Morrow et al. | Applicant |
| US6748385(B1) | 2004-06-01 | Rodkin | Applicant |
| US6751777(B2) | 2004-06-01 | Bates | Applicant |
| US6754874(B1) | 2004-06-01 | Richman | Applicant |
| US6757868(B1) | 2004-06-01 | Glaser et al. | Applicant |
| US6760723(B2) | 2004-07-01 | Oshinsky et al. | Applicant |
| US6763343(B1) | 2004-07-01 | Brooke et al. | Applicant |
| US6772139(B1) | 2004-08-01 | Smith, III | Applicant |
| US6772165(B2) | 2004-08-01 | O'Carroll | Applicant |
| US6774926(B1) | 2004-08-01 | Ellis et al. | Applicant |
| US6779154(B1) | 2004-08-01 | Nussbaum et al. | Applicant |
| US6781609(B1) | 2004-08-01 | Barker et al. | Applicant |
| US6782144(B2) | 2004-08-01 | Bellavita et al. | Applicant |
| US6799299(B1) | 2004-09-01 | Li et al. | Applicant |
| US6801929(B1) | 2004-10-01 | Donoho et al. | Applicant |
| US6816849(B1) | 2004-11-01 | Halt, Jr. | Applicant |
| US6845380(B2) | 2005-01-01 | Su et al. | Applicant |
| US6845499(B2) | 2005-01-01 | Srivastava et al. | Applicant |
| US6847387(B2) | 2005-01-01 | Roth | Applicant |
| US6848078(B1) | 2005-01-01 | Birsan et al. | Applicant |
| US6871220(B1) | 2005-03-01 | Rajan et al. | Applicant |
| US6874130(B1) | 2005-03-01 | Baweja et al. | Applicant |
| US6876996(B2) | 2005-04-01 | Czajkowski et al. | Applicant |
| US6889359(B1) | 2005-05-01 | Conner et al. | Applicant |
| US6901403(B1) | 2005-05-01 | Bata et al. | Applicant |
| US6915454(B1) | 2005-07-01 | Moore et al. | Applicant |
| US6931532(B1) | 2005-08-01 | Davis et al. | Applicant |
| US6941510(B1) | 2005-09-01 | Ozzie et al. | Applicant |
| US6941511(B1) | 2005-09-01 | Hind et al. | Applicant |
| US6941521(B2) | 2005-09-01 | Lin et al. | Applicant |
| US6948133(B2) | 2005-09-01 | Haley | Applicant |
| US6948135(B1) | 2005-09-01 | Ruthfield et al. | Applicant |
| US6950980(B1) | 2005-09-01 | Malcolm | Applicant |
| US6961897(B1) | 2005-11-01 | Peel, Jr. et al. | Applicant |
| US6963875(B2) | 2005-11-01 | Moore et al. | Applicant |
| US6968503(B1) | 2005-11-01 | Chang et al. | Applicant |
| US6968505(B2) | 2005-11-01 | Stoll et al. | Applicant |
| US6993714(B2) | 2006-01-01 | Kaler et al. | Applicant |
| US6996776(B1) | 2006-02-01 | Makely et al. | Applicant |
| US6996781(B1) | 2006-02-01 | Myers et al. | Applicant |
| US7003722(B2) | 2006-02-01 | Rothchiller et al. | Applicant |
| US7010580(B1) | 2006-03-01 | Fu et al. | Applicant |
| US7024417(B1) | 2006-04-01 | Russakovsky et al. | Applicant |
| US7032170(B2) | 2006-04-01 | Poulose | Applicant |
| US7036072(B1) | 2006-04-01 | Sulistio et al. | Applicant |
| US7039875(B2) | 2006-05-01 | Khalfay et al. | Applicant |
| US7051273(B1) | 2006-05-01 | Holt et al. | Applicant |
| US7058663(B2) | 2006-06-01 | Johnston et al. | Applicant |
| US7062764(B2) | 2006-06-01 | Cohen et al. | Applicant |
| US7065493(B1) | 2006-06-01 | Homsi | Applicant |
| US7080083(B2) | 2006-07-01 | Kim et al. | Applicant |
| US7080325(B2) | 2006-07-01 | Treibach-Heck et al. | Applicant |
| US7086009(B2) | 2006-08-01 | Resnick et al. | Applicant |
| US7086042(B2) | 2006-08-01 | Abe et al. | Applicant |
| US7088374(B2) | 2006-08-01 | David et al. | Applicant |
| US7100147(B2) | 2006-08-01 | Miller et al. | Applicant |
| US7103611(B2) | 2006-09-01 | Murthy et al. | Applicant |
| US7106888(B1) | 2006-09-01 | Silverbrook et al. | Applicant |
| US7107282(B1) | 2006-09-01 | Yalamanchi | Applicant |
| US7107521(B2) | 2006-09-01 | Santos | Applicant |
| US7146564(B2) | 2006-12-01 | Kim et al. | Applicant |
| US7152205(B2) | 2006-12-01 | Day et al. | Applicant |
| US7168035(B1) | 2007-01-01 | Bell et al. | Applicant |
| US7190376(B1) | 2007-03-01 | Tonisson | Applicant |
| US7191394(B1) | 2007-03-01 | Ardeleanu et al. | Applicant |
| US7213200(B2) | 2007-05-01 | Abe et al. | Applicant |
| US7236982(B2) | 2007-06-01 | Zlatanov et al. | Applicant |
| US7272789(B2) | 2007-09-01 | O'Brien | Applicant |
| US7281018(B1) | 2007-10-01 | Begun et al. | Applicant |
| US7296017(B2) | 2007-11-01 | Larcheveque et al. | Applicant |
| US7313758(B2) | 2007-12-01 | Kozlov | Applicant |
| US7316003(B1) | 2008-01-01 | Dulepet et al. | Applicant |
| US7318237(B2) | 2008-01-01 | Moriconi et al. | Applicant |
| US7334178(B1) | 2008-02-01 | Stanciu et al. | Applicant |
| US2001/0007109(A1) | 2001-07-01 | Lange | Applicant |
| US2001/0022592(A1) | 2001-09-01 | Alimpich et al. | Applicant |
| US2001/0024195(A1) | 2001-09-01 | Hayakawa | Applicant |
| US2001/0037345(A1) | 2001-11-01 | Kiernan et al. | Applicant |
| US2001/0054004(A1) | 2001-12-01 | Powers | Applicant |
| US2001/0056429(A1) | 2001-12-01 | Moore et al. | Applicant |
| US2001/0056460(A1) | 2001-12-01 | Sahota et al. | Applicant |
| US2002/0010700(A1) | 2002-01-01 | Wotring | Applicant |
| US2002/0010743(A1) | 2002-01-01 | Ryan et al. | Applicant |
| US2002/0010746(A1) | 2002-01-01 | Jilk, Jr. et al. | Applicant |
| US2002/0013788(A1) | 2002-01-01 | Pennell et al. | Applicant |
| US2002/0023113(A1) | 2002-02-01 | Hsing et al. | Applicant |
| US2002/0026441(A1) | 2002-02-01 | Kutay et al. | Applicant |
| US2002/0026461(A1) | 2002-02-01 | Kutay et al. | Applicant |
| US2002/0032590(A1) | 2002-03-01 | Anand et al. | Applicant |
| US2002/0032692(A1) | 2002-03-01 | Suzuki et al. | Applicant |
| US2002/0032706(A1) | 2002-03-01 | Perla et al. | Applicant |
| US2002/0032768(A1) | 2002-03-01 | Voskuil | Applicant |
| US2002/0035579(A1) | 2002-03-01 | Wang et al. | Applicant |
| US2002/0035581(A1) | 2002-03-01 | Reynar et al. | Applicant |
| US2002/0040469(A1) | 2002-04-01 | Pramberger | Applicant |
| US2002/0057297(A1) | 2002-05-01 | Grimes et al. | Applicant |
| US2002/0065798(A1) | 2002-05-01 | Bostleman et al. | Applicant |
| US2002/0070973(A1) | 2002-06-01 | Croley | Applicant |
| US2002/0078074(A1) | 2002-06-01 | Cho et al. | Applicant |
| US2002/0078103(A1) | 2002-06-01 | Gorman et al. | Applicant |
| US2002/0100027(A1) | 2002-07-01 | Binding et al. | Applicant |
| US2002/0112224(A1) | 2002-08-01 | Cox | Applicant |
| US2002/0129056(A1) | 2002-09-01 | Conant | Applicant |
| US2002/0133484(A1) | 2002-09-01 | Chau et al. | Applicant |
| US2002/0152222(A1) | 2002-10-01 | Holbrook | Applicant |
| US2002/0152244(A1) | 2002-10-01 | Dean et al. | Applicant |
| US2002/0156772(A1) | 2002-10-01 | Chau et al. | Applicant |
| US2002/0156846(A1) | 2002-10-01 | Rawat et al. | Applicant |
| US2002/0156929(A1) | 2002-10-01 | Hekmatpour | Applicant |
| US2002/0169752(A1) | 2002-11-01 | Kusama et al. | Applicant |
| US2002/0169789(A1) | 2002-11-01 | Kutay et al. | Applicant |
| US2002/0174147(A1) | 2002-11-01 | Wang et al. | Applicant |
| US2002/0174417(A1) | 2002-11-01 | Sijacic et al. | Applicant |
| US2002/0184219(A1) | 2002-12-01 | Preisig et al. | Applicant |
| US2002/0188597(A1) | 2002-12-01 | Kern et al. | Applicant |
| US2002/0188613(A1) | 2002-12-01 | Chakraborty et al. | Applicant |
| US2002/0194219(A1) | 2002-12-01 | Bradley et al. | Applicant |
| US2002/0196281(A1) | 2002-12-01 | Audleman et al. | Applicant |
| US2002/0196288(A1) | 2002-12-01 | Emrani | Applicant |
| US2002/0198891(A1) | 2002-12-01 | Li et al. | Applicant |
| US2002/0198935(A1) | 2002-12-01 | Crandall, Sr. et al. | Applicant |
| US2003/0004951(A1) | 2003-01-01 | Chokshi | Applicant |
| US2003/0007000(A1) | 2003-01-01 | Carlson et al. | Applicant |
| US2003/0014397(A1) | 2003-01-01 | Chau et al. | Applicant |
| US2003/0018668(A1) | 2003-01-01 | Britton et al. | Applicant |
| US2003/0020746(A1) | 2003-01-01 | Chen et al. | Applicant |
| US2003/0023641(A1) | 2003-01-01 | Gorman et al. | Applicant |
| US2003/0025732(A1) | 2003-02-01 | Prichard | Applicant |
| US2003/0026507(A1) | 2003-02-01 | Zlotnick | Applicant |
| US2003/0037303(A1) | 2003-02-01 | Bodlaender | Applicant |
| US2003/0043986(A1) | 2003-03-01 | Creamer | Applicant |
| US2003/0046665(A1) | 2003-03-01 | Iiln | Applicant |
| US2003/0048301(A1) | 2003-03-01 | Menninger | Applicant |
| US2003/0051243(A1) | 2003-03-01 | Lemmons et al. | Applicant |
| US2003/0055811(A1) | 2003-03-01 | Stork et al. | Applicant |
| US2003/0055828(A1) | 2003-03-01 | Koch et al. | Applicant |
| US2003/0056198(A1) | 2003-03-01 | Al-Azzawe | Applicant |
| US2003/0061386(A1) | 2003-03-01 | Brown | Applicant |
| US2003/0061567(A1) | 2003-03-01 | Brown et al. | Applicant |
| US2003/0084424(A1) | 2003-05-01 | Reddy et al. | Applicant |
| US2003/0093755(A1) | 2003-05-01 | O'Carroll | Applicant |
| US2003/0120578(A1) | 2003-06-01 | Newman | Applicant |
| US2003/0120651(A1) | 2003-06-01 | Bernstein et al. | Applicant |
| US2003/0120659(A1) | 2003-06-01 | Sridhar | Applicant |
| US2003/0120671(A1) | 2003-06-01 | Kim et al. | Applicant |
| US2003/0120686(A1) | 2003-06-01 | Kim et al. | Applicant |
| US2003/0126555(A1) | 2003-07-01 | Aggarwal et al. | Applicant |
| US2003/0128196(A1) | 2003-07-01 | Lapstun et al. | Applicant |
| US2003/0135825(A1) | 2003-07-01 | Gertner et al. | Applicant |
| US2003/0140132(A1) | 2003-07-01 | Champagne et al. | Applicant |
| US2003/0158897(A1) | 2003-08-01 | Ben-Natan et al. | Applicant |
| US2003/0163285(A1) | 2003-08-01 | Nakamura et al. | Applicant |
| US2003/0167277(A1) | 2003-09-01 | Hejisberg et al. | Applicant |
| US2003/0182268(A1) | 2003-09-01 | Lal | Applicant |
| US2003/0182327(A1) | 2003-09-01 | Ramanujam et al. | Applicant |
| US2003/0187756(A1) | 2003-10-01 | Klivington et al. | Applicant |
| US2003/0187930(A1) | 2003-10-01 | Ghaffar et al. | Applicant |
| US2003/0188260(A1) | 2003-10-01 | Jensen et al. | Applicant |
| US2003/0189593(A1) | 2003-10-01 | Yarvin | Applicant |
| US2003/0192008(A1) | 2003-10-01 | Lee | Applicant |
| US2003/0200506(A1) | 2003-10-01 | Abe et al. | Applicant |
| US2003/0204511(A1) | 2003-10-01 | Brundage | Applicant |
| US2003/0204814(A1) | 2003-10-01 | Elo et al. | Applicant |
| US2003/0205615(A1) | 2003-11-01 | Marappan | Applicant |
| US2003/0212664(A1) | 2003-11-01 | Breining et al. | Applicant |
| US2003/0217053(A1) | 2003-11-01 | Bachman et al. | Applicant |
| US2003/0220930(A1) | 2003-11-01 | Milleker et al. | Applicant |
| US2003/0225469(A1) | 2003-12-01 | DeRemer et al. | Applicant |
| US2003/0225768(A1) | 2003-12-01 | Chaudhuri | Applicant |
| US2003/0225829(A1) | 2003-12-01 | Pena et al. | Applicant |
| US2003/0226132(A1) | 2003-12-01 | Tondreau et al. | Applicant |
| US2003/0233374(A1) | 2003-12-01 | Spinola et al. | Applicant |
| US2003/0233644(A1) | 2003-12-01 | Cohen et al. | Applicant |
| US2003/0236859(A1) | 2003-12-01 | Vaschillo et al. | Applicant |
| US2003/0237046(A1) | 2003-12-01 | Parker et al. | Applicant |
| US2003/0237047(A1) | 2003-12-01 | Borson | Applicant |
| US2004/0002939(A1) | 2004-01-01 | Arora | Applicant |
| US2004/0003031(A1) | 2004-01-01 | Brown et al. | Applicant |
| US2004/0003353(A1) | 2004-01-01 | Rivera et al. | Applicant |
| US2004/0003389(A1) | 2004-01-01 | Reynar et al. | Applicant |
| US2004/0010752(A1) | 2004-01-01 | Chan et al. | Applicant |
| US2004/0024842(A1) | 2004-02-01 | Witt | Applicant |
| US2004/0030991(A1) | 2004-02-01 | Hepworth et al. | Applicant |
| US2004/0039990(A1) | 2004-02-01 | Bakar et al. | Applicant |
| US2004/0039993(A1) | 2004-02-01 | Kougiouris et al. | Applicant |
| US2004/0044961(A1) | 2004-03-01 | Pesenson | Applicant |
| US2004/0044965(A1) | 2004-03-01 | Toyama et al. | Applicant |
| US2004/0054966(A1) | 2004-03-01 | Busch et al. | Applicant |
| US2004/0059754(A1) | 2004-03-01 | Barghout et al. | Applicant |
| US2004/0073565(A1) | 2004-04-01 | Kaufman et al. | Applicant |
| US2004/0073868(A1) | 2004-04-01 | Easter et al. | Applicant |
| US2004/0078756(A1) | 2004-04-01 | Napper et al. | Applicant |
| US2004/0083426(A1) | 2004-04-01 | Sahu | Applicant |
| US2004/0088647(A1) | 2004-05-01 | Miller et al. | Applicant |
| US2004/0093596(A1) | 2004-05-01 | Koyano | Applicant |
| US2004/0107367(A1) | 2004-06-01 | Kisters | Applicant |
| US2004/0117769(A1) | 2004-06-01 | Lauzon et al. | Applicant |
| US2004/0123277(A1) | 2004-06-01 | Schrader et al. | Applicant |
| US2004/0146119(A1) | 2004-07-01 | Berkner et al. | Applicant |
| US2004/0163041(A1) | 2004-08-01 | Engel | Applicant |
| US2004/0172442(A1) | 2004-09-01 | Ripley | Applicant |
| US2004/0186762(A1) | 2004-09-01 | Beaven et al. | Applicant |
| US2004/0189716(A1) | 2004-09-01 | Paoli et al. | Applicant |
| US2004/0194035(A1) | 2004-09-01 | Chakraborty | Applicant |
| US2004/0205473(A1) | 2004-10-01 | Fisher et al. | Applicant |
| US2004/0205525(A1) | 2004-10-01 | Murren et al. | Applicant |
| US2004/0205534(A1) | 2004-10-01 | Koelle | Applicant |
| US2004/0205571(A1) | 2004-10-01 | Adler | Applicant |
| US2004/0205592(A1) | 2004-10-01 | Huang | Applicant |
| US2004/0205605(A1) | 2004-10-01 | Adler et al. | Applicant |
| US2004/0205653(A1) | 2004-10-01 | Hadfield et al. | Applicant |
| US2004/0205671(A1) | 2004-10-01 | Sukehiro et al. | Applicant |
| US2004/0210599(A1) | 2004-10-01 | Friedman et al. | Applicant |
| US2004/0221238(A1) | 2004-11-01 | Cifra et al. | Applicant |
| US2004/0221245(A1) | 2004-11-01 | Chickles et al | Applicant |
| US2004/0237030(A1) | 2004-11-01 | Malkin | Applicant |
| US2004/0261019(A1) | 2004-12-01 | Imamura et al. | Applicant |
| US2004/0268229(A1) | 2004-12-01 | Paoli et al. | Applicant |
| US2005/0004893(A1) | 2005-01-01 | Sangroniz | Applicant |
| US2005/0005248(A1) | 2005-01-01 | Rockey et al. | Applicant |
| US2005/0015279(A1) | 2005-01-01 | Rucker | Applicant |
| US2005/0015732(A1) | 2005-01-01 | Vedula et al. | Applicant |
| US2005/0022115(A1) | 2005-01-01 | Baumgartner et al. | Applicant |
| US2005/0027757(A1) | 2005-02-01 | Klessig et al. | Applicant |
| US2005/0033728(A1) | 2005-02-01 | James | Applicant |
| US2005/0038711(A1) | 2005-02-01 | Marlelo | Applicant |
| US2005/0055627(A1) | 2005-03-01 | Lloyd et al. | Applicant |
| US2005/0060324(A1) | 2005-03-01 | Johnson et al. | Applicant |
| US2005/0065933(A1) | 2005-03-01 | Goering | Applicant |
| US2005/0065936(A1) | 2005-03-01 | Goering | Applicant |
| US2005/0066287(A1) | 2005-03-01 | Tattrie et al. | Applicant |
| US2005/0071752(A1) | 2005-03-01 | Marlatt | Applicant |
| US2005/0076049(A1) | 2005-04-01 | Qubti et al. | Applicant |
| US2005/0091285(A1) | 2005-04-01 | Krishnan et al. | Applicant |
| US2005/0091305(A1) | 2005-04-01 | Lange et al. | Applicant |
| US2005/0102370(A1) | 2005-05-01 | Lin et al. | Applicant |
| US2005/0102612(A1) | 2005-05-01 | Allan et al. | Applicant |
| US2005/0108104(A1) | 2005-05-01 | Woo | Applicant |
| US2005/0108624(A1) | 2005-05-01 | Carrier | Applicant |
| US2005/0114757(A1) | 2005-05-01 | Sahota et al. | Applicant |
| US2005/0138086(A1) | 2005-06-01 | Pecht-Seibert | Applicant |
| US2005/0171746(A1) | 2005-08-01 | Thalhammer-Reyero | Applicant |
| US2005/0198086(A1) | 2005-09-01 | Moore | Applicant |
| US2005/0198125(A1) | 2005-09-01 | Beck et al. | Applicant |
| US2005/0198247(A1) | 2005-09-01 | Perry et al. | Applicant |
| US2005/0223063(A1) | 2005-10-01 | Chang et al. | Applicant |
| US2005/0223320(A1) | 2005-10-01 | Brintzenhofe et al. | Applicant |
| US2005/0268222(A1) | 2005-12-01 | Cheng | Applicant |
| US2006/0020586(A1) | 2006-01-01 | Prompt et al. | Applicant |
| US2006/0026534(A1) | 2006-02-01 | Ruthfield et al. | Applicant |
| US2006/0031757(A9) | 2006-02-01 | Vincent, III | Applicant |
| US2006/0036995(A1) | 2006-02-01 | Chickles et al. | Applicant |
| US2006/0041838(A1) | 2006-02-01 | Khan | Applicant |
| US2006/0059434(A1) | 2006-03-01 | Boss et al. | Applicant |
| US2006/0069605(A1) | 2006-03-01 | Hatoun | Applicant |
| US2006/0069985(A1) | 2006-03-01 | Friedman et al. | Applicant |
| US2006/0085409(A1) | 2006-04-01 | Rys et al. | Applicant |
| US2006/0101037(A1) | 2006-05-01 | Brill et al. | Applicant |
| US2006/0143220(A1) | 2006-06-01 | Spencer, Jr. | Applicant |
| US2006/0161559(A1) | 2006-07-01 | Bordawekar et al. | Applicant |
| US2007/0036433(A1) | 2007-02-01 | Teutsch | Applicant |
| US2007/0050719(A1) | 2007-03-01 | Lui et al. | Applicant |
| US2007/0061467(A1) | 2007-03-01 | Essey | Applicant |
| US2007/0061706(A1) | 2007-03-01 | Cupala | Applicant |
| US2007/0074106(A1) | 2007-03-01 | Ardeleanu | Applicant |
| US2007/0094589(A1) | 2007-04-01 | Paoli | Applicant |
| US2007/0100877(A1) | 2007-05-01 | Paoli | Applicant |
| US2007/0101280(A1) | 2007-05-01 | Paoli | Applicant |
| US2007/0118803(A1) | 2007-05-01 | Walker et al. | Applicant |
| US2007/0130504(A1) | 2007-06-01 | Betancourt et al. | Applicant |
| US2007/0208606(A1) | 2007-09-01 | MacKay et al. | Applicant |
| US2007/0208769(A1) | 2007-09-01 | Boehm et al. | Applicant |
| EP841615 | 1999-11-01 | Applicant | |
| EP961197 | 1999-12-01 | Applicant | |
| EP1076290 | 2001-02-01 | Applicant | |
| EP1221661 | 2002-07-01 | Applicant | |
| JP63085960 | 1988-04-01 | Applicant | |
| JP401173140 | 1989-07-01 | Applicant | |
| JP4225466 | 1992-06-01 | Applicant | |
| JP5314152 | 1993-11-01 | Applicant | |
| JP406014105 | 1994-01-01 | Applicant | |
| JP6139241 | 1994-05-01 | Applicant | |
| JP6180697 | 1994-06-01 | Applicant | |
| JP6180698 | 1994-06-01 | Applicant | |
| JP3191429 | 2000-01-01 | Applicant | |
| JP2000132436 | 2000-05-01 | Applicant | |
| JP2002183652 | 2002-06-01 | Applicant | |
| JP2003173288 | 2003-06-01 | Applicant | |
| WO99/24945 | 1999-05-01 | Applicant | |
| WO99/56207 | 1999-11-01 | Applicant | |
| WO1/44934 | 2001-06-01 | Applicant | |
| WO157720 | 2001-08-01 | Applicant |
Non-Patent Literature (124)
- Raman et al., XForms 1.0, Dec. 2001, W3C, 1.0, section 1-12.2.3 & Appendices A-G.Examiner
- Singh, Microsoft Infopath 2003 By Example, Apr. 20, 2003, PerfectXML, pp. 1-19.Examiner
- Beauchemin et al., Using InfoPath To Create Smart Forms, Mar. 27, 2003, Microsoft, pp. 1-6.Examiner
- Hoffman, Architecture of Microsoft Office InfoPath 2003, Jun. 2003, Microsoft, pp. 1-18.Examiner
- InfoPath and Xforms, Feb. 26, 2003, InfoWorld, pp. 1-3.Examiner
- Dubinko, Xforms and Microsoft InfoPath, Oct. 29, 2003, XML.com, pp. 1-6.Examiner
- Catorcini et al., Support and Troubleshooting for XML Schema in InfoPath 2003, Aug. 2004, pp. 1-18.Examiner
- Grosso et al., XML Fragment Interchange, Feb. 2001, W3C, pp. 1-28.Examiner
- Dubinko, XForms Essentials, 2003, O'Reilly, pp. 1-208.Examiner
- Andrew Watt, Microsoft Office Infopath 2003 Kick Start, Mar. 23, 2004 (Published by Sams), Print ISBN-10: 0-672-32623-X, pp. 1-57 in PDF format.Examiner
- Atova, “User Reference manual Version 4.4, XML Spy suite 4.4,” Atova Ges.m.b.H and Altova, Inc., May 24, 2002, pages cover, copyright p. 1-565.Applicant
- Altova et al. XML Spy, XML integrated Development Environments, Altova Inc., 2002, pp. 1-18.Applicant
- Ben-Natan, U.S. Appl. No. 60/203,081, filed May 9, 2000, entitled “Internet platform for creating and supporting communities”.Applicant
- Ixia Soft, “Steamlining content creation, retrieval, and publishing on the Web using TEXTML Server and SML Spy 4 Suite in an integrated, Web publishing environment,” (Partner's Whitepaper, published on the Web as of Jun. 6, 2002, download pp. 1-16.Applicant
- Kutay, U.S. Appl. No. 60/209,713, filed Jun. 5, 2000, entitled, “Methods and systems for accessing, organizing presenting and viewing data”.Applicant
- Microsoft Word 2000 (see Screen Shot “About Microsoft Word”) Published 1983-1999 and Microsoft Excel 2000 (see Screen Shot “About Microsoft Excel”) Published 1988-1999, Three pages.Applicant
- Moore, U.S. Appl. No. 60/191,662, filed Mar. 23, 2000, entitled “Collection-based presistent digital archives”Applicant
- Bruce Halberg et al, “Using Microsoft Excel 97”, Published 1997, Bestseller Edition, Pertinent pp. 1-9, 18-25, 85-89, 98-101, 106-113, 124-127, 144-147, 190-201, 209-210, 218-227, 581-590, 632-633, 650-655, 712-714.Applicant
- Laura Acklen & Read Gilgen, “Using corel Wordperfect 9”, 251-284, 424-434, 583-586 (1998).Applicant
- LeBlond et al, “PC Magazine Guide to Quattro Pro for Windows”, pp. 9-11, 42-61, Ziff-Davis Press, Copyright 1993 by the LeBlond Group.Applicant
- Microsoft Visual Basic 5.0 Programmer's Guide 1997; pp. 578-579; Redmond WA 98052-6399.Applicant
- Excel 97 for Busy People Published by Osborne/Mcgraw-Hill 1997 pp. 48-50.Applicant
- “A tour of Xmetal” O'Reilly XML.COM ′Online Jul. 14, 1999 XP002230081 retrieved from the internet: <URL: http://www.xml.com/pub/a/SeyboldReport/ip0311025.html> retrieved on Feb. 5, 2003.Applicant
- “Architecture for a Dynamic Information Area Control” IBM Technical Disclosure Bulletin IBM Corp. New York US vol. 37 No. 10 Jan. 10, 1994. pp. 245-246.Applicant
- “Netscape Communicator's Collapsible Toolbars” CHI'98 Human Factors in Computing Systems Conference Proceedings Los Angeles CA Apr. 18-23, 1998 pp. 81-86.Applicant
- Barker et al., “Creating In-Line Objects Within An Integrated Editing Environment,” IBM Technical Disclosure Bulletin, vol. 27, No. 5, Oct. 1984, p. 2962.Applicant
- “Flexible Information Presentation with XML” 1998 The Institution of Electrical Engineers 6 pages.Applicant
- Berg A., “Naming and Binding: Monikers” Inside OLE, 1995, Chapter 9, pp. 431-490.Applicant
- “Arbortext Adept 8 Editor Review” O'Reilly XML.COM ′Online! Sep. 22, 1999 XP002230080 retrieved from the Internet <URL:http://www.xml.com/pub/a/1999/09/adept/AdeptRvw.htm> retrieved on Feb. 5, 2003.Applicant
- “XKvalidator: A Constraint Validator for XML” CIKM ′-2 Nov. 4-9, 2002 Copyright 2002 ACM 1-58113-492-4/02/0011 pp. 446-452.Applicant
- “Designing Valid XML Views” ER 2002 LNCS 2503 2002 Springer-Verlag Berlin Heidelberg 2002 pp. 463-477.Applicant
- Efficient Management of Multiversion Documents by Object Referencing Proceedings of the 27th VLDB Conference 2001 pp. 291-300.Applicant
- “Efficient schemes for managing multiversion XML documents” VLDB Journal (2002) pp. 332-352.Applicant
- “Storing and Querying Multiversion XML Documents using Durable Node Numbers” IEEE 2002 pp. 232-241.Applicant
- “XML Document Versioning” SIGMOD Record vol. 30 No. 3 Sep. 2001 pp. 46-53.Applicant
- “Generic Validation of Structural Content with Parametric Modules” ICFP '01 Sep. 3-5, 2001 Copyright 2001 ACM 1-58113-415-0/01/0009 pp. 98-109.Applicant
- “Managing Complex Documents Over the WWW: A Case Study for XML” IEEE Transactions on Knowledge and Data Engineering vol. 11 No. 4 Jul./Aug. 1999. pp. 629-938.Applicant
- Clapp D., “The NeXT Application Kit Part I: Non-Responsive Classes,” The NeXT Bible 1990, Chapter 16, pp. 275-293.Applicant
- Clark James—W3C Editor; “XSL Transformation (XSLT) Version 1.0” Nov. 16, 1999 W3C (MIT INRIA Kejo) pp. 1-156.Applicant
- W3C Editor James Clark and Ste; “XML Path Language (XPath) Version 1.0” Nov. 16, 1999 W3C (MIT INRIA Kejo) pp. 1-49.Applicant
- “From small beginnings” Knowledge Management Nov. 2001 pp. 28-30.Applicant
- “XML Editors: Allegations of Functionality in search of reality” Internet ′Online! 1999 XP002230082 retrieved from the Internet <URL:http://www.ivritype.com/xml/>.Applicant
- “Photo Shop 5/5.5 WOW! Book” 2000 Peachpit Press pp. 8-17.Applicant
- Description of Whitehill Composer software product produced by Whitehill Technologies Inc. available at <http://www.xml.com/pub/p/221> accessed on Apr. 8, 2004, two pages.Applicant
- DiLascia et al., “Sweeper” Microsoft Interactive Developer, vol. 1, No. 1, 1996, 27 pages.Applicant
- “XML Spy Tops as XML Editor” http://www.eweek.com/article2/0395972404100.asp Nov. 25, 2002 4 pages.Applicant
- “Agent-based Software Configuration and Deployment” Thesis of the University of Colorado Online Dec. 31, 1999 retrieved from the Internet on Nov. 7, 2003: <http://www.cs.colorado.edu/users/rickhall/documents/ThesisFinal.pdf> 169 pages.Applicant
- “Mapping and Displaying Structural Transformations between XML and PDF” DocEng '02 Nov. 8-9, 2002 Copyright 2002 ACM 1-58113-597-7/02/0011 pp. 95-102.Applicant
- “Tsbiff—tildeslash biff—version 1.2.1” Internet Document [Online] Jun. 1999 URL: http://web.archive.org/web/19990912001527/http://www.tildeslash.com/tsbiff/.Applicant
- Herzner et al., “CDAM- Compound Document Access and Management. An Object-Oriented Approach” Multimedia Systems Interaction and Applications, 1992, Chapter 3, pp. 17-36.Applicant
- “Micro-Firewalls for Dynamic Network Security with Distributed Intrusion Detection”; IEEE INternational Symposium on Network Computing and Applications; 2001; pp. 68-79.Applicant
- “Specifying Runtime Environments and Functionalities of Downloadable Components Under the Sandbox Mode”; International Symposium on Principles of Software Evolution; 2000; pp. 138-142.Applicant
- “An Efficiently Updatable Index Scheme for Structured Documents” 1998 IEEE pp. 991-996.Applicant
- “Immediate and Partial Validation Mechanism for the Conflict Resolution of Update Operations in XML Databases” WAIM 2002 LNCS 2419 2002 pp. 387-396 Springer-Verlag Berlin Heidelberg 2002.Applicant
- Kobayashi et al., “An Update on BTRON-specification OS Development” IEEE 1991, pp. 132-140.Applicant
- Komatsu N. et al., “A Proposal on Digital Watermark in Document Image Communication and its Application to Realizing a Signature” Electronics and Communications in Japan Part I: Communications vol. 73 No. 5, May 1990, pp. 22-33.Applicant
- McCright J.S.; “New Tool Kit to Link Groove with Microsoft Sharepoint” eWeek Enterprise News & Reviews Ziff Davis Media Inc. Jul. 29, 2002.Applicant
- Musgrave S; “Networking technology—impact and opportunities” Survey and Statistical Computing 1996. Proceedings of the Second ASC International Conference. Sep. 1996. pp. 369-378. London UK.Applicant
- “Validation with MSXML and XML Schema” Windows Developer Magazine Jan. 2002 pp. 35-38.Applicant
- “SmartUpdate Developer's Guide” Online Mar. 11, 1999 retrieved from the Internet on Dec. 8, 2000: <http://developer.netscape.com:80/docs/manuals/communicator/jarman/index.htm> 83 pages.Applicant
- “Netscape Communicator 4.61 for OS/2 Warp” Software 1999 The whole software release & “Netscape—Version 4.6 [en]-010615” Netscape Screenhot Oct. 2, 2002.Applicant
- “A secure conditional access system using digital signature and encryption” 2003 Digest of Technical Papers. International Conference on Consumer Electronics Jun. 2003 pp. 220-221.Applicant
- Object Management Group, XML Metadata Interchange (XMI) Specification Version 1.2 Jan. 2002.Applicant
- “Delphi 5 Developer's Guide” Sams Publishing 1999 Chapter 31 Section: Data Streaming 6 pages.Applicant
- Peterson B. , “Unix Variants,” Unix Review, vol. 10, No. 4, Apr. 1992, pp. 29-31.Applicant
- Pike et al., “Plan 9 from Bell Labs” UKUUG, Summer 1990, 10 pages.Applicant
- Pike et al., “The Use of Name Spaces in Plan 9,” Operating Systems Review vol. 27, No. 2, Apr. 1993, pp. 72-76.Applicant
- Prevelakis et al., “Sandboxing Applications”; Proceedings of the FREENIX Track; 2001; pp. 119-126.Applicant
- Rapaport L; “Get more from SharePoint” Transform Magazine vol. 11 No. 3. Mar. 2002 pp. 1315.Applicant
- “Validating MPEG-21 Encapsulated Functional Metadata” IEEE 2002 pp. 209-212.Applicant
- Schmid et al., “Protecting Data from Malicious Software”; 18th Annual Computer Security Applications Conference; 2002; pp. 199-208.Applicant
- Staneck W., “Internal and External Media” Electronic Publishing Unleashed, 1995, Chapter 22, pp. 510-542.Applicant
- “Store and Organize Related Project Files in a Binder,” Getting Results with Microsoft Office, 1990, pp. 109-112.Applicant
- Sun Q. et al., “A robust and secure media signature scheme for JPEG images” Proceedings of 2002 IEEE Workshop on Multimedia Signal Processing, Dec. 2002, pp. 296-299.Applicant
- “XFIG Version 3.2 Patchlevel 2 (Jul. 2, 1998) Users Manual (Edition 1.0)” Internet Document [Online] Jul. 2, 1998 XP002229137 Retrieved from the Internet: <URL: http://www.ice.mtu.edu/online—docs/xfig332/> [retrieved on Jan. 28, 2003].Applicant
- “An Efficient and Flexible Access Control Framework for Java Programs in Mobile Terminals”; 22nd International Conference on Distributed Computing Systems Workshops; 2002; pp. 777-782.Applicant
- Trupin J., “The Visual Programmer,” Microsoft Systems Journal, Apr. 1996, pp. 103-105.Applicant
- “XML: Not a Silver Bullet But a Great Pipe Wrench” Standardview vol. 6. No. 3 Sep. 1998 pp. 125-132.Applicant
- “The Open Software Description Format” Online Aug. 13, 1997 retrieved from the Internet on Nov. 7, 2003: <http://www.w3.org/TR/NOTE-OSD> 11 pages.Applicant
- “Bridging XML-Schema and relational databases. A System for generating and manipulating relational databases using valid XML documents.” DocEng '01 Nov. 9-10, 2001 Coppyright 2001 ACM 1-58113-432-0/01/0011 pp. 105-114.Applicant
- “The Component Object Model” A Technical Overview Oct. 1994 Microsoft Corp. pp. 1-14.Applicant
- “Managing and Querying Multi-Version XML Data with Update Logging” DocEng '02 Nov. 8-9, 2002 Copyright 2002 ACM 1-58113-594-7/02/0011 pp. 74-81.Applicant
- Zdonik S., “Object Management System Concepts,” ACM, 1984, pp. 13-19.Applicant
- Han et al., WebSplitter: A Unified XML Framework for Multi-Device Collaborative Web Browsing, 2000, ACM Conference on Cimputer Supported Cooperative Work, 10 pages.Applicant
- IBM: Stack Algorithm for Extractin Subtree from Serialized Tree, Mar. 1, 1994, TDB-ACC-NONN94033, 3 pages.Applicant
- Altova, Inc., “XML Spy 4.0 Manual,” Altova Inc. & Altova GmbH, coyright 1998-2001, Chapters 1, 2, and 6, encompassing pp. 1-17, 18-90, and 343-362.Applicant
- Cybook, Inc.: “Copying the Search Form to Services-based Web Sites” INternet Article, (online) Jul. 26, 2004. “The whole document”.Applicant
- Excel Developer Tip (hereinafter “Excel”), “Determining the Data Type of a Cell”, May 13, 1998, p. 1 (available at http://jwalk.com/ss/excel/tips/tip62.htm).Applicant
- Macromedia, Inc.: “Dreamweaver Technote, Changes in copying and pasting in Dreamweaver 4” Internet Article (online). “the whole document”.Applicant
- Rado, Dave: “How to create a template that makes it easy for users to “fill in the blanks”, without doing any programming” Microsoft Word MVP FAQ Site, (online) Apr. 30, 2004, the whole document.Applicant
- Cover, XML Forms Architecture, retrieved at <<http://xml.coverpages.org/xfa.html>> on Aug. 17, 2006, Coverpages, Jun. 16, 1999.Applicant
- Raggett, “HTML Tables”, retrieved on Aug. 6, 2006, at <<http:www://is-edu.hcmuns.edu.vn/WebLib/books/Web/Tel/html3-tables.html>>, W3C Internet Draft, Jul. 7, 1995, pp. 1-12.Applicant
- “Webopedia Computer Dictionary” retrieved on May 9, 2006, at <<http://www.pewebopedia.com/TERM/O/OLE.html>>, Jupitermedia Corporation, 2006, pp. 07.Applicant
- Baraband et al., PowerForms: “Declarative Client Site Form Field Validation”, World Wide Web, Baltzer Science Publishers, Bussum, NL, vol. 3, No. 4, Dec. 2000, p. 1-20.Applicant
- Microsoft Corporation, “Microsoft Computer Dictionary” Microsoft Press, Fifth Edition, p. 149.Applicant
- Borland, Russo , “Running Microsoft Word 97”, 314-315, 338, 361-362, 390, and 714-719.Applicant
- “Microsoft Word 2000”, Screenshots (1999), 1-5.Applicant
- Beauchemin, Dave , “Using InfoPath to Create Smart Forms”, Retrieved from the Internet at http:/www.microsoft.com/office/infopath/prodinfo/using.mspx on Jan. 21, 2007, (Mar. 27, 2003).Applicant
- Begun, Andrew , et al., “Support and Troubleshooting for XML Schemas in InfoPath 2003”, Microsoft Office InfoPath 2003 Technical Articles, Retrieved from the Internet at http://msdn2.microsoft.com/en-us/library/aa16824 (office.11.d=printer).aspx on Jan. 21, 2007, (Aug. 2004).Applicant
- Dubinko, Micah , “XForms and Microsoft InfoPath”, Retrieved from the Internet at http://www.xml.com/lpt/a/1311 on Jan. 21, 2007, (Oct. 29, 2003).Applicant
- Udell, Jon , “InfoPath and XForms”, Retrieved from the Internet at http://weblog.infoworld.com/udell/2003/02/26.html,(Feb. 26, 2003).Applicant
- Hoffman, Michael , “Architecture of Microsoft Office InfoPath 2003”, Microsoft Office InfoPath 2003 Technical Articles, Retrieved from the Internet at http://msdn2.microsoft.com/en-us/library/aa219024(office.11,d=printer).aspx on Jan. 21, 2007,(Jun. 2003).Applicant
- Singh, Darshan, “Microsoft InfoPath 2003 By Example”, Retrieved from the Internet at http://www.perfectxml.com/InfoPath.asp on Jan. 21, 2007,(Apr. 20, 2003).Applicant
- Raman, T. V., et al., “XForms 1.0”, (Dec. 2001),Section 1-12.2.3 & Appendices A-G.Applicant
- “Enter Key”, Retrieved from the Internet at http://systems.webopedia.com/TERM/Enter—key.html on Dec. 20, 2006.Applicant
- Lehtonen, Miro , et al., “A Dynamic User Interface for Document Assembly”, Department of Computer Science, University of Helsinki,(Nov. 2002).Applicant
- Rees, Michael J., “Evolving the Browser Towards a Standard User Interface Architecture”, School of Information Technology, Bond University, Australia,(2001).Applicant
- “Microsoft Visual Basic 5.0 Programmer's Guide”, Microsoft Press, (1997), pp. 42-43, 54-58.Applicant
- Nelson, Joe , “Client-side Form Validation Using JavaScript”, Developer Advisory, (Sep. 21, 2001).Applicant
- Brabrand, et al., “Power Forms Declarative Client-side Form Field Validation”, (2002), 1-20.Applicant
- Anat, Eyal , et al., “Integrating and Customizing Hererogeneous E-Commerce Applications”, The VLDB Journal-The International Journal on Very Large Data Bases, vol. 10, Issue 1,(Aug. 2001),16-38.Applicant
- Adams, Susie , et al., “BizTalk Unleashed”, Sams publishing, 2002, first printing Mar. 2001, 1-2, 31-138.Applicant
- Vasters, Clemens F., “BizTalk Server 2000 A Beginner's Guide”, Osborne/McGraw-Hill,(2001), 1-2, 359-402.Applicant
- Halberg, Bruce , et al., “Using Microsoft Excel 97”, (1997), 191-201, 213-219.Applicant
- Villard, et al., “An Incremental XSLT Transformation Processor for XML Document Manipulation”, http://www2002.org/CDROM/refereed/321, Printed on May 18, 2007,25 pages.Applicant
- “Microsoft Word 2000 Screenshots”, (2000),11-17.Applicant
- XMLSPY, “XmlSpy 2004 Enterprise Edition Manual”, Altova,(May 17, 2004),1-25, 220-225.Applicant
- Stylusstudio, “StylusStudio: XPath Tools”, 2004-2007, StylusStudio, 1-14.Applicant
- Dodds, “Toward an XPath API”, xml.com,(May 7, 2001), 1-3.Applicant
- Altova, “Altova Tools for XPath 1.0/2.0”, Altova, 1-12.Applicant
- “Microsoft Word 2000 Screenshots”, Word,(2000), 1 1-7.Applicant
- Altova, et al., “User and Reference Manual Version 4.4”, www.xmlspy.com, (May 24, 2007), 1-565.Applicant
- “XForm 1.0”, W3C,(Jul. 16, 2001).Applicant
- Pacheco, Xavier et al., “Delphi 5 Developer's Guide”, Sams Publishing. Chapter 31, Section: Data Streaming,(1999),4.Applicant