the purpose of this study is to investigate comparative advantages of corn in comparison with other competitor crops. to do so, linear programming, to 2004-2005 data related to classic index (drc) in kermanshah province was applied. results showed that corn has comparative advantages in all regions of kermanshah province while in optimal cultivation pattern of 37.5 percentages of regions in exi...

the main objective of this study was to develop an optimal cropping pattern for sugar beet growers in fasa district (fars province) and to investigate sugar beet importance in cropping pattern. regarding the effect of risk on producer's decision, two risk sources including price and yield were considered. data was obtained from fasa district producers in 2008. in this study multi-objective...

We study a class of finite state machines, called w-matching machines, which yield to simulate the behavior of pattern matching algorithms while searching for a pattern w. They can be used to compute the asymptotic speed, i.e. the limit of the expected ratio of the number of text accesses to the length of the text, of algorithms while parsing an iid text to find the pattern w. Defining the orde...

abstract- inadequate water supply is the major problem for agriculture in arid and semi-arid regions. thus, effective management should be considered for water resources planning. in this research, a model was provided which is able to estimate optimal land and water allocation in the doroodzan irrigation network. optimal water management model was used at farm level to evaluate different defic...

due to increasing demand for the scarce available water throughout the world it is an extremely important matter, in water management, to make serious attempts in determining its true economic value. this paper discusses the optimal allocation of water to agriculture, the relatively true economic value of water as well as the cropping patterns for the shirvan barzo (sb) dam area in north kh...

We present an asymptotically optimal algorithm to locate all the axes of mirror symmetry of a planar i t The algorithm was derived by reducing the 2-D symmetry problem to linear pattern-matching. Opt gorithms for finding rotational symmetries and deciding whether a point symmetry exists are also prese