Abstract: The disclosed embodiments relate to reduction of computational resources of an electronic trading system required for management of electronic tradeable instruments via instantiation of data objects in a memory including both data inherited from and data linked to a master data object stored in an external data structure or database. The combination of both inherited and referenced attributes may uniquely define each instance to enable the electronic trading system to manage and process transactions for a large number of tradeable instrument variations with minimal computational resources. Thereby, the disclosed embodiments enable the listing en mass and scheduling of a large number of financial instruments for trading to cover, for example, various currency patterns, pricing sources and fixing times.

Abstract: The disclosed embodiments relate to reduction of computational resources of an electronic trading system required for management of electronic tradeable instruments via instantiation of data objects in a memory including both data inherited from and data linked to a master data object stored in an external data structure or database. The combination of both inherited and referenced attributes may uniquely define each instance to enable the electronic trading system to manage and process transactions for a large number of tradeable instrument variations with minimal computational resources. Thereby, the disclosed embodiments enable the listing en mass and scheduling of a large number of financial instruments for trading to cover, for example, various currency patterns, pricing sources and fixing times.

Abstract: A computer implemented method for aggregating quantities associated with messages includes: generating an implied message for an object based on two constituent messages, wherein the implied message is associated with a value based on the values of the constituent messages, a priority that is equivalent to the lower of the priorities of the constituent messages, and a quantity that is equivalent to the lesser of the quantities of the constituent messages, receiving third and fourth messages, increasing the quantity of the implied message based on the received messages, and upon an occurrence of a match event involving the implied message, automatically allocating all of the quantity of the implied message for matching during the match event before allocating any of the quantity associated with the third message for matching during the match event.

Abstract: A computer implemented method for aggregating quantities associated with messages includes: generating an implied message for an object based on two constituent messages, wherein the implied message is associated with a value based on the values of the constituent messages, a priority that is equivalent to the lower of the priorities of the constituent messages, and a quantity that is equivalent to the lesser of the quantities of the constituent messages, receiving third and fourth messages, increasing the quantity of the implied message based on the received messages, and upon an occurrence of a match event involving the implied message, automatically allocating all of the quantity of the implied message for matching during the match event before allocating any of the quantity associated with the third message for matching during the match event.

Abstract: A coupling mechanism which supports an inventory divider within a storage bin. The coupling mechanism comprises a joint extension and a holding mechanism. The coupling mechanism is coupled to an interior wall of a supply bin. An inventory divider is inserted into the joint extension and is rotated within the joint extension between and upper and lower position within the storage bin. The holding mechanism of the coupling mechanism retains the inventory divider in the upper position, dividing the storage bin into two compartments. By retaining the inventory divider with a holding mechanism that is not directly connected to the bin, the wear on the holding mechanism is substantially reduced and the inventory divider is more secure.

Abstract: A coupling mechanism which supports an inventory divider within a storage bin. The coupling mechanism comprises a joint extension and a holding mechanism. The coupling mechanism is coupled to an interior wall of a supply bin. An inventory divider is inserted into the joint extension and is rotated within the joint extension between and upper and lower position within the storage bin. The holding mechanism of the coupling mechanism retains the inventory divider in the upper position, dividing the storage bin into two compartments. By retaining the inventory divider with a holding mechanism that is not directly connected to the bin, the wear on the holding mechanism is substantially reduced and the inventory divider is more secure.

Abstract: A coupling mechanism which supports an inventory divider within a storage bin. The coupling mechanism comprises a joint extension and a holding mechanism. The coupling mechanism is coupled to an interior wall of a supply bin. An inventory divider is inserted into the joint extension and is rotated within the joint extension between and upper and lower position within the storage bin. The holding mechanism of the coupling mechanism retains the inventory divider in the upper position, dividing the storage bin into two compartments. By retaining the inventory divider with a holding mechanism that is not directly connected to the bin, the wear on the holding mechanism is substantially reduced and the inventory divider is more secure.

Abstract: A data transaction processing system receives electronic data transaction request messages from client computers over a data communication network and groups a subset of the electronic data transaction request messages at varying intervals. The intervals may be dynamically determined and may be based on the volume and rate of the incoming electronic data transaction request messages. The data transaction processing system may preprocess the group of electronic data transaction request messages before forwarding the electronic data transaction request messages to a transaction processor, which processes the subset of electronic data transaction request messages in a non-chronological order.

