Abstract: An article includes a laminate material with an aerogel layer and a polysiloxane layer distinct from the aerogel layer and in contact with the aerogel layer either directly or through an adhesive that is in direct contact with both the aerogel layer and the polysiloxane layer; where the polysiloxane layer comprises a polysiloxane and greater than 5 weight-percent and 95 weight-percent or less based on polysiloxane layer weight of fire retarding additives selected from a group consisting of metal hydroxides, mixed metal hydroxides, hydrated metal salts, and any combinations thereof dispersed throughout the polysiloxane layer.

Abstract: Aspects of the present disclosure provide for operations for a tree data structure that provides order-based node traversal. For some embodiments, the tree data structure stores one or more key-value pairs, implements at least one linked-list data structure, and enables traversal of nodes within the tree data structure based on a key order (e.g., forward or reverse key order).

Abstract: This disclosure relates to continuous methods of making foamed silicone elastomers. This disclosure also relates to compositions used for forming foamed silicone elastomers. The compositions comprise: (i) an organopolysiloxane having at least two silicon-bonded unsaturated groups per molecule; (ii) an organohydrogensiloxane having at least two silicon-bonded hydrogen atoms per molecule; (iii) a hydrosilylation catalyst; and (iv) a physical blowing agent. Foamed silicone elastomers can be prepared from such compositions, using, for example, the methods disclosed herein.

Abstract: Aspects of the present disclosure provide for operations of a key-value store (KVS) that uses journaling with storage of data (e.g., key data or value data of a key-value pair) in different types of data storage objects (e.g., data storage formats) selected based on one or more criteria.

Abstract: The disclosure relates to a computer-based system for managing just-in-time preparation and delivery of food products. In the system, customers can build, place, and pay for their order. Once the order is placed, the system will track the users location, only starting to prepare their food when the customer is within a specific proximity to the retail location. The proximity will be dynamic and expand and contract with the customer's movements. Finally, the system will coordinate the preparation, assembly and packaging of the order to provide just-in-time delivery of the customer's order, thereby reducing food waste and enhancing the freshness and taste of the product delivered to improve the customer experience.

Abstract: Aspects of the present disclosure provide for operations of a key-value tree data structure that: merge key-value sets within a given node by merging and rewriting key blocks of the key-value sets while rewriting or deferring rewrite of value blocks of the merged key-value sets based on whether one or more child nodes of the given node comprise a leaf node; and move one or more portions of the merged key-value set into one or more child nodes of the given node.

Abstract: Aspects of the present disclosure provide for operations for a tree data structure that provides order-based node traversal. For some embodiments, the tree data structure stores one or more key-value pairs, implements at least one linked-list data structure, and enables traversal of nodes within the tree data structure based on a key order (e.g., forward or reverse key order).

Abstract: Aspects of the present disclosure provide for operations of a key-value store (KVS) that uses journaling with storage of data (e.g., key data or value data of a key-value pair) in different types of data storage objects (e.g., data storage formats) selected based on one or more criteria.

Abstract: Aspects of the present disclosure provide for operations for a tree data structure that provides order-based node traversal. For some embodiments, the tree data structure stores one or more key-value pairs, implements at least one linked-list data structure, and enables traversal of nodes within the tree data structure based on a key order (e.g., forward or reverse key order).

Abstract: Aspects of the present disclosure provide for operations of a key-value store (KVS) that uses journaling with storage of data (e.g., key data or value data of a key-value pair) in different types of data storage objects (e.g., data storage formats) selected based on one or more criteria.

Abstract: The disclosure relates to a computer-based system for managing just-in-time preparation and delivery of food products. In the system, customers can build, place, and pay for their order. Once the order is placed, the system will track the users location, only starting to prepare their food when the customer is within a specific proximity to the retail location. The proximity will be dynamic and expand and contract with the customer's movements. Finally, the system will coordinate the preparation, assembly and packaging of the order to provide just-in-time delivery of the customer's order, thereby reducing food waste and enhancing the freshness and taste of the product delivered to improve the customer experience.

Abstract: Aspects of the present disclosure provide for operations for a tree data structure that provides order-based node traversal. For some embodiments, the tree data structure stores one or more key-value pairs, implements at least one linked-list data structure, and enables traversal of nodes within the tree data structure based on a key order (e.g., forward or reverse key order).

Abstract: Aspects of the present disclosure provide for operations of a key-value store (KVS) that uses journaling with storage of data (e.g., key data or value data of a key-value pair) in different types of data storage objects (e.g., data storage formats) selected based on one or more criteria.

Abstract: Aspects of the present disclosure provide for operations of a key-value tree data structure that: merge key-value sets within a given node by merging and rewriting key blocks of the key-value sets while rewriting or deferring rewrite of value blocks of the merged key-value sets based on whether one or more child nodes of the given node comprise a leaf node; and move one or more portions of the merged key-value set into one or more child nodes of the given node.

Abstract: The disclosure relates to a computer-based system for managing just-in-time preparation and delivery of food products. In the system, customers can build, place, and pay for their order. Once the order is placed, the system will track the users location, only starting to prepare their food when the customer is within a specific proximity to the retail location. The proximity will be dynamic and expand and contract with the customer's movements. Finally, the system will coordinate the preparation, assembly and packaging of the order to provide just-in-time delivery of the customer's order, thereby reducing food waste and enhancing the freshness and taste of the product delivered to improve the customer experience.

Abstract: The disclosure relates to a computer-based system for managing just-in-time preparation and delivery of food products. In the system, customers can build, place, and pay for their order. Once the order is placed, the system will track the users location, only starting to prepare their food when the customer is within a specific proximity to the retail location. The proximity will be dynamic and expand and contract with the customer's movements. Finally, the system will coordinate the preparation, assembly and packaging of the order to provide just-in-time delivery of the customer's order, thereby reducing food waste and enhancing the freshness and taste of the product delivered to improve the customer experience.

Abstract: The disclosure relates to a computer-based system for managing just-in-time preparation and delivery of food products. In the system, customers can build, place, and pay for their order. Once the order is placed, the system will track the users location, only starting to prepare their food when the customer is within a specific proximity to the retail location. The proximity will be dynamic and expand and contract with the customer's movements. Finally, the system will coordinate the preparation, assembly and packaging of the order to provide just-in-time delivery of the customer's order, thereby reducing food waste and enhancing the freshness and taste of the product delivered to improve the customer experience.

Abstract: The disclosure relates to a computer-based system for managing just-in-time preparation and delivery of food products. In the system, customers can build, place, and pay for their order. Once the order is placed, the system will track the users location, only starting to prepare their food when the customer is within a specific proximity to the retail location. The proximity will be dynamic and expand and contract with the customer's movements. Finally, the system will coordinate the preparation, assembly and packaging of the order to provide just-in-time delivery of the customer's order, thereby reducing food waste and enhancing the freshness and taste of the product delivered to improve the customer experience.

Abstract: The disclosure relates to a computer-based system for managing just-in-time preparation and delivery of food products. In the system, customers can build, place, and pay for their order. Once the order is placed, the system will track the users location, only starting to prepare their food when the customer is within a specific proximity to the retail location. The proximity will be dynamic and expand and contract with the customer's movements. Finally, the system will coordinate the preparation, assembly and packaging of the order to provide just-in-time delivery of the customer's order, thereby reducing food waste and enhancing the freshness and taste of the product delivered to improve the customer experience.

Abstract: A pallet or piece of freight on a surface such as the floor of a dry van or flat bed trailer, will shift or move while in transit. The cargo shift stop will prevent the movement of the pallet or freight much like a door stop that holds open an opened door.