Optics miniaturization strategy for demanding Raman spectroscopy applications

Raman spectroscopy provides non-destructive, label-free quantitative studies of chemical compositions at the microscale as used on NASA's Perseverance rover on Mars. Such capabilities come at the cost of high requirements for instrumentation. Here we present a centimeter-scale miniaturization of a Raman spectrometer using cheap non-stabilized laser diodes, densely packed optics, and non-cooled small sensors. The performance is comparable with expensive bulky research-grade Raman systems. It has excellent sensitivity, low power consumption, perfect wavenumber, intensity calibration, and 7 cm-1 resolution within the 400-4000 cm-1 range using a built-in reference. High performance and versatility are demonstrated in use cases including quantification of methanol in beverages, in-vivo Raman measurements of human skin, fermentation monitoring, chemical Raman mapping at sub-micrometer resolution, quantitative SERS mapping of the anti-cancer drug methotrexate and in-vitro bacteria identification. We foresee that the miniaturization will allow realization of super-compact Raman spectrometers for integration in smartphones and medical devices, democratizing Raman technology.

Binary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results

A non-binary Constraint Satisfaction Problem (CSP) can be solved directly using extended versions of binary techniques. Alternatively, the non-binary problem can be translated into an equivalent binary one. In this case, it is generally accepted that the translated problem can be solved by applying well-established techniques for binary CSPs. In this paper we evaluate the applicability of the latter approach. We demonstrate that the use of standard techniques for binary CSPs in the encodings of non-binary problems is problematic and results in models that are very rarely competitive with the non-binary representation. To overcome this, we propose specialized arc consistency and search algorithms for binary encodings, and we evaluate them theoretically and empirically. We consider three binary representations; the hidden variable encoding, the dual encoding, and the double encoding. Theoretical and empirical results show that, for certain classes of non-binary constraints, binary encodings are a competitive option, and in many cases, a better one than the non-binary representation.