نتایج جستجو برای: logp descriptors

تعداد نتایج: 16805  

2012
N. O'Connor P. Salembier P. Correia L. Ward

To address the problem of visual content description, two Description Schemes (DSs) developed within the context of a European ACTS project known as DICEMAN, are presented. The DSs, designed based on an analogy with well-known tools for document description, describe both the structure and semantics of still images and video sequences. The overall structure of both DSs including the various sub...

Journal: :Inf. Process. Lett. 1988
Mikhail J. Atallah Greg N. Frederickson S. Rao Kosaraju

The following problem was considered by Mueller [M]: Suppose we have a specialpurpose hardware device that enables us to son p numbers at a time, in time 0 (P). How can a conventional random access machine use such a device to son n numbers, n >p, in better than o(n logn) time? Clearly, it is impossible to hope for better than 0 (n logn/logp) time performance because of the Q(n logn) lower boWl...

2014
Mariola Plazas Isabel Andújar Santiago Vilanova Pietro Gramazio F. Javier Herraiz Jaime Prohens

Scarlet (Solanum aethiopicum) and gboma (S. macrocarpon) eggplants are major vegetable crops in sub-Saharan Africa. Together with their respective wild ancestors (S. anguivi and S. dasyphyllum) and intermediate cultivated-wild forms they constitute the so-called scarlet and gboma eggplant complexes. We used conventional descriptors and the high-throughput phenomics tool Tomato Analyzer for char...

Journal: :Molecules 2017
Agata Paneth Anna Hawrył Tomasz Plech Mirosław Hawrył Ryszard Świeboda Dominika Janowska Monika Wujec Piotr Paneth

The lipophilicity of two series of thiosemicarbazide derivatives was assessed by the RP-HPLC method with the RP-18 chromatographic column and the methanol-water mixture as the mobile phase. Distribution coefficients logPHPLC were compared to calculated values generated by commonly used AClogP software and quantum chemical calculations. The reliability of the predictions was evaluated using the ...

1988
Yosi Ben-Asher David Egozi Assaf Schuster

This paper studies a set of 2-D basic algorithms for SIMD perfect shuffle networks. Those algorithms where studied in [1] and [SN], but for the 1-D case, where the size of the problem N is the same as the number of processors P. For the 2-D case of N = L * P, we improve some algorithms to be "2-D efficient", by improving their running time from Ο(L *logP) to Ο(L + logP), as N exceeds P. We give...

Journal: :Processes 2021

Small molecule lipophilicity is often included in generalized rules for medicinal chemistry. These aim to reduce time, effort, costs, and attrition rates drug discovery, allowing the rejection or prioritization of compounds without need synthesis testing. The availability high quality, abundant training data machine learning methods can be a major limiting factor building effective property pre...

Journal: :Bernoulli 2022

This paper studies schemes to de-bias the Lasso in sparse linear regression with Gaussian design where goal is estimate and construct confidence intervals for a low-dimensional projection of unknown coefficient vector preconceived direction a0. Our analysis reveals that previously analyzed propositions require modification order enjoy nominal coverage asymptotic efficiency full range level spar...

2002
Edgar A. León Arthur B. Maccabe Ron Brightwell

This paper describes an apparatus which can be used to vary communication performance parameters for MPI applications, and provides a tool to analyze the impact of communication performance on parallel applications. Our apparatus is based on Myrinet (along with GM). We use an extension of the LogP model to allow higher flexibility in determining the parameter(s) to which parallel applications m...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید