US 7,689,929 B2Grant
Methods and systems of providing information to computer users
Issue Date:2010-03-30
•19 Claims
•12 Drawing Sheets
Abstract
Methods and systems of providing information to computer users are described. In one embodiment, multiple different algorithms are displayed for a user to select. The algorithms are configured to display quick links to which a user can navigate. Individual algorithms are employable across different content types. A user can select an individual algorithm and, responsively, the methods and systems can display one or more quick links that are provided by the selected algorithm.
Metadata
Assignee
- Microsoft Corporation
Inventors
- Scott L. Ruthfield
- Richard Banks
Application Information
Application Number:US 11/056,500
Filing Date:2005-02-11
Priority Date:2000-06-21
Art Unit:2174
Classifications
IPC:
G06F3/00
Patent Drawings (12 sheets)
Description
Related Applications
[0001] This application is a continuation of and claims priority to U.S. patent application Ser. No. 09/599,806, filed on Jun. 21, 2000, the disclosure of which is incorporated by reference herein.
[0002] The following patent applications are related to the present application, are assigned to the assignee of this patent application, and are expressly incorporated by reference herein: U.S. patent application Ser. No. 09/599,298, entitled “Single Window Navigation Methods and Systems”; U.S. patent application Ser. No. 09/599,299, entitled “Methods, Systems, Architectures and Data Structures For Delivering Software via a Network”; U.S. patent application Ser. No. 09/599,048, entitled “Network-based Software Extensions”; U.S. patent application Ser. No. 09/599,813, entitled “Authoring Arbitrary XML Documents using DHTML and XSLT”; U.S. patent application Ser. No. 09/599,812, entitled “Architectures For And Methods Of Providing Network-based Software Extensions”; and U.S. patent application Ser. No. 09/599,086, entitled “Task Sensitive Methods And Systems For Displaying Command Sets”.
Technical Field
[0003] This invention pertains to computerized methods and systems for providing information to computer users. More particularly, the invention concerns methods and systems for providing links to user-specific information.
Background
[0004] As computing evolves, there is a growing demand to make the user's computing experience much more user-centric, or tailored to the particular user. Consider, for example, web browsers. Web browsers are application programs that execute on a user's computer and enable a user to navigate the web and search for content, typically in the form of web pages that are displayed on their computer. To make the user's web browsing experience more user-centric, most web browsers include what is known as a “add favorite” function in which a user can add particular web sites to a “favorites” list. When a user adds a web site or web page to their favorites list (in the form of a link), they physically create an entry in a database that maintains a URL (i.e. universal resource locator) associated with the web site or page. Anytime a user wishes to return to one of these web sites or pages, they simply pull up their “favorites” list, click on the appropriate link, and their web browser obtains and displays a web page that corresponds to the link.
[0005] Another way that web browsers attempt to create a user-centric experience is by keeping track of a very limited amount of so-called “history data” pertaining to the user's historical browsing activities. History data might include the last three web sites that were browsed by the user. The user can typically view this information by clicking on a feature that provides a drop down menu that lists links to the browsed sites. For example, on the web browser's navigation bar, there is typically a “back” and “forward” button that can be clicked by the user to navigate backward or forward among entries that are maintained in a navigation stack that keeps track of the user's browsing activities. The “back” and “forward” buttons can also have drop down menus associated with them that enable the user to display a drop down menu that might include links for the last three sites that the user encountered. By selecting one of these links, the user's browser displays the corresponding web page.
[0006] While these solutions provide a very basic user-centric functionality, they fall far short of providing a versatile, intelligently flexible and dynamic system. For example, many of these systems require the user to initiate or take some action in order for particular links to appear (i.e. the user necessarily must add a link to their favorites list). In addition, many of these systems are unintelligent in the way that they present information or links to the user. For example, a favorites list may have a large number of links that have been added by the user. When a user attempts to find a link to a favorite web site, their browser will typically present them with all of the links that are in their favorites list. It is then up to the user to find the appropriate link so that they can select it.
[0007] Another challenge in the general area of information use is that which is posed by the move toward context-aware computing systems. Context-aware computing systems are those systems that provide services to a user based upon their context. In the future, information processing systems are going to have to be sensitive to the user's desire to accomplish tasks in context-aware systems. For example, it may be desirable to provide services to a user without requiring the user to change their context in order to consume the services. As an example, consider the following scenario. A user is working in a word processing application on a particular document of interest. The document is provided by an application program that is executing on the user's computer and that displays the document in a window that is defined by the program. Consider now that the user receives four or five email messages during the course of working on the document. In order to view indicia of these email messages (i.e. the “From” and “Subject” fields), in today's computing environment, the user is typically required to pull up their email application program which separately displays a different window that includes the indicia that the user wishes to view. This is a “modal” operation in that the user is required to temporarily quit working on their document in the word processing application program so that they can view information provided by the email application program. Thus, the user is undesirably required to change their context.
[0008] This invention arose out of concerns associated with improving methods and systems that provide information to computer users.
Summary
[0009] Methods and systems of providing information to computer users are described. In one embodiment, multiple different algorithms are displayed for a user to select. The algorithms are configured to display quick links to which a user can navigate. Individual algorithms are employable across different content types. A user can select an individual algorithm and, responsively, the methods and systems can display one or more quick links that are provided by the selected algorithm.
Brief Description of the Drawings
[0010] FIG. 1 is a block diagram of an exemplary computer system that can be used to implement various described embodiments.
[0011] FIG. 2 is a diagram of an exemplary user interface that can be provided in accordance with one described embodiment.
[0012] FIG. 3 is a flow diagram that describes steps in a method in accordance with one described embodiment.
[0013] FIG. 4 is a diagram of an exemplary user interface in accordance with one specific implementation.
[0014] FIG. 5 is a diagram of an exemplary user interface in accordance with one specific implementation.
[0015] FIG. 6 is a diagram of an exemplary user interface in accordance with one specific implementation.
[0016] FIG. 7 is a flow diagram that describes steps in a method in accordance with one described embodiment.
[0017] FIG. 8 is a diagram of an exemplary user favorites interface.
[0018] FIG. 9 is a flow diagram that describes steps in a method in accordance with one described embodiment.
[0019] FIG. 10 is a diagram that describes a portion of a database in accordance with one described embodiment.
[0020] FIG. 11 is a flow diagram that describes steps in a method in accordance with one described embodiment.
[0021] FIG. 12 is a flow diagram that describes steps in a method in accordance with one described embodiment.
[0022] FIG. 13 is a diagram that illustrates the concept of a “Recent Items List.”
[0023] FIG. 14 is a diagram that illustrates an exemplary implementation of the “Recent Items List.”
Detailed Description
[0024] Overview
[0025] In various embodiments described just below, novel methods and systems provide so-called browsable “quick links” to user-related data. The quick links can be advantageously deployed in a manner in which the user can browse the quick links without having to change or modify their current computing context. The quick links can be provided across multiple different content types, e.g. document types. Thus, a user can, in some instances, view quick links associated with different content types without having to change their current computing context, i.e. without having to change a document of a particular content type in which they happen to be working.
[0026] In one particularly advantageous embodiment, multiple different functionalities can be provided by a single application program. The multiple different functionalities enable a user to accomplish multiple different tasks within the context of a single application program. This single application program might, for example, provide multiple document-centric functionalities, e.g. an email functionality, word processing functionality, and web browser functionality. In this example, a user working within the web browser functionality can view quick links associated with the email functionality without having to change their web browsing context. A user is then able to select a link to automatically navigate to a particular document that is associated with that link.
[0027] Another aspect of some of the described embodiments includes an ability to build the quick links using dynamically-changing information that is not necessarily information that is demanded by the user. That is, in many systems, information will be received that pertains to a particular user. For example, in a single application program that includes an email functionality, a user may, over the course of browsing web sites, receive one or more email messages. These email messages constitute dynamically-changing information which, in this example, is not related to any actions that the user is taking. Nonetheless, quick links to the email messages can be advantageously displayed for the user while they are in the context of their web browsing activities.
[0028] Other embodiments provide intelligent browsing algorithms that are directed to displaying quick links that are very likely to be of interest to a user. These intelligent browsing algorithms can be advantageously deployed in connection with multiple content-type systems so that the algorithms are adaptable to and address the different content types.
[0029] Thus, the described embodiments provide very powerful methods and systems that greatly enhance the user's computing experience by, among other things, specifically tailoring the user's computing experience to their particular context. Flexibility is enhanced by providing, in some instances, systems that are configured to work within a context-sensitive computing environment that contains multiple different functionalities that are selectable for use by a user.
[0030] Exemplary Computer System
[0031] FIG. 1 shows an exemplary computer system that can be used to implement the embodiments described herein. Other computer systems can, however, be used. Computer 130 includes one or more processors or processing units 132, a system memory 134, and a bus 136 that couples various system components including the system memory 134 to processors 132. The bus 136 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 134 includes read only memory (ROM) 138 and random access memory (RAM) 140. A basic input/output system (BIOS) 142, containing the basic routines that help to transfer information between elements within computer 130, such as during start-up, is stored in ROM 138.
[0032] Computer 130 further includes a hard disk drive 144 for reading from and writing to a hard disk (not shown), a magnetic disk drive 146 for reading from and writing to a removable magnetic disk 148, and an optical disk drive 150 for reading from or writing to a removable optical disk 152 such as a CD ROM or other optical media. The hard disk drive 144, magnetic disk drive 146, and optical disk drive 150 are connected to the bus 136 by an SCSI interface 154 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 130. Although the exemplary environment described herein employs a hard disk, a removable magnetic disk 148 and a removable optical disk 152, 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.
[0033] A number of program modules may be stored on the hard disk 144, magnetic disk 148, optical disk 152, ROM 138, or RAM 140, including an operating system 158, one or more application programs 160, other program modules 162, and program data 164. A user may enter commands and information into computer 130 through input devices such as a keyboard 166 and a pointing device 168. 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 132 through an interface 170 that is coupled to the bus 136. A monitor 172 or other type of display device is also connected to the bus 136 via an interface, such as a video adapter 174. In addition to the monitor, personal computers typically include other peripheral output devices (not shown) such as speakers and printers.
[0034] Computer 130 commonly operates in a networked environment using logical connections to one or more remote computers, such as a remote computer 176. The remote computer 176 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 130, although only a memory storage device 178 has been illustrated in FIG. 1 . The logical connections depicted in FIG. 1 include a local area network (LAN) 180 and a wide area network (WAN) 182. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets, and the Internet.
[0035] When used in a LAN networking environment, computer 130 is connected to the local network 180 through a network interface or adapter 184. When used in a WAN networking environment, computer 130 typically includes a modem 186 or other means for establishing communications over the wide area network 182, such as the Internet. The modem 186, which may be internal or external, is connected to the bus 136 via a serial port interface 156. In a networked environment, program modules depicted relative to the personal computer 130, 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.
[0036] Generally, the data processors of computer 130 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 steps 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 below.
[0037] 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.
[0038] Viewable Links Across Multiple Content Types
[0039] In one embodiment, software provides various quick links that are viewable by a user without changing their current computing context. The quick links can advantageously pertain to another context that is different from a context in which the user is currently computing. For purposes of this document, a “context” can be considered as a functionality that enables a user to complete a particular computing task. Exemplary contexts include, without limitation, word processing contexts, browsing contexts, email contexts and the like. Thus, while a user is in one particular context, they have the ability to view quick links that pertain to another different context without changing their current computing context.
[0040] As an example, consider the following. A user is currently working on a document in a word processor. During the course of working on the document, the user receives an email message from a friend. In the past, the user would have to temporarily stop their current computing context, e.g. by exiting or pausing a word processing window, and pulling up an email window to view indicia of the email message (i.e. the “From” and “Subject” fields). In accordance with this example, a user can view quick link that are associated with the different context without changing their current context. In this specific case, the user can view links that are associated with the email message (e.g. the “From” and “Subject” fields) without exiting the word processing window or changing their word processing context.
[0041] FIG. 2 shows but one exemplary user interface 200 that can be provided in accordance with this example. The user interface is implemented in software that is executable on a user's computing device, e.g. a personal computer, although any computing device can suffice. Interface 200 includes, in this example, a tool bar 202 and a display area 204. Display area 204 can be used by the user to engage in tasks associated with a first context and, in this example, is designated “First Contextual Display.” Exemplary tasks can be any suitable tasks in which a computer can engage. Exemplary non-limiting tasks were mentioned above. Tool bar 202 includes, in this example, user-engagable indicia 206 that can enable a user to view quick links that are associated with one or more contexts that are different from the first context and each other. In this example, the indicia comprises one or more drop down menus 206. Each drop down menu can be associated with a different context, i.e. different task, in which a user can engage. In this particular example, and for the sake of brevity, only one indicia or drop down menu is shown.
[0042] In operation, a user who is working within a particular context in display area 204 may desire to view links associated with a different context. In this case, the user simply clicks on the drop down menu 206 to automatically view one or more quick links that are associated with a different context. When the user clicks on the menu 206, their context within the display area does not change. That is, they are able to view the quick link or links associated with the different context or contexts, without having to change their own context. To this extent, the display of the quick links associated with the other context is done in a modeless fashion. That is, when the user displays the quick links, they are not required to temporarily leave their current context. They may continue working within or at least view their current context in the display area 204 while the quick links are displayed.
[0043] As an example, consider again the user who is working in a word processor on a particular document and receives an email message from a friend. Instead of having to leave the current document displayed in display area 204, the user simply clicks on the menu 206 to view of list of quick links that correspond to the email messages that the user has received. In this way, the user can check their list of email messages (or view links that pertain to one context) while working in a completely different context. The user can then click on a quick link to be navigated to the new context which, in this case, is the email message.
[0044] FIG. 3 is a flow diagram that describes steps in a method in accordance with the described embodiment. The illustrated method can be implemented in any suitable hardware, software, firmware, or combination thereof. In the illustrated example, the method is implemented in software.
[0045] Step 300 receives information that pertains to different user contexts. This information can comprise any information that can be associated with any number of different user contexts. Advantageously, the information can comprise dynamically changing information. For example, the information can comprise “incoming” information that is received by the user's computer while the user is working within one context (e.g. receiving an email message while working in a word processing document). Such information can also comprise information that is or is not generated by the user themselves. The information can also comprise time-sensitive information (e.g. calendar appointments for a particular day or time frame), in which case the information would appear when the appointments start in the immediate future. Further, the information can comprise information concerning content that the user is working with and information about the content's use. Step 302 presents a display on the user's computer that pertains to a first user context. The display can be any suitable display with which the user can interact to accomplish a task. Step 304 presents user-engagable indicia that enables a user to access quick links associated with one or more contexts that are different from the first context. The links can be associated with the information that is received at step 300. Any suitable user-engagable indicia can be presented. In the example given above, the indicia is displayed in the form of a drop down menu. Step 306 displays quick links that are associated with the different contexts responsive to a user engaging the user-engagable indicia. In the above example, this step can be implemented when the user clicks on the drop down menu that is associated with the different contexts. Advantageously, steps 304 and 306 are implemented without changing the user's present computing context. So, in the above example, this step is implemented by displaying quick links to the user's incoming email messages without requiring the user to change their word processing context.
[0046] Exemplary Implementation
[0047] In accordance with one specific implementation, software provides a user interface (UI) that presents a user with a single navigable window that can be navigated between multiple different functionalities by a user. The single navigable window and different functionalities are advantageously provided by a single application program which greatly facilitates integration of the different functionalities. The single navigable window contains user-engagable indicia that enables a user to view quick links that are associated with different functionalities, without having to change their current context or functionality. An exemplary single navigable window application is described in the U.S. Patent Application entitled “Single Window Navigation Methods and Systems”, incorporated by reference above.
[0048] In the exemplary single navigable window application, a user, through the use of various navigation instrumentalities, can navigate between the functionalities and when doing so, the single window presents one of these functionalities. When this one functionality is presented to the user, the user is able, through the use of the user-engagable indicia, to view quick links associated with one or more of the other functionalities. In this particular implementation, one navigation instrumentality is provided in the form of a web browser-like navigation tool. The choice of a web browser-like navigation tool follows from concerns that navigation instrumentalities be of a type that is readily understood by most individuals familiar with computing environments. Thus, when a user first encounters the inventive navigable single window concept for the first time, they do not have to learn an unfamiliar navigation concept. Another navigation instrumentality includes links to each of the multiple different functionalities. These links are different from the quick links and can be clicked on by a user to automatically navigate the single navigable window to a selected functionality. Once the user has navigated the single window to a particular functionality, they can set about accomplishing a task within the functionality. One or more of the application links includes the user-engagable indicia that, in turn, displays the quick links to the associated functionality.
[0049] FIG. 4 shows but one exemplary user interface (UI) 400 in accordance with this specific implementation. It will be appreciated that other UIs could be used to implement the inventive concepts described herein and that the illustrated UI constitutes but one way of doing so. In the illustrated example, UI 400 includes a navigation bar 402, one or more command areas 404, and a display or document area 406 that constitutes the single navigable window.
[0050] Navigation bar 402 is located adjacent the top of display area 406 and contains browser-like navigation buttons 408 in the form of a “backward” button, a “forward” button, a “stop” button and the like. The navigation bar can be located anywhere on the UI. Its illustrated placement, however, is similar in appearance to the placement of traditional web browsing navigation features. In addition to the navigation buttons 408, the navigation bar 402 also includes one or more links 410 to the different functionalities that are provided by the single application program and which can be accessed by the user. Individual links 410 have user-engagable indicia 411 associated with them that enable a user to view quick links that are associated with the functionality. In the illustrated example, links to three exemplary functionalities (i.e. functionality 1, functionality 2, and functionality 3) are shown and each has its own user-engagable indicia 411. It is possible, however, for less than all of the functionalities to have user-engagable indicia These functionalities are typically different functionalities that can enable a user to complete different respective tasks. Examples of different tasks are given below in more detail. In this example, these functionalities are advantageously all provided within the context of a single application.
[0051] In operation, to access a particular functionality, a user simply clicks on one of the links 410 and a display that pertains to the selected functionality is immediately presented in the single window display area 406. To view quick links that are associated with a particular functionality that is the same as or different from one in which the user is currently working, the user simply clicks on the corresponding user-engagable indicia 411 to see a drop down menu containing the quick links. Thus, while working within functionality 1, for example, the user could click on the user-engagable indicia 411 associated with any of functionalities 1, 2 and 3 to see their associated quick links. By clicking further on any of the quick links, the user can automatically navigate the single window to that particular link. As the user navigates from link to link or from functionality to functionality, their navigation activities are managed by a software-implemented navigation model that is described in a section entitled “Navigation Model” below.
[0052] Command areas 404 are located adjacent the top and left side of the display area 406. The command area(s) can, however, be located in any suitable location. The command areas provide commands that are both global in nature and specific to the particular context the user has selected. For example, some commands such as “search” and “help” might be considered as global in nature since they can find use in many contexts. Other commands, such as “text bold” or “forward” are more specific to the particular context that the user has selected. For the “text bold” command, the user's context may likely be a word processing context, while the “forward” command may likely be employed in an email context. The concept of context-sensitive command structures are described in more detail in the U.S. Patent Application entitled “Task Sensitive Methods And Systems For Displaying Command Sets”, incorporated by reference above.
[0053] Briefly, however, context-sensitive command structures include command sets having one or more individual commands are automatically presented to a user depending on the user's context. Specifically, depending on the type of action the user has taken within display area 406, commands that are specific to that action will appear automatically thus obviating the need for the user to hunt through a menu structure to find commands of interest. This improves upon past approaches which always presented top level commands, even when they were not needed by the user. This is also advantageous from the standpoint of assisting users who are unfamiliar with a particular software application. In the past, these users would have to hunt through an unfamiliar menu structure to find commands that may or may not be pertinent to an action that the user desired to take. In the present case, contextually-appropriate commands are automatically presented in an interface so that a user need not worry about finding appropriate commands.
[0054] In the present example, a context-sensitive command structure in the form of a context block can be presented to the user. The context block can advantageously contain multiple algorithms from which the user can select to see different collections of links that pertain to the particular functionality in which they are currently working or one or more of the functionalities in which they are not currently working. The algorithms are designed to intelligently present links that are very likely to be of interest to the user. Exemplary algorithms are described in more detail in the “Exemplary Algorithms” section below.
Example
[0055] As an example of the single navigable window provided by a single application consider FIGS. 5 and 6 .
[0056] In this example, the multiple functionalities 410 that can be navigated by a user include a browser functionality (indicated by the home icon), a mail functionality (indicated by the letter icon), a planner functionality (indicated by the clock icon), a contacts functionality (indicated by the people icon), a documents functionality (indicated by the folder icon), and a links functionality (indicated by the world icon). These illustrated functionalities are so-called “document-centric” functionalities because they are defined around a type of document that a user interacts with, e.g. a Web page document, an email document, a calendar document, etc. Each of the links 410 to the functionalities has an associated user-engagable indicia 411 in the form of a drop down menu that shows quick links to the various functionalities.
[0057] FIG. 5 shows an example of a display that is rendered in the display area 406 when a user clicks on the link to the browser functionality. By clicking on the link (i.e. the home icon) to the browser functionality, single application program software executing on the user's computer executes to implement a browser functionality. In this example, the browser functionality displays the user's home page in display area 406. Notice also that navigation buttons 408 are provided for navigation within the current and between the different selectable functionalities. The command areas 404 contain command sets that include commands that are specific to the context that the user has selected. In this example, the user's context is a browsing context. Accordingly, the leftmost command area contains commands that are specific to the browsing functionality. Such commands include ones that a user would normally expect to find in a web browser. In addition, the leftmost command area 404 shows a context block 412 labeled “Favorites” that includes a drop down menu that can enable a user to select between multiple different algorithms that intelligently present links associated with their current context. In this example, context block 412 indicates that the user has selected a “Top Favorites” algorithm that lists their top favorite web sites. An exemplary “Top Favorites” algorithm is described below in the “Exemplary Algorithms” section.
[0058] Notice also that the command area 404 adjacent the top of display area 406 also contains commands that are specific to the browsing context, i.e. “Add to Favorites” and an address well in which the user can type a URL of a particular destination web site.
[0059] FIG. 6 shows an example of a display that is rendered in the display area 406 when the user clicks on the link to the mail functionality (i.e. the folder icon). By clicking on this link, single application program software executing on the user's computer executes to implement the mail functionality. In this example, the mail functionality displays a user's in box with messages that have been received by the user. Notice that the leftmost command area has been minimized by the user and that the command area adjacent the top of the display area 406 contains commands that are specific to the user's current context, e.g. “New” for generating a new email message, “Reply” for replying to an email message, “Reply to All” for replying to all recipients of an email message and the like.
[0060] Likewise, although not specifically illustrated, the user could have displays for the planner, contacts, documents, and links functionalities presented in the display area 406 by simply clicking on the links to these specific functionalities. The navigation bar 408 provides the user with the ability to navigate through these different functionalities in a browser-like manner.
[0061] It is important to note that the above example constitutes but one exemplary way in which multiple different functionalities and associated quick links can be presented to a user within the construct of a navigable structure. It should be understood that the specifically illustrated functionalities (i.e. browser, mail, planner etc.) constitute specific examples of different functionalities that are capable of being incorporated into the single application program that provides the navigable window and should in no way limit the scope of the claimed subject matter to only the specifically illustrated and described functionalities. Accordingly, other different functionalities and associated quick links can be employed.
[0062] FIG. 7 is a flow diagram that describes steps in a method in accordance with this described embodiment. The illustrated method can be implemented in any suitable hardware, software, firmware, or combination thereof. In the illustrated example, the method is implemented in software.
[0063] Step 700 provides a single application program with multiple different functionalities. The functionalities, as pointed out above, are advantageously different so as to enable a user to accomplish different tasks. One specific non-limiting example of different functionalities was given above in the context of document-centric functionalities that enable a user to make use of browser, mail, planner, contacts, documents, and links functionalities. Step 700 can be implemented by configuring a computing device, such as a user's computer, with the single application program having the multiple different functionalities. This step can also be implemented by providing a software platform in the form of a generic single application shell that is extensible and adaptable to receive different extensions or software modules that embody various different functionalities as described in the U.S. Patent Applications entitled “Single Window Navigation Methods and Systems”, “Methods, Systems, Architectures and Data Structures For Delivering Software via a Network”, and “Network-based Software Extensions” incorporated by reference above. These different extensions are then presented to the user in the context of the single application having the multiple different functionalities.
[0064] These extensions can be delivered to the platform in any suitable way and through any suitable delivery mechanism. For example, one way of delivering the various extensions or functionalities is to deliver them via a network such as an Intranet or the Internet. Regardless of the manner in which the single application is provided, step 702 presents a user interface (UI) with a single window, links to the multiple different functionalities, and user-engagable indicia associated with one or more of the links. The user-engagable indicia, as described above, enables a user to access quick links associated with one or more of the functionalities. The UI can also advantageously include navigation instrumentalities that enable a user to navigate between the different functionalities in a browser-like manner. FIGS. 4-6 give specific examples of an exemplary UI that can be used in accordance with the described embodiment. Step 704 ascertains whether a user has engaged any of the user-engagable indicia for displaying the quick links. If the user has not engaged any of the user-engagable indicia, then step 705 does not display any of the quick links. The user-engagable indicia can be continually displayed so that a user is free to select one. If the user has engaged any of the user-engagable indicia (e.g. by clicking on a drop down menu 411 associated with one or more of the functionalities), then step 706 displays the quick links that are associated with the user-engagable indicia. Step 708 ascertains whether the user has selected a particular quick link from the displayed quick links. If the user has not, then step 710 can remove the display of quick links and branches back to step 704. This step can be implemented automatically (e.g. by removing the quick links display after a determinable amount of time) or manually (by enabling the user to close the quick links display through some predefined action). If the user has selected a particular quick link, then step 712 navigates the single window to the selected quick link and displays a document associated with the quick link for the user. Step 712 then returns to step 704. It will be appreciated that step 706 can also remove quick links that are displayed responsive to a user engaging the user-engagable indicia.
[0065] Hence, in this example, multiple different functionalities are provided by a single application program that provides a single navigable window that can be navigated among the different functionalites. This permits a user to accomplish different tasks without having to pull up and manage multiple windows. All of the functionalities, in this example, are provided within the single window as desired by the user. To assist the user in operating within the single window environment, one or more of the functionalities have user-engagable indicia associated with them that enables a user to view quick links that pertain to a functionality that is different from a functionality in which they happen to be working. Advantageously, the user is able to view the quick links without having to change their current context. For example, in the document-centric example described in FIGS. 5 and 6 , a user can view quick links associated with upcoming appointments in their calendar functionality while browsing the web with their browser functionality. When they view the links to the appointments, their context remains within the browser functionality. If the user chooses, they may click on a particular quick link to an appointment which then changes their context and navigates the single navigable window to a document that displays more information about the appointment.
[0066] Navigation Model
[0067] In the embodiment described directly above, a navigation model is utilized to manage a user's navigation activities within the single application that provides the multiple different functionalities. Although any suitable navigation model (as will be understood by those of skill in the art) can be used, in the described embodiment a so-called “back-and-truncate” navigation stack is used. The basic concept of a back-and-truncate model is known and forms the basis for many different web browsers on the market today. Essentially, the back-and-truncate model makes use of a navigation stack that is truncated when the user navigates back n times and then forward to a new document. An explanation of the navigation model that is employed in the present example is given is the U.S. Patent Application entitled “Single Window Navigation Methods and Systems”, incorporated by reference above.
[0068] Exemplary Algorithms
[0069] In one embodiment, various inventive algorithms are employed to ensure that the quick links that are displayed for the user are intelligently selected for display. Many of the algorithms use dynamically changing information as a basis for ascertaining what quick links to display for the user. Dynamically changing information can include such things as incoming information (e.g. information that is received by the user's computer) and information concerning future activities or events (e.g. calendar appointments). The dynamically changing information is processed by various algorithms to provide the quick links that can be selected for display for the user.
[0070] As an example, consider the document-centric single navigable window example above. In that example, the different functionalities include a planner functionality and an email functionality. The planner functionality typically employs information that can be considered as information concerning future activities or events. The email functionality employs information that can be considered as incoming information. The inventive algorithms take into account the nature of this information and attempt to provide an intelligently arranged collection of quick links for the user. Additionally, at least some of the inventive algorithms are employable across different content types. That is, some of the algorithms can provide quick links to different content types. An example of this is given in the “Recent Items List” section below.
[0071] The algorithms described below help to determine a set of quick links to provide for users. The inventive algorithms can work in multiple different ways. For example, the algorithms can work:
-
- [0072] As a filter or union of filters on a stored collection or collections of data (e.g. a collection of mail messages or web page favorites); or
- [0073] As data tracked in memory about a current application session, usually across multiple types of data (e.g. web pages, calendar appointments, and email messages, for example)
[0074] Multiple Selectable Algorithms
[0075] In one implementation, a user is presented, via a UI, with multiple algorithms from which they can select to have quick links displayed. The different algorithms can display difterent collections of quick links depending on the specifics of the algorithm selected by the user. Advantageously, the multiple selectable algorithms can be employed in connection with the single navigable window application described above. Hence, the different selectable algorithms can be employed across different content types.
[0076] Consider for example FIG. 8 which shows an exemplary user interface 800 designated as “Favorites”. Interface 800 corresponds to the “Favorites” context block 412 of FIG. 5 . Interface 800 includes multiple different algorithms that can be selected by a user. When a user selects a particular algorithm, they are presented with a display of quick links that are provided by that specific selected algorithm. In the illustrated example, four exemplary algorithms are shown: a “Top Favorites” algorithm 802, a “Suggested Favorites” algorithm 804, a “Recently Added Favorites” algorithm 806, a “Places Visited Today” algorithm 808, and a “Recent Items” algorithm 810. The “Top Favorites”, “Suggested Favorites”, and “Recent Items List” algorithms are discussed in specific sections below in more detail. It will be appreciated that the listed algorithms can be provided in any suitable way, e.g. in the illustrated UI or in drop down menus similar to the other quick links.
[0077] In the single navigable window implementation where a user's context is capable of changing from functionality to functionality, it is important to note that some of the different selectable algorithms, when selected by a user, provide quick links that are particular to the user's present context. That is, as the user's context changes from functionality to functionality, so too do the collection of quick links that are provided by some of the algorithms. For example, if a user is working in their email functionality, then by selecting “Top Favorites”, they can see a list of their top favorite email messages. In the present example, their favorite email messages can be displayed directly under interface 800 in a display 812. If a user navigates to the web browser functionality and selects the “Top Favorites” algorithm, they can see a list of their top favorite web sites. Thus, the algorithms are capable of being employed in connection with and across different content types (e.g. email messages and web pages).
[0078] FIG. 9 is a flow diagram that describes steps in a method in accordance with this described embodiment. The illustrated method can be implemented in any suitable hardware, software, firmware, or combination thereof. In the illustrated example, the method is implemented in software.
[0079] Step 900 provides multiple different algorithms for displaying quick links. The algorithms that are provided can be any suitable algorithms. Advantageously, some if not all of the algorithms are designed to be employed in connection with and across different content types. In addition, some of the algorithms can display quick links to different content types, as will become apparent below in the “Recent Items List” section. Step 902 displays the multiple different algorithms for selection by a user. The algorithms can be displayed in response to the user actively pulling them up, or they can be displayed automatically when the user's context indicates that the algorithms might be useful to the user. Step 904 ascertains whether the user has selected an algorithm. A user can select an algorithm by simply clicking on the appropriate algorithm. If the user has not selected an algorithm, the method can branch back to step 902. Alternately, the method can remove the display of algorithms. If the user selects an algorithm, then step 906 displays quick links that are provided by the algorithm. The quick links can include links that are within the user's present context as well as links that are not within the user's present context.
[0080] Top Favorites
[0081] The inventive Top Favorites algorithm embodiments enable a user to see quick links that are associated with items on a favorites list that have been visited most often by the user as well as items that have most recently been added by the user to a favorites list. To determine which items have been visited “most” often by a user, any suitable metrics can be used. For example, one metric might look at a one-week or a one-month time period and set a predetermined threshold at ten. In this example, an item that is visited more than ten times in the defined time period would be considered as being an item that is visited most often. Similarly, to determine which items have been “most” recently added, any suitable metrics can be used, e.g. added within the past 2 or 3 days. This algorithm recognizes that items of particular interest to a user can include not only those items that a user visits frequently, but items that they recently added to their favorites list as well.
[0082] The Top Favorites algorithm can be implemented as follows. A database maintains “favorite” entries in which a user has indicated an interest. The database can be maintained in a permanent store. FIG. 10 shows a number of different exemplary database entries at 1000 that form a portion of such a database. The database entries include a link field 1002 that holds the information describing the link. Here, such information comprises the link's URL. There are also one or more fields 1004 for maintaining information regarding how frequently a user accesses a particular link. In this example, four exemplary fields are provided—each corresponding to a one-week time period. The “1 Wk” field can hold a value associated with a user's access frequency during the preceding week; the “2 Wk” field can hold a value associated with a user's access frequency two weeks ago, and so on. Additionally, a “Date Added” field 1006 includes the date when the user added the link to their favorites list.
[0083] In this example, database entries are ranked according to how frequently a user has accessed them. More frequently accessed links are ranked higher than less frequently accessed links. One way of ranking links is to calculate a score for each link that counts the number of times a user has accessed a link, weighting the more recent accesses heavier than the less recent accesses. Each score is then ordered in terms of highest to lowest to provide a ranked list of popular favorites with more popular links appearing toward the top of the list and less popular links appearing toward the bottom of the list or not appear on the list at all. Individual links can now be identified based upon how popular they are as measured by the user's access frequency. Next, the most recently added entries are ascertained in accordance with definable parameters. For example, a search query might specify that entries added within the last two weeks are to be identified. This provides a list of most recently added favorites. This list, and the links from the list of popular favorites are then combined to provide a collection of favorites that includes not only the most popular links (as determined by the user's access frequency), but the most recently added links as well. The latter portion of the list ensures that links that are of current interest to the user populate the “Top Favorites” list.
[0084] FIG. 11 is a flow diagram that describes steps in a method in accordance with this embodiment. This method can be implemented in any suitable hardware, software, firmware, or combination thereof. In the present example, the method is implemented in software. Step 1100 maintains a database containing information describing various user favorites. This information can include links to the favorites (such as URLs and the like), as well as information that describes the user's access frequency and when the favorite was added by the user to their favorites list. Exemplary database entries are shown in FIG. 10 . Step 1102 runs a first database query that identifies and ranks the most frequently accessed user favorites. Step 1104 runs a second database query that identifies the most recently added favorites. Step 1106 then calculates a union of the first and second queries to provide a user's “Top Favorites” list.
[0085] Suggested Favorites
[0086] In another embodiment, a “Suggested Favorites” algorithm enables a user to see links that are associated with items that have been visited most often by the user as well as items that have visited most recently by the user. This algorithm is similar to the “Top Favorites” algorithm, except that instead of running a database query that identifies the most frequently and recently visited favorites (step 1104), a database query is run that identifies the most recently browsed items. Thus, this algorithm recognizes that items of particular interest to a user can include not only those items that a user adds to a manual list and visits frequently, but also items that they most recently visited or visit often and do not add to this list. To determine which items have been most recently visited, any suitable metric can be used, e.g. visited within the past 2 or 3 days.
[0087] In an exemplary implementation, a “Date Last Accessed” field 1008 (FIG. 10 ) can be included in the database 1000. Entries in this field include the dates when a user last accessed a particular item.
[0088] FIG. 12 is a flow diagram that describes steps in a method in accordance with this described embodiment. This method can be implemented in any suitable hardware, software, firmware, or combination thereof. In the present example, the method is implemented in software. Step 1200 maintains a database containing information describing various visited pages. This information can include links to the pages (such as URLs and the like), as well as information that describes the user's access frequency and when the page was last accessed by the user. Exemplary database entries are shown in FIG. 10 . Step 1202 runs a first database query that identifies and ranks the most frequently accessed user pages. Step 1204 runs a second database query that identifies the most recently accessed pages. Step 1206 then calculates a union of the first and second queries to provide a user's “Suggested Favorites” list.
[0089] Recent Items List
[0090] In one embodiment, a “Recent Items List” is provided for a user. This embodiment is particularly useful in the context of the single window application program that provides multiple different functionalities. Recall that each of the different functionalities can have different associated content types, e.g. email messages, calendaring items, contacts, web pages, etc. The “Recent Items List” tracks, in memory, information pertaining to one or more of the last document of a particular content type that the user visited. Advantageously, the application program can store a link to the most recently browsed document of every content type that the application supports. For example, if an application contains email, calendaring, browsing, and contact functionalities, the “Recent Items List” can contain links to each of the most recently accessed documents of the particular content types. This can be extended to include more items in each list or other kinds of extended content: as new functionalities are added to the application, the list could expand to include those types as well. In addition, this algorithm can be extendible to incorporate newly created document types. For example, if a user adds an extension that provides a new document type, this algorithm can ensure that documents of the newly-created document type are included in the “Recent Items List.”
[0091] Consider, for example, FIG. 13 which shows an exemplary “Recent Items List” 1300 that can be maintained in memory. In this example, the list contains five entries, one for each content type that is supported by the application. Each of the entries is a link that is associated with the most recently viewed document of a particular content type. For example, content type 1 might be a link to the last email message that was read, content type 2 might be a link to the last calendaring item that was browsed, content type 3 might be a link to the last web page that was browsed, etc.
[0092] One particularly useful implementation of the “Recent Items List” occurs in connection with the “back” navigation button drop down menu. Specifically, the navigation bar 408 (see FIGS. 5 and 6 ) includes a “back” navigation button in the form of a leftward-facing arrow. This navigation button includes a drop down menu that can be accessed by clicking on user-engagable indicia 411 located adjacent the button. The drop down menu might list the last three or four items that were most recently encountered by the user. Links to these items are managed in the navigation stack mentioned above. There may be times, however, when a user wishes to access a document on which they previously worked which is not listed in the back drop down menu. For example, consider the following: Assume that a user is browsing through various functionalities and visits an email message from a friend. The email message includes a link that the user follows to a web page. Assume further that the web page includes a 12-page article that the user clicks through. If a user wishes to return to their friend's email message, then they can click the “back” navigation button 12 times to navigate back through the 12 pages to get to the email message. Alternately, the user can click the “back” drop down menu to see the last three or four items that they browsed. Accordingly, the user would have to click this drop down menu multiple times.
[0093] In the described embodiment, the “back” drop down menu supports a “Recent Items List” which contains links to the most recently browsed items of the different content types if they do not appear in the back drop down menu. In the document-centric example above, the “Recent Items List” would contain links to the last mail message, last calendar item, last contact, and last document that the user visited, if those items do not appear in the back drop down menu.
[0094] FIG. 14 shows an exemplary “back” drop down list 1400 that contains links to three most recently accessed items, as well as a “Recent Items List” that can be clicked on by a user. In the above example where the user has browsed a 12-page document, they would not see a link to their friend's email message in the navigation stack when they pulled down the drop down menu. They would, however, see a link to the email message in the “Recent Items List” because their friend's email message was the last email message type that was browsed or viewed by the user.
Conclusion
[0095] The methods and systems described above provide users with a much more user-centric computing experience that is tailored to particular users. The methods and systems provide this user-centric experience while conveniently enabling user participation without requiring the user to change their computing context. Multiple different functionalities can be provided that enable a user to accomplish multiple different tasks. Hence, while a user accomplishes a task associated with one functionality, they can view quick links associated with other functionalities without having to change their present computing context.
[0096] Although the invention has been described in language specific to structural features and/or methodological steps, it is to be understood that the invention defined in the appended claims is not necessarily limited to the specific features or steps described. Rather, the specific features and steps are disclosed as preferred forms of implementing the claimed invention.
Claims
The invention claimed is:
1. A method comprising:
displaying a selectable list of multiple different algorithms from which a user can select within a single navigable window of a single application program that provides multiple different functionalities including at least email functionality, web browser functionality, calendar functionality, and word processing functionality, wherein:
one or more of the algorithms are configured as filters operable on respective collections of data to generate corresponding sets of quick links to which a user can navigate responsive to user selection of the algorithms, and each of the collections of data represents items associated with one of the multiple different functionalities;
at least some of the algorithms are employable with different collections of data associated with the multiple different functionalities;
at least one of the algorithms is a recent items list operable to select most recently used items across the multiple different functionalities;
at least one of the algorithms is a top favorites algorithm operable to select items across the multiple functionalities based upon frequency of use of the items; and
the algorithms are configured to filter dynamically changing information in the respective collections of data to generate the sets of quick links to display by selective inclusion of items from the collections of data in the generated quick links;
receiving a user selection of an individual algorithm when the single application program is navigated to enable interaction with a current functionality of the multiple different functionalities; and
responsive to receiving the user selection, displaying a set of quick links generated by operation of the selected algorithm on at least one of the collections of data to filter the data in accordance with the selected algorithm and without navigating away from the currently functionality.
2. The method of claim 1, wherein the top favorites algorithm enables the user to view quick links associated with items on a favorites list that have been visited most often by the user as well as items that have been most recently added to a user's favorites list.
3. The method of claim 1, wherein one of the algorithms is a suggested favorites algorithm that enables the user to view quick links associated with items that have been visited most often by the user as well as items that have been most recently visited by the user.
4. The method of claim 1, wherein the recent items list is configured to display multiple items, each of which comprising a different content type associated with one of the multiple different functionalities that was the last item of a particular content type that was visited by a user.
5. The method of claim 1, wherein the algorithms comprise each of:
the top favorites algorithm that enables the user to view quick links associated with items on a favorites list that have been visited most often by the user as well as items that have been most recently added to a user's favorites list;
a suggested favorites algorithm that enables the user to view quick links associated with items that have been visited most often by the user as well as items that have been most recently visited by the user; and
the recent items list that is configured to display multiple items, each of which comprising a different content type associated with one of the multiple different functionalities that was the last item of a particular content type that was visited by a user.
6. One or more computer-readable media having computer-readable instructions thereon which, when executed by a computer, cause the computer implement the method of claim 1.
7. A computing system embodying the one or more computer-readable media of claim 1.
8. A method comprising:
automatically displaying multiple different algorithms within a single navigable window of a single application program that provides multiple different functionalities including at least two of email functionality, web browser functionality, calendar functionality, and word processing functionality, the algorithms being configured to filter a database to output collections of quick links to which a user can navigate responsive to selection of the algorithms, at least some of the algorithms being employable across different content types associated with the multiple different functionalities including at least one of:
a top favorites algorithm operable to select items from the database based upon frequency of use of the items;
a recent items list operable to select most recently used items from the database;
receiving a user selection of an individual algorithm; and
responsive to receiving the user selection, displaying a collection of quick links that is output by operation of the selected algorithm to filter the database, wherein some of the quick links in the collection pertain to a currently selected functionality of the multiple different functionalities and other displayed quick links in the collection pertain to other functionalities of the multiple different functionalities, the displaying performed without switching away from the currently selected functionality.
9. The method of claim 8, wherein individual algorithms are configured to process dynamically changing information to determine which quick links to display.
10. The method of claim 8, wherein the top favorites algorithm enables the user to view quick links associated with items on a favorites list that have been visited most often by the user as well as items that have been most recently added to a user's favorites list.
11. The method of claim 8, wherein one of the algorithms is a suggested favorites algorithm that enables the user to view quick links associated with items that have been visited most often by the user as well as items that have been most recently visited by the user.
12. The method of claim 8, wherein the recent items list is configured to display multiple items, each of which comprising a different content type associated with one of the multiple different functionalities that was the last item of a particular content type that was visited by a user.
13. The method of claim 8, wherein the algorithms comprise:
the top favorites algorithm that enables the user to view quick links associated with items on a favorites list that have been visited most often by the user as well as items that have been most recently added to a user's favorites list;
a suggested favorites algorithm that enables the user to view quick links associated with items that have been visited most often by the user as well as items that have been most recently visited by the user; and
the recent items list that is configured to display multiple items, each of which comprising a different content type associated with one of the multiple different functionalities that was the last item of a particular content type that was visited by a user.
14. One or more computer-readable media having computer-readable instructions thereon which, when executed by a computer, cause the computer implement the method of claim 8.
15. A computing system embodying the one or more computer-readable media of claim 14.
16. A method comprising:
exposing, by a single application, a single window having:
multiple navigation instrumentalities operable to cause navigation of the single window between different functionalities of the single application including at least two of browser functionality, calendar functionality, email functionality and word processing functionality; and
multiple user-engagable portions, each portion associated with one of the functionalities and selectable to generate quick links corresponding to the associated functionality;
responsive to a selection of a particular user-engagable portion, displaying multiple different algorithms from which a user can select, to cause generation of the quick links in accordance with the algorithms for the functionality associated with the particular user-engagable portion by selective inclusion in the generated quick links of items from collections of data that each represent items associated with one of the different functionalities, wherein:
at least one of the algorithms is a recent items list operable to select most recently used items across the different functionalities; and
at least one of the algorithms is a top favorites algorithm operable to select items across the different functionalities based upon frequency of use of the items;
receiving a user selection of an individual algorithm; and
responsive to receiving the user selection, displaying one or more quick links that are generated by applying the selected algorithm to filter at least one of the collections of data to obtain the quick links, at least some of the quick links pertaining to a functionality to which the single window is currently navigated, the displaying performed without navigating to a different functionality.
17. The method of claim 16, wherein individual algorithms are configured to process dynamically changing information to determine which quick links to display.
18. The method of claim 16, wherein the receiving the user selection occurs while the single window is navigated to enable interaction with a selected functionality of the different functionalities and the displaying includes displaying quick links associated with at least two of the different functionalities.
19. The method of claim 16, wherein one of the algorithms is a suggested favorites algorithm that enables the user to view quick links associated with items that have been visited most often by the user as well as items that have been most recently visited by the user.
Patent Citations (817)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4201978(A) | 1980-05-01 | Nally | Applicant |
| US4498147(A) | 1985-02-01 | Agnew et al. | Applicant |
| US4514800(A) | 1985-04-01 | Gruner et al. | Applicant |
| US4564752(A) | 1986-01-01 | Lepic et al. | Applicant |
| US4641274(A) | 1987-02-01 | Swank | Applicant |
| US4674040(A) | 1987-06-01 | Barker et al. | Applicant |
| US4723211(A) | 1988-02-01 | Barker et al. | Applicant |
| US4739477(A) | 1988-04-01 | Barker et al. | Applicant |
| US4815029(A) | 1989-03-01 | Barker et al. | Applicant |
| US4847749(A) | 1989-07-01 | Collins et al. | Applicant |
| US4910663(A) | 1990-03-01 | Bailey | Applicant |
| US4926476(A) | 1990-05-01 | Covey | Applicant |
| US4933880(A) | 1990-06-01 | Borgendal 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 |
| US5140563(A) | 1992-08-01 | Thinesen | 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 | Khoyl et al. | Applicant |
| US5218672(A) | 1993-06-01 | Morgan et al. | Applicant |
| US5220649(A) | 1993-06-01 | Forcier | 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 |
| US5251273(A) | 1993-10-01 | Betts et al. | 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 | Beltel 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 |
| US5664133(A) | 1997-09-01 | Malamud et al. | Applicant |
| US5664178(A) | 1997-09-01 | Sinofsky | Applicant |
| US5668966(A) | 1997-09-01 | Ono et al. | Applicant |
| US5669005(A) | 1997-09-01 | Curbow et al. | Applicant |
| US5682536(A) | 1997-10-01 | Atkinson et al. | Applicant |
| US5689667(A) | 1997-11-01 | Kurtenbach | Applicant |
| US5689703(A) | 1997-11-01 | Atkinson et al. | Applicant |
| US5704029(A) | 1997-12-01 | Wright, Jr. | Applicant |
| US5706501(A) | 1998-01-01 | Horikiri et al. | Applicant |
| US5717939(A) | 1998-02-01 | Bricklin et al. | Applicant |
| US5721824(A) | 1998-02-01 | Taylor | Applicant |
| US5740439(A) | 1998-04-01 | Atkinson et al. | Applicant |
| US5742504(A) | 1998-04-01 | Meyer et al. | Applicant |
| US5745683(A) | 1998-04-01 | Lee et al. | Applicant |
| US5745712(A) | 1998-04-01 | Turpin et al. | Applicant |
| US5748807(A) | 1998-05-01 | Lopresti et al. | Applicant |
| US5758184(A) | 1998-05-01 | Lucovsky et al. | Applicant |
| US5758358(A) | 1998-05-01 | Ebbo | Applicant |
| US5761408(A) | 1998-06-01 | Kolawa et al. | Applicant |
| US5761683(A) | 1998-06-01 | Logan et al. | Applicant |
| US5764984(A) | 1998-06-01 | Loucks | Applicant |
| US5764985(A) | 1998-06-01 | Smale | Applicant |
| US5778372(A) | 1998-07-01 | Cordell et al. | Applicant |
| US5778402(A) | 1998-07-01 | Gipson | Applicant |
| US5784555(A) | 1998-07-01 | Stone | Applicant |
| US5790796(A) | 1998-08-01 | Sadowsky | Applicant |
| US5798757(A) | 1998-08-01 | Smith | Applicant |
| US5801701(A) | 1998-09-01 | Koppolu et al. | Applicant |
| US5802304(A) | 1998-09-01 | Stone | Applicant |
| US5806079(A) | 1998-09-01 | Rivette et al. | Applicant |
| US5815830(A) | 1998-09-01 | Anthony | Applicant |
| US5826031(A) | 1998-10-01 | Nielsen | 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 |
| US5845122(A) | 1998-12-01 | Nielsen 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 |
| US5873088(A) | 1999-02-01 | Hayashi et al. | Applicant |
| US5905492(A) | 1999-05-01 | Straub et al. | Applicant |
| US5907621(A) | 1999-05-01 | Bachman 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. | Applicant |
| US5940075(A) | 1999-08-01 | Mutschler, III et al. | Applicant |
| US5950010(A) | 1999-09-01 | Hesse et al. | Applicant |
| US5953731(A) | 1999-09-01 | Glaser | Applicant |
| US5956481(A) | 1999-09-01 | Walsh et al. | Applicant |
| US5960199(A) | 1999-09-01 | Brodsky et al. | Applicant |
| US5963964(A) | 1999-10-01 | Nielsen | Applicant |
| 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 |
| US6012066(A) | 2000-01-01 | Discount 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 |
| US6021403(A) | 2000-02-01 | Horvitz et al. | 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 |
| US6057837(A) | 2000-05-01 | Hatakeda et al. | Applicant |
| US6058413(A) | 2000-05-01 | Flores et al. | Applicant |
| US6065043(A) | 2000-05-01 | Domenikos et al. | Applicant |
| US6069626(A) | 2000-05-01 | Cline et al. | 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 |
| US6088679(A) | 2000-07-01 | Barkley | 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 |
| US6096096(A) | 2000-08-01 | Murphy et al. | Applicant |
| US6097382(A) | 2000-08-01 | Rosen et al. | Applicant |
| US6098081(A) | 2000-08-01 | Heidorn et al. | Applicant |
| US6105012(A) | 2000-08-01 | Chang et al. | Applicant |
| US6108637(A) | 2000-08-01 | Blumenau | Applicant |
| US6108783(A) | 2000-08-01 | Krawczyk et al. | Applicant |
| US6115646(A) | 2000-09-01 | Fiszman et al. | Applicant |
| US6121965(A) | 2000-09-01 | Kenney et al. | Applicant |
| US6122647(A) | 2000-09-01 | Horowitz et al. | Applicant |
| US6144969(A) | 2000-11-01 | Inokuchi et al. | Applicant |
| US6151624(A) | 2000-11-01 | Teare et al. | Applicant |
| US6154128(A) | 2000-11-01 | Wookey et al. | Applicant |
| US6163772(A) | 2000-12-01 | Kramer et al. | Applicant |
| US6167521(A) | 2000-12-01 | Smith et al. | Applicant |
| US6167523(A) | 2000-12-01 | Strong | Applicant |
| 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 |
| US6191797(B1) | 2001-02-01 | Politis | Applicant |
| US6192367(B1) | 2001-02-01 | Hawley et al. | Applicant |
| US6195661(B1) | 2001-02-01 | Filepp et al. | Applicant |
| US6199204(B1) | 2001-03-01 | Donohue | Applicant |
| US6209128(B1) | 2001-03-01 | Gerard et al. | Applicant |
| US6216152(B1) | 2001-04-01 | Wong et al. | Applicant |
| US6219423(B1) | 2001-04-01 | Davis | 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 |
| US6243088(B1) | 2001-06-01 | McCormack et al. | 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 |
| US6282709(B1) | 2001-08-01 | Reha 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 |
| US6292941(B1) | 2001-09-01 | Jollands | 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 |
| US6311221(B1) | 2001-10-01 | Raz 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 |
| US6336214(B1) | 2002-01-01 | Sundaresan | Applicant |
| US6342907(B1) | 2002-01-01 | Petty et al. | Applicant |
| US6343149(B1) | 2002-01-01 | Motoiwa | Applicant |
| US6343302(B1) | 2002-01-01 | Graham | Applicant |
| US6343377(B1) | 2002-01-01 | Gessner et al. | Applicant |
| US6344862(B1) | 2002-02-01 | Williams et al. | 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 |
| US6393469(B1) | 2002-05-01 | Dozier et al. | Applicant |
| US6396488(B1) | 2002-05-01 | Simmons et al. | Applicant |
| US6397264(B1) | 2002-05-01 | Stasnick et al. | Applicant |
| US6405221(B1) | 2002-06-01 | Levine et al. | Applicant |
| US6405238(B1) | 2002-06-01 | Votipka | Examiner |
| US6408311(B1) | 2002-06-01 | Balsley 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 |
| US6421777(B1) | 2002-07-01 | Pierre-Louis | 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. | Examiner |
| 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 |
| US6535229(B1) | 2003-03-01 | Kraft | Applicant |
| USRE38070(E) | 2003-04-01 | Spies et al. | Applicant |
| US6546546(B1) | 2003-04-01 | Van Doorn et al. | Applicant |
| US6546554(B1) | 2003-04-01 | Schmidt et al. | Applicant |
| US6549221(B1) | 2003-04-01 | Brown et al. | Applicant |
| US6549878(B1) | 2003-04-01 | Lowry et al. | Applicant |
| US6549922(B1) | 2003-04-01 | Srivastava et al. | Applicant |
| US6553402(B1) | 2003-04-01 | Makarios et al. | Applicant |
| US6560616(B1) | 2003-05-01 | Garber | Applicant |
| US6560620(B1) | 2003-05-01 | Ching | Applicant |
| US6560640(B2) | 2003-05-01 | Smethers | Applicant |
| US6563514(B1) | 2003-05-01 | Samar | Applicant |
| US6571253(B1) | 2003-05-01 | Thompson et al. | Applicant |
| US6578144(B1) | 2003-06-01 | Gennaro et al. | Applicant |
| US6581061(B2) | 2003-06-01 | Graham | Applicant |
| US6584469(B1) | 2003-06-01 | Chiang et al. | Applicant |
| US6584548(B1) | 2003-06-01 | Bourne et al. | Applicant |
| US6585778(B1) | 2003-07-01 | Hind et al. | Applicant |
| US6589290(B1) | 2003-07-01 | Maxwell et al. | Applicant |
| 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 | Applicant |
| US6631357(B1) | 2003-10-01 | Perkowski | Applicant |
| US6631379(B2) | 2003-10-01 | Cox | Applicant |
| US6631497(B1) | 2003-10-01 | Jamshidi et al. | Applicant |
| US6631519(B1) | 2003-10-01 | Nicholson et al. | Applicant |
| US6632251(B1) | 2003-10-01 | Rutten et al. | Applicant |
| US6633315(B1) | 2003-10-01 | Sobeski et al. | Applicant |
| US6635089(B1) | 2003-10-01 | Burkett et al. | Applicant |
| US6636845(B2) | 2003-10-01 | Chau et al. | Applicant |
| US6643633(B2) | 2003-11-01 | Chau et al. | Applicant |
| US6643652(B2) | 2003-11-01 | Helgeson et al. | Applicant |
| US6643684(B1) | 2003-11-01 | Malkin et al. | Applicant |
| US6651217(B1) | 2003-11-01 | Kennedy et al. | Applicant |
| US6654737(B1) | 2003-11-01 | Nunez | Applicant |
| US6654932(B1) | 2003-11-01 | Bahrs et al. | Applicant |
| US6658417(B1) | 2003-12-01 | Stakutis et al. | Applicant |
| US6658622(B1) | 2003-12-01 | Aiken et al. | Applicant |
| 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 |
| US6675202(B1) | 2004-01-01 | Perttunen | 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 |
| US6748569(B1) | 2004-06-01 | Brooke 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. | Applicant |
| US6763343(B1) | 2004-07-01 | Brooke et al. | Applicant |
| US6772139(B1) | 2004-08-01 | Smith, III | Applicant |
| US6772165(B2) | 2004-08-01 | O'Carroll | Applicant |
| US6774926(B1) | 2004-08-01 | Ellis et al. | Applicant |
| US6779154(B1) | 2004-08-01 | Nussbaum et al. | Applicant |
| US6781609(B1) | 2004-08-01 | Barker et al. | Applicant |
| US6782144(B2) | 2004-08-01 | Bellavita et al. | Applicant |
| US6799299(B1) | 2004-09-01 | Li et al. | Applicant |
| US6801929(B1) | 2004-10-01 | Donoho et al. | Applicant |
| US6816849(B1) | 2004-11-01 | Halt, Jr. | Applicant |
| US6828992(B1) | 2004-12-01 | Freeman et al. | Examiner |
| 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 |
| US6850895(B2) | 2005-02-01 | Brodersen et al. | Applicant |
| US6862689(B2) | 2005-03-01 | Bergsten et al. | Applicant |
| US6871220(B1) | 2005-03-01 | Rajan et al. | Applicant |
| US6871345(B1) | 2005-03-01 | Crow et al. | Applicant |
| US6874130(B1) | 2005-03-01 | Baweja et al. | Applicant |
| US6876996(B2) | 2005-04-01 | Czajkowski et al. | Applicant |
| US6883168(B1) | 2005-04-01 | James 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 |
| US6925609(B1) | 2005-08-01 | Lucke | 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. | Examiner |
| US6950980(B1) | 2005-09-01 | Malcolm | Applicant |
| US6950987(B1) | 2005-09-01 | Hargraves et al. | Applicant |
| US6957395(B1) | 2005-10-01 | Jobs et al. | 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 |
| US6993722(B1) | 2006-01-01 | Greer 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 |
| US7043687(B2) | 2006-05-01 | Knauss 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 |
| US7076728(B2) | 2006-07-01 | Davis et al. | Applicant |
| US7080083(B2) | 2006-07-01 | Kim et al. | Applicant |
| US7080325(B2) | 2006-07-01 | Treibach-Heck et al. | Applicant |
| US7081882(B2) | 2006-07-01 | Sowden 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 |
| US7107539(B2) | 2006-09-01 | Abbott et al. | Applicant |
| US7120863(B1) | 2006-10-01 | Wang | Applicant |
| US7124167(B1) | 2006-10-01 | Bellotti et al. | 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 |
| US7200665(B2) | 2007-04-01 | Eshghi et al. | Applicant |
| US7200816(B2) | 2007-04-01 | Falk et al. | Applicant |
| US7213200(B2) | 2007-05-01 | Abe et al. | Applicant |
| US7236982(B2) | 2007-06-01 | Zlatanov et al. | Applicant |
| US7237114(B1) | 2007-06-01 | Rosenberg | Applicant |
| US7249328(B1) | 2007-07-01 | Davis | Applicant |
| US7272789(B2) | 2007-09-01 | O'Brien | Applicant |
| US7281018(B1) | 2007-10-01 | Begun et al. | Applicant |
| US7284208(B2) | 2007-10-01 | Matthews | Applicant |
| US7287218(B1) | 2007-10-01 | Knotz 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 |
| US7337391(B2) | 2008-02-01 | Clarke et al. | Applicant |
| US7337392(B2) | 2008-02-01 | Lue | Applicant |
| US7346610(B2) | 2008-03-01 | Ruthfield et al. | Applicant |
| US7346840(B1) | 2008-03-01 | Ravishankar et al. | Applicant |
| US7346848(B1) | 2008-03-01 | Ruthfield et al. | Examiner |
| US7350141(B2) | 2008-03-01 | Kotler et al. | Applicant |
| US7373595(B2) | 2008-05-01 | Jones et al. | Applicant |
| US7412649(B2) | 2008-08-01 | Emek et al. | Applicant |
| US7424671(B2) | 2008-09-01 | Elza et al. | Applicant |
| US7428699(B1) | 2008-09-01 | Kane et al. | Applicant |
| US7441200(B2) | 2008-10-01 | Savage | Applicant |
| US7496632(B2) | 2009-02-01 | Chapman et al. | Applicant |
| US7496837(B1) | 2009-02-01 | Larcheveque et al. | Applicant |
| US7543228(B2) | 2009-06-01 | Kelkar et al. | Applicant |
| US7549115(B2) | 2009-06-01 | Kotler et al. | Applicant |
| US7584417(B2) | 2009-09-01 | Friend | Applicant |
| US7613996(B2) | 2009-11-01 | Dallett et al. | Applicant |
| US2001/0007109(A1) | 2001-07-01 | Lange | Applicant |
| US2001/0016880(A1) | 2001-08-01 | Cai et al. | Applicant |
| US2001/0022592(A1) | 2001-09-01 | Alimpich et al. | Applicant |
| US2001/0024195(A1) | 2001-09-01 | Hayakawa | Applicant |
| US2001/0037345(A1) | 2001-11-01 | Kiernan et al. | Applicant |
| US2001/0044850(A1) | 2001-11-01 | Raz et al. | Applicant |
| US2001/0051928(A1) | 2001-12-01 | Brody | Applicant |
| US2001/0054004(A1) | 2001-12-01 | Powers | Applicant |
| US2001/0056411(A1) | 2001-12-01 | Lindskog et al. | 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 et al. | Applicant |
| US2002/0010855(A1) | 2002-01-01 | Reshef 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/0052769(A1) | 2002-05-01 | Navani et al. | Applicant |
| US2002/0053021(A1) | 2002-05-01 | Rice et al. | Applicant |
| US2002/0054126(A1) | 2002-05-01 | Gamon | Applicant |
| US2002/0054128(A1) | 2002-05-01 | Lau et al. | 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/0083145(A1) | 2002-06-01 | Perinpanathan | Applicant |
| US2002/0083148(A1) | 2002-06-01 | Shaw et al. | Applicant |
| US2002/0083318(A1) | 2002-06-01 | Larose | Applicant |
| US2002/0091738(A1) | 2002-07-01 | Rohrabaugh et al. | Applicant |
| US2002/0099952(A1) | 2002-07-01 | Lambert et al. | Applicant |
| US2002/0100027(A1) | 2002-07-01 | Binding | Applicant |
| US2002/0107885(A1) | 2002-08-01 | Brooks et al. | Applicant |
| US2002/0111699(A1) | 2002-08-01 | Melli et al. | Applicant |
| US2002/0111932(A1) | 2002-08-01 | Roberge 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 | 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 | 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/0178187(A1) | 2002-11-01 | Rasmussen et al. | Applicant |
| US2002/0178380(A1) | 2002-11-01 | Wolf et al. | Applicant |
| US2002/0184188(A1) | 2002-12-01 | Mandyam et al. | Applicant |
| US2002/0184219(A1) | 2002-12-01 | Preisig | Applicant |
| US2002/0184485(A1) | 2002-12-01 | Dray 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 | Applicant |
| US2002/0198935(A1) | 2002-12-01 | Crandall, Sr. et al. | Applicant |
| US2003/0004951(A1) | 2003-01-01 | Chokshi | Applicant |
| US2003/0007000(A1) | 2003-01-01 | Carlson et al. | Applicant |
| US2003/0014397(A1) | 2003-01-01 | Chau | 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/0033037(A1) | 2003-02-01 | Yuen et al. | Applicant |
| US2003/0037303(A1) | 2003-02-01 | Bodlaender et al. | Applicant |
| US2003/0038788(A1) | 2003-02-01 | Demartines et al. | Applicant |
| US2003/0038846(A1) | 2003-02-01 | Hori et al. | Applicant |
| US2003/0043986(A1) | 2003-03-01 | Creamer | 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 | Applicant |
| US2003/0061386(A1) | 2003-03-01 | Brown | Applicant |
| US2003/0061567(A1) | 2003-03-01 | Brown et al. | Applicant |
| US2003/0074279(A1) | 2003-04-01 | Viswanath 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 | Sridhar | Applicant |
| US2003/0120671(A1) | 2003-06-01 | Kim et al. | Applicant |
| US2003/0120686(A1) | 2003-06-01 | Kim et al. | Applicant |
| US2003/0126555(A1) | 2003-07-01 | Aggarwal et al. | Applicant |
| US2003/0128196(A1) | 2003-07-01 | Lapstun et al. | Applicant |
| US2003/0135825(A1) | 2003-07-01 | Gertner et al. | Applicant |
| US2003/0140132(A1) | 2003-07-01 | Champagne et al. | Applicant |
| US2003/0140160(A1) | 2003-07-01 | Raz 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/0172113(A1) | 2003-09-01 | Cameron 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 | 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/0204481(A1) | 2003-10-01 | Lau | Applicant |
| US2003/0204511(A1) | 2003-10-01 | Brundage | Applicant |
| US2003/0204814(A1) | 2003-10-01 | Elo et al. | Applicant |
| US2003/0205615(A1) | 2003-11-01 | Marappan | Applicant |
| US2003/0210428(A1) | 2003-11-01 | Bevlin et al. | Applicant |
| US2003/0212664(A1) | 2003-11-01 | Breining et al. | Applicant |
| US2003/0212902(A1) | 2003-11-01 | van der Made | Applicant |
| US2003/0217053(A1) | 2003-11-01 | Bachman et al. | Applicant |
| US2003/0218620(A1) | 2003-11-01 | Lai et al. | Applicant |
| US2003/0220930(A1) | 2003-11-01 | Milleker et al. | Applicant |
| US2003/0225469(A1) | 2003-12-01 | DeRemer et al. | Applicant |
| US2003/0225768(A1) | 2003-12-01 | Chaudhuri | Applicant |
| US2003/0225829(A1) | 2003-12-01 | Pena et al. | Applicant |
| US2003/0226111(A1) | 2003-12-01 | Wirts et al. | Applicant |
| US2003/0226132(A1) | 2003-12-01 | Tondreau et al. | Applicant |
| US2003/0233374(A1) | 2003-12-01 | Spinola et al. | Applicant |
| US2003/0233644(A1) | 2003-12-01 | Cohen et al. | Applicant |
| US2003/0236859(A1) | 2003-12-01 | Vaschillo et al. | Applicant |
| US2003/0236903(A1) | 2003-12-01 | Piotrowski | Applicant |
| US2003/0237046(A1) | 2003-12-01 | Parker et al. | Applicant |
| US2003/0237047(A1) | 2003-12-01 | Borson | Applicant |
| US2004/0002939(A1) | 2004-01-01 | Arora | Applicant |
| US2004/0002950(A1) | 2004-01-01 | Brennan 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. | Applicant |
| US2004/0010752(A1) | 2004-01-01 | Chan et al. | Applicant |
| US2004/0015783(A1) | 2004-01-01 | Lennon et al. | Applicant |
| US2004/0024842(A1) | 2004-02-01 | Witt | Applicant |
| US2004/0030991(A1) | 2004-02-01 | Hepworth et al. | Applicant |
| US2004/0039881(A1) | 2004-02-01 | Shoebridge 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/0046789(A1) | 2004-03-01 | Inanoria | Applicant |
| US2004/0054966(A1) | 2004-03-01 | Busch et al. | Applicant |
| US2004/0059754(A1) | 2004-03-01 | Barghout et al. | Applicant |
| US2004/0073565(A1) | 2004-04-01 | Kaufman et al. | Applicant |
| US2004/0073868(A1) | 2004-04-01 | Easter et al. | Applicant |
| US2004/0078756(A1) | 2004-04-01 | Napper et al. | Applicant |
| US2004/0083426(A1) | 2004-04-01 | Sahu | Applicant |
| US2004/0088647(A1) | 2004-05-01 | Miller et al. | Applicant |
| US2004/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/0139400(A1) | 2004-07-01 | Allam et al. | Applicant |
| US2004/0146199(A1) | 2004-07-01 | Berkner et al. | Applicant |
| US2004/0148178(A1) | 2004-07-01 | Brain | Applicant |
| US2004/0148514(A1) | 2004-07-01 | Fee et al. | Applicant |
| US2004/0148571(A1) | 2004-07-01 | Lue | Applicant |
| US2004/0162741(A1) | 2004-08-01 | Flaxer et al. | Applicant |
| US2004/0163041(A1) | 2004-08-01 | Engel | Applicant |
| US2004/0163046(A1) | 2004-08-01 | Chu et al. | Applicant |
| US2004/0172442(A1) | 2004-09-01 | Ripley | Applicant |
| US2004/0181543(A1) | 2004-09-01 | Wu et al. | Applicant |
| US2004/0181711(A1) | 2004-09-01 | Johnson et al. | Applicant |
| US2004/0186762(A1) | 2004-09-01 | Beaven et al. | Applicant |
| US2004/0189708(A1) | 2004-09-01 | Larcheveque 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/0210645(A1) | 2004-10-01 | Kouznetsov et al. | Applicant |
| US2004/0216084(A1) | 2004-10-01 | Brown 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/0260593(A1) | 2004-12-01 | Abraham-Fuchs et al. | 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/0028073(A1) | 2005-02-01 | Henry et al. | Applicant |
| US2005/0033626(A1) | 2005-02-01 | Kruse et al. | Applicant |
| US2005/0033728(A1) | 2005-02-01 | James | Applicant |
| US2005/0038711(A1) | 2005-02-01 | Marlelo | Applicant |
| US2005/0050066(A1) | 2005-03-01 | Hughes | Applicant |
| US2005/0055627(A1) | 2005-03-01 | Lloyd et al. | Applicant |
| US2005/0060324(A1) | 2005-03-01 | Johnson et al. | Applicant |
| US2005/0060647(A1) | 2005-03-01 | Doan 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/0097536(A1) | 2005-05-01 | Bernstein et al. | Applicant |
| US2005/0102370(A1) | 2005-05-01 | Lin et al. | Applicant |
| US2005/0102612(A1) | 2005-05-01 | Allan et al. | Applicant |
| US2005/0108104(A1) | 2005-05-01 | Woo | Applicant |
| US2005/0108624(A1) | 2005-05-01 | Carrier | Applicant |
| US2005/0114757(A1) | 2005-05-01 | Sahota et al. | Applicant |
| US2005/0114764(A1) | 2005-05-01 | Gudenkauf et al. | Applicant |
| US2005/0132043(A1) | 2005-06-01 | Wang et al. | Applicant |
| US2005/0132196(A1) | 2005-06-01 | Dietl | Applicant |
| US2005/0138031(A1) | 2005-06-01 | Wefers | Applicant |
| US2005/0138086(A1) | 2005-06-01 | Pecht-Seibert | Applicant |
| US2005/0138539(A1) | 2005-06-01 | Bravery et al. | Applicant |
| US2005/0149375(A1) | 2005-07-01 | Wefers | Applicant |
| US2005/0149726(A1) | 2005-07-01 | Joshi et al. | Applicant |
| US2005/0160398(A1) | 2005-07-01 | Bjornson 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/0240876(A1) | 2005-10-01 | Myers et al. | Applicant |
| US2005/0246304(A1) | 2005-11-01 | Knight et al. | Applicant |
| US2005/0257148(A1) | 2005-11-01 | Goodman et al. | Applicant |
| US2005/0262112(A1) | 2005-11-01 | Moore | Applicant |
| US2005/0268217(A1) | 2005-12-01 | Garrison | Applicant |
| US2005/0268222(A1) | 2005-12-01 | Cheng | Applicant |
| US2006/0010386(A1) | 2006-01-01 | Khan | Applicant |
| US2006/0020586(A1) | 2006-01-01 | Prompt et al. | Applicant |
| US2006/0026500(A1) | 2006-02-01 | Hood | 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/0075245(A1) | 2006-04-01 | Meier | 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/0107206(A1) | 2006-05-01 | Koskimies | Applicant |
| US2006/0129583(A1) | 2006-06-01 | Catorcini et al. | Applicant |
| US2006/0129978(A1) | 2006-06-01 | Abriani et al. | Applicant |
| US2006/0136422(A1) | 2006-06-01 | Matveief et al. | Applicant |
| US2006/0143220(A1) | 2006-06-01 | Spencer, Jr. | Applicant |
| US2006/0155857(A1) | 2006-07-01 | Feenan et al. | Applicant |
| US2006/0161559(A1) | 2006-07-01 | Bordawekar et al. | Applicant |
| US2006/0161837(A1) | 2006-07-01 | Kelkar et al. | Applicant |
| US2006/0173865(A1) | 2006-08-01 | Fong | Applicant |
| US2006/0184393(A1) | 2006-08-01 | Ewin et al. | Applicant |
| US2006/0200754(A1) | 2006-09-01 | Kablesh et al. | Applicant |
| US2006/0248468(A1) | 2006-11-01 | Constantine et al. | Applicant |
| US2007/0005611(A1) | 2007-01-01 | Takasugi 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/0088554(A1) | 2007-04-01 | Harb et al. | 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/0118538(A1) | 2007-05-01 | Ahern et al. | Applicant |
| US2007/0118803(A1) | 2007-05-01 | Walker et al. | Applicant |
| US2007/0130500(A1) | 2007-06-01 | Rivers-Moore 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 |
| US2007/0276768(A1) | 2007-11-01 | Pallante | Applicant |
| US2008/0028340(A1) | 2008-01-01 | Davis | Applicant |
| US2008/0126402(A1) | 2008-05-01 | Sitchi et al. | Applicant |
| US2009/0070411(A1) | 2009-03-01 | Chang et al. | Applicant |
| US2009/0119580(A1) | 2009-05-01 | Rohrabaugh et al. | Applicant |
| US2009/0177961(A1) | 2009-07-01 | Fortini | Applicant |
| EP841615 | 1999-11-01 | Applicant | |
| EP961197 | 1999-12-01 | Applicant | |
| EP1076290 | 2001-02-01 | Applicant | |
| EP1221661 | 2002-07-01 | Applicant | |
| JP63085960 | 1988-04-01 | Applicant | |
| JP401173140(A) | 1989-07-01 | Applicant | |
| JP3191429 | 1991-08-01 | Applicant | |
| JP4225466 | 1992-08-01 | Applicant | |
| JP5314152 | 1993-11-01 | Applicant | |
| JP406014105 | 1994-01-01 | Applicant | |
| JP6139241 | 1994-05-01 | Applicant | |
| JP6180697 | 1994-06-01 | Applicant | |
| JP6180698 | 1994-06-01 | Applicant | |
| JP10171662 | 1998-06-01 | Applicant | |
| JP10-2207805 | 1998-08-01 | Applicant | |
| JP10207805 | 1998-08-01 | Applicant | |
| JP2000132486 | 2000-05-01 | Applicant | |
| JP2002183652 | 2002-06-01 | Applicant | |
| JP2003173288 | 2003-06-01 | Applicant | |
| WO99/24945 | 1999-05-01 | Applicant | |
| WO99/56207 | 1999-11-01 | Applicant | |
| WO1/44934 | 2001-06-01 | Applicant | |
| WO157720 | 2001-08-01 | Applicant |
Non-Patent Literature (198)
- Atova, “User Reference manual Version 4.4, XML Spy suite 4.4,” Atova Ges.m.b.H and Altova, Inc., May 24, 2002, pages cover, copyright page, 1-565.Applicant
- Altova et al. XML Spy, XML integrated Development Environments, Altova Inc., 2002, pp. 1-18.Applicant
- Ben-Natan, U.S. Appl. No. 60/203,081, filed May 9, 2000, entitled “Internet platform for creating and supporting communities”.Applicant
- Han et al., WebSplitter: A Unified XML Framework for Multi-Device Collaborative Web Browsing, 2000, ACM Conference on Cimputer Supported Cooperative Work, 10 pages.Applicant
- IBM: Stack Algorithm for Extractin Subtree from Serialized Tree, Mar. 1, 1994, TDB-ACC-NONN94033, 3 pages.Applicant
- Ixia Soft, “Steamlining content creation, retrieval, and publishing on the Web using TEXTML Server and SML Spy 4 Suite in an integrated, Web publishing environment,” (Partner's Whitepaper, published on the Web as of Jun. 6, 2002, downlowad pp. 1-16.Applicant
- Kutay, U.S. Appl. No. 60/209,713, filed Jun. 5, 2000, entitled, “Methods and systems for accessing, organizing presenting and viewing data”.Applicant
- Microsoft Word 2000 (see Screen Shot “About Microsoft Word”) Published 1983-1999 and Microsoft Excel 2000 (see Screen Shot “About Microsoft Excel”) Published 1988-1999, Three pages.Applicant
- Moore, U.S. Appl. No. 60/191,662, filed Mar. 23, 2000, entitled “Collection-based presistent digital archives”.Applicant
- Borland, Russo “Running Microsoft Word 97”, 314-315, 338, 361-362, 390, and 714-719.Applicant
- “Microsoft Word 2000”, Screenshots,(1999),1-5.Applicant
- Beauchemin, Dave “Using InfoPath to Create Smart Forms”, Retrieved from the Internet at http:/www.microsoft.com/office/infopath/prodinfo/using.mspx on Jan. 21, 2007,(Mar. 27, 2003).Applicant
- Begun, Andrew et al., “Support and Troubleshooting for XML Schemas in InfoPath 2003”, Microsoft Office InfoPath 2003 Technical Articles, Retrieved from the Internet at http://msdn2.microsoft.com/en-us/library/aa168241(office.11,d=printer).aspx on Jan. 21, 2007,(Aug. 2004).Applicant
- Dubinko, Micah “XForms and Microsoft InfoPath”, Retrieved from the Internet at http://www.xml.com/lpt/a/1311 on Jan. 21, 2007,(Oct. 29, 2003).Applicant
- Udell, Jon “InfoPath and XForms”, Retrieved from the Internet at http://weblog.infoworld.com/udell/2003/02/26.html,(Feb. 26, 2003).Applicant
- Hoffman, Michael “Architecture of Microsoft Office InfoPath 2003”, Microsoft Office InfoPath 2003 Technical Articles, Retrieved from the Internet at http://msdn2.microsoft.com/en-us/library/aa219024(office.11,d=printer).aspx on Jan. 21, 2007,(Jun. 2003).Applicant
- Singh, Darshan “Microsoft InfoPath 2003 by Example”, Retrieved from the Internet at http://www.perfectxml.com/InfoPath.asp on Jan. 21, 2007,(Apr. 20, 2003).Applicant
- Raman, T. V., et al., “XForms 1.0”, (Dec. 2001),Section 1-12.2.3 & Appendices A-G.Applicant
- “Enter Key”, Retrieved from the Internet at http://systems.webopedia.com/TERM/Enter—key.html on Dec. 20, 2006.Applicant
- Lehtonen, Miro et al., “A Dynamic User Interface for Document Assembly”, Department of Computer Science, University of Helsinki,(Nov. 2002).Applicant
- Rees, Michael J., “Evolving the Browser Towards a Standard User Interface Architecture”, School of Information Technology, Bond University, Australia,(2001).Applicant
- “Microsoft Visual Basic 5.0 Programmer's Guide”, Microsoft Press, (1997),pp. 42-43, 54-58.Applicant
- Nelson, Joe “Client-side Form Validation Using JavaScript”, Developer Advisory, (Sep. 21, 2001).Applicant
- Brabrand, et al., “Power Forms Declarative Client-side Form Field Validation”, (2002),1-20.Applicant
- Anat, Eyal et al., “Integrating and Customizing Hererogeneous E-Commerce Applications”, The VLDB Journal-The International Journal on Very Large Data Bases, vol. 10, Issue 1,(Aug. 2001),16-38.Applicant
- Adams, Susie et al., “BizTalk Unleashed”, Sams publishing, 2002, first printing Mar. 2001,1-2, 31-138.Applicant
- Vasters, Clemens F., “BizTalk Server 2000 A Beginner's Guide”, Osborne/McGraw-Hill,(2001),1-2, 359-402.Applicant
- Halberg, Bruce et al., “Using Microsoft Excel 97”, (1997),191-201, 213-219.Applicant
- Villard, et al., “An Incremental XSLT Transformation Processor for XML Document Manipulation”, http://www2002.org/CDROM/refereed/321, Printed on May 18, 2007,(May 2002),25 pages.Applicant
- Pacheco, Xavier et al., “Delphi 5 Developers Guide”, Sams Publishing. Chapter 31, Section: Data Streaming,(1999),4.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
- “Architecture for a Dynamic Information Area Control” IBM Technical Disclosure Bulletin IBM Corp. New York US vol. 37 No. 10 Jan. 10, 1994. pp. 245-246.Applicant
- Alschuler Liora “A tour of Xmetal” O'Reilly XML.COM ′Online Jul. 14, 1999 XP002230081 retrieved from the internet: <URL:http://www.xml.com/pub/a/SeyboldReport/ip0311025.html> retrieved on Feb. 5, 2003.Applicant
- Au Irene et al. “Netscape Communicator's Collapsible Toolbars” CHI'98 Human Factors in Computing Systems Conference Proceedings Los Angeles CA Apr. 18-23, 1998 pp. 81-86.Applicant
- Battle Steven A. et al.; “Flexible Information Presentation with XML” 1998 The Institution of Electrical Engineers 6 pages.Applicant
- Brogden William; “Arbortext Adept 8 Editor Review” O'Reilly XML.COM ′Online! Sep. 22, 1999 XP002230080 retrieved from the Internet <URL:http//www.xml.com/pub/a/1999/09/adept/AdeptRvw.htm> retrieved on Feb. 5, 2003.Applicant
- Chen Yi et al.: A; “XKvalidator: A Constraint Validator for XML” CIKM '-2 Nov. 4-9, 2002 Copyright 2002 ACM 1-58113-492-4/02/0011 pp. 446-452.Applicant
- Ciancarini Paolo et al.; “Managing Complex Documents Over the WWW: A Case Study for XML” IEEE Transactions on Knowledge and Data Engineering Vo.l. 11 No. 4 Jul./Aug. 1999. pp. 629-938.Applicant
- Davidow Ari: Alle; “XML Editors: Allegations of Functionality in search of reality” Internet ′Online! 1999 XP002230082 retrieved from the Internet <URL:http://www.ivrltype.com/xml/>.Applicant
- Kanemoto Hirotaka et al; “An Efficiently Updatable Index Scheme for Structured Documents” 1998 IEEE pp. 991-996.Applicant
- Sutanthavibul Supoj et al.; “XFIG Version 3.2 Patchlevel 2 (Jul. 2, 1998) Users Manual (Edition 1.0)” Internet Document [Online] Jul. 2, 1998 XP002229137 Retrieved from the Internet: <URL:http://www.ice.mtu.edu/online—docs/xfig332/> [retrieved on Jan. 28, 2003].Applicant
- Usdin Tommie et al.; “XML: Not a Silver Bullet But a Great Pipe Wrench” Standardview vol. 6. No. 3 Sep. 1998 pp. 125-132.Applicant
- Chien Shu-Yao et al.; “Efficient Management of Multiversion Documents by Object Referencing” Proceedings of the 27th VLDB Conference 2001 pp. 291-300.Applicant
- Chien Shu-Yao et al.; “Efficient schemes for managing mulitversion XML documents” VLDB Journal (2002) pp. 332-352.Applicant
- Chien Shu-Yao et al.; “Storing and Querying Multiversion XML Documents using Durable Node Numbers” IEEE 2002 pp. 232-241.Applicant
- Chien Shu-Yao et al.; “XML Document Versioning” SIGMOD Record vol. 30 No. 3 Sep. 2001 pp. 46-53.Applicant
- Dyck Timothy: “XML Spy Tops as XML Editor” http://www.eweek.com/article2/0395972404100.asp Nov. 25, 2002 4 pages.Applicant
- Haukeland Jan-Henrick; “Tsbiff—tildeslash buff—version 1.2.1” Internet Document [Online] Jun. 1999 URL: http://web.archive.org/web/19990912001527/http://www.tildeslash.com/tsbiff/.Applicant
- Nelson Mark; “Validation with MSXML and XML Schema” Windows Developer Magazine Jan. 2002 pp. 35-38.Applicant
- Netscape Communication Corporation; “Netscape Communicator 4.61 for OS/2 Warp” Software 1999 The whole software release & “Netscape—Version 4.6 [en]-010615”.Applicant
- Noore A.; “A secure conditional access system using digital signature and encryption” 2003 Digest of Technical Papers. International Conference on Consumer Electronics Jun. 2003 pp. 220-221.Applicant
- Rogge et al.; “Validating MPEG-21 Encapsulated Functional Metadata” IEEE 2002 pp. 209-212.Applicant
- Wong Raymond K. et al.; “Managing and Querying Multi-Version XML Data with Update Logging” DocEng '02 Nov. 8-9, 2002 Copyright 2002 ACM 1-58113-594-07/02/0011 pp. 74-81.Applicant
- Cheng Ya Bing et al.; “Designing Valid XML Views” ER 2002 LNCS 2503 2002 Springer-Verlag Berlin Heidelberg 2002 pp. 463-477.Applicant
- Chuang Tyng-Ruey; “Generic Validation of Structural Content with Parametric Modules” ICFP '01 Sep. 3-5, 2001 Copyright 2001 ACM 1-58113-415-0/01/0009 pp. 98-109.Applicant
- Dayton Linnea and Jack Davis; “Photo Shop 5/5.5 WOW! Book” 2000 Peachpit Press pp. 8-17.Applicant
- Hall Richard Scott; “Agent-based Software Configuration and Deployment” Thesis of the Univeristy of Colorado Online Dec. 31, 1999 retrieved from the Internet on Nov. 7, 2003: <http://www.cs.colorado.edu/users/rickhall/documents/ThesisFinal.pdf> 169 pages.Applicant
- Hardy Mathew R. B. et al; “Mapping and Displaying Structural Transformations between XML and PDF” DocEng '02 Nov. 8-9, 2002 Copyright 2002 ACM 1-58113-597-7/02/0011 pp. 95-102.Applicant
- Kim Sang-Kyun et al.; “Immediate and Partial Validation Mechanism for the Conflict Resolution of Update Operations in XML Databases” WAIM 2002 LNCS 2419 2002 pp. 387-396 Springer-Verlag Berlin Heidelberg 2002.Applicant
- Netscape Communication Corp; “SmartUpdate Developer's Guide” Online Mar. 11, 1999 retrieved from the Internet on Dec. 8, 2000: <http://developer.netscape.com:80/docs/manuals/communicator/jarman/index.htm> 83 pages.Applicant
- Tomimori et al.; “An Efficient and Flexible Access Control Framework for Java Programs in Mobile Terminals”; 22nd International Conference on Distributed Computing Systems Workshops; 2002; pp. 777-782.Applicant
- Van Hoff Arthur et al.; “The Open Software Description Format” Online Aug. 13, 1997 retrieved from the Internet on Nov. 7, 2003: <http://www.w3.org/TR/NOTE-OSD> 11 pages.Applicant
- Verlamis Iraklis et al.; “Bridging XML-Schema and relational databases. A System for generating and manipulating relational databases using valid XML documents.” DocEng '01 Nov. 9-10, 2001 Copyright 2001 ACM 1-58113-432-0/01/0011 pp. 105-114.Applicant
- Williams Sara and Charlie Kin; “The Component Object Model: A Technical Overview” Oct. 1994 Microsoft Corp. pp. 1-14.Applicant
- Pacheco et al., “Delphi 5 Developer's Guide,” Sams Publishing, 1999, Chapter 31 Section: Data Streaming. 6 pages.Applicant
- “Netscape window,” Netscape Screenshot Oct. 2, 2002.Applicant
- Clarke P., “From small beginnings” Knowledge Management Nov. 2001, pp. 28-30.Applicant
- Hwang et al., “Micro-Firewalls for Dynamic Network Security with Distributed Intrusion Detection”; IEEE International Symposium on Network Computing and Applications; 2001; pp. 68-79.Applicant
- Kaiya et al., “Specifying Runtime Environments and Functionalities of Downloadable Components Under the Sandbox Mode”; International Symposium on Principles of Software Evolution; 2000; pp. 138-142.Applicant
- Komatsu N. et al., “A Proposal on Digital Watermark in Document Image Communication and Its Application to Realizing a Signature” Electronics and Communications in Japan Part I: Communications vol. 73 No. 5, May 1990, pp. 22-33.Applicant
- Sun Q. et al., “A robust and secure media signature scheme for JPEG images” Proceedings of 2002 IEEE Workshop on Multimedia Signal Processing, Dec. 2002, pp. 296-299.Applicant
- Prevelakis et al., “Sandboxing Applications”; Proceedings of the FREENIX Track; 2001; pp. 119-126.Applicant
- Schmid et al., “Protection Data from Malicious Software”; 18th Annual Computer Security Applications Conference; 2002; pp. 199-208.Applicant
- W3C Editor James Clark and Ste; “XML Path Language (XPath) Version 1.0” Nov. 16, 1998W3C (MIT INRIA Kejo) pp. 1-49.Applicant
- Rapaport L; “Get more from SharePoint” Transform Magazine vol. 11 No. 3. Mar. 2002 pp. 1315.Applicant
- Clark James—W3C Editor; “XSL Transformation (XSLT) Verison 1.0” Nov. 16, 1999 W3C (MIT INRIA Kejo) pp. 1-156.Applicant
- Description of Whitehill Composer software product producted by Whitehill Technologies Inc. available at <http://www.xml.com/pub/p/221> accessed on Apr. 8, 2004, two pages.Applicant
- McCright J.S.; “New Tool Kit to Link Groove with Microsoft Sharepoint” eWeek Enterprise News & Reviews Ziff Davis Media INc. Jul. 29, 2002 1 page.Applicant
- Musgrave S; “Networking technology—impact and opportunities” Survey and Statistical Computing 1996. Proceedings of the Second ASC International Conference. Sep. 1996. pp. 369-378. London UK.Applicant
- Laura Acklen & Read Gilgen, “Using Corel Wordperfect 9”, 251-284, 424-434, 583-586 (1998).Applicant
- Bruce Halberg et al, “Using Microsoft Excel 97”, Published 1997, Bestseller Edition, Pertinent pp. 1-9, 18-25, 85-89, 98-101, 106-113, 124-127, 144-147, 190-201, 209-210, 218-227, 581-590, 632-633, 650-655, 712-714.Applicant
- LeBlond et al, “PC Magazine Guide to Quattro Pro for Windows”, pp. 9-11, 42-61, Ziff-Davis Press, Copyright 1993 by the LeBlond Group.Applicant
- Mansfield, “Excel 97 for Busy People”, Published by Osborne/Mcgraw-Hill 1997 pp. 48-50.Applicant
- “Microsoft Visual Basic 5.0 Programmer's Guide 1997”; pp. 578-579; Redmond WA 98052-6399.Applicant
- Pike et al., “Plan 9 from Bell Labs” UKUUG Summer 1990 10 pages.Applicant
- Zdonik, S., “Object Management System Concepts” ACM 1984 pp. 13-19.Applicant
- Pike et al., “The Use of Name Spaces in Plan 9” Operating Systems Review vol. 27 No. 2 Apr. 1993 pp. 72-76.Applicant
- Trupin, J., “The Visual Programmer” Microsoft Systems Journal Apr. 1996 pp. 103-105.Applicant
- Barker et al., “Creating In-Line Objects Within An Integrated Editing Environment” IBM Technical Disclosure Bulletin vol. 27 No. 5 Oct. 1984 p. 2962.Applicant
- DiLascia et al., “Sweeper” Microsoft Interactive Developer vol. 1 No. 1 1996 27 pages.Applicant
- Clapp D., “The NeXT Application Kit Part I: Non-Responsive Classes” The NeXT Bible 1990 Chapter 16 pp. 275-293.Applicant
- “Store and Organize Related Project Files in a Binder” Getting Results with Microsoft Office 1990 pp. 109-112.Applicant
- Peterson B., “Unix Variants” Unix Review vol. 10 No. 4 Apr. 1992 pp. 29-31.Applicant
- Kobayashi et al., “An Update on BTRON-specification OS Development” IEEE 1991 pp. 132-140.Applicant
- Staneck W., “Internal and External Media” Electronic Publishing Unleashed 1995 Chapter 22 pp. 510-542.Applicant
- Herzner et al., “CDAM- Compound Document Access and Management. An Object-Oriented Approach” Multimedia Systems Interaction and Applications 1992 Chapter 3 pp. 17-36.Applicant
- Berg A., “Naming and Binding: Monikers” Inside Ole 1995 Chapter 9 pp. 431-490.Applicant
- OMG XML Metadata Interchange (XMI) Specification Version 1.2 Jan. 2002.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/tip62htm).Applicant
- Macromedia, Inc.: “Dreamweaver Technote, Changes in copying and pasting in Dreamweaver 4” Internet Article (online). *the whole document*.Applicant
- Rado, Dave: “How to create a template that makes it easy for users to “fill in the blanks”, without doing any programming” Microsoft Word MVP FAQ Site, (online) Apr. 30, 2004, the whole document.Applicant
- Hu, et al., “A Programmable Editor for Developing Structured Documents based on Bidirectional Transformations”, ACM,(Aug. 2004),178-179.Applicant
- Microsoft Corporation, “Microsoft Computer Dictionary” Microsoft Press, Fifth Edition, p. 149.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
- “Microsoft Word 2000 Screenshots”, Word,(2000),1-17.Applicant
- “XForm 1.0”, W3C,(Jul. 16, 2001).Applicant
- “Microsoft Word 2000 Screenshots”, (2000),11-17.Applicant
- XMLSpy, “XmlSpy 2004 Enterprise Edition Manual”, Altova,(May 17, 2004),1-25, 220-225.Applicant
- StylusStudio, “StylusStudio: XPath Tools”, 2004-2007, StylusStudio,1-14.Applicant
- Dodds, “Toward an XPath API”, xml.com,(May 7, 2001),1-3.Applicant
- Altova, “Altova Tools for XPath 1.0/2.0”, Altova,1-12.Applicant
- Bray, Tim “Extensible Markup Language (XML)”, http://www.textuality.com/sqml-erb/WD-xml.html, second named inventor Jean Paoli, third named inventor C.M. Sperberg-McQueen,(Feb. 10, 1998),37 Pages.Applicant
- Kay, Michael “XSL Transfornmations (XSLT) Version 2.0”, http://www.w3.org/TR/2005/WD-xslt20-20050404, (04/205),1-374.Applicant
- Acklen, et al., “Using Corel Wordperfect 9”, Que Corporation,,(1998),pp. 251-284, 424-434, 583-585.Applicant
- “Notice of Allowance”, U.S. Appl. No. 11/203,937, Supplemental,(Sep. 15, 2009),2 pages.Applicant
- “Final Office Action”, U.S. Appl. No. 10/942,528, (Sep. 17, 2009),27 pages.Applicant
- “Non-Final Office Action”, U.S. Appl. No. 11/107,347, (Sep. 17, 2009),9 pages.Applicant
- “Notice of Allowance”, U.S. Appl. No. 10/988,720, (Sep. 17, 2009),18 pages.Applicant
- “Non-Final Office Action”, U.S. Appl. No. 11/044,106, (Sep. 24, 2009),17 pages.Applicant
- “Notice of Allowance”, U.S. Appl. No. 11/203,937, (Aug. 31, 2009),2 pages.Applicant
- “Non-Final Office Action”, U.S. Appl. No. 11/567,149, (Sep. 8, 2009),5 pages.Applicant
- “Final Office Action”, U.S. Appl. No. 10/955,666, (Oct. 14, 2009),24 pages.Applicant
- “Advisory Action”, U.S. Appl. No. 10/942,528, (Oct. 26, 2009),3 pages.Applicant
- Reagan, Moore W., et al., “Collection-based persistent digital archives”, U.S. Appl. No. 60/191,662, filed Mar. 23, 2000, 133.Applicant
- “Non-Final Office Action”, U.S. Appl. No. 11/227,550, (Aug. 3, 2009),10 pages.Applicant
- “Notice of Allowance”, U.S. Appl. No. 11/203,937, (Aug. 3, 2009),7 pages.Applicant
- “Foreign Office Action”, Application Serial No. 200610051554.X, (Jul. 10, 2009),11 pages.Applicant
- “Non-Final Office Action”, U.S. Appl. No. 11/234,767, (Aug. 12, 2009),24 Pages.Applicant
- “Final Office Action”, U.S. Appl. No. 10/977,198, (Aug. 19, 2009),15 pages.Applicant
- “Non-Final Office Action”, U.S. Appl. No. 10/939,588, (Aug. 27, 2009),28 pages.Applicant
- “Final Office Action”, U.S. Appl. No. 11/170,521, (Sep. 8, 2009),12 pages.Applicant
- Cover, XML Forms Architecture, retrieved at << http://xml.coverpages.org/xfa.html>> on Aug. 17, 2006, Coverpages, Jun. 16, 1999.Applicant
- Raggett, “HTML Tables”, retrieved on Aug. 6, 2006, at <<http:www://is-edu.hcmuns.edu.vn/WebLib/books/Web/Tel/html3-tables.html>>, W3C Internet Draft, Jul. 7, 1995, pp. 1-12.Applicant
- “Webopedia Computer Dictionary” retrieved on May 9, 2006, at <<http://www.pewebopedia.com/TERM/O/OLE.html>>, Jupitermedia Corporation, 2006, pp. 7.Applicant
- “Notice of Allowance”, U.S. Appl. No. 10/404,312, (Jan. 12, 2009),12 pages.Applicant
- “Final Office Action”, U.S. Appl. No. 10/857,689, (Jan. 6, 2009),23 pages.Applicant
- “Non Final Office Action”, U.S. Appl. No. 10/977,198, (Feb. 2, 2009),15 pages.Applicant
- “Non Final Office Action”, U.S. Appl. No. 10/939,588, (Feb. 18, 2009),40 pages.Applicant
- “Non Final Office Action”, U.S. Appl. No. 10/976,451, (Feb. 23, 2009),39 pages.Applicant
- “Non final Office Action”, U.S. Appl. No. 11/234,767, (Feb. 26, 2009),37 pages.Applicant
- “Notice of Allowance”, U.S. Appl. No. 11/167,514, (Mar. 11, 2009),6 pages.Applicant
- “Non Final Office Action”, U.S. Appl. No. 10/942,528, (Mar. 6, 2009),31 pages.Applicant
- “Non Final Offfice Action”, U.S. Appl. No. 11/170,521, (Jan. 21, 2009),86 pages.Applicant
- “Foreign Office Action”, Application Serial No. 2,412,611, (Feb. 9, 2009),6 pages.Applicant
- “Foreign Office Action”, Application Serial No. 200610003709.2, (Jan. 9, 2009),8 pages.Applicant
- “EP Office Action”, Application Serial No. 06111546.5, (Oct. 15, 2008),5 pages.Applicant
- “Notice of Re-Examination”, Application Serial No. 01813138.7, (Mar. 11, 2009),27 pages.Applicant
- Hall, Richard S., “Agent-based Software Configuration and Development”, http://www.doc.ic.ac.uk/˜alw/edu/theses/hall-phd-0599.pdf on Jun. 8, 2009, Thesis of the University of Colarado, (May 1, 1999),182 pages.Applicant
- “Notice of Allowance”, U.S. Appl. No. 10/988,718, (Apr. 9, 2009).Applicant
- “Final Office Action”, U.S. Appl. No. 11/107,347, (Apr. 2, 2009),15 pages.Applicant
- “Restriction Requirement”, U.S. Appl. No. 11/227,550, (Apr. 2, 2009),8 pages.Applicant
- “Non Final Office Action”, U.S. Appl. No. 10/955,665, (Apr. 2, 2009),19 pages.Applicant
- “Non Final Office Action”, U.S. Appl. No. 10/988,720, (Apr. 2, 2009),19 pages.Applicant
- “Final Office Action”, U.S. Appl. No. 11/203,818, (Apr. 14, 2009),31 pages.Applicant
- “Final Office Action”, U.S. Appl. No. 11/044,106, (Apr. 13, 2009),20 pages.Applicant
- “Final Office Action”, U.S. Appl. No. 11/226,044, (Apr. 20, 2009),24 pages.Applicant
- “Final Office Action”, U.S. Appl. No. 11/203,937, (May 7, 2009),13 pages.Applicant
- “Non Final Office Action”, U.S. Appl. No. 10/955,666, (May 7, 2009),28 pages.Applicant
- “Non Final Office Action”, U.S. Appl. No. 10/876,433, (Apr. 24, 2009),62 pages.Applicant
- “Non Final Office Action”, U.S. Appl. No. 10/916,692, (Apr. 30, 2009),14 pages.Applicant
- “HP Blade Sever BH Series Operating System Guide”, Hewlett-Packard,(Jul. 2002).Applicant
- “Non Final Office Action”, U.S. Appl. No. 09/599,809, (May 13, 2009).Applicant
- “Final Office Action”, U.S. Appl. No. 11/036,910, (Jun. 1, 2009),15 pages.Applicant
- “Non Final Office Action”, U.S. Appl. No. 10/857,689, (Jun. 11, 2009),25 pages.Applicant
- “Non FInal Office Action”, U.S. Appl. No. 11/095,254, (Jun. 8, 2009),21 pages.Applicant
- “Foreign Office Action”, Application Serial No. 2002-503702, Final Notice of Rejection,(Jun. 5, 2009).Applicant
- Kaori, Iwantani et al., “Perfect Manual of Clarisworks 4.0 for Macintosh”, 1st Edition, Japan,(07/297),pp. 153-167.Applicant
- Noriko, Matsushita “Step-up Training of Clarisworks (tabulation), Successful Use of Spreadsheet and Tabulation”, Mac People, vol. 4, No. 19,(Oct. 1, 1998),pp. 138-139.Applicant
- Akihiro, Senda “Word 2000, Conservative- Looking but ‘Attentive’ New Function”, NIKKEI PC 21, vol. 4, No. 8,(Aug. 1, 1999),pp. 115-116.Applicant
- Yasuji, Fukuhara “Clarisworks, Introduction to Business Document Construction, No. 4, Estimate”, NIKKEI MAC, No. 14,(May 17, 1994),pp. 197-204.Applicant
- “Non-Final Office Action”, U.S. Appl. No. 11/170,521, (Dec. 17, 2009),11 pages.Applicant
- “Notice of Allowance”, U.S. Appl. No. 10/990,152, (Dec. 21, 2009),6 pages.Applicant
- Honkala, Mikko et al., “Multimodal Interaction with XForms”, ICWE '06, (2006),pp. 201-208.Applicant
- “Final Office Action”, U.S. Appl. No. 11/295,178, (Dec. 24, 2009),38 pages.Applicant
- Altova, “Altova Tools for XPath 1.0/2.0”, Retrieved from: <http://www.altova.comdev— portal— xpath.html> on Nov. 7, 2007, Altova,12 pages.Applicant
- “Non Final Office Action”, U.S. Appl. No. 11/295,178, (May 27, 2009),29 pages.Applicant
- “Non Final Office Action”, U.S. Appl. No. 10/990,152, (May 28, 2009),16 pages.Applicant
- “Final Office Action”, U.S. Appl. No. 10/976,451, (Jul. 2, 2009),13 pages.Applicant
- “Non-Final Office Action”, U.S. Appl. No. 11/234,767, (Aug. 12, 2009),24 pages.Applicant
- “Final Office Action”, U.S. Appl. No. 10/916,692 Nov. 16, 2009, 10 pages.Applicant
- “Final Office Action”, U.S. Appl. No. 11/218,149 Nov. 16, 2009, 18 pages.Applicant
- “Final Office Action”, U.S. Appl. No. 11/072,087 Nov. 16, 2009, 9 pages.Applicant
- “Foreign Office Action”, Mexican Patent Application No. PA/a/2006/002493 Sep. 14, 2009, 5 pages.Applicant
- “Non-Final Office Action”, U.S. Appl. No. 10/976,451 Oct. 29, 2009, 14 pages.Applicant
- “Non-Final Office Action”, U.S. Appl. No. 11/557,931 Oct. 20, 2009, 27 pages.Applicant
- “Non-Final Office Action”, U.S. Appl. No. 11/036,910 Nov. 13, 2009, 9 pages.Applicant
- “Notice of Allowance”, U.S. Appl. No. 10/955,665 Nov. 3, 2009, 8 pages.Applicant
- “Notice of Allowance”, U.S. Appl. No. 11/095,254 Nov. 18, 2009, 8 pages.Applicant
- “Notice of Allowance”, U.S. Appl. No. 10/942,528 Dec. 3, 2009, 8 pages.Applicant
- Van Hoff, Arthur et al., “The Open Software Description Format”, Retrieved from: <www.w3.org/TR/NOTE-OSD> on Aug. 18, 2009 Aug. 13, 1997, 10 pages.Applicant
- Webopedia, “Definition of Network”, Retrieved from: <http://www.webopedia.com/Term/n/network.html> cited by examiner Sep. 1, 1996, 2 pages.Applicant
- Webopedia, “Definition of OLE”, Retrieved from: <http://www.webopedia.com/Term/O/OLE.html> cited by examiner May 16, 1998, 3 pages.Applicant
- Webopedia, “Definition of OpenDoc” Retrieved from: <http://www.webopedia.com/Term/O/OpenDoc.html> cited by examiner Sep. 18, 1997, 3 pages.Applicant