Abstract: Described herein are quantum gradient algorithms that result in a quantum advantage over conventional methods. In an example, a quantum circuit is configured to implement a quantum gradient algorithm when executed on qubits of a quantum computing system. The quantum gradient algorithm includes a phase oracle OSƒm defined by a finite difference approximation with an order greater than zero, and a complexity of the quantum gradient algorithm scales as (?{square root over (k)}/?). The quantum circuit is repeatedly executed on qubits of a quantum computing system to determine a k-dimensional gradient of a function ƒ(x) within an error ? at point x0.

Abstract: A system receives a request to process data. The system uses an expression engine to apply one or more expressions to the data to perform one or more application programming interface (API) interactions, which may include one or more of: dynamic resolution of API endpoints, API payload construction, and validation of API payload data fields. The Expressions are predefined entities configured to perform actions involving the system. The system initiates the expression engine. The system executes an initial expression upon initial data to produce an expression result. Executing the initial expression can involve iteratively resolving an ordered set of related expressions.

Abstract: A method is provided for solving a computational problem that is reducible to a problem of counting solutions to an associated decision problem. The method includes, using a quantum computer, estimating a number of the solutions to the decision problem by determining if there is at least one solution to the decision problem that lies in a pseudo-random set. The method also includes outputting or using the estimated number of the solutions to the decision problem as a solution to the computational problem. Determining if there is at least one solution to the decision problem that lies in the pseudo-random set could include determining if there is a sequence of solutions to the decision problem that, taken together, lies in the pseudo-random set.

Abstract: A system and a method are disclosed for securing sensitive data for transaction requests using tokenization and encryption. A secure transfer system secures sensitive information of transaction requests. The secure transfer system may receive a transaction request file and generate a modified transaction request file by tokenizing values in the received file. For each transaction request in the file, the system may store a representation of the untokenized values in a datastore in conjunction with an identifier of the transaction request. This identifier may be generated from the tokenized values. The secure transfer system may use the identifier to query the datastore for the representation of the untokenized values. The system may decrypt encrypted values in the representation to generate a transaction request file of detokenized values, which may be provided to an automated clearing house to fulfill the transaction requests.

Abstract: A system and a method are disclosed for simulating asset transfers (e.g., sweeps) using a user interface generated by various collections of display routines. A sweep management system may generate a graphical user interface (GUI) on a webpage to simulate sweeps. The GUI may include a list of entities rendered using a first collection of display routines and a graphical representation of some of the entities rendered using a second collection of display routines. The graphical representation may be rendered using a shared webpage object. Furthermore, callback functions are executed to perform operations based on user interactions. For example, callback functions are used to update the graphical representation after a user has dragged and dropped an entry from the list into the graphical representation.

Abstract: A spreadsheet supports formulas in cells that trigger queries of a data source. The parameters for queries can include or depend on values in other cells in the spreadsheet. Thus, the precise query submitted to the data source is dynamic, being dependent on the data and formulas in the spreadsheet. Furthermore, on receiving the query results, they are added to cells in the spreadsheet, which can be parameters for other queries defined in other cells. Changing the value of a single cell can automatically trigger an update of an arbitrarily deep hierarchy of calculations that can include an arbitrary number of data source queries.

Abstract: A system and a method are disclosed for placing hardware components on a printed circuit board (“PCB”) in a way that enables all hardware components on the PCB to be passively cooled without using active cooling systems. Components are selected to be placed onto the PCB and heat metrics for each component is obtained (e.g., from a server). The components are ranked based on the amount of heat that each component generates. A corresponding position for each of the hardware components is determined based on the ranking of the components and the orientation of the PCB. The placement is based on the concept that air having higher temperature rises while air having cooler temperature falls. A representation of the PCB according to corresponding positions of the hardware components may be generated for display.

Abstract: A document information extraction system determines a structure of an electronic document based on characteristics of the document's constituent elements. The system segments the document to generate elements with each element having similar characteristics. Elements may be clustered to assist in determining the document structure. The system determines directional relationships between elements (e.g., above, below, etc.). The system then employs a master comparator to determine familial relationships between adjacent elements. The master comparator includes a set of unit comparators and each unit comparator compares a specific characteristic between two elements. The master comparator sequentially applies the unit comparators to determine the familial relationship based on the comparisons. The system outputs a document hierarchy tree reflecting the determined familial relationships. The hierarchy tree represents the structure of the document.

