Correlation, association, or correspondence of electronic forms

Information

  • Patent Grant
  • 8429522
  • Patent Number
    8,429,522
  • Date Filed
    Wednesday, June 15, 2011
    13 years ago
  • Date Issued
    Tuesday, April 23, 2013
    11 years ago
Abstract
Determining correspondence, association, and/or correlation between nodes of electronic forms based on schemas of those forms is described. Importing, merging, and/or annotating data from one electronic form into another electronic form based on correspondence, association, and/or correlation between nodes is also described.
Description
BACKGROUND

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.


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.


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.


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.


For these reasons, aggregating XML documents, though useful, can be difficult, time consuming, and require a high degree of skill.


SUMMARY

Determining correspondence, association, and/or correlation between nodes of electronic forms based on schemas of those forms is described. Importing, merging, and/or annotating data from one electronic form into another electronic form based on correspondence, association, and/or correlation between nodes is also described.





BRIEF DESCRIPTION OF THE DRAWINGS


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.



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.



FIG. 3 illustrates a database selection screen showing electronic forms from which a user can select.



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.



FIG. 5 illustrates a screen shot showing an exemplary electronic form having data imported into it from another electronic form.



FIG. 6 illustrates a computer system capable of implementing a method for importing data from one electronic form into another electronic form.



FIG. 7 illustrates an exemplary set of transformation annotator-types usable in a transformation file to annotate an electronic form with instructions.



FIG. 8 is a flow diagram of an exemplary process for importing data from one electronic form into another electronic form.



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.



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.



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.



FIG. 12 illustrates a screen shot showing an exemplary electronic form having data imported into it from another, substantially different electronic form.



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.



FIG. 14 illustrates two exemplary, simple, and graphical representations of two electronic forms that are hierarchically structured and organized into nodes.



FIG. 15 is a block diagram of a computer system that is capable of supporting aggregation of electronic forms.





The same numbers are used throughout the disclosure and figures to reference like components and features.


DETAILED DESCRIPTION

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.


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.


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



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.


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.



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.


With this manager's report 102 selected, the user can then select a source electronic form to aggregate into the manager's report 102.



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.


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.



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 manager's report 102. The source electronic form is shown at reference numeral 302.


Once this selection is made, the selected electronic form can be presented (though this is not necessary).



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.


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.



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).


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).


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.”.


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).


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.


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.


Exemplary System



FIG. 6 shows an exemplary system 600 to facilitate data importation between electronic forms.


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.


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).


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.


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).


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.


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.


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.


These annotator-types 636 can include the annotator-types set forth in FIG. 7 and described in a corresponding discussion.


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.


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.


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.



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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


Exemplary Methods


Importing Generally



FIG. 8 shows a flow diagram 800 for importing data from one electronic form into another electronic form.


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.


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.



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.


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).


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.


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.


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).


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.



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.



FIGS. 1 to 4 show what the user can, in one implementation, see as part of the block 802.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


At block 818 the system 600 rejects the request to import data.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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


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.


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.



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.


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.


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.


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.


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.


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.


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.


At block 910, the system 600 determines which annotation(s) were found in block 906.


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.


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.


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.


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.


Following blocks 912, 914, and 916, the system 600 proceeds to block 922.


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.


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.


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.


Following blocks 918 or 920, the system 600 proceeds to block 924.


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.


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.


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.


To aid in this discussion of importing data with annotations, the following exemplary forms are described.



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.



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.


This team report 1102 is governed by a schema that is substantially dissimilar from the schema governing the action report 1002.


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.


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).



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.


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


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.



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.


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.


As part of block 1302, the system 600 can perform the actions set forth in blocks 1304, 1306, 1308, 1310, and 1312.


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.


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.



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.


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.


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.


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.


With these structures set forth, the discussion returns to the flow diagram 1300.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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).


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.


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.


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).


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.


Also by further way of example, assume that the system 600 then proceeds to analyze the alpha node 1420 of the structure 1400.


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.


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.


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.


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.


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.



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.


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).


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).


After block 1318, the system 600 proceeds to block 1328.


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.


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.


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.


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:

<element a1=“a1 data” a2=“a2 data”>original element data</element>

And the source node is:

<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:

<element a1=“new a1 data” a2=“a2 data” a3=“new a3 data>original element data</element>


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.


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.


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.



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.


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.


After completing block 1324, the system 600 proceeds to block 1328, described above.


A Computer System



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.


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.


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.


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.


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.


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.


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


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
  • 1. A method comprising: determining a first schema of a first electronic form and a second schema of a second electronic form;finding a transformation file based on the first schema and the second schema;applying the transformation file on the first electronic form to annotate the first electronic form with instructions to aid in importing data from the first electronic form into the second electronic form; andimporting data included within the first electronic form into the second electronic form based on the instructions.
  • 2. The method of claim 1, wherein the determining the first schema includes analyzing a structure of the first electronic form.
  • 3. The method of claim 1, wherein the determining the first schema includes analyzing a structure of the first electronic form and comparing the structure with a list of schemas to determine if one of the listed schemas is capable of governing the structure.
  • 4. The method of claim 1, wherein the determining the first schema includes selecting the first schema from multiple schemas that are capable of governing the first electronic form.
  • 5. The method of claim 1, wherein the determining the first schema includes selecting the first schema from multiple schemas that are capable of governing the first electronic form, the first schema being selected from the multiple schemas based on which of the multiple schemas is first determined to be capable of governing the first electronic form.
  • 6. The method of claim 1, wherein the determining the first schema includes analyzing schemas from a group of multiple schemas, the first schema being the first of the multiple schemas that is capable of governing the first electronic form.
  • 7. The method of claim 1, wherein the determining the first schema includes accessing a file associated with the first electronic form that includes information related to or associated with the first schema.
  • 8. The method of claim 1, wherein the determining the first schema includes accessing a file associated with the first electronic form that includes information related to or associated with the first schema and using this information to find or build the first schema.
  • 9. The method of claim 1, wherein the determining the second schema includes accessing a file associated with the second electronic form that includes information related to or associated with the second schema.
  • 10. The method of claim 1, wherein the determining the second schema includes accessing a file associated with the second electronic form that includes or includes a link to the second schema.
  • 11. The method of claim 1, wherein the first schema is capable of governing only a portion of the first electronic form.
  • 12. The method of claim 1, wherein the first schema is capable of governing only a portion of the first electronic form and the data is within the portion.
  • 13. The method of claim 1, wherein the first schema is capable of governing only a portion of the first electronic form, the data is within the portion, and the applying the transformation file is performed on the portion.
  • 14. The method of claim 1, wherein the finding the transformation file includes accessing a group of transformation files associated with the second schema.
  • 15. The method of claim 1, wherein the finding the transformation file includes determining which of a group of transformation files associated with the second schema is associated with the first schema.
  • 16. The method of claim 1, wherein the first electronic form and the second electronic form are written in part with XML.
  • 17. One or more computer-readable storage media 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;annotate, without user interaction, the first electronic form if the first schema and the second schema are dissimilar by applying a transformation file on the first electronic form to add instructions regarding how to make the data of the first electronic form compatible with the second schema of the second electronic form;make compatible the data of the first electronic form with the second schema of the second electronic form based on the instructions regarding how to make the data of the first electronic form compatible with the second schema of the second electronic form; andimport the compatible data of the first electronic into the second electronic form.
  • 18. The computer-readable storage media of claim 17, wherein the importation appends the compatible data to other data in second electronic form.
  • 19. The computer-readable storage media of claim 17, wherein the determination includes finding the transformation file associated with the first schema.
  • 20. The computer-readable storage media of claim 17, wherein the transformation file includes code written in XSLT.
RELATED APPLICATION

This application is a divisional of and claims priority to U.S. patent application Ser. No. 11/931,730 filed Oct. 31, 2007 which is a continuation of and claims priority to U.S. patent application Ser. No. 10/636,475, filed on Aug. 6, 2003, the disclosure of which is incorporated by reference herein.

