Making polyurethane foams from microemulsions

A remarkable correlation exists between the degree of expansion of polyurethane foams and the structure of the reacting premixes. Polyurethane foams obtained from reacting premixes containing microemulsions are highly expanded. The expansion rate is proportional to the volume fraction of microemulsion in the premix. The stability of premixes with and without microemulsion is completely different suggesting distinct creaming mechanisms. We apply this idea to synthesize polyurethane foams from microemulsions successfully. This approach can be used to rationalize the design of polyurethane formulations leading to highly expanded foams.     

The impact of roasting on the ochratoxin A content of coffee

Roasting coffee led to a drop in the ochratoxin A (OTA) concentration, as measured by the reference method, especially for dark type roasts. The way the beverage was prepared also affected the OTA content, which could paradoxically be higher than that of the initial roasted coffee. Assays on the thermal stability of pure OTA showed that it ought to be found in larger quantities in roasted coffee. This suggested that OTA was masked by reactions with the substrate during roasting. The absence of OTA in green coffee is therefore the best guarantee of safety.     

Design of sample adaptive product quantizers for noisy channels

Channel-optimized vector quantization (COVQ) has proven to be an effective joint source-channel coding technique that makes the underlying quantizer robust to channel noise. Unfortunately, COVQ retains the high encoding complexity of the standard vector quantizer (VQ) for medium-to-high quantization dimensions and moderate-to-good channel conditions. A technique called sample adaptive product quantization (SAPQ) was recently introduced by Kim and Shroff to reduce the complexity of the VQ while achieving comparable distortions. In this letter, we generalize the design of SAPQ for the case of memoryless noisy channels by optimizing the quantizer with respect to both source and channel statistics. Numerical results demonstrate that the channel-optimized SAPQ (COSAPQ) achieves comparable performance to the COVQ (within 0.2 dB), while maintaining considerably lower encoding complexity (up to half of that of COVQ) and storage requirements. Robustness of the COSAPQ system against channel mismatch is also examined.     

Constraint programming and graph algorithms

Aconstraint system includes a set of variables and a set of relations among these variables, calledconstraints. The solution of a constraint system is an assignment of values to variables so that all, or many, of the relations are made true. A simple and efficient method for constraint resolution has been proposed in the work of B.N. Freeman-Benson, J. Maloney, and A. Borning. We show how their method is related to the classical problem of graph matching, and from this connection we derive new resolution algorithms.