Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.

Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.

Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.

Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.

Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.

Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.

Abstract: A system for conducting transactions in a decentralized market includes two or more execution systems, each of which is associated with a party that is a participant in the decentralized market. Each execution system can originate a transaction on behalf of its associated participant by sending structured offers to the execution systems associated with other participants, wherein the other participant then becomes a counterparty to the transaction. The execution systems can send different offers associated with the transaction to different counterparties, receive a structured acceptance of an offer from the execution system of a counterparty, receive a structured counteroffer associated with the transaction from the execution system of a counterparty, send a structured message containing a counter offer, and execute a trade while simultaneously revoking all other offers and counteroffers.

Abstract: A computer implemented method for assigning values to objects includes receiving a plurality of values for each of a plurality of base objects including a first and second base object; receiving a plurality of values for a first composite object associated with the first and second base objects; generating and storing in the memory a solution set including combinations of values of the first and second base objects; for each combination in the solution set, generating first transaction results by computing transactions between the values of the first and second base objects; comparing each of the first transaction results to a first range of values including the values of the first composite object; and removing, from the solution set and from the memory, the combinations of the values of the first and second base objects corresponding to the first transaction results that are outside of the first range of values.

Abstract: A method and system for facilitating the execution of transactions in a decentralized market are provided herein. The decentralized market includes a number of execution points each associated with and maintained in a secure environment by a single participant. Each participant is able to control the amount of data that is made publicly available, if at all, regarding any transactions that are conducted at that participant's execution point.

Abstract: A method and system for facilitating the execution of transactions in a decentralized market are provided herein. The decentralized market includes a number of execution points each associated with and maintained in a secure environment by a single participant. Each participant is able to control the amount of data that is made publicly available, if at all, regarding any transactions that are conducted at that participant's execution point.

Abstract: The present disclosure relates to tree stands which grasp upright columnar members for example, trees, poles, which are arranged to facilitate climbing and adjusting the height of the tree stand to a desired level and angle. When assembled as a cart, the invention consists of an upper climbing member or frame, lower climbing member or frame, a mechanical-interlocking system, an axle, wheels and a wheel attachment device. The two-climbing-member tree stand may be of a manually adjusting type or of a self-adjusting type which permit adjustment of the spacing of the grasping members so as to effect adjustment of the angle of each tree climber relative to the upright columnar member.

Abstract: The present disclosure relates to tree stands which grasp upright columnar members for example, trees, poles, which are arranged to facilitate climbing and adjusting the height of the tree stand to a desired level and angle. When assembled as a cart, the invention consists of an upper climbing member or frame, lower climbing member or frame, a mechanical-interlocking system, an axle, wheels and a wheel attachment device. The two-climbing-member tree stand may be of a manually adjusting type or of a self-adjusting type which permit adjustment of the spacing of the grasping members so as to effect adjustment of the angle of each tree climber relative to the upright columnar member.

Abstract: A method and system for facilitating the execution of transactions in a decentralized market are provided herein. The decentralized market includes a number of execution points each associated with and maintained in a secure environment by a single participant. Each participant is able to control the amount of data that is made publicly available, if at all, regarding any transactions that are conducted at that participant's execution point.

Abstract: A method for sealing a container comprising a cup and lid is disclosed. The cup has a lip with a raised sealing bead along its length. During sealing, the raised sealing bead compresses, thereby stretching the adhesive layer on the lower portion of the lid out of the way and forming a direct welded seal with the heat-resistant layer of the lid. The adhesive to either side of the sealing bead forms an adhesive seal between the lid and the remaining portion of the lip. This type of double seal is particularly effective in forming a durable, consistent seal when product is present on the lip of the container. The welded seal is also well suited to situations when the cup may be warped or the sealing bead is otherwise caused to be higher along some portion of its length than along other portions.

Abstract: A sealed container comprising a cup and lid and a method for sealing such a container is disclosed. The cup has a lip with a raised sealing bead along its length. During sealing, the raised sealing bead compresses, thereby stretching the adhesive layer on the lower portion of the lid out of the way and forming a direct welded seal with the heat-resistant layer of the lid. The adhesive to either side of the sealing bead forms an adhesive seal between the lid and the remaining portion of the lip. This type of double seal is particularly effective in forming a durable, consistent seal when product is present on the lip of the container. The welded seal is also well suited to situations when the cup may be warped or the sealing bead is otherwise caused to be higher along some portion of its length than along other portions.

Abstract: A method for sealing a container comprising a cup and lid is disclosed. The cup has a lip with a raised sealing bead along its length. During sealing, the raised sealing bead compresses, thereby stretching the adhesive layer on the lower portion of the lid out of the way and forming a direct welded seal with the heat-resistant layer of the lid. The adhesive to either side of the sealing bead forms an adhesive seal between the lid and the remaining portion of the lip. This type of double seal is particularly effective in forming a durable, consistent seal when product is present on the lip of the container. The welded seal is also well suited to situations when the cup may be warped or the sealing bead is otherwise caused to be higher along some portion of its length than along other portions.

Abstract: A container adapted to be sealed with a lid is disclosed. The container cup has a lip with a raised sealing bead along its length. During sealing, the raised sealing bead compresses, thereby stretching the adhesive layer on the lower portion of the lid out of the way and forming a direct welded seal with the heat-resistant layer of the lid. The adhesive to either side of the sealing bead forms an adhesive seal between the lid and the remaining portion of the lip. This type of double seal is particularly effective in forming a durable, consistent seal when product is present on the lip of the container. The welded seal is also well suited to situations when the cup may be warped or the sealing bead is otherwise caused to be higher along some portion of its length than along other portions.