Abstract: Miscible antifoams are provided that do not separate out of a target liquid and that are easy to incorporate in the target liquid. A method or system involves mixing a liquid (‘a miscible antifoam’) into a target foaming liquid. This miscible antifoam is engineered/chosen such that it has both a higher surface tension and is more volatile than the target liquid, or engineered such that it has both a lower surface tension and is less volatility than the target liquid. The miscible antifoam leads to surface tension gradients that cause bubble rupture up to 10 times faster than the target liquid without the antifoam. Further, the miscible antifoams are easy to incorporate and do not separate out from the target liquid during operation—both of which are key limitations faced by existing antifoams.

Abstract: Dynamic thin film interferometry is a technique used to non-invasively characterize the thickness of thin liquid films that are evolving in both space and time. Recovering the underlying thickness from the captured interferograms, unconditionally and automatically is still an open problem. A compact setup is provided employing a snapshot hyperspectral camera and the related algorithms for the automated determination of thickness profiles of dynamic thin liquid films. The technique is shown to recover film thickness profiles to within 100 nm of accuracy as compared to those profiles reconstructed through the manual color matching process. Characteristics and advantages of hyperspectral interferometry are discussed including the increased robustness against imaging noise as well as the ability to perform thickness reconstruction without considering the absolute light intensity information.

Abstract: Systems, methods, and computer-readable media are disclosed for an improved database. The systems, methods, and computer-readable media described herein may enhance the response time of databases and improve user experiences. In an example method described herein, a database monitoring system may receive instructions to perform one or more data monitoring operations comprising counting an occurrence of a first value within at least a portion of items stored in a database. The method may include determining a length of a first window of time and fetching, from a first location of a data store of the database, data indicative of a total count of the occurrence of the first value at a time associated with the beginning of the first window of time. In turn, the monitoring system may store data representing the first count in the first memory.

Abstract: Dynamic thin film interferometry is a technique used to non-invasively characterize the thickness of thin liquid films that are evolving in both space and time. Recovering the underlying thickness from the captured interferograms, unconditionally and automatically is still an open problem. A compact setup is provided employing a snapshot hyperspectral camera and the related algorithms for the automated determination of thickness profiles of dynamic thin liquid films. The technique is shown to recover film thickness profiles to within 100 nm of accuracy as compared to those profiles reconstructed through the manual color matching process. Characteristics and advantages of hyperspectral interferometry are discussed including the increased robustness against imaging noise as well as the ability to perform thickness reconstruction without considering the absolute light intensity information.

Abstract: Systems, methods, and computer-readable media are disclosed for an improved database. The systems, methods, and computer-readable media described herein may enhance the response time of databases and improve user experiences. In an example method described herein, a database monitoring system may receive instructions to perform one or more data monitoring operations comprising counting an occurrence of a first value within at least a portion of items stored in a database. The method may include determining a length of a first window of time and fetching, from a first location of a data store of the database, data indicative of a total count of the occurrence of the first value at a time associated with the beginning of the first window of time. In turn, the monitoring system may store data representing the first count in the first memory.

Abstract: Techniques are provided for a peer-to-peer web traffic management. A first mapping between identifiers and peers in a network is established. Upon receiving a first request associated with a first identifier and classifiers, based, at least in part, on the first identifier, a first peer retrieves a first global counter snapshot and a first local increment counter, and uses them to determine whether the first peer can service the first request. If the determination is positive, then the first peer services the first request, and updates the first local increment counter. If the first local increment counter exceeded a threshold value, then the first local increment counter is transmitted to a second peer, and then reset to zero. In response to the first peer receiving a first global counter associated with the first global counter snapshot, the first global counter snapshot is updated with the first global counter.

Abstract: Techniques are provided for a peer-to-peer web traffic management. A first mapping between identifiers and peers in a network is established. Upon receiving a first request associated with a first identifier and classifiers, based, at least in part, on the first identifier, a first peer retrieves a first global counter snapshot and a first local increment counter, and uses them to determine whether the first peer can service the first request. If the determination is positive, then the first peer services the first request, and updates the first local increment counter. If the first local increment counter exceeded a threshold value, then the first local increment counter is transmitted to a second peer, and then reset to zero. In response to the first peer receiving a first global counter associated with the first global counter snapshot, the first global counter snapshot is updated with the first global counter.

Abstract: Techniques are provided for a peer-to-peer web traffic management. A first mapping between identifiers and peers in a network is established. Upon receiving a first request associated with a first identifier and classifiers, based, at least in part, on the first identifier, a first peer retrieves a first global counter snapshot and a first local increment counter, and uses them to determine whether the first peer can service the first request. If the determination is positive, then the first peer services the first request, and updates the first local increment counter. If the first local increment counter exceeded a threshold value, then the first local increment counter is transmitted to a second peer, and then reset to zero. In response to the first peer receiving a first global counter associated with the first global counter snapshot, the first global counter snapshot is updated with the first global counter.

Abstract: Techniques are provided for a peer-to-peer web traffic management. A first mapping between identifiers and peers in a network is established. Upon receiving a first request associated with a first identifier and classifiers, based, at least in part, on the first identifier, a first peer retrieves a first global counter snapshot and a first local increment counter, and uses them to determine whether the first peer can service the first request. If the determination is positive, then the first peer services the first request, and updates the first local increment counter. If the first local increment counter exceeded a threshold value, then the first local increment counter is transmitted to a second peer, and then reset to zero. In response to the first peer receiving a first global counter associated with the first global counter snapshot, the first global counter snapshot is updated with the first global counter.

Abstract: Techniques are provided for a peer-to-peer web traffic management. A first mapping between identifiers and peers in a network is established. Upon receiving a first request associated with a first identifier and classifiers, based, at least in part, on the first identifier, a first peer retrieves a first global counter snapshot and a first local increment counter, and uses them to determine whether the first peer can service the first request. If the determination is positive, then the first peer services the first request, and updates the first local increment counter. If the first local increment counter exceeded a threshold value, then the first local increment counter is transmitted to a second peer, and then reset to zero. In response to the first peer receiving a first global counter associated with the first global counter snapshot, the first global counter snapshot is updated with the first global counter.

Abstract: Techniques are provided for a peer-to-peer web traffic management. A first mapping between identifiers and peers in a network is established. Upon receiving a first request associated with a first identifier and classifiers, based, at least in part, on the first identifier, a first peer retrieves a first global counter snapshot and a first local increment counter, and uses them to determine whether the first peer can service the first request. If the determination is positive, then the first peer services the first request, and updates the first local increment counter. If the first local increment counter exceeded a threshold value, then the first local increment counter is transmitted to a second peer, and then reset to zero. In response to the first peer receiving a first global counter associated with the first global counter snapshot, the first global counter snapshot is updated with the first global counter.