Abstract: Mobile devices periodically send resource usage reports to an energy server. The reports include information such as an amount of energy used during a time interval, and identify processes that are executed on the mobile devices during the time interval. These reports are analyzed by the energy server and are used to generate statistics regarding the energy used by the mobile devices and the processes that are executed by the mobile devices. When a mobile device experiences a suspected energy spike, the mobile device generates and sends a report to the energy server. After confirming the energy spike, the energy server uses the statistics and the received report to identify one or more causes of the energy spike. The causes can include one or more processes, or the mobile device itself. The mobile device can reduce the amount of energy used based on the identified causes.

Abstract: Mobile devices periodically send resource usage reports to an energy server. The reports include information such as an amount of energy used during a time interval, and identify processes that are executed on the mobile devices during the time interval. These reports are analyzed by the energy server and are used to generate statistics regarding the energy used by the mobile devices and the processes that are executed by the mobile devices. When a mobile device experiences a suspected energy spike, the mobile device generates and sends a report to the energy server. After confirming the energy spike, the energy server uses the statistics and the received report to identify one or more causes of the energy spike. The causes can include one or more processes, or the mobile device itself. The mobile device can reduce the amount of energy used based on the identified causes.

Abstract: The location of a user over time is monitored by a mobile device. The monitored locations are organized into tracks that describe a path or route that the user took over a period of time. Segments that correspond to each of the tracks are determined. The segments may correspond to road on a map, or some other standardization. The segments are associated with their corresponding tracks, and used to identify similar tracks or to generate similarity scores for pairs of tracks.

Abstract: Remote provisioning of an IT network and/or associated services is provided. Hardware, software, service and/or expertise can be moved from on-premise to a remote location (e.g., central, distributed . . . ). Accordingly, at least a large degree computation can be moved to the center to exploit economies of scale, among other things. In such an architecture, computational resources (e.g., data storage, computation power, cache . . . ) can be pooled, and entities can subscribe to a particular level of resources related to a private entity IT network.

Abstract: An enhancement to a web browser offers an extension mechanism for web applications to utilize client-side resources, thereby moving more extensibility and flexibility to the client-side. The web browser may expose some control interfaces to meet various requirements from web applications. Using the extension mechanism, the web applications are able to offload the cloud servers, function when offline, and improve performance. The extension mechanism also provides users with full control to the data passing through their web browsers.

Abstract: The location of a user over time is monitored by a mobile device. The monitored locations are organized into tracks that describe a path or route that the user took over a period of time. Segments that correspond to each of the tracks are determined. The segments may correspond to road on a map, or some other standardization. The segments are associated with their corresponding tracks, and used to identify similar tracks or to generate similarity scores for pairs of tracks.

Abstract: Tracks associated with a first user are identified by a computing device. Each track may include location identifiers. The identified tracks are clustered to generate a composite track for the first user by the computing device. At least one track that is similar to the composite track is identified by the computing device. The at least one track may be associated with a user other than the first user. Information related to the identified at least one track that is similar to the composite track is provided by the computing device through a network.

Abstract: Personal data mining mechanisms and methods are employed to identify relevant information that otherwise would likely remain undiscovered. Users supply personal data that can be analyzed in conjunction with data associated with a plurality of other users to provide useful information that can improve business operations and/or quality of life. Personal data can be mined alone or in conjunction with third party data to identify correlations amongst the data and associated users. Applications or services can interact with such data and present it to users in a myriad of manners, for instance as notifications of opportunities.

Abstract: Multiple versions of data on different sets of machines allow a system to degrade gracefully even when experiencing excessive failures. When excessive failures cause the latest versions to be unavailable, the system becomes degraded, but still offers an old version if available. A most recent coherent set of the available older versions is found and provided. The degree of degradation increases gradually as the system experiences more and more failures. Graceful degradation is desirably complementary to fault tolerance.

Abstract: An information management system includes a database comprising a B-Tree data structure. The B-Tree includes a plurality of nodes associated with disk blocks, handles stored in the nodes, and version numbers attached to each of the handles and disk blocks. In addition, a method is provided that can include initially assigning version numbers to disk blocks, wherein the disk blocks are associated with nodes in a B-Tree data structure, and then performing an allocate operation whereby a handle identifying a disk block is returned along with the disk block's version number.

Abstract: Disclosed herein are scheduling techniques for transmitting time-critical data in a cost-aware manner over a network comprising a plurality of heterogeneous transmission interfaces. The scheduling problem is formulated as a linear programming problem with the deliver-by deadlines of the various data blocks as hard constraints and minimizing cost set as an objective (soft) constraint. The problem is simplified by assuming data blocks with the earliest deadlines should be scheduled first and the most aggressive interfaces should be used first. To formulate the linear programming problem, the time domain is divided into bins and various bin-level schedules are enumerated for switching the transmission of the data over various transmission interfaces. The linear programming techniques are applied to the various bin configurations and the least costly of the resulting transmission schedule is selected for submission to a switching layer.

