System and method for displaying stack icons

- Microsoft

The present invention is directed to a method and system for use in a computing environment for representing files stored in stacks. The method includes providing a set of stack icons, each icon in the set having a stack height representing a range of stack sizes. The method additionally includes determining a stack size for a selected stack and selecting and displaying an appropriate stack icon from the set of stack icons based on the determined stack size. The selected stack may be stored within one of multiple libraries. Accordingly a distinct set of icons relevant to each library may be stored for each library. The icons may visibly convey information pertaining to the relevant library. Accordingly, the method may include representing a selected stack by determining an appropriate library and an appropriate stack height and displaying a corresponding icon. The system may additionally include an empty stack icon, a generic stack icon, property based icons, and custom thumbnail icons.

Skip to: Description  ·  Claims  ·  References Cited  · Patent History  ·  Patent History
Description
CROSS-REFERENCE TO RELATED APPLICATIONS

None

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

None.

TECHNICAL FIELD

Embodiments of the present invention relate to enhancement of a computer user experience. More particularly, embodiments of the invention relate to providing a technique for displaying groups of items to a user in a descriptive manner.

BACKGROUND OF THE INVENTION

In current computer operating system environments, icons are provided for representing items such as files, folders, shortcuts, applications, documents, tasks, and commands. Icons may be used in list views, toolbars, dialog boxes, menus, and other places. Icons may be used to represent all objects of a specific class, such as Microsoft Word documents, Microsoft Excel files, jpeg files, or other types of files.

Icons may include thumbnail images used to represent specific objects, such as a specific jpeg or a specific folder. Icons may be dynamically generated by code run on a user's machine or may be cached. Icons have existed for many years and many applications use existing icon architectures. Application and component developers can, using custom icons and thumbnails, convey as much information about objects as their pixels will allow. However, existing systems do not provide a technique for graphically grouping multiple icons based on properties of the files represented.

Currently, when a user wants to group items having common characteristics, the user often groups the items into a folder. For example, a user can group documents by file type to include one group for Microsoft Word documents, one for Microsoft Excel documents, one for Microsoft PowerPoint documents, etc. A user may also group music by genre, creating separate groups for Pop, Classical, Hip-Hop, etc. While the conventional folder structure and icon may provide easy access to the documents, the generic folder icon fails to provide descriptive information pertaining to items within the folder.

A solution is needed for visually representing these groups to the user. The use of a generic icon such as the generic folder icon to represent groups of items has a number of shortcomings. First, using a generic icon to represent a group will not provide a user with any idea of how many items are in the group. In contrast, in a real-world stack view, a user is able to view an approximate number of items in the stack. It would be desirable to have an icon represent a real-world stack view in which the group of items could be viewed as a stack and in which a viewer can view the size of the stack and see relative stack sizes merely by viewing the stack. Additionally, a solution is needed that allows the user to see the types of items that the stack contains. Furthermore, a solution should be provided that is capable of conveying the concept of an empty stack.

Accordingly, a solution is needed for immediately conveying to a user the size of a stack and the character of items within the stack. The solution should allow users to view stacks of items and infer characteristics of the stack based on the representation of the stack.

BRIEF SUMMARY OF THE INVENTION

Embodiments of the present invention are directed to a method for representing files stored in stacks. The method includes providing a set of stack icons, each icon in the set having a stack height representing a range of stack sizes. The method additionally includes determining a stack size for a selected stack and selecting and displaying an appropriate stack icon from the set of stack icons based on the determined stack size.

In another aspect of the invention, a method is provided for representing a selected stack of files, wherein the selected stack is stored within one of multiple libraries. The method includes providing an icon for each library. Each icon for each library portrays information relevant to the library. The method additionally includes storing multiple icons portraying the relevant information for each library, wherein each of the multiple icons in each library represents a range of stack heights. The method additionally includes representing a selected stack by determining an appropriate library and an appropriate stack height and displaying a corresponding icon.

In yet an additional aspect of the invention, a system is provided for representing a selected stack of files. The system includes stored sets of default stack icons, each stored set of default stack icons representing and portraying information relevant to a corresponding library. Each stored set of default stack icons includes multiple icons and each included icon represents a range of stack heights. The system additionally includes icon selection tools for determining if the selected stack of files belongs to a library having a corresponding stored set of default icons and for determining an appropriate stack height. Upon locating an appropriate library and stack height, the icon selection tools select and display an appropriate icon from an appropriate set of default icons.

In further aspects of the invention, thumbnail icons and property-based icons may be provided. Additionally, each stored set of icons may include a unique empty set icon for indicating that a stack is empty.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is described in detail below with reference to the attached drawings figures, wherein:

FIG. 1 is a block diagram illustrating a computerized environment in which embodiments of the invention may be implemented;

FIG. 2 is a block diagram illustrating a stack selection and display module in accordance with an embodiment of the invention;

FIGS. 3A and 3B are flow charts illustrating a stack icon selection and display process in accordance with an embodiment of the invention;

FIG. 4 is a diagram illustrating stack icons for documents in accordance with an embodiment of the invention;

FIGS. 5A-5E illustrate stack icons for various types of items in accordance with an embodiment of the invention;

FIG. 6 illustrates a generic default stack icon in accordance with an embodiment of the invention;

FIG. 7 illustrates a file type overlay on a stack icon in accordance with an embodiment of the invention;

FIG. 8 illustrates a thumbnail stack icon from a photo or video library in accordance with an embodiment of the invention; and

FIG. 9 illustrates a music stack icon for songs grouped by album in a music library.

 DETAILED DESCRIPTION OF THE INVENTION I. System Overview

Embodiments of the invention include a method and system for displaying stacks of items having common properties. The system and method provide a technique for displaying the number of items in a stack on a stack icon. Furthermore, the stack icon visually represents the height of the stack, such that the stack depicted in the icon varies depending on the relative size of the stack compared to other stacks in the view. Stack icons are depicted to include different kinds of items (documents, photos, videos, music, contacts, etc.) depending on the library in which the stack is being represented. Furthermore, in accordance with embodiments of the invention, a completely different image is used to represent empty stacks than non-empty stacks. When there is an icon available to represent a certain property, that icon is overlaid on the stack icon based on that property. For some special types of stacks, such as stacks of photos and videos, the stack icon includes thumbnails of items from within the stack itself.

The system and method may be implemented in a computerized environment. An exemplary operating environment is described in detail below with reference to FIG. 1.

II. Exemplary Operating Environment

FIG. 1 illustrates an example of a suitable computing system environment 100 on which the invention may be implemented. The computing system environment 100 is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention. Neither should the computing environment 100 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary operating environment 100.

The invention is described in the general context of computer-executable instructions, such as program modules, being executed by a 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, multiprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers, and the like. The invention may also 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 computer storage media including memory storage devices.

With reference to FIG. 1, the exemplary system 100 for implementing the invention includes a general purpose-computing device in the form of a computer 110 including 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.

Computer 110 typically includes a variety of computer readable media. By way of example, and not limitation, computer readable media may comprise computer storage media and communication 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, FIG. 1 illustrates operating system 134, application programs 135, other program modules 136, and program data 137.

The computer 110 may also include other removable/nonremovable, volatile/nonvolatile computer storage media. By way of example only, FIG. 1 illustrates a hard disk drive 141 that reads from or writes to nonremovable, nonvolatile magnetic media, a magnetic disk drive 151 that reads from or writes to a removable, nonvolatile magnetic disk 152, and an optical disk drive 155 that reads from or writes to a removable, nonvolatile optical disk 156 such as a CD ROM or other optical media. Other removable/nonremovable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. The hard disk drive 141 is typically connected to the system bus 121 through an non-removable memory interface such as interface 140, and magnetic disk drive 151 and optical disk drive 155 are typically connected to the system bus 121 by a removable memory interface, such as interface 150.

The drives and their associated computer storage media discussed above and illustrated in FIG. 1, provide storage of computer readable instructions, data structures, program modules and other data for the computer 110. In FIG. 1, for example, hard disk drive 141 is illustrated as storing operating system 144, application programs 145, other program modules 146, and program data 147. Note that these components can either be the same as or different from operating system 134, application programs 135, other program modules 136, and program data 137. Operating system 144, application programs 145, other program modules 146, and program data 147 are given different numbers here to illustrate that, at a minimum, they are different copies. A user may enter commands and information into the computer 110 through input devices such as a keyboard 162 and pointing device 161, commonly referred to as a mouse, trackball or touch pad. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 120 through a user input interface 160 that is coupled to the system bus, but may be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). A monitor 191 or other type of display device is also connected to the system bus 121 via an interface, such as a video interface 190. In addition to the monitor, computers may also include other peripheral output devices such as speakers 197 and printer 196, which may be connected through an output peripheral interface 195.

The computer 110 in the present invention will operate 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, and typically includes many or all of the elements described above relative to the computer 110, although only a memory storage device 181 has been illustrated in FIG. 1. The logical connections depicted in FIG. 1 include a local area network (LAN) 171 and a wide area network (WAN) 173, but may also include other networks.

When used in a LAN networking environment, the computer 110 is connected to the LAN 171 through a network interface or adapter 170. When used in a WAN networking environment, the computer 110 typically includes a modem 172 or other means for establishing communications 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 computer 110, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation, FIG. 1 illustrates remote application programs 185 as residing on memory device 181. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.

Although many other internal components of the computer 110 are not shown, those of ordinary skill in the art will appreciate that such components and the interconnection are well known. Accordingly, additional details concerning the internal construction of the computer 110 need not be disclosed in connection with the present invention.

III. Stack Icon Selection and Display Module

