Ca, Inc.

Marc Sole Simo

Victor Muntes Mulero

David Sanchez Charles

Jaume Ferrarons Llagostera

David Solans Noguero

Alberto Huelamo Segura

Steven Lloyd Greenspan

Victor Muntes

Michal Zasadzinski

Provided is a process of determining a future battery level of one or more battery-powered computing devices, the process including: accessing an event record in memory describing a scheduled event in which a user of a plurality of computing devices is scheduled to participate, inferring a subset of the plurality of computing devices to be used in that time period, determining present battery levels of the computing devices, the levels being values indicative of an amount of energy stored by batteries, determining present usage rates of battery energy, inferring battery outlooks corresponding to the scheduled event, a battery outlook being an estimated amount of energy consumption attributable to the scheduled event, and predicting future battery levels of computing devices based on at least a present battery level, a present usage rate, and a battery outlook corresponding to the scheduled event.

Battery management assistant

In a datacenter setting, a summary of differences and similarities between two or more states of the same or similar systems are predicted. Initially, a Long Short-Term Memory (LSTM) neural network is trained with to predict a summary describing the state change between at least two states of the datacenter. Given a set of training data (at least two datacenter states that are annotated with a state change description), the LSTM neural network learns which similarities and differences between the datacenter states correspond to the annotations. Accordingly, given a set of test data comprising at least two states of a datacenter represented by context graphs that indicate a plurality of relationships among a plurality of nodes corresponding to components of a datacenter, the LSTM neural network is able to determine a state change description that summarizes the differences and similarities between the at least two states of the datacenter.

Descriptive datacenter state comparison

Embodiments of the present disclosure relate to a fault tolerant root cause analysis (RCA) system that is able to handle calculation failures during runtime. Calculations (e.g., evaluation of a diagnostic model for a specific component or device) that are performed during the RCA are integrated using different resources of the system under analysis. In order to make a final diagnosis, the resources exchange messages containing calculation inputs and outputs. Calculation problems due to calculation failures in a particular resource can be resolved efficiently which reduces resource utilization and minimizes failure propagation to other parts of the system. Accordingly, the system is able to recover and output a diagnosis even if some of the resources fail or generate problems.

Fault tolerant root cause analysis system

In a datacenter setting, annotations or descriptions of relevant parts or subgraphs corresponding to components in the datacenter are predicted. Given a set of training data (library of subgraphs seen in the past labeled with a textual description explaining why were they considered relevant enough to be placed in the historical database), the recurrent neural network (RNN) learns how to combine the different textual annotations coming from each relevant region into a single annotation that describes the whole system. Accordingly, given a set of input or test data (datacenter state modeled a context graph that is not annotated), the system determines which regions of the input graph are more relevant, and for each of these regions, the RNN predicts an annotation even in a previously unseen or different datacenter infrastructure.

Automatic datacenter state summarization

Incomplete state information for nodes of a datacenter is completed utilizing historical state information. A context graph is received having a plurality of nodes that correspond to components of the datacenter, each node including properties that correspond to the represented component. It is determined that at least one of the properties for a node is incomplete. A context hash is derived from the context graph and compared to a plurality of subgraph hashes. Based upon the comparison, one or more subgraphs are identified that are similar to the context hash. Where a single similar subgraph is identified, the property information for the single subgraph is imputed to the context graph to complete the incomplete information. Where more than one similar subgraph is identified, the property information for the identified similar subgraphs is aggregated and the aggregated property information is imputed to the context graph to complete the incomplete information.

Growing community of inventors

Barcelona, Spain

Marc Sole Simo