Abstract: A cleaning device for cleaning a dispensing nozzle assembly of a beverage dispenser is disclosed. The dispensing nozzle assembly may include a macro-ingredient/diluent outlet and a number of micro-ingredient outlets surrounding the macro-ingredient/diluent outlet. The cleaning device may include a handle, a head end rotatably attached to the handle, a guidance protrusion extending from the head end, a first set of bristles extending from the head end and surrounding the guidance protrusion, and a second set of bristles extending from the head end adjacent to the first set of bristles.

Abstract: One embodiment may include a machine for providing beverages. The machine may include a reader configured to read data representative of an available balance for a user to obtain beverages from the machine from a machine-readable medium and electronics. The electronics may be configured to receive the data from the machine-readable medium in response to the user positioning the machine-readable medium within reading distance of the reader, enable the user to dispense a beverage into a vessel, and update the available balance of the machine-readable medium so as to reduce or prevent the user from dispensing unlimited beverages.

Abstract: A cleaning device for cleaning a dispensing nozzle assembly of a beverage dispenser is disclosed. The dispensing nozzle assembly may include a macro-ingredient/diluent outlet and a number of micro-ingredient outlets surrounding the macro-ingredient/diluent outlet. The cleaning device may include a handle, a head end rotatably attached to the handle, a guidance protrusion extending from the head end, a first set of bristles extending from the head end and surrounding the guidance protrusion, and a second set of bristles extending from the head end adjacent to the first set of bristles.

Abstract: Certain example embodiments relate to a distributed computing system including servers organized in a cluster and clients. One server is elected leader and is responsible for maintaining consensus information among the other servers. Each server is configured to determine whether a new leader election is to take place. If so, the respective server requests votes for a new leader from the other server(s) and determines whether it has won by a clear majority. Depending on the implementation, votes from eligible client devices are counted, either in a main election together with server votes, or in a tie-break election (if needed) after server votes. Once a server has won, the other servers are informed accordingly. It therefore is possible to maintain a highly-available, consistent, partition-tolerant cluster in the distributed computing systems, using client voters.

Abstract: Certain example embodiments relate to a distributed computing system including servers organized in a cluster and clients. One server is elected leader and is responsible for maintaining consensus information among the other servers. Each server is configured to determine whether a new leader election is to take place. If so, the respective server requests votes for a new leader from the other server(s) and determines whether it has won by a clear majority. Depending on the implementation, votes from eligible client devices are counted, either in a main election together with server votes, or in a tie-break election (if needed) after server votes. Once a server has won, the other servers are informed accordingly. It therefore is possible to maintain a highly-available, consistent, partition-tolerant cluster in the distributed computing systems, using client voters.

Abstract: One embodiment may include a machine for providing beverages. The machine may include a reader configured to read data representative of an available balance for a user to obtain beverages from the machine from a machine-readable medium and electronics. The electronics may be configured to receive the data from the machine-readable medium in response to the user positioning the machine-readable medium within reading distance of the reader, enable the user to dispense a beverage into a vessel, and update the available balance of the machine-readable medium so as to reduce or prevent the user from dispensing unlimited beverages.

Abstract: Certain example embodiments relate to a distributed computing system including servers organized in a cluster and clients. One server is elected leader and is responsible for maintaining consensus information among the other servers. Each server is configured to determine whether a new leader election is to take place. If so, the respective server requests votes for a new leader from the other server(s) and determines whether it has won by a clear majority. Depending on the implementation, votes from eligible client devices are counted, either in a main election together with server votes, or in a tie-break election (if needed) after server votes. Once a server has won, the other servers are informed accordingly. It therefore is possible to maintain a highly-available, consistent, partition-tolerant cluster in the distributed computing systems, using client voters.

Abstract: Certain example embodiments relate to a distributed computing system including servers organized in a cluster and clients. One server is elected leader and is responsible for maintaining consensus information among the other servers. Each server is configured to determine whether a new leader election is to take place. If so, the respective server requests votes for a new leader from the other server(s) and determines whether it has won by a clear majority. Depending on the implementation, votes from eligible client devices are counted, either in a main election together with server votes, or in a tie-break election (if needed) after server votes. Once a server has won, the other servers are informed accordingly. It therefore is possible to maintain a highly-available, consistent, partition-tolerant cluster in the distributed computing systems, using client voters.

