US 7,490,109 B1Grant
System and method for offline editing of data files
Issue Date:2009-02-10
•19 Claims
•6 Drawing Sheets
Abstract
A system and method that enables a user to edit a data file offline is described. This system and method can enable a user to edit a data file without the user having to discover or deploy a solution application governing the data file. For security, this system and method can deploy a solution application within a sandbox, thereby limiting the operations the solution application can perform.
Metadata
Assignee
- Microsoft Corporation
Inventors
- Prakash Sikchi
- Arungundram Narendran
- Kelvin S. Yiu
- Dragos Barac
- Miladin Pavlicic
- Rajesh K. Jha
Application Information
Application Number:US 11/276,585
Filing Date:2006-03-06
Priority Date:2003-03-24
Art Unit:2167
Classifications
IPC:
G06F17/30
Patent Drawings (6 sheets)
Description
Cross-Reference to Related Applications
[0001] This is a continuation of and priority is claimed to U.S. patent application Ser. No. 10/395,490, a filing date of Mar. 24, 2003, now U.S. Pat. No. 7,370,066 for “SYSTEM AND METHOD FOR OFFLINE EDITING OF DATA FILES” of Sikchi et al. This U.S. patent application is commonly assigned herewith and is hereby incorporated herein by reference for all that is discloses.
Background
[0002] Extensible markup language (XML) is increasingly becoming the preferred format for transferring data. XML is a tag-based hierarchical language that is extremely rich in terms of the data that it can be used to represent. For example, XML can be used to represent data spanning the spectrum from semi-structured data (such as one would find in a word processing document) to generally structured data (such as that which is contained in a table). XML is well-suited for many types of communication including business-to-business and client-to-server communication. 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.
[0003] One of the reasons that data files written in XML are often preferred for transferring data is that XML data files contain data, rather than a combination of data and the software application needed to edit the data. One problem with XML data files, however, is that to edit an XML data file, a user needs to first install a solution software application used to access, view, and edit the data file.
[0004] When a user is online, his computer can run a host application capable of accessing the Internet, such as Microsoft® Internet Explorer®, which can silently discover and deploy an XSLT, which enables the user to author and access an XML data file.
[0005] If a user wishes to save an XML data file for later, offline use, however, the user may encounter various problems. In some cases, a user wishing to reopen an XML data file offline will not be able to do so because he can no longer discover and deploy the XML data file's solution application. The user can no longer discover a solution if he is no longer online and the solution is accessible only online. In other cases, a user can access and deploy the solution application, but to do so the user must proactively discover the solution's name and where on his computer it resides, which a user may not know. And sometimes, a user's host application discovers the solution's name and where it resides, but the user has to instruct his computer to deploy the solution application, rather than the computer automatically opening, the solution file when the user attempts to open the corresponding XML data file.
[0006] Even in those cases where a user can continue to author and access an XML data file offline by actively installing the XML data file's solution application, there often is another problem. When a user instructs his host application to open a solution for an XML data file, his host application may trust the solution, thereby setting the user's computer at risk. A solution originally accessed online could, for instance, contain a virus or worm. When the user instructs his host application to install the solution, it could introduce the virus or worm.
[0007] For these reasons, editing data files offline can be inconvenient and dangerous.
Summary
[0008] The following description and figures describe an offline editing tool enabling offline editing of a data file with silent discovery and deployment of the data file's solution. This offline editing tool enables a user to edit data files by performing certain actions before the user attempts to edit the data file while offline. When a user first opens a data file when online, for instance, the editing tool can download the data file's solution into a cache for later retrieval.
[0009] The offline editing tool follows appropriate security precautions to contain possibly dangerous code in a data file's solution even when the solution is installed from a local source, such as when a user is offline. This offline editing tool determines what level of security is appropriate for a data file's solution based on the original source of the solution.
Brief Description of the Drawings
[0010] FIG. 1 illustrates a communications network and a system capable of implementing a method for offline editing of data files.
[0011] FIG. 2 illustrates an exemplary electronic form whereby a user can edit a data file.
[0012] FIG. 3 is a flow diagram of an exemplary process for editing of data files while online or offline.
[0013] FIG. 4 is a flow diagram of an exemplary process for offline editing of a data file with security by sandboxing the data file's solution application.
[0014] FIG. 5 is a block diagram of a computer system that is capable of supporting secure online and offline editing of data files.
[0015] The same numbers are used throughout the disclosure and figures to reference like components and features.
Detailed Description
[0016] The following disclosure describes an easy, simple, and secure way to access data files when offline. If a user has opened a data file first online, or if the system has otherwise received the data file's solution, a document manager application can silently discover and deploy a data file's solution. The document manager allows a user to simply select a data file to open and the document manager will open the data file with a discovered and deployed solution. The user need not discover, select, or even be aware that the data file requires a solution for the data file to be edited. After selecting the data file to open, the user can then edit and access the data file in a way very similar to how it would act and appear had the user opened the data file while online.
Data Files, Solutions, and Host Applications
[0017] Data files, their solutions, and a host application work together to allow a user to open and edit the data file. Data files contain little or no operable code, where as a solution file containing presentation and logic applications. Because editing a data file requires a solution, if a user tries to open a data file without a solution, she could get a error, a prompt asking the user to open a solution, or perhaps a flat list of the data in the data file.
[0018] To view and edit a data file then, the data file's solution is needed. A data file's solution application is one or more files that, when installed, are used to enable a user to view, access, and edit the data file.
[0019] In addition to the data file and its solution, a host application is needed. This application works to enable the solution to function fully. In this description, a document manager application is described, which is capable not only of acting as a host application (allowing a solution to function properly), but can also allow a user to open a data file without actively finding and installing the data file's solution.
[0020] For discussion purposes, the system and method described herein are described in the context of a single computer, a communications network, a user-input device, and a single display screen. These devices will be described first, followed by a discussion of the techniques in which these and other devices can be used.
[0021] Exemplary Architecture
[0022] FIG. 1 shows an exemplary architecture 100 to facilitate online and offline editing of data files. This architecture 100 includes a computing system 102 connected to a communications network 104. The system 102 is configured to go online and communicate via the communications network 104 to gain access to non-local information sources, such as sources on an intranet or global network. Alternatively, the system 102 can remain offline, where it utilizes local resources without communicating over the communications network 104.
[0023] The computing system 102 includes a user-input device 106, a display 108 having a screen 110, and a computer 112. The user-input device 106 can include any device allowing a computer to receive a designer's preferences, such as a keyboard, a mouse, a touch screen, voice-activated input device, a track ball, and the like. With the user-input device 106, a user can edit a data file by adding or deleting information within a data-entry field on an electronic form, for instance. The user can use the display 108 and its screen 110 to view the data files.
[0024] The computer 112 includes a processing unit 114 to execute applications, a memory 116 containing applications and files, and a network interface 118 to facilitate communication with the communications network 104. The memory 116 includes volatile and non-volatile memory, and applications, such as an operating system 120 and a document manager application 122. The memory 116 also includes a solution 124 for a data file 126. The solution 124 is located locally in the memory 116, but often has a different original source, such as a source on the communications network 104. The solution 124 contains one or more files, such as a presentation file 128, logic file 130, and list file 132, which will be discussed in greater detail below.
[0025] The document manager application 122 facilitates offline editing of the data files 126 and is executed by the processing unit 114. The document manager 122 is capable of acting as a host application and enabling a user to open the data file 126 without actively finding and installing the data file's solution 124. Without any user interaction, other than the user attempting to open the data file 126, the document manager 122 discovers and installs the data file's solution 124. Thus, the user does not have to do anything but request to open the data file 126. The user does not have to discover the data file's solution 124. The user does not have to install the data file's solution 124. This silent discovery and deployment allows the user to view, edit, and otherwise interact with the data file 126 with just a single request. In addition, the document manager 122 can provide security offline similar to the security that the user typically enjoys when running a solution online.
[0026] A view of the data file 126 is depicted on screen 110 through execution of the data file's solution 124. The solution 124 contains one or more applications and/or files that the document manager 122 uses to enable a user to edit the data file 126. To edit the data file 126 in a user-friendly way, the data file's solution 124 contains the presentation file 128, which includes an electronic form. This presentation file 128 gives the user a graphical, visual representation of data-entry fields showing previously entered data or blank data-entry fields into which the user can enter data. Data files often have one solution but each solution often governs multiple data files.
[0027] FIG. 2 shows an electronic form 200 entitled “Purchase Order”, which is generated by the solution 124. This purchase order 200 contains data-entry fields in which a user can enter data. These data-entry fields map to the data file 126, so that the data entered into the form are retained in the data file 126.
[0028] This solution 124 presents an electronic form but also contains the logic file 130 that governs various aspects of the electronic form and the data file 126. In a reference number data-entry field 202, for instance, the solution 124 presents the data-entry field as a white box within a gray box, provides a description of the data desired with the text “Reference Number”, and contains logic requiring that the user enter only numbers. Thus, if the user attempted to enter letters, the logic file 130 of the solution 124 would not permit the user's entry. The solution 124 could reject it and inform the user of the problem, such as with a sound, flashing error signal, pop-window, or the like.
[0029] The logic file 130 is employed in the solution 124 to ensure that the right kind of data is being entered and retained by the data file 126. A user's business manager attempting to reference purchases with a reference number, for instance, would like the solution 124 to have numbers in the reference number data-entry field 202; the manager may not be able to determine how an order should be handled if the reference number entered is incorrect because it contains letters.
[0030] Similarly, suppose a business manager wants the delivery date for delivery of a purchased product. To require this, the logic file 130 of purchase order 200's solution 124 could be constructed to require a date to be entered into a date-required data-entry field 204. The logic file 130 can be internal to the solution 124, or can be implied from the data file 126 even if the data file 126 is primarily data. The logic file 130 can also be a schema, such as an XML schema.
[0031] A solution can govern multiple data files. The exemplary purchase order 200, for example, allows one or more users to fill out many different orders. Each time a user fills out a purchase order form, the system 102 can create a separate data file for that order. Often, a user will create many different data files having the same solution. For each data file edited after the first, the system 102 is likely to have the appropriate solution stored in the memory 116. Thus, if a user previously opened a first data file and later attempts to open a second data file, both of which utilize the purchase order 200 solution, the document manager 122 can silently discover and deploy the purchase order 200 solution to enable the user to edit the second data file. How the document manager 122 discovers and deploys solutions will be discussed in greater detail below.
[0032] A solution can be one file or contain many files, so long as the files used to edit data files it governs are included. The solution 124 of FIG. 1 includes the listing file 132, which is a manifest of all of the other files in the solution 124 and contains information helping the document manager 122 to locate them. The logic file 130 and presentation file 128 can be joined or separate. The presentation file 128 helps the document manager 122 present or give a view of a form enabling entry of data into the data file 126, such as a visual representation of the data file 126 by the purchase order 200 electronic form. In some implementations, the presentation file is an XSLT file, which, when applied to an XML data file, generates a XHTML (eXtensible Hyper-Text Markup Language) or HTML (Hyper-Text Markup Language) file. XHTML and HTML files can be used to show a view on the screen 110, such as the purchase order 200 of FIG. 2 .
[0033] A solution, such as the solution 124, can also include various files or compilations of files, including a manifest file setting forth names and locations for files that are part of the solution 124. The files within the solution 124 can be packaged together, or can be separate. When separate, the list file 132 acts as a manifest of the files within the solution 124. The list file 132 can also include other information, such as definitions, design time information, data source references, and the like. When the files are packaged together, the document manager 122 can simply install and execute the packaged solution file for a particular data file. When not packaged, the document manager 122 can read the list file 132, find the listed files, and install and execute each of the listed files for the particular data file. The list file 132 and the packaged solution file can be interrelated in that an packaged file contains the list file 132 and the list file 132 lists files packaged within the packaged file, although usually only one need be discovered by the system 102 to open a particular data file.
[0034] Like solutions, data files can come in various types and styles. As mentioned above, data files can be written in XML or some other mark-up language, or can be written in other languages. Most data files, however, do not contain extensive logic and other files or code. One of the benefits of having data files separate from their solutions, is that is makes the data within them easier to mine. Because the data files are separate from their solution, the document manager 122 makes them easy to open and edit by silently discovering and deploying the solution for the data file.
[0035] Data files also are typically concise and data-centered so that the data they contain can be more easily accessed or manipulated by multiple software applications, including software not typically used in a solution, such as an application that searches for a particular type of data and compiles that data into a report. A non-typical application, for example, could be one that compiles a report of all of the purchase orders required to be mailed by a certain date by searching through and compiling the data entered into data files through the date required data-entry field 204 of the purchase order 200 electronic form.
[0036] The above devices and applications are merely representative, and other known devices and applications may be substituted for or added to those shown in FIG. 1 . One example of another known device that can be substituted for those shown in FIG. 1 is the device shown in FIG. 5 .
[0037] Techniques for Silent Discovery and Deployment of Data File Solutions
Overview
[0038] FIG. 3 shows a process 300 for silently discovering and deploying a data file's solution. The process 300 is illustrated as a series of blocks representing individual operations or acts performed by the architecture 100. The process 300 may be implemented in any suitable hardware, software, firmware, or combination thereof. In the case of software and firmware, the process 300 represents a set of operations implemented as computer-executable instructions stored in memory and executable by one or more processors.
Silent Discovery and Deployment
[0039] At block 302, the system 102 receives input from a user to open the data file 126. The user may simply click on a icon representing the data file 126 or otherwise select the data file 126 after which the system 102 opens the data file 126.
[0040] At block 304, the system 102 discovers a solution identifier in the selected data file 126. This assumes that the data file 126 is one in which the document manager 122 is capable of reading. The document manager 122 can read data files created at some previous time by the user's or another's document manager 122. In one implementation, the document manager 122 can also read the data file 126 if it is created by another application that builds a solution identifier into the data file 126.
[0041] This solution identifier can give the system 102 an original source for the solution 124. With an original source for the solution 124, the system 102 has one manner in which to help determine the proper security appropriate for the solution 124. How the system 102 and the document manager 122 handle security for a solution 124 is set forth in greater detail below.
[0042] The solution identifier is typically a URL (Uniform Resource Locator) or URN (Uniform Resource Name), but can include other types of names and/or locators. URLs give locations and URNs names of resources, such as the solution 124, which are typically accessible through the communications network 104. With the solution identifier, the system 102 can determine the original source for the solution 124 (where it first came from) and whether or not the system 102 has seen the solution 124 before.
[0043] In one implementation, the solution identifier is part of a processing instruction included within the data file 126. This processing instruction is often part of data files and can include various instructions to host applications, such as the document manager 122. Processing instructions, while not strictly data, do not rise to the level of an applet or application typically included in a solution for a data file. For data files written in XML, for instance, the processing instructions are usually not written in XML, but rather are just a piece of information commonly included. A processing instruction in an XML data file can look like “<? mso-infoPathSolution solutionVersion=“1.0.0.3” PIVersion=“1.0.0.0” href=“http://xdsp04-neten/MiladinP/Forms/template.xsn” ?>”. This processing instruction give the document manager 122 a solution identifier, which here gives the original source for the solution for the data file. This solution identifier includes a URL indicating that the original location for the solution is at a remote server accessible by accessing the communications network 104 through the network interface 118.
[0044] One of the advantages of the document manager 122 is that it enables a user to open the data file 126 without the user needing to discover the data file's solution 124, install the solution 124, or even know that the solution 124 exists. This system and method enables users to open data files simply and easily and in many cases enables them to edit a data file offline that they would otherwise not have been able to edit.
[0045] With the solution identifier, the system 102 computes a special name for the solution 124 (block 306). This special name is designed to be a name easily found only by the document manager 122. The special name, because it is computed and findable by the document manager 122 but is not intended to be discoverable by other applications, allows for greater security in downloading possibly hostile solutions from the communications network 104.
[0046] In one implementation, the document manager 122 takes the solution identifier and computes a unique special name for the solution identifier. This unique special name is repeatable; the next time the document manager 122 computes a unique special name for the same solution identifier, the same unique special name will be created. By so doing, the document manager 122 can find a previously downloaded solution by computing the unique, special name and then searching for the unique, special name to determine if the solution is available locally for offline use (such as by having the solution stored in the memory 116).
[0047] In another implementation, the document manager 122 computes a unique special name by computing a hash, such as a Message Digest 5 hash (MD5 hash), of the solution identifier. By computing a one-way hash of the solution identifier, the document manager 122 creates a unique, special name that is a file of 128 bits from the digits of the solution identifier. Because the file of the unique, special name is 128 bits long, it is very difficult for another application, such as one designed to damage a computer or its files, to determine if the solution 124 is on the computer (cached or available offline) and access the solution 124. With this hash-based special name, the document manager 122 provides additional security for the system 102.
[0048] The system 102 uses the special name, which corresponds to a solution identifier and thus the data file's solution 124, to search through locally accessible sources for the solution 124 (block 308). The system 102 may, for instance, search files and folders in the memory 116 of FIG. 1 for files and/or folders with the same name as the special name computed in the block 306.
When the Special Name is Found
[0049] If the system 102 finds the special name (i.e., the “Yes” branch from block 310) the solution 124 was saved earlier in the system 102 searched locally in the block 308. Thus, when the special name is found, the system 102 knows that the solution 124 referred to in the data file (which the user is attempting to open) is accessible offline by the system 102. The solution 124 is usually stored in the memory 116 but can be stored in other searchable, local sources that the system 102 does not have to go online to find.
[0050] The solution 124, stored at the source and found using the special name, may not be current, however. Because of this, the system 102 determines whether or not the system 102 is online or offline (block 312). If online (i.e., the “Yes” branch from block 312), the system 102 will attempt to determine whether or not a more up-to-date solution should be installed (discussed below); if offline, the system 102 will proceed to install the locally stored solution 124 (block 314).
If the Solution is Found and the System is Offline
[0051] If the solution 124 is found and the system 102 is offline, the system 102 proceeds to install the solution 124 from the memory 116 or another locally accessible source (block 314).
[0052] The system 102 installs the solution 124 silently in that the suer does not need to known that the solution 124 was discovered, found, or being installed. Thus, the system 102 enables a user to edit the data file 126 when offline by silently discovering and deploying the data file's solution 124.
[0053] In one implementation, the system 102 installs the solution 124 and then opens the data file 126 in such a manner as to mimic how the data file 126 would be opened had the user opened the data file 126 with the solution accessible online, such as through opening the data file 126 with Microsoft® Internet Explorer®. The system 102 does so to make opening and editing the data file 126 as comfortable for the user as possible, because many users are familiar with opening data files online. One possible difference, however, is that if the system 102 has a slow connection to the communications network 104, the document manager 122, by installing the solution 124 from a local source like the memory 116, may more quickly open the data file 126 than if the user were online.
[0054] Also in block 314, the document manager 122 can install the solution 124 for the selected data file with certain constraints for security, which will be discussed in greater detail as part of a process 400 of FIG. 4 .
[0055] In block 316, the system 102 opens the data file 126 to enable the user to edit the data file 126. One example of an opened data file (and solution) enabling edits is the purchase order 200 of FIG. 2 . In this example, the user is able to edit the data file 126 by adding, deleting, or changing data in data entry fields (like the reference number data-entry field 202 and the date required data-entry field 204) even though offline.
[0056] Following the previous blocks, a user can easily open a data file offline without having to discover or deploy the data file's solution. This enables users, for example, after first opening a solution online, to open a data file offline. A user can open a data file online and edit it by adding a reference number through the reference number data-entry field 202 of the purchase order 200 electronic form and then stop editing the data file (the data file would contain the added reference number by the system 102 adding the reference number to the data file). The user could then go offline, such as by taking his or her laptop on a business trip, and complete filling out the electronic form. Or the user could send the partially filled-out data file to another user to fill out the rest of the electronic form, which the other user could do so long as the other user's system contains a stored solution. This flexibility allows users and businesses a greater ability to use information by keeping data and solutions separate and by allowing offline use of data files.
If the Solution is Found and the System is Online
[0057] Assuming the system 102 finds the special name and the system is online, the system 102 will attempt to determine whether the current solution is the most recent version or a more up-to-date solution is available. In block 318, the system 102 compares the time stamp of the stored solution 124 and the online solution. Since the system 102 is online, it can access the solution (here we assume that the original origin of the solution 124 is from an online source). If the solution identifier from the data file 126 selected by the user contains a reference to the solution 124 being accessible online, the system 102 goes online to check whether or not the online solution is newer than the stored solution 124 (block 320). In one implementation, the system 102 compares the time stamp of the online solution with a time stamp on the stored solution 124.
[0058] If the online solution is not newer (i.e., the “No” branch from block 320), the system 102 proceeds to the block 314, installing the stored solution 124. If the online solution is newer than the stored solution 124 (i.e., the “Yes” branch from block 320), the system 102 either replaces the stored solution 124 with the online solution or otherwise updates the older, stored solution 124.
Downloading the Solution for Later Use
[0059] In block 322, the architecture 100 (or the system 102 by accessing the communications network 104) downloads a solution into a locally accessible source such as the memory 116. The system 102 downloads this solution when the data file 126 selected by a user contains a solution identifier for a solution for which the system 102 does not have local access (such as it not being cached) or for which the system 102 has local access but the cached or stored version of the solution (the solution 124) is older than the online version.
[0060] In either case, the system 102 has already discovered the solution identifier for the solution and computed a special name for the solution. The system 102 then downloads the solution from the online source and saves it into a folder named with the special name (block 324). If a solution already exists in that folder, the system 102 replaces it with the newer version or otherwise updates the currently cached solution. The resulting new or updated version then being the solution 124.
[0061] In one implementation, the system 102 saves the solution to a unique location within the system 102's accessible memory. The system 102 does so in cases where the system 102 is used by multiple users. By so doing, the system 102 is able to determine which of the users that use the system 102 or load files into memory locally accessible by the system 102 saved the particular solution. Also by so doing, the system 102 may provide greater security for the computer 112 and its users.
[0062] Techniques for Secure Deployment of Data File Solutions
[0063] FIG. 4 shows a process 400 for making deployment of data file solutions more secure. The process 400 is illustrated as a series of blocks representing individual operations or acts performed by the system 102. The process 400 may be implemented in any suitable hardware, software, firmware, or combination thereof. In the case of software and firmware, the process 400 represents a set of operations implemented as computer-executable instructions stored in memory and executable by one or more processors.
[0064] Through the process 300, discussed above, the system 102 enables a user to open and edit a data file by silently discovering and deploying the data file's solution. In the process 400, the system 102 acts to protect the user from the solution because some solutions contain dangerous code, like viruses and worms. To help prevent dangerous code from damaging the user's files and/or computer, the system 102 sandboxes the solution, if appropriate.
[0065] As part of this security, the system 102 can be configured to ask a user during an attempt to open a data file how the user wants to sandbox the data file's solution. Many users, however, often do not know what level of sandboxing to chose, and thus the explicit prompting slows the process and consumes unnecessary user time.
[0066] To make opening and editing a data file as easy as possible and because many users do not know what level of sandboxing a solution should be run within, the system 102 can be configured to sandbox a solution automatically, as set forth in FIG. 4 and the process 400 below.
[0067] In block 402, the system 102 determines the origin of a solution, such as the solution 124 of FIG. 1 . The system 102, from block 304, discovered the solution identifier from the data file 126. With this solution identifier, the system 102 can determine the origin of the solution 124.
[0068] The solution identifier can be a URL, a URN, or another Uniform Resource Identifier (URI). URLs give a location for a solution and URNs a name, either of which can be used to locate and find the source of a solution. URLs usually indicate a non-local, online source for a solution like a remote server accessible through the communications network 104. URNs give the name of a solution, which typically can be accessed online (but could be accessed from a local, offline source), and are less subject to change by those in control of the solution. In either case, these solution identifiers give the system 102 the original source of the solution. The solution may be cached or otherwise stored by the system 102 in a local source (such as the solution 124 in the memory 116), but the local source is not indicated as the solution's origin by the solution's solution identifier, the local source is a new source.
[0069] With the origin of the solution known, the document manager 122 sets the appropriate level of security for the solution 124, sandboxing the solution 124 based on its origin (block 404). The document manager 122 sandboxes the solution 124, if from unknown or untrustworthy sources on the global internet with a sandbox allowing the solution 124 very little leeway in the operations it can perform, such as reading or altering other files on the computer 112. Greater trust, and so a weaker sandbox, are used for the solution 124 if it has an origin from known and more trustworthy sources accessed remotely, such as from MSN.com or a company intranet source. Very high trust, requiring a weak or no sandbox, is used for the solution 124 if is has an origin on the computer 112, such as when the user or another person using the user's computer created the solution 124.
[0070] Setting security levels and appropriate use of sandboxes for online use of solutions for data files are performed by various internet-capable host applications. The document manager 122, however, opens solutions and sandboxes them based on their origin even when the solution is opened from a local source that differs from the original origin of the solution. Typically, internet-capable host applications, such as Internet Explorer®, will not open a solution from a local source silently, but will return an error if the online copy is not available. The document manager 122, however, opens and executes, without user interaction, solutions in appropriate sandboxes even when a solution is loaded from a local source.
[0071] In block 406, the system 102 installs the solution 124 within an appropriate sandbox. This appropriate sandbox limits the operations that the solution 124 can perform, thereby helping to protect the computer 112 and its files from the solution 124.
[0072] A Computer System
[0073] FIG. 5 shows an exemplary computer system that can be used to implement the processes described herein. Computer 542 includes one or more processors or processing units 544, a system memory 546, and a bus 548 that couples various system components including the system memory 546 to processors 544. The bus 548 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 546 includes read only memory (ROM) 550 and random access memory (RAM) 552. A basic input/output system (BIOS) 554, containing the basic routines that help to transfer information between elements within computer 542, such as during start-up, is stored in ROM 550.
[0074] Computer 542 further includes a hard disk drive 556 for reading from and writing to a hard disk (not shown), a magnetic disk drive 558 for reading from and writing to a removable magnetic disk 560, and an optical disk drive 562 for reading from or writing to a removable optical disk 564 such as a CD ROM or other optical media. The hard disk drive 556, magnetic disk drive 558, and optical disk drive 562 are connected to the bus 548 by an SCSI interface 566 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 542. Although the exemplary environment described herein employs a hard disk, a removable magnetic disk 560 and a removable optical disk 564, 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.
[0075] A number of program modules may be stored on the hard disk 556, magnetic disk 560, optical disk 564, ROM 550, or RAM 552, including an operating system 570, one or more application programs 572 (such as the document manager application 122), other program modules 574, and program data 576. A user may enter commands and information into computer 542 through input devices such as a keyboard 578 and a pointing device 580. 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 544 through an interface 582 that is coupled to the bus 548. A monitor 584 or other type of display device is also connected to the bus 548 via an interface, such as a video adapter 586. In addition to the monitor, personal computers typically include other peripheral output devices (not shown) such as speakers and printers.
[0076] Computer 542 commonly operates in a networked environment using logical connections to one or more remote computers, such as a remote computer 588. The remote computer 588 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 542. The logical connections depicted in FIG. 5 include a local area network (LAN) 590 and a wide area network (WAN) 592. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets, and the Internet.
[0077] When used in a LAN networking environment, computer 542 is connected to the local network through a network interface or adapter 594. When used in a WAN networking environment, computer 542 typically includes a modem 596 or other means for establishing communications over the wide area network 592, such as the Internet. The modem 596, which may be internal or external, is connected to the bus 548 via a serial port interface 568. In a networked environment, program modules depicted relative to the personal computer 542, 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.
[0078] Generally, the data processors of computer 542 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.
[0079] 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.
[0080] Conclusion
[0081] The above-described system and method enables a user to edit data files when offline by discovering and deploying the data file's solution application. 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
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
The invention claimed is:
1. A method comprising:
receiving input to open a data file written in a mark-up language and having a solution;
discovering, without user interaction, the solution in an offline memory source;
deploying, without user interaction, the solution; and
opening the data file.
2. The method of claim 1, wherein the deploying is within a sandbox.
3. The method of claim 1, wherein discovering the solution includes discovering a solution identifier in the data file, computing a special name from the solution identifier, and discovering the solution using the special name.
4. The method of claim 1 further comprising, prior to deploying the solution;
updating the solution discovered in the offline memory source with a newer solution.
5. The method of claim 1, wherein the data file includes primarily data.
6. The method of claim 1, wherein the solution includes a presentation application.
7. The method of claim 1, wherein the solution includes a logic application.
8. The method of claim 1, wherein opening the data file is performed with the solution and produces an electronic form.
9. A computer-readable medium comprising computer-executable instructions that perform the method of claim 1 when executed by a computer.
10. The method of claim 1, wherein the mark-up language is XML.
11. A method comprising:
receiving input to open a data file having a solution previously received from an online memory source;
discovering a solution identifier in the data file;
computing a special name corresponding to the solution identifier;
searching local memory for the special name; and
installing the solution found in a folder in the local memory and having the special name.
13. The method of claim 11, wherein the special name is unique.
14. A computer-readable medium comprising computer-executable instructions that perform the method of claim 11 when executed by a computer.
15. The method of claim 11, wherein the data file is written in a mark-up language.
16. The method of claim 15, wherein the mark-up language comprises XML.
17. An apparatus comprising:
means for displaying a representation of a data file governed by a solution application received from an online memory source;
means for selecting the data file;
means for discovering and deploying, without user interaction, the solution application governing the data file from an offline memory source;
means for displaying an electronic form representing a product of the solution application and the data file;
means for enabling a user to enter information into the electronic form;
means for receiving information entered into the electronic form; and
means for altering the data file to reflect the information received.
18. The apparatus of claim 17, wherein the data file is written in a mark-up language.
19. The apparatus of claim 18, wherein the mark-up language comprises XML.
Patent Citations (643)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4201978(A) | 1980-05-01 | Nally | Applicant |
| US4498147(A) | 1985-02-01 | Agnew et al. | Applicant |
| US4514800(A) | 1985-04-01 | Gruner et al. | Applicant |
| US4564752(A) | 1986-01-01 | Lepic et al. | Applicant |
| US4641274(A) | 1987-02-01 | Swank | Applicant |
| US4674040(A) | 1987-06-01 | Barker et al. | Applicant |
| US4723211(A) | 1988-02-01 | Barker et al. | Applicant |
| US4739477(A) | 1988-04-01 | Barker et al. | Applicant |
| US4815029(A) | 1989-03-01 | Barker et al. | Applicant |
| US4847749(A) | 1989-07-01 | Collins et al. | Examiner |
| US4910663(A) | 1990-03-01 | Bailey | Applicant |
| US4933880(A) | 1990-06-01 | Borgendale et al. | Applicant |
| US4962475(A) | 1990-10-01 | Hernandez et al. | Applicant |
| US5025484(A) | 1991-06-01 | Yamanari et al. | Applicant |
| US5072412(A) | 1991-12-01 | Henderson, Jr. et al. | Applicant |
| US5179703(A) | 1993-01-01 | Evans | Applicant |
| US5182709(A) | 1993-01-01 | Makus | Applicant |
| US5187786(A) | 1993-02-01 | Densmore et al. | Applicant |
| US5191645(A) | 1993-03-01 | Carlucci et al. | Applicant |
| US5195183(A) | 1993-03-01 | Miller et al. | Applicant |
| US5204947(A) | 1993-04-01 | Bernstein et al. | Applicant |
| US5206951(A) | 1993-04-01 | Khoyi et al. | Applicant |
| US5218672(A) | 1993-06-01 | Morgan et al. | Applicant |
| US5222160(A) | 1993-06-01 | Sakai et al. | Applicant |
| US5228100(A) | 1993-07-01 | Takeda et al. | Applicant |
| US5237680(A) | 1993-08-01 | Adams et al. | Applicant |
| US5249275(A) | 1993-09-01 | Srivastava | Applicant |
| US5274803(A) | 1993-12-01 | Dubin et al. | Applicant |
| US5297249(A) | 1994-03-01 | Bernstein et al. | Applicant |
| US5297283(A) | 1994-03-01 | Kelly, Jr. et al. | Applicant |
| US5313631(A) | 1994-05-01 | Kao | Applicant |
| US5313646(A) | 1994-05-01 | Hendricks et al. | Applicant |
| US5317686(A) | 1994-05-01 | Salas et al. | Applicant |
| US5333317(A) | 1994-07-01 | Dann | Applicant |
| US5339423(A) | 1994-08-01 | Beitel et al. | Applicant |
| US5339424(A) | 1994-08-01 | Fushimi | Applicant |
| US5341478(A) | 1994-08-01 | Travis, Jr. et al. | Applicant |
| US5369766(A) | 1994-11-01 | Nakano et al. | Applicant |
| US5369778(A) | 1994-11-01 | San Soucie et al. | Applicant |
| US5371675(A) | 1994-12-01 | Greif et al. | Applicant |
| US5377323(A) | 1994-12-01 | Vasudevan | Applicant |
| US5379419(A) | 1995-01-01 | Heffeman et al. | Applicant |
| US5381547(A) | 1995-01-01 | Flug et al. | Applicant |
| US5390325(A) | 1995-02-01 | Miller | Applicant |
| US5396623(A) | 1995-03-01 | McCall et al. | Applicant |
| US5408665(A) | 1995-04-01 | Fitzgerald | Applicant |
| US5410646(A) | 1995-04-01 | Tondevold et al. | Applicant |
| US5410688(A) | 1995-04-01 | Williams et al. | Applicant |
| US5412772(A) | 1995-05-01 | Monson | Applicant |
| US5434975(A) | 1995-07-01 | Allen | Applicant |
| US5436637(A) | 1995-07-01 | Gayraud et al. | Applicant |
| US5438659(A) | 1995-08-01 | Notess et al. | Applicant |
| US5440744(A) | 1995-08-01 | Jacobson et al. | Applicant |
| US5446842(A) | 1995-08-01 | Schaeffer et al. | Applicant |
| US5455875(A) | 1995-10-01 | Chevion et al. | Applicant |
| US5459865(A) | 1995-10-01 | Heninger et al. | Applicant |
| US5481722(A) | 1996-01-01 | Skinner | Applicant |
| US5497489(A) | 1996-03-01 | Menne | Applicant |
| US5504898(A) | 1996-04-01 | Klein | Applicant |
| US5517655(A) | 1996-05-01 | Collins et al. | Applicant |
| US5535389(A) | 1996-07-01 | Elder et al. | Applicant |
| US5542070(A) | 1996-07-01 | LeBlanc et al. | Applicant |
| US5550976(A) | 1996-08-01 | Henderson et al. | Applicant |
| US5551035(A) | 1996-08-01 | Arnold et al. | Applicant |
| US5555325(A) | 1996-09-01 | Burger | Applicant |
| US5566330(A) | 1996-10-01 | Sheffield | Applicant |
| US5572643(A) | 1996-11-01 | Judson | Applicant |
| US5572648(A) | 1996-11-01 | Bibayan | Applicant |
| US5577252(A) | 1996-11-01 | Nelson et al. | Applicant |
| US5581686(A) | 1996-12-01 | Koppolu et al. | Applicant |
| US5581760(A) | 1996-12-01 | Atkinson et al. | Applicant |
| US5600789(A) | 1997-02-01 | Parker et al. | Applicant |
| US5602996(A) | 1997-02-01 | Powers, III et al. | Applicant |
| US5608720(A) | 1997-03-01 | Biegel et al. | Applicant |
| US5625783(A) | 1997-04-01 | Ezekiel et al. | Applicant |
| US5627979(A) | 1997-05-01 | Chang et al. | Applicant |
| US5630126(A) | 1997-05-01 | Redpath | Applicant |
| US5634121(A) | 1997-05-01 | Tracz et al. | Applicant |
| US5634124(A) | 1997-05-01 | Khoyi et al. | Applicant |
| US5640544(A) | 1997-06-01 | Onodera et al. | Applicant |
| US5644738(A) | 1997-07-01 | Goldman et al. | Applicant |
| US5649099(A) | 1997-07-01 | Theimer et al. | Applicant |
| US5659729(A) | 1997-08-01 | Nielsen | Applicant |
| US5664178(A) | 1997-09-01 | Sinofsky | Applicant |
| US5669005(A) | 1997-09-01 | Curbow et al. | Applicant |
| US5682536(A) | 1997-10-01 | Atkinson et al. | Applicant |
| US5689667(A) | 1997-11-01 | Kurtenbach | Applicant |
| US5689703(A) | 1997-11-01 | Atkinson et al. | Applicant |
| US5704029(A) | 1997-12-01 | Wright, Jr. | Applicant |
| US5706501(A) | 1998-01-01 | Horikiri et al. | Applicant |
| US5717939(A) | 1998-02-01 | Bricklin et al. | Applicant |
| US5721824(A) | 1998-02-01 | Taylor | Applicant |
| US5740439(A) | 1998-04-01 | Atkinson et al. | Applicant |
| US5742504(A) | 1998-04-01 | Meyer et al. | Applicant |
| US5745683(A) | 1998-04-01 | Lee et al. | Applicant |
| US5745712(A) | 1998-04-01 | Turpin et al. | Applicant |
| US5748807(A) | 1998-05-01 | Lopresti et al. | Applicant |
| US5758184(A) | 1998-05-01 | Lucovsky et al. | Applicant |
| US5758358(A) | 1998-05-01 | Ebbo | Applicant |
| US5761408(A) | 1998-06-01 | Kolawa et al. | Applicant |
| US5761683(A) | 1998-06-01 | Logan et al. | Applicant |
| US5764984(A) | 1998-06-01 | Loucks | Applicant |
| US5764985(A) | 1998-06-01 | Smale | Applicant |
| US5778372(A) | 1998-07-01 | Cordell et al. | Applicant |
| US5778402(A) | 1998-07-01 | Gipson | Applicant |
| US5784555(A) | 1998-07-01 | Stone | Applicant |
| US5790796(A) | 1998-08-01 | Sadowsky | Applicant |
| US5798757(A) | 1998-08-01 | Smith | Applicant |
| US5801701(A) | 1998-09-01 | Koppolu et al. | Applicant |
| US5802304(A) | 1998-09-01 | Stone | Applicant |
| US5806079(A) | 1998-09-01 | Rivette et al. | Applicant |
| US5815830(A) | 1998-09-01 | Anthony | Applicant |
| US5826265(A) | 1998-10-01 | Van Huben et al. | Applicant |
| US5835777(A) | 1998-11-01 | Staelin | Applicant |
| US5838906(A) | 1998-11-01 | Doyle et al. | Applicant |
| US5842018(A) | 1998-11-01 | Atkinson et al. | Applicant |
| US5845077(A) | 1998-12-01 | Fawcett | Applicant |
| US5845090(A) | 1998-12-01 | Collins, III et al. | Applicant |
| US5854630(A) | 1998-12-01 | Nielsen | Applicant |
| US5859973(A) | 1999-01-01 | Carpenter et al. | Applicant |
| US5862372(A) | 1999-01-01 | Morris et al. | Applicant |
| US5862379(A) | 1999-01-01 | Rubin et al. | Applicant |
| US5864819(A) | 1999-01-01 | De Armas et al. | Applicant |
| US5907704(A) | 1999-05-01 | Gudmundson et al. | Applicant |
| US5910895(A) | 1999-06-01 | Proskauer et al. | Applicant |
| US5911776(A) | 1999-06-01 | Guck | Applicant |
| US5915112(A) | 1999-06-01 | Boutcher | Applicant |
| US5922072(A) | 1999-07-01 | Hutchinson et al. | Applicant |
| US5928363(A) | 1999-07-01 | Ruvolo | Applicant |
| US5929858(A) | 1999-07-01 | Shibata et al. | Examiner |
| US5940075(A) | 1999-08-01 | Mutschler, III et al. | Applicant |
| US5950010(A) | 1999-09-01 | Hesse et al. | Applicant |
| US5956481(A) | 1999-09-01 | Walsh et al. | Examiner |
| US5960199(A) | 1999-09-01 | Brodsky et al. | Applicant |
| US5963964(A) | 1999-10-01 | Nielsen | Applicant |
| US5973696(A) | 1999-10-01 | Agranat et al. | Applicant |
| US5974454(A) | 1999-10-01 | Apfel et al. | Applicant |
| US5982370(A) | 1999-11-01 | Kamper | Applicant |
| US5983348(A) | 1999-11-01 | Ji | Applicant |
| US5987480(A) | 1999-11-01 | Donohue et al. | Applicant |
| US5991710(A) | 1999-11-01 | Papineni et al. | Applicant |
| US5991731(A) | 1999-11-01 | Colon et al. | Applicant |
| US5991877(A) | 1999-11-01 | Luckenbaugh | Applicant |
| US5995103(A) | 1999-11-01 | Ashe | Applicant |
| US5999740(A) | 1999-12-01 | Rowley | Applicant |
| US6005570(A) | 1999-12-01 | Gayraud et al. | Applicant |
| US6014135(A) | 2000-01-01 | Fernandes | Applicant |
| US6016520(A) | 2000-01-01 | Facq et al. | Applicant |
| US6018743(A) | 2000-01-01 | Xu | Applicant |
| US6026379(A) | 2000-02-01 | Haller et al. | Applicant |
| US6026416(A) | 2000-02-01 | Kanerva et al. | Applicant |
| US6031989(A) | 2000-02-01 | Cordell | Applicant |
| US6035297(A) | 2000-03-01 | Van Huben et al. | Applicant |
| US6035309(A) | 2000-03-01 | Dauerer et al. | Applicant |
| US6044205(A) | 2000-03-01 | Reed et al. | Applicant |
| US6052531(A) | 2000-04-01 | Waldin et al. | Applicant |
| US6052710(A) | 2000-04-01 | Saliba et al. | Applicant |
| US6054987(A) | 2000-04-01 | Richardson | Applicant |
| US6070184(A) | 2000-05-01 | Blount et al. | Applicant |
| US6072870(A) | 2000-06-01 | Nguyen et al. | Applicant |
| US6078326(A) | 2000-06-01 | Kilmer et al. | Applicant |
| US6078327(A) | 2000-06-01 | Liman et al. | Applicant |
| US6078924(A) | 2000-06-01 | Ainsbury et al. | Applicant |
| US6081610(A) | 2000-06-01 | Dwork et al. | Applicant |
| US6084585(A) | 2000-07-01 | Kraft et al. | Applicant |
| US6088708(A) | 2000-07-01 | Burch et al. | Applicant |
| US6091417(A) | 2000-07-01 | Lefkowitz | Applicant |
| US6094657(A) | 2000-07-01 | Hailpern et al. | Applicant |
| US6097382(A) | 2000-08-01 | Rosen et al. | Applicant |
| US6098081(A) | 2000-08-01 | Heidorn et al. | Applicant |
| US6108637(A) | 2000-08-01 | Blumenau | Applicant |
| US6108783(A) | 2000-08-01 | Krawczyk et al. | Applicant |
| US6115646(A) | 2000-09-01 | Fiszman et al. | Applicant |
| US6121965(A) | 2000-09-01 | Kenney et al. | Applicant |
| US6122647(A) | 2000-09-01 | Horowitz et al. | Applicant |
| US6144969(A) | 2000-11-01 | Inokuchi et al. | Examiner |
| US6151624(A) | 2000-11-01 | Teare et al. | Applicant |
| US6154128(A) | 2000-11-01 | Wookey et al. | Applicant |
| US6163772(A) | 2000-12-01 | Kramer et al. | Applicant |
| US6167521(A) | 2000-12-01 | Smith et al. | Applicant |
| US6167523(A) | 2000-12-01 | Strong | Applicant |
| US6182094(B1) | 2001-01-01 | Humpleman et al. | Applicant |
| US6182095(B1) | 2001-01-01 | Leymaster et al. | Applicant |
| US6188401(B1) | 2001-02-01 | Peyer | Applicant |
| US6192367(B1) | 2001-02-01 | Hawley et al. | Examiner |
| US6195661(B1) | 2001-02-01 | Filepp et al. | Applicant |
| US6199204(B1) | 2001-03-01 | Donohue | Applicant |
| US6209128(B1) | 2001-03-01 | Gerard et al. | Applicant |
| US6216152(B1) | 2001-04-01 | Wong et al. | Applicant |
| US6219698(B1) | 2001-04-01 | Iannucci et al. | Applicant |
| US6225996(B1) | 2001-05-01 | Gibb et al. | Applicant |
| US6235027(B1) | 2001-05-01 | Herzon | Applicant |
| US6253366(B1) | 2001-06-01 | Mutschler, III | Applicant |
| US6253374(B1) | 2001-06-01 | Dresevic et al. | Applicant |
| US6263313(B1) | 2001-07-01 | Milsted et al. | Applicant |
| US6266810(B1) | 2001-07-01 | Tanaka et al. | Applicant |
| US6268852(B1) | 2001-07-01 | Lindhorst et al. | Applicant |
| US6272506(B1) | 2001-08-01 | Bell | Applicant |
| US6275227(B1) | 2001-08-01 | DeStefano | Applicant |
| US6275599(B1) | 2001-08-01 | Adler et al. | Applicant |
| US6279042(B1) | 2001-08-01 | Ouchi | Applicant |
| US6281896(B1) | 2001-08-01 | Alimpich et al. | Applicant |
| US6282711(B1) | 2001-08-01 | Halpern et al. | Applicant |
| US6286033(B1) | 2001-09-01 | Kishinsky et al. | Applicant |
| US6292897(B1) | 2001-09-01 | Gennaro et al. | Applicant |
| US6297819(B1) | 2001-10-01 | Furst | Applicant |
| US6300948(B1) | 2001-10-01 | Geller et al. | Applicant |
| US6307955(B1) | 2001-10-01 | Zank et al. | Applicant |
| US6308179(B1) | 2001-10-01 | Petersen et al. | Applicant |
| US6308273(B1) | 2001-10-01 | Goertzel et al. | Applicant |
| US6311271(B1) | 2001-10-01 | Gennaro et al. | Applicant |
| US6314415(B1) | 2001-11-01 | Mukherjee | Applicant |
| US6321259(B1) | 2001-11-01 | Ouellette et al. | Applicant |
| US6321334(B1) | 2001-11-01 | Jerger et al. | Applicant |
| US6327628(B1) | 2001-12-01 | Anuff et al. | Applicant |
| US6331864(B1) | 2001-12-01 | Coco et al. | Applicant |
| US6342907(B1) | 2002-01-01 | Petty et al. | Applicant |
| US6343149(B1) | 2002-01-01 | Motoiwa | Applicant |
| US6343302(B1) | 2002-01-01 | Graham | Applicant |
| US6345256(B1) | 2002-02-01 | Milsted et al. | Applicant |
| US6345278(B1) | 2002-02-01 | Hitchcock et al. | Applicant |
| US6345361(B1) | 2002-02-01 | Jerger et al. | Applicant |
| US6347323(B1) | 2002-02-01 | Garber et al. | Applicant |
| US6349408(B1) | 2002-02-01 | Smith | Applicant |
| US6351574(B1) | 2002-02-01 | Yair et al. | Applicant |
| US6353851(B1) | 2002-03-01 | Anupam et al. | Applicant |
| US6353926(B1) | 2002-03-01 | Parthesarathy et al. | Applicant |
| US6356906(B1) | 2002-03-01 | Lippert et al. | Applicant |
| US6357038(B1) | 2002-03-01 | Scouten | Applicant |
| US6366907(B1) | 2002-04-01 | Fanning et al. | Applicant |
| US6366912(B1) | 2002-04-01 | Wallent et al. | Applicant |
| US6367013(B1) | 2002-04-01 | Bisbee et al. | Applicant |
| US6369840(B1) | 2002-04-01 | Barnett et al. | Applicant |
| US6369841(B1) | 2002-04-01 | Salomon et al. | Applicant |
| US6374402(B1) | 2002-04-01 | Schmeidler et al. | Applicant |
| US6381742(B2) | 2002-04-01 | Forbes et al. | Applicant |
| US6381743(B1) | 2002-04-01 | Mutschler, III | Applicant |
| US6389434(B1) | 2002-05-01 | Rivette et al. | Applicant |
| US6393456(B1) | 2002-05-01 | Ambler et al. | Applicant |
| US6396488(B1) | 2002-05-01 | Simmons et al. | Applicant |
| US6405221(B1) | 2002-06-01 | Levine et al. | Applicant |
| US6405238(B1) | 2002-06-01 | Votipka | Applicant |
| US6408311(B1) | 2002-06-01 | Baisley et al. | Applicant |
| US6414700(B1) | 2002-07-01 | Kurtenbach et al. | Applicant |
| US6421070(B1) | 2002-07-01 | Ramos et al. | Applicant |
| US6421656(B1) | 2002-07-01 | Cheng et al. | Applicant |
| US6425125(B1) | 2002-07-01 | Fries et al. | Applicant |
| US6429885(B1) | 2002-08-01 | Saib et al. | Applicant |
| US6434563(B1) | 2002-08-01 | Pasquali et al. | Applicant |
| US6434564(B2) | 2002-08-01 | Ebert | Applicant |
| US6442563(B1) | 2002-08-01 | Bacon et al. | Applicant |
| US6442755(B1) | 2002-08-01 | Lemmons et al. | Applicant |
| US6446110(B1) | 2002-09-01 | Lection et al. | Applicant |
| US6449617(B1) | 2002-09-01 | Quinn et al. | Applicant |
| US6457009(B1) | 2002-09-01 | Bollay | Applicant |
| US6460058(B2) | 2002-10-01 | Koppolu et al. | Applicant |
| US6463419(B1) | 2002-10-01 | Kluss | Applicant |
| US6470349(B1) | 2002-10-01 | Heninger et al. | Applicant |
| US6473800(B1) | 2002-10-01 | Jerger et al. | Applicant |
| US6476828(B1) | 2002-11-01 | Burkett et al. | Applicant |
| US6476833(B1) | 2002-11-01 | Moshfeghi | Applicant |
| US6477544(B1) | 2002-11-01 | Bolosky et al. | Applicant |
| US6480860(B1) | 2002-11-01 | Monday | Applicant |
| US6487566(B1) | 2002-11-01 | Sundaresan | Applicant |
| US6490601(B1) | 2002-12-01 | Markus et al. | Applicant |
| US6493702(B1) | 2002-12-01 | Adar et al. | Applicant |
| US6501864(B1) | 2002-12-01 | Eguchi et al. | Applicant |
| US6502101(B1) | 2002-12-01 | Verprauskus et al. | Applicant |
| US6502103(B1) | 2002-12-01 | Frey et al. | Applicant |
| US6505200(B1) | 2003-01-01 | Ims et al. | Applicant |
| US6505230(B1) | 2003-01-01 | Mohan et al. | Applicant |
| US6505300(B2) | 2003-01-01 | Chen et al. | Applicant |
| US6507856(B1) | 2003-01-01 | Chen et al. | Applicant |
| US6516322(B1) | 2003-02-01 | Meredith | Applicant |
| US6519617(B1) | 2003-02-01 | Wanderski et al. | Applicant |
| USRE38070(E) | 2003-04-01 | Spies et al. | Applicant |
| US6546546(B1) | 2003-04-01 | Van Doorn | Applicant |
| US6549221(B1) | 2003-04-01 | Brown et al. | Applicant |
| US6549878(B1) | 2003-04-01 | Lowry et al. | Applicant |
| US6549922(B1) | 2003-04-01 | Srivastava et al. | Examiner |
| US6553402(B1) | 2003-04-01 | Makarios et al. | Applicant |
| US6560616(B1) | 2003-05-01 | Garber | Applicant |
| US6560620(B1) | 2003-05-01 | Ching | Applicant |
| US6560640(B2) | 2003-05-01 | Smethers | Applicant |
| US6563514(B1) | 2003-05-01 | Samar | Applicant |
| US6571253(B1) | 2003-05-01 | Thompson et al. | Applicant |
| US6578144(B1) | 2003-06-01 | Gennaro et al. | Applicant |
| US6581061(B2) | 2003-06-01 | Graham | Applicant |
| US6584469(B1) | 2003-06-01 | Chiang et al. | Applicant |
| US6584548(B1) | 2003-06-01 | Bourne et al. | Applicant |
| US6585778(B1) | 2003-07-01 | Hind et al. | Applicant |
| US6589290(B1) | 2003-07-01 | Maxwell et al. | Applicant |
| US6594686(B1) | 2003-07-01 | Edwards et al. | Applicant |
| US6598219(B1) | 2003-07-01 | Lau | Applicant |
| US6603489(B1) | 2003-08-01 | Edlund et al. | Applicant |
| US6604099(B1) | 2003-08-01 | Chung et al. | Applicant |
| US6606606(B2) | 2003-08-01 | Starr | Applicant |
| US6609200(B2) | 2003-08-01 | Anderson et al. | Applicant |
| US6611822(B1) | 2003-08-01 | Beams et al. | Applicant |
| US6611840(B1) | 2003-08-01 | Baer et al. | Applicant |
| US6611843(B1) | 2003-08-01 | Jacobs | Applicant |
| US6613098(B1) | 2003-09-01 | Sorge et al. | Applicant |
| US6615276(B1) | 2003-09-01 | Mastrianni et al. | Applicant |
| US6629109(B1) | 2003-09-01 | Koshisaka | Examiner |
| US6631357(B1) | 2003-10-01 | Perkowski | Applicant |
| US6631379(B2) | 2003-10-01 | Cox | Applicant |
| US6631497(B1) | 2003-10-01 | Jamshidi et al. | Applicant |
| US6631519(B1) | 2003-10-01 | Nicholson et al. | Applicant |
| US6632251(B1) | 2003-10-01 | Rutten et al. | Applicant |
| US6635089(B1) | 2003-10-01 | Burkett et al. | Applicant |
| US6636845(B2) | 2003-10-01 | Chau et al. | Applicant |
| US6643633(B2) | 2003-11-01 | Chau et al. | Applicant |
| US6643652(B2) | 2003-11-01 | Helgeson et al. | Applicant |
| US6643684(B1) | 2003-11-01 | Malkin et al. | Applicant |
| US6651217(B1) | 2003-11-01 | Kennedy et al. | Applicant |
| US6654737(B1) | 2003-11-01 | Nunez | Examiner |
| US6654932(B1) | 2003-11-01 | Bahrs et al. | Applicant |
| US6658417(B1) | 2003-12-01 | Stakutis et al. | Examiner |
| US6658622(B1) | 2003-12-01 | Aiken et al. | Applicant |
| US6661920(B1) | 2003-12-01 | Skinner | Applicant |
| US6668369(B1) | 2003-12-01 | Krebs et al. | Applicant |
| US6671805(B1) | 2003-12-01 | Brown et al. | Applicant |
| US6678717(B1) | 2004-01-01 | Schneider | Applicant |
| US6681370(B2) | 2004-01-01 | Gounares et al. | Applicant |
| US6691230(B1) | 2004-02-01 | Bardon | Applicant |
| US6691281(B1) | 2004-02-01 | Sorge et al. | Applicant |
| US6697944(B1) | 2004-02-01 | Jones et al. | Applicant |
| US6701434(B1) | 2004-03-01 | Rohatgi | Applicant |
| US6701486(B1) | 2004-03-01 | Weber et al. | Applicant |
| US6704906(B1) | 2004-03-01 | Yankovich et al. | Applicant |
| US6711679(B1) | 2004-03-01 | Guski et al. | Applicant |
| US6720985(B1) | 2004-04-01 | Silverbrook et al. | Applicant |
| US6725426(B1) | 2004-04-01 | Pavlov | Applicant |
| US6728755(B1) | 2004-04-01 | de Ment | Applicant |
| US6735721(B1) | 2004-05-01 | Morrow et al. | Applicant |
| US6745367(B1) | 2004-06-01 | Bates et al. | Applicant |
| US6748385(B1) | 2004-06-01 | Rodkin et al. | Applicant |
| US6751777(B2) | 2004-06-01 | Bates et al. | Applicant |
| US6754874(B1) | 2004-06-01 | Richman | Applicant |
| US6757826(B1) | 2004-06-01 | Paltenghe | Applicant |
| US6757868(B1) | 2004-06-01 | Glaser et al. | Applicant |
| US6760723(B2) | 2004-07-01 | Oshinsky et al. | Examiner |
| US6763343(B1) | 2004-07-01 | Brooke et al. | Applicant |
| US6772139(B1) | 2004-08-01 | Smith, III | Applicant |
| US6772165(B2) | 2004-08-01 | O'Carroll | Applicant |
| US6774926(B1) | 2004-08-01 | Ellis et al. | Applicant |
| US6779154(B1) | 2004-08-01 | Nussbaum et al. | Applicant |
| US6781609(B1) | 2004-08-01 | Barker et al. | Applicant |
| US6782144(B2) | 2004-08-01 | Bellavita et al. | Applicant |
| US6799299(B1) | 2004-09-01 | Li et al. | Applicant |
| US6816849(B1) | 2004-11-01 | Halt, Jr. | Applicant |
| US6828992(B1) | 2004-12-01 | Freeman et al. | Applicant |
| US6845380(B2) | 2005-01-01 | Su et al. | Applicant |
| US6845499(B2) | 2005-01-01 | Srivastava et al. | Applicant |
| US6847387(B2) | 2005-01-01 | Roth | Applicant |
| US6848078(B1) | 2005-01-01 | Birsan et al. | Applicant |
| US6871220(B1) | 2005-03-01 | Rajan et al. | Applicant |
| US6874130(B1) | 2005-03-01 | Baweja et al. | Examiner |
| US6876996(B2) | 2005-04-01 | Czajkowski et al. | Applicant |
| US6889359(B1) | 2005-05-01 | Conner et al. | Applicant |
| US6901403(B1) | 2005-05-01 | Bata et al. | Applicant |
| US6915454(B1) | 2005-07-01 | Moore et al. | Applicant |
| US6931532(B1) | 2005-08-01 | Davis et al. | Applicant |
| US6941510(B1) | 2005-09-01 | Ozzie et al. | Applicant |
| US6941511(B1) | 2005-09-01 | Hind et al. | Applicant |
| US6941521(B2) | 2005-09-01 | Lin et al. | Applicant |
| US6948129(B1) | 2005-09-01 | Loghmani | Applicant |
| US6948133(B2) | 2005-09-01 | Haley | Applicant |
| US6948135(B1) | 2005-09-01 | Ruthfield et al. | Applicant |
| US6950980(B1) | 2005-09-01 | Malcolm | Applicant |
| US6961897(B1) | 2005-11-01 | Peel, Jr. et al. | Applicant |
| US6963875(B2) | 2005-11-01 | Moore et al. | Applicant |
| US6968503(B1) | 2005-11-01 | Chang et al. | Applicant |
| US6968505(B2) | 2005-11-01 | Stoll et al. | Applicant |
| US6993714(B2) | 2006-01-01 | Kaler et al. | Applicant |
| US6996776(B1) | 2006-02-01 | Makely et al. | Applicant |
| US6996781(B1) | 2006-02-01 | Myers et al. | Applicant |
| US7000179(B2) | 2006-02-01 | Yankovich et al. | Applicant |
| US7002560(B2) | 2006-02-01 | Graham | Applicant |
| US7003722(B2) | 2006-02-01 | Rothchiller et al. | Applicant |
| US7010580(B1) | 2006-03-01 | Fu et al. | Applicant |
| US7020869(B2) | 2006-03-01 | Abriari et al. | Applicant |
| US7024417(B1) | 2006-04-01 | Russakovsky et al. | Applicant |
| US7032170(B2) | 2006-04-01 | Poulose | Applicant |
| US7036072(B1) | 2006-04-01 | Sulistio et al. | Applicant |
| US7039875(B2) | 2006-05-01 | Khalfay et al. | Applicant |
| US7051273(B1) | 2006-05-01 | Holt et al. | Applicant |
| US7058663(B2) | 2006-06-01 | Johnston et al. | Applicant |
| US7062764(B2) | 2006-06-01 | Cohen et al. | Applicant |
| US7065493(B1) | 2006-06-01 | Homsi | Applicant |
| US7080083(B2) | 2006-07-01 | Kim et al. | Applicant |
| US7080325(B2) | 2006-07-01 | Treibach-Heck et al. | Applicant |
| US7086009(B2) | 2006-08-01 | Resnick et al. | Applicant |
| US7086042(B2) | 2006-08-01 | Abe et al. | Applicant |
| US7088374(B2) | 2006-08-01 | David et al. | Applicant |
| US7100147(B2) | 2006-08-01 | Miller et al. | Applicant |
| US7103611(B2) | 2006-09-01 | Murthy et al. | Applicant |
| US7106888(B1) | 2006-09-01 | Silverbrook et al. | Applicant |
| US7107282(B1) | 2006-09-01 | Yalamanchi | Applicant |
| US7107521(B2) | 2006-09-01 | Santos | Applicant |
| US7120863(B1) | 2006-10-01 | Wang | Applicant |
| US7130885(B2) | 2006-10-01 | Chandra et al. | Applicant |
| US7143341(B1) | 2006-11-01 | Kohli | Applicant |
| US7146564(B2) | 2006-12-01 | Kim et al. | Applicant |
| US7152205(B2) | 2006-12-01 | Day et al. | Applicant |
| US7168035(B1) | 2007-01-01 | Bell et al. | Applicant |
| US7178166(B1) | 2007-02-01 | Taylor et al. | Applicant |
| US7190376(B1) | 2007-03-01 | Tonisson | Applicant |
| US7191394(B1) | 2007-03-01 | Ardeleanu et al. | Applicant |
| US7213200(B2) | 2007-05-01 | Abe et al. | Applicant |
| US7236982(B2) | 2007-06-01 | Zlatanov et al. | Applicant |
| US7272789(B2) | 2007-09-01 | O'Brien | Applicant |
| US7281018(B1) | 2007-10-01 | Begun et al. | Applicant |
| US7296017(B2) | 2007-11-01 | Larcheveque et al. | Applicant |
| US7313758(B2) | 2007-12-01 | Kozlov | Applicant |
| US7316003(B1) | 2008-01-01 | Dulepet et al. | Applicant |
| US7318237(B2) | 2008-01-01 | Moriconi et al. | Applicant |
| US7334178(B1) | 2008-02-01 | Stanciu et al. | Applicant |
| US7346848(B1) | 2008-03-01 | Ruthfield et al. | Applicant |
| US2001/0007109(A1) | 2001-07-01 | Lange | Applicant |
| US2001/0022592(A1) | 2001-09-01 | Alimpich et al. | Applicant |
| US2001/0024195(A1) | 2001-09-01 | Hayakawa | Applicant |
| US2001/0037345(A1) | 2001-11-01 | Kieman et al. | Applicant |
| US2001/0054004(A1) | 2001-12-01 | Powers | Applicant |
| US2001/0056429(A1) | 2001-12-01 | Moore et al. | Applicant |
| US2001/0056460(A1) | 2001-12-01 | Sahota et al. | Applicant |
| US2002/0010700(A1) | 2002-01-01 | Wotring | Applicant |
| US2002/0010743(A1) | 2002-01-01 | Ryan et al. | Applicant |
| US2002/0010746(A1) | 2002-01-01 | Jilk, Jr. et al. | Applicant |
| US2002/0013788(A1) | 2002-01-01 | Pennell et al. | Applicant |
| US2002/0019941(A1) | 2002-02-01 | Chan et al. | Applicant |
| US2002/0023113(A1) | 2002-02-01 | Hsing et al. | Applicant |
| US2002/0026441(A1) | 2002-02-01 | Kutay et al. | Applicant |
| US2002/0026461(A1) | 2002-02-01 | Kutay et al. | Applicant |
| US2002/0032590(A1) | 2002-03-01 | Anand et al. | Applicant |
| US2002/0032692(A1) | 2002-03-01 | Suzuki et al. | Applicant |
| US2002/0032706(A1) | 2002-03-01 | Perla et al. | Applicant |
| US2002/0032768(A1) | 2002-03-01 | Voskuil | Applicant |
| US2002/0035579(A1) | 2002-03-01 | Wang et al. | Applicant |
| US2002/0035581(A1) | 2002-03-01 | Reynar et al. | Applicant |
| US2002/0040469(A1) | 2002-04-01 | Pramberger | Applicant |
| US2002/0054126(A1) | 2002-05-01 | Gamon | Applicant |
| US2002/0057297(A1) | 2002-05-01 | Grimes et al. | Applicant |
| US2002/0065798(A1) | 2002-05-01 | Bostleman et al. | Applicant |
| US2002/0065847(A1) | 2002-05-01 | Furukawa et al. | Applicant |
| US2002/0070973(A1) | 2002-06-01 | Croley | Applicant |
| US2002/0078074(A1) | 2002-06-01 | Cho et al. | Applicant |
| US2002/0078103(A1) | 2002-06-01 | Gorman et al. | Applicant |
| US2002/0083318(A1) | 2002-06-01 | Larose | Applicant |
| US2002/0099952(A1) | 2002-07-01 | Lambert et al. | Applicant |
| US2002/0100027(A1) | 2002-07-01 | Binding et al. | Applicant |
| US2002/0112224(A1) | 2002-08-01 | Cox | Applicant |
| US2002/0129056(A1) | 2002-09-01 | Conant | Applicant |
| US2002/0133484(A1) | 2002-09-01 | Chau et al. | Applicant |
| US2002/0152222(A1) | 2002-10-01 | Holbrook | Applicant |
| US2002/0152244(A1) | 2002-10-01 | Dean et al. | Applicant |
| US2002/0156772(A1) | 2002-10-01 | Chau et al. | Applicant |
| US2002/0156846(A1) | 2002-10-01 | Rawat et al. | Applicant |
| US2002/0156929(A1) | 2002-10-01 | Hekmatpour | Applicant |
| US2002/0169752(A1) | 2002-11-01 | Kusama et al. | Applicant |
| US2002/0169789(A1) | 2002-11-01 | Kutay et al. | Applicant |
| US2002/0174147(A1) | 2002-11-01 | Wang et al. | Applicant |
| US2002/0174417(A1) | 2002-11-01 | Sijacic et al. | Applicant |
| US2002/0178380(A1) | 2002-11-01 | Wolf et al. | Applicant |
| US2002/0184219(A1) | 2002-12-01 | Preisig et al. | Applicant |
| US2002/0188597(A1) | 2002-12-01 | Kern et al. | Applicant |
| US2002/0188613(A1) | 2002-12-01 | Chakraborty et al. | Applicant |
| US2002/0194219(A1) | 2002-12-01 | Bradley et al. | Applicant |
| US2002/0196281(A1) | 2002-12-01 | Audleman et al. | Applicant |
| US2002/0196288(A1) | 2002-12-01 | Emrani | Applicant |
| US2002/0198891(A1) | 2002-12-01 | Li et al. | Applicant |
| US2002/0198935(A1) | 2002-12-01 | Crandall et al. | Applicant |
| US2003/0004951(A1) | 2003-01-01 | Chokshi | Applicant |
| US2003/0007000(A1) | 2003-01-01 | Carlson et al. | Applicant |
| US2003/0014397(A1) | 2003-01-01 | Chau et al. | Applicant |
| US2003/0018668(A1) | 2003-01-01 | Britton et al. | Applicant |
| US2003/0020746(A1) | 2003-01-01 | Chen et al. | Applicant |
| US2003/0023641(A1) | 2003-01-01 | Gorman et al. | Applicant |
| US2003/0025732(A1) | 2003-02-01 | Prichard | Applicant |
| US2003/0026507(A1) | 2003-02-01 | Zlotnick | Applicant |
| US2003/0028550(A1) | 2003-02-01 | Lee et al. | Applicant |
| US2003/0037303(A1) | 2003-02-01 | Bodlaender et al. | Applicant |
| US2003/0043986(A1) | 2003-03-01 | Creamer et al. | Applicant |
| US2003/0046665(A1) | 2003-03-01 | Ilin | Applicant |
| US2003/0048301(A1) | 2003-03-01 | Menninger | Applicant |
| US2003/0051243(A1) | 2003-03-01 | Lemmons et al. | Applicant |
| US2003/0055811(A1) | 2003-03-01 | Stork et al. | Applicant |
| US2003/0055828(A1) | 2003-03-01 | Koch et al. | Applicant |
| US2003/0056198(A1) | 2003-03-01 | Al-Azzawe et al. | Applicant |
| US2003/0061386(A1) | 2003-03-01 | Brown et al. | Applicant |
| US2003/0061567(A1) | 2003-03-01 | Brown et al. | Applicant |
| US2003/0084424(A1) | 2003-05-01 | Reddy et al. | Applicant |
| US2003/0093755(A1) | 2003-05-01 | O'Carroll | Applicant |
| US2003/0110443(A1) | 2003-06-01 | Yankovich et al. | Applicant |
| US2003/0120578(A1) | 2003-06-01 | Newman | Applicant |
| US2003/0120651(A1) | 2003-06-01 | Bernstein et al. | Applicant |
| US2003/0120659(A1) | 2003-06-01 | Anandampilla | Applicant |
| US2003/0120671(A1) | 2003-06-01 | Kim et al. | Applicant |
| US2003/0120686(A1) | 2003-06-01 | Kim et al. | Applicant |
| US2003/0126555(A1) | 2003-07-01 | Aggarwal et al. | Applicant |
| US2003/0128196(A1) | 2003-07-01 | Lapstun et al. | Applicant |
| US2003/0135825(A1) | 2003-07-01 | Gertner et al. | Applicant |
| US2003/0140132(A1) | 2003-07-01 | Champagne et al. | Applicant |
| US2003/0142072(A1) | 2003-07-01 | Lapstun et al. | Applicant |
| US2003/0149934(A1) | 2003-08-01 | Worden | Applicant |
| US2003/0158897(A1) | 2003-08-01 | Ben-Natan et al. | Applicant |
| US2003/0163285(A1) | 2003-08-01 | Nakamura et al. | Applicant |
| US2003/0167277(A1) | 2003-09-01 | Hejlsberg et al. | Applicant |
| US2003/0182268(A1) | 2003-09-01 | Lal | Applicant |
| US2003/0182327(A1) | 2003-09-01 | Ramanujam et al. | Applicant |
| US2003/0187756(A1) | 2003-10-01 | Klivington et al. | Applicant |
| US2003/0187930(A1) | 2003-10-01 | Ghaffar et al. | Applicant |
| US2003/0188260(A1) | 2003-10-01 | Jensen et al. | Applicant |
| US2003/0189593(A1) | 2003-10-01 | Yarvin | Applicant |
| US2003/0192008(A1) | 2003-10-01 | Lee | Applicant |
| US2003/0200506(A1) | 2003-10-01 | Abe et al. | Applicant |
| US2003/0204511(A1) | 2003-10-01 | Brundage et al. | Applicant |
| US2003/0204814(A1) | 2003-10-01 | Elo et al. | Applicant |
| US2003/0205615(A1) | 2003-11-01 | Marappan | Applicant |
| US2003/0212664(A1) | 2003-11-01 | Brelning et al. | Applicant |
| US2003/0212902(A1) | 2003-11-01 | van der Made | Applicant |
| US2003/0217053(A1) | 2003-11-01 | Bachman et al. | Applicant |
| US2003/0220930(A1) | 2003-11-01 | Milleker et al. | Applicant |
| US2003/0225469(A1) | 2003-12-01 | DeRemer et al. | Applicant |
| US2003/0225768(A1) | 2003-12-01 | Chaudhuri et al. | Applicant |
| US2003/0225829(A1) | 2003-12-01 | Pena et al. | Applicant |
| US2003/0226132(A1) | 2003-12-01 | Tondreau et al. | Applicant |
| US2003/0233374(A1) | 2003-12-01 | Spinola et al. | Applicant |
| US2003/0236859(A1) | 2003-12-01 | Vaschillo et al. | Applicant |
| US2003/0237046(A1) | 2003-12-01 | Parker et al. | Applicant |
| US2003/0237047(A1) | 2003-12-01 | Borson | Applicant |
| US2004/0002939(A1) | 2004-01-01 | Arora et al. | Applicant |
| US2004/0003031(A1) | 2004-01-01 | Brown et al. | Applicant |
| US2004/0003353(A1) | 2004-01-01 | Rivera et al. | Applicant |
| US2004/0003389(A1) | 2004-01-01 | Reynar et al. | Examiner |
| US2004/0010752(A1) | 2004-01-01 | Chan et al. | Applicant |
| US2004/0024842(A1) | 2004-02-01 | Witt | Applicant |
| US2004/0030991(A1) | 2004-02-01 | Hepworth et al. | Applicant |
| US2004/0039990(A1) | 2004-02-01 | Bakar et al. | Applicant |
| US2004/0039993(A1) | 2004-02-01 | Kougiouris et al. | Applicant |
| US2004/0044961(A1) | 2004-03-01 | Pesenson | Applicant |
| US2004/0044965(A1) | 2004-03-01 | Toyama et al. | Applicant |
| US2004/0054966(A1) | 2004-03-01 | Busch et al. | Applicant |
| US2004/0059754(A1) | 2004-03-01 | Barghout et al. | Applicant |
| US2004/0073565(A1) | 2004-04-01 | Kaufman et al. | Applicant |
| US2004/0073868(A1) | 2004-04-01 | Easter et al. | Applicant |
| US2004/0078756(A1) | 2004-04-01 | Napper et al. | Applicant |
| US2004/0083426(A1) | 2004-04-01 | Sahu | Applicant |
| US2004/0088652(A1) | 2004-05-01 | Abe et al. | Applicant |
| US2004/0093596(A1) | 2004-05-01 | Koyano | Applicant |
| US2004/0107367(A1) | 2004-06-01 | Kisters | Applicant |
| US2004/0117769(A1) | 2004-06-01 | Lauzon et al. | Applicant |
| US2004/0123277(A1) | 2004-06-01 | Schrader et al. | Applicant |
| US2004/0146199(A1) | 2004-07-01 | Berkner et al. | Applicant |
| US2004/0163041(A1) | 2004-08-01 | Engel | Applicant |
| US2004/0172442(A1) | 2004-09-01 | Ripley | Applicant |
| US2004/0181711(A1) | 2004-09-01 | Johnson et al. | Applicant |
| US2004/0186762(A1) | 2004-09-01 | Beaven et al. | Applicant |
| US2004/0189716(A1) | 2004-09-01 | Paoli et al. | Applicant |
| US2004/0194035(A1) | 2004-09-01 | Chakraborty | Applicant |
| US2004/0205473(A1) | 2004-10-01 | Fisher et al. | Applicant |
| US2004/0205525(A1) | 2004-10-01 | Murren et al. | Applicant |
| US2004/0205534(A1) | 2004-10-01 | Koelle | Applicant |
| US2004/0205571(A1) | 2004-10-01 | Adler et al. | Applicant |
| US2004/0205592(A1) | 2004-10-01 | Huang | Applicant |
| US2004/0205605(A1) | 2004-10-01 | Adler et al. | Applicant |
| US2004/0205653(A1) | 2004-10-01 | Hadfield et al. | Applicant |
| US2004/0205671(A1) | 2004-10-01 | Sukehiro et al. | Applicant |
| US2004/0210599(A1) | 2004-10-01 | Friedman et al. | Applicant |
| US2004/0221238(A1) | 2004-11-01 | Cifra et al. | Applicant |
| US2004/0221245(A1) | 2004-11-01 | Chickles et al. | Applicant |
| US2004/0237030(A1) | 2004-11-01 | Malkin | Applicant |
| US2004/0261019(A1) | 2004-12-01 | Imamura et al. | Applicant |
| US2004/0268229(A1) | 2004-12-01 | Paoli et al. | Applicant |
| US2005/0004893(A1) | 2005-01-01 | Sangroniz | Applicant |
| US2005/0005248(A1) | 2005-01-01 | Rockey et al. | Applicant |
| US2005/0015279(A1) | 2005-01-01 | Rucker | Applicant |
| US2005/0015732(A1) | 2005-01-01 | Vedula et al. | Applicant |
| US2005/0022115(A1) | 2005-01-01 | Baumgartner et al. | Applicant |
| US2005/0027757(A1) | 2005-02-01 | Kiessig et al. | Applicant |
| US2005/0033728(A1) | 2005-02-01 | James | Applicant |
| US2005/0038711(A1) | 2005-02-01 | Marlelo | Applicant |
| US2005/0055627(A1) | 2005-03-01 | Lloyd et al. | Applicant |
| US2005/0060324(A1) | 2005-03-01 | Johnson et al. | Applicant |
| US2005/0060721(A1) | 2005-03-01 | Choudhary et al. | Applicant |
| US2005/0065933(A1) | 2005-03-01 | Goering | Applicant |
| US2005/0065936(A1) | 2005-03-01 | Goering | Applicant |
| US2005/0066287(A1) | 2005-03-01 | Tattrie et al. | Applicant |
| US2005/0071752(A1) | 2005-03-01 | Marlatt | Applicant |
| US2005/0076049(A1) | 2005-04-01 | Qubti et al. | Applicant |
| US2005/0091285(A1) | 2005-04-01 | Krishnan et al. | Applicant |
| US2005/0091305(A1) | 2005-04-01 | Lange et al. | Applicant |
| US2005/0102370(A1) | 2005-05-01 | Lin et al. | Examiner |
| US2005/0102612(A1) | 2005-05-01 | Allan et al. | Applicant |
| US2005/0108104(A1) | 2005-05-01 | Woo | Applicant |
| US2005/0108624(A1) | 2005-05-01 | Carrier | Applicant |
| US2005/0114757(A1) | 2005-05-01 | Sahota et al. | Applicant |
| US2005/0132196(A1) | 2005-06-01 | Dietl | Applicant |
| US2005/0138086(A1) | 2005-06-01 | Pecht-Seibert | Applicant |
| US2005/0138539(A1) | 2005-06-01 | Bravery et al. | Applicant |
| US2005/0171746(A1) | 2005-08-01 | Thalhammer-Reyero | Applicant |
| US2005/0198086(A1) | 2005-09-01 | Moore et al. | Applicant |
| US2005/0198125(A1) | 2005-09-01 | Beck et al. | Applicant |
| US2005/0198247(A1) | 2005-09-01 | Perry et al. | Applicant |
| US2005/0210263(A1) | 2005-09-01 | Levas et al. | Applicant |
| US2005/0223063(A1) | 2005-10-01 | Chang et al. | Applicant |
| US2005/0223320(A1) | 2005-10-01 | Brintzenhofe et al. | Applicant |
| US2005/0246304(A1) | 2005-11-01 | Knight et al. | Applicant |
| US2005/0268222(A1) | 2005-12-01 | Cheng | Applicant |
| US2006/0020586(A1) | 2006-01-01 | Prompt et al. | Applicant |
| US2006/0026534(A1) | 2006-02-01 | Ruthfield et al. | Applicant |
| US2006/0031757(A9) | 2006-02-01 | Vincent, III | Applicant |
| US2006/0036995(A1) | 2006-02-01 | Chickles et al. | Applicant |
| US2006/0041838(A1) | 2006-02-01 | Khan | Applicant |
| US2006/0059107(A1) | 2006-03-01 | Elmore et al. | Applicant |
| US2006/0059434(A1) | 2006-03-01 | Boss et al. | Applicant |
| US2006/0069605(A1) | 2006-03-01 | Hatoun | Applicant |
| US2006/0069985(A1) | 2006-03-01 | Friedman et al. | Applicant |
| US2006/0080657(A1) | 2006-04-01 | Goodman | Applicant |
| US2006/0085409(A1) | 2006-04-01 | Rys et al. | Applicant |
| US2006/0101037(A1) | 2006-05-01 | Brill et al. | Applicant |
| US2006/0101051(A1) | 2006-05-01 | Carr et al. | Applicant |
| US2006/0129978(A1) | 2006-06-01 | Abriani et al. | Applicant |
| US2006/0143220(A1) | 2006-06-01 | Spencer, Jr. | Applicant |
| US2006/0161559(A1) | 2006-07-01 | Bordawekar et al. | Applicant |
| US2006/0200754(A1) | 2006-09-01 | Kablesh et al. | Applicant |
| US2007/0036433(A1) | 2007-02-01 | Teutsch | Applicant |
| US2007/0050719(A1) | 2007-03-01 | Lui et al. | Applicant |
| US2007/0061467(A1) | 2007-03-01 | Essey | Applicant |
| US2007/0061706(A1) | 2007-03-01 | Cupala | Applicant |
| US2007/0074106(A1) | 2007-03-01 | Ardeleanu | Applicant |
| US2007/0094589(A1) | 2007-04-01 | Paoli | Applicant |
| US2007/0100877(A1) | 2007-05-01 | Paoli | Applicant |
| US2007/0101280(A1) | 2007-05-01 | Paoli | Applicant |
| US2007/0118803(A1) | 2007-05-01 | Walker et al. | Applicant |
| US2007/0130504(A1) | 2007-06-01 | Betancourt et al. | Applicant |
| US2007/0186157(A1) | 2007-08-01 | Walker et al. | Applicant |
| US2007/0208606(A1) | 2007-09-01 | MacKay et al. | Applicant |
| US2007/0208769(A1) | 2007-09-01 | Boehm et al. | Applicant |
| US2008/0028340(A1) | 2008-01-01 | Davis | Applicant |
| EP1221661 | 2002-07-01 | Applicant | |
| WO157720 | 2001-08-01 | Applicant | |
| WO-WO0157720 | 2006-09-01 | Applicant |
Non-Patent Literature (44)
- “Microsoft Word 2000 Screenshots”, (2000), 11-17.Applicant
- XmlSpy, “XmlSpy 2004 Enterprise Edition Manual”, Altova,(May 17, 2004),1-25, 220-225.Applicant
- StylusStudio, “StylusStudio: XPath Tools”, 2004-2007, StylusStudio, 1-14.Applicant
- Dodds, “Toward an XPath API”, xml.com,(May 7, 2001), 1-3.Applicant
- Altova, “Altova Tools for XPath 1.0/2.0”, Altova, 1-12.Applicant
- “Microsoft Word 2000 Screenshots”, Word,(2000), 1-17.Applicant
- Grosso, et al., “XML Fragment Interchange”, W3C,(Feb. 2001), 1-28.Applicant
- Altova, et al., “User and Reference Manual Version 4.4”, www.xmlspy.com, (May 24, 2007), 1-565.Applicant
- “XForm 1.0”, W3C,(Jul. 16, 2001).Applicant
- Hu, et al., “A Programmable Editor for Developing Structured Documents based on Bidirectional Transformations”, ACM,(Aug. 2004), 178-179.Applicant
- Bradley, Neil “The XML Companion, Third Edition”, Published by Addison Wesley Professional, http://proquest.safaribooksonline.com0201770598, http,(Dec. 12, 2001), 1-18.Applicant
- Klarlund, Nils “DSD: A Schema Language for XML”, ACM, FSMP Portland Oregon, (2000), 101-111.Applicant
- Watt, Andrew “MIcrosoft Office Infopath 2003 Kick Start”, (Published by Sams) Print ISBN-10:0-672-32623-X, (Mar. 24, 2004), 1-57.Applicant
- Cover, XML Forms Architecture, retrieved at << http://xml.coverpages.org/xfa.html>> on Aug. 17, 2006, Coverpages, Jun. 16, 1999.Applicant
- Raggett, “HTML Tables”, retrieved on Aug. 6, 2006, at <<http:www://is-edu.homuns.edu.vn/WebLib/books/Web/Tel/html3-tables.html>>, W3C Internet Draft, Jul. 7, 1995, pp. 1-12.Applicant
- Ben-Natan, U.S. Appl. No. 60/203,081, filed May 9, 2000, entitled “Internet platform for creating and supporting communities.”Applicant
- Kutay, U.S. Appl. No. 60/209,713 filed Jun. 5, 2000, entitled, “Methods and systems for accessing, organizing presenting and viewing data.”Applicant
- Moore, U.S. Appl. No. 60/191,662 filed Mar. 23, 2000, entitled “Collection-based presistent digital archives.”Applicant
- “Webopedia Computer Dictionary” retrieved on May 9, 2006, at <<http://www.pewebopedia.com/TERM/O/OLE.html>>, Jupitermedia Corporation, 2006, pp. 07.Applicant
- Baraband et al., PowerForms: “Declarative Client Site Form Field Validation”, World Wide Web, Baltzer Science Publishers, Bussum, NL. vol. 3, No. 4, Dec. 2000, p. 1-20.Applicant
- Altova, Inc., “XML Spy 4.0 Manual,” Altova Inc. & Altova GmbH, coyright 1998-2001, Chapters 1, 2, and 6, encompassing pp. 1-17, 18-90, and 343-362.Applicant
- Cybook, Inc.: “Copying the Search Form to Services-based Web Sites” INternet Article, (online) Jul. 26, 2004. *the whole document*.Applicant
- Excel Developer Tip (hereinafter “Excel”), “Determining the Data Type of a Cell”, May 13, 1998, p. 1 (available at http://jwalk.com/ss//excel/tips/tip62.htm).Applicant
- Rado, Dave: “How to create a template that makes it easy for users to ‘fill in the blanks’, without doing any programming” Microsoft Word MVP FAQ Site, (online) Apr. 30, 2004, the whole document.Applicant
- “Enter Key”, Retrieved from the Internet at http://systems.webopedia.com/TERM/Enter—key.html on Dec. 20, 2006.Applicant
- “Microsoft Visual Basic 5.0 Programmer's Guide”, Microsoft Press, (1997),pp. 42-43, 54-58.Applicant
- “Microsoft Word 2000”, Screenshots,(1999), 1-5.Applicant
- Beauchemin, Dave , “Using InfoPath to Create Smart Forms”, Retrieved from the Internet at http:/www.microsoft.com/office/infopath/prodinfo/using.mspx on Jan. 21, 2007,(Mar. 27, 2003).Applicant
- Begun, Andrew , et al., “Support and Troubleshooting for XML Schemas in InfoPath 2003”, Microsoft Office InfoPath 2003 Technical Articles, Retrieved from the Internet at http://msdn2.microsoft.com/en-us/library/aa168241(office.11,d=printer).aspx on Jan. 21, 2007,(Aug. 2004).Applicant
- Borland, Russo , “Running Microsoft Word 97”, 314-315, 338, 361-362, 390, and 714-719.Applicant
- Brabrand, et al., “Power Forms Declarative Client-side Form Field Validation”, (2002), 1-20.Applicant
- Dubinko, Micah , “XForms and Microsoft InfoPath”, Retrieved from the Internet at http://www.xml.com/lpt/a/1311 on Jan. 21, 2007,(Oct. 29, 2003).Applicant
- Hoffman, Michael , “Architecture of Microsoft Office InfoPath 2003”, Microsoft Office InfoPath 2003 Technical Articles, Retrieved from the Internet at http://msdn2.microsoft.com/en-us/library/aa219024(office.11,d=printer).aspx on Jan. 21, 2007,(Jun. 2003).Applicant
- Lehtonen, Miro , et al., “A Dynamic User Interface for Document Assembly”, Department of Computer Science, University of Helsinki,(Nov. 2002).Applicant
- Nelson, Joe , “Client-side Form Validation Using JavaScript”, Developer Advisory, (Sep. 21, 2001).Applicant
- Raman, T. V., et al., “XForms 1.0”, (Dec. 2001),Section 1-12.2.3 & Appendices A-G.Applicant
- Rees, Michael J., “Evolving the Browser Towards a Standard User Interface Architecture”, School of Information Technology, Bond University, Australia,(2001).Applicant
- Singh, Darshan , “Microsoft InfoPath 2003 By Example”, Retrieved from the Internet at http://www.perfectxml.com/InfoPath.asp on Jan. 21, 2007,(Apr. 20, 2003).Applicant
- Udell, Jon , “InfoPath and XForms”, Retrieved from the Internet at http://weblog.infoworld.com/udell/2003/02/26.html,(Feb. 26, 2003).Applicant
- Anat, Eyal et al., “Integrating and Customizing Hererogeneous E-Commerce Applications”, The VLDB Journal-The International Journal on Very Large Data Bases, vol. 10, Issue 1,(Aug. 2001),16-38.Applicant
- Adams, Susie et al., “BizTalk Unleashed”, Sams publishing, 2002, first printing Mar. 2001,1-2, 31-138.Applicant
- Vasters, Clemens F., “BizTalk Server 2000 A Beginner's Guide”, Osborne/McGraw-Hill,(2001),1-2, 359-402.Applicant
- Halberg, Bruce et al., “Using Microsoft Excel 97”, (1997),191-201, 213-219.Applicant
- Villard, et al., “An Incremental XSLT Transformation Processor for XML Document Manipulation”, http://www2002.org/CDROM/refereed/321, Printed on May 18, 2007,(May 2002),25 pages.Applicant