US Referenced Citations (1118)
Number Name Date Kind
2804878 Fishwood et al. Sep 1957 A
3091077 Erickson et al. May 1963 A
3104520 Cazier et al. Sep 1963 A
3195805 Cholvin et al. Jul 1965 A
3196606 Cholvin et al. Jul 1965 A
3812942 Espenschied et al. May 1974 A
3874828 Herschler et al. Apr 1975 A
3961748 McNabney Jun 1976 A
4005578 McInerney Feb 1977 A
4005579 Lloyd Feb 1977 A
4060340 Yanik et al. Nov 1977 A
4089623 Hofmann, Jr. May 1978 A
4201978 Nally May 1980 A
4256019 Braddick Mar 1981 A
4362475 Seitz Dec 1982 A
4391184 Yumane et al. Jul 1983 A
4396345 Hutchinson Aug 1983 A
4498147 Agnew et al. Feb 1985 A
4514800 Gruner et al. Apr 1985 A
4514985 Cadeddu May 1985 A
4564752 Lepic et al. Jan 1986 A
4641274 Swank Feb 1987 A
4674040 Barker et al. Jun 1987 A
4723211 Barker et al. Feb 1988 A
4739477 Barker et al. Apr 1988 A
4783648 Homma et al. Nov 1988 A
4815029 Barker et al. Mar 1989 A
4847749 Collins et al. Jul 1989 A
4910663 Bailey Mar 1990 A
4926476 Covey May 1990 A
4933880 Borgendale et al. Jun 1990 A
4962475 Hernandez et al. Oct 1990 A
4975690 Torres Dec 1990 A
5025484 Yamanari et al. Jun 1991 A
5072412 Henderson, Jr. et al. Dec 1991 A
5140563 Thinesen Aug 1992 A
5179703 Evans Jan 1993 A
5182709 Makus Jan 1993 A
5187786 Densmore et al. Feb 1993 A
5191645 Carlucci et al. Mar 1993 A
5195183 Miller et al. Mar 1993 A
5204947 Bernstein et al. Apr 1993 A
5206951 Khoyi et al. Apr 1993 A
5218672 Morgan et al. Jun 1993 A
5220649 Forcier Jun 1993 A
5222160 Sakai et al. Jun 1993 A
5228100 Takeda et al. Jul 1993 A
5237680 Adams et al. Aug 1993 A
5249275 Srivastava Sep 1993 A
5251273 Betts et al. Oct 1993 A
5257646 Meyer Nov 1993 A
5274803 Dubin et al. Dec 1993 A
5287448 Nicol et al. Feb 1994 A
5297249 Bernstein et al. Mar 1994 A
5297283 Kelly, Jr. et al. Mar 1994 A
5313631 Kao May 1994 A
5313646 Hendricks et al. May 1994 A
5317686 Salas et al. May 1994 A
5325481 Hunt Jun 1994 A
5333317 Dann Jul 1994 A
5339423 Beitel et al. Aug 1994 A
5339424 Fushimi Aug 1994 A
5341478 Travis, Jr. et al. Aug 1994 A
5369766 Nakano et al. Nov 1994 A
5369778 San Soucie et al. Nov 1994 A
5371675 Greif et al. Dec 1994 A
5377323 Vasudevan Dec 1994 A
5379419 Heffernan et al. Jan 1995 A
5381547 Flug et al. Jan 1995 A
5388967 Firnhaber et al. Feb 1995 A
5388968 Wood et al. Feb 1995 A
5390325 Miller Feb 1995 A
5396623 McCall et al. Mar 1995 A
5408665 Fitzgerald Apr 1995 A
5410646 Tondevold et al. Apr 1995 A
5410688 Williams et al. Apr 1995 A
5412772 Monson May 1995 A
5428738 Carter et al. Jun 1995 A
5434965 Matheny et al. Jul 1995 A
5434975 Allen Jul 1995 A
5436637 Gayraud et al. Jul 1995 A
5438659 Notess et al. Aug 1995 A
5440744 Jacobson et al. Aug 1995 A
5446842 Schaeffer et al. Aug 1995 A
5455875 Chevion et al. Oct 1995 A
5456582 Firnhaber et al. Oct 1995 A
5459865 Heninger et al. Oct 1995 A
5463726 Price Oct 1995 A
5481722 Skinner Jan 1996 A
5497489 Menne Mar 1996 A
5504898 Klein Apr 1996 A
5517655 Collins et al. May 1996 A
5535389 Elder et al. Jul 1996 A
5537596 Yu et al. Jul 1996 A
5540558 Harden et al. Jul 1996 A
5542070 LeBlanc et al. Jul 1996 A
5548745 Egan et al. Aug 1996 A
5550976 Henderson et al. Aug 1996 A
5551035 Arnold et al. Aug 1996 A
5555325 Burger Sep 1996 A
5556271 Zuercher et al. Sep 1996 A
5566330 Sheffield Oct 1996 A
5572643 Judson Nov 1996 A
5572648 Bibayan Nov 1996 A
5577252 Nelson et al. Nov 1996 A
5581686 Koppolu et al. Dec 1996 A
5581760 Atkinson et al. Dec 1996 A
5600789 Parker et al. Feb 1997 A
5602996 Powers, III et al. Feb 1997 A
5608720 Biegel et al. Mar 1997 A
5613837 Konishi et al. Mar 1997 A
5625783 Ezekiel et al. Apr 1997 A
5627979 Chang et al. May 1997 A
5630126 Redpath May 1997 A
5630706 Yang May 1997 A
5634113 Rusterholz May 1997 A
5634121 Tracz et al. May 1997 A
5634124 Khoyi et al. May 1997 A
5636637 Guiolet et al. Jun 1997 A
5640544 Onodera et al. Jun 1997 A
5644738 Goldman et al. Jul 1997 A
5644739 Moursund Jul 1997 A
5649099 Theimer et al. Jul 1997 A
5655887 Chou Aug 1997 A
5659729 Nielsen Aug 1997 A
5664133 Malamud et al. Sep 1997 A
5664178 Sinofsky Sep 1997 A
5664938 Yang Sep 1997 A
5668966 Ono et al. Sep 1997 A
5669005 Curbow et al. Sep 1997 A
5681151 Wood Oct 1997 A
5682536 Atkinson et al. Oct 1997 A
5689667 Kurtenbach Nov 1997 A
5689703 Atkinson et al. Nov 1997 A
5692540 Huang Dec 1997 A
5704029 Wright, Jr. Dec 1997 A
5706501 Horikiri et al. Jan 1998 A
5717939 Bricklin et al. Feb 1998 A
5720016 Egashira Feb 1998 A
5721824 Taylor Feb 1998 A
5734380 Adams et al. Mar 1998 A
5740439 Atkinson et al. Apr 1998 A
5740455 Pavley et al. Apr 1998 A
5742504 Meyer et al. Apr 1998 A
5742795 Kussel Apr 1998 A
5745683 Lee et al. Apr 1998 A
5745712 Turpin et al. Apr 1998 A
5748807 Lopresti et al. May 1998 A
5758184 Lucovsky et al. May 1998 A
5758358 Ebbo May 1998 A
5761408 Kolawa et al. Jun 1998 A
5761683 Logan et al. Jun 1998 A
5764984 Loucks Jun 1998 A
5764985 Smale Jun 1998 A
5778372 Cordell et al. Jul 1998 A
5778402 Gipson Jul 1998 A
5784555 Stone Jul 1998 A
5785081 Krawczyk et al. Jul 1998 A
5787274 Agrawal et al. Jul 1998 A
5790796 Sadowsky Aug 1998 A
5796403 Adams et al. Aug 1998 A
5798757 Smith Aug 1998 A
5799311 Agrawal et al. Aug 1998 A
5801701 Koppolu et al. Sep 1998 A
5801702 Dolan et al. Sep 1998 A
5802304 Stone Sep 1998 A
5802530 Van Hoff Sep 1998 A
5803715 Kitchener Sep 1998 A
5805824 Kappe Sep 1998 A
5806079 Rivette et al. Sep 1998 A
5815830 Anthony Sep 1998 A
5819034 Joseph et al. Oct 1998 A
5825359 Derby et al. Oct 1998 A
5826031 Nielsen Oct 1998 A
5826265 Van Huben et al. Oct 1998 A
5835777 Staelin Nov 1998 A
5838906 Doyle et al. Nov 1998 A
5842018 Atkinson et al. Nov 1998 A
5845077 Fawcett Dec 1998 A
5845090 Collins, III et al. Dec 1998 A
5845122 Nielsen et al. Dec 1998 A
5854630 Nielsen Dec 1998 A
5859973 Carpenter et al. Jan 1999 A
5862372 Morris et al. Jan 1999 A
5862379 Rubin et al. Jan 1999 A
5864819 De Armas et al. Jan 1999 A
5870735 Agrawal et al. Feb 1999 A
5873088 Hayashi et al. Feb 1999 A
5875815 Ungerecht et al. Mar 1999 A
5898434 Small et al. Apr 1999 A
5905492 Straub et al. May 1999 A
5907621 Bachman et al. May 1999 A
5907704 Gudmundson et al. May 1999 A
5910895 Proskauer et al. Jun 1999 A
5911776 Guck Jun 1999 A
5915112 Boutcher Jun 1999 A
5919247 Van Hoff et al. Jul 1999 A
5922072 Hutchinson et al. Jul 1999 A
5926796 Walker et al. Jul 1999 A
5928363 Ruvolo Jul 1999 A
5929858 Shibata et al. Jul 1999 A
RE36281 Zuercher et al. Aug 1999 E
5940075 Mutschler, III et al. Aug 1999 A
5947711 Myers et al. Sep 1999 A
5950010 Hesse et al. Sep 1999 A
5950221 Draves et al. Sep 1999 A
5953731 Glaser Sep 1999 A
5956481 Walsh et al. Sep 1999 A
5960199 Brodsky et al. Sep 1999 A
5960411 Hartman et al. Sep 1999 A
5963208 Dolan et al. Oct 1999 A
5963964 Nielsen Oct 1999 A
5973696 Agranat et al. Oct 1999 A
5974454 Apfel et al. Oct 1999 A
5982370 Kamper Nov 1999 A
5983348 Ji Nov 1999 A
5987480 Donohue et al. Nov 1999 A
5991710 Papineni et al. Nov 1999 A
5991731 Colon et al. Nov 1999 A
5991877 Luckenbaugh Nov 1999 A
5995103 Ashe Nov 1999 A
5999740 Rowley Dec 1999 A
6005570 Gayraud et al. Dec 1999 A
6006227 Freeman et al. Dec 1999 A
6006241 Purnaveja et al. Dec 1999 A
6012066 Discount et al. Jan 2000 A
6014135 Fernandes Jan 2000 A
6016520 Facq et al. Jan 2000 A
6018743 Xu Jan 2000 A
6021403 Horvitz et al. Feb 2000 A
6026379 Haller et al. Feb 2000 A
6026416 Kanerva et al. Feb 2000 A
6031989 Cordell et al. Feb 2000 A
6035297 Van Huben et al. Mar 2000 A
6035309 Dauerer et al. Mar 2000 A
6035336 Lu et al. Mar 2000 A
6044205 Reed et al. Mar 2000 A
6052531 Waldin, Jr. et al. Apr 2000 A
6052710 Saliba et al. Apr 2000 A
6054987 Richardson Apr 2000 A
6057837 Hatakeda et al. May 2000 A
6058413 Flores et al. May 2000 A
6065043 Domenikos et al. May 2000 A
6069626 Cline et al. May 2000 A
6070184 Blount et al. May 2000 A
6072870 Nguyen et al. Jun 2000 A
6078326 Kilmer et al. Jun 2000 A
6078327 Liman et al. Jun 2000 A
6078924 Ainsbury et al. Jun 2000 A
6081610 Dwork et al. Jun 2000 A
6084585 Kraft et al. Jul 2000 A
6088679 Barkley Jul 2000 A
6088708 Burch et al. Jul 2000 A
6091417 Lefkowitz Jul 2000 A
6094657 Hailpern et al. Jul 2000 A
6096096 Murphy et al. Aug 2000 A
6097382 Rosen et al. Aug 2000 A
6098081 Heidorn et al. Aug 2000 A
6105012 Chang et al. Aug 2000 A
6106570 Mizuhara Aug 2000 A
6108637 Blumenau Aug 2000 A
6108783 Krawczyk et al. Aug 2000 A
6115646 Fiszman et al. Sep 2000 A
6121965 Kenney et al. Sep 2000 A
6122647 Horowitz et al. Sep 2000 A
6144969 Inokuchi et al. Nov 2000 A
6151624 Teare et al. Nov 2000 A
6154128 Wookey et al. Nov 2000 A
6161107 Stern Dec 2000 A
6163772 Kramer et al. Dec 2000 A
6167521 Smith et al. Dec 2000 A
6167523 Strong Dec 2000 A
6178551 Sana et al. Jan 2001 B1
6182094 Humpleman et al. Jan 2001 B1
6182095 Leymaster et al. Jan 2001 B1
6188401 Peyer Feb 2001 B1
6191797 Politis Feb 2001 B1
6192367 Hawley et al. Feb 2001 B1
6195661 Filepp et al. Feb 2001 B1
6199204 Donohue Mar 2001 B1
6209128 Gerard et al. Mar 2001 B1
6216152 Wong et al. Apr 2001 B1
6219423 Davis Apr 2001 B1
6219698 Iannucci et al. Apr 2001 B1
6225996 Gibb et al. May 2001 B1
6235027 Herzon May 2001 B1
6243088 McCormack et al. Jun 2001 B1
6247016 Rastogi et al. Jun 2001 B1
6253366 Mutschler, III Jun 2001 B1
6253374 Dresevic et al. Jun 2001 B1
6263313 Milsted et al. Jul 2001 B1
6266810 Tanaka et al. Jul 2001 B1
6268852 Lindhorst et al. Jul 2001 B1
6271862 Yu Aug 2001 B1
6272506 Bell Aug 2001 B1
6275227 DeStefano Aug 2001 B1
6275599 Adler et al. Aug 2001 B1
6279042 Ouchi Aug 2001 B1
6281896 Alimpich et al. Aug 2001 B1
6282709 Reha et al. Aug 2001 B1
6282711 Halpern et al. Aug 2001 B1
6286033 Kishinsky et al. Sep 2001 B1
6286130 Poulsen et al. Sep 2001 B1
6292897 Gennaro et al. Sep 2001 B1
6292941 Jollands Sep 2001 B1
6297819 Furst Oct 2001 B1
6300948 Geller et al. Oct 2001 B1
6307955 Zank et al. Oct 2001 B1
6308179 Petersen et al. Oct 2001 B1
6308273 Goertzel et al. Oct 2001 B1
6311221 Raz et al. Oct 2001 B1
6311271 Gennaro et al. Oct 2001 B1
6314415 Mukherjee Nov 2001 B1
6321259 Ouellette et al. Nov 2001 B1
6321334 Jerger et al. Nov 2001 B1
6327628 Anuff et al. Dec 2001 B1
6331864 Coco et al. Dec 2001 B1
6336214 Sundaresan Jan 2002 B1
6336797 Kazakis et al. Jan 2002 B1
6342907 Petty et al. Jan 2002 B1
6343149 Motoiwa Jan 2002 B1
6343302 Graham Jan 2002 B1
6343377 Gessner et al. Jan 2002 B1
6344862 Williams et al. Feb 2002 B1
6345256 Milsted et al. Feb 2002 B1
6345278 Hitchcock et al. Feb 2002 B1
6345361 Jerger et al. Feb 2002 B1
6347323 Garber et al. Feb 2002 B1
6349408 Smith Feb 2002 B1
6351574 Yair et al. Feb 2002 B1
6353851 Anupam et al. Mar 2002 B1
6353926 Parthesarathy et al. Mar 2002 B1
6356906 Lippert et al. Mar 2002 B1
6357038 Scouten Mar 2002 B1
6366907 Fanning et al. Apr 2002 B1
6366912 Wallent et al. Apr 2002 B1
6367013 Bisbee et al. Apr 2002 B1
6369840 Barnett et al. Apr 2002 B1
6369841 Salomon et al. Apr 2002 B1
6374402 Schmeidler et al. Apr 2002 B1
6381742 Forbes et al. Apr 2002 B2
6381743 Mutschler, III Apr 2002 B1
6385767 Ziebell May 2002 B1
6389434 Rivette et al. May 2002 B1
6393456 Ambler et al. May 2002 B1
6393469 Dozier et al. May 2002 B1
6396488 Simmons et al. May 2002 B1
6397264 Stasnick et al. May 2002 B1
6401077 Godden et al. Jun 2002 B1
6405221 Levine et al. Jun 2002 B1
6405238 Votipka Jun 2002 B1
6408311 Baisley et al. Jun 2002 B1
6414700 Kurtenbach et al. Jul 2002 B1
6421070 Ramos et al. Jul 2002 B1
6421656 Cheng et al. Jul 2002 B1
6421777 Pierre-Louis et al. Jul 2002 B1
6425125 Fries et al. Jul 2002 B1
6427142 Zachary et al. Jul 2002 B1
6429885 Saib et al. Aug 2002 B1
6434563 Pasquali et al. Aug 2002 B1
6434564 Ebert Aug 2002 B2
6434743 Click et al. Aug 2002 B1
6442563 Bacon et al. Aug 2002 B1
6442755 Lemmons et al. Aug 2002 B1
6446110 Lection et al. Sep 2002 B1
6449617 Quinn et al. Sep 2002 B1
6457009 Bollay Sep 2002 B1
6460058 Koppolu et al. Oct 2002 B2
6463419 Kluss Oct 2002 B1
6470349 Heninger et al. Oct 2002 B1
6473800 Jerger et al. Oct 2002 B1
6476828 Burkett et al. Nov 2002 B1
6476833 Moshfeghi Nov 2002 B1
6477544 Bolosky et al. Nov 2002 B1
6480860 Monday Nov 2002 B1
6487566 Sundaresan Nov 2002 B1
6490601 Markus et al. Dec 2002 B1
6493006 Gourdol et al. Dec 2002 B1
6493007 Pang Dec 2002 B1
6493702 Adar et al. Dec 2002 B1
6496203 Beaumont et al. Dec 2002 B1
6501864 Eguchi et al. Dec 2002 B1
6502101 Verprauskus et al. Dec 2002 B1
6502103 Frey et al. Dec 2002 B1
6505200 Ims et al. Jan 2003 B1
6505230 Mohan et al. Jan 2003 B1
6505300 Chan et al. Jan 2003 B2
6505344 Blais et al. Jan 2003 B1
6507856 Chen et al. Jan 2003 B1
6513154 Porterfield Jan 2003 B1
6516322 Meredith Feb 2003 B1
6519617 Wanderski et al. Feb 2003 B1
6523027 Underwood Feb 2003 B1
6529909 Bowman-Amuah Mar 2003 B1
6535229 Kraft Mar 2003 B1
6535883 Lee et al. Mar 2003 B1
6539464 Getov Mar 2003 B1
RE38070 Spies et al. Apr 2003 E
6546546 Van Doorn Apr 2003 B1
6546554 Schmidt et al. Apr 2003 B1
6549221 Brown et al. Apr 2003 B1
6549878 Lowry et al. Apr 2003 B1
6549922 Srivastava et al. Apr 2003 B1
6553402 Makarios et al. Apr 2003 B1
6560616 Garber May 2003 B1
6560620 Ching May 2003 B1
6560640 Smethers May 2003 B2
6563514 Samar May 2003 B1
6571253 Thompson et al. May 2003 B1
6574655 Libert et al. Jun 2003 B1
6578144 Gennaro et al. Jun 2003 B1
6581061 Graham Jun 2003 B2
6584469 Chiang et al. Jun 2003 B1
6584548 Bourne et al. Jun 2003 B1
6585778 Hind et al. Jul 2003 B1
6589290 Maxwell et al. Jul 2003 B1
6594686 Edwards et al. Jul 2003 B1
6598219 Lau Jul 2003 B1
6603489 Edlund et al. Aug 2003 B1
6604099 Chung et al. Aug 2003 B1
6604238 Lim et al. Aug 2003 B1
6606606 Starr Aug 2003 B2
6609200 Anderson et al. Aug 2003 B2
6611812 Hurtado et al. Aug 2003 B2
6611822 Beams et al. Aug 2003 B1
6611840 Baer et al. Aug 2003 B1
6611843 Jacobs Aug 2003 B1
6613098 Sorge et al. Sep 2003 B1
6615276 Mastrianni et al. Sep 2003 B1
6625622 Henrickson et al. Sep 2003 B1
6629109 Koshisaka Sep 2003 B1
6631357 Perkowski Oct 2003 B1
6631379 Cox Oct 2003 B2
6631497 Jamshidi et al. Oct 2003 B1
6631519 Nicholson et al. Oct 2003 B1
6632251 Rutten et al. Oct 2003 B1
6633315 Sobeski et al. Oct 2003 B1
6635089 Burkett et al. Oct 2003 B1
6636845 Chau et al. Oct 2003 B2
6640249 Bowman-Amuah Oct 2003 B1
6643633 Chau et al. Nov 2003 B2
6643652 Helgeson et al. Nov 2003 B2
6643684 Malkin et al. Nov 2003 B1
6651217 Kennedy et al. Nov 2003 B1
6654737 Nunez Nov 2003 B1
6654932 Bahrs et al. Nov 2003 B1
6658417 Stakutis et al. Dec 2003 B1
6658622 Aiken et al. Dec 2003 B1
6658652 Alexander et al. Dec 2003 B1
6661920 Skinner Dec 2003 B1
6668369 Krebs et al. Dec 2003 B1
6671805 Brown et al. Dec 2003 B1
6675202 Perttunen Jan 2004 B1
6678625 Reise et al. Jan 2004 B1
6678717 Schneider Jan 2004 B1
6681370 Gounares et al. Jan 2004 B2
6691230 Bardon Feb 2004 B1
6691281 Sorge et al. Feb 2004 B1
6697944 Jones et al. Feb 2004 B1
6701434 Rohatgi Mar 2004 B1
6701486 Weber et al. Mar 2004 B1
6704906 Yankovich et al. Mar 2004 B1
6708172 Wong et al. Mar 2004 B1
6710789 Sekiguchi et al. Mar 2004 B1
6711679 Guski et al. Mar 2004 B1
6720985 Silverbrook et al. Apr 2004 B1
6725426 Pavlov Apr 2004 B1
6728755 de Ment Apr 2004 B1
6732102 Khandekar et al. May 2004 B1
6735721 Morrow et al. May 2004 B1
6738783 Melli et al. May 2004 B2
6745367 Bates et al. Jun 2004 B1
6748385 Rodkin et al. Jun 2004 B1
6748569 Brooke et al. Jun 2004 B1
6751777 Bates et al. Jun 2004 B2
6754874 Richman Jun 2004 B1
6757826 Paltenghe Jun 2004 B1
6757868 Glaser et al. Jun 2004 B1
6757890 Wallman Jun 2004 B1
6760723 Oshinsky et al. Jul 2004 B2
6763343 Brooke et al. Jul 2004 B1
6766526 Ellis Jul 2004 B1
6772139 Smith, III Aug 2004 B1
6772165 O'Carroll Aug 2004 B2
6774926 Ellis et al. Aug 2004 B1
6779154 Nussbaum et al. Aug 2004 B1
6781609 Barker et al. Aug 2004 B1
6782144 Bellavita et al. Aug 2004 B2
6799299 Li et al. Sep 2004 B1
6801929 Donoho et al. Oct 2004 B1
6806892 Plow et al. Oct 2004 B1
6816849 Halt, Jr. Nov 2004 B1
6823478 Prologo et al. Nov 2004 B1
6828992 Freeman et al. Dec 2004 B1
6829745 Yassin et al. Dec 2004 B2
6842175 Schmalstieg et al. Jan 2005 B1
6845380 Su et al. Jan 2005 B2
6845499 Srivastava et al. Jan 2005 B2
6847387 Roth Jan 2005 B2
6848078 Birsan et al. Jan 2005 B1
6850895 Brodersen et al. Feb 2005 B2
6862689 Bergsten et al. Mar 2005 B2
6871220 Rajan et al. Mar 2005 B1
6871345 Crow et al. Mar 2005 B1
6874084 Dobner et al. Mar 2005 B1
6874130 Baweja et al. Mar 2005 B1
6874143 Murray Mar 2005 B1
6876996 Czajkowski et al. Apr 2005 B2
6883168 James et al. Apr 2005 B1
6885748 Wang Apr 2005 B1
6889359 Conner et al. May 2005 B1
6901403 Bata et al. May 2005 B1
6915454 Moore et al. Jul 2005 B1
6925609 Lucke Aug 2005 B1
6931532 Davis et al. Aug 2005 B1
6941129 Marce et al. Sep 2005 B2
6941510 Ozzie et al. Sep 2005 B1
6941511 Hind et al. Sep 2005 B1
6941521 Lin et al. Sep 2005 B2
6948129 Loghmani Sep 2005 B1
6948133 Haley Sep 2005 B2
6948135 Ruthfield et al. Sep 2005 B1
6950980 Malcolm Sep 2005 B1
6950987 Hargraves et al. Sep 2005 B1
6957395 Jobs et al. Oct 2005 B1
6961897 Peel, Jr. et al. Nov 2005 B1
6963875 Moore et al. Nov 2005 B2
6968503 Chang et al. Nov 2005 B1
6968505 Stoll et al. Nov 2005 B2
6993714 Kaler et al. Jan 2006 B2
6993722 Greer et al. Jan 2006 B1
6996776 Makely et al. Feb 2006 B1
6996781 Myers et al. Feb 2006 B1
7000179 Yankovich et al. Feb 2006 B2
7002560 Graham Feb 2006 B2
7003548 Barck et al. Feb 2006 B1
7003722 Rothchiller et al. Feb 2006 B2
7010580 Fu et al. Mar 2006 B1
7013340 Burd et al. Mar 2006 B1
7020869 Abrari et al. Mar 2006 B2
7024417 Russakovsky et al. Apr 2006 B1
7032170 Poulose Apr 2006 B2
7036072 Sulistio et al. Apr 2006 B1
7039875 Khalfay et al. May 2006 B2
7043687 Knauss et al. May 2006 B2
7051273 Holt et al. May 2006 B1
7058645 Seto et al. Jun 2006 B2
7058663 Johnston et al. Jun 2006 B2
7062764 Cohen et al. Jun 2006 B2
7065493 Homsi Jun 2006 B1
7076728 Davis et al. Jul 2006 B2
7080083 Kim et al. Jul 2006 B2
7080325 Treibach-Heck et al. Jul 2006 B2
7081882 Sowden et al. Jul 2006 B2
7086009 Resnick et al. Aug 2006 B2
7086042 Abe et al. Aug 2006 B2
7088374 David et al. Aug 2006 B2
7092992 Yu Aug 2006 B1
7100147 Miller et al. Aug 2006 B2
7103611 Murthy et al. Sep 2006 B2
7106888 Silverbrook et al. Sep 2006 B1
7107282 Yalamanchi Sep 2006 B1
7107521 Santos Sep 2006 B2
7107522 Morgan et al. Sep 2006 B1
7107539 Abbott et al. Sep 2006 B2
7120863 Wang Oct 2006 B1
7124167 Bellotti et al. Oct 2006 B1
7124251 Clark et al. Oct 2006 B2
7130885 Chandra et al. Oct 2006 B2
7134083 Guerrero Nov 2006 B1
7143341 Kohli Nov 2006 B1
7146564 Kim et al. Dec 2006 B2
7152027 Andrade et al. Dec 2006 B2
7152205 Day et al. Dec 2006 B2
7159011 Knight et al. Jan 2007 B1
7168035 Bell et al. Jan 2007 B1
7178166 Taylor et al. Feb 2007 B1
7190376 Tonisson Mar 2007 B1
7191394 Ardeleanu et al. Mar 2007 B1
7197515 Rivers-Moore et al. Mar 2007 B2
7200665 Eshghi et al. Apr 2007 B2
7200816 Falk et al. Apr 2007 B2
7213200 Abe et al. May 2007 B2
7228541 Gupton et al. Jun 2007 B2
7234105 Bezrukov et al. Jun 2007 B2
7236982 Zlatanov et al. Jun 2007 B2
7237114 Rosenberg Jun 2007 B1
7249328 Davis Jul 2007 B1
7251777 Valtchev et al. Jul 2007 B1
7269664 Hutsch et al. Sep 2007 B2
7269788 Gharavy Sep 2007 B2
7272789 O'Brien Sep 2007 B2
7272815 Eldridge Sep 2007 B1
7275216 Paoli et al. Sep 2007 B2
7281018 Begun et al. Oct 2007 B1
7281206 Schnelle et al. Oct 2007 B2
7281245 Reynar et al. Oct 2007 B2
7284208 Matthews Oct 2007 B2
7284239 Young et al. Oct 2007 B1
7287218 Knotz et al. Oct 2007 B1
7293268 Masuda et al. Nov 2007 B2
7296017 Larcheveque et al. Nov 2007 B2
7305613 Oezgen Dec 2007 B2
7308646 Cohen et al. Dec 2007 B1
7313757 Bradley et al. Dec 2007 B2
7313758 Kozlov Dec 2007 B2
7316003 Dulepet et al. Jan 2008 B1
7318237 Moriconi et al. Jan 2008 B2
7334178 Aulagnier et al. Feb 2008 B1
7337391 Clarke et al. Feb 2008 B2
7337392 Lue Feb 2008 B2
7346610 Ruthfield et al. Mar 2008 B2
7346840 Ravishankar et al. Mar 2008 B1
7346848 Ruthfield et al. Mar 2008 B1
7350141 Kotler et al. Mar 2008 B2
7370066 Sikchi et al. May 2008 B1
7373595 Jones et al. May 2008 B2
7376673 Chalecki et al. May 2008 B1
7406660 Sikchi et al. Jul 2008 B1
7412649 Emek et al. Aug 2008 B2
7424671 Elza et al. Sep 2008 B2
7428699 Kane et al. Sep 2008 B1
7430711 Rivers-Moore et al. Sep 2008 B2
7441200 Savage Oct 2008 B2
7451392 Chalecki et al. Nov 2008 B1
7490109 Sikchi et al. Feb 2009 B1
7490167 Pena et al. Feb 2009 B2
7496632 Chapman et al. Feb 2009 B2
7496837 Larcheveque et al. Feb 2009 B1
7512896 Rockey et al. Mar 2009 B2
7516145 Sikchi et al. Apr 2009 B2
7516399 Hsu et al. Apr 2009 B2
7533268 Catorcini May 2009 B1
7543228 Kelkar Jun 2009 B2
7549115 Kotler Jun 2009 B2
7562215 Cummins Jul 2009 B2
7568101 Catorcini Jul 2009 B1
7581177 Mollicone et al. Aug 2009 B1
7584417 Friend Sep 2009 B2
7610562 Rockey et al. Oct 2009 B2
7613996 Dallett et al. Nov 2009 B2
7624356 Rockey et al. Nov 2009 B1
7653687 Resiman Jan 2010 B2
7669116 Lopata et al. Feb 2010 B2
7673227 Kotler Mar 2010 B2
7673228 Kelkar Mar 2010 B2
7676843 Stott Mar 2010 B1
7689929 Ruthfield Mar 2010 B2
7692636 Kim Apr 2010 B2
7712022 Smuga May 2010 B2
7712048 Rockey et al. May 2010 B2
7721190 Sikchi May 2010 B2
7725834 Bell May 2010 B2
7739602 Feng et al. Jun 2010 B2
7743063 James et al. Jun 2010 B2
7774620 Stott Aug 2010 B1
7779027 James Aug 2010 B2
7809698 Salz et al. Oct 2010 B1
7818677 Ruthfield Oct 2010 B2
7865477 Larcheveque Jan 2011 B2
7900134 Ardeleanu Mar 2011 B2
7904801 Catorcini et al. Mar 2011 B2
7913159 Larcheveque Mar 2011 B2
7925621 Sikchi Apr 2011 B2
7934098 Hahn et al. Apr 2011 B1
7937651 Kelkar et al. May 2011 B2
7971139 Stanciu Jun 2011 B2
7979856 Murray Jul 2011 B2
8001459 Rivers-Moore Aug 2011 B2
8010515 Mirzad Aug 2011 B2
8074217 James Dec 2011 B2
8117552 Paoli Feb 2012 B2
8200975 O'Connor Jun 2012 B2
20010003828 Peterson et al. Jun 2001 A1
20010007109 Lange Jul 2001 A1
20010016880 Cai et al. Aug 2001 A1
20010022592 Alimpich et al. Sep 2001 A1
20010024195 Hayakawa Sep 2001 A1
20010027472 Guan Oct 2001 A1
20010037345 Kiernan et al. Nov 2001 A1
20010044850 Raz et al. Nov 2001 A1
20010047372 Gorelik et al. Nov 2001 A1
20010051907 Kumar et al. Dec 2001 A1
20010051928 Brody Dec 2001 A1
20010052121 Masuda et al. Dec 2001 A1
20010054004 Powers Dec 2001 A1
20010056411 Lindskog et al. Dec 2001 A1
20010056429 Moore et al. Dec 2001 A1
20010056460 Sahota et al. Dec 2001 A1
20020010700 Wotring Jan 2002 A1
20020010743 Ryan et al. Jan 2002 A1
20020010746 Jilk et al. Jan 2002 A1
20020010855 Reshef et al. Jan 2002 A1
20020013788 Pennell et al. Jan 2002 A1
20020019812 Board et al. Feb 2002 A1
20020019941 Chan et al. Feb 2002 A1
20020023111 Arora et al. Feb 2002 A1
20020023113 Hsing et al. Feb 2002 A1
20020026441 Kutay et al. Feb 2002 A1
20020026461 Kutay et al. Feb 2002 A1
20020026462 Shotton et al. Feb 2002 A1
20020032590 Anand et al. Mar 2002 A1
20020032692 Suzuki et al. Mar 2002 A1
20020032706 Perla et al. Mar 2002 A1
20020032768 Voskuil Mar 2002 A1
20020035579 Wang et al. Mar 2002 A1
20020035581 Reynar et al. Mar 2002 A1
20020035617 Lynch et al. Mar 2002 A1
20020040469 Pramberger Apr 2002 A1
20020049790 Ricker et al. Apr 2002 A1
20020052769 Navani et al. May 2002 A1
20020053021 Rice et al. May 2002 A1
20020054115 Mack et al. May 2002 A1
20020054126 Gamon May 2002 A1
20020054128 Lau et al. May 2002 A1
20020057297 Grimes et al. May 2002 A1
20020059566 Delcambre et al. May 2002 A1
20020065798 Bostleman et al. May 2002 A1
20020065847 Furukawa et al. May 2002 A1
20020065950 Katz et al. May 2002 A1
20020070973 Croley Jun 2002 A1
20020072951 Lee et al. Jun 2002 A1
20020078074 Cho et al. Jun 2002 A1
20020078103 Gorman et al. Jun 2002 A1
20020083145 Perinpanathan Jun 2002 A1
20020083148 Shaw et al. Jun 2002 A1
20020083318 Larose Jun 2002 A1
20020091738 Rohrabaugh et al. Jul 2002 A1
20020099952 Lambert et al. Jul 2002 A1
20020100027 Binding et al. Jul 2002 A1
20020103711 Karas et al. Aug 2002 A1
20020107885 Brooks et al. Aug 2002 A1
20020111699 Melli et al. Aug 2002 A1
20020111932 Roberge et al. Aug 2002 A1
20020112224 Cox Aug 2002 A1
20020124172 Manahan Sep 2002 A1
20020129056 Conant Sep 2002 A1
20020133484 Chau et al. Sep 2002 A1
20020143815 Sather Oct 2002 A1
20020147726 Yehia et al. Oct 2002 A1
20020147748 Huang Oct 2002 A1
20020152222 Holbrook Oct 2002 A1
20020152244 Dean et al. Oct 2002 A1
20020156772 Chau et al. Oct 2002 A1
20020156846 Rawat et al. Oct 2002 A1
20020156905 Weissman Oct 2002 A1
20020156929 Hekmatpour Oct 2002 A1
20020169752 Kusama et al. Nov 2002 A1
20020169789 Kutay et al. Nov 2002 A1
20020174147 Wang et al. Nov 2002 A1
20020174417 Sijacic et al. Nov 2002 A1
20020178187 Rasmussen et al. Nov 2002 A1
20020178380 Wolf et al. Nov 2002 A1
20020184188 Mandyam et al. Dec 2002 A1
20020184213 Lau et al. Dec 2002 A1
20020184219 Preisig et al. Dec 2002 A1
20020184401 Kadel, Jr. et al. Dec 2002 A1
20020184485 Dray et al. Dec 2002 A1
20020184491 Morgan et al. Dec 2002 A1
20020188597 Kern et al. Dec 2002 A1
20020188613 Chakraborty et al. Dec 2002 A1
20020194219 Bradley et al. Dec 2002 A1
20020194388 Boloker et al. Dec 2002 A1
20020196281 Audleman et al. Dec 2002 A1
20020196288 Emrani Dec 2002 A1
20020198891 Li et al. Dec 2002 A1
20020198935 Crandall et al. Dec 2002 A1
20030004951 Chokshi Jan 2003 A1
20030007000 Carlson et al. Jan 2003 A1
20030014397 Chau et al. Jan 2003 A1
20030014406 Faieta et al. Jan 2003 A1
20030018668 Britton et al. Jan 2003 A1
20030020746 Chen et al. Jan 2003 A1
20030023641 Gorman et al. Jan 2003 A1
20030023674 Hildebrand Jan 2003 A1
20030023953 Lucassen et al. Jan 2003 A1
20030025693 Haley Feb 2003 A1
20030025732 Prichard Feb 2003 A1
20030026507 Zlotnick Feb 2003 A1
20030028550 Lee et al. Feb 2003 A1
20030028762 Trilli et al. Feb 2003 A1
20030029911 Kitayama Feb 2003 A1
20030033037 Yuen et al. Feb 2003 A1
20030033179 Katz et al. Feb 2003 A1
20030033606 Puente et al. Feb 2003 A1
20030037021 Krothappalli et al. Feb 2003 A1
20030037303 Bodlaender et al. Feb 2003 A1
20030038788 Demartines et al. Feb 2003 A1
20030038846 Hori et al. Feb 2003 A1
20030043986 Creamer et al. Mar 2003 A1
20030046665 Ilin Mar 2003 A1
20030048301 Menninger Mar 2003 A1
20030051243 Lemmons et al. Mar 2003 A1
20030055811 Stork et al. Mar 2003 A1
20030055828 Koch et al. Mar 2003 A1
20030056198 Al-Azzawe et al. Mar 2003 A1
20030058286 Dando Mar 2003 A1
20030061386 Brown et al. Mar 2003 A1
20030061567 Brown et al. Mar 2003 A1
20030069881 Huttunen Apr 2003 A1
20030074279 Viswanath Apr 2003 A1
20030084424 Reddy et al. May 2003 A1
20030085918 Beaumont et al. May 2003 A1
20030093755 O'Carroll May 2003 A1
20030101414 Liu et al. May 2003 A1
20030103071 Lusen Jun 2003 A1
20030110443 Yankovich et al. Jun 2003 A1
20030120578 Newman Jun 2003 A1
20030120651 Bernstein et al. Jun 2003 A1
20030120659 Sridhar Jun 2003 A1
20030120671 Kim et al. Jun 2003 A1
20030120686 Kim et al. Jun 2003 A1
20030126555 Aggarwal et al. Jul 2003 A1
20030128196 Lapstun et al. Jul 2003 A1
20030135553 Pendakur Jul 2003 A1
20030135825 Gertner et al. Jul 2003 A1
20030140132 Champagne et al. Jul 2003 A1
20030140160 Raz et al. Jul 2003 A1
20030142072 Lapstun et al. Jul 2003 A1
20030149737 Lambert et al. Aug 2003 A1
20030149934 Worden Aug 2003 A1
20030154464 Ullmann et al. Aug 2003 A1
20030158897 Ben-Natan et al. Aug 2003 A1
20030163285 Nakamura et al. Aug 2003 A1
20030167277 Hejlsberg et al. Sep 2003 A1
20030172113 Cameron et al. Sep 2003 A1
20030182268 Lai Sep 2003 A1
20030182327 Ramanujam et al. Sep 2003 A1
20030187756 Klivington et al. Oct 2003 A1
20030187930 Ghaffar et al. Oct 2003 A1
20030188260 Jensen et al. Oct 2003 A1
20030189593 Yarvin Oct 2003 A1
20030192008 Lee Oct 2003 A1
20030200254 Wei Oct 2003 A1
20030200506 Abe et al. Oct 2003 A1
20030204481 Lau Oct 2003 A1
20030204511 Brundage Oct 2003 A1
20030204814 Elo et al. Oct 2003 A1
20030205615 Marappan Nov 2003 A1
20030206170 Bickmore Nov 2003 A1
20030210428 Bevlin et al. Nov 2003 A1
20030212664 Breining et al. Nov 2003 A1
20030212902 van der Made Nov 2003 A1
20030212988 Tsai et al. Nov 2003 A1
20030217053 Bachman et al. Nov 2003 A1
20030218620 Lai et al. Nov 2003 A1
20030220930 Milleker et al. Nov 2003 A1
20030225469 DeRemer et al. Dec 2003 A1
20030225768 Chaudhuri et al. Dec 2003 A1
20030225829 Pena et al. Dec 2003 A1
20030226111 Wirts et al. Dec 2003 A1
20030226132 Tondreau et al. Dec 2003 A1
20030229716 Holland Dec 2003 A1
20030233374 Spinola et al. Dec 2003 A1
20030233644 Cohen et al. Dec 2003 A1
20030236859 Vaschillo et al. Dec 2003 A1
20030236903 Piotrowski Dec 2003 A1
20030237046 Parker et al. Dec 2003 A1
20030237047 Borson Dec 2003 A1
20040002939 Arora Jan 2004 A1
20040002950 Brennan et al. Jan 2004 A1
20040003031 Brown et al. Jan 2004 A1
20040003341 alSafadi et al. Jan 2004 A1
20040003353 Rivera et al. Jan 2004 A1
20040003389 Reynar et al. Jan 2004 A1
20040006744 Jones et al. Jan 2004 A1
20040010752 Chan et al. Jan 2004 A1
20040010753 Salter Jan 2004 A1
20040015778 Britton et al. Jan 2004 A1
20040015783 Lennon et al. Jan 2004 A1
20040024720 Fairweather Feb 2004 A1
20040024842 Witt Feb 2004 A1
20040030991 Hepworth et al. Feb 2004 A1
20040031052 Wannamaker et al. Feb 2004 A1
20040039881 Shoebridge et al. Feb 2004 A1
20040039990 Bakar et al. Feb 2004 A1
20040039993 Kougiouris et al. Feb 2004 A1
20040044961 Pesenson Mar 2004 A1
20040044965 Toyama et al. Mar 2004 A1
20040046787 Henry et al. Mar 2004 A1
20040046789 Inanoria Mar 2004 A1
20040054966 Busch et al. Mar 2004 A1
20040059754 Barghout et al. Mar 2004 A1
20040060006 Lindblad et al. Mar 2004 A1
20040073565 Kaufman et al. Apr 2004 A1
20040073868 Easter et al. Apr 2004 A1
20040073924 Pendakur Apr 2004 A1
20040078756 Napper et al. Apr 2004 A1
20040083426 Sahu Apr 2004 A1
20040083431 Graham et al. Apr 2004 A1
20040088320 Perry May 2004 A1
20040088647 Miller et al. May 2004 A1
20040088652 Abe et al. May 2004 A1
20040093296 Phelan et al. May 2004 A1
20040093596 Koyano May 2004 A1
20040107367 Kisters Jun 2004 A1
20040117439 Levett et al. Jun 2004 A1
20040117769 Lauzon et al. Jun 2004 A1
20040123277 Schrader et al. Jun 2004 A1
20040128296 Krishnamurthy et al. Jul 2004 A1
20040139400 Allam et al. Jul 2004 A1
20040146199 Berkner et al. Jul 2004 A1
20040148178 Brain Jul 2004 A1
20040148514 Fee et al. Jul 2004 A1
20040148571 Lue Jul 2004 A1
20040162741 Flaxer et al. Aug 2004 A1
20040163041 Engel Aug 2004 A1
20040163046 Chu et al. Aug 2004 A1
20040172442 Ripley Sep 2004 A1
20040181543 Wu et al. Sep 2004 A1
20040181711 Johnson et al. Sep 2004 A1
20040186762 Beaven et al. Sep 2004 A1
20040189708 Larcheveque et al. Sep 2004 A1
20040189716 Paoli et al. Sep 2004 A1
20040194035 Chakraborty Sep 2004 A1
20040196266 Matsuura et al. Oct 2004 A1
20040199572 Hunt et al. Oct 2004 A1
20040205473 Fisher et al. Oct 2004 A1
20040205525 Murren et al. Oct 2004 A1
20040205534 Koelle Oct 2004 A1
20040205571 Adler et al. Oct 2004 A1
20040205592 Huang Oct 2004 A1
20040205605 Adler et al. Oct 2004 A1
20040205644 Shaughnessy et al. Oct 2004 A1
20040205653 Hadfield et al. Oct 2004 A1
20040205671 Sukehiro et al. Oct 2004 A1
20040210599 Friedman et al. Oct 2004 A1
20040210645 Kouznetsov et al. Oct 2004 A1
20040215665 Edgar et al. Oct 2004 A1
20040216084 Brown et al. Oct 2004 A1
20040220912 Manikutty et al. Nov 2004 A1
20040221238 Cifra et al. Nov 2004 A1
20040221245 Chickles et al. Nov 2004 A1
20040225749 Pavlik et al. Nov 2004 A1
20040230676 Spivack et al. Nov 2004 A1
20040237030 Malkin Nov 2004 A1
20040237120 Lewin et al. Nov 2004 A1
20040260593 Abraham-Fuchs et al. Dec 2004 A1
20040261019 Imamura et al. Dec 2004 A1
20040261032 Olander et al. Dec 2004 A1
20040268229 Paoli et al. Dec 2004 A1
20040268259 Rockey et al. Dec 2004 A1
20040268260 Rockey et al. Dec 2004 A1
20050004893 Sangroniz Jan 2005 A1
20050005248 Rockey et al. Jan 2005 A1
20050015279 Rucker Jan 2005 A1
20050015732 Vedula et al. Jan 2005 A1
20050022115 Baumgartner et al. Jan 2005 A1
20050027676 Eichstaedt Feb 2005 A1
20050027757 Kiessig et al. Feb 2005 A1
20050028073 Henry et al. Feb 2005 A1
20050033626 Kruse et al. Feb 2005 A1
20050033657 Herrington et al. Feb 2005 A1
20050033728 James et al. Feb 2005 A1
20050038711 Marlelo Feb 2005 A1
20050050066 Hughes Mar 2005 A1
20050055627 Lloyd et al. Mar 2005 A1
20050060324 Johnson et al. Mar 2005 A1
20050060647 Doan et al. Mar 2005 A1
20050060721 Choudhary et al. Mar 2005 A1
20050065933 Goering Mar 2005 A1
20050065936 Goering Mar 2005 A1
20050066287 Tattrie et al. Mar 2005 A1
20050071752 Marlatt Mar 2005 A1
20050076022 Wu et al. Apr 2005 A1
20050076049 Qubti et al. Apr 2005 A1
20050080801 Kothandaraman et al. Apr 2005 A1
20050091285 Krishnan et al. Apr 2005 A1
20050091305 Lange et al. Apr 2005 A1
20050097536 Bernstein et al. May 2005 A1
20050102370 Lin et al. May 2005 A1
20050102612 Allan et al. May 2005 A1
20050108104 Woo May 2005 A1
20050108262 Fawcett, Jr. et al. May 2005 A1
20050108624 Carrier May 2005 A1
20050108633 Sahota et al. May 2005 A1
20050114757 Sahota et al. May 2005 A1
20050114764 Gudenkauf et al. May 2005 A1
20050119910 Schneider Jun 2005 A1
20050132043 Wang et al. Jun 2005 A1
20050132196 Dietl Jun 2005 A1
20050138031 Wefers Jun 2005 A1
20050138086 Pecht-Seibert Jun 2005 A1
20050138539 Bravery et al. Jun 2005 A1
20050149375 Wefers Jul 2005 A1
20050149726 Joshi et al. Jul 2005 A1
20050159136 Rouse et al. Jul 2005 A1
20050160398 Bjornson et al. Jul 2005 A1
20050165615 Minar Jul 2005 A1
20050171746 Thalhammer-Reyero Aug 2005 A1
20050182645 Ehlis et al. Aug 2005 A1
20050183006 Rivers-Moore et al. Aug 2005 A1
20050198086 Moore et al. Sep 2005 A1
20050198125 Macleod Beck et al. Sep 2005 A1
20050198247 Perry et al. Sep 2005 A1
20050210263 Levas et al. Sep 2005 A1
20050216439 Kawakita Sep 2005 A1
20050216452 Teague Sep 2005 A1
20050216837 Washburn Sep 2005 A1
20050223063 Chang et al. Oct 2005 A1
20050223320 Brintzenhofe et al. Oct 2005 A1
20050228887 Wang Oct 2005 A1
20050234890 Enzler et al. Oct 2005 A1
20050240620 Danner et al. Oct 2005 A1
20050240876 Myers et al. Oct 2005 A1
20050246304 Knight et al. Nov 2005 A1
20050256933 Millington et al. Nov 2005 A1
20050257148 Goodman et al. Nov 2005 A1
20050262112 Moore Nov 2005 A1
20050268100 Gasparini et al. Dec 2005 A1
20050268217 Garrison Dec 2005 A1
20050268222 Cheng Dec 2005 A1
20050289147 Kahn et al. Dec 2005 A1
20050289468 Kahn et al. Dec 2005 A1
20060004703 Spivack et al. Jan 2006 A1
20060004910 Burd et al. Jan 2006 A1
20060010386 Khan Jan 2006 A1
20060020586 Prompt et al. Jan 2006 A1
20060020883 Kothari et al. Jan 2006 A1
20060026500 Qa ‘Im-maqami’ Feb 2006 A1
20060026534 Ruthfield et al. Feb 2006 A1
20060031757 Vincent Feb 2006 A9
20060036995 Chickles et al. Feb 2006 A1
20060041593 Borthakur et al. Feb 2006 A1
20060041838 Khan Feb 2006 A1
20060053293 Zager et al. Mar 2006 A1
20060059107 Elmore et al. Mar 2006 A1
20060059434 Boss et al. Mar 2006 A1
20060069605 Hatoun Mar 2006 A1
20060069985 Friedman et al. Mar 2006 A1
20060074981 Mauceri Apr 2006 A1
20060075245 Meier Apr 2006 A1
20060080657 Goodman Apr 2006 A1
20060085409 Rys et al. Apr 2006 A1
20060095507 Watson May 2006 A1
20060101037 Brill et al. May 2006 A1
20060101051 Carr et al. May 2006 A1
20060107206 Koskimies May 2006 A1
20060129583 Catorcini et al. Jun 2006 A1
20060129917 Volk et al. Jun 2006 A1
20060129978 Abrari et al. Jun 2006 A1
20060136422 Matveief et al. Jun 2006 A1
20060143220 Spencer, Jr. Jun 2006 A1
20060155857 Feenan et al. Jul 2006 A1
20060161559 Bordawekar et al. Jul 2006 A1
20060161837 Kelkar et al. Jul 2006 A1
20060161845 Kahn et al. Jul 2006 A1
20060173865 Fong Aug 2006 A1
20060173985 Moore Aug 2006 A1
20060184393 Ewin et al. Aug 2006 A1
20060191662 Deibl et al. Aug 2006 A1
20060195413 Davis et al. Aug 2006 A1
20060200443 Kahn et al. Sep 2006 A1
20060200740 Kahn et al. Sep 2006 A1
20060200754 Kablesh et al. Sep 2006 A1
20060203081 Pulitzer Sep 2006 A1
20060206803 Smith Sep 2006 A1
20060218403 Sauve et al. Sep 2006 A1
20060230363 Rapp Oct 2006 A1
20060242663 Gogerty Oct 2006 A1
20060248468 Constantine et al. Nov 2006 A1
20060253459 Kahn et al. Nov 2006 A1
20060253489 Kahn et al. Nov 2006 A1
20060265518 Owens et al. Nov 2006 A1
20060271839 Gottlieb et al. Nov 2006 A1
20060282552 Bhesania et al. Dec 2006 A1
20060288011 Gandhi et al. Dec 2006 A1
20060288329 Gandhi et al. Dec 2006 A1
20070005611 Takasugi et al. Jan 2007 A1
20070005978 O'Connor Jan 2007 A1
20070011156 Maron Jan 2007 A1
20070011665 Gandhi et al. Jan 2007 A1
20070036433 Teutsch Feb 2007 A1
20070050446 Moore Mar 2007 A1
20070050719 Lui et al. Mar 2007 A1
20070061467 Essey Mar 2007 A1
20070061706 Cupala Mar 2007 A1
20070074106 Ardeleanu Mar 2007 A1
20070088554 Harb et al. Apr 2007 A1
20070094589 Paoli Apr 2007 A1
20070100836 Eichstaedt et al. May 2007 A1
20070100877 Paoli May 2007 A1
20070100967 Smith et al. May 2007 A1
20070101280 Paoli May 2007 A1
20070101313 Bodin et al. May 2007 A1
20070118538 Ahern et al. May 2007 A1
20070118803 Walker et al. May 2007 A1
20070130500 Rivers-Moore et al. Jun 2007 A1
20070130504 Betancourt et al. Jun 2007 A1
20070186157 Walker et al. Aug 2007 A1
20070208606 MacKay et al. Sep 2007 A1
20070208759 von Koch Sep 2007 A1
20070208769 Boehm et al. Sep 2007 A1
20070245251 Kim Oct 2007 A1
20070276768 Pallante Nov 2007 A1
20080021916 Schnelle et al. Jan 2008 A1
20080027896 Anjur Jan 2008 A1
20080028340 Davis Jan 2008 A1
20080040635 Larcheveque Feb 2008 A1
20080052287 Stanciu Feb 2008 A1
20080126402 Sikchi et al. May 2008 A1
20080134162 James Jun 2008 A1
20080162498 Omoigui Jul 2008 A1
20080189335 Sikchi Aug 2008 A1
20080195483 Moore Aug 2008 A1
20080222514 Rivers-Moore Sep 2008 A1
20090013266 Gandhi Jan 2009 A1
20090019063 Gandhi Jan 2009 A1
20090043798 Tan et al. Feb 2009 A1
20090044103 Chalecki et al. Feb 2009 A1
20090070411 Chang et al. Mar 2009 A1
20090119580 Rohrabaugh et al. May 2009 A1
20090138389 Barthel May 2009 A1
20090177961 Fortini Jul 2009 A1
20100125778 Kelkar May 2010 A1
20100229110 Rockey et al. Sep 2010 A1
20110173560 Larcheveque Jul 2011 A1
20110239101 Rivers-Moore Sep 2011 A1
Foreign Referenced Citations (54)
Number Date Country
2006200285 Jan 2011 AU
1536483 Oct 2004 CN
0841615 May 1998 EP
0961197 Dec 1999 EP
1076290 Feb 2001 EP
1221661 Jul 2002 EP
1997023 Dec 2008 EP
2325745 May 2011 EP
63085960 Apr 1988 JP
401173140 Jul 1989 JP
3191429 Aug 1991 JP
4225466 Aug 1992 JP
04290126 Oct 1992 JP
5314152 Nov 1993 JP
406014105 Jan 1994 JP
6139241 May 1994 JP
6180697 Jun 1994 JP
6180698 Jun 1994 JP
08263246 Oct 1996 JP
08263247 Oct 1996 JP
09016801 Jan 1997 JP
09134273 May 1997 JP
09146736 Jun 1997 JP
09190327 Jul 1997 JP
09251370 Sep 1997 JP
09292967 Nov 1997 JP
10011255 Jan 1998 JP
10097559 Apr 1998 JP
10171662 Jun 1998 JP
10207805 Aug 1998 JP
10232754 Sep 1998 JP
10240434 Sep 1998 JP
10260765 Sep 1998 JP
2000029713 Jan 2000 JP
2000132436 May 2000 JP
2002183652 Jun 2002 JP
2003173288 Jun 2003 JP
2003296235 Oct 2003 JP
2003316769 Nov 2003 JP
2003337648 Nov 2003 JP
2004054749 Feb 2004 JP
2004341675 Dec 2004 JP
2008547117 Dec 2008 JP
4833490 Sep 2011 JP
2413987 Mar 2011 RU
200506661 Feb 2004 TW
1224742 Dec 2004 TW
WO-9924945 May 1999 WO
WO-9956207 Nov 1999 WO
WO-0126018 Apr 2001 WO
WO-0144934 Jun 2001 WO
WO-0157720 Aug 2001 WO
WO-0198888 Dec 2001 WO
WO-2005089336 Sep 2005 WO
Non-Patent Literature Citations (597)
Entry
“About Microsoft Word”, Microsoft Word 2000, published 1983-1999, and Microsoft Excel 2000 (see Screen Shot “About Microsoft Excel”) Published 1988-1999, 3 pages.
“Advisory Action”, U.S. Appl. No. 10/185,048, (Jun. 20, 2006), 3 Pages.
“Advisory Action”, U.S. Appl. No. 10/185,048, (Sep. 16, 2005), 3 Pages.
“Advisory Action”, U.S. Appl. No. 10/632,437, (Aug. 23, 2006), 3 pages.
“Advisory Action”, U.S. Appl. No. 10/898,657, (Mar. 25, 2008), 3 pages.
“Advisory Action”, U.S. Appl. No. 10/916,692, (Dec. 10, 2008), 3 Pages.
“Advisory Action”, U.S. Appl. No. 10/942,528, (Oct. 26, 2009), 3 pages.
“Advisory Action”, U.S. Appl. No. 11/276,584, (Apr. 17, 2009), 3 pages.
“Altova Tools for XPath 1.0/2.0”, Retrieved from <<http://www.alova.comdev—portal—xpath.html>>, (2005), 12 pages.
“Applicants' Statement Regarding a Non-Public Use”, (May 31, 2006), 1 page.
“Architecture for a Dynamic Information Area Control”, IBM Technical Disclosure Bulletin, IBM Corp. New York, US, vol. 37, No. 10, Oct. 1, 1994, pp. 245-246, XP000475650 ISSN: 0018-8689.
“Attensa Outlook—Getting Started”, www.attensa.com, (2005), pp. 1-33.
“Blogdigger—Add Feed Form”, Internet Resource, Retrieved from <http://web.archive.org/web/20050618015745/http://www.blogdigger.com/add.jsp> on Nov. 13, 2008, 1 page.
“Bradbury Software FeedDemon 1.0”, (May 26, 2004), 3 pages.
“Copying the Search Form to Custom Pages in Windows SharePoint Services-based Web Sites”, Retrieved from <www.sharepointcustomization.com/resources/tipstricks/04wss-searchbox-tip.htm> (Feb. 11, 2009), Microsoft Corp,(2003), 1 page.
“Copying the Search Form to Services-based Web Sites”, Cybook, Inc., the whole document (Jul. 26, 2004), 1 page.
“Dreamweaver Technote, Changes in Copying and Pasting in Dreamweaver 4”, Macromedia, Inc., (Mar. 12, 2001), 3 pages.
“Dreamweaver Technote: Changes in copying and pasting in Dreamweaver 4”, http://store1.adobe.com/cfusion/knowledgebase/index.cfm?id=tn—15152, (Mar. 2001), 2 pages.
“Enter Key”, Retrieved from: <http://systems.webopedia.com/TERM/Enter—key.html> on Dec. 20, 2006, (Sep. 1, 1996), 1 page.
“EP Office Action”, Application No. 06111546.5, (Oct. 15, 2008), 5 pages.
“EP Search Report”, Application No. 07751586.4, (Aug. 13, 2009), 9 pages.
“EP Search Report”, Application Serial No. 07750552.7, EESR,(Sep. 30, 2009), 6 pages.
“EP Search Report”, EP Application No. 00306806, (Jul. 16, 2003), 3 pages.
“EP Search Report”, EP Application No. 05112241.4, (Mar. 18, 2010), 10 pages.
“EP Search Report”, EP Application No. 97307138, (Mar. 21, 2003), 3 pages.
“European Search Report”, EP Application No. 06111546.5, (Nov. 9, 2006), 5 pages.
“Excel Developer Tip: Determining the Data Type of a Cell”, Retrieved from <http://jwalk.com/ss/excel/tips/tip62.htm>, (May 13, 1998), 1 page.
“Feed Splicing, Part 1”, Retrieved from: <http://blogs.feedburner.com/feedburner/archives/2004/07/feed—splicing—part—i.php> on Jul. 14, 2004, 5 pages.
“Feed Splicing, Part 2”, Retrieved from <http://blogs.feedburner.com/feedburner/archives/2004/08feed—splicing—part—ii.php> on Dec. 8, 2008, (Aug. 16, 2004), 5 pages.
“FeedBurner”, Retrieved from <http://www.feedburner.com> on Dec. 8, 2008, (Feb. 25, 2004), 1 Page.
“Final Office Action”, U.S. Appl. No. 09/599,086, (Mar. 6, 2008), 47 pages.
“Final Office Action”, U.S. Appl. No. 09/599,086, (May 10, 2007), 41 pages.
“Final Office Action”, U.S. Appl. No. 09/599,086, (May 25, 2004), 23 pages.
“Final Office Action”, U.S. Appl. No. 09/599,086, (Jul. 5, 2006), 34 pages.
“Final Office Action”, U.S. Appl. No. 09/599,086, (Aug. 8, 2005), 27 pages.
“Final Office Action”, U.S. Appl. No. 09/599,299, (Apr. 20, 2004), 23 pages.
“Final Office Action”, U.S. Appl. No. 09/599,812, (Aug. 12, 2003), 38 pages.
“Final Office Action”, U.S. Appl. No. 10/178,291, (Dec. 19, 2005), 21 pages.
“Final Office Action”, U.S. Appl. No. 10/185,048, (Mar. 13, 2006), 14 Pages.
“Final Office Action”, U.S. Appl. No. 10/185,048, (Jun. 3, 2005), 14 Pages.
“Final Office Action”, U.S. Appl. No. 10/402,640, (Aug. 28, 2009), 17 pages.
“Final Office Action”, U.S. Appl. No. 10/402,640, (Sep. 10, 2007), 16 pages.
“Final Office Action”, U.S. Appl. No. 10/609,274, (Oct. 3, 2008), 50 pages.
“Final Office Action”, U.S. Appl. No. 10/609,274, (Oct. 31, 2007), 41 pages.
“Final Office Action”, U.S. Appl. No. 10/632,437, (Jan. 25, 2008), 25 pages.
“Final Office Action”, U.S. Appl. No. 10/632,437, (Jun. 1, 2006), 21 pages.
“Final Office Action”, U.S. Appl. No. 10/723,188, (Jan. 9, 2009), 20 pages.
“Final Office Action”, U.S. Appl. No. 10/723,863, (Sep. 19, 2007), 34 Pages.
“Final Office Action”, U.S. Appl. No. 10/770,240, (Apr. 13, 2011), 17 pages.
“Final Office Action”, U.S. Appl. No. 10/770,240, (Jun. 26, 2009), 15 pages.
“Final Office Action”, U.S. Appl. No. 10/770,240, (Jun. 29, 2007), 28 pages.
“Final Office Action”, U.S. Appl. No. 10/781,586, (Aug. 9, 2007), 20 pages.
“Final Office Action”, U.S. Appl. No. 10/846,428, (Mar. 3, 2008), 23 pages.
“Final Office Action”, U.S. Appl. No. 10/857,689, (Jan. 6, 2009), 17 pages.
“Final Office Action”, U.S. Appl. No. 10/876,418, (May 22, 2008), 14 pages.
“Final Office Action”, U.S. Appl. No. 10/897,647, (Mar. 6, 2008), 25 pages.
“Final Office Action”, U.S. Appl. No. 10/897,647, (Jul. 14, 2009), 36 pages.
“Final Office Action”, U.S. Appl. No. 10/898,656, (Nov. 15, 2007), 16 pages.
“Final Office Action”, U.S. Appl. No. 10/898,657, (Jan. 3, 2008), 21 pages.
“Final Office Action”, U.S. Appl. No. 10/916,692, (Oct. 2, 2008), 10 Pages.
“Final Office Action”, U.S. Appl. No. 10/916,692, (Nov. 16, 2009), 10 pages.
“Final Office Action”, U.S. Appl. No. 10/942,528, (Sep. 17, 2009), 27 pages.
“Final Office Action”, U.S. Appl. No. 10/955,087, (May 16, 2008), 13 pages.
“Final Office Action”, U.S. Appl. No. 10/955,666, (Oct. 14, 2009), 24 pages.
“Final Office Action”, U.S. Appl. No. 10/955,666, (Oct. 31, 2008), 24 pages.
“Final Office Action”, U.S. Appl. No. 10/955,666, (Aug. 30, 2007), 19 pages.
“Final Office Action”, U.S. Appl. No. 10/976,451, (Jul. 2, 2009), 13 pages.
“Final Office Action”, U.S. Appl. No. 10/976,451, (Apr. 6, 2011), 10 pages.
“Final Office Action”, U.S. Appl. No. 10/976,451, (Jul. 27, 2010), 12 pages.
“Final Office Action”, U.S. Appl. No. 10/977,198, (Aug. 19, 2009), 15 pages.
“Final Office Action”, U.S. Appl. No. 10/977,198, (Sep. 3, 2008), 13 pages.
“Final Office Action”, U.S. Appl. No. 10/977,198, (Oct. 11, 2007), 10 pages.
“Final Office Action”, U.S. Appl. No. 10/988,718, (Jan. 30, 2008), 15 pages.
“Final Office Action”, U.S. Appl. No. 10/988,718, (Dec. 22, 2008), 17 pages.
“Final Office Action”, U.S. Appl. No. 10/988,732, (Nov. 12, 2010), 37 pages.
“Final Office Action”, U.S. Appl. No. 10/988,732, (Nov. 13, 2009), 33 pages.
“Final Office Action”, U.S. Appl. No. 10/988,732, (Dec. 10, 2008), 29 pages.
“Final Office Action”, U.S. Appl. No. 11/012,472, (Mar. 23, 2010), 10 pages.
“Final Office Action”, U.S. Appl. No. 11/036,910, (May 26, 2010), 9 pages.
“Final Office Action”, U.S. Appl. No. 11/044,106, (Apr. 13, 2009), 16 pages.
“Final Office Action”, U.S. Appl. No. 11/056,500, (Apr. 16, 2009), 10 pages.
“Final Office Action”, U.S. Appl. No. 11/072,087, (Nov. 16, 2009), 9 pages.
“Final Office Action”, U.S. Appl. No. 11/095,254, (Dec. 22, 2008), 9 pages.
“Final Office Action”, U.S. Appl. No. 11/107,347, (Apr. 2, 2009), 11 pages.
“Final Office Action”, U.S. Appl. No. 11/107,347, (Mar. 22, 2010), 11 pages.
“Final Office Action”, U.S. Appl. No. 11/158,398, (Oct. 15, 2010), 11 pages.
“Final Office Action”, U.S. Appl. No. 11/158,398, (Feb. 25, 2009), 12 pages.
“Final Office Action”, U.S. Appl. No. 11/158,398, (Mar. 22, 2010), 11 pages.
“Final Office Action”, U.S. Appl. No. 11/158,911, (Oct. 15, 2010), 13 pages.
“Final Office Action”, U.S. Appl. No. 11/158,911, (Oct. 28, 2009), 10 pages.
“Final Office Action”, U.S. Appl. No. 11/158,936, (Jun. 26, 2009), 16 pages.
“Final Office Action”, U.S. Appl. No. 11/158,936, (Jul. 19, 2010), 14 pages.
“Final Office Action”, U.S. Appl. No. 11/170,521, (Sep. 8, 2009), 12 pages.
“Final Office Action”, U.S. Appl. No. 11/170,521, (Jun. 29, 2010), 13 pages.
“Final Office Action”, U.S. Appl. No. 11/203,818, (Apr. 14, 2009), 25 pages.
“Final Office Action”, U.S. Appl. No. 11/203,937, (May 7, 2009), 8 pages.
“Final Office Action”, U.S. Appl. No. 11/218,149, (Nov. 16, 2009), 18 pages.
“Final Office Action”, U.S. Appl. No. 11/218,149, (May 19, 2010), 17 pages.
“Final Office Action”, U.S. Appl. No. 11/226,044, (Apr. 20, 2009), 21 pages.
“Final Office Action”, U.S. Appl. No. 11/227,550, (Jan. 19, 2010), 12 pages.
“Final Office Action”, U.S. Appl. No. 11/227,550, (Aug. 19, 2010), 12 pages.
“Final Office Action”, U.S. Appl. No. 11/234,767, (Jan. 26, 2010), 23 pages.
“Final Office Action”, U.S. Appl. No. 11/234,767, (Mar. 10, 2011), 28 pages.
“Final Office Action”, U.S. Appl. No. 11/234,767, (Jun. 10, 2009), 23 pages.
“Final Office Action”, U.S. Appl. No. 11/276,536, (Apr. 23, 2010), 20 pages.
“Final Office Action”, U.S. Appl. No. 11/276,584, (Oct. 29, 2009), 12 pages.
“Final Office Action”, U.S. Appl. No. 11/295,178, (Dec. 24, 2009), 38 pages.
“Final Office Action”, U.S. Appl. No. 11/295,178, (Jul. 30, 2010), 43 pages.
“Final Office Action”, U.S. Appl. No. 11/557,931, (Feb. 26, 2010), 8 pages.
“Final Office Action”, U.S. Appl. No. 11/567,140, (Aug. 19, 2010), 10 pages.
“Final Office Action”, U.S. Appl. No. 11/927,296, (Jul. 7, 2011), 12 pages.
“Final Office Action”, U.S. Appl. No. 12/061,613, (Apr. 28, 2011), 11 pages.
“First Office Action”, Chinese Application No. 200780007512.9, (Jan. 15, 2010), 7 pages.
“First Office Action”, Chinese Application No. 200780008302.1, (Jan. 8, 2010), 15 pages.
“flaggeditems.png”, Print screen from Internet Search, Retrieved from <http://web.archive.org/web/20050623095655/http://ranchero.com/images/nnw2/flaggeditems.png> on Nov. 13, 2008, 1 page.
“Foreign Decision of Grant”, Russian Application No. 2006103267, (Aug. 13, 2010), 18 pages.
“Foreign Decision of Grant”, Russian Application No. 2006105526, (Nov. 8, 2010), 16 pages.
“Foreign Notice of Allowance”, Mexican Application No. PA/a/2005/012067, (Nov. 13, 2009), 3 pages.
“Foreign Office Action”, Application Serial No. 07750552.7, (Nov. 17, 2009), 6 pages.
“Foreign Office Action”, Application Serial No. 2,412,611, (Feb. 9, 2009), 6 pages.
“Foreign Office Action”, Application Serial No. 2002-503702, Final Notice of Rejection, (Jun. 5, 2009), 211 pages.
“Foreign Office Action”, Application Serial No. 200610003709.2, (Jan. 9, 2009), 8 pages.
“Foreign Office Action”, Application Serial No. 200680018421.0, (Jan. 9, 2009), 10 pages.
“Foreign Office Action”, Application Serial No. PA/a/2006/002493, (Sep. 14, 2009), 2 pages.
“Foreign Office Action”, Australian Application No. 2006200483, (Aug. 27, 2010),1 page.
“Foreign Office Action”, Australian Application No. 2006262540, (Oct. 8, 2010),1 page.
“Foreign Office Action”, Australian Patent Application No. 2006200285, (May 20, 2010), 2 pages.
“Foreign Office Action”, Canadian Application No. 2408313 (Oct. 26, 2010), 5 pages.
“Foreign Office Action”, Canadian Application No. 2412611, (Oct. 26, 2010), 2 pages.
“Foreign Office Action”, Chinese Application No. 200610051544.X, (Dec. 4, 2009), 9 pages.
“Foreign Office Action”, Chinese Application No. 200610051554.X, (Jul. 10, 2009), 11 pages.
“Foreign Office Action”, Chinese Application No. 200610051554.X, (Jun. 25, 2010), 10 pages.
“Foreign Office Action”, Chinese Application No. 200680018421.0, (Jun. 24, 2010), 11 pages.
“Foreign Office Action”, Chinese Application No. 200680018421.0, (Sep. 3, 2010), 9 pages.
“Foreign Office Action”, Chinese Application No. 200680021415.0, (Jun. 8, 2010), 10 pages.
“Foreign Office Action”, EP Application No. 01935325.9, (Jul. 20, 2010), 6 pages.
“Foreign Office Action”, EP Application No. 05112241.4, (Dec. 23, 2010), 6 pages.
“Foreign Office Action”, European Patent Application No. 01935325.9, (Jun. 20, 2011), 5 pages.
“Foreign Office Action”, European Patent Application No. 01939368.5, (Feb. 25, 2010), 3 pages.
“Foreign Office Action”, European Patent Application No. 01939034.3, (Nov. 5, 2007), 3 pages.
“Foreign Office Action”, Japanese Application 2002-504575, (Dec. 14, 2010), 4 pages.
“Foreign Office Action”, Japanese Application No. 2002-503700, (May 10, 2011), 5 pages.
“Foreign Office Action”, Japanese Application No. 2002-503700, (Aug. 30, 2011), 4 pages.
“Foreign Office Action”, Japanese Application No. 2002-503701, (May 31, 2011), 10 pages.
“Foreign Office Action”, Japanese Application No. 2002-530701, (Aug. 10, 2010), 11 pages.
“Foreign Office Action”, Japanese Application No. 2006-060050, (Aug. 26, 2011), 4 pages.
“Foreign Office Action”, Japanese Application No. 2006-071589, (Mar. 29, 2011), 9 pages.
“Foreign Office Action”, Mexican Patent Application No. PA/a/2006/002493, (Sep. 14, 2009), 5 pages.
“Foreign Office Action”, Russian Application No. 2006103267, (Apr. 20, 2010), 10 pages.
“Foreign Office Action”, Russian Application No. 2006105526, (Apr. 15, 2010), 10 pages.
“Foreign Office Action”, Russian Application No. 2006105526, (Aug. 24, 2010), 5 pages.
“Google Reader: beta feed reader”, Retrieved from <http://www.consumingexperience.com/2005/10/google-reader-beta-feed-reader.html,(Oct. 7, 2005), 8 pages.
“Google Reader: Reviewer's Guide”, Available at: <http://www.google.com/press/guides/reader—overview.pdf>, (Oct. 16, 2005), pp. 1-5.
“HP Blade Server BH Series Operating System Guide”, Hewlett-Packard,(Jul. 2002), pp. 1-69.
“Introduction to RSS”, Retrieved from: <http://www.webreference.com/authoring/languages/xml/rss/intro.> on Jan. 28, 2008, (Mar. 27, 2000), 3 Pages.
“Issue Notification”, U.S. Appl. No. 10/610,504, (Mar. 9, 2007), 1 Page.
“Issue Notification”, U.S. Appl. No. 10/955,087, (Mar. 18, 2009), 1 page.
“Issue Notification”, U.S. Appl. No. 10/988,718, (Aug. 12, 2009), 1 page.
“Issue Notification”, U.S. Appl. No. 11/095,254, (Feb. 10, 2010), 1 page.
“Issue Notification”, U.S. Appl. No. 11/276,585, (Jan. 21, 2009), 1 page.
“JP Notice of Publication”, Application Serial No. 2008-558275, (Aug. 6, 2009), 2 pages.
“JP Notice of Publication”, Application Serial No. 2008-558294, (Aug. 13, 2009), 2 pages.
“Kalsey—Blogfeed”, Internet Article, Retrieved from <http://web.archive.org/web/20050515005125/http://www.kalsey.com/tools/blogfeed/> on Nov. 13, 2008, pp. 1-3.
“Lotus Notes Release 5, Step by Step”, Lotus Development Corporation, (1999) ,224 pages.
“mainWindow2.png”, Print Screen from Internet Article, Retrieved from <http://web.archive.org/web/20050623095300/http://ranchero.com/images/nnw2/mainWindow2.png> on Nov. 13, 2008, 1 page.
“Manual of Patent Office Practice”, Computer-Implemented Inventions, Chapter 16.09.02., Data Structures, (Oct. 2010), 3 pages.
“Microsoft Computer Dictionary 5th Edition”, Entry for “Stack,” Microsoft Press, ISBN 0-7356-1495-4, (May 1, 2002), p. 495.
“Microsoft Computer Dictionary”, Microsoft Corporation, Microsoft Press, Fifth Edition, (Jun. 1, 2001), p. 149.
“Microsoft Visual Basic 5.0 Programmer's Guide”, Microsoft Press, (1997), pp. 42-43, 54-58, 578-579.
“Microsoft Word 2000 Screenshots”, (2000), pp. 11-17.
“Microsoft Word 2000 Screenshots”, Word,(2000), 1-17.
“Microsoft Word 2000”, Screenshots,(1999), pp. 1-5.
“Mott Porous Metal. The Most Reliable Means of Restricting Gas Flow”, Mott Corporation Webpage, retrieved from <<http://www.mottcorp.com/industry.oem/oem—flowres.htm>> on Aug. 23, 2004, 4 pages.
“NetNewsWire—helpbook—faq”, Internet Search FAQ sheet, Retrieved from <http://web.archive.org/web/20050623234918/http://ranchero.com/netnewswire/helpBook/faq.html> on Nov. 13, 2008, pp. 1-3.
“Netscape Communicator 4.61 for OS/2 Warp”, Netscape Communication Corporation, Software 1999, The Whole software release & Netscape—Version 4.61 {en}—010615, Netscape Screenshot,(Oct. 2, 2002), 1 page.
“Netscape Window”, Netscape Screenshot, (Oct. 2, 2002), 1 page.
“Non-Final Office Action”, U.S. Appl. No. 09/599,086, (Jan. 30, 2006), 33 pages.
“Non-Final Office Action”, U.S. Appl. No. 09/599,086, (Oct. 28, 2003), 21 pages.
“Non-Final Office Action”, U.S. Appl. No. 09/599,086, (Oct. 31, 2007), 48 pages.
“Non-Final Office Action”, U.S. Appl. No. 09/599,086, (Nov. 13, 2006), 33 pages.
“Non-Final Office Action”, U.S. Appl. No. 09/599,086, (Nov. 14, 2008), 55 pages.
“Non-Final Office Action”, U.S. Appl. No. 09/599,086, (Mar. 3, 2005), 25 pages.
“Non-Final Office Action”, U.S. Appl. No. 09/599,299, (Oct. 28, 2003), 32 pages.
“Non-Final Office Action”, U.S. Appl. No. 09/599,299, (Aug. 12, 2004), 12 pages.
“Non-Final Office Action”, U.S. Appl. No. 09/599,806, (Mar. 12, 2003), 7 pages.
“Non-Final Office Action”, U.S. Appl. No. 09/599,806, (Aug. 17, 2004), 5 pages.
“Non-Final Office Action”, U.S. Appl. No. 09/599,809, (May 13, 2009), 17 pages.
“Non-Final Office Action”, U.S. Appl. No. 09/599,812, (Feb. 27, 2003), 20 pages.
“Non-Final Office Action”, U.S. Appl. No. 09/599,812, (Feb. 5, 2004), 35 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/178,291, (Nov. 26, 2004), 21 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/178,291, (Apr. 29, 2004), 14 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/178,291, (Jun. 27, 2005), 22 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/185,048, (Dec. 8, 2004), 14 Pages.
“Non-Final Office Action”, U.S. Appl. No. 10/395,505, (Sep. 11, 2006), 8 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/402,640, (Oct. 6, 2006), 15 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/402,640, (Dec. 30, 2009), 16 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/402,640, (Feb. 12, 2008), 16 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/402,640, (Apr. 25, 2007), 16 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/402,640, (Apr. 30, 2010), 4 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/402,640, (Sep. 8, 2008), 16 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/609,274, (Jan. 17, 2007), 43 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/609,274, (Apr. 2, 2008), 43 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/610,504, (Mar. 9, 2006), 12 Pages.
“Non-Final Office Action”, U.S. Appl. No. 10/632,437, (Dec. 16, 2005), 22 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/632,437, (Jul. 26, 2007), 19 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/632,437, (Sep. 10, 2008), 28 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/723,863, (Feb. 8, 2007), 30 Pages.
“Non-Final Office Action”, U.S. Appl. No. 10/723,863, (Aug. 23, 2006), 16 Pages.
“Non-Final Office Action”, U.S. Appl. No. 10/723,863, (Nov. 6, 2007), 7 Pages.
“Non-Final Office Action”, U.S. Appl. No. 10/770,240, (Oct. 29, 2010), 14 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/770,240, (May 1, 2008), 30 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/770,240, (May 13, 2010), 15 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/770,240, (Aug. 24, 2006), 25 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/781,586, (Oct. 20, 2006), 21 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/846,428, (Oct. 15, 2008), 23 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/846,428, (Jul. 19, 2007), 19 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/854,961, (Nov. 15, 2006), 21 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/857,689, (Jun. 11, 2009), 20 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/871,586, (Jan. 9, 2008), 22 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/876,418, (Sep. 13, 2007), 14 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/876,433, (Apr. 24, 2009), 24 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/897,647, (Nov. 14, 2008), 28 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/897,647, (Sep. 6, 2007), 21 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/898,656, (Apr. 18, 2008), 17 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/898,656, (Jul. 13, 2007), 13 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/898,657, (Jul. 18, 2007), 18 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/898,657, (Sep. 8, 2008), 24 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/916,692, (Apr. 1, 2008), 9 Pages.
“Non-Final Office Action”, U.S. Appl. No. 10/916,692, (Apr. 30, 2009), 9 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/916,692, (Apr. 5, 2010), 6 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/939,588, (Aug. 27, 2009), 28 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/939,588, (Feb. 18, 2009), 29 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/942,528, (Mar. 6, 2009), 28 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/955,087, (Nov. 19, 2007), 22 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/955,665, (Apr. 2, 2009), 15 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/955,665, (Sep. 11, 2008), 16 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/955,666, (May 7, 2009), 24 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/955,666, (Dec. 26, 2006), 20 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/955,666, (Feb. 4, 2008), 20 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/976,451, (Feb. 23, 2009), 12 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/976,451, (Oct. 29, 2009), 14 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/976,451, (Nov. 10, 2010), 9 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/976,451, (Apr. 9, 2010), 11 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/977,198, (Jan. 10, 2008), 10 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/977,198, (Feb. 2, 2009), 15 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/977,198, (Mar. 9, 2007), 9 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/988,718, (Jan. 25, 2007), 13 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/988,718, (Jul. 21, 2008), 18 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/988,718, (Jul. 26, 2007), 21 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/988,720, (Apr. 2, 2009), 14 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/988,732, (Apr. 1, 2008), 27 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/988,732, (May 26, 2010), 36 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/988,732, (Jun. 11, 2009), 30 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/990,152, (May 28, 2009), 16 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/012,472, (Oct. 6, 2009), 8 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/012,472, (Jul. 1, 2010), 9 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/036,910, (Jun. 1, 2009), 8 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/036,910, (Nov. 13, 2009), 9 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/036,910, (Aug. 19, 2010), 8 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/044,106, (Sep. 24, 2009), 17 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/095,254, (Jun. 8, 2009), 8 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/095,254, (Apr. 17, 2008), 8 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/107,347, (Sep. 17, 2009), 9 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/107,347, (Jul. 9, 2010), 16 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/158,398, (Sep. 8, 2009), 9 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/158,398, (May 13, 2010), 10 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/158,911, (Jun. 30, 2009), 9 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/158,911, (Jun. 10, 2010), 11 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/158,936, (Jan. 12, 2010), 12 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/170,521, (Jan. 21, 2009), 10 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/170,521, (Dec. 17, 2009), 11 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/170,521, (Aug. 3, 2011), 16 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/218,149, (Jan. 14, 2010), 15 Pages.
“Non-Final Office Action”, U.S. Appl. No. 11/218,149, (Sep. 20, 2010), 15 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/227,550, (Aug. 3, 2009), 10 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/227,550, (Mar. 10, 2010), 12 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/234,767, (Feb. 26, 2009), 22 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/234,767, (Aug. 12, 2009), 24 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/234,767, (Nov. 26, 2010), 28 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/276,536, (Jan. 9, 2009), 33 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/276,536, (May 28, 2009), 18 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/276,536, (Oct. 7, 2009), 15 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/276,536, (Sep. 15, 2010), 13 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/276,584, (Jun. 25, 2009), 11 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/276,584, (Dec. 28, 2009), 12 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/276,584, (Jul. 26, 2010), 14 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/295,178, (May 26, 2010), 45 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/295,178, (May 27, 2009), 29 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/557,931, (Oct. 20, 2009), 27 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/567,140, (Feb. 18, 2011), 8 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/567,140, (May 18, 2010), 8 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/567,149, (Sep. 8, 2009), 5 pages.
“Non-Final Office Action”, U.S. Appl. No. 11/927,296, (Mar. 4, 2011), 19 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/021,894, (Dec. 31, 2009), 10 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/028,651, (Jan. 3, 2011), 16 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/061,613, (Sep. 28, 2010), 9 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/126,532, (Mar. 24, 2011), 23 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/234,449, (Oct. 27, 2010), 8 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/234,449, (Jun. 1, 2010), 8 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/249,973), (Apr. 12, 2011), 8 pages.
“Notice of Acceptance”, Australian Application No. 2006200483, (Dec. 17, 2010), 3 pages.
“Notice of Allowance”, U.S. Appl. No. 09/599,086, (Aug. 17, 2009), 59 pages.
“Notice of Allowance”, U.S. Appl. No. 09/599,299, (Nov. 30, 2004), 7 pages.
“Notice of Allowance”, U.S. Appl. No. 09/599,806, (Jan. 21, 2005), 9 pages.
“Notice of Allowance”, U.S. Appl. No. 09/599,812, (Aug. 3, 2004), 12 pages.
“Notice of Allowance”, U.S. Appl. No. 10/178,291, (Feb. 6, 2006), 7 pages.
“Notice of Allowance”, U.S. Appl. No. 10/395,505, (Oct. 4, 2006), 8 pages.
“Notice of Allowance”, U.S. Appl. No. 10/402,640, (Jun. 15, 2010), 6 pages.
“Notice of Allowance”, U.S. Appl. No. 10/404,312, (Jan. 12, 2009), 8 pages.
“Notice of Allowance”, U.S. Appl. No. 10/610,504, (Sep. 6, 2006), 4 Pages.
“Notice of Allowance”, U.S. Appl. No. 10/632,437, (May 21, 2009), 15 pages.
“Notice of Allowance”, U.S. Appl. No. 10/723,863, (Jun. 30, 2008), 9 Pages.
“Notice of Allowance”, U.S. Appl. No. 10/781,586, (May 9, 2008), 6 pages.
“Notice of Allowance”, U.S. Appl. No. 10/846,428, (Apr. 29, 2009), 10 pages.
“Notice of Allowance”, U.S. Appl. No. 10/854,961, (Jun. 14, 2007), 12 pages.
“Notice of Allowance”, U.S. Appl. No. 10/876,418, (Dec. 31, 2008), 8 pages.
“Notice of Allowance”, U.S. Appl. No. 10/897,647, (Jan. 19, 2010), 13 pages.
“Notice of Allowance”, U.S. Appl. No. 10/898,656, (Jan. 2, 2009), 9 pages.
“Notice of Allowance”, U.S. Appl. No. 10/898,657, (Jun. 11, 2009), 20 pages.
“Notice of Allowance”, U.S. Appl. No. 10/916,692, (Jun. 14, 2010), 6 pages.
“Notice of Allowance”, U.S. Appl. No. 10/939,588, (Mar. 10, 2010), 10 pages.
“Notice of Allowance”, U.S. Appl. No. 10/942,528, (Dec. 3, 2009), 8 pages.
“Notice of Allowance”, U.S. Appl. No. 10/955,087, (Dec. 11, 2008), 10 pages.
“Notice of Allowance”, U.S. Appl. No. 10/955,665, (Nov. 3, 2009), 8 pages.
“Notice of Allowance”, U.S. Appl. No. 10/988,718, (Apr. 9, 2009), 13 pages.
“Notice of Allowance”, U.S. Appl. No. 10/988,720, (Sep. 17, 2009), 18 pages.
“Notice of Allowance”, U.S. Appl. No. 10/990,152, (Dec. 21, 2009), 6 pages.
“Notice of Allowance”, U.S. Appl. No. 11/012,472, (Nov. 24, 2010), 6 pages.
“Notice of Allowance”, U.S. Appl. No. 11/036,910, (Dec. 7, 2010), 7 pages.
“Notice of Allowance”, U.S. Appl. No. 11/044,106, (Mar. 15, 2010), 7 pages.
“Notice of Allowance”, U.S. Appl. No. 11/056,500, (Dec. 2, 2009), 17 pages.
“Notice of Allowance”, U.S. Appl. No. 11/072,087, (Feb. 23, 2010), 4 pages.
“Notice of Allowance”, U.S. Appl. No. 11/095,254, (Nov. 18, 2009), 8 pages.
“Notice of Allowance”, U.S. Appl. No. 11/107,347, (Dec. 13, 2010), 11 pages.
“Notice of Allowance”, U.S. Appl. No. 11/167,514, (Mar. 11, 2009), 6 pages.
“Notice of Allowance”, U.S. Appl. No. 11/203,937, (Aug. 3, 2009), 7 pages.
“Notice of Allowance”, U.S. Appl. No. 11/203,937, (Aug. 31, 2009), 2 pages.
“Notice of Allowance”, U.S. Appl. No. 11/203,937, Supplemental,(Sep. 15, 2009), 2 pages.
“Notice of Allowance”, U.S. Appl. No. 11/218,149, (Feb. 11, 2011), 7 pages.
“Notice of Allowance”, U.S. Appl. No. 11/295,178, (Mar. 22, 2011), 20 pages.
“Notice of Allowance”, U.S. Appl. No. 11/557,931, (May 5, 2010), 7 pages.
“Notice of Allowance”, U.S. Appl. No. 11/872,703, (Jan. 27, 2010), 19 pages.
“Notice of Allowance”, U.S. Appl. No. 11/872,703, (May 14, 2010), 18 pages.
“Notice of Allowance”, U.S. Appl. No. 11/927,296, (Aug. 8, 2011), 7 pages.
“Notice of Allowance”, U.S. Appl. No. 11/931,730, (Feb. 2, 2011), 7 pages.
“Notice of Allowance”, U.S. Appl. No. 12/021,894, (Oct. 29, 2010), 9 pages.
“Notice of Re-Examination”, Application Serial No. 01813138.7, (Mar. 11, 2009), 27 pages.
“Notice of Reexamination”, Chinese Application No. 01813138.7, (Apr. 22, 2011), 14 pages.
“OLE Open Doc and Network”, Retrieved from http://www.pcwebopedia.com on May 9, 2006, Webopedia entries,(May 16, 1998), 7 pages.
“OMG XML Metadata Interchange (XMI) Specification”, Retrieved from: <http://www.omg.org/cgi-bin/doc?formal/02-01-01.pdf> on Dec. 2, 2009, Version 1.2,(Jan. 2002), 268 pages.
“PCT Search Report and Written Opinion”, Application No. PCT/US06/23336, (Oct. 29, 2007), 8 pages.
“PCT Search Report”, PCT Application No. PCT/IB98/01392, (Apr. 9, 1999), 3 pages.
“PCT Search Report”, PCT Application No. PCT/IB99/02003, (Nov. 28, 2000), 3 pages.
“PCT Search Report”, PCT Application No. PCT/US01/15581, (Jan. 29, 2003), 3 pages.
“PCT Search Report”, PCT Application No. PCT/US99/09620, (Sep. 22, 1999), 3 pages.
“Persistence.png”, Print Screen from Internet Article, Retrieved from <http://web.archive.org/web/20050623095937/http://ranchero.com/images/nnw2/persistence.png> on Nov. 13, 2008, 1 page.
“Protecting Commercial Secure Web Servers from Key-Finding Threats”, nCipher, Inc., Available at <www.ncipher.com/uploads/resources/pcws.pdf>,(1999), 12 pages.
“Ranchero Software—Editing LiveJournal Logs”, Internet Article, Retrieved from <http://web.archive.org/web/20051217022724/http://ranchero.com/netnewswire/tips/livejournalconfig.php> on Nov. 13, 2008, pp. 1-3.
“Ranchero Software—NetNewsWfaq”, Internet Search Engine FAQ sheet, Retrieved from <http://web.archive.org/web/20030201120948/http://ranchero.com/netnewswire/faq.php> on Nov. 13, 2008, pp. 1-4.
“Ranchero Software—NetNewsWire 2.0 Change Notes”, Internet Article, Retrieved from <http://web.archive.org/web/20051024203943/http://ranchero.com/netnewswire/changenotes/netnewswire20.php> on Nov. 13, 2008, 3 pages.
“Ranchero Software—Smart Lists”, Internet Article, Retrieved from <http://web.archive.org/web/2005062084724/http://ranchero.com/netnewswire/features/smartLists.php> on Nov. 13, 2008, pp. 1-2.
“Ranchero Software—Subscription Sharing”, Internet Article, Retrieved from <http://web.archive.org/web/20050811083741/http://ranchero.com/netnewswire/features/sharing.php> on Nov. 13, 2008, pp. 1-3.
“Ranchero Software Search Engine Subscriptions”, On-line Article, Retrieved from <http://web.archive.org/web/20050714082710/http://ranchero.com/netnewswire/features/searchEngineSubscriptions.php> on Nov. 13, 2008, pp. 1-2.
“Ranchero Software: NetNewsWire”, Internet Article, Retrieved from <http://web.archive.org/web/20051003204517/ranchero.com/netnewswire/> on Nov. 13, 2008, (2005), 5 pages.
“Ranchero Software: What's New in NetNewsWire 2.0”, Web article, retrieved from <http://web.archive.org/web/20050618014501/http://ranchero.com/netnewswire/whatsnew/netnewswire20.php> on Nov. 13, 2008, pp. 1-3.
“Ranchero Software—Flagged Items”, Internet Article, Retrieved from <http://web.archive.org/web/20050612083011/http://ranchero.com/netnewswire/features/flaggedItems.php> on Nov. 13, 2008, 1 page.
“Rancho Software—Features Chart”, Internet Article, Retrieved from <http://web.archive.org/web/20050609010027/http://ranchero.com/netnewswire/featureschart20.php> on Nov. 13, 2008, pp. 1-3.
“Resizing Controls Dynamically”, Microsoft Visual Basic 5.0 Programmer's Guide 1997, pp. 578-579.
“Restriction Requirement”, U.S. Appl. No. 09/599,806, (Mar. 3, 2003), 5 pages.
“Restriction Requirement”, U.S. Appl. No. 10/402,640, (Aug. 29, 2006), 5 pages.
“Restriction Requirement”, U.S. Appl. No. 10/770,240, (Jan. 26, 2009), 7 pages.
“Restriction Requirement”, U.S. Appl. No. 10/781,586, (Jun. 26, 2006), 5 pages.
“Restriction Requirement”, U.S. Appl. No. 11/012,472, (Jun. 9, 2009), 7 pages.
“Restriction Requirement”, U.S. Appl. No. 11/095,254, (Nov. 1, 2007), 8 pages.
“Restriction Requirement”, U.S. Appl. No. 11/227,550, (Apr. 2, 2009), 8 pages.
“RSS 2.0 Specification”, (Jul. 15, 2003), 8 pages.
“RSS Submissions”, Internet Article, Retrieved from <http://web.archive.org/web/20050619014308/http://www.rss-specifications.com/rss-submission.htm> on Nov. 13, 2008, pp. 1-3.
“Search Engine Subscriptions”, Internet Article, Retrieved from <http://web.archive.org/web/20051217013212/http://ranchero.com/netnewswire/helpBook/searchEngineSubs.html> on Nov. 13, 2008, 1 page.
“SearchFeed.png”, Print Screen in article, Retrieved from <http://web.archive.org/web/20050623095831/http://ranchero.com/images/nnw2/searchFeed.png> on Nov. 13, 2008, 1 page.
“Searching.png”, Print Screen from article, Retrieved from <http://web.archive.org/web/20050623095422/http://ranchero.com/images/nnw2/searching.png> on Nov. 13, 2008, 1 page.
“smartList.png”, Print Screen from Internet Article, retrieved from <http://web.archive.org/web/20050623095628/http://ranchero.com/images/nnw2/smartList.png> on Nov. 13, 2008, 1 page.
“SmartUpdate Developer's Guide”, Retrieved from http://developer.netscapte.com:80/docs/manuals/communicator/jarman/index.htm on Dec. 8, 2000, Netscape Communications Corp,(Mar. 11, 1999), 83 pages.
“Stack Algorithm for Extracting Subtree from Serialized Tree”, IBM Technical Disclosure Bulletin, TDB-ACC-No. NN94033, (Mar. 1, 1994), 2 pages.
“Store and Organize Related Project Files in a Binder”, Getting results with Microsoft Office, (1990), pp. 109-112.
“Streamlining Content Creation”, Ixia Soft Jun. 6, 2002, pp. 1-16.
“Subscribing and Unsubscribing”, Internet Article, Retrieved from <http://web.archive.org/web/20060915152527/http://ranchero.com/netnewswire/helpBook/subUnsub.html> on Nov. 13, 2008, pp. 1-2.
“Supplemental Notice of Allowance”, U.S. Appl. No. 10/781,586, (Jul. 18, 2008), 3 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 10/781,586, (Jun. 4, 2008), 2 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 10/955,665, (Dec. 30, 2009), 2 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 10/955,665, (Feb. 4, 2010), 2 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 10/955,665, (Nov. 27, 2009), 2 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 10/955,665, (Mar. 5, 2010), 2 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 10/990,152, (Apr. 19, 2010), 2 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 11/036,910, (Jan. 5, 2011), 2 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 11/044,106, (May 13, 2010), 6 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 11/044,106, (May 19, 2010), 5 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 11/072,087, (Apr. 19, 2010), 2 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 11/107,347, (Jun. 10, 2011), 10 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 11/218,149, (Apr. 5, 2011), 2 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 11/218,149, (Jun. 6, 2011), 2 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 11/931,730, (Mar. 2, 2011), 2 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 11/931,730, (Apr. 22, 2011), 2 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 11/931,730, (May 6, 2011), 2 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 12/021,894, (Jan. 12, 2011), 6 pages.
“Supplemental Notice of Allowance”, U.S. Appl. No. 12/021,894, (Feb. 8, 2011), 6 pages.
“Syncing”, Internet Article, Retrieved from <http://web.archive.org/web/20051217023557/http://ranchero.com/netnewswire/helpBook/syncing.html> on Nov. 13, 2008, 1 page.
“syncing.png”, Print Screen from article, retrieved from <http://web.archive.org/web/20050623095327/http://ranchero.com/images/nnw2/syncing.png> on Nov. 13, 2008, 2 pages.
“Syndic8.com—Documents1”, Internet Article, Retrieved from <http://web.archive.org/web/20050513214756/http://www.syndic8.com/documents/howto/> on Nov. 13, 2008, pp. 1-3.
“Syndic8.com—Documents2”, Internet Article, Retrieved from <http://web.archive.org/web/20050622035505/http://www.syndic8.com/documents/howto/> on Nov. 13, 2008, pp. 1-3.
“Syndic8.com—HowToUse”, Internet Article, Retrieved from <http://web.archive.org/web/20050619233841/http://www.syndic8.com/howto.php> on Nov. 13, 2008, pp. 1-4.
“The Feed Thickens”, Retrieved from: <http://blog.flickr.net/en/2004/07/14/the-feed-thickens/>, (Jul. 14, 2004), 2 pages.
U.S. Appl. No. 60/191,662, filed Mar. 23, 2000, 133 pages.
“Whitehill Composer Software product”, Retrieved from www.xml.com/pub/p/221 on Apr. 8, 2004, Whitehill Technologies, Inc., (Apr. 8, 2004), 2 pages.
“XForm 1.0”, W3C,(Jul. 16, 2001), 179 pages.
“XML Forms Architecture (XFA)”, Retrieved from http://xml.coverpages.org/xfa.html on Aug. 17, 2006, Cover Pages Technology Reports,,(Jun. 16, 1999), p. 1.
“Yahoo! Publishers Guide to RSS : Submit your RSS Feed”, Internet Article, Retrieved from <http://web.archive.org/web/20051216153612/http://uk.promotions.yahoo.com/publisher/submit.html> on Nov. 13, 2008, pp. 1-3.
“Yahoo! Search Services and Tools”, Internet Search Screen, Retrieved from <http://web.archive.org/web/20051001065344/http://search.yahoo.com/mrss/submit> on Nov. 13, 2008, 1 page.
Acklen, Laura et al., “Special Edition, Using Corel WordPerfect 9”, Retrieved from: <http://www.netlibrary.com/nIreader/nIreader.dll?bookid=15973&filename=Cover.html> on Nov. 23, 2004, Que Corporation,,(Jun. 1999), 65 pages.
Adams, Susie et al., “BizTalk Unleashed”, Sams publishing, 2002, first printing Mar. 2001, pp. 1-2, 31-138.
Alschuler, Liora “A Tour of XMetal”, Retrieved from: <http://www.xml.com/pub/a/SeyboldReport/ip031102.html> on Feb. 5, 2003, XML.com, Online! XPOO2230081,(Jul. 14, 1999), 3 pages.
Altova, “Altova Tools for XPath 1.0/2.0”, Retrieved from: <http://www.altova.comdev—portal—xpath.html> on Nov. 7, 2007, Altova,(Nov. 7, 2007), 12 pages.
Altova, “www.xmlspy.com Spy 4 You User and Reference Manual Version 4.4”, available at <http://v44.sw.altova.com/SpyManual44.pdf>,(May 24, 2002), pp. 1-605.
Altova, “XML Spy 4.0 Manual”, 1998-2001 Altova Inc. & Altova GmbH, (Sep. 10, 2001), pp. 1-90, 343-362.
Altova, et al., “User and Reference Manual Version 4.4”, www.xmlspy.com, (May 24, 2007), pp. 1-565.
Altova, et al., “XML Spy, XML Integrated Development Environments”, Altova Inc.,(2002), pp. 1-18.
Anat, Eyal et al., “Integrating and Customizing Heterogeneous E-Commerce Applications”, The VLDB Journal—The International Journal on Very Large Data Bases, vol. 10, Issue 1, (Aug. 2001), pp. 16-38.
Anonymous, “The Evolution of RSS”, (Online); XP002546010; Internet; Retrieved from the Internet: URL:http://web.archive.org/web/20041011055544/http://www.webreference.com/authoring/languages/xml/rss/1/7.html *the whole document*,(Oct. 11, 2004), 1 page.
Asche, Ruediger R., “Multithreading for Rookies”, Microsoft Developer Network Technology Group, Retrieved Apr. 17, 2002 from http://msdn.microsoft.com/library/en-us/dndllpro/html/msdn—threads.asp?frame=true, (Sep. 24, 1993), 13 pages.
Attardi, G et al., “The LOA Customizable Media Aggregator”, Automated Production of Cross Media Content for Multi-Channel Distribution, 2005, Axmedis 2005. First International Conference on Florence, Italy 30-02 Nov. 2005, Piscataway, NJ USA, IEEE, Nov. 30, 2005. XP010892440 ISBN: 978-0-7695-2348-4, pp. 1-8.
Au, Irene et al., “Netscape Communicator's Collapsible Toolbars”, CHI 98, Human Factors in Computing Systems, Conference Proceedings, LA, CA, (Apr. 18-23, 1998), 12 pages.
Ayers, Danny et al., “Beginning RSS and Atom Programming”, Wiley Publishing, Inc.,(2005), pp. 1-54.
Baldwin, J F., et al., “A Mass Assignment Based ID3 Algorithm for Decision Tree Introduction”, International Journal of Intelligent Systems, vol. 12, No. 7, (1997), pp. 523-548.
Barker, et al., “Creating In-Line Objects Within an Integrated Editing Environment”, IBM Technical Disclosure Bulletin, vol. 27, No. 5,(Oct. 1984), p. 2962.
Battle, Steven A., et al., “Flexible Information Presentation with XML”, The Institution of Electrical Engineers, (1998), 6 pages.
Beauchemin, Dave “Using InfoPath to Create Smart Forms”, Rerieved from: <http:/www.microsoft.com/office/infopath/prodinfo/using.mspx> on Jan. 21, 2007, (Mar. 27, 2003), 6 pages.
Begun, Andrew et al., “Support and Troubleshooting for XML Schemas in InfoPath 2003”, Retrieved from: <http://msdn2.microsoft.com/en-us/library/aa168241(office.11,d=printer).aspx> on Feb. 24, 2009, Microsoft Office InfoPath 2003 Technical Articles,(Aug. 2004), 12 pages.
Ben-Natan, Ron et al., “Internet Platform for Creating and Supporting Communities”, U.S. Appl. No. 60/203,081, filed May 9, 2000, 31 pages.
Benzinger, Brian “Google Reader Reviewed”, Retrieved from: <http://www.solutionwatch.com/250/google-reader-reviewed> on Jun. 17, 2009, (Oct. 10, 2005), 5 pages.
Berg, A “Naming and Binding: Monikers”, Inside OLE, Chapter 9, Harmony Books, (1995), pp. 431-490.
Blair, Eric “Review: NetNewsWire 2.0”, Retrieved from: <http://www.atpm.com/11.06/netnewswire.shtml> on Nov. 11, 2008, (Jun. 2, 2005), 12 pages.
Borland, Russell “Running Microsoft Word 97”, Microsoft Press, (Jan. 1997), pp. 314-315, 338, 361-362, 390, and 714-719.
Brabrand, Claus et al., “Power Forms: Declarative Client-Side Form Field Validation”, World Wide Web Journal, vol. 3, No. 4, Available at <www.brics.dk/˜brabrand/powerforms.pdf >,(2000), pp. 1-20.
Bradley, Neil “The XML Companion, Third Edition”, Retrieved from: <http://proquest.safaribooksonline.com0201770598> on Jan. 19, 2008, Published by Addison Wesley Professional,(Dec. 12, 2001), pp. 1-18.
Bray, Tim et al., “Extensible Markup Language (XML) 1.0”, W3C Recommendation, Available at <http://www.textuality.com/sgml-erb/WD-xml.html>,(Feb. 10, 1998), 37 Pages.
Brogden, William “Arbortext Adept 8 Editor Review”, Retrieved from: <www.xml.com/pub/a/1999/09/adept/AdeptRvw.htm> on Feb. 5, 2003, O'Reilly XML.COM, Online!,(Sep. 22, 1999), 4 pages.
Burch, Barbara “Notes R5 Technical Overview”, Retrieved from: <http://www.ibm.com/developerworks/lotus/library/1s-Notes—R5—Technical—Overview> on Aug. 13, 2010, (Apr. 1, 1999), 14 pages.
Chen, Ya B., et al., “Designing Valid XML Views”, S. Spaccapietra, S.T. March, and Y. Kambayashi (Eds.): ER 2002, LNCS 2503, Copyright: Springer-Verlag Berlin Heidelberg 2002, pp. 463-477.
Chen, Yi et al., “XK Validator: A Constraint Validator for XML”, CIKM 02, ACM1-58113-492-04-02-011, (Nov. 4-9, 2002), pp. 446-452.
Chien, et al., “Efficient Management of Multiversion Documents by Object Referencing”, Proceedings of the 27th VLDB Conference,(2001), pp. 291-300.
Chien, Shu-Yao et al., “Efficient Schemes for Managing Multiversion XML Documents”, The VLDB Journal 2002, (Dec. 19, 2002), pp. 332-353.
Chien, Shu-Yao et al., “Storing and Querying Multiversion XML Documents using Durable Node Numbers”, IEEE,(2002), pp. 232-241.
Chien, Shu-Yoa et al., “XML Document Versioning”, SIGMOD Record, vol. 30, No. 3,,(Sep. 2001), pp. 46-53.
Chuang, Tyng-Ruey “Generic Validation of Structural Content with Parametric Modules”, ICFP 2001 International Conference on Functional Programming, vol. 36, No. 10, Available at <http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.7.6412&rep=rep1&type=pdf>,(Sep. 3, 2001), 12 pages.
Ciancarini, Paolo A., et al., “Managing Complex Documents Over the WWW: A Case Study for XML”, Transactions on Knowledge and Data Engineering, vol. 11, No. 4, Available at <http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.18.1679&rep=rep1&type=pdf>, (Apr. 1999), pp. 1-14.
Clapp, D “The NeXT Application Kit Part 1: Non-Responsive Classes”, The NeXT Bible Chapter 16, (1990), pp. 275-293.
Clark, James “XSL Transformation (XSLT), Version 1.0”, Retrieved from: <www.w3.org/TR/1999/REC-xslt19991116> on Oct. 26, 2009, WC3,(Nov. 16, 1999), 57 pages.
Clark, James et al., “XML Path Language (XPath)”, Retrieved from: <www.w3.org/TR/1999/RCE-xpath-19991116> on Oct. 26, 2009, Version 1.0,(Nov. 16, 1999), 32 pages.
Clark, Peter “From Small Beginnings”, Knowledge Management, (Nov. 2001), pp. 28-30.
Cloete, I et al., “CID3: An Extension of ID3 for Attributes with Ordered Domains”, South African Computer Journal, vol. 4, (1991), pp. 10-16.
Cover, Robin “XML Forms Architecture (XFA)”, Cover Pages. Retrieved from “http://xml.coverpages.org/xfa.html” on Aug. 17, 2006, (Apr. 19, 2000), 4 pages.
Davidow, Ari “XML Editors: Allegations of Functionality in Search of Reality”, Retrieved from: <http://www.ivritype.com/xml/> on Feb. 9, 2009, SP002230082,(Oct. 12, 1999), 16 pages.
Dayton, Linnea et al., “Photo Shop 5/5.5 WOW! Book”, 2000, Peachpit Press, (2000), pp. 8-17.
Dilascia, Paul et al., “Sweeper”, Microsoft interactive developer, vol. 1., No. 1, (1996), 28 pages.
Dodds, Leigh “Toward an XPath API”, Retrieved from: <http://www.xml.com/lpt/a/742> on Nov. 7, 2007, (Mar. 7, 2001), 3 pages.
Dorward, Sean et al., “Unix Variants”, Unix Review, vol. 10, No. 4, (Apr. 1992), pp. 29-31.
Dubinko, et al., “XForms 1.0”, Retrieved from: http://www.w3.org/TR/2001/WD-xforms-20011207 (One big file, diff-marked HTML, Zip archive) on May 22, 2007, Section 1-12.2.3 & Appendices A-G,(Dec. 7, 2001), 64 pages.
Dubinko, Micah “XForms and Microsoft InfoPath”, retrieved from: <http://www.xml.com/lpt/a/1311> on Feb. 24, 2009, (Oct. 29, 2003), 6 pages.
Dubinko, Micah et al., “XForms 1.0 W3C Working Draft”, Retrieved from: <http://www.w3.org/TR/2001/WD-xforms-20011207/index-all.html> on Nov. 19, 2009, W3C,(Dec. 7, 2001), 88 pages.
Ducharme, “InfoPath and XForms”, InfoWorld, Available at <http://www.weblog.infoworld.com/udell2003/02/26.html>, (Feb. 26, 2003), pp. 1-3.
Ducharme, Bob et al., “InfoPath and XForms”, Retrieved from: http://jonudell.net/udell/2003-02-26-infopath-and-xforms.html (Mar. 4, 2010), (Feb. 26, 2003), 2 pages.
Dyck, Timothy “XML Spy Tops as XML Editor”, eWeek, vol. 19, No. 47,, (Nov. 25, 2002), 3 pages.
Esposito, Dino “Cutting Edge No. 8”, Microsoft Internet Developer, (Jan. 18, 2000), 13 pages.
Fukuhara, Yasuji “Clarisworks, Introduction to Business Document Construction, No. 4, Estimate”, NIKKEI MAC, No. 14; Japan, (May 17, 1994), 18 pages.
Gill, Kathy E., “Blogging, RSS and the Information Landscape: A Look at Online News”, In Proceedings of WWW 2005, 7 pages.
Grosso, Paul et al., “XML Fragment Interchange”, Retrieved from: <http://www.w3.org/TR/xml-fragment> on Sep. 14, 2007, W3C,(Feb. 2001), 28 pages.
Halberg, et al., “Using Microsoft Excel 97”, Que Corporation,,(1997), pp. 1-9, 18-25, 85-89, 98-101, 106-113, 124-127, 144-147, 190-201, 209-210, 213-227, 581-590, 632-633, 650-655, 712-714.
Hall, Richard S., “Agent-based Software Configuration and Development”, Thesis of the University of Colorado, Available at <http://www.doc.ic.ac.uk/˜alw/edu/theses/hall-phd-0599.pdf>, (May 1, 1999), 182 pages.
Hall, Richard S., “Evaluating Software Deployment Languages and Schema”, In Proceedings of International Conference on Software Maintenance,(Nov. 1998), 9 pages.
Hall, Richard S., et al., “Specifying the Deployable Software Description Format in XML”, CU-SERL-207-99, Software Engineering Research Laboratory, University of Colorado at Boulder,(Mar. 31, 1999), 17 pages.
Hammersley, Ben “Content Syndication with RSS”, Chapter 9: Using Feeds; Chapter 10: Directories, Web Aggregators, and Desktop Readers, O'Reilly books,(Mar. 2003), 24 pages.
Hammersley, Ben “Developing Feeds with RSS and Atom”, O'Reilly books, O'Reilly Media, Inc.,(Apr. 2005), 10 pages.
Han, Richard et al., “Websplitter: A Unified XML Framework for Multi-Device Collaborative Web Browsing”, ACM Conference on Computer Supported Cooperative Work, (2000), 10 pages.
Hardy, Matthew R., et al., “Mapping and Displaying Structural Transformations Between XML and PDF”, Proceedings of the 2002 ACM symposium on Document engineering, Electronic Publishing Research Group, School of Computer Science & IT, University of Nottingham, UK,(Nov. 2002), pp. 95-102.
Haukeland, Jan-Henrick “Tsbiff-tildeslash biff—Version 1.2.1”, http://web.archive.org/web/19990912001527/http://www.tildeslash.com/tsbiff/., (Jun. 1999), 2 pages.
Herzberg, Amir et al., “Protecting (even) Naive Web Users, or: Preventing Spoofing and Establishing Credentials of Web Sites”, Bar Ilan University, Available at <www.cs.bu.ac.il/˜herzea/papers/ecommerce/trusted credentials area.pdf>,(Jul. 18, 2004), 26 pages.
Herzner, Wolfgang et al., “CDAM—Compound Document Access and Management. An Object-Oriented Approach”, ACM SIGOIS Bulletin, vol. 12, Issue 1, Multimedia Systems Interaction and Applications, Chapter 3,,(Jul. 1991), 18 pages.
Hoffman, Michael “Architecture of Microsoft Office InfoPath 2003”, Retrieved from: <http://msdn2.microsoft.com/en-us/library/aa219024(office.11,d=printer).aspx> on Jan. 21, 2007, Microsoft Office InfoPath 2003 Technical Articles, (Jun. 2003), 18 pages.
Honkala, Mikko et al., “Multimodal Interaction with XForms”, ICWE '06, (Nov. 14, 2006), pp. 201-208.
Howlett, Scott et al., “A New Function for SQL Server 2000”, MSDN Magazine, No. 1, (Mar. 2000), 9 pages.
Hu, Zhenjiang et al., “A Programmable Editor for Developing Structured Documents based on Bidirectional Transformations”, PEPM '04, (Aug. 2004), pp. 178-189.
Huier, Zhang et al., “Design and Implementation of RSS-based Science and Technology Information Syndication System”, Library of Chinese Academy of Sciences, (2005), pp. 1-15.
Hwang, Kai et al., “Micro-Firewalls for Dynamic Network Security with Distributed Intrusion Detection”, IEEE International Symposium on Network Computing and Applications 2001, pp. 68-79.
Iwantani, Kaori et al., “Perfect Manual of Clarisworks 4.0 for Macintosh”, 1st Edition, Japan, (Jul. 22, 1997), 33 pages.
Kaiya, Haruniko 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.
Kanemoto, Hirotaka et al., “An Efficiently Updatable Index Scheme for Structured Documents”, DEXA'98, (1998), pp. 991-996.
Kath, Randy “Managing Virtual Memory in Win32”, Microsoft Developer Network Technology Group, Retrieved Apr. 17, 2002 from http://msdn.microsoft.comilibrary/en-us/dngenlib/html/msdn—virtmm.asp?frame=true, (Jan. 20, 1993), 9 pages.
Kay, Michael “XSL Transformations (XSLT) Version 2.0”, W3C Working Draft, Available at <http://www.w3.org/TR/2005/WD-xslt20-20050404>,(Apr. 2005), 357 pages.
Kim, Sang-Kyun et al., “Immediate and Partial Validation Mechanism for the Conflict Resolution of Update Operations in XML Databases”, WAIM2002, LNCS2419, 2002, Springer-Verlag Berlin Heidelberg, (2002), pp. 387-396.
Klarlund, Nils et al., “DSD: A Schema Language for XML”, ACM, FSMP Portland Oregon, (2000), pp. 101-111.
Kobayashi, M. et al., “An Update on BTRON-specification OS Development”, Proceedings of the 8thTRON Project Symposium, 1991, 0-8186-2475-2/91,(1991), pp. 132-140.
Komatsu, Naohisa et al., “A Proposal on Digital Watermark in Document Image Communication and Its Application to Realizing a Signature”, Electronics and Communication in Japan, Part I: Communications, vol. 73, No. 5, (May 1990), pp. 22-23.
Kutay, Ali et al., “Methods and Systems for Accessing, Organizing, Presenting and Viewing Data”, U.S. Appl. No. 60/209,713, Kutay et al., filed Jun. 5, 2000, 345 pages.
Leblond, et al., “PC Magazine Guide to Quattro Pro for Windows”, Ziff-Davis Press,(1993), pp. 9-11, 42-61.
Lehtonen, Miro et al., “A Dynamic User Interface for Document Assembly”, DocEng '02, Department of Computer Science, University of Helsinki,(Nov. 2002), pp. 134-141.
Mansfield, Ron “Excel 97 for Busy People”, Osborne/McGraw-Hill,,(Jan. 27, 1997), pp. 48-50.
Matsushita, Noriko “Step-up Training of Clarisworks (Tabulation), Successful Use of Spreadsheet and Tabulation”, Mac People, vol. 4, No. 19, (Oct. 1, 1998), 5 pages.
McCright, John S., “New Tool Kit to Link Groove with Microsoft SharePoint”, Retrieved from: <http://www.eweek.com/c/a/Enterprise-Applications/New-Tool-Kit-to-Link-Groove-With-Microsoft-SharePoint/> on Dec. 28, 2009, (Jul. 29, 2002), 3 pages.
Mehta, Manish et al., “SLIQ: A Fast Scalable Classifier for Data Mining”, available at <<http://www.dbis.informatik.hu-berlin.de/dbisold/lehre/WS0405/KDD/paper/MAR96.pdf >>, (Mar. 1996), 15 Pages.
Moats, R. “A URN Namespace for IETF Documents”, RFC 2648, (Aug. 1999),pp. 1-30.
Moats, R. “URN Syntax”, RFC 2141, (May 1997), pp. 1-8.
Musgrave, S “Networking Technology—Impact and Opportunities”, Survey and Statistical Computing 1996, Proceedings of the Second ASC International Conference, London, UK,,(Sep. 1996), pp. 369-378.
Nelson, Joe “Client-side Form Validation Using JavaScript”, Developer Advisory, (Sep. 21, 2001), pp. 1-9.
Nelson, Mark “Validation with MSXML and XML Schema”, Windows Developer Magazine, (Jan. 1, 2002), 5 pages.
Noore, Afzel “A Secure Conditional Access System using Digital Signature and Encryption”, International Conference on Consumer Electronics, (Jun. 2003), pp. 220-221.
Pacheco, Xavier et al., “Delphi 5 Developer's Guide”, Chapter 31, Section: Data Streaming, Sams Publishing.,(1999), 4 pages.
Pike, Rob et al., “Plan 9 From Bell Labs”, AT&T Bell Laboratories, UKUUG, Summer 1990, 10 pages.
Pike, Rob et al., “The Use of Name Spaces in Plan 9”, Operating Systems Review, vol. 27, No. 2, (Apr. 1993), pp. 72-76.
Prevelakis, Vassilis et al., “Sandboxing Applications”, FREENIX Track: 2001 USENIX Annual Technical Conference, pp. 119-126.
Prosise, Jeff “Programming Microsoft Net”, retrieved from: <http://academic.safaribooksonline.com/print?xmlid=0-7356-1376-1/IDAVO3T> on Mar. 3, 2011, Microsoft Press,(May 15, 2002), 24 pages.
Rado, Dave “How to create a template that makes it easy for users to ‘fill in the blanks’ without doing any programming,”, Retrieved from http://word.mvps.org/FAQs/Customization/FillinTheBlanks.htm, (Apr. 2004), pp. 1-2.
Raggett, “HTML Tables”, Retrieved from: <http:www.//is-edu.homuns.edu.vn/WebLib/books/Web/Tel/html3-tables.html> on Aug. 6, 2006, W3C Internet Draft,(Jul. 7, 1995), pp. 1-12.
Rapaport, Lowell “Get More From SharePoint”, Transform Magazine, vol. 11, No. 3, (Mar. 2002), 2 pages.
Reagan, Moore W., et al., “Collection-Based Persistent Digital Archives”, U.S. Appl. No. 60/191,662, filed Mar. 23, 2000, 133 pages.
Rees, Michael J., “Evolving the Browser Towards a Standard User Interface Architecture”, Third Australian User Interfaces Conference (AUIC2002), School of Information Technology, Bond University, Australia,(2001), pp. 1-7.
Reilly, Douglas J., “Programming Microsoft Web Forms”, retrieved from: <http://academic.safaribooksonline.com/print?xmlid=0735621799/systemdotwebdotuidot web> on Mar. 3, 2011, Microsoft Press,(Nov. 2, 2005), 52 pages.
Rogge, Boris et al., “Validating MPEG-21 Encapsulated Functional Metadata”, IEEE 2002, ISBN 0-7803-7304-9/02,(2002), pp. 209-212.
Sato, T. et al., “XFIG Version 3.2 Patchlevel 2 User's Manual Edition 1.0”, Available at http://tinf2.vub.ac.be/˜dvermeir/manuals/xfig/lib/X11/xfig/html/index.html, (Jul. 2, 1998), 37 pages.
Schmid, Mathew et al., “Protecting Data from Malicious Software”, 18th Annual Security Applicatons Conference, (2002), pp. 199-208.
Sebastiani, F “A Tutorial on Automated Text Categorization”, In Analia Amandi and Ricardo Zunino, editors, Proceedings of SASI-99, 1st Argentinean Symposium on Artificial Intelligence, Buenos Aires, AR, (1999), pp. 7-35.
Senda, Akihiro “Word 2000, Conservative- Looking but ‘Attentive’ New Function”, NIKKEI PC 21, vol. 4, No. 8; Japan, (Aug. 1, 1999), 4 pages.
Singh, Darshan “Microsoft InfoPath 2003 by Example”, Retrieved from: <http://www.perfectxml.com/InfoPath.asp> on Jan. 21, 2007, (Apr. 20, 2003), 19 pages.
Sollins, et al., “Functional Requirements for Uniform Resource Names”, RFC 1737, (Dec. 1994), pp. 1-7.
Staneck, W “Internal and External Media”, Electronic Publishing Unleased, Chapter 22,(1995), pp. 510-542.
Stylusstudio, “StylusStudio: XPath Tools”, 2004-2007, StylusStudio,(Nov. 7, 2007), 8 pages.
Sun, Qibin et al., “A Robust and Secure Media Signature Scheme for JPEG Images”, Proceeding of 2002 IEEE Workshop on Multimedia Signal Processing, (Dec. 2002), pp. 296-299.
Sutanthavibul, Supoj et al., “XFIG Version 3.2 Patchlevel 2 (Jul. 2, 1998) User's Manual (Edition 1.0)”, Retrieved from: <www.ice.mtu.edu/online—docs/sfig332/>on Jan. 28, 2003, Internet Document XP002229137,(Jul. 2, 1998), 60 pages.
Tomimori, Hiroyuki et al., “An Efficient and Flexible Access Control Framework for Java Programs in Mobile Terminals”, Proceeding of 22nd Int'l Conference on Distributed Computing Systems Workshops,(2002), pp. 777-782.
Trupin, J “The Visual Programmer”, Microsoft Systems Journal,(Apr. 1996), pp. 103-105.
Usdin, Tommie et al., “XML: Not a Silver Bullet, But a Great Pipe Wrench”, Standard View vol. 6, No. 3, (Sep. 2, 1998), pp. 125-132.
Van Hoff, Arthur et al., “The Open Software Description Format”, Retrieved from: <www.w3.org/TR/NOTE-OSD> on May 18, 2009, (Aug. 13, 1997), 10 pages.
Varlamis, Iraklis et al., “Bridging XML-Schema and relational database. A System for generating and manipulating relational databases using valid XML documents”, DocEng 01, ACM 1-58113-432-0/01/0011,(Nov. 9, 2001), pp. 105-114.
Vasters, Clemens F., “BizTalk Server 2000 A Beginner's Guide”, Osborne/McGraw-Hill,(2001), pp. 1-2, 359-402.
Verisign Inc., “Licensing VeriSign Certificates: Securing Multiple Web Server and Domain Configurations”, White Paper, Available at <www.msctrustgate.com/pdf/licensing.pdf>,(Nov. 2, 2001), 15 pages.
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.
W3C, “XForms 1.0”, retrieved from <file:///HI/NPL/W3C XForms1—0 - Working Draft 20010216.thm> on Apr. 5, 2011,(Feb. 16, 2001), 4 pages.
Watt, Andrew “Microsoft Office Infopath 2003 Kick Start”, Retrieved from: <http://proquuest.safaribooksonline.com/067232623X> on Mar. 12, 2008, Published by Sams, Print ISBN-10:0-672-32623-X,(Mar. 24, 2004), 57 pages.
Webopedia, “Definition of Network”, Retrieved from: <http://www.webopedia.com/TERM/n/network.html>, (Sep. 1, 1996), 2 pages.
Webopedia, “Definition of OLE”, Retrieved from: <htp://www.webopedia.com/TERM/O/OLE.html>, (May 16, 1998), 3 pages.
Webopedia, “Definition of OpenDoc”, Retrieved from: <http://www.webopedia.com/TERM/O/OpenDoc.html>,(Sep. 18, 1997), 3 pages.
Williams, Sara et al., “The Component Object Model: A Technical Overview”, Microsoft Corp,(Oct. 1994), pp. 1-14.
Wong, Raymond K., et al., “Managing and Querying Multi-Version XML Data with Update Logging”, DocEng '02, (Nov. 8-9, 2002), 8 pages.
XmlSpy, “XmlSpy 2004 Enterprise Edition Manual”, Altova,(May 17, 2004), pp. 1-25, 220-225.
Zaki, Mohammed J., et al., “Parallel Classification for Data Mining on Shared-Memory Multiprocessors”, ACM, (Mar. 1999), pp. 1-8.
Zdonik, S “Object Management System Concepts”, ACM,(1984), pp. 13-19.
“Foreign Notice of Allowance”, Application No. JP2006-060050, (Dec. 1, 2011),6 pages.
“Foreign Notice of Allowance”, Australian Application Number, (Sep. 23, 2010),3 pages.
“Foreign Notice of Allowance”, Canadian Application No. 2408527, (Apr. 17, 2012),1 page.
“Foreign Office Action”, Canadian Application No. 2,408,313, (Jun. 18, 2012),7 pages.
“Foreign Office Action”, Korean Application No. 10-2006-0003894, (Jun. 12, 2012),4 pages.
“Foreign Office Action”, Japanese Application No. 2002-503701, (Mar. 16, 2012), 3 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/061,613, (Mar. 16, 2012), 12 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/694,836, (Mar. 9, 2012), 30 pages.
“Notice of Allowance”, U.S. Appl. No. 11/170,521, (Jan. 19, 2012), 7 pages.
Dubinko, et al., “XForms 1.0”, W3C Recommendation, Retrieved from: <www.w3.org.TR/2003/REC-xforms-20031014/> on Feb. 29, 2012,(Oct. 14, 2003), 35 pages.
“Adobe GoLive 5.0: User Guide,” Adobe Systems, 2000, Chapter 12.,11 pages.
“Advisory Action”, U.S. Appl. No. 11/036,910, (Sep. 10, 2009),3 pages.
“European Search Report”, EP Application No. 10012887.5, (Jul. 4, 2011),12 pages.
“Final Office Action”, U.S. Appl. No. 12/126,532, (Oct. 14, 2011),25 pages.
“Foreign Notice of Allowance”, Canadian Application No. 2412611, (Sep. 19, 2011), 1 page.
“Foreign Notice of Allowance”, Japanese Application No. 2002-504581, (Sep. 16, 2011), 6 pages.
“Foreign Office Action”, Canadian Application No. 2408527, (Sep. 27, 2011), 3 pages.
“Foreign Office Action”, Japanese Application No. 2002-504581, (Dec. 17, 2010), 24 pages.
“Foreign Office Action”, Japanese Application No. 2002-504581, (May 27, 2011), 6 pages.
“Non Final Office Action”, U.S. Appl. No. 11/036,910, (Oct. 2, 2008), 7 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/011,150, (May 19, 2005), 7 pages.
“Notice of Allowance”, U.S. Appl. No. 10/011,150, (Dec. 16, 2005), 4 pages.
“Notice of Allowance”, U.S. Appl. No. 11/567,140, (Oct. 11, 2011), 11 pages.
“Notice of Allowance”, U.S. Appl. No. 12/249,973, (Sep. 28, 2011), 9 pages.
“Restriction Requirement”, U.S. Appl. No. 10/011,150, (Dec. 15, 2004), 5 pages.
Zdonik, Stanley B., “Object Management System Concepts”, Supporting Integrated Office Workstation Applications, Doctoral Thesis, Massachusetts Institute of Technology, (1983), 262 pages.
“Final Office Action”, U.S. Appl. No. 12/061,613, (Aug. 30, 2012), 14 pages.
“Final Office Action”, U.S. Appl. No. 12/694,836, (Aug. 29, 2012), 27 pages.
“Foreign Office Action”, Korean Application No. 10-2012-0054230, (Aug. 19, 2012), 9 pages.
“Foreign Office Action”, Malaysian Application No. PI 20060743, (Jun. 8, 2012),3 pages.
“Non-Final Office Action”, U.S. Appl. No. 10/976,451, (Jul. 23, 2012), 9 pages.
“Non-Final Office Action”, U.S. Appl. No. 12/722,414, (Aug. 15, 2012), 27 pages.
“Summons to Attend Oral Proceedings”, European Patent Application No. 01935325.9, (Sep. 7, 2012), 9 pages.
“The History of Notes and Domino”, developerWorks Technical Resource Portal, Retrieved from: <http://www.ibm.com/developerworks/lotus/library/Is-NDHistory/> on Jul. 9, 2010,(Nov. 14, 2007), 18 pages.
Brabrand, Claus et al., “PowerForms: Declarative Client-Side Form Field Validation”, BRICS, Department of Computer Science, University of Aarhus, Denmark, World Wide Web, vol. 3, No. 4,(2000), pp. 205-214.
Chan, Chee-Yong et al., “Efficient Filtering of XML Documents with XPath Expressions”, The VLDB Journal (2002) 11,(Jun. 1, 2002), pp. 354-379.
Schmalstieg, Dieter et al., “Using Transparent Props for Interaction with the Virtual Table”, Proceedings of the 1999 symposium on Interactive 3D graphics., available at <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.0.35.8236>,(Apr. 26, 1999),8 pages.
“Foreign Office Action”, Taiwan Application No. 095103951 (Nov. 8, 2102), 15 pages.
“Intention to Grant”, European Patent Application No. 01935325.9, (Dec. 7, 2012), 7 pages.
“Notice of Allowance”, U.S. Appl. No. 10/976,451, (Feb. 4, 2013), 9 pages.
“Taiwan Search Report”, Taiwan Application No. 095103951, (Nov. 8, 2012), 1 page.
“Foreign Office Action”, Canadian Application No. 2533147, (Jan. 25, 2013), 2 pages.
“Notice of Allowance”, U.S. Appl. No. 12/028,651, (Jan. 3, 2013), 7 pages.
Related Publications (1)
Number Date Country
20110246868 A1 Oct 2011 US
Divisions (1)
Number Date Country
Parent 11931730 Oct 2007 US
Child 13161419 US
Continuations (1)
Number Date Country
Parent 10636475 Aug 2003 US
Child 11931730 US