This invention relates to the field of electronic design automation. More specifically, embodiments of the invention pertain to architectures that allow multiple electronic design automation clients to perform operations on a common design.
Included under the broad category of “electronic design automation” are numerous software tools that assist in the development of integrated circuits (ICs), printed circuit boards (PCBs), and other electronics components and/or systems. In some cases, such software (operating on multiple computers) allows teams of designers to collaborate and simultaneously edit the same design. Those designers may be located in geographically-distant regions.
Although offering many advantages (or potential advantages), such computer-aided collaboration also presents a number of challenges. One such challenge relates to communication of design data over the Internet or other networks. Despite the complexity of many electronic designs, there is almost always a desire to minimize the amount of data that must be transmitted over a network. For example, numerous designers working on the same IC, PCB or other project may each be working from a local copy of the design. These multiple copies must be kept synchronized. Frequent synchronization is desirable so that each designer will be aware of the latest changes by other designers. However, increasing the frequency with which each local design copy is updated also increases the amount of data transmission across a network, and can result in slow system performance.
Synchronization can also pose other challenges. In some cases, the order in which certain edits are made to a design can become important. For example, dimensional rounding errors can accumulate as a design is changed. Altering the order in which those changes occur can affect the magnitude of the rounding errors. If edits to all local copies of a design are not performed in the same order, the different copies can become non-identical. Another synchronization challenge relates to conflicting edits made by different designers. Because of network latency, delays in updating a local copy of a design, or other reasons, a first designer may edit a local copy of a design without knowing that a second designer has previously made a conflicting edit. The first designer will usually be forced to reverse the edit he or she attempted to make. Although the editing software in use may automatically reverse the first user's edit, the process can still be time-consuming and inconvenient, and avoiding the need for such reversals is desirable. It would thus be helpful to avoid from the outset changing a local design copy in a manner that conflicts with another edit.
In at least some embodiments, users working at multiple clients work on the same design. A copy of the design is stored at each client. When a user provides input indicating a desire to modify the design in some way, the user's input is captured at the client and one or more commands created. The commands are not immediately executed. Instead, those commands are forwarded to a server. The server queues the commands received from all of the clients, and then forwards each of those commands back to each of the clients. Upon receiving commands from the server, each of the clients executes the commands in the order received. In this manner, all clients process design change commands in the same order.
In at least some embodiments, each client also maintains data indicating settings for each client in a current editing session. In particular, various design-editing software parameters may have values that affect the manner in which a design will be modified in response to a design change command. Those parameters may have different values in the software running on different clients. Before executing a design changing command, and so that each design change will be carried out in the same way on each client, each client resets it values for those parameters to match those of the client from which that command originated.
These and other features and advantages of the present invention will be readily apparent and fully understood from the following detailed description of preferred embodiments, taken in connection with the appended drawings.
The foregoing summary of the invention, as well as the following detailed description of preferred embodiments, is better understood when read in conjunction with the accompanying drawings, which are included by way of example, and not by way of limitation with regard to the claimed invention.
Certain embodiments of the invention are herein described by reference to design of a printed circuit board (PCB). However, PCB design is only one example of an electronic design automation (EDA) environment in which embodiments of the invention may be implemented. In other embodiments, aspects of the invention may be used for other types of design activities. Throughout this specification (including the claims), “design” is used in a broad sense to refer to a collection of data relating to a particular project to develop an electronic component or system. A PCB design includes data that is associated with a PCB, and may include such things as locations of traces (or routes), trace widths, via locations, locations and parameters for other components, layer data, etc. A PCB design may also include data that controls how other types of data can be added to the design. For example, a PCB design may include design rules that limit how close traces can be placed to one another, rules that require a minimum trace length or width, rules that limit certain users to editing certain portions of the design, etc.
Stored on client A (e.g., on hard drive 12) is a copy of a PCB design 1; various features of PCB design 1 can be viewed on display 11 of client A. In
Design changes initiated at other clients are processed in the same way. For example, input provided by a client B user (“user B”) is captured at client B, converted to appropriate commands and transmitted to the server. The server then forwards those commands to all clients for processing. Input from a client C user (“user C”) is similarly captured by one or more client programming threads on computer 30, converted to appropriate commands and forwarded to one or more server programming threads on computer 30. The server programming threads then forward the user C commands to all clients for processing. As described in more detail below, the server queues commands received from the clients and forwards those commands to each client in the order received.
At some future time, and as shown in
One component shown in
Although various software components are shown as separate blocks in
In Table 1, commands 120-134 are shown generically as descriptions of the desired actions placed between angled brackets. For example, a command to add an object is shown as “<add . . . >.” Similarly, commands to move or delete an object are shown as “<move . . . >” and “<delete . . . >,” respectively. A “<select . . . >” command corresponds to selection of a design object by a user in preparation of performing some action on that object.
Each command in Table 1 is generated by the input capture component at the client from which the desired change is being initiated. For example, user A could indicate a desire to move via 102 by placing a mouse-controlled cursor over the via, by pressing a mouse button, by moving the cursor to the desired location for the via, and then releasing the mouse button. When user A initially presses the mouse button after moving the cursor over via 102, input capture component 50A generates a command to indicate that user A has selected via 102. As explained in more detail below, this reserves via 102 for modification by user A and prevents other users from modifying via 102 while it is under the control of user A. Because trace 101 is connected to via 102, selecting via 102 automatically selects trace 101. When user A then releases the mouse button after having moved via 102 to a different location, input capture component 50A generates commands to move via 102 and to extend trace 101 to the new location of via 102. In at least some embodiments, a separate “release” command is not always generated. Instead, the command processor at each client is configured to automatically release an object upon certain events (e.g., completion of certain modifications, adding an object). In some embodiments, a user can explicitly indicate a wish to release an object the user previously selected (e.g., by highlighting an object and selecting “release” from a context menu). In such a case, the input capture component generates a command (e.g., “<release . . . >”) and transmits that command to the server, with the server then forwarding that command to all clients.
In some embodiments, and as also shown in Table 1, certain related commands may be concatenated or otherwise combined into a single command before those commands are transmitted to the server. For example, trace 101 is automatically selected when via 102 is selected, and it is thus convenient to combine those operations into command 120. As another example, a user moving via 102 would probably want to extend trace 101 connected to that via. Accordingly, it is also convenient to combine those operations into command 121. Of course, commands can also be bundled on other bases. As but one additional example, commands can be bundled based on those commands pertaining to a particular region of a design (e.g., an area of a predetermined size). In some cases, a user may specifically provide input indicating that a particular set of commands should be grouped and sent to the server at one time. Commands could also be grouped based on time (e.g., group all commands corresponding to user input within a predetermined time period). In other embodiments, some or all of these commands shown in Table 1 might not be combined. In some such embodiments, for example, selection or movement of a via would not automatically cause selection or movement of an attached trace (e.g., the user could indicate whether traces should be locked to or associated with vias or other objects and the locked objects moved together).
Forwarding component 62 operates by taking command 120 from the top of queue 60, by forwarding command 120 to the clients, and by moving the forwarded command from queue 60 to transcript storage 64. If there were more commands in queue 60, forwarding component 62 would proceed to the next command in queue 60 and repeat these steps. In
As described in more detail below, the command processing component next determines whether execution of the received command will require operation(s) upon one or more objects that have been selected by (and thus reserved for) other users. As also discussed below, the command processing component also determines whether executing the received command will result in an invalid action (i.e., cause objects to conflict or otherwise result in an error). Assuming the answer to both inquiries is no, the command processing component executes the received command and applies any resulting changes to the local copy of PCB design 100 in the database component.
In
Upon execution of the received command, the command processing component in each client changes the settings back to those of that client. For example, command processing component 52C would change the settings of client C back to “<C settings>” once a command originating from another client has been executed.
After command 120 is received from the server and processed by client A (not shown), user A is then able to make more changes to design 100. After a client sends a design-changing command to the server in at least some embodiments, the client will not accept certain types of user input until the pending command is received back from the server and processed by the client. Otherwise, and because the design changes corresponding to the pending command have not yet been made to the client's local copy of the design, the user might be attempting to make design changes without knowing the true state of the design.
In the present example, user A provides input corresponding to command 121 (time t2 in Table 1) after command 120 has been received from the server and processed by client A. Client A thus accepts that input, generates command 121, and forwards command 121 to the server.
In
In
Because command 125 was not originated by user B or user C, neither of those users is expecting PCB design 100 to be edited in the manner sought by command 125. Accordingly, it is generally not necessary to advise user B or user C that command 125 has been rejected. User A, however, is expecting the edit corresponding to command 125. Accordingly, user A is advised of the command rejection. In some embodiments, and as shown in
If the last command processed by client C was not the last command moved to transcript storage 64, the PCB design copy from client C may not include all changes that will be made as a result of all the commands that have been transmitted to the clients. In such a case, the server also provides the new client with the same commands previously provided to (but not yet processed by) client C. In the example of
In at least some embodiments, the input capture component and the command processing component of each client execute on the client's processor(s) as separate programming threads.
If it is determined in block 305 that the user input does not correspond to a “local only” action, the algorithm proceeds on the “no” branch to block 309. In block 309, the algorithm determines whether the last command transmitted to the server from the client executing the algorithm has been received back from the server and processed. In at least some embodiments, the algorithm checks the status of a flag corresponding to the last command sent to the server. That flag is set when a command is transmitted to the server, and is cleared after that command is received back from the server and processed by the client. If the last command sent to the server has not been received back from the server and processed, the algorithm proceeds on the “no” branch to block 311. In block 311, an error message is displayed to the user to advise that the input cannot be accepted until a pending command is completed. If the last command sent from the client has been received back from the server and processed, the algorithm proceeds on the “yes branch to block 315.
In block 315, the algorithm determines if the user input indicates the user is attempting to select an object currently selected by another user. This is similar to the determination previously described in connection with command 125 and
If it is determined in block 315 that the user is not attempting to select an object selected by another user, the algorithm proceeds on the “no” branch to block 319. In block 319, the algorithm determines if the user is otherwise attempting to perform an invalid action. For example, the user may try to place an object in a location that is already occupied by, or is too close to (based, e.g., on system or project design rules), another object. This is similar to the determination previously described in connection with command 134 and
If it is determined in block 319 that the user is not attempting to perform an invalid action, the algorithm proceeds on the “no” branch to block 323. In block 323, the algorithm generates one or more commands corresponding to the user input and sends those commands to the server. The algorithm then proceeds to block 325 and sets the flag (previously checked in block 309) indicating that there is a pending command from the client. The algorithm then loops back to block 301.
From block 405, the algorithm proceeds to block 407 and determines if the current command (i.e., the command currently being processed) originated at a client other than the client performing the
In block 415, the algorithm determines if the current command requires selection or other action on an object that has already been selected by another user (e.g., if a “selected/unselected” flag has a “selected” state). If not, the algorithm proceeds the “no” branch to block 423 (described below). Otherwise, the algorithm proceeds on the “yes” branch to block 417. In block 417, the algorithm determines if the identifier for the client originating the current command matches the identifier contained in the selected object. If the identifiers match, the algorithm proceeds on the “yes” branch to block 423. If the identifiers do not match, the algorithm proceeds on the “no” branch to block 419. In block 419, the algorithm determines if the current command originated from the client in which the
If it was determined at block 415 that the current command will not require selection or other action on a previously selected object, or if an identifier match was found in block 417, the algorithm determines (in block 423) whether the current command is attempting an invalid action. As previously discussed, an invalid action may be an action which will result in a conflict between design objects. An invalid action might also be an action which a particular user is not authorized to perform, an action which will cause a rule violation, etc. If the current command is attempting an invalid action, the algorithm proceeds on the “yes” branch to block 425. In block 425, the algorithm determines whether the current command originated at the client executing the algorithm. If so, processing continues to block 427. An error report (similar to the error report in
If it is not determined at block 423 that the current command seeks to perform an invalid action, the algorithm proceeds on the “no” branch from block 423 to block 429. In block 429, the current command is executed. Any changes required by the current command to the local copy of the PCB design at the executing client are made. From block 429, the algorithm proceeds to block 431. If the executing client settings were changed for the just-executed command, the algorithm proceeds on the “yes” branch to block 433 and returns the executing client to its original settings. From block 433, the algorithm returns to block 401. If the executing client settings were not changed for the just-executed command (e.g., client A just executed a command originating at client A), the algorithm returns to block 401 on the “no” branch.
If it was determined at block 501 that a new client is seeking to join the editing session, the algorithm proceeds on the “yes” branch from block 501 to block 511. In block 511, the algorithm requests from one of the current clients (e.g., client C in
In the algorithms of
If a client's settings are not automatically reset after processing a command from another client, those other-client settings may still be in place when a user attempts to provide design edit input. If, for example, a first client user provides input immediately after the first client has processed a command from a second client, the first client user might unknowingly request a design change based on second client settings. Accordingly, at least some of the alternate embodiments employing the
As can be appreciated by persons skilled in the art in view of the preceding description, at least some embodiments of the invention offer various advantages. Because clients and the server communicate design change commands instead of the design changes themselves, network communications are reduced. In particular, many commands to make particular design changes can be represented using substantially less data than would be required to describe the change once it has been made. Sending design changes to a server which queues all change requests and resends them to all clients allows changes to be made in the same order at each of those clients. Similarly, invalid changes can be prevented, thereby reducing the need to reverse changes.
In some embodiments, design change commands are communicated between clients and the server in the AMPLE scripting language (available from Mentor Graphics Corporation of Wilsonville, Oreg.), with only scripted commands being sent from clients to the server. However, the invention is not limited to a particular language, operating system, or other specific computer environment. There are numerous other variations that are within the scope of the invention. For example, data in addition to change commands (scripted or otherwise) may be communicated between clients and the server. Commands sent from a server to the client may be modified at the server, and may be returned to a client in a form which is not strictly identical to that in which the command was initially sent by the client. Indeed, the information sent by a client or server may not be an executable command. For example, a client might simply transmit information that briefly describes the desired change. The server could then generate an executable command and forward that command to all clients. In yet another variation, the server could receive information from a client briefly describing a desired change and the server may then send the clients the same or different information describing the same change, with the clients then creating executable commands.
In the above-described embodiments, the server did not store a copy of the design. Instead, client C was relied upon to serve as the primary database for the design. In other embodiments, however, the server may also store the design. In some such embodiments, the server includes software components to make changes to the design based on commands (or other requests) received from the clients.
In at least some embodiments, setting information is conveyed to the clients in other manners. For example, and rather than maintaining a context component at each client, each command forwarded from the server includes setting data associated with the command (e.g., as metadata, etc.). This setting data may be transmitted to the server from a client when the command is initially generated at the client.
In still other embodiments, a client display is updated to indicate that an object has been selected. The selection can be indicated in any of various ways. For example, bolding, highlighting, color changes, textual balloons, etc. can be used to show that an object has been selected.
In some embodiments, each command includes a command number or other type of index. This index is then used by each client to verify that commands are performed in the correct order. For example, several consecutive commands might have the following indices: 0002304, 0002305, 0002306 and 0002307. These indices can then be used by the client to confirm the commands are processed in the proper order. By way of illustration, some network protocols might cause commands to be delivered to clients in an order different from that in which the commands are forwarded by the server. The indices could also be used to detect that a command is missing. Continuing the prior example, the client might only receive commands 0002304, 0002305 and 0002307. Based on the indices received, the client could quickly determine that command 0002306 has been dropped. This could occur because of network problems or for any of various other reasons. Upon detecting the missed command, the client would then ask the server to resend command 0002306, and the client would not process command 0002307 (or subsequent commands) until command 0002306 had been received and processed. The server could similarly use such indices to confirm that it has received all commands transmitted from a particular client and/or to confirm the order of those commands.
Although several examples of carrying out the invention have been described, those skilled in the art will appreciate that there are numerous variations and permutations of the above described examples that fall within the spirit and scope of the invention as set forth in the appended claims. The algorithms, system configurations and other aspects described are merely examples. Modifications of the described algorithms, systems and aspects are within the scope of the invention, as are numerous other algorithms, configurations and aspects. It is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims. In the claims, various portions are prefaced with letter or number references for convenience. However, use of such references does not imply a temporal relationship not otherwise required by the language of the claims.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5107443 | Smith | Apr 1992 | A |
| 5258920 | Haller et al. | Nov 1993 | A |
| 5295081 | Habra | Mar 1994 | A |
| 5333312 | Wang | Jul 1994 | A |
| 5333315 | Saether et al. | Jul 1994 | A |
| 5333316 | Champagne et al. | Jul 1994 | A |
| 5339388 | Bates et al. | Aug 1994 | A |
| 5392400 | Berkowitz | Feb 1995 | A |
| 5452218 | Tucker et al. | Sep 1995 | A |
| 5515491 | Bates et al. | May 1996 | A |
| 5544067 | Rostoker et al. | Aug 1996 | A |
| 5555388 | Shaughnessy | Sep 1996 | A |
| 5583993 | Foster et al. | Dec 1996 | A |
| 5604680 | Bamji et al. | Feb 1997 | A |
| 5745747 | Chang et al. | Apr 1998 | A |
| 5751597 | Okano et al. | May 1998 | A |
| 5806058 | Mori et al. | Sep 1998 | A |
| 5809240 | Kumagai | Sep 1998 | A |
| 5826265 | Van Huben et al. | Oct 1998 | A |
| 5892900 | Ginter et al. | Apr 1999 | A |
| 5948057 | Berger et al. | Sep 1999 | A |
| 5950201 | Van Huben et al. | Sep 1999 | A |
| 5966707 | Van Huben et al. | Oct 1999 | A |
| 5983277 | Heile et al. | Nov 1999 | A |
| 6023565 | Lawman et al. | Feb 2000 | A |
| 6026230 | Lin et al. | Feb 2000 | A |
| 6094654 | Van Huben et al. | Jul 2000 | A |
| 6094658 | Araki | Jul 2000 | A |
| 6110213 | Vinciarelli et al. | Aug 2000 | A |
| 6110223 | Southgate et al. | Aug 2000 | A |
| 6134549 | Regnier et al. | Oct 2000 | A |
| 6134705 | Pedersen et al. | Oct 2000 | A |
| 6182115 | Cuomo et al. | Jan 2001 | B1 |
| 6240414 | Beizer et al. | May 2001 | B1 |
| 6289254 | Shimizu et al. | Sep 2001 | B1 |
| 6327594 | Van Huben et al. | Dec 2001 | B1 |
| 6356796 | Spruiell et al. | Mar 2002 | B1 |
| 6418552 | Osborn | Jul 2002 | B1 |
| 6424959 | Bennett et al. | Jul 2002 | B1 |
| 6442570 | Wu | Aug 2002 | B1 |
| 6484177 | Van Huben et al. | Nov 2002 | B1 |
| 6530065 | McDonald et al. | Mar 2003 | B1 |
| 6553555 | Green et al. | Apr 2003 | B1 |
| 6578174 | Zizzo | Jun 2003 | B2 |
| 6594799 | Robertson et al. | Jul 2003 | B1 |
| 6611848 | Bradley | Aug 2003 | B1 |
| 6654747 | Van Huben et al. | Nov 2003 | B1 |
| 6671699 | Black et al. | Dec 2003 | B1 |
| 6678871 | Takeyama et al. | Jan 2004 | B2 |
| 6678876 | Stevens et al. | Jan 2004 | B2 |
| 6678877 | Perry et al. | Jan 2004 | B1 |
| 6684379 | Skoll et al. | Jan 2004 | B2 |
| 6687710 | Dey | Feb 2004 | B1 |
| 6708313 | Pfeil et al. | Mar 2004 | B2 |
| 6711718 | Pfeil et al. | Mar 2004 | B2 |
| 6721922 | Walters et al. | Apr 2004 | B1 |
| 6751781 | Lin et al. | Jun 2004 | B2 |
| 6782511 | Frank et al. | Aug 2004 | B1 |
| 6845492 | Frank et al. | Jan 2005 | B1 |
| 6851094 | Robertson et al. | Feb 2005 | B1 |
| 6851100 | You et al. | Feb 2005 | B1 |
| 6931369 | Perry et al. | Aug 2005 | B1 |
| 6983232 | Nguyen et al. | Jan 2006 | B2 |
| 6983434 | Frank et al. | Jan 2006 | B1 |
| 7020853 | Skoll et al. | Mar 2006 | B2 |
| 7024433 | Arai et al. | Apr 2006 | B2 |
| 7036101 | He et al. | Apr 2006 | B2 |
| 7039892 | Mantey et al. | May 2006 | B2 |
| 7076491 | Tsao | Jul 2006 | B2 |
| 7103434 | Chernyak et al. | Sep 2006 | B2 |
| 7134096 | Brathwaite et al. | Nov 2006 | B2 |
| 7143134 | Petrie et al. | Nov 2006 | B2 |
| 7143341 | Kohli | Nov 2006 | B1 |
| 7219311 | Koga et al. | May 2007 | B2 |
| 7240309 | Saito et al. | Jul 2007 | B2 |
| 7246055 | Singh | Jul 2007 | B1 |
| 7305648 | Petunin et al. | Dec 2007 | B2 |
| 7337093 | Ramani et al. | Feb 2008 | B2 |
| 7546571 | Mankin et al. | Jun 2009 | B2 |
| 20020059054 | Bade et al. | May 2002 | A1 |
| 20020069220 | Tran | Jun 2002 | A1 |
| 20020120858 | Porter et al. | Aug 2002 | A1 |
| 20020144212 | Lev et al. | Oct 2002 | A1 |
| 20020188910 | Zizzo | Dec 2002 | A1 |
| 20030009727 | Takeyama et al. | Jan 2003 | A1 |
| 20030018655 | Arroyo et al. | Jan 2003 | A1 |
| 20030038850 | Stevens | Feb 2003 | A1 |
| 20030101425 | Makinen | May 2003 | A1 |
| 20030131332 | Pfeil et al. | Jul 2003 | A1 |
| 20040093397 | Chiroglazov et al. | May 2004 | A1 |
| 20040199891 | Bentley et al. | Oct 2004 | A1 |
| 20040210854 | Pfeil et al. | Oct 2004 | A1 |
| 20040225988 | Petunin et al. | Nov 2004 | A1 |
| 20040268283 | Perry et al. | Dec 2004 | A1 |
| 20050044518 | Petunin et al. | Feb 2005 | A1 |
| 20050080502 | Chernyak | Apr 2005 | A1 |
| 20050108663 | Bentley et al. | May 2005 | A1 |
| 20050114821 | Petunin et al. | May 2005 | A1 |
| 20050114865 | Petunin | May 2005 | A1 |
| 20050125763 | Lin et al. | Jun 2005 | A1 |
| 20050131783 | Jin | Jun 2005 | A1 |
| 20050160396 | Chadzynski | Jul 2005 | A1 |
| 20050237776 | Gropper et al. | Oct 2005 | A1 |
| 20050246672 | Bois et al. | Nov 2005 | A1 |
| 20050283746 | Tsai et al. | Dec 2005 | A1 |
| 20060095882 | Mankin et al. | May 2006 | A1 |
| 20060101368 | Kesarwani et al. | May 2006 | A1 |
| 20080034342 | Petunin et al. | Feb 2008 | A1 |
| 20080059932 | Pfeil et al. | Mar 2008 | A1 |
| Number | Date | Country |
|---|---|---|
| 0550370 | Jul 1993 | EP |
| 0558006 | Sep 1993 | EP |
| 750267 | Jun 1995 | EP |
| 62203728 | Sep 1987 | JP |
| 02-048774 | Feb 1990 | JP |
| 02-056070 | Feb 1990 | JP |
| 02-245865 | Oct 1990 | JP |
| 3278274 | Dec 1991 | JP |
| 04-068470 | Mar 1992 | JP |
| 4115369 | Apr 1992 | JP |
| 04-362783 | Dec 1992 | JP |
| 05-073630 | Mar 1993 | JP |
| 0574942 | Mar 1993 | JP |
| 05-324360 | Jul 1993 | JP |
| 05-242174 | Sep 1993 | JP |
| 06203108 | Jul 1994 | JP |
| 07175842 | Jul 1995 | JP |
| 08-235233 | Sep 1996 | JP |
| 0962726 | Mar 1997 | JP |
| 09-212530 | Aug 1997 | JP |
| 09-288690 | Nov 1997 | JP |
| 10-105586 | Apr 1998 | JP |
| 10222549 | Aug 1998 | JP |
| 10307855 | Nov 1998 | JP |
| 11-288428 | Oct 1999 | JP |
| 2003-186914 | Jul 2003 | JP |
| 03050751 | May 2003 | WO |
| 03050726 | Jun 2003 | WO |
| WO 03050726 | Jun 2003 | WO |
| 03088095 | Oct 2003 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20070073809 A1 | Mar 2007 | US |