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

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

2013
Eric Angel Evripidis Bampis Vincent Chau Dimitrios Letsios

We study the following energy-efficient scheduling problem. We are given a set of n jobs which have to be scheduled by a single processor whose speed can be varied dynamically. Each job Jj is characterized by a processing requirement (work) pj , a release date rj and a deadline dj . We are also given a budget of energy E which must not be exceeded and our objective is to maximize the throughput...

Journal: :Molecules 2013
Marcos Derita Iván Montenegro Francisco Garibotto Ricardo D Enriz Mauricio Cuellar Fritis Susana A Zacchino

Seventeen drimanes including polygodial (1), isopolygodial (2), drimenol (3) and confertifolin (4) obtained from natural sources and the semi-synthetic derivatives 5-17 obtained from 1-3, were evaluated in vitro for antifungal properties against a unique panel of fungi with standardized procedures by using two end-points, MIC(100) and MIC(50). A SAR analysis of the whole series, supported by co...

2016
Wei-yu Cao Bin Feng Li-fei Cheng Ying Wang Ji Wang Xiao-juan Wang

BACKGROUND Ardipusilloside-I (ADS-I) is a triterpenoid saponin extracted from Chinese medicinal herb Ardisiapusill A. DC. Previous studies have demonstrated the potent anti-tumor activities of ADS-I both in vitro and in vivo, and its main metabolites (M1 and M2) from human intestinal bacteria. However, the physicochemical properties and intestinal permeation rate of ADS-I and its metabolites ar...

2015
ROBERT KRAUTHGAMER BOAZ NADLER DAN VILENCHIK

Estimating the leading principal components of data, assuming they are sparse, is a central task in modern high-dimensional statistics. Many algorithms were developed for this sparse PCA problem, from simple diagonal thresholding to sophisticated semidefinite programming (SDP) methods. A key theoretical question is under what conditions can such algorithms recover the sparse principal component...

2015
Ashish Gupta Neha Chaudhary Kumar Reddy Kakularam Reddanna Pallu Aparoy Polamarasetty Jie Zheng

In this study we introduce a rescoring method to improve the accuracy of docking programs against mPGES-1. The rescoring method developed is a result of extensive computational study in which different scoring functions and molecular descriptors were combined to develop consensus and rescoring methods. 127 mPGES-1 inhibitors were collected from literature and were segregated into training and e...

Journal: :IJHPCA 2003
Cristina Boeres Vinod E. F. Rebello

Task scheduling is a key element in achieving high performance from multicomputer systems. Efficient scheduling algorithms reduce the interprocessor communication and improve processor utilization. To do so effectively, such algorithms must be based on a communication cost model appropriate for computing systems in use. The optimal scheduling of tasks is NP-hard, and a large number of heuristic...

1992
Abhijit Sahay

This paper presents a novel computation schedule for FFT-type computations on a bandwidth-limited parallel computer. Using P processors, we are able to process an n-input FFT graph in the optimal time of n logn P by carefully interleaving interprocessor communication steps with local computation. Our algorithm is suitable for both shared-memory and distributed memory machines and is analyzed in...

Journal: :Theor. Comput. Sci. 2015
David J. Rosenbaum Fabian Wagner

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G ∼= H . For several decades, the np n+O(1) generatorenumeration bound (where p is the smallest prime dividing the order of the group) has been the best worst-case result for general groups. In this work, we show the first improvement over the generator-enumeration boun...

2014
Erkut Erdem

0:-logP(y i = 0 ; data)! 1:-logP(y i = 1 ; data) ! ∑ ∑ ∈ + = edges j i j i i i data y y data y data Energy , 2 1 θ ψ θ ψ θ y D.#Hoiem# Main idea: ! • Construct a graph such that every st-cut corresponds to a joint assignment to the variables y " ! • The cost of the cut should be equal to the energy of the assignment, E(y; data). " ! • The minimum-cut then corresponds to the minimum energy assig...

Journal: :Acta poloniae pharmaceutica 2015
Małgorzata Dołowy Alina Pyka

The lipophilicity (R(MW)) of betamethasone and its four related compounds: betamethasone-17,21-dipropionate, betamethasone-17-valerate, betamethasone-21-valerate and also betamethasone disodium phosphate was determined by reversed phase HPTLC and various mobile phase systems (methanol-water, dioxane-water and acetonitrile-water). The chromatographic lipophilicity parameters obtained for all exa...

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

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