Abstract: Certain example embodiments relate to a highly-concurrent, predictable, fast, self-managed, in-process space for storing data that is hidden away from the garbage collector and its related pauses. More particularly, certain example embodiments relate to improved memory management techniques for computer systems that leverage an off-heap direct-memory data store that is massively scalable and highly efficient. The off-heap store may be provided in connection with a Java-based environment, and garbage collection may be completely or nearly completely avoided for the off-heap store. The off-heap store may be integrated into a tiered storage solution in certain example embodiments.

Abstract: Certain example embodiments relate to a highly-concurrent, predictable, fast, self-managed, in-process space for storing data that is hidden away from the garbage collector and its related pauses. More particularly, certain example embodiments relate to improved memory management techniques for computer systems that leverage an off-heap direct-memory data store that is massively scalable and highly efficient. The off-heap store may be provided in connection with a Java-based environment, and garbage collection may be completely or nearly completely avoided for the off-heap store. The off-heap store may be integrated into a tiered storage solution in certain example embodiments.

Abstract: Certain example embodiments relate to a highly-concurrent, predictable, fast, self-managed, in-process space for storing data that is hidden away from the garbage collector and its related pauses. More particularly, certain example embodiments relate to improved memory management techniques for computer systems that leverage an off-heap direct-memory data store that is massively scalable and highly efficient. The off-heap store may be provided in connection with a Java-based environment, and garbage collection may be completely or nearly completely avoided for the off-heap store. The off-heap store may be integrated into a tiered storage solution in certain example embodiments.

Abstract: Certain example embodiments relate to a highly-concurrent, predictable, fast, self-managed, in-process space for storing data that is hidden away from the garbage collector and its related pauses. More particularly, certain example embodiments relate to improved memory management techniques for computer systems that leverage an off-heap direct-memory data store that is massively scalable and highly efficient. The off-heap store may be provided in connection with a Java-based environment, and garbage collection may be completely or nearly completely avoided for the off-heap store. The off-heap store may be integrated into a tiered storage solution in certain example embodiments.

Abstract: Certain example embodiments relate to a highly-concurrent, predictable, fast, self-managed, in-process space for storing data that is hidden away from the garbage collector and its related pauses. More particularly, certain example embodiments relate to improved memory management techniques for computer systems that leverage an off-heap direct-memory data store that is massively scalable and highly efficient. The off-heap store may be provided in connection with a Java-based environment, and garbage collection may be completely or nearly completely avoided for the off-heap store. The off-heap store may be integrated into a tiered storage solution in certain example embodiments.

Abstract: Certain example embodiments relate to a highly-concurrent, predictable, fast, self-managed, in-process space for storing data that is hidden away from the garbage collector and its related pauses. More particularly, certain example embodiments relate to improved memory management techniques for computer systems that leverage an off-heap direct-memory data store that is massively scalable and highly efficient. The off-heap store may be provided in connection with a Java-based environment, and garbage collection may be completely or nearly completely avoided for the off-heap store. The off-heap store may be integrated into a tiered storage solution in certain example embodiments.

Abstract: Immunoassays for the detection of everolimus are provided. Compounds for producing antibodies for everolimus, as well as antibodies produced therefrom, are also provided.

Abstract: A truss includes at least one web member, and a chord member with an opening for positioning the web member therethrough. A portion of the web member is exposed through the chord opening so that the web member can be directly attached to the bearing, such as by welding. The truss can be made using a template that has a body with an inner wall defining an opening, and at least one attachment element connected to the body for attaching the body to the chord member of the truss. The opening in the chord member is formed by inserting a cutting instrument within the template body opening and tracing the cutting instrument along the inner wall of the body.

Abstract: Immunoassays for the detection of everolimus are provided. Compounds for producing antibodies for everolimus, as well as antibodies produced therefrom, are also provided.

Abstract: Compounds that bind to chemokine receptors such as CXCR4 and CCR5 demonstrate protective effects against infection of cells by human immunodeficiency virus are disclosed. These compounds contain a tertiary amine[[s]] linked to a core nitrogen via an aromatic or heteroaromatic moiety.

Abstract: Tertiary amines containing a multiplicity of heteroaromatic substituents are useful as chemokine receptor modulators.

Abstract: Compounds which modulate chemokine receptor activities are disclosed. These compounds are preferably tertiary amines comprising tetrahydroquinoline and benzimidazole.