Abstract: This disclosure provides systems and methods for prevention of manipulation and gaming in electronic intraday auctions. The system includes using at least one processing device for obtaining orders related to an asset from an electronic trading system. The system includes using at least one processing device for identifying a value for the asset to be used during an intraday auction involving the asset. The identified value is based on a detected order cross within the orders. The value is identified and set prior to the intraday auction. The value is located within a best bid and best offer spread (BBO) band. The system includes using at least one processing device for initiating the intraday auction involving the asset based on the identified and set value and the detected order cross. Changes to the BBO band during the intraday auction do not affect the identified and set value.

Abstract: A smart contract including one or more rules is defined and stored on a blockchain in conjunction with a pool of one or more tokens owned by the smart contract. A plurality of conflicting claims to the pool of one or more tokens is received and provided to the blockchain. An indication that a trigger condition is met is received from the blockchain. The trigger condition to determined using the one or more rules. Information indicating a distribution of the one or more tokens to resolve the plurality of conflicting claims is also received. The information is generated using the one or more rules in response to the trigger condition being met.

Abstract: Systems and methods for a product driven approach to technology provisioning, operations, and billing are provided. Some embodiments provide an Information Technology (IT) business architecture built around the product driven methodology. This architecture can be designed to optimize the demand side provisioning of technology products to meet business intent and the execution of supply side assembly and implementation lifecycle. A technology model can be used that recursively decomposes services and products into various components. As a result, the technology model allows for effective and efficient provisioning, pricing, and impact assessment of the organization's technology to thereby drive the efficiency of scale and the automation of the provisioning, the finance, and the operation businesses.

Abstract: A regularization-based (RB) hedging tool identifies a recommended hedging portfolio that track a target asset and provides one or metrics indicating a predicted performance of the hedging portfolio relative to the target asset. The RB hedging tool uses a RB hedging model that is trained on price data from an observation period. Initial hyperparameters for the model are selected using asset price data from a validation period and the performance of the model is evaluated by applying it to asset price data from a backtest period. The end-user is presented with one or more metrics indicating the performance of the model and may modify one or more settings (e.g., hyperparameters) of the model. The model is retrained and reapplied to the backtest period, and the metrics are updated. Thus, end-users may tailor the model to their own particular needs and preferences.

Abstract: An empirical approach to providing differential privacy includes applying a common statistical query to a set of databases to produce sample values, both with and without any particular entity's data. The probability density is empirically estimated by sorting the sample values to generate an empirical cumulative distribution function. The cumulative distribution function is differenced across approximately the square root of the number of sample points to get an empirical density function. The statistical query is empirically (?,?)-private if the empirical densities with and without any particular individual differ by a factor of no more than exp(?), with the exception of a set for which the densities exceed that bound by a total of no more than ?.

Abstract: A spreadsheet supports formulas in cells that trigger queries of a data source. The parameters for queries can include or depend on values in other cells in the spreadsheet. Thus, the precise query submitted to the data source is dynamic, being dependent on the data and formulas in the spreadsheet. Furthermore, on receiving the query results, they are added to cells in the spreadsheet, which can be parameters for other queries defined in other cells. Changing the value of a single cell can automatically trigger an update of an arbitrarily deep hierarchy of calculations that can include an arbitrary number of data source queries.

Abstract: Described herein is a mechanism for preventing exercise devices from storing user exercise data and enabling the user to securely record that data. When a user selects an exercise device for performing an exercise, a user's device may establish a connection with the exercise device. When an exercise program is started on the exercise device, the user's device interfaces with the sensors directly while bypassing the computing device. When a direct sensor link with the sensors is created, the sensor link replaces a link between the sensors and the computing device on the exercise equipment. The user's device then receives exercise data through the sensor link directly from the sensors bypassing the computing device on the exercise equipment.