Abstract: Methods and apparatuses are provided for recovering one or more replicated datasets. In accordance to some embodiments of the invention, this is accomplished by determining whether a log contains one or more entries indicating a corruption in a replicated data item; and recovering the replicated data item if the log contains any such entries. The log, however, is maintained at a higher layer in a software hierarchy than the layer at which the replicated data item is recovered. As a result, there is no need to maintain a separate replication log at the layer where the replicated data item is recovered.

Abstract: Tree data storage structures are implemented on respective computers in a distributed environment, such as on a network, so that information associated with nodes of one computer's tree data storage structure may be read or written to by another computer in the network. To promote efficiency, a cache may be employed on the computers in the network such that each computer caches information associated with nodes of tree data storage structures located on the computers in the network. A lock service may implement a caching protocol to provide efficient concurrency of caching operations while ensuring that current information associated with the nodes is available to all computers in the network.

Abstract: High throughput in data computations and processing is maintained while minimizing latency. A binary tree architecture is provided in which two trees are used simultaneously, and initiation of the trees is staggered to allow for optimal use of bandwidth. These techniques are desirable for erasure codes and other computations where the addition operator is commutative. Additionally, a ternary tree architecture may be used, in which three trees co-exist on the same set of nodes to maintain high throughput while further improving latency.

Abstract: The claimed subject matter provides systems and/or methods that facilitate replicating a state associated with a client, user, service, application, and the like. A third party service provider can support any number of services that can be concurrently requested by several clients without user perception of degraded computing performance as compared to conventional systems/techniques due to improved connectivity and mitigated latencies. A replication component can generate replicas of states associated with requested services. Further, the replicas can facilitate seamlessly interacting with the third party service provider (e.g., while transitioning between client devices). Additionally, by providing replicas of the state related information, differing third party service providers can effectuate services based upon a request from a client without regenerating the state.

Abstract: A searchable storage system indexes data, such as a blob (binary large object) as it is stored. The indexes are stored simultaneously with the data by the same storage mechanism. Data cannot be stored without indexing it. Any indexing technique may be used. The indexes are then used to access the data. This ensures that any inconsistencies can handled at the local level, and are not visible to clients of the system. Data can be put in to, or taken out from, the searchable storage system. Additionally, a query on the data in the searchable storage system may be performed.

Abstract: An intelligent personalized agent monitors, regulates, and advises a user in decision-making processes for efficiency or safety concerns. The agent monitors an environment and present characteristics of a user and analyzes such information in view of stored preferences specific to one of multiple profiles of the user. Based on the analysis, the agent can suggest or automatically implement a solution to a given issue or problem. In addition, the agent can identify another potential issue that requires attention and suggests or implements action accordingly. Furthermore, the agent can communicate with other users or devices by providing and acquiring information to assist in future decisions. All aspects of environment observation, decision assistance, and external communication can be flexibly limited or allowed as desired by the user.

Abstract: The claimed subject matter provides systems and/or methods that facilitate replicating a state associated with a client, user, service, application, and the like. A third party service provider can support any number of services that can be concurrently requested by several clients without user perception of degraded computing performance as compared to conventional systems/techniques due to improved connectivity and mitigated latencies. A replication component can generate replicas of states associated with requested services. Further, the replicas can facilitate seamlessly interacting with the third party service provider (e.g., while transitioning between client devices). Additionally, by providing replicas of the state related information, differing third party service providers can effectuate services based upon a request from a client without regenerating the state.

Abstract: Personal data mining mechanisms and methods are employed to identify relevant information that otherwise would likely remain undiscovered. Users supply personal data that can be analyzed in conjunction with data associated with a plurality of other users to provide useful information that can improve business operations and/or quality of life. Personal data can be mined alone or in conjunction with third party data to identify correlations amongst the data and associated users. Applications or services can interact with such data and present it to users in a myriad of manners, for instance as notifications of opportunities.

Abstract: A global state management service manages replication in a distributed system. A distributed system can have several replica groups. The global state management service manages state associated with each replica group. Data replication is implemented without implementing an instance of a state machine on each device in a replica group. A replica group comprises a primary device and at least one secondary device. Each device in a replica group contains a replica of data of interest. The global state management service manages the allocation of primary and secondary devices. In the absence of a failure in either a primary device or a secondary device, read and write operations are performed without consulting the global state management service. When a failure is detected, the global state management service manages failover.