DROUGHT DURATION CURVE METHOD AS COMPARED WITH MASS CURVE METHOD
نویسندگان
چکیده
منابع مشابه
Improving Lenstra’s Elliptic Curve Method
In this paper we study an important algorithm for integer factorization: Lenstra’s Elliptic Curve Method. We first discuss how and why this method works and then draw from various research papers to demonstrate how it can be improved. In order to achieve this, we take a look at the torsion subgroup of elliptic curves and review methods for how to generate elliptic curves with prescribed torsion.
متن کاملA Simple Method For Drawing a Rational Curve as TwoB
In this paper, we give a simple method for drawing a closed rational curve speciied in terms of control points as two B ezier segments. The main result is the following: For every aane frame (r; s) (where r < s), for every rational curve F(t) speciied over r; s] by some control polygon (0 ; : : : ; m) (where the i are weighted control points or control vectors), the control points (0 ; : : : ; ...
متن کاملModeling of monthly flow duration curve using nonlinear regression method for un-gauged watersheds of Ardabil Province
The flow duration curve (FDC) represents the frequency distribution of water flow over a period of time, which is widely used in hydrology to evaluate different ranges of river water flow applications. Therefore, it is necessary to develop a suitable estimation model and method in un-gauged watersheds. To this end, in the present study, a modeling method based on nonlinear regression, for the p...
متن کاملA New Method for Modeling Principal Curve
Abstract: Principal curve pass through the middle of a multidimensional data set, to express the distributing shape of the points in the data set, we model principal curve for it. The new method of modeling the complex principal curve, based on B-spline network, is proposed. This method combines the polygonal line algorithm of learning principal curve with B-spline network. At one time, the alg...
متن کاملCurve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Sethian’s Fast Marching Method to find the solution with sub-resolution accuracy and in consistence with the underlying continuous problem. We demonstrate how the method may be applied to compare closed curves, morph one ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Society of Civil Engineers
سال: 1980
ISSN: 1884-4936,0385-5392
DOI: 10.2208/jscej1969.1980.303_53