نتایج جستجو برای: perfect mixing model

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

Journal: :Theor. Comput. Sci. 2001
Reihaneh Safavi-Naini Huaxiong Wang

Traditional point-to-point message authentication systems have been extensively studied in the literature. In this paper, we consider authentication systems for group communication. The basic primitive is a multireceiver authentication system with dynamic senders (DMRA-code). In a DMRA-code any member of the group can broadcast an authenticated message to the rest of the group such that every o...

2007
Xiang Ming Yu Yingkang Hu

We obtain the characterization of saturation class and approximation spaces for perfect spline approximation. Also, a generalized perfect spline approximation is investigated.

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

the thesis has been arranged into five chapters and mainly concerned with the baer-invariant of groups which is the generalization of the schur-multiplier with respect to the variety of groups. chapter one is devoted to collect some notation and background information which are needed in the next chapters. its also contains some important statements which will be generalized in this thesis. cha...

Journal: :Integracion 2022

This paper is a follow-up to previous work where we considered multi-patch model, each patch following logistic law, the patches being coupled by symmetric migration terms. In this drop symmetry hypothesis. First, in case of perfect mixing, i.e when rate tends infinity, total population follows law with carrying capacity which general different from sum n capacities, and depends on Second, dete...

Single Nucleotide Polymorphisms (SNPs) are the most usual form of polymorphism in human genome.Analyses of genetic variations have revealed that individual genomes share common SNP-haplotypes. Theparticular pattern of these common variations forms a block-like structure on human genome. In this work,we develop a new method based on the Perfect Phylogeny Model to identify haplo...

2009
CHRISTOPHER A. FRANCISCO

Let H denote a finite simple hypergraph. The cover ideal of H, denoted by J = J(H), is the monomial ideal whose minimal generators correspond to the minimal vertex covers of H. We give an algebraic method for determining the chromatic number of H, proving that it is equivalent to a monomial ideal membership problem involving powers of J . Furthermore, we study the sets Ass(R/Js) by exploring th...

2005
Long Cao Atul Jain

[1] We examine the sensitivity of simultaneous simulation of climate, natural C, bomb C, and anthropogenic CO2 uptake to the choice of three different ocean mixing schemes: horizontal/vertical mixing (HV), isopycnal mixing (ISO), and Gent-McWilliams mixing (GM) using an Earth system model of intermediate complexity, Integrated Science Assessment Model-2.5D (ISAM-2.5D). Our modeling results sugg...

2011
AARON SMITH

We determine the mixing time of a simple Gibbs sampler on the unit simplex, confirming a conjecture of D. Aldous. The upper bound is based on a two-step coupling, where the first step is a simple contraction argument and the second step is a non-Markovian coupling. We also present a MCMC-based perfect sampling algorithm that is based on our proof and which can be applied to Gibbs samplers that ...

1999
A B Kaidalov Yu A Simonov

Using a nonperturbative method based on asymptotic behaviour of Wilson loops we calculate masses of glueballs and corresponding Regge–trajectories. The only input is string tension fixed by meson Regge slope, while perturbative contributions to spin splittings are defined by standard α s values. The masses of lowest glueball states are in a perfect agreement with lattice results. The leading gl...

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

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