نتایج جستجو برای: insert
تعداد نتایج: 11291 فیلتر نتایج به سال:
Denote by C the elliptic curve y = x(x − 1)(x− s) over the function field Q(s). It degenerates only over the points s = 0, 1,∞ of P and so defines a fiber bundle over C \ {0, 1} with fibers being elliptic curves. Let Fs denote the fiber over the point s. The maps ι : (x, y, s) 7→ (1 − x, iy, 1 − s) and τ : (x, y, s) 7→ (x̄, ȳ, s̄) are topological automorphisms of C. Note ι = −1, τ = 1. The fundam...
The goal of this article is to examine the effectiveness of “forloop” and “while-loop” statements on SCMPDS by insert sort. In this article, first of all, we present an approach to compute the execution result of “for-loop” program by “loop-invariant”, based on Hoare’s axioms for program verification. Secondly, we extend the fundamental properties of the finite sequence and complex instructions...
objective: microleakage in the gingival floor of class ii composite restorations can compromise the marginal adaptation of the filling material to the cavity edges. the aim of this study was to evaluate the effect of light conducting cylindrical inserts in decreasing the microleakage of the gingival floor in cavities 1mm below the cej. materials and methods: eighty maxillary first molars were r...
Background and purpose: Antibody phage display library is a powerful in vitro technology for production of recombinant antibody fragments against a wide variety of antigens. However, the presence of insert-free clones in the phage libraries limited the specific enrichment of antibody fragments in many studies. The aim of this study was to protein A-aided recovery of insert-containing phages in ...
insert ← 1 some preprocessing to use algorithm for (i ← 1; i ≤ n; i ← i + 1) rearrange columns to put matrix in usable form for (j ← 1; j ≤ m; j ← j + 1) sorts columns by source node if (N [i, j] = 1) N ← swapcol(N, j, insert) insert ← insert + 1 top ← 1 now sorts by destination node for arcs with same source insert ← 1 while (top ≤ n) for (i ← 1; i ≤ n; i ← i + 1) for (j ← 1; j ≤ m; j ← j + 1)...
insert() abstract delete() abstract lookup() abstract forall() HashSet ... ListSet ... Set impl insert() delete() lookup() forall() deleteAll() union() constructor() changeImpl() SetImpl abstract insert() abstract delete() abstract lookup() abstract forall() abstract changeImpl() constructor (type subtypeSetImpl) { impl = new type ; }insert() abstract delete() abstract lookup() abstract forall(...
OBJECTIVE To compare the efficacy and safety of a 200-microgram misoprostol vaginal insert with a 10-mg dinoprostone vaginal insert for reducing the time to vaginal delivery. METHODS In a phase III, double-blind, multicenter study, women being induced with a modified Bishop score of 4 or less were randomly assigned to receive either a 200-microgram misoprostol vaginal insert or a 10-mg dinopr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید