نتایج جستجو برای: length of longest flow
تعداد نتایج: 21223529 فیلتر نتایج به سال:
insurers have in the past few decades faced longevity risks - the risk that annuitants survive more than expected - and therefore need a new approach to manage this new risk. in this dissertation we survey methods that hedge longevity risks. these methods use securitization to manage risk, so using modern financial and insurance pricing models, especially wang transform and actuarial concepts, ...
Ficus benjaminais a very popular and resistant indoor plant in temperate areas. Cutting is the easiest propagation method of this plant and it requires special treatments such as auxin and appropriate rooting medium. In order to test the suitable auxin (IBA) concentration and rooting media, a factorial experiment carried out based on randomized complete block design with three replications. Exp...
در این پایان نامه، به کمک نرم افزار flow-3d میدان جریان عبوری از سریز اوجی بررسی می گردد. همچنین اثر هندسه سرریز و بلندای آب بالا دست سرریز بر میدان جریان و توزیع فشار بررسی شده و تاثیر مدل های مختلف آشفتگی (renormalizd group) rng, k-e, prandtl در میدان جریان نیز مورد توجه بوده است. نرم افزار flow-3d یک برنامه تحلیلی میدان جریان است که معادلات حاکم بر میدان جریان عبوری از روی سرریز که همان معاد...
In this paper we define a new problem, motivated by computational biology, LCSk aiming at finding the maximal number of k length substrings, matching in both input strings while preserving their order of appearance. The traditional LCS definition is a special case of our problem, where k = 1. We provide an algorithm, solving the general case in O(n) time, where n is the length of the input stri...
the community dynamics of aquatic coleoptera(insecta)in one of the spring-stream habitats of bammo national park in fars province called cheshmeh-ye-ghanbari is studied as a pilot project and model for acquaintance with and furthering the biodiversity studies on fauna of iran. sixteen species-populations out of nineteen of this community were already identified for their taxonomy and for thei...
In this paper, we propose anO(min{mN,Mn}) time algorithm for finding a longest common subsequence of stringsX and Y with lengthsM andN , respectively, and run-length-encoded lengthsm and n, respectively. We propose a new recursive formula for finding a longest common subsequence of Y and X which is in the run-length-encoded format. That is, Y=y1y2 · · · yN andX=r1 1 r2 2 · · · rm m , where ri i...
The longest common subsequence (LCS) problem is a classic and well-studied problem in computer science with extensive applications in diverse areas ranging from spelling error corrections to molecular biology. This paper focuses on LCS for fixed alphabet size and fixed runlengths (i.e., maximum number of consecutive occurrences of the same symbol). We show that LCS is NP-complete even when rest...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید