Abstract: A computing system obtains a document that includes text. The computing system identifies a fact referenced in the text of the document, where the fact includes a fact name and a fact value. The computing system determines a topic of the document based upon the text of the document. The computing system identifies a factoid stored in a data store based upon the topic and the fact name, where the factoid includes the fact name and a second fact value, and further where the factoid has been generated based upon second text of a second document. While the document is being displayed to a user, the computing system causes a message to be displayed to the user, where the message prompts the user to accept or reject replacement of the fact value in the document with the second fact value.

Abstract: A computing system obtains a document that includes text. The computing system identifies a fact referenced in the text of the document, where the fact includes a fact name and a fact value. The computing system determines a topic of the document based upon the text of the document. The computing system identifies a factoid stored in a data store based upon the topic and the fact name, where the factoid includes the fact name and a second fact value, and further where the factoid has been generated based upon second text of a second document. While the document is being displayed to a user, the computing system causes a message to be displayed to the user, where the message prompts the user to accept or reject replacement of the fact value in the document with the second fact value.

Abstract: Technologies described herein offer a contextually aware schedule service technology. User-related activity is monitored to detect a future event related to the user. Information is extracted from the monitored user-related activity information. The extracted information about the future event can be evaluated to determine whether it is related to another future event associated with the user. When a particular future event for the user changes, a set of related events may be utilized to determine a related event is affected by the change. For example, a user may be notified to cancel or modify the future event. Additionally, service providers associated with the affected event(s) may be notified, or a personal assistant service may facilitate automatically rescheduling the affected events.

Abstract: A computer-implemented technique is described herein for creating a relational data structure by extracting user data items from a collection of one or more applications sources. These data items evince interests exhibited by the users, and may include messages, documents, tasks, meetings, etc. The technique also collects knowledge data items from one or more knowledge sources. In one implementation, these data items may include terms used to describe skills possessed by the users. The technique constructs the data structure by providing objects associated with respective data items, and links between respective pairs of objects. In its real-time phase of operation, the technique allows a user to interrogate the relational data structure, e.g., to identify skills possessed by a particular user, to find users associated with a specified skill, etc.

Abstract: A computer-implemented technique is described herein for creating a relational data structure by extracting user data items from a collection of one or more applications sources. These data items evince interests exhibited by the users, and may include messages, documents, tasks, meetings, etc. The technique also collects knowledge data items from one or more knowledge sources. In one implementation, these data items may include terms used to describe skills possessed by the users. The technique constructs the data structure by providing objects associated with respective data items, and links between respective pairs of objects. In its real-time phase of operation, the technique allows a user to interrogate the relational data structure, e.g., to identify skills possessed by a particular user, to find users associated with a specified skill, etc.

Abstract: Technologies described herein offer a contextually aware schedule service technology. User-related activity is monitored to detect a future event related to the user. Information is extracted from the monitored user-related activity information. The extracted information about the future event can be evaluated to determine whether it is related to another future event associated with the user. When a particular future event for the user changes, a set of related events may be utilized to determine a related event is affected by the change. For example, a user may be notified to cancel or modify the future event. Additionally, service providers associated with the affected event(s) may be notified, or a personal assistant service may facilitate automatically rescheduling the affected events.

Abstract: Aspects of the subject matter described herein relate to a storage architecture. In aspects, an address provided by a data source is translated into a logical storage address of virtual storage. This logical storage address is translated into an identifier that may be used to store data on or retrieve data from a storage system. The address space of the virtual storage is divided into chunks that may be streamed to the storage system.

Abstract: A backup and restore system may present recovered backup data as local resources and in a read and write manner so that the recovered backup data may be accessed using an application that created the data. In some embodiments, the recovered data may be read only data, but a differencing virtual hard disk (VHD), Common Internet File System protocol, or differencing driver may be used to present a read/write version of the data. Additionally, the data may be presented using iSCSI or other technologies to present the data as local data, even though the data may be remotely located. The backup and restore system may additionally use VHD differencing technologies to create multiple backups.

Abstract: A backup and restore system may present recovered backup data as local resources and in a read and write manner so that the recovered backup data may be accessed using an application that created the data. In some embodiments, the recovered data may be read only data, but a differencing virtual hard disk (VHD), Common Internet File System protocol, or differencing driver may be used to present a read/write version of the data. Additionally, the data may be presented using iSCSI or other technologies to present the data as local data, even though the data may be remotely located. The backup and restore system may additionally use VHD differencing technologies to create multiple backups.

Abstract: Aspects of the subject matter described herein relate to a storage architecture. In aspects, an address provided by a data source is translated into a logical storage address of virtual storage. This logical storage address is translated into an identifier that may be used to store data on or retrieve data from a storage system. The address space of the virtual storage is divided into chunks that may be streamed to the storage system.

Abstract: A backup and restore system may present recovered backup data as local resources and in a read and write manner so that the recovered backup data may be accessed using an application that created the data. In some embodiments, the recovered data may be read only data, but a differencing virtual hard disk (VHD), Common Internet File System protocol, or differencing driver may be used to present a read/write version of the data. Additionally, the data may be presented using iSCSI or other technologies to present the data as local data, even though the data may be remotely located. The backup and restore system may additionally use VHD differencing technologies to create multiple backups.

Abstract: In accordance with an aspect of the present invention, in a data protection system having a production location, a storage location, and a communication path for transmitting data between the production location and the storage location, a method for creating a makeup archive job is provided. The method includes determining if a task of an archive job was successful and, if it is determined that the task was not successful, including the task in an archive makeup job. Additionally, the method determines if there are any tasks of the archive job that are dependent upon the failed task. If there are dependent tasks, those dependent tasks are also included in the archive makeup job.

Abstract: In accordance with an aspect of the present invention, in a data protection system having a production location, a storage location, and a communication path for transmitting data between the production location and the storage location, a method for creating a makeup archive job is provided. The method includes determining if a task of an archive job was successful and, if it is determined that the task was not successful, including the task in an archive makeup job. Additionally, the method determines if there are any tasks of the archive job that are dependent upon the failed task. If there are dependent tasks, those dependent tasks are also included in the archive makeup job.