Abstract: Dynamic timers are determined using machine learning. The timers are used to control the amount of time that new data transaction requests wait before being processed by a data transaction processing system. The timers are adjusted based on changing conditions within the data transaction processing system. The dynamic timers may be determined using machine learning inference based on feature values calculated as a result of the changing conditions.

Abstract: Dynamic timers are determined using machine learning. The timers are used to control the amount of time that new data transaction requests wait before being processed by a data transaction processing system. The timers are adjusted based on changing conditions within the data transaction processing system. The dynamic timers may be determined using machine learning inference based on feature values calculated as a result of the changing conditions.

Abstract: Dynamic timers are determined using machine learning. The timers are used to control the amount of time that new data transaction requests wait before being processed by a data transaction processing system. The timers are adjusted based on changing conditions within the data transaction processing system. The dynamic timers may be determined using machine learning inference based on feature values calculated as a result of the changing conditions.

Abstract: A distributed computer system is provided. The distributed computer system includes at least one sequencer computing node and at least one matcher computing node. Electronic data messages are sequenced by the sequencer and sent to at least matcher computing node. The matcher computing node receives the electronic data messages and a reference value from an external computing source. New electronic data messages are put into a pending list before they can be acted upon by the matcher. A timer is started based on a comparison of the reference value (or a calculation based thereon) to at least one attribute or value of a new electronic data message. When the timer expires, the electronic data message is moved from the pending list to another list—where it is eligible to be matched against other, contra-side electronic data messages.

Abstract: A distributed computer system is provided. The distributed computer system includes at least one sequencer computing node and at least one matcher computing node. Electronic data messages are sequenced by the sequencer and sent to at least matcher computing node. The matcher computing node receives the electronic data messages and a reference value from an external computing source. New electronic data messages are put into a pending list before they can be acted upon by the matcher. A timer is started based on a comparison of the reference value (or a calculation based thereon) to at least one attribute or value of a new electronic data message. When the timer expires, the electronic data message is moved from the pending list to another list—where it is eligible to be matched against other, contra-side electronic data messages.

Abstract: Dynamic timers are determined using machine learning. The timers are used to control the amount of time that new data transaction requests wait before being processed by a data transaction processing system. The timers are adjusted based on changing conditions within the data transaction processing system. The dynamic timers may be determined using machine learning inference based on feature values calculated as a result of the changing conditions.

Abstract: Dynamic timers are determined using machine learning. The timers are used to control the amount of time that new data transaction requests wait before being processed by a data transaction processing system. The timers are adjusted based on changing conditions within the data transaction processing system. The dynamic timers may be determined using machine learning inference based on feature values calculated as a result of the changing conditions.

Abstract: Dynamic timers are determined using machine learning. The timers are used to control the amount of time that new data transaction requests wait before being processed by a data transaction processing system. The timers are adjusted based on changing conditions within the data transaction processing system. The dynamic timers may be determined using machine learning inference based on feature values calculated as a result of the changing conditions.

Abstract: Dynamic timers are determined using machine learning. The timers are used to control the amount of time that new data transaction requests wait before being processed by a data transaction processing system. The timers are adjusted based on changing conditions within the data transaction processing system. The dynamic timers may be determined using machine learning inference based on feature values calculated as a result of the changing conditions.

Abstract: Implementations of spool devices may include a frame including an anchor, the anchor configured to directly couple to a belt of a user, an axle coupled through the frame, and a first spool coupled over a first portion of the axle. The first portion of the axle may extend entirely through the first spool. The spool device may also include a second spool coupled over a second portion of the axle. The second portion of the axle may extend entirely through the second spool. The spool device may also include a first spool handle directly coupled to an outer wall of the first spool, a second spool handle directly coupled to an outer wall of the second spool, a first hose roller directly coupled to the frame, and a second hose roller directly coupled to the frame.

Abstract: A distributed computer system is provided. The distributed computer system includes at least one sequencer computing node and at least one matcher computing node. Electronic data messages are sequenced by the sequencer and sent to at least matcher computing node. The matcher computing node receives the electronic data messages and a reference value from an external computing source. New electronic data messages are put into a pending list before they can be acted upon by the matcher. A timer is started based on a comparison of the reference value (or a calculation based thereon) to at least one attribute or value of a new electronic data message. When the timer expires, the electronic data message is moved from the pending list to another list—where it is eligible to be matched against other, contra-side electronic data messages.

