10090296
Evaluation and optimization of the catalog search process of e-procurement platforms
With the emerging of e-catalog standards the product search can be used in a very different and improved matter. 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.
2647352
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.
8163196
Optimizing the catalog search process for e-procurement platforms
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.
1011235
Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
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.
11071092
Docking by Monte Carlo minimization with a solvation correction: Application to an FKBP - substrate complex
A Monte Carlo docking procedure that combines random displacements of the substrate and protein side chains with minimization of the enzyme]substrate complex is described and applied to finding the binding mode of the blocked tetrapeptide N-acetyl-Leu-Pro-Phe-methylamide to the FK506 binding protein Ž . FKBP . The tetrapeptide, an analog of the preferred FKBP substrate, and the FKBP binding site are flexible during the docking procedure. The twisted-imide transition-state form of the substrate is used during docking. The enzyme charges are scaled individually to account for solvent screening of specific binding site residues during the Monte Carlo sampling. To evaluate the relative binding free energies of the resulting structures, a rapid method for calculating polar and nonpolar solvation effects is introduced. Accurate electrostatic solute]solvent energies are calculated by solving the finite-difference linearized Poisson]Boltzmann equation; nonpolar contributions to the stability of the different conformers are estimated by the free energy of cavity formation, which is obtained from the molecular surface, and the solute]solvent van der Waals energy, which is calculated with a continuum approach. In the conformation of the enzyme]substrate complex with the lowest free energy, the tetrapeptide is bound as a type VIa proline turn with solvent accessible ends to permit longer polypeptide chains to act as substrates. Except for the imide carbonyl, which is involved in polar interactions with aromatic side chains of the FKBP binding *Present address: Pharmaceutical Research, F. Hoffmann]La Roche Ltd., CH-4070 Basel, Switzerland. Author to whom all correspondence should be addressed. ( ) Journal of Computational Chemistry, Vol. 18, No. 6, 723]743 1997 Q 1997 by John Wiley & Sons CCC 0192-8651 / 97 / 060723-21 CAFLISCH, FISCHER, AND KARPLUS site, all of the seven potential hydrogen bond donors or acceptors of the tetrapeptide are satisfied. The FKBP binding site has a similar conformation in the substrate complex as in the FKBP-FK506 cocrystal structure, except for the predicted reorientation of the Tyr 82 hydroxyl, which plays an important role in substrate binding. The present model for the FKBP]substrate complex is in agreement with the recently determined crystal structure of a cyclic peptide]FK506 hybrid bound to FKBP and supports the structure obtained previously by iterative model building. In addition, it is consistent with the observed effects of FKBP point mutations on the enzyme activity. The approach described here should be useful, in general, for the prediction of the structure of a molecule in solution or as part of a complex. It provides for the effective sampling of conformational space and for the inclusion of solvent effects. Q 1997 by John Wiley & Sons, Inc.
6828280
Automatic Identification of Diatoms Using Visual Human-Interpretable Features
In this paper we present an identification scheme for diatoms using visual human-interpretable features. Diatoms are unicellular algae found in water and other places wherever there is humidity and enough light for photosynthesis. The automatic identification of diatoms has applications in a number of areas, for example, environmental monitoring and climate research. The overall identification is performed by an ensemble of multiple decision trees following the bagging approach. The use of human-interpretable features in contrast to traditional features, such as Fourier descriptors or moment invariants, makes it possible for a human expert to verify the induced decision trees and opens up the possibility of integrating human expert knowledge into automatically derived decision trees.
46027337
Identification of Diatoms by Grid Graph Matching
Diatoms are unicellular algae found in water and other places wherever there is humidity and enough light for photo synthesis. In this paper a graph matching based identification approach for the retrieval of diatoms from an image database is presented. The retrieval is based on the matching of labeled grid graphs carrying texture information of the underlying diatom. A grid graph is a regular, rectangular arrangement of nodes overlaid on an image. Each node of the graph is labeled with texture features describing a rectangular sub-region of the object. Properties of gray level co-occurrence matrices as well as of Gabor wavelets are used as texture features. The method has been evaluated on a diatom database holding images of 188 different diatoms belonging to 38 classes. For the identification of these diatoms recognition rates of more than 90 percent were obtained.
39157407
Automatic Identification of Diatoms Using Decision Forests
A feature based identification scheme for microscopic images of diatoms is presented in this paper. Diatoms are unicellular algae found in water and other places wherever there is humidity and enough light for photo synthesis. The proposed automatic identification scheme follows a decision tree based classification approach. In this paper two different ensemble learning methods are evaluated and results are compared with those of single decision trees. As test sets two different diatom image databases are used. For each image in the databases general features like symmetry, geometric properties, moment invariants, and Fourier descriptors as well as diatom specific features like striae density and direction are computed.