Today most computer users interact with the machine by way of a graphical user interface which, by exploiting the computer's visual display and intuitive input devices such as the mouse, mediates access to the operating system, application programs, and stored data. The standard approach to the design of the user interface has relied on a simple visual metaphor in which data files are contained in folders organized within a hierarchically-structured file system tree. The user interface provides controls that permit the user to navigate through the file system tree in order to locate and act upon data. Although such systems are easier to use than the command-line shell interfaces that preceded them, they generally have not provided a greater degree of abstraction from the underlying physical storage of data than was available in earlier systems.
The real-world familiarity of the file/folder model of storage contributed to its acceptance and popularity among computer users, but such user interfaces were also successful because users typically stored a relatively small number of data files on their machines. The ease with which computer systems can now be used, coupled with the availability of massive amounts of inexpensive disk storage, have to some degree made the standard data storage interface a victim of its own success. Computers are now being used to store large quantities of personal data in a variety of different formats for use with many different applications. It is not uncommon for a user to have hundreds or thousands of text documents, photographs, audio files, and other data records stored across multiple hard disks, shared networks and other storage media. Given such a development, drawbacks to the conventional folder tree storage model have become evident to computer users.
For the present-day user, the conventional storage model is undesirably and inflexibly one-dimensional. Items of data exist in one location and relate to other files in one way, by their relative position within the hierarchical folder tree, which ignores the many logical relationships files may have to one another. In previous versions of Microsoft® Windows®, files are associated with a limited number of properties over which the user has limited control, and those properties are accessible through a control that is difficult to locate and use. In other systems file metadata may be limited to the file name and the user's informal knowledge of the file's type. Such limitations have made it difficult for users to organize their data in new ways based on the content and use of the data. As a result, the growth in the amount of data stored by users has made searching for data less efficient and more cumbersome.
Particular applications have offered domain-specific solutions to the problem of user data management. Two examples involve applications for storing and organizing digital photograph files. The Digital Image Library in Microsoft® Digital Image Suite 9.0 includes a “Keyword Painter” control that enables the user to easily organize and subsequently locate images stored in disparate locations throughout the file system. The user clicks on identifying keywords of the user's own choosing and then clicks on thumbnail images of pictures to which the selected keywords are to be assigned. The user can now filter the view of the library of pictures by particular keywords. Adobe Photoshop Album 2.0 permits the user to associate content-descriptive tags with pictures by drag-drop actions on thumbnail images. The user can then quickly search the collection of pictures by subject matter using one or more tags.
Another example is the Grand Central e-mail interface, a project of Microsoft Research. Hierarchical properties are used to categorize e-mail messages. An arbitrary number of categories can be assigned by way of the user interface. The categories facilitate searching for messages and the organization of messages into conversational threads.
Disclosed features of the Microsoft® Windows® Code-Named “Longhorn” platform point to a more comprehensive solution. A storage subsystem, WinFS, relies on an extensible scheme of metadata properties to enable the user to search for, organize and share data. The basic unit of data container is the item, which is associated with multiple properties set to specific values. Items are organized by properties most relevant to the user at a particular time. Powerful querying capabilities over the store of items are provided. Users can thus find data more quickly and can organize and operate upon data more efficiently.
Prior to the present invention, however, there has been no general mechanism for metadata assignment and metadata-based navigation comparable in ease and generality of use to such conventional storage system interfaces as the file system Explorer tree of previous versions of Microsoft® Windows®, which permit the user to navigate to a folder and to modify its contents in intuitive ways such as by dragging and dropping with the mouse.
The following represents a simplified summary of some embodiments of the invention in order to provide a basic understanding of the invention. This summary is not an extensive overview of the invention. It is not intended to identify key or critical elements of the invention or to delineate the scope of the invention. Its sole purpose is to present some embodiments of the invention in simplified form as a prelude to the more detailed description that is presented below.
Features may be practiced in the context of a computer system having a graphical user interface, or another kind of user interface, and a data storage subsystem in which data items are organized and queried by way of metadata properties. In accordance with one embodiment, a computer-implemented method of assigning values to properties is provided. The method includes displaying a property tree having nodes that expose properties of a set of data items, where the property tree utilizes a carousel control for displaying subnodes parented by a node in the tree.
In some aspects of the aforementioned embodiments, the property tree also provides nodes that represent folders within a hierarchical file system, in addition to nodes that represent metadata properties. In other aspects of these embodiments, the property tree has nodes that represent properties with inherent hierarchy, and nodes that represent user-defined hierarchical properties.
According to an aspect of the invention, software instructions control a carousel control within a menu displayed on a computer display device. The carousel control displays a list of elements in a display area that can display a certain number of elements at a time. An input handler associated with the carousel control handles user input for scrolling the list elements displayed in the display area, based on each element's order within the list, such that a user can traverse the list. For example, the carousel control may store the list elements in a circular list, ordered by some criteria, and a user can circle through the list as desired within the display area.
The invention may be implemented by way of software, hardware, or a combination thereof. The invention may be implemented, for example, within an operating system shell or within a running application program. It is contemplated that the invention may be embodied in one or more computer-readable media.
Features of the invention will become apparent from the following detailed description when taken in conjunction with the drawings, in which:
The present invention includes a tree-shaped set of user interface controls that exposes properties of data items, which will henceforth be referred to as the “ProperTree.” The ProperTree provides two principal functions. First, the ProperTree enables the user to navigate across the virtual namespace of the user's data. Navigation is discussed further below. Second, the ProperTree permits the user to quickly and easily assign values to data item properties by adding or removing metadata with respect to property nodes exposed by the ProperTree. The user can add metadata to, and remove metadata from, many nodes at the same time. Because the ProperTree mimics the traditional folder tree control in certain respects, it enables users familiar with the conventional approach to storing, organizing and retrieving their data to work comfortably in a system with a radically different approach to storage that relies upon an extensible scheme of metadata properties and querying.
In one embodiment, the ProperTree control is displayed by default in a window within a pane to the left of a pane displaying a list view of items. When the user selects an item, the user can click on a property node exposed by the ProperTree to expand the node in place; the node can be collapsed if it is already expanded. A small widget, such as one displaying ‘+’ or ‘−’, may be used to indicate whether a node is collapsed or expanded. The expansion of a node shows the property values set for the currently selected item, as well as additional values that can be applied. In an embodiment, a most-frequently-used subset of values across a set of items is shown; the user can expand the list of values for the expanded property fully by, for example, clicking on a button. Having expanded a property node in the ProperTree, the user can change the property values; the changes are immediately applied to the item or items that have been selected by the user. The system may assign initial values to properties based on most-frequently used values.
Properties are displayed in the ProperTree in a manner that is appropriate to their type. Certain properties have only one value with respect to an item. A photograph, for example, might be either “Black/White” or “Color,” with users being permitted to change this property. The user interface for changing the value may, in such a case, comprise a clickable radio button adjacent to each possible value. Other properties may be capable of having multiple values with respect to an item. For example, a document may have multiple authors. In this case the user interface may comprise a checkbox adjacent to each possible value, with the user being permitted to check one or more boxes as desired. Richer properties are also supported appropriately. For example, a rich calendar control is shown for dates; for ratings, a five-star control may be shown.
Properties that cannot be changed by the user, such as the date on which a document is written, do not have value selection controls in the tree, and the nodes for such properties can only be used for navigation. The system is extensible with respect to adding new controls appropriate to particular data types.
For any given property or property value in the ProperTree, the user can navigate to a view of storage that is pivoted to that property or value. Thus, navigation does not simply involve taking the user to a single location, unlike navigation using a conventional folder tree. Rather, navigation by way of the ProperTree causes all relevant data to be rearranged into a new structure through which the user can browse. For example, the user can use the ProperTree to query storage for all documents having a particular “Author” value. The list view then changes to show documents meeting that criterion. Alternatively, the user can use the ProperTree to display all document authors. This causes a stacked view of authors within which the user can then browse.
Turning now to the drawings,
The ProperTree 203 includes a header 207, which in the depicted case is titled “Music Links”. Below the header 207 are the nodes of the ProperTree 203. The nodes labeled Rating 217, Artist 221, and Genre 223, represent single properties. Certain other nodes exposed by the tree 203, All Songs 209, Online Store 211, and Recently Played 215, are constructs that represent a query that searches for particular items in the list view 205 that satisfy conditions of the query. The nodes iPod 213 and Playlists 219, which represent static lists, are similar. If the user selects All Songs 209, for example, all the songs in the list view 205 are displayed. If the user selects Recently Played 215, however, only songs that have recently been played are shown.
Turning to
Turning to
Turning to
Returning briefly to
Turning to
In general, a property node in the ProperTree 203 may have a context menu that is specific to that node. An example is shown in
Turning to
Turning to
Similarly to the conventional folder tree control, the ProperTree 203 supports drag-and-drop semantics, but the behavior is different. An item in the list view 205 can be dragged and dropped onto a node in the ProperTree 203, but the item does not disappear from the list view; the behavior is more like tagging information to a file. A drag/drop action is shown in
In one embodiment of the invention, the ProperTree is integrated with a conventional folder tree control. In this embodiment, the tree has nodes that represent properties and expand to reveal values, as well as nodes that represent folders located in the hierarchical file system. In this embodiment, the advantages of both the hierarchical model and the metadata model of storage are present. The tree may additionally include nodes representing other constructs, such as a link to a web page.
In an embodiment, the ProperTree supports “hierarchical properties,” properties that inherently have hierarchy. For example, a date property may be represented in the tree as the hierarchy:
In addition, in an embodiment, the ProperTree supports free-form hierarchical properties that are set by the user.
For example:
With reference to
Carousel control 2001 includes a circular list 2003 of all elements 2011a and 2011b within the carousel control 2001, and a corresponding display area 2005. The circular list 2003 may be organized according to some predefined criteria or metadata, for example, alphabetical, chronological, etc. Display area 2005 displays one or more elements of the carousel control 2001. In this example, the carousel control is used to display subnodes under an “Artist” node 2007 of a property tree 2009. The elements 2011a and 2011b of carousel control 2001 include the subnodes of the Artist node 2007, namely, Abba, Adam Ant, Allman Bros., Beach Boys, Blink 182, Kelly Clarkson, Missy Elliott, Foo Fighters, Jet, The Killers, Modest Mouse, REM, Gwen Stefani, U2, Weezer, and Zornik. The nodes Artist, Song, and Album are not elements of carousel control 2001. In this example, display area 2005 displays four elements 2011a at a time, although other numbers of elements may alternatively be displayed as desired or as dictated by screen space. In
While the carousel control has input focus, a user can scroll the elements in the carousel control to circularly shift the elements visible in display area 2005. For example, pressing the up arrow when the carousel control is positioned as shown in
When the user has scrolled to the beginning or end of the elements as presently arranged (e.g., alphabetical, chronological, etc.), upon further scrolling in the same direction the carousel control continues traversing the circular list. Thus, when scrolling in alphabetical order, upon reaching the last item in the carousel control (here, Zornik), the carousel control displays the first item in the list (here, Abba) upon further scrolling by the user in the same direction. The reverse is also true, such that when scrolling in reverse alphabetical order, upon reaching the first item in the carousel control (here, Abba), the carousel control displays the last item in the list (here, Zornik) upon further scrolling by the user in the same direction.
A user may also “jump” to a specific item in the list by typing one or more characters on an attached keyboard or other data entry device. For example, by typing the letter ‘U,’ the carousel control may automatically rotate or shift the carousel control such that the first item matching the input is displayed at the top of the display area 2005. The results of such input are shown in
Similarly, if a user inputs the letter ‘B,’ the carousel control may jump to display the element Beach Boys at the top of the display area 2005. However, if the user inputs B-L (case sensitivity is optional, and not necessary) in quick succession (within some predetermined amount of time, and/or without a delay exceeding some predetermined amount of time between the inputs), the carousel control may jump to display the element Blink 182 at the top of the display area 2005. The carousel control may include an input handler routine for scrolling and jumping to particular elements based on user input.
While the example of
Those of skill in the art will appreciate that various modifications may be made to the carousel control to provide additional functionality to a user. For example, the carousel control may be used with hierarchical properties, such that one carousel control becomes nested within another. In such a nested embodiment, the nested carousel control reflects (i.e., is based on) the selected parent element 2011a from the parent carousel control, and keyboard shortcuts are usable within whichever carousel control presently has input focus.
Carousel controls may be provided with any number of display appearances. For example,
With reference to
Programs, comprising sets of instructions and associated data for the device 101, are stored in the memory 105, from which they can be retrieved and executed by the processing unit 103. Among the programs and program modules stored in the memory 105 are those that comprise or are associated with an operating system 125 as well as application programs 127. The device 101 has one or more systems of logical data storage, such as a file system or alternative systems using database-related techniques, associated with the operating system 125. Such systems of logical data storage serve as interfaces that map logically-organized data to data physically located on secondary storage media, such as data stored in clusters or sectors on the hard disk 109.
Computing device 101 includes forms of computer-readable media. Computer-readable media include any available media that can be accessed by the computing device 101. Computer-readable media may comprise storage media and communication media. Storage media include volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer-readable instructions, object code, data structures, program modules, or other data. Communication media include any information delivery media and typically embody data in a modulated data signal such as a carrier wave or other transport mechanism.
All references cited herein are hereby incorporated by reference to the same extent as if each reference were individually and specifically indicated to be incorporated by reference and were set forth in its entirety herein.
The use of the terms “a,” “an” and “the” and similar referents in the context of describing the invention, especially in the context of the following claims, is to be construed to cover both the singular and the plural, unless otherwise indicated herein or clearly contradicted by context. The terms “comprising,” “having,” “including,” and “containing” are to be construed as open-ended terms (meaning “including, but not limited to,”) unless otherwise noted. Recitation of ranges of values herein are merely intended to serve as a shorthand method of referring individually to each separate value falling within the range, unless otherwise indicated herein, and each separate value is incorporated into the specification as if it were individually recited herein. The use of any and all examples or exemplary language herein (e.g., “such as”) is intended merely to better illuminate the invention and does not pose a limitation on the scope of the invention unless otherwise claimed. No language in the specification should be construed as indicating any non-claimed element as essential to the practice of the invention.
Preferred embodiments of this invention are described herein, including the best mode known to the inventors for carrying out the invention. Variations on those preferred embodiments may become apparent to those having ordinary skill in the art upon reading the foregoing description. The inventors expect skilled artisans to employ such variations as appropriate, and the inventors intend for the invention to be practiced otherwise than as specifically described herein. Accordingly, this invention includes all modifications and equivalents of the subject matter recited in the claims appended hereto as permitted by applicable law. Moreover, any combination of the above-described elements in all possible variations thereof is encompassed by the invention unless otherwise indicated herein or otherwise clearly contradicted by context.
The present application is a continuation-in-part of co-pending application Ser. No. 10/837,487, filed Apr. 30, 2004, and entitled “Property Tree for Metadata Navigation and Assignment,” which is herein incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
5206949 | Cochran et al. | Apr 1993 | A |
5241671 | Reed et al. | Aug 1993 | A |
5333315 | Saether et al. | Jul 1994 | A |
5388196 | Pajak et al. | Feb 1995 | A |
5461710 | Bloomfield et al. | Oct 1995 | A |
5499364 | Klein et al. | Mar 1996 | A |
5504852 | Thompson-Rohrlich | Apr 1996 | A |
5513306 | Mills et al. | Apr 1996 | A |
5559948 | Bloomfield et al. | Sep 1996 | A |
5598524 | Johnston, Jr. et al. | Jan 1997 | A |
5630042 | McIntosh et al. | May 1997 | A |
5680563 | Edelman | Oct 1997 | A |
5696486 | Poliquin et al. | Dec 1997 | A |
5757925 | Faybishenko | May 1998 | A |
5790121 | Sklar et al. | Aug 1998 | A |
5802516 | Shwarts et al. | Sep 1998 | A |
5831606 | Nakajima et al. | Nov 1998 | A |
5835094 | Ermel et al. | Nov 1998 | A |
5838317 | Bolnick et al. | Nov 1998 | A |
5838322 | Nakajima et al. | Nov 1998 | A |
5867163 | Kurtenbach | Feb 1999 | A |
5875446 | Brown et al. | Feb 1999 | A |
5878410 | Zbikowski et al. | Mar 1999 | A |
5899995 | Millier et al. | May 1999 | A |
5917492 | Bereiter et al. | Jun 1999 | A |
5923328 | Griesmer | Jul 1999 | A |
5929854 | Ross | Jul 1999 | A |
5933139 | Feigner et al. | Aug 1999 | A |
5935210 | Stark | Aug 1999 | A |
5987454 | Hobbs | Nov 1999 | A |
5987506 | Carter et al. | Nov 1999 | A |
5999948 | Nelson et al. | Dec 1999 | A |
6003040 | Mital et al. | Dec 1999 | A |
6008806 | Nakajima et al. | Dec 1999 | A |
6014137 | Burns | Jan 2000 | A |
6021262 | Cote et al. | Feb 2000 | A |
6023708 | Mendez et al. | Feb 2000 | A |
6025843 | Sklar | Feb 2000 | A |
6037944 | Hugh | Mar 2000 | A |
6061692 | Thomas et al. | May 2000 | A |
6061695 | Slivka et al. | May 2000 | A |
6078924 | Ainsbury et al. | Jun 2000 | A |
6097389 | Morris et al. | Aug 2000 | A |
6144968 | Zellweger | Nov 2000 | A |
6147601 | Sandelman et al. | Nov 2000 | A |
6181342 | Niblack | Jan 2001 | B1 |
6202061 | Khosla et al. | Mar 2001 | B1 |
6237011 | Ferguson et al. | May 2001 | B1 |
6240421 | Stolarz | May 2001 | B1 |
6243094 | Sklar | Jun 2001 | B1 |
6243724 | Mander et al. | Jun 2001 | B1 |
6246411 | Strauss | Jun 2001 | B1 |
6256031 | Meijer et al. | Jul 2001 | B1 |
6275829 | Angiulo et al. | Aug 2001 | B1 |
6308173 | Glasser et al. | Oct 2001 | B1 |
6314367 | Ohler et al. | Nov 2001 | B1 |
6317142 | Decoste et al. | Nov 2001 | B1 |
6321334 | Jerger et al. | Nov 2001 | B1 |
6324551 | Lamping et al. | Nov 2001 | B1 |
6339767 | Rivette et al. | Jan 2002 | B1 |
6341280 | Glass et al. | Jan 2002 | B1 |
6363377 | Kravets et al. | Mar 2002 | B1 |
6363400 | Chtchetkine et al. | Mar 2002 | B1 |
6396842 | Rochberger | May 2002 | B1 |
6401097 | McCotter et al. | Jun 2002 | B1 |
6411311 | Rich et al. | Jun 2002 | B1 |
6430575 | Dourish et al. | Aug 2002 | B1 |
6437807 | Berquist et al. | Aug 2002 | B1 |
6448985 | McNally | Sep 2002 | B1 |
6453311 | Powers, III | Sep 2002 | B1 |
6453319 | Mattis et al. | Sep 2002 | B1 |
6466238 | Berry et al. | Oct 2002 | B1 |
6466932 | Dennis et al. | Oct 2002 | B1 |
6480835 | Light | Nov 2002 | B1 |
6505233 | Hanson et al. | Jan 2003 | B1 |
6513038 | Hasegawa et al. | Jan 2003 | B1 |
6526399 | Coulson et al. | Feb 2003 | B1 |
6535229 | Kraft | Mar 2003 | B1 |
6535230 | Celik | Mar 2003 | B1 |
6539399 | Hazama et al. | Mar 2003 | B1 |
6549217 | De Greef et al. | Apr 2003 | B1 |
6549916 | Sedlar | Apr 2003 | B1 |
6563514 | Samar | May 2003 | B1 |
6573906 | Harding et al. | Jun 2003 | B1 |
6573907 | Madrane | Jun 2003 | B1 |
6583799 | Manolis et al. | Jun 2003 | B1 |
6590585 | Suzuki et al. | Jul 2003 | B1 |
6606105 | Quartetti | Aug 2003 | B1 |
6613101 | Mander et al. | Sep 2003 | B2 |
6628309 | Dodson et al. | Sep 2003 | B1 |
6636238 | Amir et al. | Oct 2003 | B1 |
6636250 | Gasser | Oct 2003 | B1 |
6642946 | Janes et al. | Nov 2003 | B1 |
6662198 | Satyanarayanan et al. | Dec 2003 | B2 |
6684222 | Cornelius et al. | Jan 2004 | B1 |
7043415 | Dunlavey et al. | May 2006 | B1 |
7392255 | Sholtis et al. | Jun 2008 | B1 |
20010018858 | Dwek | Sep 2001 | A1 |
20010034771 | Hutsch et al. | Oct 2001 | A1 |
20010047368 | Oshinsky et al. | Nov 2001 | A1 |
20010049675 | Mandler et al. | Dec 2001 | A1 |
20010053996 | Atkinson | Dec 2001 | A1 |
20010056434 | Kaplan et al. | Dec 2001 | A1 |
20010056508 | Arneson et al. | Dec 2001 | A1 |
20020019935 | Andrew et al. | Feb 2002 | A1 |
20020033844 | Levy et al. | Mar 2002 | A1 |
20020046232 | Adams et al. | Apr 2002 | A1 |
20020046299 | Lefeber et al. | Apr 2002 | A1 |
20020049717 | Routtenberg et al. | Apr 2002 | A1 |
20020052885 | Levy | May 2002 | A1 |
20020054167 | Hugh | May 2002 | A1 |
20020059199 | Harvey | May 2002 | A1 |
20020062310 | Marmor et al. | May 2002 | A1 |
20020075310 | Prabhu et al. | Jun 2002 | A1 |
20020075312 | Amadio et al. | Jun 2002 | A1 |
20020075330 | Rosenzweig et al. | Jun 2002 | A1 |
20020087740 | Castanho et al. | Jul 2002 | A1 |
20020087969 | Brunheroto et al. | Jul 2002 | A1 |
20020089540 | Geier et al. | Jul 2002 | A1 |
20020091679 | Wright | Jul 2002 | A1 |
20020091697 | Huang et al. | Jul 2002 | A1 |
20020091739 | Ferlitsch et al. | Jul 2002 | A1 |
20020095416 | Schwols | Jul 2002 | A1 |
20020097278 | Mandler et al. | Jul 2002 | A1 |
20020103998 | DeBruine | Aug 2002 | A1 |
20020104069 | Gouge et al. | Aug 2002 | A1 |
20020107973 | Lennon et al. | Aug 2002 | A1 |
20020111942 | Campbell et al. | Aug 2002 | A1 |
20020113821 | Hrebejk et al. | Aug 2002 | A1 |
20020120505 | Henkin et al. | Aug 2002 | A1 |
20020120757 | Sutherland et al. | Aug 2002 | A1 |
20020129033 | Hoxie et al. | Sep 2002 | A1 |
20020138552 | DeBruine et al. | Sep 2002 | A1 |
20020138582 | Chandra et al. | Sep 2002 | A1 |
20020138744 | Schleicher et al. | Sep 2002 | A1 |
20020152262 | Arkin et al. | Oct 2002 | A1 |
20020152267 | Lennon | Oct 2002 | A1 |
20020156895 | Brown | Oct 2002 | A1 |
20020161800 | Eld et al. | Oct 2002 | A1 |
20020163572 | Center et al. | Nov 2002 | A1 |
20020169678 | Chao et al. | Nov 2002 | A1 |
20020184357 | Traversat et al. | Dec 2002 | A1 |
20020188605 | Adya et al. | Dec 2002 | A1 |
20020188735 | Needham et al. | Dec 2002 | A1 |
20020194252 | Powers, III | Dec 2002 | A1 |
20020196276 | Corl et al. | Dec 2002 | A1 |
20020199061 | Friedman et al. | Dec 2002 | A1 |
20030009484 | Hamanaka et al. | Jan 2003 | A1 |
20030014415 | Weiss et al. | Jan 2003 | A1 |
20030018657 | Monday | Jan 2003 | A1 |
20030018712 | Harrow et al. | Jan 2003 | A1 |
20030028610 | Pearson | Feb 2003 | A1 |
20030041178 | Brouk et al. | Feb 2003 | A1 |
20030046260 | Satyanarayanan et al. | Mar 2003 | A1 |
20030046700 | Wilcox et al. | Mar 2003 | A1 |
20030069893 | Kanai et al. | Apr 2003 | A1 |
20030069908 | Anthony et al. | Apr 2003 | A1 |
20030074356 | Kaier et al. | Apr 2003 | A1 |
20030078918 | Souvignier et al. | Apr 2003 | A1 |
20030088854 | Wygodny et al. | May 2003 | A1 |
20030093321 | Bodmer et al. | May 2003 | A1 |
20030093531 | Yeung et al. | May 2003 | A1 |
20030093580 | Thomas et al. | May 2003 | A1 |
20030101200 | Koyama et al. | May 2003 | A1 |
20030105745 | Davidson et al. | Jun 2003 | A1 |
20030110188 | Howard et al. | Jun 2003 | A1 |
20030115218 | Bobbitt et al. | Jun 2003 | A1 |
20030117403 | Park et al. | Jun 2003 | A1 |
20030117422 | Hiyama et al. | Jun 2003 | A1 |
20030120928 | Cato et al. | Jun 2003 | A1 |
20030120952 | Tarbotton et al. | Jun 2003 | A1 |
20030122873 | Dieberger et al. | Jul 2003 | A1 |
20030126136 | Omoigui | Jul 2003 | A1 |
20030126212 | Morris et al. | Jul 2003 | A1 |
20030135495 | Vagnozzi | Jul 2003 | A1 |
20030135517 | Kauffman | Jul 2003 | A1 |
20030135659 | Bellotti et al. | Jul 2003 | A1 |
20030140115 | Mehra | Jul 2003 | A1 |
20030154185 | Suzuki et al. | Aug 2003 | A1 |
20030158855 | Farnham et al. | Aug 2003 | A1 |
20030163486 | Van Der Meulen | Aug 2003 | A1 |
20030177422 | Tararoukhine et al. | Sep 2003 | A1 |
20030184587 | Ording et al. | Oct 2003 | A1 |
20030210281 | Ellis et al. | Nov 2003 | A1 |
20030212680 | Bates et al. | Nov 2003 | A1 |
20030212710 | Guy | Nov 2003 | A1 |
20030222915 | Marion et al. | Dec 2003 | A1 |
20030225796 | Matsubara | Dec 2003 | A1 |
20030227487 | Hugh | Dec 2003 | A1 |
20030233419 | Beringer | Dec 2003 | A1 |
20040001106 | Deutscher et al. | Jan 2004 | A1 |
20040002993 | Toussaint et al. | Jan 2004 | A1 |
20040003247 | Fraser et al. | Jan 2004 | A1 |
20040008226 | Manolis et al. | Jan 2004 | A1 |
20040019584 | Greening et al. | Jan 2004 | A1 |
20040019655 | Uemura et al. | Jan 2004 | A1 |
20040030731 | Iftode et al. | Feb 2004 | A1 |
20040044696 | Frost | Mar 2004 | A1 |
20040044776 | Larkin | Mar 2004 | A1 |
20040054674 | Carpenter et al. | Mar 2004 | A1 |
20040056896 | Doblmayr et al. | Mar 2004 | A1 |
20040068524 | Aboulhosn et al. | Apr 2004 | A1 |
20040070612 | Sinclair et al. | Apr 2004 | A1 |
20040083433 | Takeya | Apr 2004 | A1 |
20040111431 | Zeller et al. | Jun 2004 | A1 |
20050018858 | John | Jan 2005 | A1 |
20050044509 | Hunleth et al. | Feb 2005 | A1 |
20050046700 | Bracke | Mar 2005 | A1 |
20050086534 | Hindawi et al. | Apr 2005 | A1 |
Number | Date | Country |
---|---|---|
1421800 | Nov 2001 | CN |
2329492 | Mar 1999 | GB |
WO03062976 | Jul 2003 | JP |
9938092 | Jul 1999 | WO |
0163919 | Aug 2001 | WO |
WO 0225420 | Mar 2002 | WO |
Number | Date | Country | |
---|---|---|---|
20060004873 A1 | Jan 2006 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10837487 | Apr 2004 | US |
Child | 11192101 | US |