This invention relates generally to the technology of collaborative processing and, more particularly, relates to a system and method for processing and presenting shared documents over a network.
As computers and computer networks become more pervasive in the home and workplace, many old methods for performing everyday tasks are being replaced or streamlined through the use of computer networking technology. For example, many employees are now able to have a virtual presence in their workplace by logging into a computer network maintained by their employer. One of the most striking developments in computer networking technology has been the advent of remote collaboration.
One of the oldest forms of processing data is the meeting or conference, whereby multiple individuals focus their attention on common subject matter to arrive at a joint decision, consensus, or product. Increasingly, such meetings are now taking place virtually over computer networks through the use of application sharing technologies. Such technologies enable a sharing user to share an application with various viewing users. The display produced by the application running on the sharer's computer is made available via a computer network to the viewers' computers. In some cases, the sharer may pass control of the application to a viewer, whereby the viewer's control inputs are then communicated back to the sharer's computer, where the actions associated with the inputs are executed, and the resulting changed display is shared back out to the viewers.
Although such systems are useful, and indeed critical to some users, application sharing systems remain fairly complex in their interface to users. In particular, an unsophisticated viewer may be confused or distracted by the presentation on his screen of the myriad of information associated with an application at a given moment, regardless of which window or item is currently being focused upon by the group. For example, if several document for the same application are shared out, a viewer may focus on a document that is interesting to him but that is not currently the subject of the collaborative effort. In addition, an unsophisticated sharer may share an application out to viewers without realizing that some windows of the application contain confidential or sensitive information that is not intended to be shared with the viewers.
A more simplistic and secure sharing experience is needed whereby a viewer's attention can be focused more directly on the document that is currently of concern, and whereby a sharer is not at risk of unknowingly sharing out confidential or sensitive information.
Application sharing can be understood as the use of a multipoint network program wherein the screen data and mouse movement of one endpoint, generally known as the sharer, is broadcast to and displayed on other endpoints, known as viewers. In some cases, the viewer may also exert control over a process corresponding to the displayed data. Typically, application sharing will either involve the sharing of the sharer's entire desktop or the windows and inputs corresponding to a specific process or processes.
To alleviate the problems inherent in prior application sharing technologies, the present invention generates a simplified viewer interface in an embodiment of the invention and a less complek sharing experience in a further embodiment. For example, a multiple document interface (MDI) parent window may be displayed in an embodiment of the invention only when specific MDI children are the forward document on the sharer's display. In a further embodiment of the invention, top-level windows in the same process are displayed in a mutually exclusive manner, so that two top-level parent windows, usually Single Document Interface (SDI) windows corresponding to a process, are not displayed simultaneously. In a further embodiment, a document associated with a process may be selected for sharing individually without sharing every document associated with that same process.
The mechanisms described herein for accomplishing the aforementioned behavior include in various embodiments of the invention mechanisms for marking windows and for reading the marks in order to properly display the appropriate windows. For example, a mechanism is described for marking windows so that the application sharing system will use a single document sharing presentation, either MDI or SDI type, when sharing the window. Furthermore, a mechanism is provided for marking MDI child windows under an MDI parent window to differentiate shared windows from unshared windows, and a system is described for reading the marks to properly display the appropriate windows to viewers. Further a process is described whereby a document associated with a certain process may be selected for sharing individually without sharing every document associated with that process.
While the appended claims set forth the features of the present invention with particularity, the invention, together with its objects and advantages, may be best understood from the following detailed description taken in conjunction with the accompanying drawings of which:
Turning to the drawings, wherein like reference numerals refer to like elements, the invention is illustrated as being implemented in a suitable computing environment. Although not required, the invention will be described in the general context of computer-executable instructions, such as program modules, being executed by a personal computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the invention may be practiced with other computer system configurations, including hand-held devices, multi-processor systems, microprocessor based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. The invention is primarily for use in a networked environment and may further be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.
The invention is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that are suitable for use with the invention include, but are not limited to, personal computers, server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
An exemplary system for implementing the invention includes a general-purpose computing device in the form of a computer 110. Components of the computer 110 generally include, but are not limited to, a processing unit 120, a system memory 130, and a system bus 121 that couples various system components including the system memory to the processing unit 120. The system bus 121 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. By way of example only, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Associate (VESA) local bus, and Peripheral Component Interconnect (PCI) bus also known as Mezzanine bus.
Computer 110 typically includes a variety of computer readable media. Computer readable media can be any available media that can be accessed by computer 110 and includes both volatile and nonvolatile media, removable and non-removable media. By way of example only, and not limitation, computer readable media may comprise computer storage media and communication media.
Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by computer 110.
Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics (such as, for example, voltage or current level, voltage or current pulse existence or nonexistence, voltage or current pulse width, voltage or current pulse spacing, etc.) set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. Combinations of any of the above are also included within the scope of computer readable media.
The system memory 130 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 131 and random access memory (RAM) 132. A basic input/output system 133 (BIOS), containing the basic routines that help to transfer information between elements within computer 110, such as during start-up, is typically stored in ROM 131. RAM 132 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 120. By way of example, and not limitation,
The computer 110 may also include other removable/non-removable, volatile/nonvolatile computer storage media. By way of example only,
The drives and their associated computer storage media, discussed above and illustrated in
In the implementation of an embodiment of the invention, the computer 110 operates in a networked environment using logical connections to one or more remote computers, such as a remote computer 180. The remote computer 180 may be a personal computer, a router, a network PC, a peer device or other common network node, and in any case the remote computer or computers typically include many or all of the elements described above relative to the personal computer 110, although only a memory storage device 181 has been illustrated in
The computer 110 should include facilities for accessing the networks to which it is attachable. For example, when used in a LAN networking environment, the personal computer 110 is connected to the LAN 171 through a network interface or adapter 170. Another node on the LAN, such as a proxy server, may be further connected to a WAN such as the Internet. When used in a WAN networking environment, the computer 110 typically includes a modem 172 or other means for establishing communications directly or indirectly over the WAN 173, such as the Internet. The modem 172, which may be internal or external, may be connected to the system bus 121 via the user input interface 160, or other appropriate mechanism. In a networked environment, program modules depicted relative to the personal computer 110, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation,
Herein, the invention is described with reference to acts and symbolic representations of operations that are performed by one or more computers, unless indicated otherwise. As such, it will be understood that such acts and operations, which are at times referred to as being computer-executed, include the manipulation by the processing unit of the computer of electrical signals representing data in a structured form. This manipulation transforms the data or maintains it at locations in the memory system of the computer, which reconfigures or otherwise alters the operation of the computer in a manner well understood by those skilled in the art. The data structures where data is maintained are physical locations of the memory that have particular properties defined by the format of the data. However, while the invention is being described in the foregoing context, it is not meant to be limiting as those of skill in the art will appreciate that various of the acts and operation described hereinafter may also be implemented in hardware.
Specific exemplary architectures of the sharer computer 207 and a viewer computer 201 are illustrated in greater detail schematically in
A user mode process of interest 321 is running on sharer computer 307. Such a process is any process, such as a program, from which information is being shared to one or more viewers such as viewer 307. The process of interest 321 will be referred to hereinafter as the shared process, with the understanding that the information generated by the process 321 need not be shared completely. That is, the information shared may consist of a subset of the information generated by the process 321. The shared process will often be a process that can also be used in a non-shared manner. For example, a word processing program may be used by the sharer for non-collaborative document production, and may then be used in a shared manner for group editing of the same or another document. In either mode, the process 321 and the operating system of the sharer computer 307 perform certain steps. For example, whether or not the process 321 is shared, the output of the process 321 will still generally be output to the graphics display driver of the sharer computer 307.
If the application sharing program 323 is active, such as during a sharing session, then other processes unique to the collaborative setting also take place. In particular, the application sharing program 323, which is communicably linked to the process 321, receives information from the process 321 and transfers information to the process 321. Although the bi-directional flow of information between the process 321 and application sharing program is illustrated by a double arrow, note that the mechanisms for transfer may vary depending upon direction. For example, the process 321 need not even be aware of the presence or operation of the application sharing program 323 for the application sharing program 323 to receive information from the process 321.
Typically, the application sharing program 323 is communicably linked to an interceptor filter placed in the display path for the process 321. Such a filter may be placed just before the graphics device interface (GDI) or similar interface in such a manner as to read, in a non-intrusive manner, all information sent to the screen of computer 307 by the process 321. In the WINDOWS operating system produced by MICROSOFT of Redmond, Wash., when an application wants to display an object, it calls a GDI function and sends the various parameters for the object. In turn, the GDI sends commands to the screen to cause it to actually display the object. In contrast, the mechanism for transferring information from the application sharing program 323 to the process 321 need not involve the display path at all, and may instead involve a direct transfer of information.
Regardless, the application sharing program 323 is also communicably linked to the networking facilities 325 of the sharer computer 307. Such facilities 325 may include any networking communications stack or other protocol arrangement as well as the hardware required for accessing the network connection 319, as discussed above with respect to
The general operation of the architecture and components illustrated in
The application sharing program 327 resident on the viewer machine 329 should be running before actual sharing of documents is attempted, and may be run in the same manner as described above. At this point, document sharing may occur. That is, of all the documents selected as shared by the user of sharer machine 307, data corresponding to the shared window that is currently active on sharer machine 307 is transmitted to the viewer computer 301 for display on the screen or display device of that computer 301 in an embodiment of the invention.
The flow chart illustrated in
a shows one presentation of a list 501 of sharable documents in an embodiment of the invention. Note that documents associated with the same process may be grouped spatially, as with the group 503 of documents associated with the application MICROSOFT Word produced by MICROSOFT Corporation of Redmond, Wash. As discussed above, the list 501 preferably omits documents that are not sharable, if any.
In step 403, a user of the sharer machine makes a selection from the presented list of sharable documents, which selection is received by the application sharing program. Unlike prior systems, it is possible for the user to select some documents associated with a process while not selecting other documents associated with the same process. In this manner, the sharing of documents is explicit from the sharer's viewpoint, thus eliminating the danger of accidentally sharing an unselected document simply because it is associated with the same process as a selected document.
In step 405, the application sharing program updates the display of list 501 to indicate the user's selection, and then transitions to step 407 where it waits for further user input. If from step 407 a user selection of another document is detected, the process flows back to step 405 to update the display of the list, and then follows the steps that logically follow from that step.
If from step 407 it is determined that the user has indicated completion of the selection process such as by activating the “OK” button 515, then the process flows to step 409, where it marks the windows for the selected documents as shared and then completes at step 411. Note that the user is preferably able to cancel the document selection process and, in an embodiment of the invention, remove the list presentation from the display at any time during the process by selecting an appropriate indicator, such as the “cancel” button 517. Furthermore, in an embodiment, the list may be changed by the application sharing program during the selection process if a new window is opened. Alternatively, a user may be prevented from opening new windows during the selection process, or windows so opened may not be added to the list.
The user is preferably able to deselect any selected document during the selection process, and the display of the sharable document list is preferably modified in such a case to indicate that the relevant item is no longer selected for sharing. Selection and deselection may entail the user placing the cursor over and clicking on a select field 519 adjacent to each document name in the list 501.
The marking of selected documents, as referenced above in the discussion of the selection process, is preferably accomplished by associating an item of information with the window of interest. In an embodiment, a global atom is used to mark a window as shared. As will be appreciated by those of skill in the art, an atom is an integer that identifies a character string, or atom name, in an atom table. The atom table is defined by the operating system to store character strings and their associated atoms. A global atom table is available to all applications, whereas a local atom table can be used only by the application that created it.
In addition to enabling the document-by-document selection of documents to be shared, the invention additionally or alternatively enables, in an embodiment, a single document viewer interface. That is, a most recently active shared window is identified, and although there may be other shared windows, the viewer display shows only the most recently active shared document window. In order to facilitate the aforementioned function in an embodiment of the invention, each window is marked by an additional mark, or atom, as will described in greater detail below.
There exist multiple different types of user interfaces supported by applications that use a graphical display. The two primary types are Single Document Interface (SDI) and Multiple Document Interface (MDI). An SDI application allows the display and manipulation of only one document at a time. SDI applications may require the user to reload the application for each document to be worked on concurrently. An MDI application allows the display and manipulation of more than one document at the same time. Typically there is only one instance of an MDI application running even when multiple documents associated with that application are being displayed. MICROSOFT Word by MICROSOFT Corporation of Redmond, Wash. is an example of an SDI application while MICROSOFT Excel also by MICROSOFT Corporation is an example of an MDI application.
In an embodiment of the invention, in addition to being marked as shared, each window is marked, again using a global atom, for single document sharing, meaning that only one document according to a currently active process will be shared if that is the current document, and that with respect to MDI applications, only the forward child window will be shared. With respect to an MDI application, if document-by-document sharing is enabled as described above, then each child window is preferably also marked as shared if the window has been selected to be shared. Thus, whether an SDI or MDI application is associated with the current active shared window, only that window will be shared in an embodiment of the invention.
The following discussion sets forth in greater detail the manner in which windows are marked with these additional marks, and the manner in which the windows list of shared windows is constructed using these marks. Referring to the flow chart of
When the process is initiated by the creation of a new window, it commences at node 601 and progresses to decision 603. At decision 603, the process determines whether the class of the top level parent window of the window being analyzed is found in a single document mark map. The single document mark map identifies all classes that are known to be associated with either of an SDI or MOI application. An exemplary single document mark map 801 usable in an embodiment of the invention is illustrated in
In an embodiment of the invention, the map is pre-populated with the pertinent information. However, it is possible that applications unknown to the producer of the map may also be designed to take advantage of single document sharing. Therefore, these applications can preferably register information to be added to the map. Thus the map may be continually expanded to account for additional applications as needed. One implementation of such a registration process using the WINDOWS brand operating system produced by MICROSOFT CORPORATION of Redmond, Wash. is to allow applications to add a specific set of registry keys into a predetermined location in the WINDOWS registry. These keys would contain the data needed to describe the application's characteristics for entry in the map 801. When the application sharing program starts on the sharer's machine, these entries are read from the registry and added to the map 801.
If at step 603 it is determined that the top level parent window of the window being analyzed is in the single document mark map, then at step 605, the process marks the top level parent window with a single document mark. The single document mark, preferably an atom, contains information regarding whether the window is associated with an SDI or MDI application. For MDI applications, the single document mark also serves as a key into a map of information about the particular MDI application, such as window class name for the document windows of the application. Note that the single document mark is preferably added to the relevant windows by the application sharing program, but may alternatively be added by the application itself in an embodiment of the invention. In that embodiment, a small API set is exposed to external applications by the application sharing program, so that the external application can place the single document mark on the windows that it creates where appropriate. Further in this embodiment, an external MDI application can preferably register the windows class of its document windows via the application sharing program. If instead at step 603 it is determined that the top level parent window of the window being analyzed is not in the single document mark map, then the process bypasses step 605 and proceeds directly to step 607.
It is determined at step 607 whether the window being analyzed is shared. In particular, a window that is currently to be shared will be have been accordingly marked via a global atom as discussed above with respect to
Regardless of the route followed to arrive at step 609, the process marks the analyzed window's top level parent as shared at that step, and then proceeds to step 611. At step 611, a procedure analogous to that of step 603 is carried out. In particular, it is determined at step 611 whether the class of the top level parent window of the window being analyzed is found in the single document mark map. If it is determined at this step that the class of the top level parent window of the window being analyzed is not found in the single document mark map, then the process terminates at node 612. If it is determined instead at this step that the class of the top level parent window is found in the single document mark map, then the process continues to step 613.
At step 613, it is determined whether the window under analysis is an MDI child window. If it is determined that the window under analysis is not an MDI child window, then the process terminates at node 614. If instead it is determined that the window under analysis is an MDI child window, then the process proceeds to the final step 615. At step 615, the window being analyzed is marked with a single document mark. Similar to the other marking processes described above, this marking is accomplished by way of a global atom in an embodiment of the invention.
It can be seen that after completion of the process described with respect to
Referring to the windows list construction process illustrated in
From step 704, the process of constructing the window list proceeds to decision 708, at which point it is determined whether there is another top level window to be analyzed that has not yet been processed. If there is no other top level window left to be analyzed, the window list construction process terminates at node 713. If instead there is another top level window left to be analyzed, the process moves from decision 708 back to 703 to execute steps 703 and the steps that logically follow anew for the window that is still to be analyzed.
If at step 703 it is instead determined that the current top level window under analysis is marked as shared, then at step 705 it is determined whether the window has a single document mark. If it is determined at step 705 that the top level window under analysis does not have a single document mark, then at step 706, the top level window under analysis is added to the window list as shared, and the process continues to step 708 and the steps that logically follow. If it is instead determined at step 705 that the top level window under analysis does have a single document mark, then at step 707 the process determines whether the root owner of the window under analysis is the last active shared window. In other words, although there may be a number of documents that the user has selected to share, only one of those documents is the active shared window at any given time in an embodiment of the invention.
If at step 707 it is determined that the root owner of the window under analysis is not the last active shared window, then the process adds the window under analysis to the window list as unshared at step 704 and executes the steps that logically follow. If instead it is determined at step 707 that the root owner of the window under analysis is the last active shared window, then the process flows to step 709, whereat it is determined whether the top level parent of the window under analysis is MDI window, i.e. whether it is associated with an MDI application. If it is determined at step 709 that the top level parent of the window under analysis is not an MDI window, then the process adds the window under analysis to the window list as shared at step 706 and executes the steps that logically follow. If instead it is determined at step 709 that the top level parent of the window under analysis is an MDI window, then the process moves to step 711.
At step 711, it is determined whether the top z-order MDI child of the top level parent is marked with the single document mark. If it is determined that the top z-order MDI child of the top level parent is marked with the single document mark, then the process adds the window under analysis to the window list as shared at step 706 and executes the steps that logically follow. If instead it is determined that the top z-order MDI child of the top level parent is not marked with the single document mark, then the window under analysis is added to the window list as unshared at step 704 and the process executes the steps that logically follow.
In addition to the window list that is constructed as described above, an order packet is also periodically generated to allow the viewer to accurately construct the shared view. In particular, the drawing commands collected from the chained display driver process described earlier are periodically packaged in an order packet that is sent to the viewer machine along with the window list. The viewer machine uses the order packets to construct a hidden picture of the sharer's display, and then analyzes the information in the window list to determine what portions of the hidden picture to reveal to the viewer. For this purpose, the window list contains an indication of the regions of the screen that each window covers, the title of the each window, and an indication as to whether each window is shared or unshared as described above with reference to
From the above discussion, it be seen that the invention provides a more secure sharer experience in an embodiment, as well as a more simplified viewer experience in another aspect. For example, when the sharer has on its display windows corresponding to shared documents and windows corresponding to unshared documents, the aforementioned processes result in a document-centric viewing experience whenever possible. The unshared windows will of course not be displayed at the viewer, and several shared windows may also not be displayed. If there are multiple shared windows, generally only the current or most recently active shared window will be displayed. However, when the top-level parent of a shared window does not support single document display, i.e. when the corresponding application is not found in the single document mark map, then in an embodiment of the invention that shared window will be displayed even when it is not the current active window on the sharer.
The resultant viewer experience is that, with the exceptions noted above, the viewing user generally sees a single shared window. The viewing user need not try to track which of many displayed shared windows is the current active window, because their attention is always focused on the current active shared window and its contained document. If the most recently active shared window on the sharer changes, the displayed window on the viewer machine is replaced by the current most recently active shared window.
However, even if all of the applications associated with presently shared documents are listed in the single document mark map, not all new windows will replace the current window on the viewer display. For example, if a shared window parents a pop-up window, such as a dialog box or menu, both windows will preferably be displayed at the viewer. Thus, in general terms, for a single document interface application, the display protocol used at the viewer is to display the top-most window marked as shared, and its children. As well, the viewer may display any other shared window not marked with the single document mark. For a multiple document application whose parent window is marked with the single document mark, the protocol is to show the parent window and the top-level child if the top-level child is marked as shared, and otherwise to not show either the parent or child. If a window appears to be an MDI parent but is not explicitly marked with the single document mark, then all shared children are nonetheless shown simultaneously to the extent they are visible at the sharer.
Typically, an API query is used to determine the top z-order MDI child. However, it may be computationally expensive to repeatedly recompute the z-order of the children windows to find the top z-order child. Thus, in an embodiment of the invention, the identity of the top z-order child is stored for future reference if the child z-order has not changed, such as in another atom associated with the parent window.
It will be appreciated from the above discussion that the application sharing program performs its tasks only when it is running. Thus, when application sharing is started up, it may be that numerous windows exist already that need to be analyzed and possibly marked according to the aforementioned processes. For processes associated with one or more windows, none of which are marked or selected as shared, the application sharing program may not mark the windows with any marks, including the single document mark, since none will be shared. However, once one window associated with a process is marked or selected as shared, the application program preferably treats all windows associated with that process according to the marking rules described above.
Note that for MICROSOFT brand Office application windows, a task bar item may be created for each document associated with an MDI parent window. A child window can be moved to the top in z-order by activating the associated task bar item. In an embodiment of the invention, this mechanism is used to shift the display at the viewer.
All of the references cited herein, including patents, patent applications, and publications, are hereby incorporated in their entireties by reference. That is, each and every part of every such reference is considered to be part of this disclosure, and therefore no part of any such reference is excluded by this statement or by any other statement in this disclosure from being a part of this disclosure.
In view of the many possible embodiments to which the principles of this invention may be applied, it should be recognized that the embodiments described herein with respect to the drawing figures are meant to be illustrative only and should not be taken as limiting the scope of invention. For example, those of skill in the art will recognize that the elements of the illustrated embodiment shown in software may be implemented in hardware and vice versa or that the illustrated embodiment can be modified in arrangement and detail without departing from the spirit of the invention. Furthermore, although network connections are illustrated herein as lines, no limitation should thereby be imparted to the invention. Network connections may be circuit-switched, packet-switched, or otherwise, and may be transient or permanent, hard-wired or wireless, operating via any suitable protocol. Also note that although embodiments of the invention have been described largely by reference to a sharing program that is separate from the shared process, the sharing program may not be a stand alone program, but may be an integral part of the shared process itself, or may be a DLL or other in-process entity. Therefore, the invention as described herein contemplates all such embodiments as may come within the scope of the following claims and equivalents thereof.
This application is a divisional of U.S. patent application No. 10/115,529 filed Apr. 3, 2002 entitled “APPLICATION SHARING SINGLE DOCUMENTSHARING,”which applicatin is incoroperated herein in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4386416 | Giltner et al. | May 1983 | A |
4631521 | El-Sherbini | Dec 1986 | A |
4672459 | Kudo | Jun 1987 | A |
4677649 | Kunishi et al. | Jun 1987 | A |
4783834 | Anderson et al. | Nov 1988 | A |
4814987 | Miyao et al. | Mar 1989 | A |
4823122 | Mann et al. | Apr 1989 | A |
4882687 | Gordon | Nov 1989 | A |
4897799 | Le Gall et al. | Jan 1990 | A |
4965677 | Pennebaker et al. | Oct 1990 | A |
4974173 | Stefik et al. | Nov 1990 | A |
5008853 | Bly et al. | Apr 1991 | A |
5057916 | Krause et al. | Oct 1991 | A |
5077732 | Fischer et al. | Dec 1991 | A |
RE33894 | Bradley | Apr 1992 | E |
5172103 | Kita et al. | Dec 1992 | A |
5177622 | Yoshida et al. | Jan 1993 | A |
5179711 | Vreeland | Jan 1993 | A |
5206934 | Naef, III | Apr 1993 | A |
5210825 | Kavaler | May 1993 | A |
5241625 | Epard et al. | Aug 1993 | A |
5241653 | Collins et al. | Aug 1993 | A |
5255361 | Callaway et al. | Oct 1993 | A |
5287203 | Namizuka | Feb 1994 | A |
5298992 | Pietras et al. | Mar 1994 | A |
5319463 | Hongu et al. | Jun 1994 | A |
5390262 | Pope | Feb 1995 | A |
5404436 | Hamilton | Apr 1995 | A |
5408600 | Garfinkel et al. | Apr 1995 | A |
5485559 | Sakaibara et al. | Jan 1996 | A |
5491780 | Fyles et al. | Feb 1996 | A |
5550968 | Miller et al. | Aug 1996 | A |
5565886 | Gibson | Oct 1996 | A |
5608872 | Schwartz et al. | Mar 1997 | A |
5625809 | Dysart et al. | Apr 1997 | A |
5649104 | Carleton et al. | Jul 1997 | A |
5655152 | Ohnishi et al. | Aug 1997 | A |
5673371 | Koopman et al. | Sep 1997 | A |
5699524 | Ooishi et al. | Dec 1997 | A |
5717856 | Carleton et al. | Feb 1998 | A |
5727155 | Dawson | Mar 1998 | A |
5754873 | Nolan | May 1998 | A |
5758110 | Boss et al. | May 1998 | A |
5760769 | Petrie | Jun 1998 | A |
5781732 | Adams | Jul 1998 | A |
5815151 | Argiolas et al. | Sep 1998 | A |
5826051 | Porter et al. | Oct 1998 | A |
5831872 | Pan et al. | Nov 1998 | A |
5835713 | FitzPatrick et al. | Nov 1998 | A |
5847706 | Kingsley | Dec 1998 | A |
5864711 | Mairs et al. | Jan 1999 | A |
5874960 | Mairs et al. | Feb 1999 | A |
5933597 | Hogan | Aug 1999 | A |
5938724 | Pommier et al. | Aug 1999 | A |
5949435 | Brock et al. | Sep 1999 | A |
5986655 | Chiu et al. | Nov 1999 | A |
5995096 | Kitahara et al. | Nov 1999 | A |
6008804 | Pommier et al. | Dec 1999 | A |
6025871 | Kantor et al. | Feb 2000 | A |
6057835 | Sato et al. | May 2000 | A |
6167433 | Maples et al. | Dec 2000 | A |
6173315 | Deleeuw | Jan 2001 | B1 |
6191797 | Politis et al. | Feb 2001 | B1 |
6212547 | Ludwig et al. | Apr 2001 | B1 |
6216177 | Mairs | Apr 2001 | B1 |
6219044 | Ansberry et al. | Apr 2001 | B1 |
6230171 | Pacifici et al. | May 2001 | B1 |
6275223 | Hughes | Aug 2001 | B1 |
6285363 | Mairs et al. | Sep 2001 | B1 |
6292166 | Palmer et al. | Sep 2001 | B1 |
6304928 | Mairs | Oct 2001 | B1 |
6317777 | Skarbo et al. | Nov 2001 | B1 |
6329984 | Boss et al. | Dec 2001 | B1 |
6342906 | Kumar et al. | Jan 2002 | B1 |
6343313 | Salesky et al. | Jan 2002 | B1 |
6343316 | Sakata et al. | Jan 2002 | B1 |
6356279 | Halstead, Jr. et al. | Mar 2002 | B1 |
6380940 | Halstead, Jr. et al. | Apr 2002 | B1 |
6456305 | Qureshi et al. | Sep 2002 | B1 |
6460126 | Spilo et al. | Oct 2002 | B1 |
6469716 | Carter et al. | Oct 2002 | B1 |
6570590 | Dubrow et al. | May 2003 | B1 |
6577330 | Tsuda et al. | Jun 2003 | B1 |
6584466 | Serbinis et al. | Jun 2003 | B1 |
6584493 | Butler | Jun 2003 | B1 |
6601087 | Zhu et al. | Jul 2003 | B1 |
6654032 | Zhu et al. | Nov 2003 | B1 |
6687878 | Eintracht et al. | Feb 2004 | B1 |
6697846 | Soltis | Feb 2004 | B1 |
6823514 | Degenerato | Nov 2004 | B1 |
6825860 | Hu et al. | Nov 2004 | B1 |
6826595 | Barbash et al. | Nov 2004 | B1 |
6833844 | Shiota et al. | Dec 2004 | B1 |
6859928 | Wright | Feb 2005 | B2 |
6910188 | Keohane et al. | Jun 2005 | B2 |
6911987 | Mairs | Jun 2005 | B1 |
6925645 | Zhu et al. | Aug 2005 | B2 |
6973627 | Appling | Dec 2005 | B1 |
6982729 | Lange et al. | Jan 2006 | B1 |
7003728 | Berque | Feb 2006 | B2 |
7046253 | Long et al. | May 2006 | B2 |
7127460 | Nixon et al. | Oct 2006 | B2 |
20010000811 | May et al. | May 2001 | A1 |
20020010713 | Egilsson | Jan 2002 | A1 |
20020065919 | Taylor et al. | May 2002 | A1 |
20020075304 | Thompson et al. | Jun 2002 | A1 |
20020078088 | Kuruoglu et al. | Jun 2002 | A1 |
20020095399 | Devine et al. | Jul 2002 | A1 |
20020174181 | Wei | Nov 2002 | A1 |
20020184310 | Traversat et al. | Dec 2002 | A1 |
20030028610 | Pearson | Feb 2003 | A1 |
20030085922 | Wei | May 2003 | A1 |
20030103088 | Dresti et al. | Jun 2003 | A1 |
20030137522 | Kaasila et al. | Jul 2003 | A1 |
20030140044 | Mok et al. | Jul 2003 | A1 |
20030167339 | Zhu et al. | Sep 2003 | A1 |
20030189599 | Ben-Shachar et al. | Oct 2003 | A1 |
20030189601 | Ben-Shachar et al. | Oct 2003 | A1 |
20040024819 | Sasaki et al. | Feb 2004 | A1 |
20040066408 | Meyers et al. | Apr 2004 | A1 |
20040260717 | Albornoz et al. | Dec 2004 | A1 |
20050024389 | Mairs et al. | Feb 2005 | A1 |
20050027896 | Mairs et al. | Feb 2005 | A1 |
20050033817 | Wei | Feb 2005 | A1 |
20050055306 | Miller et al. | Mar 2005 | A1 |
20050216847 | Zhu et al. | Sep 2005 | A1 |
20060288389 | Deutscher et al. | Dec 2006 | A1 |
Number | Date | Country |
---|---|---|
WO 9926153 | May 1999 | WO |
Number | Date | Country | |
---|---|---|---|
20060136366 A1 | Jun 2006 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10115529 | Apr 2002 | US |
Child | 11344361 | US |