FIG. 2 illustrates a stack icon selection and display module 10. The stack icon selection and display module 10 is preferably implemented in the computerized environment 100 illustrated in FIG. 1 and may operate from within the RAM 132 or other memory device. The stack icon selection and display module 10 may include a user selection module 12, a categorizing module 14, and counting tools 16. The stack icon selection and display module 10 may additionally include icon selection tools 20, default stack icons 22, property based icons 24, and custom thumbnail icons 26.

The user selection module 12 enables a user to group items having common properties into a stack. As described above, the stacks may share a common file type or other characteristic.

The categorizing module 14 categorizes the selected items in accordance with the shared common property. Stack icons are depicted to include different kinds of items such as documents, photos, videos, music, contacts, etc. The particular depiction will depend upon the library in which the stack is being represented.

The counting tools 16 count the number of selected items to be provided on the stack. As will be further illustrated below, the number of items in a stack is displayed on the stack icon itself. Furthermore, the height of the stack depicted in a stack icon varies depending on the relative size of the stack compared to other stacks in the view. Additionally, the counting tools 16 are capable of determining if a selected stack is empty. A completely different image is used to represent empty stacks than non-empty stacks.

The icon selection tools 20 select an appropriate icon from three categories of available icons. The three categories of available icons include default stack icons 22, property-based icons 24, and thumbnail icons 26. While typically a default icon is provided for each library, if there is an icon available to represent a certain property, that icon may be overlaid on the stack icon based on that property. The custom thumbnail icons 26 may be provided for some special types of stacks, such as stacks of photos and videos. The thumbnail stack icon includes thumbnails of items from within the stack itself.

With further reference to the icon selection tools 20, each icon is provided in multiple stack sizes as will be further described below. The icon selection tools 20 may implement an algorithm to select the appropriate stack size within a category.

Icon Characteristics

Three categories of stack icons may be provided for the system of the invention. As set forth above, these categories may include default stack icons, property-based stack icons, and thumbnail stack icons. Each of the main libraries including the document library, photo library, video library, music and radio library, contacts library, message library, and television and movie library may include a set of default stack icons. A set of generic default stack icons may be provided for use in non-library views.

FIG. 4 illustrates a wire-frame model of stack icons for documents. The illustrated display includes stacks 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, and 64. Each stack includes a caption 80 appropriate for each item in the stack. Furthermore, on the face of each stack is designator 70 for indicating a number of items contained within the stack. For instance, the stack 52 includes a caption “marketing reports” and 92 documents are contained in the stack. Stack 60 includes a “to do” caption and two documents are contained within the stack. The size displayed for each stack is related to the number of items in the stack. For instance, the stack 52 is shown as larger than the stack 60 because the stack 52 contains more items than the stack 60.

As shown, each set of default stack icons includes multiple icons, each icon representing a stack of a distinct size. In an embodiment of the invention, five icons are provided for representing stacks of different sizes. In this instance, the sizes are characterized as large, medium, small, two, and zero. Various criteria are relevant to selecting which stack icon is shown. The size of the stack icon should indicate the relative size of the stack compared to other stacks in that same view. A stack should not be visually represented as having more items than it actually contains, except in the case of a stack of just one item. An exemplary algorithm for selecting the appropriate size is described below with regard to the method of the invention.

Default Stack Icons

FIGS. 5A-5E illustrate multiple embodiments of default stack icons. Each of the main libraries in an operating system may have a set of default stack icons. A set of generic default stack icons may be included for non-library views. In the illustrated embodiments, the operating system provides a documents library, a photo and video library, a music and radio library, a contacts library, and a message library.

FIG. 5A illustrates multiple default stack icons 502, 504, 506, 508, and 510 within the documents library. The icons used for the stack emulate the documents they represent. Additionally, as shown in an upper left corner of each stack, the number of items contained within the stack is displayed. The larger stacks are shown with a greater number of icons that the smaller stacks. Stack 510 utilizes a unique “empty stack” icon.

FIG. 5B illustrates multiple default stack icons 512, 514, 516, 518, and 520 within the music and radio library. As set forth above, a number in the upper left corner of each stack indicates a number of items in the stack. The icons are representative of the content of the library. In the embodiment of FIG. 5B, compact disc (CD) cases are used as icons. Furthermore, the final stack 520 is an empty stack and includes a unique icon showing an empty CD case. As set forth above, larger stacks are shown with a greater number of stacked icons than smaller stacks.

FIG. 5C illustrates multiple default stack icons 522, 524, 526, 528, and 530 within the photograph library. As set forth above, a number in the upper left corner of each stack indicates a number of items in the stack. The icons are representative of the content of the library. In the embodiment of FIG. 5C, a photograph is used as an icon. Furthermore, the final stack 530 is an empty stack and includes a unique icon showing an empty picture frame. As set forth above, larger stacks are shown with a greater number of stacked icons than smaller stacks.

FIG. 5D illustrates multiple default stack icons 532, 534, 536, 538, and 540 within the contacts library. As set forth above, a number in the upper left corner of each stack indicates a number of items in the stack. Larger stacks are shown with a greater number of stacked icons than smaller stacks. The icons are representative of the content of the library. In the embodiment of FIG. 5D, a contact card is used as the stack icon. Furthermore, the final stack 540 is an empty stack and includes a unique icon showing an empty contact card.

FIG. 5E illustrates multiple default stack icons 542, 544, 546, 548, and 550 within the message library. As set forth above, a number in the upper left corner of each stack indicates a number of items in the stack. Larger stacks are shown with a greater number of stacked icons than smaller stacks. The icons are representative of the content of the library. In the embodiment of FIG. 5E, an envelope is used as the stack icon. Furthermore, the final stack 540 is an empty stack and includes a unique icon showing an empty inbox.

As illustrated in FIGS. 5A-5E, each set of default stack icons includes five icons representing stacks of different sizes. In embodiments of the invention, these sizes include a large size, a medium size, a small size, a “two” sized icon, and an empty stack or “zero” icon. The selection of the appropriate default icon is based on the size of the stack and is further described below with reference to the method of the invention.

FIG. 6 illustrates a generic default stack icon 600. This icon may be used to represent items in non-library views. The generic default stack icon may also be provided in multiple sizes conforming to those described above.

Property-Based Stack Icons

FIG. 7 illustrates an embodiment of a property based stack icon 700. The icon 700 is the icon for the document library, but includes a file type overlay 710 indicating a file type. The property-based stack icons are composed from the appropriate default stack icon for the library and an additional icon that represents a property. Property-based stack icons may be available from multiple libraries. For example, in the document library, the music library, or the photo library, the additional icon may be provided to indicate file type. Alternatively, an additional icon may be provided in the document library or photo library to indicate the date or month in which the displayed stack was created. Other types of property-based stack icons may also be available.

The overlay 710 is used to convey what type of object the icon portrays. An application may provide such an overlay for each file-type it owns, but if none is provided for a particular file-type, then the application's own icon may be used as the overlay. The placement of the overlay is shown as aligned exactly along the bottom edge of the image such that it fits within the boundaries of the icon when the image is bottom-aligned. Horizontally, the type overlay may be centered on the right edge of the image, but can be shown in other positions.

Overlays may be stored in the following pixel sizes: 48×48, 32×32, 24×24, 16×16, and 8×8. The following table describes an appropriate sized overlay for display on icons of different sizes.

Icon Size Corresponding Overlay Size 256 × 256 48 × 48 128 × 128 32 × 32 48 × 48 24 × 24 32 × 32 16 × 16 16 × 16 8 × 8

Thumbnail Stack Icons

FIG. 8 illustrates a custom thumbnail icon 800 from the photo library. The thumbnail icon may be generated to represent items actually contained within the stack. FIG. 9 illustrates a custom thumbnail stack from the music library. In embodiments of the invention, custom thumbnail icons will be provided for stacks in the photo and video libraries. These thumbnail stacks should preview photographs from within the actual stack. Stacks of songs may be provided by album in the music library. Thus thumbnail stacks may show CD album art encased in a CD cover. The thumbnail icons may further include stacks of songs by artist in the music library. These thumbnails may display art relevant to the artist. If a custom thumbnail stack icon 26 is unavailable, the system displays the default stack icon from the stored default stack icons 22 for that stack.

In general, thumbnail icons may be treated just as other metadata on items. Thumbnail icons may be stored and extracted as bitmaps and may be referenced as a multi-valued property. Every item may have a flag that indicates one of three states regarding its thumbnails. In a first “yes” state, the flag indicates the existence of a cached thumbnail. In a second “no” state, there is no cached thumbnail one cannot be extracted. In a third “uncertain state” there is no cached thumbnail, and it is unclear whether a thumbnail can be extracted.

Icon Selection Method

FIG. 3A is a flow chart illustrating a method for selecting and displaying stack icons in accordance with an embodiment of the invention. The process begins in step A0 and the stack icon selection and display module 10 receives a user request in step A02. In step A04, the categorizing module 12 locates the category that corresponds to the user selection. In step A06, the counting tools 16 determine the number of items in the stack. In step A08, the icon selection tools 20 implement a selection algorithm to select an icon appropriate for the size of the stack. This process is further explained below with respect to FIG. 3B.

In step A10, the stack icon selection and display module 10 locates any special properties or available thumbnails. If either is available in step A12, the stack icon selection and display module 10 displays the thumbnail or property based icon in step A18. If neither a property-based or thumbnail icon is available in step A12, the system looks for a default library in step A14. If the default icon is found in step A16, the system displays the default icon in step A20. If the default icon is not found in step A16, the system retrieves and displays the generic icon in step A22 to complete the process in step A24.

A limited number of stack icons is provided for representing all sizes of stacks. For instance, whereas a stack may have any number of items from zero to hundreds or thousands, five different stack icons may be provided to represent all of these different stack sizes. FIG. 3B is a flowchart illustrating a technique for selecting the appropriate stack icon for display. The process begins in step B0. In step B02, the system divides a range of stacks between the largest stack and the smallest stack having more than two items into three equal ranges. In step B04, the system assigns stacks to an icon based on the range. The stacks that fall in the largest range get the largest stack icon, the second largest get the next largest stack icon, etc. Stacks with one or two items get the stack of size “two” icon. Stacks with zero items get the stack of size zero icon. It may be desirable to use a larger or smaller number of stack icons to represent all sizes of stacks. In other embodiments of the invention, different selection algorithms may be used.

