A computer of searching for a combination of state variables with which an evaluation function including the state variables becomes a local minimum or maximum, the computer including: a memory storing a first coefficient indicating a magnitude of interaction between k state variables in a kth order term of the evaluation function; and a processor that performs: calculating a first local field indicating a change amount of the kth order term when a first state variable among the k state variables changes by the first coefficient and a first variable obtained by the k state variables and second coefficients; and determining whether to allow a change in the first state variable based on a result of comparison between a predetermined value and a product of a sum of the first local field and a second local field indicating a change amount of quadratic and lower-order terms of the evaluation function.

A computer of searching for a combination of state variables with which an evaluation function including the state variables becomes a local minimum or maximum, the computer including: a memory storing a first coefficient indicating a magnitude of interaction between k state variables in a kth order term of the evaluation function; and a processor that performs: calculating a first local field indicating a change amount of the kth order term when a first state variable among the k state variables changes by the first coefficient and a first variable obtained by the k state variables and second coefficients; and determining whether to allow a change in the first state variable based on a result of comparison between a predetermined value and a product of a sum of the first local field and a second local field indicating a change amount of quadratic and lower-order terms of the evaluation function.

A method of selecting, in hardware logic, an i.sup.th largest or a p.sup.th smallest number from a set of n m-bit numbers is described. The method is performed iteratively and in the r.sup.th iteration, the method comprises: summing an (m−r).sup.th bit from each of the m-bit numbers to generate a summation result and comparing the summation result to a threshold value. Depending upon the outcome of the comparison, the r.sup.th bit of the selected number is determined and output and additionally the (m−r−1).sup.th bit of each of the m-bit numbers is selectively updated based on the outcome of the comparison and the value of the (m−r).sup.th bit in the m-bit number. In a first iteration, a most significant bit from each of the m-bit numbers is summed and each subsequent iteration sums bits occupying successive bit positions in their respective numbers.

A method of selecting, in hardware logic, an i.sup.th largest or a p.sup.th smallest number from a set of n m-bit numbers is described. The method is performed iteratively and in the r.sup.th iteration, the method comprises: summing an (m−r).sup.th bit from each of the m-bit numbers to generate a summation result and comparing the summation result to a threshold value. Depending upon the outcome of the comparison, the r.sup.th bit of the selected number is determined and output and additionally the (m−r−1).sup.th bit of each of the m-bit numbers is selectively updated based on the outcome of the comparison and the value of the (m−r).sup.th bit in the m-bit number. In a first iteration, a most significant bit from each of the m-bit numbers is summed and each subsequent iteration sums bits occupying successive bit positions in their respective numbers.

An example system includes a processor to receive a valid instance of a finite regular expression format. The processor is to generate a state machine corresponding to the finite regular expression format. The processor is to recursively compute a number of matched strings for each state and transition in the generated state machine. The processor is to recursively rank the valid instance of the finite regular expression format using the generated state machine with the computed numbers of matched strings. The processor is to output a number rank for the valid instance of the finite regular expression format.

An example system includes a processor to receive a valid instance of a finite regular expression format. The processor is to generate a state machine corresponding to the finite regular expression format. The processor is to recursively compute a number of matched strings for each state and transition in the generated state machine. The processor is to recursively rank the valid instance of the finite regular expression format using the generated state machine with the computed numbers of matched strings. The processor is to output a number rank for the valid instance of the finite regular expression format.

An engine for resolving a query from a user to provide a dynamic actionable dashboard in a business operating system includes an MLET database, a data interface, a logic configured to process incoming queries, fetch data in relation to those queries, and render an actionable dashboard having data resulting from the queries. The MLET database comprises a plurality of templates (“MLETs”), each MLET being associated with a unique identifier and including a mechanism for accessing data relating to that identifier. The logic processes queries into constructs having a tokens and configurable inputs. If the query includes a unique identifier associated with an MLET in the MLET database, the MLET is used to fetch data responding to the query. If the query includes a unique identifier not associated with an MLET in the MLET database, the logic creates a new MLET using operational intelligence and stores it in the MLET database.

An electronic record management system creates a streamlined full-service technology solution on a single electronic platform that has the capability to enable business transactions including but not limited to real estate transactions as well as buying and selling commercial debt and equity while optimizing performance. The automated platform utilizes artificial intelligence and machine learning to iteratively optimize consolidated electronic data files from multiple sources to allow sophisticated transactions involving commercial real estate, and other transferrable properties, electronically through a single platform.

A non-transitory computer tangible medium containing instructions for securing a large data set within a Merkle Tree structure is disclosed in the present specification. The instructions include storing each data object of a large data set within a separate node of a Merkle Tree including within a root node, leaf nodes, and nodes interconnecting the root node to the leaf nodes. The nodes of the Merkle Tree may be blockchained together with multiple blockchains that all have an initial blockchain block based on the root node of the Merkle Tree and a final blockchain block based on one of the different leaf nodes. The Merkle Tree may have an order “O” that remains constant for each level of the Merkle B-Tree, or have an order “O” that varies for at least one level of the Merkle B-Tree from the remaining levels.

Implementations described herein relate to methods, systems, and computer-readable media to write data records. In some implementations, a method may include calculating a data rate of a data stream that includes a plurality of data records and determining if the data rate of the data stream is less than an ingest threshold. The method may further include, if the data rate of the data stream is less than the ingest threshold, calculating a number of write requests per time unit based on the data stream; determining a storage capacity per storage bucket; determining a read interval for the data stream; based on the number of write requests per time unit, the storage capacity, and the read interval, selecting a size of time window per storage bucket; and writing the plurality of data records to a particular storage bucket.