This application is generally related to the following jointly owned and co-pending patent applications, each incorporated herein by reference in its entirety:
The disclosed implementations relate generally to storing and restoring data.
A hallmark of modern graphical user interfaces is that they allow a large number of graphical objects or items to be displayed on a display screen at the same time. Leading personal computer operating systems, such as Apple Mac OS®, provide user interfaces in which a number of windows can be displayed, overlapped, resized, moved, configured, and reformatted according to the needs of the user or application. Taskbars, menus, virtual buttons and other user interface elements provide mechanisms for accessing and activating windows even when they are hidden behind other windows.
With the sophisticated tools available, users are encouraged not only to create and save a multitude of items in their computers, but to revise or otherwise improve on them over time. For example, a user can work with a certain file and thereafter save its current version on a storage device. The next day, however, the user could have had second thoughts about the revisions, or could have come up with new ideas, and therefore open the file again.
The revision process is usually straightforward if the user wants to add more material to the file or make changes to what is there. But it is typically more difficult for a user who has changed his/her mind about changes that were previously made and wants the file back as it was once before. Application programs for word processing typically let the user “undo” previous edits of a text, at least up to a predefined number of past revisions. The undo feature also usually is configured so that the previously made revisions must be undone in reverse chronological order; that is, the user must first undo the most recently made edit, then the second-most recent one, and so on. If the user saves and closes the document and thereafter opens it again, it can not be possible to automatically undo any previous edits.
Systems and methods are provided for automatic detection of data loss to system or a particular application. In one implementation, the system prompts a user to the occurrence of data loss and suggests invoking a backup system interface to recover the lost data.
In general, in one aspect, a method is provided. The method includes identifying a loss of data associated with a current view. An alert is generated identifying the loss of data. A user is prompted to initiate a history view to restore the lost data, the history view including at least a first visual representation of an earlier version of the current view.
Implementations of the method can include one or more of the following features. The method can further include receiving, while a current view is displayed, a user input requesting that a history view associated with the current view be displayed. The method can further include receiving, while the history view is displayed, a user input requesting that the current view be modified according to the earlier version. The method can further include modifying, in response to the user input, the current view according to the earlier version. Identifying a loss of data can include comparing current data with previous data. The previous data can be associated with a backup. Identifying a loss of data can include monitoring for events indicating data loss or examining an application for lost data when opened. Generating an alert can include presenting an alert notification, the alert notification indicating data can have been lost and where the alert notification provides one or more options for restoring the lost data.
In general, in one aspect, a method is provided. The method includes invoking an application. A current view of the application in a user interface is presented. A loss of data associated with the application is identified. An alert is generated identifying the loss of data. A user is prompted to initiate a history view to restore the lost data, the history view including at least a first visual representation of an earlier version of the current view of the application.
Implementations of the method can include one or more of the following features. The application can be a music application and the lost data can be a playlist. The application can be a messaging application and the lost data can be one or more e-mail messages. The application can be a messaging application and the lost data can be a calendar. The application can be a messaging application and the lost data can be a contacts list. The application can be a messaging application and the lost data can be a buddy list.
In general, in one aspect, a method is provided. The method includes detecting a loss of data associated with a system. An alert is generated identifying the loss of data. The user is prompted to initiate a history view to restore the lost data, the history view including at least a first representation associated with the lost data. The lost data can be user preference data or can be system setting data.
In general, in one aspect, a method is provided. The method includes evaluating a current view of an application. A determination is made that a loss of data has occurred to the current view of the application relative to a past view of the application. The current view of the application is suspended. One or more past views of the application are presented. A past view of the application is reinstated into the current view to restore the lost data.
Implementations can include one or more of the following features. The evaluating can be performed when the application is invoked. The method can further include alerting the user to the data loss and prompting the user to restore the lost data.
In general, in one aspect, a method is provided. The method includes determining that an application has lost data. A prior state of the application is retrieved. A preview of the prior state is presented. The prior state of the application is restored.
The details of the various aspects of the subject matter described in this specification are set forth in the accompanying drawings and the description below. Other features, aspects, and advantages of the invention will become apparent from the description, the drawings, and the claims.
The computer 102 also includes a local storage device 106 and a graphics module 113 (e.g., graphics card) for storing information and generating graphical objects, respectively. The local storage device 106 can be a computer-readable medium. The term “computer-readable medium” refers to any medium that includes data and/or participates in providing instructions to a processor for execution, including without limitation, non-volatile media (e.g., optical or magnetic disks), volatile media (e.g., memory) and transmission media. Transmission media includes, without limitation, coaxial cables, copper wire, fiber optics, and computer buses. Transmission media can also take the form of acoustic, light or radio frequency waves.
While modifications of a user interface view are described herein with respect to a personal computer 102, it should be apparent that the disclosed implementations can be incorporated in, or integrated with, any electronic device that has a user interface, including without limitation, portable and desktop computers, servers, electronics, media players, game devices, mobile phones, email devices, personal digital assistants (PDAs), embedded devices, televisions, other consumer electronic devices, etc.
Systems and methods are provided for modifying an interface view (e.g., a user interface view). The systems and methods can be stand alone, or otherwise integrated into a more comprehensive application. In the materials presented below, an integrated system and method for modifying a user interface view is disclosed.
Though discussion is made with reference to modifying a user interface view, those of ordinary skill will recognize that such a view can be based on various data structures, files, processes, and other aspects of information management. It follows that modification to file structures, data and the like is also contemplated in order to achieve the modification to the user interface view. In other words, while the restoration of the user interface view from one state to another can be the most apparent change from the user's perspective, this is accomplished through the corresponding changes in the underlying system content.
One of ordinary skill in the art will recognize that the engines, methods, processes and the like that are described can themselves be an individual process or application, part of an operating system, a plug-in, an application or the like. In one implementation, the system and methods can be implemented as one or more plug-ins that are installed and run on the personal computer 102. The plug-ins are configured to interact with an operating system (e.g., MAC OS® X, WINDOWS XP, LINUX, etc.) and to perform the various functions, as described with respect to the Figures. A system and method for modifying a user interface view can also be implemented as one or more software applications running on the computer 102. Such a system and method can be characterized as a framework or model that can be implemented on various platforms and/or networks (e.g., client/server networks, wireless networks, stand-alone computers, portable electronic devices, mobile phones, etc.), and/or embedded or bundled with one or more software applications (e.g., email, media player, browser, etc.).
The computer 102 includes the backup component 117 that allows for the storage of versions of the computer's files or other items, for example within the local storage 106 or in an external storage repository. In one implementation, the backup component 117 also allows a user to select any of the stored versions and use it to initiate a restoration of that version in the computer.
Each application program 228 can include an application programming interface (API) 229. The architecture 200 can utilize API 229 techniques to access application programs and enhance them with further functionality. For example, the API 229 can link several applications together for providing a single service on all linked applications. Particularly, the time machine architecture can utilize API techniques to enhance application programs with the time machine functionality. The API tools can link several applications to the time machine engine by using an API for providing a similar menu or icon for each application. For example, the API can be used by the time machine when generating a backup version of a current state of the application. As another example, the API can be used when the application is restored, through the time machine, to a state that corresponds to a backup version. Although API 229 is shown in
In one implementation, the backup component 117 provides backup and restoration capability for the system. Many different items or elements can be the subject of a back up in the system. For example, folders, files, items, information portions, directories, images, system parameters, playlists, address books, e-mails, e-mail folders, application states, preferences, and the like all can be candidates for archiving. Other types are also possible. In this example, the backup component 117 includes a local storage device 204 and an external storage device 232. Versions can be stored on either of them. Any number of local and/or external storage devices can be used by the backup component 117 for storing versions. In one implementation, no local storage is provided.
In one implementation, one copy of original data (e.g., folders, files, items, information portions, directories, images, system parameters, playlists, address books, e-mails, e-mail folders, application states and the like) is stored in the system in addition to the original (i.e., a backup copy). When one or more subsequent copies are made, each one can contain only the differences between the current data version and the original backup copy, thereby saving storage space. In some implementations, the storage devices 204 and 232 can be used to store the backup copy of the data as well as links pointing to the data in the backup copy, or other backup data from a subsequent backup operation. The links can be hard links which reference, or point to, physical data, or as another example can be symbolic links that reference another file on the storage device.
For example, a song file 234 can be stored on the local storage device 204. At some point in time, a backup song file 236 has been created from the song file 234. In everyday use, when a person listens to the song corresponding to these song files, it is from the song file 234 (i.e., the original version) that the music is retrieved. Should the song file 234 disappear or become corrupt, the backup song file 236 can be used.
The backup song file 236 can contain data that differs from the original song file 234, such as data containing incremental changes that have occurred to the original song file over time. In addition, backup song files can contain a link pointing to a first backup of the song file 236. For example, the song file 234 can include the first backup of data, while the backup song file 236 can include changes made since the first backup of data, and a link pointing to the first backup of data. In some situations, the backup data does not differ, and it can therefore be sufficient to store only the link to the first backup song file in the backup song file 236.
The backup component 117 can interact with one or more of the applications using the corresponding API. In one implementation, this can provide backing up of that application's files, state or other items, and can provide for user restoration of a selected backed up version, to name two examples. In one implementation, the backup component 117 runs as a background task on an operating system 230 that is not visible to the user. The backup component 117 can be capable of operating on data belonging to any and all user accounts on the system.
The backup component 117 includes an activity monitoring engine 212. In one implementation, the activity monitoring engine 212 monitors for changes within applications (e.g., application files or state) that are targeted for a backup operation. A change can also include the addition of new files or other data structures, or deletion of existing ones. For example, the activity management engine 212 can be responsible for verifying the integrity of a playlist in a music file management program, or for verifying that a corresponding song file exists for a listed song.
In one implementation, the activity monitoring engine 212 is capable of discerning between a substantive change (e.g. the text within a document has been modified) and a non-substantive change (e.g. the play count within an iTunes playlist has been updated, or several changes cancel each other out) through its interaction with the application programs 228. The activity monitoring engine 212 can, for example, create a list of modified elements to be used when a backup event is eventually triggered. In one implementation, the activity monitoring engine 212 can monitor the system for periods of inactivity. The activity monitoring engine 212 can then trigger a backup event during a period of time in which the backup activity won't cause a system slowdown for an active user.
A preference management engine 214 specifies some operating parameters of the backup component 117. In one implementation, preference management engine 214 contains user-specified and/or system default application parameters for the backup component 117. These can include settings for the details of capturing and storing the views. For example, the preference management engine 214 can determine the frequency of the backup capture, the storage location for the backup versions, the types of elements (e.g., files or other items) that are eligible for backup capture, and the events which trigger a backup capture (periodic or event-driven, etc.). In one implementation, the preference management engine 214 can detect that a new storage device is being added to the system and prompt the user whether it should be included as a backup repository. Files and other items can be scheduled for a backup operation due to location (e.g. everything on the C: drive and within D:/photos), a correlation with specific applications (e.g. all pictures, music, e-mail in an inbox, an address book, and system settings), or a combination of strategies. Different types of items can be scheduled to be stored on different devices or on different segments of a storage device during a backup operation. In one implementation, the backup component 117 stores the versions in a format corresponding to a file system structure.
A backup management engine 216 coordinates the collection, storage, and retrieval of views performed by the backup component 117. For example, the backup management engine 216 can trigger the activity monitoring engine 212 to watch for activities that satisfy a requirement specified in the preference management engine 214.
A change identifying engine 218 locates specific files or other items within to determine if they have changed. The change identifying engine 218 can be capable of discerning a substantive change from a non-substantive change. For example, the change identifying engine 218 can identify a loss of data associated with a user's current view. In one implementation, the change identifying engine 218 traverses a target set of files or other items, comparing a previous version to the current version to determine whether or not a modification has occurred. In addition, the change identifying engine 218 can generate an alert identifying the loss of data, and prompt the user to initiate a previous version of the current view to restore the lost data. For example, the change identifying engine 218 can be responsible for verifying whether a data loss has occurred in a music file management program, or for verifying that a corresponding song file is unchanged for a listed song.
A backup capture engine 220 locates views (e.g., elements, files or other items) that are to be backed up. The backup capture engine 220 can invoke the activity monitoring engine 212 and/or the change identifying engine 218, for example, to generate a capture list. The backup capture engine 220 can then store copies of these elements in one or more targeted storage repositories. The backup capture engine 220 can track multiple version copies of each item included in the backup repository.
The backup component 117 includes a backup restoration engine 222 to restore previous versions of views (e.g., files or other items). In one implementation, the backup restoration engine 222 provides a user interface (e.g., a graphical user interface) where a user can select the item(s) to be restored.
As shown in
The time machine engine can be activated to back up or restore content within the iTunes™ application or another application. Additionally, the time machine engine can be activated to back up or restore other data such as system data and preferences. In one implementation, the user can activate a time machine session from the user interface using a user-selectable time machine icon 312 in the application launch bar 304. As another example, the time machine session can be activated from the menu bar 302. The menu bar 302 can include a time machine options menu in addition to the activation selection. The time machine options menu can include selections allowing a user to specify data to include in a particular backup operation. For example, in iTunes™, the user can identify which content to include in the backup (e.g., playlists, but not play counts, purchased songs, but not others, etc.). In addition, the user can recover songs that were previously included, but are now missing from the iTunes™ library. For example, if at least one backup of the missing songs has been made at an earlier date, the user can enter the time machine to search for the missing songs or files in a backup snapshot of the iTunes™ application. This provides for restoration of a view corresponding to that prior time. As used herein, a snapshot refers to a backup element stored in a historical archive that includes a backup of selected items or content as specified by the backup component 117.
The time machine engine can proactively detect lost data when an application is launched. For example, when the iTunes™ application is launched, a system (e.g., the application, a part of the operating system, a backup system, etc.) can examine the application files for lost data, such as data corruption or missing data files. Data loss can occur, for example as a result of an application/system failure, virus, or inadvertent deletion. When data is missing, the time machine engine can generate an alert identifying the lost data, and provide a way for the user to restore the data using the time machine interface. Thus, the API 229 that connects particular applications to the time machine engine can be used in generating the alert. In some implementations, the time machine compares previous data from an earlier backup with the current to identify lost data (e.g., the content of an iTunes library in an earlier backup can be compared with the current library). In other implementations, the system (e.g., the backup daemon) monitors changes and can generate the alert when particular changes are detected. For example, the system can monitor constantly in the background e.g., by monitoring system events. For example, after a failure event, the backup system can determine whether or not data has been lost. If so, the backup system can prompt the user to restore the lost data using the time machine snapshots to select a prior intact version of the lost data.
In one implementation, the can detect lost data associated with other applications. For example, when launching a messaging program, lost data can be detected such as lost e-mail messages, lost contact information from a contacts list (e.g., names and addresses of contacts), or lost calendar data. In another implementation, the lost data can be from a “buddy list” of a messaging program (e.g., instant messaging).
Alternatively, the system can detect lost data associated with a computer system such as lost system settings or preferences. For example, preferences can include preferences associated with input devices (e.g., keyboard and mouse settings), system settings (e.g., display device preferences, printer preferences), and user interface settings (e.g., preferences defining a look and feel of the user interface such as colors, background images and, screensaver preferences). Thus, system data can also be recovered after a system failure event.
The time machine backup engine includes functionality to identify the kinds of data that will be protected. The time machine backup engine can also have defined therein events that trigger recovery. Such events can distinguish between permanent and non-permanent data loss. For example, a recovery event can be the creation of a backup that differs from a prior backup in a predefined way, and the detection of this condition results in a trigger. Other recovery events are possible. In one implementation, a set of rules is used to determine whether not identified data loss triggers recovery.
A determination of data loss can be made upon the initiation of an application, upon a specific user input, or at a predefined time, to name a few examples. Here, assume that data loss is detected for the iTunes™ application window 306.
The time machine interface 500 here includes a presentation window 501, a timeline 502, and function buttons. The timeline 502 includes a number of snapshots. The time machine user interface 500 can also include function buttons. For example, the interface 500 can include arrow buttons 503a and 503b, and an associated scroll bar 505 to allow the user to navigate to additional snapshots not shown in the current timeline window. Thus, there can be a large number of snapshots from which to select. As shown, the presentation window 501 is displaying the current state of the iTunes™ application because a “current” snapshot 504 has been selected (highlighted) in the timeline. The current snapshot can be a default selection. The presentation window 501 can show the contents corresponding to the currently selected snapshot, or a portion thereof.
In this particular example, the timeline contains a date beneath each snapshot indicating when the snapshot was taken. In some implementations, the user can select items or content within the snapshots. The selection functionality can be used in earlier snapshots, such as snapshot 514, to restore missing data to the state associated with the current snapshot 504.
The timeline 502 can include a number of snapshots representing earlier versions or states of the iTunes™ library that have been backed up. Each snapshot provides a screenshot representation of the earlier version of the iTunes™ library at a particular point in time. In some implementations, the timeline 502 includes a visual representation of backup elements, such as a miniature version of the earlier state. The timeline can appear across the top portion of the time machine interface 502 (as shown). Alternatively, the timeline does not appear in the top portion of the time machine interface 500 until a user moves their cursor to (or otherwise activates) the timeline (e.g., by activating the top portion of the interface).
The interface can include a restore button 510 that, when selected, restores the view to the selected state represented by the selected snapshot, or to a selected portion thereof, to name two examples. In some implementations, this terminates the session of the time machine. A user can select one element in a snapshot and then select the restore button 510 to modify the current version of the element selected (e.g., restore the state of the view). For example, in iTunes™, the user can select one or more songs to restore, and this can trigger the restore button to display a more precise message, such as “restore selection only.”
In one implementation, a changed items only checkbox control 512 filters the snapshots to show only those that differ from the current state. In one implementation, the checkbox control 512 does not refer to the incremental changes between snapshots in the timeline 502, but rather when invoked acts to omit those snapshots whose states are identical to the current state of the iTunes™ library from presentation in the timeline. For example, if the most recent snapshot 504 is identical to a snapshot 514 that occurs earlier in time, selecting the changed items only checkbox control 512, in one implementation, causes the time machine to cease displaying one of these versions, e.g., by removing the snapshot 514 from the timeline. This can help the user to view only snapshots that contain changes to the current version
An information button 516 provides information regarding the selected snapshot. In one implementation, selecting the information button 516 opens a panel display. The panel display can provide information including the date and time the snapshot was made, the location of actual contents in a snapshot, the size of the snapshot, and a comment section, to name a few examples. A close button 518 can be selected to exit the time machine and return the user to the user interface 300. In some implementations, the time machine engine can automatically close upon a particular snapshot being restored. In some implementations, the user can minimize the time machine for purposes of navigating to other applications, such as an email application or a web browser.
As shown in
The above examples involve backup versions of music libraries. Many different types of applications, content, items, elements or processes can be backed up and made accessible through a time machine engine.
In the above description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding. It will be apparent, however, to one skilled in the art that implementations can be practiced without these specific details. In other instances, structures and devices are shown in block diagram form in order to avoid obscuring the disclosure.
In particular, one skilled in the art will recognize that other architectures and graphics environments can be used, and that the examples can be implemented using graphics tools and products other than those described above. In particular, the client/server approach is merely one example of an architecture for providing the functionality described herein; one skilled in the art will recognize that other, non-client/server approaches can also be used. Some portions of the detailed description are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.
It should be borne in mind, however, that all of these and, similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
An apparatus for performing the operations herein can be specially constructed for the required purposes, or it can comprise a general-purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program can be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.
The algorithms and modules presented herein are not inherently related to any particular computer or other apparatus. Various general-purpose systems can be used with programs in accordance with the teachings herein, or it can prove convenient to construct more specialized apparatuses to perform the method steps. The required structure for a variety of these systems will appear from the description. In addition, the present examples are not described with reference to any particular programming language. It will be appreciated that a variety of programming languages can be used to implement the teachings as described herein. Furthermore, as will be apparent to one of ordinary skill in the relevant art, the modules, features, attributes, methodologies, and other aspects can be implemented as software, hardware, firmware or any combination of the three. Of course, wherever a component is implemented as software, the component can be implemented as a standalone program, as part of a larger program, as a plurality of separate programs, as a statically or dynamically linked library, as a kernel loadable module, as a device driver, and/or in every and any other way known now or in the future to those of skill in the art of computer programming. Additionally, the present description is in no way limited to implementation in any specific operating system or environment.
The subject matter described in this specification can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer readable medium for execution by, or to control the operation of, data processing apparatus. The instructions can be organized into modules (or engines) in different numbers and combinations from the exemplary modules described. The computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more them. The term “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them. A propagated signal is an artificially generated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus.
While this specification contains many specifics, these should not be construed as limitations on the scope of what may be claimed, but rather as descriptions of features specific to particular implementations of the subject matter. Certain features that are described in this specification in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.
The subject matter of this specification has been described in terms of particular embodiments, but other embodiments can be implemented and are within the scope of the following claims. For example, the actions recited in the claims can be performed in a different order and still achieve desirable results. As one example, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In certain implementations, multitasking and parallel processing may be advantageous. Other variations are within the scope of the following claims.
Number | Name | Date | Kind |
---|---|---|---|
5150407 | Chan | Sep 1992 | A |
5150473 | Zulch | Sep 1992 | A |
5163148 | Walls | Nov 1992 | A |
5276867 | Kenley et al. | Jan 1994 | A |
5349658 | O'Rourke et al. | Sep 1994 | A |
5369570 | Parad | Nov 1994 | A |
5659614 | Bailey | Aug 1997 | A |
5664186 | Bennett et al. | Sep 1997 | A |
5680562 | Conrad et al. | Oct 1997 | A |
5736974 | Selker | Apr 1998 | A |
5745669 | Hugard et al. | Apr 1998 | A |
5754178 | Johnston et al. | May 1998 | A |
5758359 | Saxon | May 1998 | A |
5790120 | Lozares et al. | Aug 1998 | A |
5802175 | Kara | Sep 1998 | A |
5818936 | Mashayekhi | Oct 1998 | A |
5819032 | De Vries et al. | Oct 1998 | A |
5819292 | Hitz et al. | Oct 1998 | A |
5831617 | Bhukhanwala | Nov 1998 | A |
5832526 | Schuyler | Nov 1998 | A |
5961605 | Deng et al. | Oct 1999 | A |
5987566 | Vishlitzky et al. | Nov 1999 | A |
6006227 | Freeman et al. | Dec 1999 | A |
6023506 | Ote et al. | Feb 2000 | A |
6097313 | Takahashi et al. | Aug 2000 | A |
6112318 | Jouppi et al. | Aug 2000 | A |
6134660 | Boneh et al. | Oct 2000 | A |
6167532 | Wisecup | Dec 2000 | A |
6188405 | Czerwinski et al. | Feb 2001 | B1 |
6269381 | St. Pierre et al. | Jul 2001 | B1 |
6366988 | Skiba et al. | Apr 2002 | B1 |
6396500 | Qureshi et al. | May 2002 | B1 |
6397308 | Ofek et al. | May 2002 | B1 |
6424626 | Kidambi et al. | Jul 2002 | B1 |
6460055 | Midgley et al. | Oct 2002 | B1 |
6553392 | Mosher, Jr. et al. | Apr 2003 | B1 |
6574733 | Langford | Jun 2003 | B1 |
6604118 | Kleiman et al. | Aug 2003 | B2 |
6625704 | Winokur | Sep 2003 | B2 |
6629129 | Bookspan et al. | Sep 2003 | B1 |
6636937 | Peter | Oct 2003 | B2 |
6638313 | Freeman et al. | Oct 2003 | B1 |
6701454 | Fischer et al. | Mar 2004 | B1 |
6711572 | Zakharov et al. | Mar 2004 | B2 |
6714201 | Grinstein et al. | Mar 2004 | B1 |
6714952 | Dunham et al. | Mar 2004 | B2 |
6725427 | Freeman et al. | Apr 2004 | B2 |
6728735 | Fong | Apr 2004 | B1 |
6768999 | Prager et al. | Jul 2004 | B2 |
6785751 | Connor | Aug 2004 | B1 |
6785786 | Gold et al. | Aug 2004 | B1 |
6801229 | Tinkler | Oct 2004 | B1 |
6836657 | Ji et al. | Dec 2004 | B2 |
6857001 | Hitz et al. | Feb 2005 | B2 |
6892211 | Hitz et al. | May 2005 | B2 |
6901493 | Maffezzoni | May 2005 | B1 |
6918124 | Novik et al. | Jul 2005 | B1 |
6947556 | Matyas et al. | Sep 2005 | B1 |
6948039 | Biessener et al. | Sep 2005 | B2 |
6959368 | St. Pierre et al. | Oct 2005 | B1 |
6993710 | Coad et al. | Jan 2006 | B1 |
7069402 | Coulter et al. | Jun 2006 | B2 |
7072916 | Lewis et al. | Jul 2006 | B1 |
7099900 | Bromley et al. | Aug 2006 | B1 |
7103740 | Colgrove et al. | Sep 2006 | B1 |
7107527 | Takahashi et al. | Sep 2006 | B2 |
7111136 | Yamagami | Sep 2006 | B2 |
7133902 | Saha et al. | Nov 2006 | B2 |
7134026 | Horiuchi et al. | Nov 2006 | B2 |
7155486 | Aoshima et al. | Dec 2006 | B2 |
7174352 | Kleiman et al. | Feb 2007 | B2 |
7185028 | Lechner | Feb 2007 | B2 |
7200617 | Kibuse | Apr 2007 | B2 |
7222194 | Kano et al. | May 2007 | B2 |
7257717 | Huang | Aug 2007 | B2 |
7275075 | Cannon | Sep 2007 | B2 |
7284190 | Chellis et al. | Oct 2007 | B2 |
7289973 | Kiessig et al. | Oct 2007 | B2 |
7318134 | Oliveira et al. | Jan 2008 | B1 |
7320076 | Caronni | Jan 2008 | B2 |
7386801 | Horvitz et al. | Jun 2008 | B1 |
7401194 | Jewell | Jul 2008 | B2 |
7418619 | Uhlmann et al. | Aug 2008 | B1 |
7434164 | Salesin et al. | Oct 2008 | B2 |
7434177 | Ording et al. | Oct 2008 | B1 |
7440125 | Maekawa et al. | Oct 2008 | B2 |
7483693 | Lueng et al. | Jan 2009 | B2 |
7505762 | Onyon et al. | Mar 2009 | B2 |
7518611 | Boyd et al. | Apr 2009 | B2 |
7558930 | Kitamura et al. | Jul 2009 | B2 |
7559016 | Rakowski et al. | Jul 2009 | B1 |
7574459 | Sen et al. | Aug 2009 | B2 |
7590668 | Kathuria et al. | Sep 2009 | B2 |
7596586 | Gokhale et al. | Sep 2009 | B2 |
7600133 | Long et al. | Oct 2009 | B2 |
7620670 | Tokuda et al. | Nov 2009 | B2 |
7624133 | Ojalvo | Nov 2009 | B1 |
7630021 | Matsuzaka et al. | Dec 2009 | B2 |
7657450 | Amit et al. | Feb 2010 | B2 |
7660817 | Smith et al. | Feb 2010 | B2 |
7669141 | Pegg | Feb 2010 | B1 |
7676689 | Shioyama et al. | Mar 2010 | B1 |
7711771 | Kirnos | May 2010 | B2 |
7734594 | Wang | Jun 2010 | B2 |
7739464 | Coulter et al. | Jun 2010 | B1 |
7761456 | Cram et al. | Jul 2010 | B1 |
7809687 | Cisler et al. | Oct 2010 | B2 |
7809688 | Cisler et al. | Oct 2010 | B2 |
7836311 | Kuriya et al. | Nov 2010 | B2 |
7853566 | Cisler et al. | Dec 2010 | B2 |
7853567 | Cisler et al. | Dec 2010 | B2 |
7856424 | Cisler et al. | Dec 2010 | B2 |
7860839 | Cisler et al. | Dec 2010 | B2 |
7882072 | Axe et al. | Feb 2011 | B1 |
7890527 | Nene et al. | Feb 2011 | B1 |
7934064 | Per et al. | Apr 2011 | B1 |
8010900 | Hart et al. | Aug 2011 | B2 |
8024292 | Thompson et al. | Sep 2011 | B2 |
8055911 | Feng et al. | Nov 2011 | B2 |
8099392 | Paterson et al. | Jan 2012 | B2 |
8166415 | Cisler et al. | Apr 2012 | B2 |
8209308 | Rueben et al. | Jun 2012 | B2 |
8229897 | Cannon et al. | Jul 2012 | B2 |
8245078 | Chatterjee et al. | Aug 2012 | B1 |
8260770 | Bell et al. | Sep 2012 | B2 |
8495024 | Cisler et al. | Jul 2013 | B2 |
8775378 | Cisler et al. | Jul 2014 | B2 |
20010047368 | Oshinsky et al. | Nov 2001 | A1 |
20010055317 | Kajizaki et al. | Dec 2001 | A1 |
20020016912 | Johnson | Feb 2002 | A1 |
20020023198 | Kokubun et al. | Feb 2002 | A1 |
20020046220 | Freeman et al. | Apr 2002 | A1 |
20020049883 | Schneider et al. | Apr 2002 | A1 |
20020054158 | Asami | May 2002 | A1 |
20020063737 | Feig et al. | May 2002 | A1 |
20020065999 | Kikuchi et al. | May 2002 | A1 |
20020080180 | Mander et al. | Jun 2002 | A1 |
20020107886 | Gentner et al. | Aug 2002 | A1 |
20020112237 | Kelts | Aug 2002 | A1 |
20020120648 | Ball et al. | Aug 2002 | A1 |
20020156921 | Dutta et al. | Oct 2002 | A1 |
20020160760 | Aoyama | Oct 2002 | A1 |
20020174283 | Lin | Nov 2002 | A1 |
20030014521 | Elson et al. | Jan 2003 | A1 |
20030016248 | Hayes Ubillos | Jan 2003 | A1 |
20030018878 | Dorward et al. | Jan 2003 | A1 |
20030050940 | Robinson | Mar 2003 | A1 |
20030063128 | Salmimaa et al. | Apr 2003 | A1 |
20030065687 | Momiji et al. | Apr 2003 | A1 |
20030097640 | Abrams et al. | May 2003 | A1 |
20030122874 | Dieberger et al. | Jul 2003 | A1 |
20030126247 | Strasser et al. | Jul 2003 | A1 |
20030131007 | Schirmer et al. | Jul 2003 | A1 |
20030135650 | Kano et al. | Jul 2003 | A1 |
20030137540 | Klevenz et al. | Jul 2003 | A1 |
20030167380 | Green | Sep 2003 | A1 |
20030172937 | Faries et al. | Sep 2003 | A1 |
20030182332 | McBrearty et al. | Sep 2003 | A1 |
20030195903 | Manley et al. | Oct 2003 | A1 |
20030220949 | Witt et al. | Nov 2003 | A1 |
20040044707 | Richard | Mar 2004 | A1 |
20040066414 | Czerwinski et al. | Apr 2004 | A1 |
20040073560 | Edwards | Apr 2004 | A1 |
20040078641 | Fleischmann | Apr 2004 | A1 |
20040088331 | Therrien et al. | May 2004 | A1 |
20040117459 | Fry | Jun 2004 | A1 |
20040125137 | Stata et al. | Jul 2004 | A1 |
20040133575 | Farmer et al. | Jul 2004 | A1 |
20040139396 | Gelernter et al. | Jul 2004 | A1 |
20040143652 | Grannan et al. | Jul 2004 | A1 |
20040163009 | Goldstein et al. | Aug 2004 | A1 |
20040167942 | Oshinsky et al. | Aug 2004 | A1 |
20040175000 | Caronni | Sep 2004 | A1 |
20040193953 | Callahan et al. | Sep 2004 | A1 |
20040199779 | Huang | Oct 2004 | A1 |
20040199826 | Bertram et al. | Oct 2004 | A1 |
20040210608 | Lee et al. | Oct 2004 | A1 |
20040220965 | Harville et al. | Nov 2004 | A1 |
20040220980 | Forster | Nov 2004 | A1 |
20040228493 | Ma | Nov 2004 | A1 |
20040230892 | Horton | Nov 2004 | A1 |
20040235523 | Schrire et al. | Nov 2004 | A1 |
20040236769 | Smith et al. | Nov 2004 | A1 |
20040236916 | Berkowitz et al. | Nov 2004 | A1 |
20040236958 | Teicher et al. | Nov 2004 | A1 |
20040267700 | Dumais et al. | Dec 2004 | A1 |
20050010955 | Elia et al. | Jan 2005 | A1 |
20050071390 | Midgley et al. | Mar 2005 | A1 |
20050091596 | Anthony et al. | Apr 2005 | A1 |
20050102695 | Musser, Jr. | May 2005 | A1 |
20050108253 | Metsatahti et al. | May 2005 | A1 |
20050138013 | Walker et al. | Jun 2005 | A1 |
20050138081 | Alshab et al. | Jun 2005 | A1 |
20050144135 | Juarez et al. | Jun 2005 | A1 |
20050149577 | Okada et al. | Jul 2005 | A1 |
20050165867 | Barton et al. | Jul 2005 | A1 |
20050187992 | Prahlad et al. | Aug 2005 | A1 |
20050204186 | Rothman et al. | Sep 2005 | A1 |
20050216520 | He et al. | Sep 2005 | A1 |
20050216527 | Erlingsson | Sep 2005 | A1 |
20050246398 | Barzilai et al. | Nov 2005 | A1 |
20050262168 | Helliker et al. | Nov 2005 | A1 |
20050262377 | Sim-Tang | Nov 2005 | A1 |
20060026218 | Urmston | Feb 2006 | A1 |
20060036568 | Moore et al. | Feb 2006 | A1 |
20060041603 | Paterson et al. | Feb 2006 | A1 |
20060041823 | Wolfgang et al. | Feb 2006 | A1 |
20060053332 | Uhlmann | Mar 2006 | A1 |
20060064444 | Van Ingen et al. | Mar 2006 | A1 |
20060064634 | Dettinger et al. | Mar 2006 | A1 |
20060080521 | Barr et al. | Apr 2006 | A1 |
20060085792 | Traut | Apr 2006 | A1 |
20060085817 | Kim et al. | Apr 2006 | A1 |
20060088167 | Bade et al. | Apr 2006 | A1 |
20060101384 | Sim-Tang et al. | May 2006 | A1 |
20060106893 | Daniels et al. | May 2006 | A1 |
20060117309 | Singhal et al. | Jun 2006 | A1 |
20060129496 | Chow et al. | Jun 2006 | A1 |
20060137010 | Kramer et al. | Jun 2006 | A1 |
20060143250 | Peterson et al. | Jun 2006 | A1 |
20060150107 | Leung et al. | Jul 2006 | A1 |
20060156246 | Williams et al. | Jul 2006 | A1 |
20060161861 | Holecek et al. | Jul 2006 | A1 |
20060173848 | Peterson et al. | Aug 2006 | A1 |
20060200754 | Kablesh et al. | Sep 2006 | A1 |
20060218363 | Palapudi | Sep 2006 | A1 |
20060224956 | Storisteanu et al. | Oct 2006 | A1 |
20060235907 | Kathuria et al. | Oct 2006 | A1 |
20060236406 | Johnson | Oct 2006 | A1 |
20060248294 | Nedved et al. | Nov 2006 | A1 |
20060253470 | Friedman et al. | Nov 2006 | A1 |
20060288205 | Linares | Dec 2006 | A1 |
20070027935 | Haselton et al. | Feb 2007 | A1 |
20070030528 | Quaeler et al. | Feb 2007 | A1 |
20070038884 | Campbell et al. | Feb 2007 | A1 |
20070043715 | Kaushik et al. | Feb 2007 | A1 |
20070043790 | Kryger | Feb 2007 | A1 |
20070070066 | Bakhash | Mar 2007 | A1 |
20070078910 | Bopardikar | Apr 2007 | A1 |
20070088702 | Fridella et al. | Apr 2007 | A1 |
20070094312 | Sim-Tang | Apr 2007 | A1 |
20070106978 | Felts | May 2007 | A1 |
20070136381 | Cannon et al. | Jun 2007 | A1 |
20070136389 | Bergant et al. | Jun 2007 | A1 |
20070136423 | Gilmore et al. | Jun 2007 | A1 |
20070143425 | Kieselbach et al. | Jun 2007 | A1 |
20070150326 | Nakao et al. | Jun 2007 | A1 |
20070156772 | Lechner | Jul 2007 | A1 |
20070168497 | Locker et al. | Jul 2007 | A1 |
20070174580 | Shulga | Jul 2007 | A1 |
20070180268 | Filimon et al. | Aug 2007 | A1 |
20070185879 | Roublev et al. | Aug 2007 | A1 |
20070185922 | Kapoor et al. | Aug 2007 | A1 |
20070186127 | Desai et al. | Aug 2007 | A1 |
20070192386 | Fries et al. | Aug 2007 | A1 |
20070266007 | Arrouye et al. | Nov 2007 | A1 |
20070271263 | Merrild | Nov 2007 | A1 |
20070271303 | Menendez et al. | Nov 2007 | A1 |
20070282854 | Bhogal et al. | Dec 2007 | A1 |
20070288536 | Sen et al. | Dec 2007 | A1 |
20080016576 | Ueda et al. | Jan 2008 | A1 |
20080022393 | Waltermann et al. | Jan 2008 | A1 |
20080028007 | Ishii et al. | Jan 2008 | A1 |
20080033922 | Cisler et al. | Feb 2008 | A1 |
20080033969 | Koo et al. | Feb 2008 | A1 |
20080034004 | Cisler et al. | Feb 2008 | A1 |
20080034011 | Cisler et al. | Feb 2008 | A1 |
20080034013 | Cisler et al. | Feb 2008 | A1 |
20080034016 | Cisler et al. | Feb 2008 | A1 |
20080034017 | Giampaolo et al. | Feb 2008 | A1 |
20080034018 | Cisler et al. | Feb 2008 | A1 |
20080034019 | Cisler et al. | Feb 2008 | A1 |
20080034039 | Cisler et al. | Feb 2008 | A1 |
20080046557 | Cheng | Feb 2008 | A1 |
20080059894 | Cisler et al. | Mar 2008 | A1 |
20080065663 | Farlee et al. | Mar 2008 | A1 |
20080070496 | Jackson | Mar 2008 | A1 |
20080077808 | Teicher et al. | Mar 2008 | A1 |
20080082578 | Hogue et al. | Apr 2008 | A1 |
20080091655 | Gokhale et al. | Apr 2008 | A1 |
20080126441 | Giampaolo et al. | May 2008 | A1 |
20080126442 | Cisler et al. | May 2008 | A1 |
20080141029 | Culver | Jun 2008 | A1 |
20080162999 | Schlueter et al. | Jul 2008 | A1 |
20080168184 | Freedman et al. | Jul 2008 | A1 |
20080168245 | De Atley et al. | Jul 2008 | A1 |
20080168391 | Robbin et al. | Jul 2008 | A1 |
20080172428 | Stokes | Jul 2008 | A1 |
20080172607 | Baer | Jul 2008 | A1 |
20080177961 | McSharry et al. | Jul 2008 | A1 |
20080208630 | Fors et al. | Aug 2008 | A1 |
20080214163 | Onyon et al. | Sep 2008 | A1 |
20080216011 | Gould | Sep 2008 | A1 |
20080222512 | Albornoz et al. | Sep 2008 | A1 |
20080229037 | Bunte et al. | Sep 2008 | A1 |
20080250342 | Clark et al. | Oct 2008 | A1 |
20080250400 | Vertes | Oct 2008 | A1 |
20080285754 | Kezmann | Nov 2008 | A1 |
20080307000 | Paterson et al. | Dec 2008 | A1 |
20080307017 | Lyons et al. | Dec 2008 | A1 |
20080307018 | Ulrich et al. | Dec 2008 | A1 |
20080307019 | Weiss et al. | Dec 2008 | A1 |
20080307020 | Ko et al. | Dec 2008 | A1 |
20080307175 | Hart et al. | Dec 2008 | A1 |
20080307333 | McInerney et al. | Dec 2008 | A1 |
20080307347 | Cisler et al. | Dec 2008 | A1 |
20080310628 | Fujioka et al. | Dec 2008 | A1 |
20080310633 | Brown et al. | Dec 2008 | A1 |
20090019291 | Murray | Jan 2009 | A1 |
20090031401 | Cudich et al. | Jan 2009 | A1 |
20090052669 | Ma | Feb 2009 | A1 |
20090116641 | Bokor et al. | May 2009 | A1 |
20090254591 | Weiss et al. | Oct 2009 | A1 |
20090307333 | Welingkar et al. | Dec 2009 | A1 |
20100017855 | Johnson et al. | Jan 2010 | A1 |
20100063960 | Lehto | Mar 2010 | A1 |
20100217929 | Kirshenbaum et al. | Aug 2010 | A1 |
20110016089 | Freedman et al. | Jan 2011 | A1 |
20110185762 | Freedman et al. | Jan 2011 | A1 |
20110083088 | Cisler et al. | Apr 2011 | A1 |
20110083098 | Cisler et al. | Apr 2011 | A1 |
20110087976 | Cisler et al. | Apr 2011 | A1 |
20110202763 | Martin et al. | Aug 2011 | A1 |
20110302502 | Hart et al. | Dec 2011 | A1 |
20120124507 | Paterson et al. | May 2012 | A1 |
20120185438 | Giampaolo et al. | Jul 2012 | A1 |
20120185518 | Giampaolo et al. | Jul 2012 | A1 |
20120185762 | Ozer et al. | Jul 2012 | A1 |
20120198383 | Cisler et al. | Aug 2012 | A1 |
20130066836 | Weiss et al. | Mar 2013 | A1 |
20130073821 | Flynn et al. | Mar 2013 | A1 |
20130212599 | Giampaolo et al. | Aug 2013 | A1 |
Number | Date | Country |
---|---|---|
0629950 | Dec 1994 | EP |
1152352 | Nov 2001 | EP |
1582982 | Oct 2005 | EP |
0106356 | Jan 2001 | WO |
02101540 | Dec 2002 | WO |
2005045756 | May 2005 | WO |
2008019237 | Feb 2008 | WO |
2008019259 | Feb 2008 | WO |
Entry |
---|
“What's New in Word 2002.” Wellesly College Information Services Computing Documentation. Jan. 2002. http://www.wellesley.edu/Computing/Office02/Word02/word02.html. Accessed Aug. 12, 2008. |
Tittel, Ed. “An EAZ Way to Restore Crippled and Inoperable Systems.” ChannelWeb. Apr. 25, 2005. http://www.crn.com/white-box/161502165. |
Academic Resource Center, http://www.academicresourcecenter.net/curriculum/glossary.aspx. |
Brien M. Posey. “Working with the Windows Server 2003 Volume Shadow Copy Service”. Published Jun. 24, 2004. http://www.windowsnetworking.com/articles—tutorials/Windows-Server-2003-Volume-Shadow-Copy-Service.html. |
“Apple Previews Mac OS X Leopard,” Aug. 7, 2006 [online] [retrieved on No. 26, 2007] Retrieved from the Internet:<URL:http://www.apple.com/pr/library/2006/aug/07leopard.html>, pp. 1-2. |
“Aulaclic: Unit 6. The Recycle Bin,” Nov. 2005 [online] [retrieved on Nov. 26, 2007] Retrieved from the Internet<URL:http://www.teacherclick.com/winxp/t—6—1.htm>, pp. 1-2. |
Bonwick, Jeff, “ZFS The Last Word in File Systems,” [online] [retrieved on Jan. 22, 2008] Retrieved from the Internet:<URL:http://opensolaris.org/os/community/zfs/docs/zfs.pdf>, 34 pages. |
Bonwick et al., “The Zettabyte File System,” [online] [retrieved on Jan. 22, 2008] Retrieved from the Internet:<URL:http://partneradvantage.sun.com/protected/solaris10/adoptionkit/tech/zfs/zfs—overview.pdf>, 13 pages. |
Griffiths, R., “Leopard first looks: Time Machine,” Aug. 8, 2006 [online] [retrieved on Nov. 23, 2007] Retrieved from the Internet:<URL:http://www.macworld.com/2006/08/firstlooks/leotimemac/index.php?pf=1> pp. 1-2. |
International Search Report and Written Opinion, PCT/US2007/074729, Jul. 12, 2007, 11 pages. |
International Search Report and Written Opinion, PCT/US2007/074881, Jul. 12, 2007, 11 pages. |
Sun Microsystems, Inc., “ZFS On-Disk Specification,” Draft: Dec. 9, 2005, [online] [retrieved on Jan. 22, 2008] Retrieved from the Internet:<URL:http://opensolaris.org/os/community/zfs/docs/ondiskformat0822.pdf,>, 55 pages. |
International Search Report and Written Opinion, PCT/US2007/074653, Aug. 14, 2008, 14 pages. |
International Search Report and Written Opinion, PCT/US2008/065146, Oct. 31, 2008, 21 pages. |
International Search Report and Written Opinion, PCT/US2008/066212, Mar. 9, 2009, 26 pages. |
Bott, Ed, “Windows XP Backup Made Easy,” Jul. 14, 2003, Microsoft. |
Engst, Adam, “Retrospect 6.0: Powerful Backup Program Adds Panther Compatibility and Enterprise Features”, Jun. 1, 2004, MacWorld. |
Harder, Bobbie, “Microsoft Windows XP System Restore,” Apr. 2001, MSDN. |
“StorageSync: Backup, Restore, & Synchronization Software User's Guide”, SimpleTech, 2003. |
International Search Report and Written Opinion, PCT/US2007/074863 Apr. 21, 2009, 20 pages. |
Communication pursuant to Article 94(3) EPC for Application No. EP 07 799 899.5, dated May 14, 2009, 2 pages. |
“How to Interpret Windows Installer Logs,” [Online] [Retrieved on Dec. 12, 2009] Retrieved from the Internet URL: http://blogs.technet.com/richard—macdonald/archive/2007/04/02/How-to-Interpret-Windows-Installer-Logs.aspx; published Apr. 4, 2007; 6 pages. |
Communication pursuant to Article 94(3) EPC for Application No. EP 07 799 899.5, dated Oct. 7, 2009, 4 pages. |
In-link files, The Open Group Base, Specifications Issue 6 [online]. IEEE Std 1003.1, 2004 Edition. [retrieved on Apr. 6, 2011]. Retrieved from the Internet:URL:http://pubs.opengroup.org/onlinepubs/009695399/utilities/In.html, 5 pages. |
Microsoft-TechNet, “Using Encrypting File System,” Nov. 3, 2005, Microsoft, 40 pages. |
Godfrey, Michael et al., “Using Original Analysis to Detect Merging and Splitting of Source Code Entities,” IEEE Transactions on Software Engineering, vol. 31, No. 2. Feb. 2005. pp. 166-181. |
Microsoft Technet: “Restore a previous version of a file,” Jan. 21, 2005, [Online] [Retrieved on Oct. 20, 2011] Retrieved from the Internet URL: http://technet.microsoft.com/en-us/library/cc778220(d=printer,v=WS.10).aspx , pp. 1-2. |
Examination Report from European Application No. 07 813 605.8 dated Oct. 27, 2011, 5 pages. |
Examination Report from European Application No. 07 813 540.7 dated Oct. 27, 2011, 5 pages. |
Extended European Search Report, European Application No. 11184579.8, Nov. 17, 2011, 6 pages. |
Office Action dated Feb. 29, 2012 from related Chinese Application No. 200880024710.0, 11 pages. |
Charles Rubin, Mary Millhollon and Katherine Murray, “Microsoft Office Word 2003, Official Manual”, First Edition, Japan, Nikkei BP Softpress, Jul. 12, 2004, vol. 1, p. 300, 815-818. |
Chen et al., “Data Redundancy and Compression Methods for a Disk-based Network Backup System”, 2004, IEEE, pp. 1-8. |
Extended International Search Report and Written Opinion, EP 11171738.5, Aug. 29, 2011, 5 pages. |
Communication pursuant to Article 94(3) EPC for Application No. EP 07 813 540.7, dated Jun. 23, 2009, 2 pages. |
Shi et al., “USP: A Lightweight File System Management Framework,” 2010 Fifth IEEE International Conference on Networking, Architecture, and Storage, 2010 IEEE, pp. 250-256. |
Number | Date | Country | |
---|---|---|---|
20080034011 A1 | Feb 2008 | US |