Abstract: A distributed computer system is provided. The distributed computer system includes at least one sequencer computing node and at least one matcher computing node. Electronic data messages are sequenced by the sequencer and sent to at least matcher computing node. The matcher computing node receives the electronic data messages and a reference value from an external computing source. New electronic data messages are put into a pending list before they can be acted upon by the matcher. A timer is started based on a comparison of the reference value (or a calculation based thereon) to at least one attribute or value of a new electronic data message. When the timer expires, the electronic data message is moved from the pending list to another list—where it is eligible to be matched against other, contra-side electronic data messages.

Abstract: Implementations of spool devices may include a frame including an anchor, the anchor configured to directly couple to a belt of a user, an axle coupled through the frame, and a first spool coupled over a first portion of the axle. The first portion of the axle may extend entirely through the first spool. The spool device may also include a second spool coupled over a second portion of the axle. The second portion of the axle may extend entirely through the second spool. The spool device may also include a first spool handle directly coupled to an outer wall of the first spool, a second spool handle directly coupled to an outer wall of the second spool, a first hose roller directly coupled to the frame, and a second hose roller directly coupled to the frame.

Abstract: Implementations of spool devices may include a frame including an anchor, the anchor configured to directly couple to a belt of a user, an axle coupled through the frame, and a first spool coupled over a first portion of the axle. The first portion of the axle may extend entirely through the first spool. The spool device may also include a second spool coupled over a second portion of the axle. The second portion of the axle may extend entirely through the second spool. The spool device may also include a first spool handle directly coupled to an outer wall of the first spool, a second spool handle directly coupled to an outer wall of the second spool, a first hose roller directly coupled to the frame, and a second hose roller directly coupled to the frame.

Abstract: A distributed computer system is provided. The distributed computer system includes at least one sequencer computing node and at least one matcher computing node. Electronic data messages are sequenced by the sequencer and sent to at least matcher computing node. The matcher computing node receives the electronic data messages and a reference value from an external computing source. New electronic data messages are put into a pending list before they can be acted upon by the matcher. A timer is started based on a comparison of the reference value (or a calculation based thereon) to at least one attribute or value of a new electronic data message. When the timer expires, the electronic data message is moved from the pending list to another list—where it is eligible to be matched against other, contra-side electronic data messages.

Abstract: A distributed computer system is provided. The distributed computer system includes at least one sequencer computing node and at least one matcher computing node. Electronic data messages are sequenced by the sequencer and sent to at least matcher computing node. The matcher computing node receives the electronic data messages and a reference value from an external computing source. New electronic data messages are put into a pending list before they can be acted upon by the matcher. A timer is started based on a comparison of the reference value (or a calculation based thereon) to at least one attribute or value of a new electronic data message. When the timer expires, the electronic data message is moved from the pending list to another list—where it is eligible to be matched against other, contra-side electronic data messages.

Abstract: A distributed computer system is provided. The distributed computer system includes at least one sequencer computing node and at least one matcher computing node. Electronic data messages are sequenced by the sequencer and sent to at least matcher computing node. The matcher computing node receives the electronic data messages and a reference value from an external computing source. New electronic data messages are put into a pending list before they can be acted upon by the matcher. A timer is started based on a comparison of the reference value (or a calculation based thereon) to at least one attribute or value of a new electronic data message. When the timer expires, the electronic data message is moved from the pending list to another list—where it is eligible to be matched against other, contra-side electronic data messages.

Abstract: A computer-implemented method and apparatus for releasing a data item having an identifier for transaction processing in a data transaction processing system in which data items are transacted by a hardware matching processor that matches electronic data transaction request messages for the same one of the data items based on multiple transaction matching parameters from client computers over a data communication bus. A restriction on the hardware matching processor from processing electronic data transaction request messages for the data item is detected. A hardware data processor determines a variability in one of the transaction matching parameters for the data item. The determined variability is compared to a variability threshold established for the data item, and an adjusted one transaction matching parameter of the data item is calculated based on the determined variability.

Abstract: Amongst other things, a computer implemented method for releasing a security for trading in a trading venue includes determining volatility in prices of quotations for a security before the security is released for trading; comparing the determined volatility to a volatility threshold; calculating an adjusted price of the quotations based on the output of the determined volatility in the prices; sending a message to release the security for trading, with the security having the adjusted price that is based on the outcome of comparing.

Abstract: Amongst other things, a computer implemented method for releasing a security for trading in a trading venue includes determining volatility in prices of quotations for a security before the security is released for trading; comparing the determined volatility to a volatility threshold; calculating an adjusted price of the quotations based on the output of the determined volatility in the prices; sending a message to release the security for trading, with the security having the adjusted price that is based on the outcome of comparing