Abstract: A computer implemented method for aggregating quantities associated with messages includes: generating an implied message for an object based on two constituent messages, wherein the implied message is associated with a value based on the values of the constituent messages, a priority that is equivalent to the lower of the priorities of the constituent messages, and a quantity that is equivalent to the lesser of the quantities of the constituent messages, receiving third and fourth messages, increasing the quantity of the implied message based on the received messages, and upon an occurrence of a match event involving the implied message, automatically allocating all of the quantity of the implied message for matching during the match event before allocating any of the quantity associated with the third message for matching during the match event.

Abstract: A computer implemented method for aggregating quantities associated with messages includes: generating an implied message for an object based on two constituent messages, wherein the implied message is associated with a value based on the values of the constituent messages, a priority that is equivalent to the lower of the priorities of the constituent messages, and a quantity that is equivalent to the lesser of the quantities of the constituent messages, receiving third and fourth messages, increasing the quantity of the implied message based on the received messages, and upon an occurrence of a match event involving the implied message, automatically allocating all of the quantity of the implied message for matching during the match event before allocating any of the quantity associated with the third message for matching during the match event.

Abstract: A data transaction processing system receives electronic data transaction request messages from client computers over a data communication network and groups a subset of the electronic data transaction request messages at varying intervals. The intervals may be dynamically determined and may be based on the volume and rate of the incoming electronic data transaction request messages. The data transaction processing system may preprocess the group of electronic data transaction request messages before forwarding the electronic data transaction request messages to a transaction processor, which processes the subset of electronic data transaction request messages in a non-chronological order.

Abstract: A data transaction processing system receives electronic data transaction request messages from client computers over a data communication network and groups a subset of the electronic data transaction request messages at varying intervals. The intervals may be dynamically determined and may be based on the volume and rate of the incoming electronic data transaction request messages. The data transaction processing system may preprocess the group of electronic data transaction request messages before forwarding the electronic data transaction request messages to a transaction processor, which processes the subset of electronic data transaction request messages in a non-chronological order.

Abstract: A data transaction processing system receives electronic data transaction request messages from client computers over a data communication network and groups a subset of the electronic data transaction request messages. The data transaction processing system may preprocess the group of electronic data transaction request messages based on the other messages in the same group before forwarding the electronic data transaction request messages to a transaction processor.

Abstract: A data transaction processing system receives electronic data transaction request messages from client computers over a data communication network and groups a subset of the electronic data transaction request messages. The data transaction processing system may preprocess the group of electronic data transaction request messages based on the other messages in the same group before forwarding the electronic data transaction request messages to a transaction processor.

Abstract: A data transaction processing system receives electronic data transaction request messages from client computers over a data communication network and groups a subset of the electronic data transaction request messages at varying intervals. The intervals may be dynamically determined and may be based on the volume and rate of the incoming electronic data transaction request messages. The data transaction processing system may preprocess the group of electronic data transaction request messages before forwarding the electronic data transaction request messages to a transaction processor, which processes the subset of electronic data transaction request messages in a non-chronological order.

Abstract: A data transaction processing system receives electronic data transaction request messages from client computers over a data communication network and groups a subset of the electronic data transaction request messages. The data transaction processing system may preprocess the group of electronic data transaction request messages based on the other messages in the same group before forwarding the electronic data transaction request messages to a transaction processor.

Abstract: A computer implemented method for aggregating quantities associated with messages includes: generating an implied message for an object based on two constituent messages, wherein the implied message is associated with a value based on the values of the constituent messages, a priority that is equivalent to the lower of the priorities of the constituent messages, and a quantity that is equivalent to the lesser of the quantities of the constituent messages, receiving third and fourth messages, increasing the quantity of the implied message based on the received messages, and upon an occurrence of a match event involving the implied message, automatically allocating all of the quantity of the implied message for matching during the match event before allocating any of the quantity associated with the third message for matching during the match event.

Abstract: An inventory system for wire shelving is provided which includes a pivoting divider unit that subdivides individual bins of a shelving system into front and rear sections accessed through an open front side of the bin. The divider unit hinges between an upright position and a forwardly-lowered position. When fully stocked, the bin includes articles which are located in both the forward and rearward bin sections with the divider unit oriented in the upright position between adjacent articles. As articles are removed from the front bin section, eventually the divider unit is exposed. The divider unit is then manually tilted forwardly or lowered to allow continued removal of articles from the rear bin section. This lowered orientation of the divider unit indicates that the front bin section is now empty and restocking is due. The divider unit rotatably engages with the wire shelving and includes hinge clips which releasably lock the divider unit in the upright orientation.