While particular embodiments of the invention have been illustrated and described in detail herein, it should be understood that various changes and modifications might be made to the invention without departing from the scope and intent of the invention. The embodiments described herein are intended in all respects to be illustrative rather than restrictive. Alternate embodiments will become apparent to those skilled in the art to which the present invention pertains without departing from its scope.

From the foregoing it will be seen that this invention is one well adapted to attain all the ends and objects set forth above, together with other advantages, which are obvious and inherent to the system and method. It will be understood that certain features and sub-combinations are of utility and may be employed without reference to other features and sub-combinations. This is contemplated and within the scope of the appended claims.

Claims

1. A computer-implemented method for representing files, the method comprising:

using a processor to receive an identification of a plurality of groups of files, the groups of files to be represented by a plurality of stack icons, which are stored in a system memory that is connected to the processor by a system bus;
counting a number of files in each group of files to determine how many files are in each group, wherein the plurality of groups of files includes groups having a range of numbers of files from a largest number of files to a smallest number of files;
dividing the plurality of groups of files by size into three equal fractions of groups of files, (1) wherein each one of the three fractions includes a number of groups of files that is equal to one-third of the plurality of groups of files; (2) wherein a smallest third of the plurality of groups includes groups of files that have numbers of files falling in a smallest third of the range of numbers of files; (3) wherein a medium third of the plurality of groups includes groups of files that have numbers of files falling in a medium third of the range of numbers of files; and (4) wherein a largest third of the plurality of groups includes groups of files that have numbers of files falling in a largest third of the range of numbers of files;
as signing a stack icon to each of the three equal fractions, the stack icon being selected from the plurality of stack icons, (1) wherein the plurality of stack icons comprise three predefined stack icons, which include a large-stack icon, a medium-stack icon, and a small-stack icon, and (2) wherein the large-stack icon is assigned to the largest third of the plurality of groups, the medium-stack icon is assigned to the medium third of the plurality of groups, and the small-stack icon is assigned to the smallest third of the plurality of groups; and
retrieving each of the large-stack icon, the medium-stack icon, and the small-stack icon from the system memory and causing each of the large-stack icon, the medium-stack icon, and the small-stack icon to be displayed on a display device as visual representations of the plurality of groups of files.

2. The method of claim 1, further comprising storing an empty stack icon that displays an image distinct from other icons in the plurality of predefined stack icons.

3. The method of claim 2, further comprising selecting the empty stack icon when displaying a stack if the determined stack size is zero.

4. The method of claim 1, further comprising generating different stack icons to represent files in different distinct libraries, wherein each of said different stack icons displays information representative of the content of the files in the distinct library.

5. The method of claim 1, wherein each stack icon visually identifies a file type of the plurality of files.

6. The method of claim 5, wherein the visual identification of file type is a persistent overlay on the icon.

7. The method of claim 1, wherein one or more of the stack icons includes a thumbnail image displaying contents of one of the plurality of files.

8. A computer storage medium storing computer executable instructions for performing the method of claim 1.

9. The method of claim 6, wherein said overlay is a symbol provided by an application that owns the file type.

10. A computer storage medium having computer-executable instructions embodied thereon that, when executed, cause a computing device to perform a method for representing a plurality of files, the method comprising:

using a processor to receive an identification of a plurality of groups of files, the groups of files to be represented by a plurality of stack icons, which are stored in a system memory that is connected to the processor by a system bus;
counting a number of files in each group of files to determine how many files are in each group, wherein the plurality of groups of files includes groups having a range of numbers of files from a largest number of files to a smallest number of files;
dividing the plurality of groups of files by size into three equal fractions of groups of files, (1) wherein each one of the three fractions includes a number of groups of files that is equal to one-third of the plurality of groups of files; (2) wherein a smallest third of the plurality of groups includes groups of files that have numbers of files falling in a smallest third of the range of numbers of files; (3) wherein a medium third of the plurality of groups includes groups of files that have numbers of files falling in a medium third of the range of numbers of files; and (4) wherein a largest third of the plurality of groups includes groups of files that have numbers of files falling in a largest third of the range of numbers of files;
as signing a stack icon to each of the three equal fractions, the stack icon being selected from the plurality of stack icons, (1) wherein the plurality of stack icons comprise three predefined stack icons, which include a large-stack icon, a medium-stack icon, and a small-stack icon, and (2) wherein the large-stack icon is assigned to the largest third of the plurality of groups, the medium-stack icon is assigned to the medium third of the plurality of groups, and the small-stack icon is assigned to the smallest third of the plurality of groups; and
retrieving each of the large-stack icon, the medium-stack icon, and the small-stack icon from the system memory and causing each of the large-stack icon, the medium-stack icon, and the small-stack icon to be displayed as visual representations of the plurality of groups of files.

11. The computer storage medium of claim 10, wherein the method further comprises generating a unique empty stack icon representing a stack having no files.

12. The computer storage medium of claim 11, further comprising selecting the empty stack icon in response to a user request to display a stack having no files.

13. The computer storage medium of claim 10, further comprising the step of adding an overlay to each stack icon, said overlay identifying a property of the files represented by the generated icon.

14. The computer storage medium of claim 10, wherein said step of retrieving further includes the step of including a thumbnail in one or more of the stack icons said thumbnail depicting contents of one of said plurality of files.

15. The method of claim 13, wherein said property in said overlay identifies an application that owns the file type.

16. The method of claim 10, wherein said one or more medium stack icons comprise a second largest stack icon and wherein said second smallest stack icon comprises a third largest stack icon.

17. A system for representing a selected stack of files, the system comprising:

a processor that is usable to receive an identification of a plurality of groups of files, the groups of files to be represented by a plurality of default stack icons, which are stored in a system memory that is connected to the processor by a system bus;
a computer storage medium having computer-executable instructions embodied thereon that, when executed, cause a computing device to: (1) count a number of files in each group of files to determine how many files are in each group, wherein the plurality of groups of files includes a range of numbers of files from a largest number of files to a smallest number of files; (2) divide the plurality of groups of files by size into three equal fractions of groups of files, a) wherein each one of the three fractions includes a number of groups of files that is equal to one-third of the plurality of groups of files; b) wherein a smallest third of the plurality of groups includes groups of files that have numbers of files falling in a smallest third of the range of numbers of files; c) wherein a medium third of the plurality of groups includes groups of files that have numbers of files falling in a medium third of the range of numbers of files; and d) wherein a largest third of the plurality of groups includes groups of files that have numbers of files falling in a largest third of the range of numbers of files; (3) assign a stack icon to each of the three equal fractions, the stack icon being selected from the plurality of stack icons, a) wherein the plurality of stack icons comprise three predefined stack icons, which include a large-stack icon, a medium-stack icon, and a small-stack icon, and b) wherein the large-stack icon is assigned to the largest third of the plurality of groups, the medium-stack icon is assigned to the medium third of the plurality of groups, and the small-stack icon is assigned to the smallest third of the plurality of groups; and (4) retrieve each of the large-stack icon, the medium-stack icon, and the small-stack icon from the system memory and cause each of the large-stack icon, the medium-stack icon, and the small-stack icon to be displayed as visual representations of the plurality of groups of files.

18. The system of claim 17, said plurality of stack icons further comprising a unique empty stack icon that displays a distinct image.

19. The system of claim 17, said computer storage medium further storing a set of property based icons for at least one library, wherein the property based icons include an overlay indicating a common property of files represented by an underlying stack icon.

20. The system of claim 17, said computer-executable instructions further comprising instructions for generating a set of custom thumbnail icons for at least one selected library, wherein the custom thumbnail icons include at least one image from a stack within the at least one selected library.

21. The system of claim 17, said computer executable instructions further comprising instructions for counting the number of files in a selected stack and displaying the number adjacent to or on the icon.

22. The method of claim 15, wherein said overlay is provided by the application that owns the file type.

