نتایج جستجو برای: increasing and increasing
تعداد نتایج: 16845100 فیلتر نتایج به سال:
We consider the concentration of measure for n iid, two-dimensional random variables, under the conditioning that they form a record. Under mild conditions, we show that all random variables tend to concentrate, as n ! 1, around limiting curves, which are the solutions of an appropriate variational problem. We also show that the same phenomenum occurs, without the records conditioning, for the ...
A longest increasing subsequence problem (LIS) is a well-known combinatorial problem with applications mainly in bioinformatics, where it is used in various projects on DNA sequences. Recently, a number of generalisations of this problem were proposed. One of them is to find an LIS among all fixed-size windows of the input sequence (LISW). We propose an algorithm for the LISW problem based on c...
ABSTRACT. We study the shape of the Young diagram λ associated via the Robinson–Schensted– Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing subsequence is not bigger than a fixed number d; in other words we study the restriction of the Plancherel measure to Young diagrams with at most d rows. We prove that in the limit n → ∞ the rows of λ behave like ...
Given a sequence π1π2 . . . πn, a longest increasing subsequence (LIS) in a window π〈l, r〉= πlπl+1 . . . πr is a longest subsequence σ = πi1πi2 . . . πiT such that l ≤ i1 < i2 < · · · < iT ≤ r and πi1 < πi2 < · · · < πiT . We consider the Lisw problem, which is to find the longest increasing subsequences in a sliding window of fixed-size w over a sequence. Formally, it is to find a LIS for ever...
in this study, the effects of oleothermal modification on physical and mechanical peroperties of fir wood (abeis sp.) blocks were examined. at first, some blocks of fir wood with 5 × 20 × 120 cm dimensions were prepared. the blocks were treated in soybean oil. the effects of 3 factors such as treatments temperature (180and 200 °c), holding time (12 and 15 h) and initial moisture content of wood...
Complementing the results claiming that the maximal length L n of an increasing subsequence in a random permutation of f1; 2; : : : ; ng is highly concentrated, we show that L n is not concentrated in a short interval: sup l P(l L n l + n 1=16 log ?3=8 n) ! 0 as n ! 1.
today, information technology and computers are indispensable tools of any profession and translation technologies have become an indispensable part of translator’s workstation. with the increasing demands for high productivity and speed as well as consistency and with the rise of new demands for translation and localization, it is necessary for translators to be familiar with market demands an...
in the present work, a simple and sensitive method was developed for determination of morphine and heroin using gold nanoparticles as resonance rayleigh scattering (rrs) and colorimetric technique’s probe. synthesized gold nanoparticles by sodium citrate reduction method have a negative charge layer on their surfaces because of self-assembled citrate anions on their surface. binding of morphin...
due to extraordinary large amount of information and daily sharp increasing claimant for ui benefits and because of serious constraint of financial barriers, the importance of handling fraud detection in order to discover, control and predict fraudulent claims is inevitable. we use the most appropriate data mining methodology, methods, techniques and tools to extract knowledge or insights from ...
Given a string S = a1a2a3 · · · an, the longest increasing subsequence (LIS) problem is to find a subsequence of S such that the subsequence is increasing and its length is maximal. In this paper, we propose and solve two variants of the LIS problem. The first one is the minimal height LIS where the height means the difference between the greatest and smallest elements. We propose an algorithm ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید