Spectral boundary controllability of networks of strings

In this Note we give a necessary and sufficient condition for the spectral controllability from one simple node of a general network of strings that undergoes transversal vibrations in a sufficiently large time. This condition asserts that no eigenfunction vanishes identically on the string that contains the controlled node. The proof combines the Beurling–Malliavin's theorem and an asymptotic formula for the eigenvalues of the network. The optimal control time may be characterized as twice the sum of the lengths of all the strings of the network. To cite this article: R. Dáger, E. Zuazua, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 545–550.     

Prediction of chromatographic retention of metal complexes from stability constants measured by ion chromatography

Chromatographia - A theoretical model is used to predict retention times of divalent metal cations in single-column ion chromatography using one or more ligands in the eluent. Stability constants...     

Separation of 23 dansylated amino acids by micellar electrokinetic chromatography at low temperature

Summary The baseline separation of 23 dansylated amino acids (including 3 didansylated species) is reported. Lowering of the analysis temperature and fine control of the surfactant concentration were essential in obtaining this result. Calibration graphs with good linearity were obtained.     

Dynamic study of gated saturable absorbers

The capability of gated saturable absorbers for single-pulse selection is studied theoretically using the classical space-time-dependent rate-equation model. The dynamics of operation is followed experimentally by the well-known pump—probe technique. Comparing the theoretical and experimental results, it is found that gated saturable absorbers can efficiently be used for pulse forming and pulse selection of pulses longer than picosecond.     

Sufficiency in Quantum Statistical Inference

This paper attempts to develop a theory of sufficiency in the setting of non-commutative algebras parallel to the ideas in classical mathematical statistics. Sufficiency of a coarse-graining means that all information is extracted about the mutual relation of a given family of states. In the paper sufficient coarse-grainings are characterized in several equivalent ways and the non-commutative analogue of the factorization theorem is obtained. As an application we discuss exponential families. Our factorization theorem also implies two further important results, previously known only in finite Hilbert space dimension, but proved here in generality: the Koashi-Imoto theorem on maps leaving a family of states invariant, and the characterization of the general form of states in the equality case of strong subadditivity. Supported by the EU Research Training Network Quantum Probability with Applications to Physics, Information Theory and Biology and Center of Excellence SAS Physics of Information I/2/2005. Supported by the Hungarian grant OTKA T032662