TL;DR: The results positively advocate bidirectional strategies for SMILES-based molecular de novo design, with BIMODAL showing superior results to the unidirectional forward RNN for most of the criteria in the tested conditions.
Abstract: Recurrent neural networks (RNNs) are able to generate de novo molecular designs using simplified molecular input line entry systems (SMILES) string representations of the chemical structure. RNN-based structure generation is usually performed unidirectionally, by growing SMILES strings from left to right. However, there is no natural start or end of a small molecule, and SMILES strings are intrinsically nonunivocal representations of molecular graphs. These properties motivate bidirectional structure generation. Here, bidirectional generative RNNs for SMILES-based molecule design are introduced. To this end, two established bidirectional methods were implemented, and a new method for SMILES string generation and data augmentation is introduced-the bidirectional molecule design by alternate learning (BIMODAL). These three bidirectional strategies were compared to the unidirectional forward RNN approach for SMILES string generation, in terms of the (i) novelty, (ii) scaffold diversity, and (iii) chemical-biological relevance of the computer-generated molecules. The results positively advocate bidirectional strategies for SMILES-based molecular de novo design, with BIMODAL showing superior results to the unidirectional forward RNN for most of the criteria in the tested conditions. The code of the methods and the pretrained models can be found at URL https://github.com/ETHmodlab/BIMODAL.
TL;DR: This paper presents a user-specific quantization method based on a likelihood ratio approach (LQ), where the bits generated from every feature are concatenated to form a fixed length binary string that can be hashed to protect its privacy.
Abstract: Preserving the privacy of biometric information stored in biometric systems is becoming a key issue. An important element in privacy protecting biometric systems is the quantizer which transforms a normal biometric template into a binary string. In this paper, we present a user-specific quantization method based on a likelihood ratio approach (LQ). The bits generated from every feature are concatenated to form a fixed length binary string that can be hashed to protect its privacy. Experiments are carried out on both fingerprint data (FVC2000) and face data (FRGC). Results show that our proposed quantization method achieves a reasonably good performance in terms of FAR/FRR (when FAR is 10 4, the corresponding FRR are 16.7% and 5.77% for FVC2000 and FRGC, respectively).
TL;DR: In this article, the authors present a system and method for version string generation for artifacts in a repository, where a product manager generates a first artifact version string for the first artifact based on the first source code version string.
Abstract: System and method for version string generation for artifacts in a repository is disclosed. A first source code management server manages first source code versions in a first repository and assigns a first source code version string to each first source code version. A first artifact repository comprises a first artifact built based on one of the first source code versions. A product manager generates a first artifact version string for the first artifact based on the first source code version string of the first source code version used to build the first artifact.
TL;DR: In this article, a system for structured query language tagging is presented, which comprises a parsing unit for parsing a structured query languages string into components, an analysis unit for analyzing the components and applying associated tags to the components, and a string generation unit for concatenating the components with associated tags into a new string.
Abstract: A system for structured query language tagging is provided. The system comprises a parsing unit for parsing a structured query language string into components, an analysis unit for analyzing the components and applying associated tags to the components, and a string generation unit for concatenating the components with associated tags into a new string.
TL;DR: A rigorous model, m ∗, for channels which permit arbitrarily distributed substitution, deletion and insertion syntactic errors is developed, which demonstrates how dynamic programming can be applied to evaluate quantities involving complex combinatorial expressions and which also maintain rigid probability consistency constraints.