We present a parallel algorithm for solving the next element search problem on a set of line segments, using a BSP like model referred to as the Coarse Grained Multicomputer (CGM). The algorithm requires O(1) communication rounds (h-relations with h=O(n/p)), O((n/ p) log n) local computation, and O((n/p) log n) storage per processor. Our result implies solutions to the point location, trapezoid...

In this paper we examine the accuracy and precision of three indices of catch-per-unit-effort (CPUE). We carried out simulations, generating catch data according to six probability distributions (normal, Poisson, lognormal, gamma, delta and negative binomial), three variance structures (constant, proportional to effort and proportional to the squared effort) and their magnitudes (tail weight). ...

Modified Normalized Least Mean Square (MNLMS) algorithm, which is a sign form of NLMS based on set-membership (SM) theory in the class of optimal bounding ellipsoid (OBE) algorithms, requires a priori knowledge of error bounds that is unknown in most applications. In a special but popular case of measurement noise, a simple algorithm has been proposed. With some simulation examples the performa...

secondary flow investigation could be regarded as an important issue in open channel flow, in spite of its lower quantity compared to the base flow in the water course. it should be given special consideration because of the influence on some hydraulic factors in open channel, specifically in compound channels. in compound channels' due to the difference in the flow velocity of the main ch...