US 7,334,187 B1Grant
Electronic form aggregation
Issue Date:2008-02-19
•22 Claims
•16 Drawing Sheets
Abstract
A system and method that aggregates information from one electronic form into another electronic form is described. For sufficiently similar electronic forms, the system and method aggregates information from one electronic form into another automatically and without use of a transformation file. For electronic forms governed by substantially dissimilar schemas, the system and method automatically aggregates information from one electronic form into another with the aid of a transformation file.
Metadata
Assignee
- Microsoft Corporation
Inventors
- Constantin Stanciu
- Patrick Halstead
- Andrey Shur
- Edward G. Essey
Application Information
Application Number:US 10/636,475
Filing Date:2003-08-06
Priority Date:2003-08-06
Art Unit:2178
Classifications
IPC:
G06F17/00
Patent Drawings (16 sheets)
Description
Technical Field
[0001] This invention relates to aggregating electronic forms.
Background
[0002] Extensible markup language (XML) is increasingly becoming the preferred format for transferring data. XML is a tag-based hierarchical language that is extremely rich in terms of the data that it can be used to represent. For example, XML can be used to represent data spanning the spectrum from semi-structured data (such as one would find in a word-processing document) to generally structured data (such as that which is contained in a table). XML is well-suited for many types of communication including business-to-business and client-to-server communication.
[0003] Data represented in XML is often created and retained in electronic documents, such as electronic forms. An electronic form that is written in XML typically is governed by an XML schema (XSD) and can be altered by applying an eXtensible Style-sheet Language Transformation (XSLT) file on the form. For more information on XML, XSLT, and XSD (schemas), the reader is referred to the following documents which are the work of, and available from the W3C (World Wide Web consortium): XML Schema Part 2: Datatypes; XML Schema Part 1: Structures; and XSL Transformations (XSLT) Version 1.0; and XML 1.0 Second Edition Specification.
[0004] With so much information being described and transferred through XML, it is increasingly important to have ways to aggregate, or import information from one XML document into another. A manager, for instance, may want to study how his or her salespeople are performing. The manager can study dozens of XML documents, such as purchase orders filled out by the salespeople, and manually order, categorize, and add up the totals to determine how each salesperson is performing. With aggregation, however, the manager can have pertinent data from all of the purchase orders imported into one, summary document. This summary document can be organized to show how much each salesperson sold, when it was sold, and so on. Thus, aggregation can allow people to more easily and efficiently analyze and organize information.
[0005] Aggregation, however, can be very difficult to perform. To properly aggregate forms, a programmer commonly needs a thorough understanding of each of the electronic form's schemas. Even with this understanding, the programmer often contends with resulting, aggregated forms that are not valid according to their schemas. These and other complexities typically require a programmer with a high degree of skill to spend a significant amount of time to aggregate data from one electronic form into another.
[0006] For these reasons, aggregating XML documents, though useful, can be difficult, time consuming, and require a high degree of skill.
Summary
[0007] The following description and figures describe a system and method for aggregating information from one electronic form into another electronic form. For sufficiently similar electronic forms, this aggregation system and method enables users to automatically import information from one electronic form into another.
[0008] For electronic forms not sufficiently similar, such as forms governed by dissimilar schemas, this system and method uses a transformation file to enable a user to automatically aggregate electronic forms.
Brief Description of the Drawings
[0009] FIG. 1 illustrates a screen shot showing an exemplary target electronic form into which a user can select to have data imported from another electronic form.
[0010] FIG. 2 illustrates a partial screen shot showing a menu by which a user can select to import data from one electronic form into another electronic form.
[0011] FIG. 3 illustrates a database selection screen showing electronic forms from which a user can select.
[0012] FIG. 4 illustrates a screen shot showing an exemplary electronic form from which a user can select to have data imported into another electronic form.
[0013] FIG. 5 illustrates a screen shot showing an exemplary electronic form having data imported into it from another electronic form.
[0014] FIG. 6 illustrates a computer system capable of implementing a method for importing data from one electronic form into another electronic form.
[0015] FIG. 7 illustrates an exemplary set of transformation annotator-types usable in a transformation file to annotate an electronic form with instructions.
[0016] FIG. 8 is a flow diagram of an exemplary process for importing data from one electronic form into another electronic form.
[0017] FIG. 9 is a flow diagram of an exemplary process for importing data from one electronic form into another electronic form with and without annotations.
[0018] FIG. 10 illustrates a screen shot showing an exemplary target electronic form into which a user can select to have data imported from another electronic form.
[0019] FIG. 11 illustrates a screen shot showing an exemplary electronic form from which a user can select to have data imported into another electronic form.
[0020] FIG. 12 illustrates a screen shot showing an exemplary electronic form having data imported into it from another, substantially different electronic form.
[0021] FIG. 13 is a flow diagram of an exemplary process for importing data from one electronic form into another electronic form without use of annotations or instructions.
[0022] FIG. 14 illustrates two exemplary, simple, and graphical representations of two electronic forms that are hierarchically structured and organized into nodes.
[0023] FIG. 15 is a block diagram of a computer system that is capable of supporting aggregation of electronic forms.
[0024] The same numbers are used throughout the disclosure and figures to reference like components and features.
Detailed Description
[0025] The following disclosure describes an easy and simple way for a user to import data from one electronic form into another electronic form. For sufficiently similar electronic forms, a user can import data from one or many forms (called “sources”) into another electronic form (called the “target”) without needing special skills, such as that of programming transformation files. The system and method enables a user to import data from a source electronic form into a similar target electronic form simply by selecting the source and the target. By so doing, a user can combine data from many forms into one form, or simply import data from one form into another form. This allows the user to see data from one or many source forms in a target form without having to key-in data from the source forms into the target form. It also allows the user to aggregate the data into a target form that combines, alters, adjusts, or otherwise makes analysis and presentation of data simple and easy. As used herein, data can include numbers, text, rich text, dates/times, code (such as a portion of an electronic form written in XML), information (such as numbers and text) within code, a node or nodes of a hierarchical electronic form or information within those nodes, and the like.
[0026] For dissimilar source and target electronic forms, the following disclosure describes a way for a user to easily and simply import data from a source form into a target form. For these dissimilar source and target electronic forms, the system and method can annotate the source form to aid an import engine in importing data from the source into the target. This annotation can be performed by applying a transformation file on the source to annotate it. The transformation file can be re-used on similar sources for aggregation with a similar target, thereby reducing the time and effort spent by a designer in creating transformation files.
[0027] In at least these two ways, the disclosed system and method enables a user to easily import data from one electronic form into another. In cases where the source electronic form and the target electronic form are similar, an importation engine can import the data without annotating the source form by applying a transformation file. In cases where the source electronic form and the target electronic form are dissimilar, the importation engine can import the data with aid provided by applying a transformation file.
Example Showing Data Aggregation
[0028] FIGS. 1 through 5 show, from a user's perspective, a user importing data from a source electronic form into a target electronic form. These exemplary screen shots show an example of what a user can see when importing data.
[0029] The target and source electronic forms shown in these figures are governed by substantially similar schemas. For this reason, an import engine (described further below) does not, in this example, annotate or otherwise use a transformation file to aid in importing data from the source electronic form to the target electronic form.
[0030] FIG. 1 sets forth an exemplary screen shot 100 showing an example of a target electronic form, here a manager's status report 102. This manager's report 102 contains data-entry fields, which in this example contain data. The manager's report 102 includes the following data-entry fields: a date field 104; a manager's name field 106 (containing the name of the manager, “Target Manager”); a manager's email address field 108; a project field 110; a manager's boss's name field 112; a billing code field 114; a department field 116; a summary field 118; last period fields (an uno field 120 and a dos field 122); this period fields (a red field 124, a green field 126, a blue field 128, a yellow field 130, and a purple field 132); an issues field 134; and a notes field 136.
[0031] With this manager's report 102 selected, the user can then select a source electronic form to aggregate into the manager's report 102.
[0032] FIG. 2 sets forth a portion of an exemplary screen shot 200 showing an example of an options menu 202. Here the user has selected to aggregate forms, shown at reference numeral 204.
[0033] Once this selection is made, a menu of various electronic forms can be presented from which the user chooses an electronic form to aggregate into the manager's report 102.
[0034] FIG. 3 sets forth a database selection menu 300 showing electronic forms from which a user can select. Here the user can (and has) selected an electronic form entitled “Source.xml” to aggregate into the manger's report 102. The source electronic form is shown at reference numeral 302.
[0035] Once this selection is made, the selected electronic form can be presented (though this is not necessary).
[0036] FIG. 4 sets forth an exemplary screen shot 400 showing an example of a source electronic form, here a salesman's status report 402. This salesman's report 402 contains data-entry fields containing data. The salesman's report 402 includes the following data-entry fields: a salesman's date field 404; a salesman's name field 406 (containing the name of the salesman, “Salesman”); a salesman's email address field 408; a salesman's project field 410; a salesman's boss's name field 412 (here the Target Manager from FIG. 1 ); a salesman's billing code field 414; a salesman's department field 416; a salesman's summary field 418; salesman's last period fields (an alpha field 420, a beta field 422, and a gamma field 424); salesman's this period fields (a mu field 426, a nu filed 428, and xi field 430); a salesman's issues fields (a one field 432, a two field 434, and a three field 436); and a salesman's notes field 438.
[0037] Also once this selection is made, the salesman's report 402 can be aggregated into the manager's report 102. Here certain parts of the data of the salesman's report 402 are imported into the manager's report 102.
[0038] FIG. 5 sets forth an exemplary screen shot 500 showing an example of a target electronic form after data from a source electronic form has been aggregated into the target electronic form, here an aggregate manager's status report 502. This aggregate manager's report 502 contains data-entry fields containing data (which, in one implementation, the manager can then manually edit, if desired).
[0039] The aggregate manager's report 502 includes the original data-entry fields shown in FIG. 1 : the date field 104; the manager's name field 106; the manager's email address field 108; the project field 110; the manager's boss's name field 112; the billing code field 114; the department field 116; the last period fields 120 and 122; the this period fields 124, 126, 128, 130, and 132; the issues field 134 (not shown); and the notes field 136 (not shown).
[0040] The aggregate manager's report 502 also includes data imported from the salesman's report 402, either standing alone (as a new entry or data-entry field) or appended into an existing data-entry field. An example of data appended into an existing data-entry field is shown in an aggregate summary 504, which is the summary 118 only with additional, imported data. Here, the data from the salesman's summary field 418 has been aggregated with the data within the summary 118 from the manager's report 102. Thus, the aggregate summary 504 now reads: “I have a report who has done several things this week. Here's the rolled up summary: Here is some sample data. I've placed it in a rich text field to be concatenated.” The summary 118 from FIG. 1 , however, reads: “I have a report who has done several things this week. Here's the rolled up summary:”. The salesman's summary 418 from FIG. 4 reads “Here is some sample data. I've placed it in a rich text field to be concatenated.”.
[0041] Examples of data imported as a new entry or data-entry field include the data-entry fields shown in FIG. 4 that are now included in the aggregate manager's report 502: the salesman's last period fields 420, 422, and 424; the salesman's this period fields 426, 428, and 430; and the salesman's issues fields 432, 434, and 436 (not shown in FIG. 5 ).
[0042] By importing data from the source electronic form (here the salesman's report 402) into the target form (here the manager's report 102), a user can better see, understand, and analyze information. As shown in FIGS. 2 and 3 , the user can aggregate these similar electronic forms simply and easily.
[0043] How these electronic forms can be aggregated will be covered in greater detail below. Prior to setting forth various methods for importing data, a system will be set forth in part to aid the reader in understanding the methods later set forth. For discussion purposes, the system set forth below is described in the context of a single computer, a user-input device, and a single display screen. These and other devices will be described first, followed by a discussion of the techniques in which these and other devices can be used.
[0044] Exemplary System
[0045] FIG. 6 shows an exemplary system 600 to facilitate data importation between electronic forms.
[0046] The system 600 includes a display 602 having a screen 604, a user-input device 606, and a computer 608. The user-input device 606 can include any device allowing a computer to receive input from a user, such as a keyboard 610, other devices 612, and a mouse 614. The other devices 612 can include a touch screen, a voice-activated input device, a track ball, and the like. The user can send input via the user-input device 606 to the computer 608 to select an electronic form to be a source for merging into a target electronic form, for instance. The user can use the display 602 and its screen 604 to view user interfaces showing electronic forms, for example.
[0047] The computer 608 includes, within block 616, a processing unit 618 to execute applications and a memory 620 containing applications and files. The memory 620 includes volatile and non-volatile memory and applications, such as an operating system 622 and an import engine application 624. The import engine 624 is configured to analyze and import data from one electronic form to another. The import engine 624 can do so without annotations to the source electronic form (discussed below) and/or by following various instructions annotated into an electronic form (also discussed below).
[0048] The memory 620 also includes a transformation engine application 626 and a user interface 628, each of which can be part of or separate from the import engine 624.
[0049] The memory 620 also includes a target electronic form 630 and a source electronic form 632. The target form 630 and the source form 632 can be located locally in the memory 620, or can be accessed from a remote source across a communications network (not shown). In cases where the source form 632 and the target form 630 are hierarchical in nature, such as when both are written in XML, each form can be represented with nodes. These nodes can include a root node, to which all other nodes are subordinate, and these other nodes. Each node of the form can have nodes subordinate to it (each a child node with respect to that node) and so on. Thus, each node can have a parent node (except for the root node) and each node can have child nodes (though some will not).
[0050] In addition, each of these nodes can contain data, such as the data set forth in the data-entry fields (which are assumed to be a representation of some of the data within nodes related to those data-entry fields) shown in FIGS. 1 , 4, and 5.
[0051] The memory 620 can also include a transformation file 634, which can include transformation annotator-types 636 (set forth in greater detail in FIG. 7 ). The transformation engine application 626 is configured to apply the transformation file 634 to annotate the source form 632.
[0052] With these annotator-types 636 (or others), the transformation file 634 can annotate a particular portion of the source form 632. This transformation file 634, when applied on the source form 632, creates an annotated version of the source form 632. These annotations include instructions to the import engine 624, which the import engine 624 can use to import data from the source form 632 into the target form 630.
[0053] These annotator-types 636 can include the annotator-types set forth in FIG. 7 and described in a corresponding discussion.
[0054] Each of these annotator-types 636, when applied (as part of the transformation file 634) on the source form 632, can annotate the source form 632 with instructions relating to or including operations for the import engine 624 to perform. Thus, when the import engine 624 analyzes the source form 632 after it has been annotated, the import engine 624 can read certain instructions that have been put into the source form 632 as or within annotations. These instructions can direct the import engine 624 to import certain portions of the source form 632 into certain places within the target form 630, for instance.
[0055] In one implementation, the annotations are labeled with a tag to distinguish them from the data of the source form 632. This tag can reference a private XML namespace readable by the import engine 624.
[0056] In another implementation, each instruction associated with each of these annotator-types 636 relate to executable code that the import engine 624 executes when it reads that instruction in an annotated version of the source form 632. This executable code, when executed, can import data within a node of the source form 632 into a node of the target form 630, for instance.
[0057] FIG. 7 shows an example of the annotator-types 636, which are usable to facilitate data importation between electronic forms. The annotator-types 636 are set forth to explain various types of instructions that can be annotated into the source form 632, but are not the only types of instructions that can be used. They are instead set forth as examples to aid the reader in understanding how the transformation file 634 and annotations to the source form 632 can be used by the import engine 624 to aid the import engine 624 in importing data from the source form 632 into the target form 630.
[0058] The annotator-types 636 include an insert annotator 702, a merge annotator 704, a delete annotator 706, a replace annotator 707, a do-not-import annotator 708, a correspondence annotator 710, a singular-correspondence annotator 712, and an ordering annotator 714. These annotators are described in order below.
[0059] The insert annotator 702 can be applied, as part of the transformation file 634, on the source form 632 to annotate that form. This annotation includes instructions to insert a portion of the source form 632 (such as a data) into a portion of the target form 630. These instructions, for hierarchical forms, can direct the import engine 624 to insert a particular node of the source form 632 (or data within that node) as a child node of a particular node of the target form 630. These instructions, again for hierarchical forms, can also direct the import engine 624 to append data from the source form 632 to a node of the target form 630.
[0060] The merge annotator 704 can be applied, as part of the transformation file 634, on the source form 632 to annotate that form. This annotation includes instructions to merge a portion of the source form 632 (such as data) into a portion of the target form 630. These instructions, for hierarchical forms, can direct the import engine 624 to merge the data (or part of the data) of a particular node of the source form 632 into a node of the target form 630.
[0061] The delete annotator 706 can be applied, as part of the transformation file 634, on the source form 632 to annotate that form. This annotation includes instructions to delete a portion of the target form 630. These instructions, for hierarchical forms, can direct the import engine 624 to delete one or more nodes from the target form 630.
[0062] The replace annotator 707 can be applied, as part of the transformation file 634, on the source form 632 to annotate that form. This annotation includes instructions to replace a portion of the target form 630 (such as data) with a portion of the source form 632. These instructions; for hierarchical forms, can direct the import engine 624 to replace a node and/or its descendents (or data within the nodes) of the target form 630 with a particular node and/or its descendents (or the data within the nodes) of the source form 632.
[0063] The replace annotator 707 is not the same as annotating the source form 632 with the delete annotator 706 and the insert annotator 702. The replace annotator 707 does not instruct the system 600 to delete a node or data from the target form 630 and then insert a node or data from the source from 632. Rather, the replace annotator 707 annotates the source form 632 with instructions to replace a portion of the target form 630 with the source form 632. This is important because, in some situations, deleting part of the target form 630 can cause the target form 630 to be invalid, based on the schema governing the target form 630. In some other situations, inserting and then deleting could also cause the target form 630 to be invalid if the schema governing the target form 630 does not allow insertion of the portion of the source form 632 while the portion of the target form 630 still exists.
[0064] The do-not-import annotator 708 can be applied, as part of the transformation file 634, on the source form 632 to annotate that form. This annotation includes instructions to refrain from importing a portion of the source form 632 into a portion of the target form 630. These instructions, for hierarchical forms, can direct the import engine 624 to refrain from importing a node (or its data) of the source form 632 into a node (or any node) of the target form 630.
[0065] The correspondence annotator 710 can be applied, as part of the transformation file 634, on the source form 632 to annotate that form. This annotation includes instructions to associate or correspond a portion of the source form 632 (such as data) to a portion of the target form 630. These instructions, for hierarchical forms, can direct the import engine 624 to correspond a set of nodes of the source form 632 to one or more nodes of the target form 630. The correspondence annotator 710 can be used in conjunction with other annotations, such as the insert, merge, delete, and replace annotations 702, 704, 706, and 707. By so doing, the system 600 can learn what part of the target form 630 corresponds to the part of the source form 632 having the insert, merge, delete, and replace annotations 702, 704, 706, and 707. The instruction within the correspondence annotation informs the system 600 as to what part or data of the target form 630 to insert the source data into, replace with the source data, merge the source data into, or delete, for instance.
[0066] The singular-correspondence annotator 712 can be applied, as part of the transformation file 634, on the source form 632 to annotate that form. This annotation includes instructions to associate or correspond a portion of the source form 632 (such as data) to a portion of the target form 630. These instructions, for hierarchical forms, can direct the import engine 624 to correspond a particular node of the source form 632 to a node of the target form 630. The singular-correspondence annotator 712 can be used in conjunction with other annotations, such as the insert, merge, delete, and replace annotations 702, 704, 706, and 707. By so doing, the system 600 can learn what part of the target form 630 corresponds to the part of the source form 632 having the insert, merge, delete, or replace annotations 702, 704, 706, and 707. The instruction within the singular-correspondence annotation informs the system 600 as to what part or data of the target form 630 to insert the source data into, replace with the source data, merge the source data into, or delete, for instance.
[0067] The ordering annotator 714 can be applied, as part of the transformation file 634, on the source form 632 to annotate that form. This annotation includes instructions to associate or correspond a portion of the source form 632 (such as data) before or after a portion of the target form 630. These instructions, for hierarchical forms, can direct the import engine 624 to associate a particular node of the source form 632 before or after a particular node of the target form 630. The ordering annotator 714 can be used in conjunction with other annotations, such as the insert annotation 702. By so doing, the system 600 can learn where in the target form 630 data of the source form 632 corresponds. The instruction within the ordering annotation informs the system 600 where in the target form 630 to insert the source data, for instance.
[0068] Exemplary Methods
Importing Generally
[0069] FIG. 8 shows a flow diagram 800 for importing data from one electronic form into another electronic form.
[0070] This and the following flow diagrams are illustrated as series of blocks representing operations or acts performed by the system 600. These diagrams may be implemented in any suitable hardware, software, firmware, or combination thereof. In the case of software and firmware, they represent sets of operations implemented as computer-executable instructions stored in memory and executable by one or more processors.
[0071] The method set forth in the flow diagram 800 will be described in part through the example set forth in FIGS. 1 to 5 . The example of FIGS. 1 to 5 cover two substantially similar electronic forms, though the flow diagram 800 can be used with forms that are not substantially similar. The example of FIGS. 1 to 5 is used to aid the reader in understanding an implementation of the method, and is not intended to limit the applicability of the method.
[0072] FIGS. 1 through 5 set forth an example of what a user selecting the forms can see on the screen 604 of the display 602. These displays can be presented in parallel with the method shown in the flow diagram 800 being performed by the system 600.
[0073] In FIG. 1 , for example, the system 600 displays an example of the target form 630, here the manager's report 102, which was chosen by a user. With this form shown, the user is enabled by the system 600 to select a form to merge into the target form 630 (here the manager's report 102).
[0074] Prior to or as part of block 802, the user selected the target form 630, in this example the manager's report 102 of FIG. 1 . The target form 630 does not have to be shown to the user, but doing so can aid the user by assuring the user that the target form 630 is the one that the user intended to select. In one implementation, the target form 630 is selected by someone or something other than the user, such as the computer 608 selecting it based on various events occurring. In another implementation, the target form 630 is selected by a remote computer or a remote user.
[0075] At block 802, the system 600 receives a request to import data from the source form 632 to the target form 630. The system 600 can receive this request from a user through the user interface 628 and the user-input device 606. The system 600 can also receive the request remotely, such as from a remote computer or computer system, or from the computer 608 on occurrence of an event. These events include a certain amount of time elapsing, a date arising, the source form 632 being submitted after entry of data into the source form 632, and the like.
[0076] Continuing the ongoing example, FIG. 2 shows the user selecting to aggregate forms by selecting the aggregate forms selection shown at 204 of the options menu 202. After receiving this selection to aggregate forms, the system 600 presents various forms from which the user can choose, in this case those forms on the computer's 608 desktop (part of the memory 620).
[0077] To further enable the user's selection, the system 600 presents forms, shown in FIG. 3 , one of which is shown as selected by the user as the target form 630. Here the screen shot 300 shows the user selecting the “Source.xml” form (at the reference numeral 302) to be the source form 632 (here the salesman's report 402). The system 600 can then display the source form 632.
[0078] FIG. 4 sets forth an example of the source form 632, here a “status report” by a salesman. The system 600 does not have to show the source form 632 selected by the user. In this example the system 600 does so to assure the user that the source form 632 selected was the form intended to be selected by the user.
[0079] FIGS. 1 to 4 show what the user can, in one implementation, see as part of the block 802.
[0080] Once the user has selected to aggregate the source form 632 into the target form 630 (shown in FIG. 3 ), the system 600 proceeds to block 804.
[0081] At block 804, the system 600 determines a schema governing the source form 632 (the “source schema”) and a schema governing the target form 630 (the “target schema”). This can be performed by the system 600 without user interaction.
[0082] The target schema can be determined in various ways. In one implementation, the schema of the target form 630 is known because the target form 630 is currently loaded on the computer 608 (in the memory 620). Thus, in this implementation the target schema is determined simply by loading the target form 630. In another implementation, the system 600 accesses files of or the target form 630 to determine the target schema.
[0083] The system 600 can determine the source schema in various ways. In each of these ways the system 600 can set a particular schema as being the source schema if the system 600 determines that the particular schema is capable of governing the source form 632.
[0084] In one implementation, the system 600 determines the source schema by comparing the source form 632 with the target schema. By so doing, the system 600 determines if the target schema is capable of governing the source form 632.
[0085] In another implementation, the system 600 compares the source form 632 with multiple or all schemas known by or accessible by the import engine 624. By so doing, the system 600 determines if a particular schema is capable of governing the source form 632.
[0086] In another implementation, the system 600 compares parts of the source form 632 against parts or all of various schemas known by or accessible by the import engine 624. By so doing, the system 600 determines what parts of the source form 632 are capable of being governed by one or more known or accessible schemas.
[0087] In another implementation, the system 600 determines the source schema by first comparing the source form 632 with the target schema as above and then proceeding as further described. If the source form 632 is not capable of being governed by the target schema, the system 600 then compares the source form 632 with known or accessible schemas, as above. If the source form 632 is not capable of being governed by these schemas, the system 600 then compares parts of the source form 632 with parts of all or various schemas known or accessible by the import engine 624, as above. In this way, the system 600 determines the source schema or one or more source schemas that are capable of governing parts of the source form 632.
[0088] In another implementation, the system 600 determines the source schema by analyzing the structure of the source form 632. This analysis can include determining what language the form is written in, such as XML. The system 600, by knowing the language of the form and its structure, can compare it to various schemas known to or accessible by the import engine 624. If a particular schema allows for the structure of the form, the system 600 can determine the source schema and/or the target schema. In this implementation, the import engine 624 accesses a list or other body of information that associates or otherwise maps the source schema to the transformation file 634 for later use.
[0089] In another implementation, the system 600 accesses a list of schemas associated with the target form 630. This list of schemas can include the target schema and other schemas. The system 600 compares each of these listed schemas with the source form 632. The system 600 can do so by comparing the structure of the source form 632 or by attempting to govern the source form 632 by the rules set forth in the schema. If the system 600 determines that a schema from the list is capable of governing the source form 632, the system 600 can set this schema as the source schema.
[0090] In one implementation, if the system 600 determines that more than one schema from the list is capable of governing the source form 632, the system can set the first schema found to be capable of governing the source form 632 as the source schema. The system 600 can also set the target schema as the source schema if the target schema is capable of governing the source form 632.
[0091] In yet another implementation, the system 600 accesses a file associated with the source form 632 or the target form 630. This file can include a reference to the schema, such as a hyperlink, or the schema itself.
[0092] In still another implementation, the system 600 uses information learned about the source form 632 to build a schema from available schemas or schema fragments that are capable of governing parts of the source form 632.
[0093] At block 806 the system 600 determines a transformation file. The system 600 can do so with the aid of the source schema, such as by the transformation file being associated with the source schema. The system 600, in one implementation, accesses a list of schemas and transformation files associated with each of the listed schemas. The system 600 can do so when one or more transformation files are pre-made and associated with the target form 630 and various potential source schemas.
[0094] In another implementation, the system 600 accesses a file or metadata (such as information in a header) associated with or in the source form 632 to determine the correct transformation file to use. This file or metadata can include a reference to the transformation file, such as a hyperlink, or the transformation file itself.
[0095] At block 808, if a transformation file is determined, the system 600 proceeds along the “Yes” path to block 810 and annotates the source form 632. If no transformation files are determined then the system 600 proceeds along the “No” path to block 812.
[0096] At block 812 the system 600 determines if the target form 630 and the source form 632 are similar or dissimilar. For hierarchically structured forms, the system 600 determines if the forms are similar based on the similarity of the source schema and the target schema. This can be performed by the system 600 without user interaction.
[0097] At block 814, if the source schema and the target schema are similar, the system 600 proceeds along the “Yes” path to block 816. In they are not similar, the system 600 proceeds along the “No” path to block 818.
[0098] At block 818 the system 600 rejects the request to import data.
[0099] If the system 600 proceeds to block 816 (without first performing block 810) and thus does not annotate the source form 632, the system 600 can still import data as part of block 816. This is discussed in greater detail below.
[0100] If the system 600 proceeds to block 810, the system 600 can annotate all of the source form 632, just those portions that are governed by the source schema where the source schema is dissimilar to the target schema, or somewhere in between. In one implementation, the system 600 annotates all or portions of the source schema by transforming the all or a portion by applying an appropriate transformation file (such as the transformation file 634). If the source schema is written in XML, the transformation file 634 is compatible, such as by being written in XSLT.
[0101] At block 810 the system 600, through the transformation engine 626, annotates the source form 632. The system 600 annotates the source form 632 to aid the import engine 624 in importing data.
[0102] The system 600 annotates the source form 632 to include instructions. These instructions are used by the import engine 624 to aid the import engine 624 in importing data from the source form 632 into the target form 630.
[0103] The system 600 can annotate the source form 632 without user interaction. The system 600 can also annotate the source form 632 whether or not the source schema and the target schema are substantially similar or dissimilar.
[0104] As shown in the flow diagram 800, the system 600 annotates the source form 632 when the source form 632 and the target form 630 are substantially dissimilar. When the source form 632 and the target form 630 are hierarchical, they are substantially dissimilar when the source schema and the target schema are substantially dissimilar.
[0105] The system 600, through the transformation engine 626, annotates the source form 632 by applying the transformation file 634 on the source form 632. The transformation file 634 can be pre-made and accessed as described herein.
[0106] Depending on how the transformation file 634 is built, when the transformation engine 626 applies the transformation file 634, certain portions or even all of the source form 632 is annotated. Thus, if a designer builds the transformation file 634 to annotate certain portions of the source form 632, only those portions are annotated by applying that transformation file 634. These annotations include instructions to the import engine 624, which it uses as set forth herein.
[0107] The annotations also have various effects. They can add instructions that inform the import engine 624 as to how to make data of the source form 632 compatible with the target form 630, for instance. They can also add instructions showing the import engine 624 where to import certain portions of the source form 632 into the target form 630, and the like.
[0108] In one implementation, these annotations include instructions related to the annotator-types 636 set forth in FIG. 7 . The annotator-types 636 can include the insert annotator 702, the merge annotator 704, the delete annotator 706, the replace annotator 707, the do-not-import annotator 708, the correspondence annotator 710, the singular-correspondence annotator 712, and the ordering annotator 714.
[0109] In this implementation, annotations added to the source form 632 can include instructions to: insert a node or data within a node of the source form 632 as a child node to a parent node in the target form 630; merge attributes associated with data of the source form 632 with attributes associated with a node of the target form 630; replace one or more nodes of the target form 630 with a node of the source form 632; delete one or more nodes of the target form 630; not import a node, portion, or data of the source form 632 into the target form 630; associate a set of nodes of the target form 630 with one or more nodes associated with data of the source form 632; associate a particular node of a set of nodes of the target form 630 with a node or other data of the source form 632; and associate a node of the source form 632 to a particular point in an order of a set of nodes in the target form 630.
[0110] The annotators 710, 712, and 714 associate data (e.g., one or more nodes) of the source form 632 with data (e.g., one or more nodes) of or locations within the target form 630. Thus, they are used in conjunction with the insert, merge, delete, and replace annotators 702, 704, 706, and 707 when these annotators need to be associated with some node or location of the target form 630.
[0111] In one implementation, the source form 632 and the target form 630 include code written in XML. In this implementation, the transformation file 634 includes code written in XSLT.
[0112] At block 816, the importation engine 624 of the system 600 imports data from the source form 632 into the target form 630. The import engine 624 can import data from some or all of the data of the source form 632 into the target form 630. This data can include data within a node of a hierarchical source electronic form, all of the node of a hierarchical source electronic form, a portion of a hierarchical or non-hierarchical source electronic form, and the like. The data (or parts of the data) of the source form 632 can be presented to a user visually as the contents of a data-entry field, as a non-entry field, as text (including text presented with HTML), in a table, or in many other ways known in the art.
[0113] The import engine 624 can import data with or without annotations or use of a transformation file. How it imports data without annotations or use of the transformation file 634 is set forth in greater detail in FIG. 13 and its description. How it imports data with or without annotations or use of the transformation file 634 is set forth in greater detail in FIG. 9 and its description.
Importing Data
[0114] As stated above, the system 600 annotates the source form 632 at block 810 of FIG. 8 . Following block 810 of FIG. 8 , the system 600 (through the import engine 624) imports data from the source form 632 into the target form 630.
[0115] If the source form 632 includes annotations (as is the case when the system 600 performs the actions of block 810), the import engine 624 finds and then follows the annotations. As set forth above, these annotations include instructions that aid the import engine 624 in importing data. In one implementation, the import engine 624 imports data without user interaction, making importing data easy and simple for users.
[0116] FIG. 9 sets forth a flow diagram 900 for importing data from the source form 632 into the target form 630. The flow diagram 900 is an exemplary implementation of block 816 of FIG. 8 where the source form 632 and the target form 630 are hierarchical and arranged into nodes. The flow diagram 900 allows for importing of data with and without annotations.
[0117] As part of the flow diagram 900, the system 600 analyzes nodes of the source form 632. The system 600 can start with the first node (a root node) and proceed to analyze every node of the source form 632.
[0118] At block 902, the system 600 (primarily through the import engine 624), begins its analysis with the root node of the source form 632. As shown in the flow diagram 900, the system 600 analyzes this node and then proceeds to other nodes.
[0119] At block 904, the system 600 reads the current source node (which can be the root node or some other node) to find an annotation, if any. The system 600 can determine if the node includes an annotation by distinguishing the annotation from data in the node. In one implementation, annotations are labeled with a tag to distinguish them from the data of the source form 632. This tag can reference a private XML namespace readable by the import engine 624.
[0120] In some cases there is more than one annotation. In these cases, the system 600 reads all of the annotations before proceeding to block 906. As set forth below, some annotations, such as an annotation instructing the system to insert data, accompany another annotation instructing the system 600 as to where in the target form 630 the data should be inserted.
[0121] At block 906, if no annotation is found, the system 600 proceeds along the “No” path to block 908. If an annotation is found, the system 600 proceeds along the “Yes” path to block 910.
[0122] At block 908, the system 600 imports data (or ignores the data) based on various factors, but does so without use of annotations. Thus, while the import engine 624 can use instructions within annotations to aid it in importing data, all of the source form 632 does not have to be annotated. Some parts can be without annotations. In one implementation, the import engine 624 imports data without use of any annotations (described below). In others, the import engine 624 imports data for some parts that have annotations and some that do not, as shown in the flow diagram 900.
[0123] At block 910, the system 600 determines which annotation(s) were found in block 906.
[0124] As set forth below, the instructions that the import engine 624 follows can direct the import engine 624 as to what node of the source form 632 is to be imported, where in the target form 630 it is to be imported, and how it is to be imported. These instructions can also aid the import engine 624 in conforming the node of the source form 632 to the schema of the target form 630. They can also aid the import engine 624 in determining how much of the data of a source node is to be imported into the target form 630.
[0125] At blocks 912, 914, and 916, the system 600 follows the instructions to insert, delete, or replace data as set forth in the description of the insert annotator 702, the delete annotator 706, and the replace annotator 707 relating to FIG. 7 . The system 600 follows the instructions to perform the action on the current source node.
[0126] For insertion and replacing of data, the instructions include reference to a node of the target form 630 showing where to insert or replace data in the target form 630 with data from the current source node. For both inserting and replacing data, this reference can include instructions from the correspondence annotator 710 or the singular-correspondence annotator 712, which set forth where in the target form 630 the insertion or replace is to be performed. This is set forth in greater detail as part of the discussion of FIG. 7 .
[0127] For inserting data, the reference can also include instructions from the ordering annotator 714, which aids the system 600 in inserting the current source node at the beginning, end, or somewhere in the middle of a set of nodes of the target form 630. This is also described in greater detail in FIG. 7 and elsewhere herein.
[0128] Following blocks 912, 914, and 916, the system 600 proceeds to block 922.
[0129] At block 922, the system 600 continues on to perform the actions of block 904, but for a new source node of the source form 632. This new source node is the next node in the source form 632 that is not a child node of the source node just analyzed.
[0130] In one implementation, if the current source node has a child, the system 600 skips over the child and proceeds to analyze the next right sibling of the current source node. If the current source node does not have a next right sibling, the system 600 proceeds to analyze the next right sibling of the parent of the current source node, and so on. If there are no other nodes to be analyzed (some children are not analyzed as part of block 922), the system 600 stops analysis of nodes of the source form 632.
[0131] At blocks 918 and 920, the system 600 follows the instructions to merge data or ignore data. The system 600 can do so as set forth in the description of the merge annotator 704 or the do-no-import annotator 708 relating to FIG. 7 . The system 600 follows the instructions to perform the action on the current source node. For merging data, the instructions include reference to a node of the target form 630 showing where to merge data in the target form 630 from the current source node. This reference can include instructions from the singular-correspondence annotator 712, as described in greater detail above.
[0132] Following blocks 918 or 920, the system 600 proceeds to block 924.
[0133] At block 924, the system 600 continues on to perform the actions of block 904, but for a new source node of the source form 632. This new source node is the next node in the source form 632, regardless of whether that node is a child of the source node just analyzed.
[0134] In one implementation, if the current source node has a child node, the system 600 proceeds to analyze the child. Otherwise, the system 600 proceeds to the next right sibling of the current source node or the next right sibling of the parent of the current source node, and so on up to the root node. If there are no other nodes to be analyzed (some children are not analyzed, based on block 922), the system 600 stops analysis of nodes of the source form 632.
[0135] Thus, by following the flow diagram 900, the system 600 can analyze and import data from (if appropriate) each node of the source form 632.
[0136] To aid in this discussion of importing data with annotations, the following exemplary forms are described.
[0137] FIG. 10 sets forth an exemplary screen shot 1000 showing an example of the target form 630, here an action report 1002. This action report 1002 contains data-entry fields, some of which contain data. The action report 1002 includes a reference 1004 showing that certain data-entry fields are “Action Items”, which can indicate presence of a node of the action report 1002 or otherwise. Data-entry fields of interest include: an action title field 1006; an action owner field 1008; an action priority field 1010; an action progress field 1012; and an action due date field 1014. The action report 1002 has a substantially dissimilar schema to the exemplary source form 632 shown in FIG. 11 .
[0138] FIG. 11 sets forth an exemplary screen shot 1100 showing an example of the source form 632, here a team report 1102. The team report 1102 contains data-entry fields, some of which contain data. The team report 1102 includes a reference 1104 showing that certain data-entry fields are related to a “Send Team Update”. Within this area of the team report 1102, certain data-entry fields are shown. These include a team update manager field 1106, a team update priority field 1108, a team update status field 1110, and a team update due date field 1112. Further, the team report 1102 includes a reference 1114 showing that certain data-entry fields are related to a “Define Sales Goals”. Within this area of the team report 1102, certain data-entry fields are shown. These include a team goal owner field 1116, a team goal priority field 1118, a team goal status field 1120, and a team goal due date field 1122.
[0139] This team report 1102 is governed by a schema that is substantially dissimilar from the schema governing the action report 1002.
[0140] For the purposes of this example, the system 600 acts as shown in the blocks 802, 804, 806, 808, 810 and 816 of the flow diagram 800. At block 806, the system 600 determines that a transformation file exists for the schema of the team report 1102.
[0141] At block 810, the system 600 annotates the source form 632, here the team report 1102. The system 600 annotates the team report 1102 by applying the transformation file 634, in this case one in that is designed to annotate source electronic forms that can be governed, at least in part, by a source schema capable of governing the team report 1102. In this example, the transformation file 634 was designed to transform this source schema. At block 816, then, the system 600 imports data into the target form 630 (here the action report 1002).
[0142] FIG. 12 sets forth an exemplary screen shot 1200 showing an example of the target form 630, here an aggregate action report 1202, after data from the team report 1102 has been imported into the action report 1002. As shown in FIG. 12 , the aggregate action report 1202 includes the fields shown in FIG. 10 (the action title field 1006, the action owner field 1008, the action priority field 1010, the action progress field 1012, and the action due date field 1014) as well as the imported data, some of which is shown in the fields of: the team update manager field 1106; the team update priority field 1108; the team update status field 1110; the team update due date field 1112; the team goal owner field 1116; the team goal priority field 1118; the team goal status field 1120; and the team goal due date field 1122.
[0143] These examples of the source form 632 and the target form 630 show that the import engine 624, following the instructions added by the transformation file 634, can import data (such as nodes) and information within it (such as text, numbers, and the like) into an electronic form having a substantially different schema. This example also shows that parts of the source form 632 can be imported, rather than all of it, based on the transformation file 634. Thus, a designer can, by building the transformation file 634 in particular ways, have parts of a source electronic form be imported into a target electronic form, leaving other parts not of significance to the designer un-imported.
Importing Data Without Annotations
[0144] As set forth in the flow diagram 900, if a current source node of the source form 632 does not include an annotation, the system 600 proceeds to block 908, as mentioned above. The system 600 can follow the flow diagram 900 as one implementation of the block 816 of FIG. 8 , even in cases where the source form 632 contains no annotations. In these cases the system 600 can follow blocks 902, 904, 906, and 908, without following the other blocks. In another implementation where the source form 632 contains no annotations, the system 600 follows the flow diagram 1300 for each portion of the source form 632 until completion.
[0145] FIG. 13 shows a flow diagram 1300 for importing data without an annotation. This flow diagram 1300 can be used by the system 600 for hierarchically arranged forms when a node of the source form 632 does not include an annotation or when no node of the source form 632 includes annotations, such as when the transformation file 634 has not been applied on the source form 632. The flow diagram 1300 is also an exemplary implementation of the block 908 of FIG. 9 , though blocks 904 and 906 are performed after blocks 1330 and 1328 in this implementation.
[0146] At block 1302, the system 600 (primarily through the import engine 624) analyzes, one-at-a-time or otherwise, nodes of the source form 632 and nodes of the target form 630 in order to associate them. The system 600 can perform this analysis for electronic forms without the electronic forms containing annotations. The system 600 can also perform this analysis on un-annotated nodes of an otherwise annotated source electronic form or on nodes of a source electronic form that are similar to a target electronic form, even if parts of the source electronic form are not similar. In so doing, the system 600 can enable importing of data without a user needing to build or use the transformation file 634 for substantially similar nodes. It can do so even if many of the nodes if the source form 632 and the target form 630 are not substantially similar. In one implementation, the system 600 can associate nodes and import data without user interaction.
[0147] As part of block 1302, the system 600 can perform the actions set forth in blocks 1304, 1306, 1308, 1310, and 1312.
[0148] At block 1304, the system 600 determines if a schema fragment related to a particular node of the source form 632 (the “source node”) is substantially similar to a schema fragment related to one of the target form's 630 nodes (the “target node”). In this context, a schema fragment can be any part of the form's schema that shows, or any schema that aids the system 600 in determining, how a node of the form is or can be structured or is or can be governed. Thus, a schema fragment can be a construct based on the form's entire schema, a part of the form's entire schema, or other structural or governance information about a node of the form.
[0149] An example of how this can be performed with hierarchically organized electronic forms is set forth in the context of two electronic forms shown in FIG. 14 below. The example of FIG. 14 relates to the salesman's report 402 and the manager's report 102, each having substantially similar schemas. The example of FIG. 14 is used to aid the reader in understanding an implementation of the method shown in the flow diagram 1300, and is not intended to limit the applicability of the method.
[0150] FIG. 14 sets forth a simple, graphical example of how two electronic forms that are hierarchically structured can be organized into nodes. The source form 632 in this example is a hierarchically arranged, simplified, and structurally (though not, for purposes of the discussion relating to FIG. 13 , schematically) reorganized version of the salesman's report 402 of FIG. 4 , referenced and referred to as a salesman's structure 1400. It is reorganized by where in the salesman's report 402 the data and their corresponding nodes reside. For instance, in FIG. 4 the salesman's summary 418 is presented prior to the salesman's this period data-entry fields 426, 428, and 430 in the salesman's status report 402. In the salesman's structure 1400, however, the nodes related to the salesman's summary 418 (a source summary parent node 1414 and a source summary node 1416) are arranged after nodes related to the this period data-entry fields 426, 428, and 430.
[0151] The target form 630 in this example is a hierarchically arranged and simplified version of the manager's report 102 of FIG. 1 , referenced and referred to as a manager's structure 1402.
[0152] The structure 1400 includes a source root node 1404, a source this period node 1406, a mu node 1408, a nu node 1410, a xi node 1412, the source summary parent node 1414, the source summary node 1416, a source last period node 1418, an alpha node 1420, a beta node 1422, and a gamma node 1424.
[0153] The structure 1402 includes a target root node 1426, a target summary parent node 1428, a target summary node 1430, a summary last period node 1432, an uno node 1434, a dos node 1436, a target this period node 1438, a red node 1440, a green node 1442, a blue node 1444, a yellow node 1446, and a purple node 1448.
[0154] With these structures set forth, the discussion returns to the flow diagram 1300.
[0155] At block 1306, the system 600 proceeds along the “No” path to block 1308 if the schema fragment of the source node is not substantially similar to a schema fragment of the target node that was just analyzed. If they are substantially similar, the system 600 proceeds along the “Yes” path to block 1310.
[0156] As shown by example below, if one target node is not substantially similar to the source node being analyzed, the system 600 can proceed to analyze every node of the target form 630 until the system 600 finds one that is substantially similar or until all of the nodes of the target form 630 have been analyzed.
[0157] At block 1308, if the system 600 has analyzed every target node (every node of the target form 630) against the source node (using each node's schema fragment) and has not found a target node that is substantially similar, the system 600 proceeds to block 1312, after which it proceeds to block 1304 and analyzes a new source node. If not, it proceeds directly back to block 1304.
[0158] At block 1312, the system 600 does not associate the source node with any target node. Also, at block 1312 the system 600 can ignore the source node and not import data from the source node.
[0159] Returning to the discussion of block 1302, using the structures of FIG. 14 as examples, assume that the system 600 first analyzes the mu node 1408 (through analyzing its schema fragment). Assume also that the system 600 analyzes nodes of the target form 630 that contain numerical or textual data in descending order. By so doing, the system 600 first analyzes the mu node 1408 and the target summary node 1430, shown by a dashed line. Each line, which will be discussed in turn, represents an attempt by the system 600 to determine that the nodes connected by the lines are substantially similar. The dashed lines represent a determination by the system 600 that the nodes are not substantially similar. Solid lines represent a determination by the system 600 that the nodes are substantially similar, and thus can be associated with each other.
[0160] Thus, continuing the example, the system 600, as part of block 1304, determines that the schema fragment of the mu node 1408 and the schema fragment of the target summary node 1430 are not substantially similar. The system 600 then proceeds to block 1308, where the system 600 then proceeds back to block 1304 because all of the nodes of the target form 630 have not been found to not be substantially similar to the mu node 1408.
[0161] At block 1304, the system 600 determines that the schema fragment of the mu node 1408 and the schema fragment of the uno node 1434 are not substantially similar. Thus, the system 600 again returns to block 1304.
[0162] Likewise, at block 1304 the system 600 determines that the schema fragment of the mu node 1408 and the schema fragment of the dos node 1436 are not substantially similar. Thus, the system 600 again returns to block 1304.
[0163] Again at block 1304, the system 600 determines the similarity of the schema fragment of the mu node 1408 with another node of the manager's structure 1402. Here, though, the system 600 determines that the schema fragment of the mu node 1408 and the schema fragment of the red node 1440 are substantially similar. As such, the system 600 proceeds to block 1310.
[0164] At block 1310, the system 600 maps the source node of the source form 632 to the target node of the target form 630. In cases where no node of the target form 630 was substantially similar, the system 600 can cease analysis of the source node and proceed to another source node (another node of the source form 632) until all substantially similar nodes are found before proceeding to block 1314. In another implementation, the system 600 proceeds to block 1314 and on to import data based on the current source node and then return to block 1304 later, if needed, as set forth in the flow diagram 1300 (see blocks 1328 and 1330).
[0165] In the ongoing example, the system 600 maps the mu node 1408 to the red node 1440. In one implementation, the system 600 maps nodes using XPath expressions. An XPath expression is a way of describing the location of a certain node or of a set of nodes in an XML document. The description is made by specifying the full (starting from the root) or relative (starting from a given node) path(s) to the node or the set of nodes. More on XPath expressions generally can be found at http://www.w3.org/TR/xpath.
[0166] The system 600 can then continue on to block 1314 or back to 1304 until the nodes of the source form 632 have been analyzed. In the ongoing example, the system 600 returns to block 1304.
[0167] By further way of example, assume that the system 600, once the mu node 1408 has been mapped to the red node 1440 at block 1310, proceeds to analyze the nu node 1410 and the xi node 1412 and also maps them to the red node 1440 (not shown with lines).
[0168] Continuing this example, the system 600 analyzes the source summary node 1416 and the target summary node 1430, shown by a solid line. At block 1304, the system 600 determines that the schema fragment of the source summary node 1416 and the target summary node 1430 are substantially similar. As such, the system 600 proceeds to block 1310 to map these nodes together.
[0169] Also by further way of example, assume that the system 600 then proceeds to analyze the alpha node 1420 of the structure 1400.
[0170] Thus, continuing the example, the system 600, as part of block 1304, determines that the schema fragment of the alpha node 1420 and the schema fragment of the target summary node 1430 are not substantially similar. The system 600 then proceeds to block 1308, where the system 600 then proceeds back to block 1304 because all of the nodes of the target form 630 have not been found to not be substantially similar to the alpha node 1420.
[0171] Returning to block 1304, the system 600 determines that the schema fragment of the alpha node 1420 and the schema fragment of the uno node 1434 are substantially similar. As such, the system 600 proceeds to block 1310 to map these nodes together.
[0172] At block 1314 the system 600 determines the bounding behavior of the target node's parent node. The system 600 determines the bounding behavior from the target schema or the target node's or target node's parent's schema fragment. The bounding behavior gives the system 600 information about how and what kind of importation can be appropriate.
[0173] At block 1316, if the target node's parent node is unbounded or bound to a number greater than one, the system 600 proceeds along the “Yes” path to block 1318. If not, the system 600 proceeds along the “No” path to block 1320.
[0174] At block 1318, the system 600 inserts the source node's data as a sibling node to the target node. In FIGS. 5 and 14 , various examples of this can be seen. In FIG. 5 , the data associated with some of the data-entry fields of the salesman's report 402 are represented to be inserted as siblings. While not shown, the nodes containing the data shown in the data-entry fields are inserted as sibling nodes. FIG. 5 shows insertion, represented as a new entry or data-entry field, of the salesman's last period fields 420, 422, and 424 and the salesman's this period fields 426, 428, and 430.
[0175] FIG. 14 shows six different nodes of the salesman's structure 1400, each of which can be represented as data-entry fields in FIG. 4 and are inserted as sibling nodes. Each of these source nodes, the mu node 1408, the nu node 1410, the xi node 1412, the alpha node 1420, the beta node 1422, and the gamma node 1424, have been mapped to a substantially similar target node. The mu node 1408, the nu node 1410, and the xi node 1412, have been mapped to the red node 1440. Thus, the target node's parent node is the manager's this period node 1438.
[0176] Assume for this example that the manager's this period node 1438 is unbounded. Thus, at block 1318, the system 600 inserts as sibling nodes to the red node 1440 the mu node 1408, the nu node 1410, and the xi node 1412. An example of insertion is shown in FIG. 5 by the additional data-entry fields with data being added to the manager's report 102 (shown in the aggregate manager's report 502).
[0177] Likewise, the alpha node 1420, the beta node 1422, and the gamma node 1424 have been mapped to the uno node 1434. Also this example assumes that the manager's last period node 1432 is unbounded, and thus can contain an unlimited number of child nodes. Thus, at block 1318, the system 600 inserts as sibling nodes to the uno node 1434 the alpha node 1420, the beta node 1422, and the gamma node 1424. An example of insertion is shown in FIG. 5 by the additional data-entry fields with data being added to the manager's report 102 (shown in the aggregate manager's report 502).
[0178] After block 1318, the system 600 proceeds to block 1328.
[0179] At block 1328, the system 600 continues on to perform the actions of block 1302, but for a new source node of the source form 632 (unless the system 600 is performing the flow diagram 1300 as an implementation of block 908 of the flow diagram 900, in which case the system 600 continues to block 904 with the new source node). This new source node is the next node in the source form 632 that is not a child node of the source node just analyzed.
[0180] In one implementation, if the current source node has a child, the system 600 skips over the child and proceeds to analyze the next right sibling of the current source node. If the current source node does not have a next right sibling, the system 600 proceeds to analyze the next right sibling of the parent of the current source node, and so on. If there are no other nodes to be analyzed (some children are not analyzed as part of block 1328), the system 600 stops analysis of the source form 632.
[0181] At block 1320, if the target node does not include rich text, the system 600 proceeds along the “No” path to block 1322. If it does, the system 600 proceeds along the “Yes” path to block 1324.
[0182] At block 1322, the system 600 merges data within the source node into the target node. This data can include attributes or top level parts of the source node's data. As set forth in the following example, this merging can include merging of attributes from the source node into the target node. Assume, for instance, that the target node is:
-
- [0183] <element a1=“a1 data” a2=“a2 data”>original element data</element>
And the source node is: - [0184] <element a1=“new a1 data” a3=”new a3 data>new element data</element>
Then, the aggregated target node will include the attributes of the source node, as shown here: - [0185] <element a1=“new a1 data” a2=“a2 data” a3=”new a3 data>original element data</element>
- [0183] <element a1=“a1 data” a2=“a2 data”>original element data</element>
[0186] At block 1330, the system 600 continues on to perform the actions of block 1302, but for a new source node of the source form 632 (unless the system 600 is performing the flow diagram 1300 as an implementation of block 908 of the flow diagram 900, in which case the system 600 continues to block 904 with the new source node). This new source node is the next node in the source form 632, regardless of whether that node is a child of the source node just analyzed.
[0187] In one implementation, if the current source node has a child node, the system 600 proceeds to analyze the child. Otherwise, the system 600 proceeds to the next right sibling of the current source node or the next right sibling of the parent of the current source node, and so on up to the root node. If there are no other nodes to be analyzed (some children are not analyzed, based on block 1328), the system 600 stops analysis of the source form 632.
[0188] At block 1324, if the target node contains rich text, the system 600 appends data of the source node to data of the target node.
[0189] FIG. 5 shows an example of data from a source node being appended to a target node. In FIG. 5 , data shown in the salesman's summary field 418 is appended to summary field 118 of the manager's report 102. This appending (also called a “concatenation”) is shown with rich text of the data of the source node added into the data-entry field, seen in FIG. 5 at reference 504.
[0190] Continuing the above example, the source summary node 1416 is associated with (via mapping, in this case) the target summary node 1430. Assume, for this example, that the target summary parent 1428, which is the parent of the target summary node 1430, is bounded to one occurrence of a child node. The only child node allowed is the target summary node 1430. The system 600, using this information, will not attempt to insert the source summary node 1416 into the target form 630 (such as by inserting it as a sibling node to the target summary node 1430). Instead, the system 600 appends rich text data within the source summary node 1416 into the target summary node 1430.
[0191] After completing block 1324, the system 600 proceeds to block 1328, described above.
[0192] A Computer System
[0193] FIG. 15 shows an exemplary computer system that can be used to implement the processes described herein. Computer 1542 includes one or more processors or processing units 1544, a system memory 1546, and a bus 1548 that couples various system components including the system memory 1546 to processors 1544. The bus 1548 represents one or more of any of several types 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. The system memory 1546 includes read only memory (ROM) 1550 and random access memory (RAM) 1552. A basic input/output system (BIOS) 1554, containing the basic routines that help to transfer information between elements within computer 1542, such as during start-up, is stored in ROM 1550.
[0194] Computer 1542 further includes a hard disk drive 1556 for reading from and writing to a hard disk (not shown), a magnetic disk drive 1558 for reading from and writing to a removable magnetic disk 1560, and an optical disk drive 1562 for reading from or writing to a removable optical disk 1564 such as a CD ROM or other optical media. The hard disk drive 1556, magnetic disk drive 1558, and optical disk drive 1562 are connected to the bus 1548 by an SCSI interface 1566 or some other appropriate interface. The drives and their associated computer-readable media provide nonvolatile storage of computer-readable instructions, data structures, program modules and other data for computer 1542. Although the exemplary environment described herein employs a hard disk, a removable magnetic disk 1560 and a removable optical disk 1564, it should be appreciated by those skilled in the art that other types of computer-readable media which can store data that is accessible by a computer, such as magnetic cassettes, flash memory cards, digital video disks, random access memories (RAMs), read only memories (ROMs), and the like, may also be used in the exemplary operating environment.
[0195] A number of program modules may be stored on the hard disk 1556, magnetic disk 1560, optical disk 1564, ROM 1550, or RAM 1552, including an operating system 1570, one or more application programs 1572 (such as the import engine 624), other program modules 1574, and program data 1576. A user may enter commands and information into computer 1542 through input devices such as a keyboard 1578 and a pointing device 1580. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are connected to the processing unit 1544 through an interface 1582 that is coupled to the bus 1548. A monitor 1584 or other type of display device is also connected to the bus 1548 via an interface, such as a video adapter 1586. In addition to the monitor, personal computers typically include other peripheral output devices (not shown) such as speakers and printers.
[0196] Computer 1542 commonly operates in a networked environment using logical connections to one or more remote computers, such as a remote computer 1588. The remote computer 1588 may be another personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to computer 1542. The logical connections depicted in FIG. 15 include a local area network (LAN) 1590 and a wide area network (WAN) 1592. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets, and the Internet.
[0197] When used in a LAN networking environment, computer 1542 is connected to the local network through a network interface or adapter 1594. When used in a WAN networking environment, computer 1542 typically includes a modem 1596 or other means for establishing communications over the wide area network 1592, such as the Internet. The modem 1596, which may be internal or external, is connected to the bus 1548 via a serial port interface 1568. In a networked environment, program modules depicted relative to the personal computer 1542, or portions thereof, may be stored in the remote memory storage device. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.
[0198] Generally, the data processors of computer 1542 are programmed by means of instructions stored at different times in the various computer-readable storage media of the computer. Programs and operating systems are typically distributed, for example, on floppy disks or CD-ROMs. From there, they are installed or loaded into the secondary memory of a computer. At execution, they are loaded at least partially into the computer's primary electronic memory. The invention described herein includes these and other various types of computer-readable storage media when such media contain instructions or programs for implementing the blocks described below in conjunction with a microprocessor or other data processor. The invention also includes the computer itself when programmed according to the methods and techniques described herein.
[0199] For purposes of illustration, programs and other executable program components such as the operating system are illustrated herein as discrete blocks, although it is recognized that such programs and components reside at various times in different storage components of the computer, and are executed by the data processor(s) of the computer.
Conclusion
[0200] The above-described system and method enables a user to quickly and easily import data from one electronic form into another electronic form. 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
The invention claimed is:
1. A computer-readable storage medium comprising computer-executable instructions that perform the following when executed by a computer:
determine, without user interaction, a first schema of a first electronic form and a second schema of a second electronic form;
determine, based on the first schema of the first electronic form and the second schema of the second electronic form, that a node of the first electronic form matches a node of the second electronic form;
determine that the first node includes first data including text or rich text data;
determine that the second node includes second data including text or rich text data; and
append the first data included within the node of the first electronic form to the second data within the node of the second electronic form.
2. The computer-readable medium of claim 1, wherein the determination of the first schema includes analysis of a structure of the first electronic form.
3. The computer-readable medium of claim 1, wherein the determination of the first schema includes analysis of a structure of the first electronic form and comparison of the structure with a list of schemas to determine if one of the listed schemas is capable of governing the first electronic form.
4. The computer-readable medium of claim 1, wherein the determination of the first schema includes accessing a file associated with the first electronic form.
5. The computer-readable medium of claim 1, wherein the determination of the second schema includes accessing a file associated with the second electronic form.
6. The computer-readable medium of claim 1, wherein the first electronic form and the second electronic form are written in part with a markup language.
7. The computer-readable medium of claim 1, wherein the first electronic form and the second electronic form are written in part in XML.
8. The computer-readable medium of claim 1, wherein the first data includes information written in a markup language.
9. The computer-readable medium of claim 1, wherein the first data includes information written in XML.
10. The computer-readable medium of claim 1, further comprising:
receive, from a user, a request to import the data from the first electronic form into the second electronic form.
11. A computer-readable storage medium comprising computer-executable instructions that perform the following when executed by a computer:
determine a first schema of a first electronic form and a second schema of a second electronic form;
associate, without user interaction, a node of the first electronic form and a node of the second electronic form if the first schema and the second schema indicate that the two nodes are capable of association;
determine that the node of the first electronic form includes first data including text or rich text data;
determine that the node of the second electronic form includes second data including text or rich text data; and
append, without user interaction and based on the association between the nodes, the first data included within the node of the first electronic form to the second data included in the node of the second electronic form.
12. The computer-readable medium of claim 11, wherein the association includes matching the node of the first electronic form with the node of the second electronic form based on a first schema fragment of the first schema that governs the first electronic form's node and a second schema fragment of the second schema that governs the second electronic form's node indicating that the first electronic form's node and the second electronic form's node are capable of association.
13. The computer-readable medium of claim 11, wherein the association includes the node of the second electronic form being the second electronic form's root node, if the first electronic form's node is not capable of association to every node of the second electronic form other than the root node.
14. The computer-readable medium of claim 11, wherein the association includes associating a plurality of nodes of the first electronic form with a plurality of nodes of the second electronic form.
15. The computer-readable medium of claim 11, wherein the association includes associating a plurality of nodes of the first electronic form with a plurality of nodes of the second electronic form and the append includes appending the data within the plurality of nodes of the first electronic form into the plurality of nodes of the second electronic form.
16. The computer-readable medium of claim 11, wherein the append includes merging attributes of the first electronic form's node with the second electronic form's node if a schema fragment governing the second node contains one or more child nodes but does not allow additional child nodes.
17. The computer-readable medium of claim 11, wherein the first data included within the node of the first electronic form and the second data included within the node of the second electronic form is written in XML.
18. The computer-readable medium of claim 11, wherein the first electronic form and the second electronic form are written in part in XML.
19. The computer-readable medium of claim 11, wherein the first schema and the second schema are written in part in XSD.
20. The computer-readable medium of claim 11, further comprising:
receive, from a user, a request to append data from the first electronic form into the second electronic form.
21. A computer-readable storage medium comprising computer-executable instructions that perform the following when executed by a computer:
determine a correlation between a first node of a first electronic form and a node of a plurality of nodes of a second electronic form based on an annotation to the first node of the first electronic form, the annotation indicating that a first schema fragment of the first node and a second schema fragment of the node of the plurality of nodes of the second electronic form indicate that the first node and the node of the plurality of nodes are capable of association;
analyze a child node of the first node to determine a correlation between the child node and another node of the plurality of nodes of the second electronic form if attributes of the first node are merged into the node of the second electronic form, or
analyze, skipping any child nodes of the first node, a sibling node of the first node to determine a correlation between the sibling node and another node of the plurality of nodes of the second electronic form; and
provide this correlation between the child node and the other node or the sibling node and the other node effective to enable importation of data from the child node or the sibling node into the other node of the second electronic form.
22. A method implemented at least in part by a computer comprising:
determining a first schema of a first electronic form and a second schema of a second electronic form;
associating, without user interaction, a node of the first electronic form and a node of the second electronic form if the first schema and the second schema indicate that the two nodes are capable of association;
determining that the node of the first electronic form includes first data including text or rich text data;
determining that the node of the second electronic form includes second data including text or rich text data; and
appending, without user interaction and based on the association between the nodes, the first data included within the node of the first electronic form to the second data included in the node of the second electronic form.
Patent Citations (552)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4498147(A) | 1985-02-01 | Agnew et al. | Applicant |
| US4514800(A) | 1985-04-01 | Gruner 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 |
| 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 |
| 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 |
| 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 |
| 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 |
| 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 |
| US5778402(A) | 1998-07-01 | Gipson | Applicant |
| US5779372(A) | 1998-07-01 | Jorgensen | 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 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 et al. | 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 |
| 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 |
| 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 |
| 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 et al. | Applicant |
| US6393456(B1) | 2002-05-01 | Ambler et al. | Applicant |
| US6396488(B1) | 2002-05-01 | Simmons 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 | Koppolu et al. | Applicant |
| US6463419(B1) | 2002-10-01 | Kluss | Applicant |
| US6470349(B1) | 2002-10-01 | Heninger et al. | 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 et al. | 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 |
| 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. | Examiner |
| 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. | Examiner |
| 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 |
| 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. | Examiner |
| 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 |
| 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 |
| 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 |
| US6735721(B1) | 2004-05-01 | Morrow et al. | Applicant |
| US6748385(B1) | 2004-06-01 | Rodkin et al. | Applicant |
| US6754874(B1) | 2004-06-01 | Richman | Applicant |
| US6757868(B1) | 2004-06-01 | Glaser et al. | Applicant |
| US6761777(B1) | 2004-06-01 | Bates 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 | Examiner |
| 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 |
| 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. | Examiner |
| US6871220(B1) | 2005-03-01 | Rajan et al. | Examiner |
| 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. | Examiner |
| 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 |
| US7024417(B1) | 2006-04-01 | Russakovsky et al. | Examiner |
| US7032170(B2) | 2006-04-01 | Poulose et al. | 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 |
| US7080325(B2) | 2006-07-01 | Treibach-Heck et al. | Applicant |
| US7086009(B2) | 2006-08-01 | Resnick et al. | Applicant |
| US7088374(B2) | 2006-08-01 | David et al. | Applicant |
| US7103611(B2) | 2006-09-01 | Murthy et al. | Examiner |
| US7106888(B1) | 2006-09-01 | Silverbrook et al. | Applicant |
| US7107282(B1) | 2006-09-01 | Yalamanchi | Applicant |
| US7107521(B2) | 2006-09-01 | Santos | Applicant |
| US7152205(B2) | 2006-12-01 | Day et al. | Applicant |
| US7190376(B1) | 2007-03-01 | Tonisson | Applicant |
| US7191394(B1) | 2007-03-01 | Ardeleanu et al. | Applicant |
| US2001/0007109(A1) | 2001-07-01 | Thomas | 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 | Kieman 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/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/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/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/0152244(A1) | 2002-10-01 | Dean et al. | Examiner |
| 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 | Sjacic 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. | Examiner |
| 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 | Crandell et al. | Applicant |
| US2003/0004951(A1) | 2003-01-01 | Chokshi | Applicant |
| US2003/0007000(A1) | 2003-01-01 | Carison 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/0037303(A1) | 2003-02-01 | Bodlaender et al. | Applicant |
| US2003/0043986(A1) | 2003-03-01 | Creamer et al. | Applicant |
| US2003/0046665(A1) | 2003-03-01 | IIin | Applicant |
| US2003/0048301(A1) | 2003-03-01 | Menninger et al. | 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 | Aj-Azzawe et al. | 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/0120578(A1) | 2003-06-01 | Newman | Applicant |
| US2003/0120651(A1) | 2003-06-01 | Bernstein et al. | Examiner |
| 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/0167277(A1) | 2003-09-01 | Hejlsberg 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/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/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/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/0044961(A1) | 2004-03-01 | Pesenson | Applicant |
| US2004/0044965(A1) | 2004-03-01 | Toyama 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/0146199(A1) | 2004-07-01 | Berkner et al. | Applicant |
| US2004/0163041(A1) | 2004-08-01 | Engel | Applicant |
| US2004/0172442(A1) | 2004-09-01 | Ripley | Examiner |
| 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 | Examiner |
| 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 et al. | Applicant |
| US2004/0205592(A1) | 2004-10-01 | Huang | Applicant |
| US2004/0205605(A1) | 2004-10-01 | Adler et al. | Examiner |
| US2004/0205653(A1) | 2004-10-01 | Hadfield et al. | Applicant |
| US2004/0205671(A1) | 2004-10-01 | Sukehiro 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/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/0015732(A1) | 2005-01-01 | Vedula et al. | Applicant |
| US2005/0027757(A1) | 2005-02-01 | Kiessig et al. | 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. | Examiner |
| 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 |
| US2006/0059434(A1) | 2005-03-01 | Boss et al. | 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 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. | Examiner |
| US2006/0026534(A1) | 2006-02-01 | Ruthfield et al. | Applicant |
| US2006/0031757(A9) | 2006-02-01 | Vincent, III | Examiner |
| US2006/0036995(A1) | 2006-02-01 | Chickles et al. | Applicant |
| US2006/0041838(A1) | 2006-02-01 | Khan | Examiner |
| US2006/0069605(A1) | 2006-03-01 | Hatoun | Applicant |
| US2006/0085409(A1) | 2006-04-01 | Rys et al. | Examiner |
| US2006/0143220(A1) | 2006-06-01 | Spencer, Jr. | Applicant |
| US2002/0035579(A1) | 2006-09-01 | Wang et al. | Applicant |
| US2007/0036433(A1) | 2007-02-01 | Tuetsch | 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 |
| US2003/0192008(A1) | 2007-10-01 | Lee | Applicant |
| EP841615(A2) | 1998-05-01 | Applicant | |
| EP961197 | 1999-12-01 | Applicant | |
| EP1076290(A2) | 2001-02-01 | Applicant | |
| JP63085960 | 1988-04-01 | Applicant | |
| JP401173140 | 1989-07-01 | Applicant | |
| JP3191429 | 1991-08-01 | Applicant | |
| JP4225466 | 1992-08-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 | |
| 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(A1) | 2001-06-01 | Applicant | |
| WO157720 | 2001-08-01 | Applicant |
Non-Patent Literature (111)
- Altova, Inc., “XML Spy 4.0 Manual,” Altova Inc. & Altova GmbH, copyright 1998-2001, Chapters 1, 2, and 6, encompassing pp. 1-17, 18-90, and 343-362.Applicant
- Excel Developer Tip (hereinafter “Excel”), “Determining the Data Type of a Cell”, May 13, 1998, p. 1 (avallable at http://jwalk.com/ss//excel/tips/tip62.htm).Applicant
- 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 page, 1-565.Applicant
- Altova et al. XML Spy, XML integrated Develpoment 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, downlowad 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
- IBM: Stack Algorithm for Extractin Subtree from Serialized Tree, Mar. 1, 1994, TDB-ACC-NONN94033, 3 pages.Applicant
- Laura Acklen & Read Gilgen, “Using Corel Wordperfect 9”, 251-284, 424-434, 583-586 (1998).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
- 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
- Mansfield, “Excel 97 for Busy.People”, Published by Osbourne/Mcgraw-Hill 1997 pp. 48-50.Applicant
- “Microsoft Visual Basic 5.0 Programmer's Guide 1997”; pp. 578-579; Redmond WA 98052-6399.Applicant
- Hans et al., WebSplitter: A Unified XML Framework for Multi-Device Collaborative Web Browsing, 2000, ACM Conference on Cimputer Supported Cooperative Work, 10 pages.Applicant
- Noore A.; “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
- Komatsu, N., et al., “A Proposal on Digital Watermark in Document Image Communications and its Application to Realizing a Signature,” Electronics and Communications in Japan, Part 1: Communications, vol. 73, No. 5, May 1990, pp. 22-33.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
- 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
- Pacheco, X., et al., “Delphi 5 Developer's Guide,” Sams Publishing 1999, Chapter 31, Section: Data Streaming, 6 pages.Applicant
- Clarke, P., “From small beginnings,” Knowledge Management, Nov. 2001, pp. 28-30.Applicant
- Hwang, et al; “Micro-Firewalls for Dynamic Network Security with Distributed Intrusion Detection”, IEEE International Symposium on Network Computing and Applications; 2001; pp. 68-79.Applicant
- Schmid, et al; “Protecting Data from Malicious Software”; 18th Annual Computer Security Applications Conference; 2002; pp. 199-208.Applicant
- Kaiya, et al; “Specifying Runtime Environments and Functionalities of Downloadable Components Under the Sandbox Model”; International Symposium on Principles of Software Evolution; 2000; pp. 138-142.Applicant
- Prevelakis, et al; “Sandboxing Applications”; Proceedings of the FREENIX Track; 2001; pp. 119-126.Applicant
- Tomimori, et al; “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
- Clark, James, Ed.; “XSL Transformation (XSLT) Version 1.0”, Nov. 16, 1999, W3C (MIT, INRIA, Keio), pp. 1-156.Applicant
- Clark, James and Steve Derose, “XML Path Language (XPath) Version 1.0”, Nov. 16, 1999, W3C (MIT, INRIA, Keio), 1-49.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
- Rapaport, L., “Get more from SharePoint”, Transform Magazine, vol. 11, No. 3, Mar. 2002, pp. 13, 15.Applicant
- McCright, J.S., “New Tool Kit to Link Groove with Microsoft SharePoint”, eWeek, Enterprise News & Reviews, Ziff Davis Media Inc., Jul. 29, 2002, 1 page.Applicant
- U.S. Appl. No. 60/209,713, filed Jun. 5, 2000.Applicant
- Richard Scott Hall, “Agent-based Software Configuration and Development,” 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
- Arthur Van Hoff et al., “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
- Netscape Communications Corp., “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
- Linnea Dayton and Jack Davis, “Photo Shop 5/5.5 WOW! Book,” 2000, Peachpit Press, pp. 8-17.Applicant
- Sara Williams and Charlie Kindel, “The Componenet Object Model: A Technical Overview,” Oct. 1994, Microsoft Corp., pp. 1-14.Applicant
- Varlamis et al., “Bridging XML-Schema and relational databases. A system for generating and manipulating relational databases using valid XML documents,” DocEng '01, Nov. 9-10, 2001, Copyright 2001, ACM 1-58113-432-0/01/0011, pages 105-114.Applicant
- Hardy et al., “Mapping and Displaying Structural Transformations between XML and PDF,” DocEng '02, Nov. 8-9, 2002, Copyright 2002, ACM 1-58113-594-7/02/0001, pages 95-102.Applicant
- Kim et al., “Immediate and Partial Validation Merchanism for the Conflict Resolution of Update Operations in XML Databases,” WAIM 2002, LNCS 2419, 2002, pp. 387-396, Springer-Verlag Berlin Heidelberg 2002.Applicant
- Chuang, T., “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
- Chen et al., “Designing Valid XML Views,” ER 2002, LNCS 2503, 2002, Springer-Verlag Berlin Heidelberg 2002, pp. 463-477.Applicant
- Chen et al., “XKvalidator: A Constraint Validator for XML,” CIKM '02, Nov. 4-9, 2002, Copright 2002, ACM 1-58113-492-4/02/0011, pp. 446-452.Applicant
- W. Brogden, “Arbortext Adept 8 Editor,” 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 May 5, 2003.Applicant
- L. Alschuler, “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/ip031102.html>, retrieved on Feb. 5, 2003.Applicant
- A. Davidow, “XML Editors: Allegations Functionality in search of reality,” INTERNET, 'Online? 1999, XP002230082, retrieved from the Internet, <URL:http://www.ivritype.com/xml/>.Applicant
- Steven A. Battle, et al., “Flexible Information Presentation with XML”, 1998, The Institution of Electrical Engineers, 6 pages.Applicant
- Paolo Ciancarini, et al., “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-638.Applicant
- Hirotaka Kanemoto, et al., “An Efficiently Updatable Index Scheme for Structured Documents”, 1998 IEEE, pp. 991-996.Applicant
- Tommie Usdin, et al., “XML: Not a Silver Bullet, But a Great Pipe Wrench”, Standardview vol. 6, No. 3, Sep. 1998, pp. 125-132.Applicant
- Supoj Sutanthavibul, et al., “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
- “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
- Irene Au & Shuang Li, “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
- Netscape Communication Coporation: “Netscape Communicator 4.61 for OS/2 Warp” Software, 1999, The whole software release & “Netscape—Version 4.61 [en]—010615” Netscape Screenshot, Oct. 2, 2002.Applicant
- Rogge et al., “Validating MPEG-21 Enapsulated Functional Metadata,” IEEE 2002, pp. 209-212.Applicant
- Nelson, “Validating with MSXML and XML Schema,” Windows Developer Magazine, Jan. 2002. pp. 35-38.Applicant
- Chien et al., “XML Document Versioning,” SIGMOD Record, vol. 30, No. 3, Sep. 2001, pp. 35-38.Applicant
- Wong et al., “Managing and Querying Multi-Version XML Data with Update Logging, ” DocEng '02, Nov. 8-9, 2002, Copyright 2002, ACM 1-58113-594-Jul. 2, 2011, pp. 74-81.Applicant
- Chien et al, “Efficient schemes for managing multiversionXML documents”, VLDB Journal (2002), pp. 332-353.Applicant
- Chien et al., “Efficient Managment of Multiversion Documents by Object Referencing,” Proceedings of the 27th VLDB Conference, 2001, pp. 291-300.Applicant
- Chien et al., “Storing and Querying Multiversion XML Documents using Durable Node Numbers,” IEEE 2002, pp. 232-241.Applicant
- Dyck, T., “XML Spy Tops as XML Editor,” http://www.eweek.com/article2/0,3959,724041,00.asp, Nov. 25, 2002, 2 pages.Applicant
- “Netscape window” Netscape Screenshot, Oct. 2, 2002.Applicant
- Jan-Henrick Haukeland: “Tsbiff—tildeslash biff—version 1.2.1” Internet Document, [Online] Jun. 1999, URL:http://web.archive.org/web/199909120912001527/http://www.tildeslash.com/tsbiff/.Applicant
- U.S. Appl. No. 60/191,662, Kutay et al.Applicant
- U.S. Appl. No. 60/203,081, Ben-Natan et al.Applicant
- “Store and Organize Related Project Files in a Binder,” Getting Results with Mircosoft Office, 1990, pp. 109-112.Applicant
- Barker et al., “Creating In-Line objects Within An Integrated Editing Environment,” IBM Technical Disclosure Bulletin, vol. 27, No. 5, Oct. 1984, pp. 2962.Applicant
- Berg A., “Naming and Binding: Monikers” inside OLE, 1995, Chapter 9, pp. 431-490.Applicant
- Clapp D., “The NeXT Application Kit Part I: Non-Responsive Classes,” The NeXT Bible 1990, Chapter 16, pp. 275-293.Applicant
- DiLascia et al., “Sweeper” Microsoft Interactive Developer, vol. 1, No. 1, 1996, 27 pages.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
- Kobayashi et al., “An Update on BTRON-specification OS Development” IEEE 1991 pp. 132-140.Applicant
- Peterson B. , “Unix Variants,” Unix Reviews, 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 Reviews vol. 27, No. 2, Apr. 1993, pp. 72-76.Applicant
- Staneck W., “Internal and External Media” Electronic Publishing Unleashed, 1995, Chapter 22, pp. 510-542.Applicant
- Zdonik S., “Object Management System Concepts,” ACM, 1984, pp. 13-19.Applicant
- Trupin J., “The Visual Programmer,” Microsoft Systems Journal, Apr. 1996, pp. 103-105.Applicant
- OMG XML Metadata Interchange (XMI) Specification Version 1.2 Jan. 2002.Applicant
- Cybook, INC.: “Copying the Search Form to Service-based Web Sites” INternet Article, (online) Jul. 26, 2004.*the whole document*.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.homuns.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
- Anat, Eyal et al., “Integrating and Customizing Hereogeneous E-Commerce Applications”, The VLDB Jouranl-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,(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,(May 2002), 25 pages.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, pp. 1-20.Applicant
- Cover, XML Forms Architecture, retrieved at << http://xml.coverpages.org/xfa.html>> on Aug. 17, 2006, coverpages, Jun. 16, 1999.Applicant
- Microsoft Corporation, “Microsoft Comupter Dictionary ” Microsoft Press, Fifth Edition, p. 149.Applicant
- Raggett, “HTML Tables”, retrieved on Aug. 6, 2006, at <<http:www://is-edu.vn/WebLib/books/Web/Telhtml3-tables.html>>, W3C Internet Draft, Jul. 7, 1995, pp. 1-12.Applicant
- “Enter Key”, Retrieved from the Internet at http://systems.webopedia.com/TERM/Enter—key.html on Dec. 20, 2006.Applicant
- “Micrsosoft Visual Basic 5.0 Programmer's Guide”, Microsoft Press, (1997),pp. 42-43, 54-58.Applicant
- “Micrsoft 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/aa168241(office.11,d=printer).aspx on Jan. 21, 2007, (Aug. 2004).Applicant
- Borland, Russo , “Running Microsoft Word 97”, 314-315, 338, 361-362, 390, and 714-719.Applicant
- Brabrand, et al., “Power Forms Declaration Client-side Form Field Validation”, (2002), 1-20.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
- 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
- Lehtonen, Miro , et al., “A Dynamic User Interface for Document Assembly”, Department of Computer Science, University of Helsinki,(Nov. 2002).Applicant
- Nelson, Joe , “Client-side Form Validation Using JaveScript”, Developer Advisory, (Sep. 21, 2001).Applicant
- Raman, T. V., et al., “XForms 1.0”, (Dec. 2001), Section 1-12.2.3 & Appendices A-G.Applicant
- Rees, Michael J., “Envolving the Browser Towards a Standard User Interface Architecture”, School of Information Technology, Bond University, Australia,(2001).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
- Udell, Jon , “InfoPath and XForms”, Retrieved from the Internet at http://weblog.infoworld.com/udell/2003/02/26.html,(Feb. 26, 2003).Applicant