Embodiments of the present disclosure provide methods, devices, and computer program products for data backup and restoration. The embodiments include generating an initial path tree based on a file to be backed up and a directory associated with the file, the initial path tree comprising at least one node for indicating any of a file and a directory; backing up the file and the directory in a backup space; and updating the initial path tree to obtain a file path tree, the updating comprising: recording a first offset and a second offset respectively in a first node and a second node in the initial path tree, the first node corresponding to the file and the second node corresponding to the directory, the first offset indicating a first position of the file in the backup space, and the second offset indicating a second position of a corresponding directory in the backup space.

A thermal system of a vehicle, including: a heat exchanger; a accumulator and a compressor; a cabin evaporator; a cabin condenser; and a battery; wherein the heat exchanger, accumulator, compressor, cabin evaporator, cabin condenser, and battery are connected to allow refrigerant heat and cool a passenger cabin and the battery in a single closed and connected circuit directly without any dedicated heat exchanger; and wherein the heating and cooling of the cabin and the battery are controlled by settings of a plurality of valves.

A file server and a method of operating a file server where version identifiers for documents on the server are maintained as a branched tree. When a client computer attempts to sync up a new version of a file, it must upload the version identifier that it received when it synced down the file. The file server compares this version identifier to the numbers in its version tree for the file and may place the document in the correct place in the tree structure, which may not be as the “latest version” of the document. If the client is using an outdated version of the document, the server may also sync down the latest version of the file. The user may view the changes to the version tree and reconcile different versions to create an authoritative version, and this review and reconciliation may occur at any time, instead of being performed at the moment that the file is saved or forking the file into a new filename.

There is provided a computer-implemented method for automatically managing storage resources of a distributed file system comprising: obtaining actual past storage usage data of a first directory from a plurality of directories of the distributed file system to a current time; detecting, a space quota limit for the first directory and associated with a pre-defined expected future time; determining from the actual past storage usage data, projected storage usage data of the first directory over a future time period; obtaining an aggregated correction coefficient providing an indication of aggregated projected storage usage needs of remaining other directories relative to the first directory; in response to determining an expected value of the projected storage usage data at the expected future time is inconsistent with the space quota limit, adjusting the space quota limit to a new quota limit based on the expected value weighted by the aggregated correction coefficient.

A computerized method for training a computer executed model for recognizing numerical quantities is provided. An input, atleast one unit expression, is received by an input module. The input module may then search for numeric values and the unit expression in a text corpus, wherein, the text corpus comprises sets of words and frequency of occurrence of each of the sets. The input module may identify identified sets, wherein the identified sets may comprise a combination of a numeric value and the unit expression. A synthetic text generation module may then generate sentences from the text corpus by applying the identified sets as input. A training dataset may be generated by a labeling module by auto labelling features in the generated sentences based on the numeric value and the unit expression and further a training module may train the training model by providing input based on the training dataset.

Techniques for efficiently storing client data blocks on a distributed-computing system are provided. The system includes a fast performance tier and a large capacity tier. The capacity tier stores the client data blocks in erasure encoded data stripes. The performance tier stores logical map data including an address map indicating a correspondence between logical addresses associated with a first layer of the system and physical addresses associated with a second layer. A method includes receiving a request to include additional client data blocks in the client blocks. The request indicates logical addresses for additional blocks. Corresponding physical addresses for additional block are determined. Each additional block is stored at the physical address. Additional logical map data is stored in the performance tier. Storing the additional logical map data includes updating the address map to indicate the correspondence between the logical addresses and the physical addresses for the additional blocks.

A method for a data capturing and structuring includes determining at least one data capture mode for processing a non-electronic data record into an electronic data record and selecting a record owner having a plurality of existing data records to be associated with the electronic data record. The method also includes capturing the non-electronic data record into the electronic data record and collecting metadata from data associated with the record owner and the electronic data record and data generated during the capturing. Further, the method includes creating structured data records by combining the electronic data record and the metadata and exporting the structured data records.

Disclosed are various examples of integrating multiple domains within a directory service. A computing device retrieves a first list of members in a first group of users for the domain from a first directory service for a first domain. The computing device then determines that a second group of users is a member of the first group of users, wherein the second group of users corresponds to a second domain. The computing device then retrieves a second list of members in the second group of users from a second directory service for a second domain. The computing device subsequently compares the first list of members in the first group of users and the second list of members in the second group of users with a third list of members in a third group of users, wherein the third list of members in the third group of users corresponds to a user list maintained by the application. The computing device then adds to the third list of members in the third group of users each user that is both present in the first list of members in the first group of users or in the second list of members in the second group of users and missing from the third list of members in the third group of users.

Interaction output over a local computer-readable medium (CRM) generated based on user interaction with rendered content input representing a virtualized asset being is received at a virtualized asset local provisioning server. A manner to exploit the virtualized asset is determined from interaction output. The virtualized asset is exploited based on the determined manner to exploit the virtualized asset. A request for a portion of the virtualized asset generated in response to the exploiting the virtualized asset is intercepted. If it is determined that the portion of the virtualized asset is absent from the local storage, a request for the portion of the virtualized asset is sent to a virtualized asset delivery system over a non-local CRM; the portion of the virtualized asset retrieved by the virtualized asset delivery system is received over the non-local CRM; and the received portion of the virtualized asset is used in exploiting the virtualized asset.

A method for dynamically storing files/data, comprising: a) acquiring the file/data by an initial random Virtual Machine (r VM); b) shredding the file/data to a plurality of segments; c) wrapping, in a standalone state, each of the remaining segments with a unique code comprised of at least one or more destination storage locations, a pointer to a following segment in the file/data, and a timer; d) autonomously and independently roaming each segment to the destination storage location appearing in its unique code; and e) periodically, according to the timer, continuously roaming segments between storage locations until receiving a request for retrieving of the dynamically stored file/data.