Experiences with an Emotional Sales Agent
With COSIMAB2B we demonstrate a prototype of a complex and visionary e-procurement application. The embodied character agent named COSIMA is able to respect a customer’s preferences and deals with him or her via natural speech. She expresses various emotions via mimic, gesture, combined with speech synthesis, and COSIMA is even able to consider the customer’s emotions via mimic recognition. As first observations show, this is a very promising approach to improve the bargaining with the customer or the recommendation of products.

title: Optimizing the catalog search process for e-procurement platforms
abstract: Many e-procurement platforms support XML-based e-catalogs combined with standardized feature descriptions. Beyond the usual keyword search this opens the arena for attribute-based search engines, including parametric search and preference search. We analyze the impact of different search techniques for such e-catalogs on the overall search process costs. It turns out that preference search has a high potential to significantly reduce the process costs. A large-scale use case with the MAN2B e-procurement platform supports our claim. We identify improvements achievable by using preference search, in particular less navigation steps during the product search and better search results due to the BMO query model. Expensive cases, where frustrated users accept bad search results or phone up the company's purchasing department, should decrease significantly. This in turn will enable the purchasing department to focus more on strategic issues like supplier relationship management than on operative issues as it still happens widely today.

title: Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
abstract: In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSR-based stream ciphers. An algorithm is described which permits to compute the algebraic immunity d of a Boolean function with n variables in $\mathcal{O}(D^2)$ operations, for $D \approx \binom{n}{d}$, rather than in $\mathcal{O}(D^3)$ operations necessary in all previous algorithms. Our algorithm is based on multivariate polynomial interpolation. For assessing the vulnerability of arbitrary Boolean functions with respect to fast algebraic attacks, an efficient generic algorithm is presented that is not based on interpolation. This algorithm is demonstrated to be particularly efficient for symmetric Boolean functions. As an application it is shown that large classes of symmetric functions are very vulnerable to fast algebraic attacks despite their proven resistance against conventional algebraic attacks.

title: New Features of Latin Dances: Analysis of Salsa, ChaCha, and Rumba
abstract: The stream cipher Salsa20 was introduced by Bernstein in 2005 as a candidate in the eSTREAM project, accompanied by the reduced versions Salsa20/8 and Salsa20/12. ChaCha is a variant of Salsa20 aiming at bringing better diffusion for similar performance. Variants of Salsa20 with up to 7 rounds (instead of 20) have been broken by differential cryptanalysis, while ChaCha has not been analyzed yet. We introduce a novel method for differential cryptanalysis of Salsa20 and ChaCha, inspired by correlation attacks and related to the notion of neutral bits. This is the first application of neutral bits in stream cipher cryptanalysis. It allows us to break the 256-bit version of Salsa20/8, to bring faster attacks on the 7-round variant, and to break 6- and 7-round ChaCha. In a second part, we analyze the compression function Rumba, built as the XOR of four Salsa20 instances and returning a 512-bit output. We find collision and preimage attacks for two simplified variants, then we discuss differential attacks on the original version, and exploit a high-probability differential to reduce complexity of collision search from 2256to 279for 3-round Rumba. To prove the correctness of our approach we provide examples of collisions and near-collisions on simplified versions.

title: Expert Conciliation for Multi Modal Person Authentication Systems by Bayesian Statistics
abstract: We present an algorithm functioning as a supervisor module in a multi expert decision making machine. It uses the Bayes theory in order to estimate the biases of individual expert opinions. These are then used to calibrate and conciliate expert opinions to one opinion. We present a framework for simulating decision strategies using expert opinions whose properties are easily modifiable. By using real data coming from a person authentication system using image and speech data we were able to confirm that the proposed supervisor improves the quality of individual expert decisions by reaching success rates of 99.5 %.

title: Can the calculation of ligand binding free energies be improved with continuum solvent electrostatics and an ideal-gas entropy correction?
abstract: The prediction of a ligand binding constant requires generating three-dimensional structures of the complex concerned and reliably scoring these structures. Here, the scoring problem is investigated by examining benzamidine-like inhibitors of trypsin, a system for which errors in the structures are small. Precise and consistent binding free energies for the inhibitors are determined experimentally for this test system. To examine possible improvement of scoring methods, we test the suitability of continuum electrostatics to account for solvation effects and use an ideal-gas entropy correction to account for the changes in the degrees of freedom of the ligand. The small observed root-mean-square deviation of 0.55 kcal/mol of the calculated relative to the experimental values indicates that the essentials of the binding process have been captured. Even though all six ligands make the same salt bridge and H-bonds to the protein, the electrostatic contribution varies among the ligands by as much as 2 kcal/mol. Moreover, although the ligands are rigid and similar in size, the entropic terms also significantly affect the relative binding affinities (by up to 2.7 kcal/mol). The present approach to solvation and entropy may allow the ranking of the ligands to be considerably improved at a cost that makes the method applicable to the optimization of lead compounds or to the screening of small collections of ligands.

title: How well does charge reparametrisation account for solvent screening in molecular mechanics calculations? The example of myosin
abstract: The rate constant of an enzyme-catalysed reaction is one of the major target properties to understand protein function. Atomic-detail computer simulations can in principle be used to estimate rate constants from the energy profile along the reaction coordinate. For such simulations, molecular mechanics is combined with a quantum description of the reaction process. In molecular mechanics calculations, the electrostatic field is represented by the Coulomb potential of partial atomic charges which have been parametrised for small building blocks in vacuum and transferred to the macromolecule. In aqueous solution, however, the electrostatic interactions are affected by the solvent polarization. While this can be described by numerically solving the Poisson-Boltzmann equation, it is computationally expensive. A simple approximation to this is to optimally reproduce the electrostatic potential in solution by reparametrising the partial atomic charges in such a way that a simple Coulomb potential can still be used. Such a procedure would allow to perform fast calculations of reaction processes in proteins while accounting for the solvent screening effect. Here, this method is tested on myosin, a motor protein that is both an enzyme and exists in very different conformations.