Understanding variation in SW (seed weigh) is of major importance in understanding SY (seed yield) variation. The objective of this study was to determine factors such as SN (seed number) per unit area, SFD (seed filling duration) and SFR (seed filling rate) and temperature, LAI (leaf area index), LAD (leaf area duration), above-ground dry matter, CGR (crop growth rate), leaf dry matter re...

The 2003 reform of the European Union’s (EU) Common Agricultural Policy introduced a decoupled income support for farmers called the Single Farm Payment (SFP). Concerns were raised about possible future land use and production changes and their impact on rural communities. Here, such concerns are considered against the workings of the SFP in three EU Member States. Various quantitative studies ...

Z. Li characterized spaces with a weak-development consisting of point-countable sfp-covers by pseudo-sequence-covering, quotient, and π-s-image of metric spaces. In this paper, we omit ”pseudo-sequence-covering” in the above result, and prove that a space has a weak-development consisting of point-countable sfp-covers iff it is a quotient, and π-s-image of a metric space.

In this paper a modified algorithm for solving the split feasibility problem (SFP) is presented. This algorithm uses the generalized Armijo line search in computing predictor step size and gives a correction step rule in the iterative process, which makes an accelerated convergence to the solution of SFP. Meanwhile, it needs not to compute the matrix inverses and the large eigenvalue of the mat...

An improved selective medium, Tryptose-sulfite-cycloserine (TSC) agar, for the enumeration of Clostridium perfringens is described. It consists of the same basal medium as Shahidi-Ferguson-perfringens (SFP) agar, but with 400 mug of D-cycloserine per ml substituted for the kanamycin and polymyxin. Tolerance of C. perfringens for D-cycloserine, its production of lecithinase, and its ability to r...

In this paper, we consider the split feasibility problem (SFP) in infinite-dimensional Hilbert spaces, and study the relaxed implicit extragradient-like methods for finding a common element of the solution set Γ of the SFP and the set Fix(S) of fixed points of a nonexpansive mapping S. Combining Mann’s implicit iterative method and Korpelevich’s extragradient method, we propose two implicit ite...

The split feasibility problem (SFP) is finding a point [Formula: see text] such that [Formula: see text], where C and Q are nonempty closed convex subsets of Hilbert spaces [Formula: see text] and [Formula: see text], and [Formula: see text] is a bounded linear operator. Byrne's CQ algorithm is an effective algorithm to solve the SFP, but it needs to compute [Formula: see text], and sometimes [...