Installing a solution

Information

  • Patent Grant
  • 7925621
  • Patent Number
    7,925,621
  • Date Filed
    Tuesday, January 29, 2008
    16 years ago
  • Date Issued
    Tuesday, April 12, 2011
    13 years ago
Abstract
Tool(s) enabling installation of a solution are described. These tool(s) may follow 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. These tool(s) determine what level of security is appropriate for a data file's solution based on the original source of the solution. The tool(s) may also and/or instead enable a user to edit a data file without the user having to discover or deploy a solution application governing the data file.
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. 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.


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.


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.


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.


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.


For these reasons, editing data files offline can be inconvenient and dangerous.


SUMMARY

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.


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


FIG. 1 illustrates a communications network and a system capable of implementing a method for offline editing of data files.



FIG. 2 illustrates an exemplary electronic form whereby a user can edit a data file.



FIG. 3 is a flow diagram of an exemplary process for editing of data files while online or offline.



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.



FIG. 5 is a block diagram of a computer system that is capable of supporting secure online and offline editing of data files.





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


DETAILED DESCRIPTION

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


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.


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.


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.


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.


Exemplary Architecture



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.


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, a 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.


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.


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.


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.



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.


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.


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.


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.


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.


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.


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.


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


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.


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.


Techniques for Silent Discovery and Deployment of Data File Solutions


Overview



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


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.


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.


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.


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.


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


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.


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.


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


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.


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


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.


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


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


The system 102 installs the solution 124 silently in that the user does not need to know 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.


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.


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.


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.


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


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.


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


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.


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.


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.


Techniques for Secure Deployment of Data File Solutions



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.


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.


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.


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.


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.


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.


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.


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.


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.


A Computer System



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.


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.


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.


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.


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.


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.


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 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
  • 1. A method implemented at least in part by a computer comprising: determining a solution's origin;determining security precautions for executing the solution based on the solution's origin; andsilently installing the solution from a source other than the solution's origin within a sandbox enforcing the security precautions.
  • 2. The method of claim 1, wherein determining the solution's origin includes reading a solution identifier from a data file governed by the solution.
  • 3. The method of claim 2, wherein the solution identifier is read from a processing instruction.
  • 4. The method of claim 2, wherein the solution identifier is a URL or a URN.
  • 5. The method of claim 1, wherein determining security precautions based on the solution's origin includes a high level of security precautions when the solution's origin is a remote server accessed through a global internet.
  • 6. The method of claim 1, wherein determining security precautions based on the solution's origin includes a low level of security precautions when the solution's origin is a locally-accessible memory source.
  • 7. The method of claim 1, wherein determining security precautions based on the solution's origin includes a moderate level of security precautions when the solution's origin is a remote server accessed through an intranet.
  • 8. The method of claim 1, wherein the source other than the solution's origin is a local memory source.
  • 9. The method of claim 1, wherein the method is performed without user interaction.
  • 10. A method implemented at least in part by a computer comprising: receiving input to open a data file having a solution;discovering, without user interaction, the solution in an offline memory source;deploying, without user interaction, the solution; andopening the data file.
  • 11. The method of claim 10, wherein the deploying is within a sandbox enforcing security precautions, the security precautions determined based on the origin of the solution.
  • 12. The method of claim 10, 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.
  • 13. A method implemented at least in part by a computer comprising: receiving input to open a data file having a solution;discovering, without user interaction, the solution in an offline memory source;deploying, without user interaction, the solution;opening the data file effective to enable a user to edit the data file; andprior to receiving the input to open the data file:downloading the solution from an online memory source into the offline memory source.
  • 14. The method of claim 13 further comprising, prior to deploying the solution: updating the solution discovered in the offline memory source with a newer solution.
  • 15. The method of claim 13, wherein the data file is written in XML.
  • 16. The method of claim 15, wherein the solution includes a presentation application written in XSLT.
  • 17. The method of claim 15, wherein opening the data file is performed with the solution and produces an electronic form written in XHTML.
  • 18. The method of claim 13, wherein the act of deploying the solution deploys the solution within a sandbox providing security based on the solution's origin.
  • 19. The method of claim 13, wherein the act of opening the data file effective to enable the user to edit the data file comprises receiving information entered into an electronic form representation of the data file and altering the data file to reflect the information entered into the electronic form.
  • 20. The method of claim 13, wherein the acts of deploying the solution and opening the data file are effective to display an electronic form representing a product of the solution and the data file.
RELATED APPLICATION

This application is a continuation of and claims priority to U.S. patent application Ser. No. 10/395,490, U.S. Pat. No. 7,380,066 filed on Mar. 24, 2003, the disclosure of which is incorporated by reference herein.

