1. introduction behavioral approaches in agricultural studies are approaches which 1. sseek to understand behavior of farmers, 2. emphasize on psychological constructions such as attitudes, values and goals, and collect data related to the land, economic situation etc., and 3. enjoy quantitative methods. in general, such approaches are considered as a combination of motivational factors and str...

Agricultural extension workers’ service has been placed as the central pattern of agricultural transformation in general and smallholder farmers in particular. Due largely to this commensurately known trend, identifying factors that determine farmers’ access to extension workers’ service and the effect of the service on crop yield was found to be imperative. Cross sectional data was collected t...

the purpose of this descriptive-correlation study was to investigate effective factors on rural people’s non-participation of mahabad’s dam catchment in watershed management projects. the research instrument was structural questionnaire with close-ended questions, which its validity confirmed by panel of academic staff and reliability of questionnaire was confirmed. the target population of thi...

the present study was undertaken to analyze factors affecting farmers' participation in the management of water network in jarghouyeh district in isfahan county. a descriptive correlation research design was adopted for the study. at the field work level, surveying was the basic method which was taken into consideration. the statistical population of the study consisted of about 1810 membe...

Let L̃ ≥ א0 be arbitrary. In [20], it is shown that C = ξ̂. We show that −1 < 0. Recent developments in symbolic combinatorics [20] have raised the question of whether there exists an anti-universally ultra-geometric subset. Is it possible to examine Fibonacci, pseudo-irreducible, geometric functors?

We continue the study of the following general problem on vertex colorings of graphs. Suppose that some vertices of a graph G are assigned to some colors. Can this “precoloring” be extended to a proper coloring of G with at most k colors (for some given k)? Here we investigate the complexity status of precoloring extendibility on some classes of perfect graphs, giving good characterizations (ne...