Referenced Cited
U.S. Patent Documents
4881179 November 14, 1989 Vincent
5060135 October 22, 1991 Levine et al.
5241671 August 31, 1993 Reed et al.
5297250 March 22, 1994 Leroy et al.
5327529 July 5, 1994 Fults
5333266 July 26, 1994 Boaz et al.
5333315 July 26, 1994 Saether et al.
5388196 February 7, 1995 Pajak et al.
5420605 May 30, 1995 Vouri
5461710 October 24, 1995 Bloomfield et al.
5499364 March 12, 1996 Klein et al.
5504852 April 2, 1996 Thompson-Rohrlich
5513306 April 30, 1996 Mills et al.
5544360 August 1996 Lewak et al.
5546527 August 13, 1996 Fitzpatrick
5550852 August 27, 1996 Patel et al.
5559948 September 24, 1996 Bloomfield et al.
5572647 November 5, 1996 Blades
5583982 December 10, 1996 Matheny et al.
5590259 December 31, 1996 Anderson et al.
5596702 January 21, 1997 Stucka
5598524 January 28, 1997 Johnston, Jr. et al.
5600778 February 4, 1997 Swanson et al.
5606669 February 25, 1997 Bertin et al.
5625783 April 29, 1997 Ezekiel
5630042 May 13, 1997 McIntosh et al.
5648795 July 15, 1997 Vouri
5652876 July 29, 1997 Ashe
5675520 October 7, 1997 Pitt
5680563 October 21, 1997 Edelman
5684969 November 4, 1997 Ishida
5696486 December 9, 1997 Poliquin et al.
5696914 December 9, 1997 Nahaboo
5710926 January 20, 1998 Maurer
5757925 May 26, 1998 Faybishenko
5760770 June 2, 1998 Bliss
5790121 August 4, 1998 Sklar et al.
5797139 August 1998 Amro
5802516 September 1, 1998 Shwarts et al.
5831606 November 3, 1998 Nakajima et al.
5835094 November 10, 1998 Ermel et al.
5838317 November 17, 1998 Bolnick et al.
5838322 November 17, 1998 Nakajima et al.
5855446 January 5, 1999 Disborg
5867163 February 2, 1999 Kurtenbach
5870088 February 9, 1999 Washington
5875446 February 23, 1999 Brown et al.
5875448 February 23, 1999 Boys
5878410 March 2, 1999 Zbikowski et al.
5886694 March 23, 1999 Breinberg et al.
5899995 May 4, 1999 Millier et al.
5905973 May 18, 1999 Yonezawa et al.
5907703 May 25, 1999 Kronenberg
5907837 May 25, 1999 Ferrel
5909540 June 1, 1999 Carter et al.
5923328 July 13, 1999 Griesmer
5929854 July 27, 1999 Ross
5930801 July 27, 1999 Falkenhainer
5933139 August 3, 1999 Feigner et al.
5935210 August 10, 1999 Stark
5973686 October 26, 1999 Shimogori
5987454 November 16, 1999 Hobbs
5987506 November 16, 1999 Carter et al.
6003040 December 14, 1999 Mital et al.
6008806 December 28, 1999 Nakajima et al.
6014137 January 11, 2000 Burns
6016692 January 25, 2000 Schaenzer et al.
6021262 February 1, 2000 Cote et al.
6023708 February 8, 2000 Mendez et al.
6024843 February 15, 2000 Anderson
6025843 February 15, 2000 Sklar
6037944 March 14, 2000 Hugh
6055540 April 25, 2000 Snow
6055543 April 25, 2000 Christensen et al.
6061059 May 9, 2000 Taylor
6061692 May 9, 2000 Thomas et al.
6061695 May 9, 2000 Slivka et al.
6065012 May 16, 2000 Balsara et al.
6078924 June 20, 2000 Ainsbury et al.
6097389 August 1, 2000 Morris et al.
6101509 August 8, 2000 Hanson
6144968 November 7, 2000 Zellweger
6147601 November 14, 2000 Sandelman et al.
6160552 December 12, 2000 Wilsher
6175364 January 16, 2001 Wong et al.
6181342 January 30, 2001 Niblack
6202061 March 13, 2001 Khosla et al.
6216122 April 10, 2001 Elson
6237004 May 22, 2001 Dodson et al.
6237011 May 22, 2001 Ferguson et al.
6240407 May 29, 2001 Chang et al.
6240421 May 29, 2001 Stolarz
6243094 June 5, 2001 Sklar
6243724 June 5, 2001 Mander et al.
6246411 June 12, 2001 Strauss
6256031 July 3, 2001 Meijer et al.
6268852 July 31, 2001 Lindhorst et al.
6275829 August 14, 2001 Angiulo et al.
6279016 August 21, 2001 De Vorchick et al.
6301586 October 9, 2001 Yang et al.
6308173 October 23, 2001 Glasser et al.
6317142 November 13, 2001 Decoste et al.
6324541 November 27, 2001 De I'etraz et al.
6324551 November 27, 2001 Lamping et al.
6326953 December 4, 2001 Wana
6330007 December 11, 2001 Isreal
6339767 January 15, 2002 Rivette et al.
6341280 January 22, 2002 Glass et al.
6342907 January 29, 2002 Petty
6356863 March 12, 2002 Sayle
6356915 March 12, 2002 Chtchetkine et al.
6363377 March 26, 2002 Kravets et al.
6363400 March 26, 2002 Chtchetkine et al.
6369840 April 9, 2002 Barnett et al.
6377283 April 23, 2002 Thomas
6401097 June 4, 2002 McCotter et al.
6405265 June 11, 2002 Kronenberg
6408298 June 18, 2002 Van
6411311 June 25, 2002 Rich et al.
6425120 July 23, 2002 Morganelli et al.
6425121 July 23, 2002 Phillips
6430575 August 6, 2002 Dourish et al.
6430835 August 13, 2002 Ranucci et al.
6437807 August 20, 2002 Berquist et al.
6438590 August 20, 2002 Gartner
6448985 September 10, 2002 McNally
6453311 September 17, 2002 Powers, III
6453319 September 17, 2002 Mattis et al.
6462762 October 8, 2002 Ku
6466228 October 15, 2002 Ulrich et al.
6466238 October 15, 2002 Berry et al.
6466932 October 15, 2002 Dennis et al.
6470344 October 22, 2002 Kothuri et al.
6473100 October 29, 2002 Beaumont et al.
6480835 November 12, 2002 Light
6483525 November 19, 2002 Tange
6505233 January 7, 2003 Hanson et al.
6513038 January 28, 2003 Hasegawa et al.
6519612 February 11, 2003 Howard et al.
6526399 February 25, 2003 Coulson et al.
6535229 March 18, 2003 Kraft
6535230 March 18, 2003 Celik
6539399 March 25, 2003 Hazama et al.
6544295 April 8, 2003 Bodnar
6549217 April 15, 2003 De Greef et al.
6549916 April 15, 2003 Sedlar
6563514 May 13, 2003 Samar
6571245 May 27, 2003 Huang et al.
6573906 June 3, 2003 Harding et al.
6573907 June 3, 2003 Madrane
6583799 June 24, 2003 Manolis et al.
6590585 July 8, 2003 Suzuki et al.
6606105 August 12, 2003 Quartetti
6613101 September 2, 2003 Mander et al.
6628309 September 30, 2003 Dodson et al.
6636238 October 21, 2003 Amir et al.
6636250 October 21, 2003 Gasser
6638313 October 28, 2003 Freeman
6658406 December 2, 2003 Mazner et al.
6662198 December 9, 2003 Satyanarayanan et al.
6684222 January 27, 2004 Cornelius et al.
6721760 April 13, 2004 Ono
6735623 May 11, 2004 Prust
6738770 May 18, 2004 Gorman
6745206 June 1, 2004 Mandler et al.
6745207 June 1, 2004 Reuter et al.
6751626 June 15, 2004 Brown et al.
6754829 June 22, 2004 Butt et al.
6760721 July 6, 2004 Chasen
6762776 July 13, 2004 Huapaya
6762777 July 13, 2004 Carroll
6763458 July 13, 2004 Watanabe et al.
6763777 July 20, 2004 Rosenberg
6768999 July 27, 2004 Prager et al.
6784900 August 31, 2004 Dobronsky et al.
6784925 August 31, 2004 Tomat et al.
6795094 September 21, 2004 Watanabe et al.
6801909 October 5, 2004 Delgado et al.
6801919 October 5, 2004 Hunt et al.
6803926 October 12, 2004 Lamb et al.
6813474 November 2, 2004 Robinson et al.
6816863 November 9, 2004 Bates et al.
6820083 November 16, 2004 Nagy et al.
6823344 November 23, 2004 Isensee et al.
6826443 November 30, 2004 Makinen
6847959 January 25, 2005 Arrouye et al.
6853391 February 8, 2005 Bates et al.
6865568 March 8, 2005 Chau
6871348 March 22, 2005 Cooper
6876900 April 5, 2005 Czajkowski et al.
6876996 April 5, 2005 Czajkowski et al.
6880132 April 12, 2005 Uemura
6883009 April 19, 2005 Yoo
6883146 April 19, 2005 Prabhu et al.
6906722 June 14, 2005 Hrebejk et al.
6910049 June 21, 2005 Fenton et al.
6922709 July 26, 2005 Goodman
6925608 August 2, 2005 Neale et al.
6938207 August 30, 2005 Haynes
6944647 September 13, 2005 Shah et al.
6947959 September 20, 2005 Gill
6948120 September 20, 2005 Delgobbo
6950818 September 27, 2005 Dennis et al.
6950989 September 27, 2005 Rosenzweig et al.
6952714 October 4, 2005 Peart
6952724 October 4, 2005 Prust
6980993 December 27, 2005 Horvitz et al.
6983424 January 3, 2006 Dutta
7010755 March 7, 2006 Anderson et al.
7024427 April 4, 2006 Bobbitt et al.
7028262 April 11, 2006 Estrada et al.
7043472 May 9, 2006 Aridor et al.
7047498 May 16, 2006 Lui
7051291 May 23, 2006 Sciammarella et al.
7062500 June 13, 2006 Hall et al.
7062718 June 13, 2006 Kodosky et al.
7068291 June 27, 2006 Roberts et al.
7100150 August 29, 2006 Polk
7106843 September 12, 2006 Gainsboro
7139811 November 21, 2006 Lev Ran et al.
7149729 December 12, 2006 Kaasten et al.
7168051 January 23, 2007 Robinson et al.
7194743 March 20, 2007 Hayton
7203948 April 10, 2007 Mukundan et al.
7216289 May 8, 2007 Kagle
7216301 May 8, 2007 Moehrle
7219302 May 15, 2007 O'Shaughnessy et al.
7240292 July 3, 2007 Hally et al.
7243334 July 10, 2007 Berger et al.
7275063 September 25, 2007 Horn
7290245 October 30, 2007 Skjolsvold
7293031 November 6, 2007 Dusker et al.
7383494 June 3, 2008 Krolczyk et al.
7409382 August 5, 2008 Kido
7415484 August 19, 2008 Tulkoff et al.
7496859 February 24, 2009 Watanabe
20010034733 October 25, 2001 Prompt et al.
20010034771 October 25, 2001 Hutsch et al.
20010047368 November 29, 2001 Oshinsky et al.
20010049675 December 6, 2001 Mandler et al.
20010053996 December 20, 2001 Atkinson
20010056434 December 27, 2001 Kaplan et al.
20010056508 December 27, 2001 Arneson et al.
20020010736 January 24, 2002 Marques et al.
20020019935 February 14, 2002 Andrew et al.
20020033844 March 21, 2002 Levy et al.
20020046232 April 18, 2002 Adams et al.
20020046299 April 18, 2002 Lefeber et al.
20020049717 April 25, 2002 Routtenberg et al.
20020052885 May 2, 2002 Levy
20020054167 May 9, 2002 Hugh
20020059199 May 16, 2002 Harvey
20020062310 May 23, 2002 Marmor et al.
20020063734 May 30, 2002 Khalfay et al.
20020070965 June 13, 2002 Austin
20020075310 June 20, 2002 Prabhu et al.
20020075312 June 20, 2002 Amadio et al.
20020075330 June 20, 2002 Rosenzweig et al.
20020087652 July 4, 2002 Davis et al.
20020087740 July 4, 2002 Castanho et al.
20020087969 July 4, 2002 Brunheroto et al.
20020089540 July 11, 2002 Geier et al.
20020091679 July 11, 2002 Wright
20020091697 July 11, 2002 Huang et al.
20020091739 July 11, 2002 Ferlitsch et al.
20020095416 July 18, 2002 Schwols
20020097278 July 25, 2002 Mandler et al.
20020100039 July 25, 2002 Iatropoulos et al.
20020103998 August 1, 2002 DeBruine
20020104069 August 1, 2002 Gouge et al.
20020107973 August 8, 2002 Lennon et al.
20020111942 August 15, 2002 Campbell et al.
20020113821 August 22, 2002 Hrebejk et al.
20020120505 August 29, 2002 Henkin et al.
20020120604 August 29, 2002 Labarge et al.
20020120757 August 29, 2002 Sutherland et al.
20020129033 September 12, 2002 Hoxie et al.
20020138552 September 26, 2002 DeBruine et al.
20020138582 September 26, 2002 Chandra et al.
20020138744 September 26, 2002 Schleicher et al.
20020144155 October 3, 2002 Bate et al.
20020145756 October 10, 2002 Stanley et al.
20020149888 October 17, 2002 Motonishi et al.
20020152262 October 17, 2002 Arkin et al.
20020152267 October 17, 2002 Lennon
20020156895 October 24, 2002 Brown
20020161800 October 31, 2002 Eld et al.
20020163572 November 7, 2002 Center et al.
20020169678 November 14, 2002 Chao et al.
20020174329 November 21, 2002 Bowler et al.
20020181398 December 5, 2002 Szlam
20020184357 December 5, 2002 Traversat et al.
20020188605 December 12, 2002 Adya et al.
20020188621 December 12, 2002 Flank et al.
20020188735 December 12, 2002 Needham et al.
20020194252 December 19, 2002 Powers, III
20020196276 December 26, 2002 Corl et al.
20020199061 December 26, 2002 Friedman et al.
20030001964 January 2, 2003 Masukura et al.
20030009484 January 9, 2003 Hamanaka et al.
20030014415 January 16, 2003 Weiss et al.
20030018657 January 23, 2003 Monday
20030018712 January 23, 2003 Harrow et al.
20030028610 February 6, 2003 Pearson
20030033367 February 13, 2003 Itoh
20030037060 February 20, 2003 Kuehnel
20030041178 February 27, 2003 Brouk et al.
20030046260 March 6, 2003 Satyanarayanan et al.
20030063124 April 3, 2003 Melhem et al.
20030069893 April 10, 2003 Kanai et al.
20030069908 April 10, 2003 Anthony et al.
20030074356 April 17, 2003 Kaier et al.
20030076322 April 24, 2003 Ouzts et al.
20030078918 April 24, 2003 Souvignier et al.
20030079038 April 24, 2003 Robbin et al.
20030091007 May 15, 2003 Cyr et al.
20030081002 May 1, 2003 De Vorchik et al.
20030084425 May 1, 2003 Glaser
20030085918 May 8, 2003 Beaumont et al.
20030093321 May 15, 2003 Bodmer et al.
20030093531 May 15, 2003 Yeung et al.
20030093580 May 15, 2003 Thomas et al.
20030097361 May 22, 2003 Huang et al.
20030098881 May 29, 2003 Nolte et al.
20030098893 May 29, 2003 Makinen et al.
20030101200 May 29, 2003 Koyama et al.
20030105745 June 5, 2003 Davidson et al.
20030107597 June 12, 2003 Jameson
20030110188 June 12, 2003 Howard et al.
20030115218 June 19, 2003 Bobbitt et al.
20030117403 June 26, 2003 Park et al.
20030117422 June 26, 2003 Hiyama et al.
20030120678 June 26, 2003 Hill et al.
20030120928 June 26, 2003 Cato et al.
20030120952 June 26, 2003 Tarbotton et al.
20030122873 July 3, 2003 Dieberger et al.
20030126136 July 3, 2003 Omoigui
20030126212 July 3, 2003 Morris et al.
20030135495 July 17, 2003 Vagnozzi
20030135513 July 17, 2003 Quinn et al.
20030135517 July 17, 2003 Kauffman
20030135659 July 17, 2003 Bellotti et al.
20030140115 July 24, 2003 Mehra
20030154185 August 14, 2003 Suzuki et al.
20030158855 August 21, 2003 Farnham et al.
20030177422 September 18, 2003 Taroukhine et al.
20030184587 October 2, 2003 Ording et al.
20030195950 October 16, 2003 Huang et al.
20030210281 November 13, 2003 Ellis et al.
20030212664 November 13, 2003 Breining
20030212680 November 13, 2003 Bates et al.
20030212710 November 13, 2003 Guy
20030222915 December 4, 2003 Marion et al.
20030225796 December 4, 2003 Matsubara
20030227480 December 11, 2003 Polk
20030227487 December 11, 2003 Hugh
20030233419 December 18, 2003 Beringer
20040001106 January 1, 2004 Deutscher et al.
20040002993 January 1, 2004 Toussaint et al.
20040003247 January 1, 2004 Fraser et al.
20040004638 January 8, 2004 Babaria
20040006549 January 8, 2004 Mullins et al.
20040008226 January 15, 2004 Manolis et al.
20040019584 January 29, 2004 Greening et al.
20040019655 January 29, 2004 Uemura et al.
20040019875 January 29, 2004 Welch
20040030731 February 12, 2004 Iftode et al.
20040044696 March 4, 2004 Frost
20040044776 March 4, 2004 Larkin
20040054674 March 18, 2004 Carpenter et al.
20040056894 March 25, 2004 Zaika et al.
20040056896 March 25, 2004 Doblmayr et al.
20040059755 March 25, 2004 Farrington
20040068524 April 8, 2004 Aboulhosn et al.
20040070612 April 15, 2004 Sinclair et al.
20040073705 April 15, 2004 Madril, Jr. et al.
20040083433 April 29, 2004 Takeya
20040085581 May 6, 2004 Tonkin
20040088374 May 6, 2004 Webb et al.
20040091175 May 13, 2004 Beyrouti
20040098370 May 20, 2004 Garland et al.
20040098379 May 20, 2004 Huang
20040098742 May 20, 2004 Hsieh et al.
20040103073 May 27, 2004 Blake et al.
20040103280 May 27, 2004 Balfanz et al.
20040105127 June 3, 2004 Cudd et al.
20040117358 June 17, 2004 Von Kaenel et al.
20040117405 June 17, 2004 Short et al.
20040128322 July 1, 2004 Nagy
20040133572 July 8, 2004 Bailey et al.
20040133588 July 8, 2004 Kiessig et al.
20040133845 July 8, 2004 Forstall et al.
20040142749 July 22, 2004 Ishimaru et al.
20040143349 July 22, 2004 Roberts et al.
20040148434 July 29, 2004 Matsubara et al.
20040153451 August 5, 2004 Phillips et al.
20040153968 August 5, 2004 Ching et al.
20040167942 August 26, 2004 Oshinsky et al.
20040168118 August 26, 2004 Wong
20040174396 September 9, 2004 Jobs et al.
20040177116 September 9, 2004 McConn et al.
20040177148 September 9, 2004 Tsimelzon, Jr.
20040177319 September 9, 2004 Horn
20040181516 September 16, 2004 Ellwanger et al.
20040183824 September 23, 2004 Benson et al.
20040189704 September 30, 2004 Walsh et al.
20040189707 September 30, 2004 Moore et al.
20040193594 September 30, 2004 Moore et al.
20040193599 September 30, 2004 Liu et al.
20040193600 September 30, 2004 Kaasten et al.
20040193621 September 30, 2004 Moore et al.
20040193672 September 30, 2004 Samji et al.
20040193673 September 30, 2004 Samji et al.
20040199507 October 7, 2004 Tawa
20040205168 October 14, 2004 Asher
20040205625 October 14, 2004 Banatwala et al.
20040205633 October 14, 2004 Martinez et al.
20040205698 October 14, 2004 Schliesmann et al.
20040215600 October 28, 2004 Aridor et al.
20040220899 November 4, 2004 Barney et al.
20040223057 November 11, 2004 Oura et al.
20040225650 November 11, 2004 Cooper et al.
20040230572 November 18, 2004 Omoigui
20040230599 November 18, 2004 Moore et al.
20040230917 November 18, 2004 Bales et al.
20040233235 November 25, 2004 Rubin et al.
20040243597 December 2, 2004 Jensen et al.
20040249902 December 9, 2004 Tadayon et al.
20040255048 December 16, 2004 Lev Ran et al.
20040257169 December 23, 2004 Nelson
20050004928 January 6, 2005 Hamer et al.
20050010860 January 13, 2005 Weiss et al.
20050015405 January 20, 2005 Plastina et al.
20050027757 February 3, 2005 Kiessig et al.
20050050470 March 3, 2005 Hudson et al.
20050055306 March 10, 2005 Miller et al.
20050071355 March 31, 2005 Cameron et al.
20050080807 April 14, 2005 Beilinson et al.
20050097477 May 5, 2005 Camara et al.
20050114672 May 26, 2005 Duncan et al.
20050120242 June 2, 2005 Mayer et al.
20050131903 June 16, 2005 Margolus et al.
20050131905 June 16, 2005 Margolus et al.
20050138567 June 23, 2005 Smith et al.
20050149481 July 7, 2005 Hesselink et al.
20050165753 July 28, 2005 Chen et al.
20050166159 July 28, 2005 Mondry et al.
20050171947 August 4, 2005 Gautestad
20050192953 September 1, 2005 Neale et al.
20050192966 September 1, 2005 Hilbert et al.
20050243993 November 3, 2005 McKinzie et al.
20050246331 November 3, 2005 De Vorchik et al.
20050246643 November 3, 2005 Gusmorino et al.
20050246664 November 3, 2005 Michelman et al.
20050256909 November 17, 2005 Aboulhosn et al.
20050257169 November 17, 2005 Tu
20050283476 December 22, 2005 Kaasten et al.
20060004692 January 5, 2006 Kaasten et al.
20060020586 January 26, 2006 Prompt et al.
20060036568 February 16, 2006 Moore et al.
20060080308 April 13, 2006 Carpentier et al.
20060129627 June 15, 2006 Phillips et al.
20060173873 August 3, 2006 Prompt et al.
20060200455 September 7, 2006 Wilson
20060200466 September 7, 2006 Kaasten et al.
20060200832 September 7, 2006 Dutton
20060218122 September 28, 2006 Poston et al.
20070180432 August 2, 2007 Gassner et al.
Foreign Patent Documents
1421800 November 2001 CN
2329492 July 1998 GB
09244940 September 1997 JP
2001067250 March 2001 JP
2001142766 May 2001 JP
2001154831 June 2001 JP
2001188702 July 2001 JP
2002099565 April 2002 JP
2002182953 June 2002 JP
2002334103 November 2002 JP
2002269145 April 2004 JP
20042749 August 2009 NO
WO9322738 November 1993 WO
WO9412944 June 1994 WO
WO9414281 June 1994 WO
9938092 July 1999 WO
WO9949663 September 1999 WO
WO0051021 August 2000 WO
01/63919 August 2001 WO
WO0157867 August 2001 WO
WO0167668 September 2001 WO
WO 0225420 March 2002 WO
WO03001720 January 2003 WO
WO 2004107151 September 2004 WO
WO2004097680 November 2004 WO
Other references
  • Written Opinion of Singapore Application No. 200403220-7 dated May 18, 2006.
  • Microsoft Press Pass, “Windows XP is Here!”, New York, Oct. 25, 2001.
  • Microsoft, “Microsoft Windows XP Professional Product Documentation” section: (1) To Change how you view items in a folder, (2) Viewing files and folders overview, (3) To associate a file with a program, (4) To Change or remove a program, copyright 2006, publication date unknown.
  • McFedries, Paul, “The Complete Idiot's Guide to Windows XP”, Table of Contents, Oct. 3, 2001; Alpha Books, Chapter 8: A Tour of the My Pictures Folder—printed pp. 1-8, Chapter 11: Sights and Sounds: Music and Other Multimedia-printed pp. 1-3.
  • Stanek R. William, “Microsoft Windows XP Professional Administrator's Pocket Consultant”, Sep. 25, 2001; Microsoft Press, Chapter 9, printed pp. 1-8.
  • Shah, Sarju, “Windows XP Preview”, FiringSquad, May 4, 2001, online, printed pp. 1-5; Figure: Hi-Res Image Viewer.
  • European Search Report for 03007909.9-2211 dated Jun. 30, 2006.
  • D. Esposito, More Windows 2000 UI Goodies: Extending Explorer Views by Customizing Hypertext Template Files, MSDN Magazine, <http://msdn.microsoft.com/msdnmag/issues/0600/w2kui2/default.aspx?print=true?, first date of publication unknown but no later than Jun. 2000, 15 pages.
  • Microsoft: “Microsoft Windows 2000 Professional Step by Step—Lesson 3—Managing Files and Folders” <http://www.microsoft.com/mspress/books/sampshap/1589.asp>, Jan. 5, 2000, 12 pages.
  • Australian Search Report for SG 200301764-7 dated Mar. 30, 2006.
  • D. Esposito, Visual C++ Windows Shell Programming, Dec. 1, 1998, Apress, ISBN 1861001843, pp. 463-469.
  • P. DiLascia, “More Fun with MFC:DIBs, Palettes, Subclassing, and a Gamut of Goodies, Part III”, Microsoft Systems Journal, Jun. 1997, 20 pages.
  • Australian Written Opinion for SG 200301764-7 dated Mar. 30, 2006.
  • Windows Commander, <http://web.archive.org/web/20030207145141/www.ghisler.com/featurel.htm> (Feb. 7, 2003) and <http://web.archive.org/web/20021017022627/www.ghisler.com/addons.htm> (Oct. 17, 2002), 7 pages.
  • Directory Opus 6.1—Viewer SDK Plugin SDK 1.0, GP Software, 2001, <http://web.archive.org/web/20030219151121/ www.gpsoft.com.au/Developer.html>, first date of publication unknown but, prior to Feb. 19, 2003, 30 pages.
  • Wikipedia, File Allocation Table, 2006, <http://en.wikipedia.org/wiki/File—Allocation—Table>.
  • Cohen, et al., “A Case for Associative Peer to Peer Overlays”-ACM SIGCOMM Computer Communications Review, vol. 33, No. 1, Jan. 2003, pp. 95-100.
  • Lui, et al., “Interoperability of Peer-to-Peer File Sharing Protocols”-ACM SIGecom Exchanges, vol. 3, No. 3, Aug. 2002, pp. 25-33.
  • Adobe, Inc., et al., “Adobe Photoshop CS Classroom in a Book,” Dec. 1, 2003, pp. 1-29.
  • Adobe, Inc., et al., “Adobe Photoshop 7.0”, 2001; pp. 1-9.
  • Heinlein, et al., “Integration of Message Passing and Shared Memory in the Stanford FLASH Multiprocessor, Architectural Support for Programming Languages and Operating Systems,” pp. 38-50, published 1994.
  • Louis, et al., “Context Learning Can Improve User Interaction Information Reuse and Integration,” Proceedings of the 2004 IEEE International Conference on, pp. 115-120, Nov. 8-10, 2004.
  • Microsoft Windows XP Version 2002 (Screen Dumps, Figs. 1-16).
  • Simpson, Alan, Windows 95 Uncut, 1995, IDG Books Worldwide, Inc., pp. 104-107.
  • Feng, et al., “Schemata Transformation of Object-Oriented Conceptual Models to XML”, Computer systems Science & Engineering, vol. 18, No. 1, Jan. 2003.
  • Joseph, M., “The UML for Data Modellers,” Elektron, Apr. 2004, pp. 72-73.
  • Wang, G., et al., “Extending XML Schema with Nonmonotonic Inheritance,” in M.A. Jesufeld and O. Paster (eds.), ER 2003 Workshops, Lecture Notes in Computer Science 2814:402-407,2003.
  • Lee, J., “An End-User Perspective on File-Sharing Systems,” Communications of the ACM 46(2):49-53, Feb. 2003.
  • Ohtani, A., et al., “A File Sharing Method for Storing Area Network and Its Performance Verification,” NEC Res. & Develop. 44(1):85-90, Jan. 2003.
  • H. Weinreich, et al., “The Look of the Link—Concepts of the User Interface of Extended Hyperlinks,” Proceedings of the Twelfth ACM Conference on Hypertext and Hypermedia, Hypertext '01, Aarhus, Denmark, Aug. 2001, pp. 19-28.
  • Seltzer, M., et al., “Journaling Versus Soft Updates: Asynchronous Meta-data Protection in File Systems,” Proceedings of the 2000 USENIX Technical Conference, San Diego, CA, Jun. 18-23, 2000, pp. 71-84.
  • R. Rao, et al., “Rich Interaction in the Digital Library,” Communications of the ACM 38(4):29-39.1995.
  • Piernas, J., et al., “DualFS: A New Journaling File System Without Meta-Data Duplication,” Conference Proceedings of the 2002 International Conference on SUPERCOMPUTING, New York, Jun. 22-26, 2002, p. 137-146.
  • Manber, U., and S. Wu, “GLIMPSE: A Tool to Search Through Entire File Systems,” Proceedings of USENIX Winter 1994 Conference, San Francisco, CA, Jan. 17-21, 1994.
  • Coster, R., and D. Svensson, “Inverted File Search Algorithms for Collaborative Filtering,” Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Tampere, Finland, Aug. 11-15, 2002.
  • Gifford, D.K., et al., “Semantic File Systems,” Proceedings of the 13th ACM Symposium on Operating Systems Principles, Pacific Grove CA., Sep. 1991, pp. 16-25.
  • Blair, C., and G.E. Monahan, “Optimal Sequential File Search: A Reduced-State Dynamic Programming Approach,” European Journal of Operational Research 86(2):358-365, 1995.
  • Clay, L.M., et al., Posting Protocol for Improved Keyword Search Success in Peer-to-Peer File Sharing Systems, Proceedings of SPIE-Int. Soc. Opt. Eng., Santa Clara, CA, Jan. 23-24, 2003, vol. 5019, pp. 138-149.
  • Na, J., and V. Rajaravivarma, “Multimedia File Sharing in Multimedia Home or Office Business Networks,” Proceedings of the 35th Southeastern Symposium on System Theory, Morgantown, W. VA., Mar. 16-18, 2003, pp. 237-241.
  • Kwon G., and K.D. Ryu, “An Efficient Peer-to-Peer File Sharing Exploiting Hierarchy and Asymmetry,” Proceedings of the 2003 Symposium on Applications and the Internet, Orlando, Fla., Jan. 27-31, 2003, pp. 226-233.
  • Qian, J., et al., “ACLA: A Framework for Access Control List (ACL) Analysis and Optimization,” Fifth Joint Working Conference on Communications and Multimedia Security, Darnstadt, Germany, May 21-22, 2001, pp. 197-211.
  • Rao, J.R., “Some Performance Measures of File Sharing on Multiple Computer Systems,” Proceedings of the Conference on Modeling and Simulation, vol. 6, Part I, Pittsburgh, Penn., Apr. 24-25, 1976, pp. 527-530.
  • Reinauer, R., “UNIX System V.# Remote File Sharing Capabilities and Administration,” Unisphere 8(6):64-68, Sep. 1988.
  • Templin, P.J., Jr., “Providing a Centralized File Sharing Resource at Bucknell University”, Proceedings of the User Services Conference for College and University Computing Services Organization, Bloomington, Ind., Oct. 25-28, 1998, pp. 289-292.
  • Yamai, N. et al., “NFS-Based Secure File Sharing Over Multiple Administrative Domains With Minimal Administration,” Systems and Computers in Japan 33(14):50-58, Dec. 2002.
  • Yong Kyu Lee, et al., Metadata Management of the SANtopia File System, Proceedomgs of the 8th International Conference onParallel and Distributed Systems (ICPADS 2001), Kyoungju City, Korea, Jun. 26-29, 2001, pp. 492-499, IEEE Computer Society, 2001, ISBN 0-7695-1153-8.
  • Horst F. Wedde, et al., A Universal Framework for Managing Metadata in the Distributed Dragon Slayer System, Proceedings of the 26th EUROMICRO Conference (EUROMICRO'00), vol. 2, Maastricht, The Netherlands, Sep. 5-7, 2000, pp. 96-101, IEEE Computer Society, 2000, ISBN 1089-6503.
  • Jolon Faichney, et al., Goldleaf Hierarchical Document Browser, Second Australian User Interface Conference (AUIC'01), Gold Coast, Queensland, Australia, Jan. 29-Feb. 1, 2001, pp. 13-20, IEEE Computer Society, 2001, ISBN 0-7695-0969-X.
  • Dino Esposito, New Graphical Interface: Enhance Your Programs with New Windows XP Shell Features, MSDN Magazine, Nov. 2001, vol. 16, No. 11.
  • Stuart Yeates, et al., Tag Insertion Complexity, Data Compression Conference, (DCC 2001), Snowbird, Utah, USA, Mar. 27-29, 2001,pp. 243-252, IEEE Computer Society2001, ISBN 1068-0314.
  • Bipin C. Desai, et al., Resource Discovery: Modeling, Cataloguing and Searching, Seventh International Workshop on Database and Expert Systems Applications (DEXA'96), Zurich, Switzerland, Sep. 9-10, 1996, pp. 70-75, IEEE-CS Press, 1996, ISBN 0-8186-7662-0.
  • Gulrukh Ahanger, et al., Automatic Composition Techniques for Video Production, IEEE Transactions on Knowledge and Data Engineering, Nov./Dec. 1998, pp. 967-987, vol. 10, No. 6, IEEE Computer Society, 1998, ISBN 1041-4347.
  • Jane Hunter, An Overview of the MPEG-7 Description Language (DDL), IEEE Transactions on Circuits and Systems for Video Technology, Jun. 2001, pp. 765-772, vol. 11, No. 6, IEEE Computer Society, 2001, ISBN 1051-8215.
  • Philippe Salembier, et al., MPEG-7 Multimedia Description Schemes, IEEE Transactions on Circuits and Systems for Video Technology, Jun. 2001, pp. 748-759, vol. 11, No. 6, IEEE Computer Society, 2001, ISBN 1051-8215.
  • Thomas Sikora, The MPEG-7 Visual Standard for Content Description—An Overview, IEEE Transactions on Circuits and Systems for Video Technology, Jun. 2001, pp. 696-702, vol. 11, No. 6, IEEE Computer Society, 2001, ISBN 1051-8215.
  • B.S. Manjunath, Et al., Color and Texture Descriptors, IEEE Transactions on Circuits and Systems for Video Technology, Jun. 2001, pp. 703-715, vol. 11, No. 6, IEEE Computer Society, 2001, ISBN 1051-8215.
  • “Predefined Properties” http://help.sap.comIsaphelp—ep50sp5/helpdata/en/Ia/9a4a3b80f2ec40aa7456bc87a94259/content.htm.
  • “Info Vision Infonnation Management System” http://66.1 02. 7.1 04/search?q=cache:m IXV6K6sQOQJ:www.amlib.netlproducts/infovision.htm+customised+multi+property+file+navigation&hl=en.
  • “TdcFolderListView component” http://www.appcontrols.com|manuals|diskcontrols/index.htm1?tdcfolderlistview.htm.
  • “Previewing Files” http://developer.apple.com|documentation/QuickTimeIINMAC/QT/iqMovieToolbox.1a.htm.
  • “Text File Previewer 2.0 Beta” http://www .freedownloadscenter.com|Utilities|Text- Viewers|Text- File ]reviewer.html.
  • “Your Next OS: Windows 2006?” http://www.pcworld.com|newsiarticle/O.aid.II3'631.OO.asp.
  • “GetOpenFileName Function,” downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 28, 2005; 2 pages.
  • “GetSaveFileName Function,” downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 28, 2005; 2 pages.
  • “Using Common Dialog Boxes,” downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 28, 2005; 8 pages.
  • “How to Use a Common Dialog File Open Dialog with Win32 API,” downloaded from <http://support.microsoft.com>; date of first publication prior to Mar. 28, 2005; 3 pp.
  • “Creating an Enhanced Metafile,” downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 28, 2005; 2 pages.
  • “Common Dialog Box Library,” downloaded from <http://msdn.microsoft.com>: date of first publication prior to Mar. 28, 2005; 8 pages.
  • “OPENFILENAME Structure,” downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 28, 2005; 7 pages.
  • “Open and Save as Dialog Boxes,” downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 29, 2005; 9 pages.
  • “Customizing common dialog boxes,” downloaded from http://msdn.microsoft.com; date for first publication prior to Apr. 20, 2005, 4 pages.
  • G.D. Venolia, et al., Supporting Email Workflow. Microsoft Research Technical Report MSR-TR-2001-88. Revised Dec. 2001 (Original Sep. 2001). Microsoft Corporation. Redmond, WA.
  • G.D. Venolia and C. Neustaedter. Understanding Sequence and Reply Relationships within Email Converstations: A Mixed-Model Visualization. Microsoft Research Technical Report MSR-TR-2002-102. Sep. 23, 2002 (Revised Jan. 13, 2003).
  • Microsoft Digital Image Suite User's Manual, Version 9.0. pp. 105-118, Available: http://www.microsoft.com/products/imaging/guides/SuiteManual.pdf, Apr. 30, 2004.
  • “Using Tags to Organize Your Photos.”, Adobe Photoshop Album 2.0 Tutorial, Available: http://www.adobe.com/digitalimag/tips/phsaltaggin/pdfs/phsaltaggin.pdf, Apr. 30, 2004.
  • Examples of dialogs user interfaces; date of first publication prior to Mar. 31, 2005; 8 pages.
  • “Visually Theming and Styling Your Applications and Documents” (CLI 308); downloaded from <http://msdn.microsoft.com/longhorn/pdcmaterials/pdctalksavalon/>; date of first publication prior to Mar. 31, 2005; 34 pages.
  • New User Interface Possibilities in Longhorn (CLI 304); downloaded from <http://msdn.microsoft.com/longhorn/pdcmaterials/pdctalksavalon/>; date of first publication prior to Mar. 31, 2005; 45 pages.
  • Windows Forms: Exploiting Windows Longhorn“Features from Within Your Application” (CLI 391); downloaded from http://msdn.microsoft.com/longhorn/pdcmaterials/pdctalksavalon/>; date of first publication prior to Mar. 31, 2005; 27 pages.
  • MessageBox Function; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 4 pages.
  • Creating and Installing Theme Files; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Feb. 21, 2005; 4 pages.
  • “About Dialog Boxes”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Feb. 21, 2005; 10 pages.
  • “Property Sheets and Inspectors”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Feb. 21, 2005; 6 pages.
  • “PROPSHEETPAGE”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Feb. 21, 2005; 3 pages.
  • “DialogProc Function”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Feb. 21, 2005; 2 pages.
  • “Creating Wizards”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 17 pages.
  • “Property Sheets”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 7 pages.
  • “Property Sheet Reference”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 5 pages.
  • “DRAWITEMSTRUCT Structure”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Feb. 25, 2005; 3 pages.
  • “Using Buttons”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Feb. 25, 2005; 5 pages.
  • Button Messages; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Feb. 25, 2005; 4 pages.
  • “Button Styles”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Feb. 25, 2005; 2 pages.
  • “CreateWindow Function”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Feb. 25, 2005; 5 pages.
  • “Using Dialog Boxes”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 8 pages.
  • “CreatePropertySheetPage Function”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “DestroyPropertySheetPage Function”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PropertySheet Function”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 2 pages.
  • “PropSheetPageProc Function”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 2 pages.
  • “PropSheetProc Function”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 2 pages.
  • “PSN—KILLACTIVE Notification”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSN—QUERYCANCEL Notification”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSN—RESET Notification”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSN—SETACTIVE Notification”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSN—TRANSLATEACCELERATOR Notification”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSN—WIZBACK Notification”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 3 pages.
  • “PSN—WIZFINISH Notification” ; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSN—WIZNEXT Notification”; downloaded from <http://msdn.microsoft.com; date of first publication prior to Mar. 31, 2005; 3 page.
  • “PSM—ADDPAGE Message”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 2 pages.
  • “PSM—IDTOINDEX Message”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSM—INDEXTOHWND Message”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSM—INDEXTOID Message”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSM—INDEXTOPAGE Message”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSM—PAGETOINDEX Message”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSM—PRESSBUTTON Message”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSM—QUERYSIBLINGS Message” ; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSM—SETCURSEL Message”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSM—SETCURSELID Message”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSM—SETFINISHTEXT Message”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSM—SETHEADERTITLE Message”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSM—SETWIZBUTTONS Message”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 2 pages.
  • “PROPSHEETHEADER Structure” ; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 5 pages.
  • “PROPSHEETPAGE Structure”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 4 pages.
  • “PSHNOTIFY Structure”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “BCM—GETIDEALSIZE Message”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • “PSM—SETTITLE Message”; downloaded from <http://msdn.microsoft.com>; date of first publication prior to Mar. 31, 2005; 1 page.
  • A.T. McCray, et al., Extending the role of Metadata in a Digital Library System, May 19, 1999, IEEE, pp. 190-199.
  • Alexa T. McCray, et al., Principles for Digital Library Development, May 2001, ACM, pp. 49-53.
  • Stelovsky, J., and C. Aschwanden, “Software Architecture for Unified Management of Event Notification and Stream I/O and Its Use for Recording and Analysis of User Events,” Proceedings of the 35th Annual Hawaii International Conference on System Sciences, IEEE Computer Society, Big Island, Hawaii, Jan. 7-10, 2002, p. 1862-1867.
  • “About Managing Messages with Rules”, Microsoft® Outlook® 2003 Help file, 3 pp.
  • “Trillian/Trillian Pro IM Clients” Products Description, © 1999-2004 Cerulean Studios, <http://www.ceruleanstudios.com> [retrieved Apr. 30, 2004].
  • International Search Report of WO2004/097638 A1 (McKee, et al.) dated Nov. 11, 2004.
  • McFedries, Paul; “The Complete Idiot's Guide to Windows XP”, Table of Contents, Oct. 3, 2001; Alpha Books, Ch. 6: Using My Computer to Fiddle w/h Files and Folder-printed p. 1-6, Finding a File in Mess p. 103.
  • Langer, Maria, Mac OS X: Visual QuickStart Guide; Apr. 2001, Peachpit Press, Mac OS X Disk Organization (pp. 1-3), Views (pp. 1-11), Outlines (1-3).
  • Ray, Jay, Mac OS X Unleashed, Nov. 2001, Sams, Chapter 4. The Finder: Working with Files and Applications (pp. 1-15), Getting File Information (pp. 1-7).
  • International Search Report and Written Opinion of PCT/US04/25931 dated Apr. 3, 2007.
  • Kuchinsky, et al., “FotoFile: A Consumer Multimedia Organization and Retrieval System”, May 1999, ACM, pp. 496-503.
  • Written Opinion of SG 200301764-7 dated Jan. 11, 2007.
  • Windows Commander (website), <URL: http://www.ghisler.com>, accessed using http://www.archive.org/web/web.php, in particular, http://web.archive.org/web/20030207145141/www.ghisler.com/featurel.htm, archived on Feb. 7, 2003; http://web.archive.org/web/20021017022627/www.ghisler.com/addons.htm, archived on Oct. 17, 2002; http://web.archive.org/web/20021009213316/www.ghisler.com/efaquser.htm, archived on Oct. 9, 2003; unable to access website.
  • Bott, et al., “Microsoft Windows XP Inside Out”, Microsoft Press, 2001, Chapter 11, 39 pages.
  • Bott, et al., Book titled “Special Edition Using Windows 98, Second Edition”, Dec. 21, 1999, second edition, pp. 1-7.
  • Supplementary European Search Report for EP 04780390 dated Jun. 18, 2007.
  • Ferri, Fernando, et al. “An Object-Oriented Model for a Multi-Media Patient Folder Management System,” ACM SIBGIO Newsletter, vol. 16, Issue 1, Jun. 1996, pp. 2-18.
  • Anonymous, “Organize Your Digital Media Collection,” Jun. 30, 2003, 3 pages, www.microsoft.com/windowsxp/using/windowsmediaplayer/getstarted/organize.mspx.
  • Anciaux, et al., “A Tamper-Resistant and Portable Healthcare Folder,” Hindawai Publishing Corporation, International Journal of Telemedicine and Applications, vol. 2008, Article ID 763534, pp. 1-9.
  • Cohen, J. “The Unofficial Guide to the Workplace Shell,” Apr. 5, 1992, 45 pages, http://www.verfasser.de/web/web.nsf/c5.
  • Cooper, A., “About Face The Essentials of User Interface Design,” IDG Books, 1995, p. 141.
  • Campbell, David, “Extending the Windows Explorer with Name Space Extensions,” Microsoft Systems Journal, Microsoft Corporation, vol. 5, No. 6, Jul. 1996, pp. 89-96.
  • Dorot, V., “Explanatory Dictionary on Modern Computer Vocabulary,” S. Petersburg, BHV-Petersburg, pp. 218-219.
  • Bott, Ed et al., “Master Your Music Library,” May 5, 2003, 7 pages, www.microsoft.com/windowsxp/using/windowsmediaplayer/expert/bott—03may05.mspx.
  • International Search Report of PCT/US05/26655.
  • Rathbone, Andy, “Windows XP for Dummies,” 2001, Wiley Publishing, Inc., pp. 145, 203, 204.
  • Sugasawa, Eiji, “When and What of Pictures Become Clear! How to Readily Organize Images from Digital Cameras,” Nikkei PC Beginners, vol. 2, No. 4, pp. 78-95, Nikkei Business Publications, Inc., Japan.
  • Grosky, et al., “Using Metadata for Intelligent Browsing of Structured Media Objects,” Dec. 1994, Sigmond Record, vol. 23, No. 4, pp. 49-56.
  • Sellen, Abigail J. et al., “How Knowledge Workers Use the Web,” Proceedings of the SIGCHI Conference on Human Factors in Computing Systems: Changing Our World, Changing Ourselves, ACM, 2002, pp. 227-234.
  • Miles, Darryl, “Implementing Windows Terminal Server and Citrix MetaFrame on IBM @ Server X Series Servers,” Apr. 2003, pp. 1-62.
  • Jamsa, K., “1001 Windows 98 Tips,” 1998, 2 pages, Jamsa Press.
  • Sekiguchi, Kumiko, “Visual Basic Q&A,” MSDN Magazine 2001, No. 16, Jul. 18, 2001, pp. 97-103, ASCII Inc., Japan.
  • Capretz, Luiz F. et al., “Component-Based Software Development,” Nov. 2001, pp. 1834-1837, IECON '01, The 27th Annual Conference of the IEEE Industrial Electronics Society.
  • Russionovich, Mark, “Internal Structure of NTFS4.0,” Aug. 1, 2001, pp. 176-182, NIKKEI Windows 2000, vol. 2, No. 53, Nikkei Business Publications, Inc., Japan.
  • Halvorson, Michael, et al, “Microsoft Office XP, Professional Office Manual,” Jul. 23, 2001, pp. 78-80, first edition, Nikkei BP Soft Press.
  • Microsoft Corporation, “Windows 98 Step by Step,” 1998, p. 63, Microsoft Press.
  • Microsoft Windows XP Professional, 1985-2001.
  • Microsoft Windows XP Professional, Screen Shots 1-8, copyright (1985-2001).
  • Microsoft Windows XP Version 2002 Screen Dumps.
  • Olive, et al., “A Generic Metadata Query Tool”, 1999, pp. 1-8.
  • Patent Abstracts of Japan, Publication No. 2002-099565, Information Retrieval Apparatus, Abstract, May 4, 2002, 1 page.
  • Patent Abstracts of Japan, Publication No. 2002-334103, Retrieval Processing System and Retrieval Processing Method, Abstract, Nov. 22, 2002, 1 page.
  • Dourish, Paul, et al., “Presto: An Experimental Architecture for Fluid Interactive Document Spaces,” ACM Transactions on Computer—Human Interaction (TOCHI) Jun. 1999, pp. 133-161, vol. 6, Issue 2, ACM.
  • “Revelle, A Visual Search Tool for Early Elementary Science Students,” Mar. 2002, pp. 49-57, vol. 11, Journal of Science Education and Technology.
  • Zhujun, Xu James, “Survey of Some Mobile Agent System,” Feb. 10, 2003, pp. 1-22.
  • Northrup, Tony, et al., “Plus! Party Mode: Mix Audio and Video in Playlists,” Mar. 17, 2003, 6 pages, www.microsoft.com/windowsxp/using/windowsmediaplayer/expert/northrup—03march17.mspx.
  • Verhoeven, et al., Generic Metadata Tool, 10-19999, pp. 1-8.
  • Server, Garrett, “Previewing Files in the Common Dialog,” Mar. 2, 2003, 3 pages, http://www.elitevb.com/content/01,0084,01/.
  • English translation of Official Notice of Rejection for JP2003125924 dated Nov. 21, 2008.
Patent History
Patent number: 7657846
Type: Grant
Filed: Apr 23, 2004
Date of Patent: Feb 2, 2010
Patent Publication Number: 20050240880
Assignee: Microsoft Corporation (Redmond, WA)
Inventors: Richard M. Banks (Egham), Charles Cummins (Seattle, WA), David G. De Vorchik (Seattle, WA), Paul A. Gusmorino (Seattle, WA), Relja B. Ivanovic (Redmond, WA), Jenny T. Lam (Seattle, WA), Jason F. Moore (Redmond, WA)
Primary Examiner: Simon Ke
Attorney: Shook Hardy & Bacon LLP
Application Number: 10/830,224