US Referenced Citations (1020)
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 McNabney 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
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
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
5257646 Meyer Nov 1993 A
5274803 Dubin et al. Dec 1993 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
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
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
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
5540558 Harden et al. Jul 1996 A
5542070 LeBlanc et al. Jul 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
5640544 Onodera et al. Jun 1997 A
5644738 Goldman et al. 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
5721824 Taylor Feb 1998 A
5740439 Atkinson et al. Apr 1998 A
5742504 Meyer et al. 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
5798757 Smith Aug 1998 A
5799311 Agrawal et al. Aug 1998 A
5801701 Koppolu et al. Sep 1998 A
5802304 Stone Sep 1998 A
5803715 Kitchener Sep 1998 A
5806079 Rivette et al. Sep 1998 A
5815830 Anthony Sep 1998 A
5819034 Joseph 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
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
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 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
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
6163772 Kramer et al. Dec 2000 A
6167521 Smith et al. Dec 2000 A
6167523 Strong Dec 2000 A
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
6251273 Jawurek 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
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
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
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 Jul 2002 B1
6425125 Fries 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
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
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
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
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
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
6678717 Schneider Jan 2004 B1
6681370 Lawrence 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
6711679 Guski et al. Mar 2004 B1
6720985 Lapstun 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
6745367 Bates et al. Jun 2004 B1
6748385 Rodkin 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
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
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
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
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
7143341 Kohli Nov 2006 B1
7146564 Kim 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
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
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
7287218 Knotz et al. Oct 2007 B1
7296017 Larcheveque et al. Nov 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
7334187 Stanciu 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
7516399 Hsu et al. Apr 2009 B2
7533268 Catorcini May 2009 B1
7543228 Kelkar et al. Jun 2009 B2
7549115 Kotler et al. 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
7669116 Lopata et al. Feb 2010 B2
7673227 Kotler et al. Mar 2010 B2
7673228 Kelkar et al. Mar 2010 B2
7676843 Stott et al. Mar 2010 B1
7689929 Ruthfield et al. Mar 2010 B2
7692636 Kim et al. Apr 2010 B2
7712022 Smuga et al. May 2010 B2
7712048 Rockey et al. May 2010 B2
7721190 Sikchi May 2010 B2
7725834 Bell et al. May 2010 B2
7739602 Feng et al. Jun 2010 B2
7743063 James et al. Jun 2010 B2
7774620 Stott et al. 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
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
20010051907 Kumar et al. Dec 2001 A1
20010051928 Brody 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
20020054126 Gamon May 2002 A1
20020054128 Lau et al. May 2002 A1
20020057297 Grimes et al. May 2002 A1
20020065798 Bostleman et al. May 2002 A1
20020065847 Furukawa 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
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
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
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
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 Llin 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
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
20030093755 O'Carroll May 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 Lal 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
20030200506 Abe et al. Oct 2003 A1
20030204481 Lau Oct 2003 A1
20030204511 Brundage et al. Oct 2003 A1
20030204814 Elo et al. Oct 2003 A1
20030205615 Marappan 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 et al. 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
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
20040088647 Miller et al. May 2004 A1
20040088652 Abe et al. May 2004 A1
20040093296 Phelan et al. May 2004 A1
20040093596 Colvin 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
20040216084 Brown et al. Oct 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
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 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
20050240876 Myers et al. Oct 2005 A1
20050246304 Knight 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 Khan et al. Dec 2005 A1
20050289468 Kahn et al. Dec 2005 A1
20060004703 Spivack et al. Jan 2006 A1
20060010386 Khan Jan 2006 A1
20060020586 Prompt 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
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
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 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
20060288011 Gandhi et al. Dec 2006 A1
20060288329 Gandhi Dec 2006 A1
20070005611 Takasugi et al. 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 et al. Mar 2007 A1
20070061706 Cupala Mar 2007 A1
20070074106 Ardeleanu et al. Mar 2007 A1
20070088554 Harb et al. Apr 2007 A1
20070094589 Paoli et al. Apr 2007 A1
20070100836 Eichstaedt et al. May 2007 A1
20070100877 Paoli et al. May 2007 A1
20070101280 Paoli et al. 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 et al. Jun 2008 A1
20080162498 Omoigui Jul 2008 A1
20080195483 Moora Aug 2008 A1
20080222514 Rivers-Moore Sep 2008 A1
20090013266 Gandhi Jan 2009 A1
20090019063 Gandhi Jan 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 et al. Jul 2009 A1
20100125788 Hieronymus et al. May 2010 A1
20100229110 Rockey et al. Sep 2010 A1
Foreign Referenced Citations (28)
Number Date Country
1536483 Oct 2004 CN
0841615 May 1998 EP
0961197 Dec 1999 EP
1076290 Feb 2001 EP
1221661 Jul 2002 EP
1997023 Dec 2008 EP
63085960 Apr 1988 JP
401173140 Jul 1989 JP
3191429 Aug 1991 JP
4225466 Aug 1992 JP
5314152 Nov 1993 JP
406014105 Jan 1994 JP
6139241 May 1994 JP
6180697 Jun 1994 JP
6180698 Jun 1994 JP
10171662 Jun 1998 JP
10-2207805 Aug 1998 JP
10207805 Aug 1998 JP
2000132436 May 2000 JP
2002183652 Jun 2002 JP
2003173288 Jun 2003 JP
2008547117 Dec 2008 JP
WO-9924945 May 1999 WO
WO-9956207 Nov 1999 WO
WO-0126018 Apr 2001 WO
WO-0144934 Jun 2001 WO
WO0157720 Aug 2001 WO
WO-2005089336 Sep 2005 WO
Related Publications (1)
Number Date Country
20080189335 A1 Aug 2008 US
Continuations (1)
Number Date Country
Parent 10395490 Mar 2003 US
Child 12021894 US