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

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

2004
Hongwen Huang Jianqiang Li Thomas L. Kubisiak

AIK+TXACT. Phylogenetic relationships within theftcfinidio were investigated usingrandomly amplified polymorphic DNA (RAPD) markers. DNAs from 10 taxa, including31 species encompassing all four sections and four series of the traditional subdivisions within the genus, were amplified using 22 preselected IO-mer oligonucieotide primers. A total 204 DNA bands were scored across the 10 taxa, of whi...

Journal: :Journal of Machine Learning Research 2003
Shahar Mendelson

where (Ω,μ) is a probability space. The kernel K is used to generate a Hilbert space, known as a reproducing kernel Hilbert space, whose unit ball is the class of functions we investigate. Recall that if K is a positive definite function K : Ω×Ω → R, then by Mercer’s Theorem there is an orthonormal basis (φi)i=1 of L2(μ) such that μ× μ almost surely, K(x,y) = ∑i=1 λiφi(x)φi(y), where (λi)i=1 is...

2014

Abraham A. (United Kingdom) Adolfsson L. (Sweden) Aik S. (Malaysia) Barton-Hanson N. (United Kingdom) Birkholtz F. (South Africa) Blonna D. (Italy) Bose D. (United Kingdom) Britten S. (United Kingdom) Bruce C. (United Kingdom) Burkhart K. (Germany) Chee Y. H. (Singapore) Chua Y. P. (Malaysia) Davis B. (United Kingdom) de Kiewiet G. (United Kingdom) den Hartog D. (Netherlands) Ekholm C. (Sweden)...

Journal: :Annals OR 2012
József Bukszár Gergely Mádi-Nagy Tamás Szántai

Let A1, . . . , An be arbitrary events. The underlying problem is to give lower and upper bounds on the probability P (A1∪· · ·∪An) based on P (Ai1∩· · ·∩Aik), 1 ≤ i1 < · · · < ik ≤ n, where k = 1, . . . , d, and d ≤ n (usually d << n) is a certain integer, called the order of the problem or the bound. Most bounding techniques fall in one of the following two main categories: those that use (hy...

2015
Liu Yan

Trusted cloud computing platform is a combination of the use of virtual machine technology and trusted computing technology of cloud computing platform. Virtual machine technology because of its high separability of the client and the resource of high controllability, which greatly improves the security of the system; and the trusted computing technology is through the establishment of a truste...

Journal: :Iranian biomedical journal 2007
Kaveh Haratian Mahmood Shamsi Shahrabadi Soroush Sardari

BACKGROUND Measles virus (MV) is a highly contagious agent which causes a major health problem in developing countries. We studied the effect of buthionine sulfoximine (BSO) on the replication of an AIK-HDC strain of MV and its induced apoptosis in Vero cell lines. METHODS In this study, toxicity of BSO on Vero cells was investigated first, resulted in determination of sub-lethal or non-toxic...

Journal: :Discrete Mathematics 2003
Peter J. Cameron

AAA BBB CCC DDD EEE FFF GGG HHH III JJJ KKK LLL MMM NNN OOO PPP HGB GHA FED EFC DCF CDE BAH ABG POJ OPI NML MNK LKN KLM JIP IJO KJD LIC ILB JKA ONH PMG MPF NOE CBL DAK ADJ BCI GFP HEO EHN FGM MIE NJF OKG PLH IMA JNB KOC LPD EAM FBN GCO HDP AEI BFJ CGK DHL OFL PEK MHJ NGI KBP LAO IDN JCM GND HMC EPB FOA CJH DIG ALF BKE PCN ODM NAP MBO LGJ KHI JEL IFK HKF GLE FIH EJG DOB CPA BMD ANC BDC ACD DBA C...

2015
Matteo Brunelli Michele Fedrizzi

A vast amount of indices has been proposed in the literature [1] to quantify the deviation of a pairwise comparison matrix A = (aij)n×n from the consistency property aik = aijajk ∀i, j, k. In this paper we propose a unifying approach by expressing an inconsistency index as a function of the matrix entries aij satisfying a set of suitable properties. More precisely, we first consider the ‘local’...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 1978
M Kimura J F Crow

The selective advantage of an allele Gi (relative to the mean of alleles at this locus) is given by (formula: see text) in which Ai is the average excess of the allele on the character, X; W(X) is the fitness function; F(X) is the frequency function; W is the mean fitness; and the prime denotes differentiation. With truncation selection si = AaF(C)/w in which F(C) is the ordinate at the culling...

1992
Noga Alon Zvi Galil Oded Margalit Moni Naor

The subcubic (O(n) for ω < 3) algorithms to multiply Boolean matrices do not provide the witnesses; namely, they compute C = AB but if Cij = 1 they do not find an index k (a witness) such that Aik = Bkj = 1. We design a deterministic algorithm for computing the matrix of witnesses that runs in Õ(n) time, where here Õ(n) denotes O(n(log n)). The subcubic methods to compute the shortest distances...

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

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