نتایج جستجو برای: so 59 s1
تعداد نتایج: 694088 فیلتر نتایج به سال:
Given k + 1 pairs of vertices (s1, s2), (u1, v1), . . . , (uk, vk) of a directed acyclic graph, we show that a modified version of a data structure of Suurballe and Tarjan can output, for each pair (ul, vl) with 1 ≤ l ≤ k, a tuple (s1, t1, s2, t2) with {t1, t2} = {ul, vl} in constant time such that there are two disjoint paths p1, from s1 to t1, and p2, from s2 to t2, if such a tuple exists. Di...
We have introduced the weight of a group which has a presentation with number of relations is at most the number of generators. We have shown that the number of facets of any contracted pseudotriangulation of a connected closed 3-manifold M is at least the weight of the fundamental group of M . This lower bound is sharp for the 3-manifolds RP, L(3, 1), L(5, 2), S1 × S1 × S1, S2 × S1, S×− S1 and...
The single-strand-specific S1 nuclease from Aspergillus oryzae is an archetypal enzyme of the S1-P1 family of nucleases with a widespread use for biochemical analyses of nucleic acids. We present the first X-ray structure of this nuclease along with a thorough analysis of the reaction and inhibition mechanisms and of its properties responsible for identification and binding of ligands. Seven st...
We investigated whether the mental representation of numbers is abstract amodal or modality-dependent. Subjects verified simple additions. In an event-related potential (ERP) experiment, subjects added an Arabic digit (S2) to a preceding number (S1) offsetting 3 s before S2. S1 was either a visually shown Arabic digit, a written number word or an acoustically presented number word. In a behavio...
A recently proposed scheme for calculating E-shell ionization cross sections in atoms and molecules using the relaxed-core Hartree-Pock (RCHF) approximation is extended to the treatment of shakeup processes. As an example, this scheme is applied to the m-~* satellites in the C ls photoelectron spectrum of CO. These results for the (SO, S1) pair of ~-~* satellite states reveal strong interferenc...
We develop a polynomial time 3-2-approximation algorithm to solve the vertex cover problem on a class of graphs satisfying a property called “active edge hypothesis”. The algorithm also guarantees an optimal solution on specially structured graphs. Further, we give an extended algorithm which guarantees a vertex cover S1 on an arbitrary graph such that |S1| ≤ 32 |S*| + ξ where S* is an optimal ...
Proof. The proof will show that any strategy that results in both spouses going to the bank cannot be optimal. Note that if the second mover saves in account a, she will always save so that u′ (c1) = RaδBu (c2) (and must therefore only be saving at interest rate Ra). Now consider the options of the first mover. First suppose the second mover only deposits savings in the joint account. Then the ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید