نتایج جستجو برای: n4
تعداد نتایج: 1961 فیلتر نتایج به سال:
The field of heteropolymetallic complexes is of current interest in connection with the structures and roles of polymetallic active sites in biological systems [1], and the design of new molecular materials with magnetic, optical and electrical properties [2,3]. Among various relevant systems, oxamido-bridged polynuclear complexes [2,4] and phenolato-oxygen-bridged macrocyclic complexes [5,6] r...
This paper studies two problems on compressed strings described in terms of straight line programs (SLPs). One is to compute the length of the longest common substring of two given SLP-compressed strings, and the other is to compute all palindromes of a given SLPcompressed string. In order to solve these problems efficiently (in polynomial time w.r.t. the compressed size) decompression is never...
An O(n log n) heuristic for the Euclidean Steiner Minimal Tree (ESMT) problem is presented. The algorithm is based on a decomposition approach which first partitions the vertex set into triangles via the Delaunay triangulation, then "recomposes" the suboptimal Steiner Minimal Tree (SMT) according to the Voronoi diagram and Minimum Spanning Tree (MST) of the point set. The ESMT algorithm was imp...
Coliphage N4-coded, virion-encapsidated RNA polymerase (vRNAP) is able to bind to and transcribe promoter-containing double-stranded DNAs when the template is supercoiled and Escherichia coli single-stranded DNA-binding protein (Eco SSB) is present. We report that vRNAP-promoter recognition and activity on these templates require specific sequences and a hairpin structure on the template strand...
It is known that a general polyhedral scene of complexity n has at most O(n6) combinatorially different orthographic views and at most O(n9) combinatorially different perspective views, and that these bounds are tight in the worst case. In this paper we show that, for the special case of scenes consisting of a collection of n translates of a cube, these bounds improve to O(n4+ε) and O(n6+ε), fo...
We conducted observations and analyses of the molecular cloud, N4, which is located at ~40 pc from SS433 same line sight as that radio shell, in 12CO(J=1-0), 12CO(J=3-2), 13CO(J=3-2), grand-state OH emissions.N4 has a strong gradient integrated intensity 12CO(J=1-0, 3-2) emission northern, eastern western edges. The main body N4 also velocity ~0.16 km s^-1 20"^-1. A shift by up to 3 systemic ~4...
Rates of nitrogen application were studied in relation to commercial yield and fruit quality of cucumber plants (Cucumis sativus L. cv. Bunex). All plants were grown under controlled conditions in a greenhouse. Treatments consisted of the application of N as KNO3 (N1, 2.5 g m-2; N2, 5 g m-2; N3, 10 g m-2; N4, 20 g m-2; and N5, 40 g m-2). The fruits of cucumber from the N3 and N4 treatments were...
Let S0; : : : ; Sn be a symmetric random walk that starts at the origin (S0 = 0), and takes steps uniformly distributed on [ 1;+1]. We study the large-n behavior of the expected maximum excursion and prove the estimate E max 0 k n Sk =r2n 3 c+ 1 5r 2 3 n 1=2 +O(n 3=2); where c = 0:297952 : : :. This estimate applies to the problem of packing n rectangles into a unit-width strip; in particular, ...
Consider the set of points formed by the integer n × n grid, and the process that in each iteration removes from the point set the vertices of its convex-hull. Here, we prove that the number of iterations of this process is O ( n4/3 ) ; that is, the number of convex layers of the n× n grid is Θ ( n4/3 ) . ∗Department of Computer Science; University of Illinois; 201 N. Goodwin Avenue; Urbana, IL...
The n3 and n4 vibrational transitions of methane trapped in solid parahydrogen have been observed by using Fourier transform infrared and high resolution laser spectroscopy. The observed spectrum is interpreted in terms of rovibrational states of the spherical rotor which are subjected to the crystal field splitting. The n4 band shows extremely sharp lines of a width of ;0.003 cm , while the n3...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید