نتایج جستجو برای: o minimum 1population

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

2010

T R I B O L O G Y & L U B R I C A T I O N T E C H N O L O G Y W W W . S T L E . O R G nterest in the use of biodegradable lubricants continues as more emphasis is placed on using fluids that are derived from sustainable raw materials. One area of concern with current biodegradable lubricants is inferior performance compared to synthetic lubricants, particularly from the standpoint of oxidation ...

Journal: :Bioscience, biotechnology, and biochemistry 2007
Jian-Xiao Shi Zhi-Xuan Li Teruhiko Nitoda Minoru Izumi Hiroshi Kanzaki Naomichi Baba Kazuyoshi Kawazu Shuhei Nakajima

Three compounds, 20-O-acetyl-[3-O-(2'E,4'Z)-decadienoyl]-ingenol (1), 20-O-acetyl-[5-O-(2'E,4'Z)-decadienoyl]-ingenol (2) and 3-O-(2'E,4'Z)-decadienoylingenol (3), were isolated from Euphorbia kansui under the bioassay-guided method. Each compound showed the same antinematodal activity against the nematode, Bursaphelenchus xylophilus, at a minimum effective dose (MED) of 5 microg/cotton ball.

Objective: The main objective pursued in this paper is to investigate the energy consumption for drying of potato slices using vacuum-infrared drying method. Methods: Drying of potato slices with the thicknesses of 1, 2 and 3 mm were conducted at vacuum levels of zero (without vacuum), 20, 80 and 140 mm [Hg], infrared radiation at power levels of 100, 150 and 200 W in the three repetition. Resu...

Objective: The main objective pursued in this paper is to investigate the energy consumption for drying of potato slices using vacuum-infrared drying method. Methods: Drying of potato slices with the thicknesses of 1, 2 and 3 mm were conducted at vacuum levels of zero (without vacuum), 20, 80 and 140 mm [Hg], infrared radiation at power levels of 100, 150 and 200 W in the three repetition. Resu...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده علوم پایه 1391

در این پژوهش، تعدادی ترکیب فسفر-کلر با فرمول های xc(o)nhp(o)cl2 x]=cf3، ccl3، cf2cl و[ch2cl ، 4-ch3-c6h4nhp(o)cl2 ، 4-ch3-c6h4s(o)2nhp(o)cl2 و [4-ch3-c6h4nh]2p(o)cl تهیه و برای سنتز فسفر آمیدهای با فرمول ccl3c(o)nhp(o)y ] [nh(ch2)3nh=y (1) و [nhch2c(ch3)2ch2nh=y] (2)، [h2n(ch2ch3)2][4-ch3-c6h4s(o)2nhp(o)n(ch2ch3)2].h2o (3)، 4-ch3-c6h4nhp(o)[n(ch3)(ch2c6h5)]2 (4)، [4-ch3-c6h4nh]2p(o)op(o)[nhc6h4...

2017
Xingtao Huang Yongpeng Zou Lulu Li Shuyuan Chen Jingbo Hou Bo Yu

The ABO blood types related to morphological characteristics of atherosclerosis plaque are not clear. We aimed to evaluate the relationship between ABO blood groups and the coronary plaque characteristic. We retrospectively identified the target lesions in 392 acute coronary syndrome patients who underwent optical coherence tomography examination before stenting. Subjects were divided into diff...

2005
Yngve Villanger

We show that the number of potential maximal cliques for an arbitrary graph G on n vertices is O∗(1.8135n), and that all potential maximal cliques can be listed in O∗(1.8899n) time. As a consequence of this results, treewidth and minimum fill-in can be computed in O∗(1.8899n) time.

2010
Graham Smith Urs D. Wermuth

In the title salt, C(12)H(11)N(2)O(2) (+)·C(7)H(4)NO(5) (-), the cations and anions inter-act through asymmetric cyclic pyridinium-carboxyl-ate N-H⋯O,O' hydrogen-bonding associations [graph set R(1) (2)(4)], giving discrete heterodimers having weak cation-anion π-π aromatic ring inter-actions [minimum ring centroid separation = 3.7116 (9) Å].

2004
Mikhail J. Atallah

In this paper we present an algorithm with O(n log2n) complexity to find a shortest maximal increasing subsequence of a sequence of numbers. As a byproduct of this algorithm a O(n log2n) algorithm to find a minimum (weight) independent dominating set in permutation graphs is obtained, this compares favorable with the previous O(n3) algorithms known to solve

2010
Yong Zhang Francis Y. L. Chin Hing-Fung Ting

In this paper, two distributed algorithms for the minimum vertex cover problem are given. In the unweighted case, we propose a 2.5-approximation algorithm with round complexity O(∆), where ∆ is the maximal degree of G, improving the previous 3-approximation result with the same round complexity O(∆). For the weighted case, we give a 4-approximation algorithm with round complexity O(∆).

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

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