Abstract: A method for compressing a sequence of records, each record comprising a sequence of fields, comprises steps of buffering a record in a line of a matrix, reordering the lines of the matrix according to locality sensitive hash values of the buffered records such that records with similar contents in corresponding fields are placed in proximity, and consolidating fields in columns of the matrix into a block of codes. In this, consolidating yields codes of one of a first type comprising a sequence of individual fields and a second type comprising a sequence of fields with at least one repetition. The second type of code comprises a presence field indicating repeated fields and an iteration field indicating a number of respective repetitions. Decompression of the records from the block codes compressed above is also described.

Abstract: A system for posterior estimation of variables. Receiving a set of data inputs. Determining a first model of the water distribution network based on the set of data inputs. Determining a second model of the water distribution network based on the set of data inputs, and the first model.

Abstract: In an approach for adaptive sampling of smart meter data, a computer retrieves one or more balancing constraints associated with one or more smart meter sensors. The computer retrieves meter sensor data from the one or more smart meter sensors according to the one or more balancing constraints. The computer determines a subsample of the meter sensor data, and then transmits the subsample of the meter sensor data to an optimization engine for use in solving an optimization problem.

Abstract: A method includes loading a guest virtual machine onto a host system, determining, with the host system, an encapsulation method to be used in association with a virtual network associated with the guest virtual machine, determining an overhead value based on the encapsulation method, determining an adjusted maximum transmission unit (MTU) value based on the overhead value, and passing, information related to the adjusted MTU value from the host system to the guest virtual machine.

Abstract: An apparatus sets a layer counter to point to a first layer of a data structure. The apparatus determines the layer counter to reference an overflowing cell. The apparatus increments the layer counter to point to a second layer of the data structure. The apparatus determines the incremented layer counter to reference a non-overflowing cell. The apparatus increments a value of the non-overflowing cell, wherein the first layer is stored in a first cache and the second layer is stored in a second cache, and wherein the first cache differs from the second cache with respect to one or more of speed or size.

Abstract: A method for data mining on compressed data vectors by a certain metric being expressible as a function of the Euclidean distance is suggested. In a first step, for each compressed data vector, positions and values of such coefficients having the largest energy in the compressed data vector are stored. In a second step, for each compressed data vector, the coefficients having not the largest energy in the compressed data vector are discarded. In a third step, for each compressed data vector, a compression error is determined in dependence on the discarded coefficients in the compressed data vector. In a fourth step, at least one of an upper and a lower bound for the certain metric is retrieved in dependence on the stored positions and the stored values of the coefficients having the largest energy and the determined compression errors.

Abstract: Methods and a device for providing a compressed index of binary records. A method includes: sorting the records by content of a predetermined field of the record, indexing the field from one of the records in a line of a bitmap index, compressing bits in a column of the bitmap index by replacing a group of successive bits with a code, where the sorting includes the steps of assigning, for each record, a hash bucket of a hash table on a basis of a locality sensitive hash function on the contents of the predetermined field, so that the probability for two of the records to be assigned to the same has bucket increases with the similarity of the contents of the predetermined field between the records, and where at least one step of the computer implemented method is executed on a computer device.

Abstract: In one aspect, a method for reducing uncertainty in a hydraulic model of a water distribution network due to uncertain parameters and faults in the water distribution network is provided which includes the steps of: (i) calculating an optimized placement of sensors throughout a given uncertain section of the water distribution network; (ii) collecting data from the sensors; (iii) partitioning the given uncertain section of the water distribution network into observable and unobservable sub-sections based on the hydraulic model and a) a position, b) a number, and/or c) a type of the sensors that are available; (iv) correcting uncertain parameters and identifying faults for each of the observable sub-sections; (v) calculating a global uncertainty value for each of the unobservable sub-sections; and (vi) repeating the steps (i)-(vi) iteratively, at each iteration selecting an uncertain sub-section of the water distribution network, until no uncertain sub-sections of the water distribution network remain.

Abstract: A method for providing a compressed index for a stream of binary data records comprises steps of indexing a field from each record in a bitmap index, compressing stored bits in each column of the bitmap index by replacing a group of successive bits with a code and outputting the code. There is provided at least one of a first code for replacing a sequence of a first filling, a literal and a second filling, and a second code for replacing a sequence of a first literal, a filling and a second literal. In this context, a filling is a sequence of bits with the same value and a literal is a sequence of bits with different values.

Abstract: A method for compressing a sequence of records, each record comprising a sequence of fields, comprises steps of buffering a record in a line of a matrix, reordering the lines of the matrix according to locality sensitive hash values of the buffered records such that records with similar contents in corresponding fields are placed in proximity, and consolidating fields in columns of the matrix into a block of codes. In this, consolidating yields codes of one of a first type comprising a sequence of individual fields and a second type comprising a sequence of fields with at least one repetition. The second type of code comprises a presence field indicating repeated fields and an iteration field indicating a number of respective repetitions. Decompression of the records from the block codes compressed above is also described.

Abstract: A method for providing a compressed index for a stream of binary data records comprises steps of indexing a field from each record in a bitmap index, compressing stored bits in each column of the bitmap index by replacing a group of successive bits with a code and outputting the code. There is provided at least one of a first code for replacing a sequence of a first filling, a literal and a second filling, and a second code for replacing a sequence of a first literal, a filling and a second literal. In this context, a filling is a sequence of bits with the same value and a literal is a sequence of bits with different values.

Abstract: Methods and a device for providing a compressed index of binary records. A method includes: sorting the records by content of a predetermined field of the record, indexing the field from one of the records in a line of a bitmap index, compressing bits in a column of the bitmap index by replacing a group of successive bits with a code, where the sorting includes the steps of assigning, for each record, a hash bucket of a hash table on a basis of a locality sensitive hash function on the contents of the predetermined field, so that the probability for two of the records to be assigned to the same has bucket increases with the similarity of the contents of the predetermined field between the records, and where at least one step of the computer implemented method is executed on a computer device.