Genome-wide association mapping and genomic prediction of stalk rot in two mid-altitude tropical maize populations

Maize stalk rot reduces grain yield and quality.Information about the genetics of resistance to maize stalk rot could help breeders design effective breeding strategies for the trait.Genomic prediction may be a more effective breeding strategy for stalk-rot resistance than marker-assisted selection.We performed a genome-wide association study(GWAS)and genomic prediction of resistance in testcross hybrids of 677 inbred lines from the Tuxpe?o and non-Tuxpe?o heterotic pools grown in three environments and genotyped with 200,681 single-nucleotide polymorphisms(SNPs).Eighteen SNPs associated with stalk rot shared genomic regions with gene families previously associated with plant biotic and abiotic responses.More favorable SNP haplotypes traced to tropical than to temperate progenitors of the inbred lines.Incorporating genotype-by-environment(G×E)interaction increased genomic prediction accuracy.

Iterative convergence theorems for maximal monotone operators and relatively nonexpansive mappings

In this paper, some iterative schemes for approximating the common element of the set of zero points of maximal monotone operators and the set of fixed points of relatively nonexpansive mappings in a real uniformly smooth and uniformly convex Banach space are proposed. Some strong convergence theorems are obtained, to extend the previous work.

New iterative schemes for strongly relatively nonexpansive mappings and maximal monotone operators

In this paper, some new iterative schemes for approximating the common element of the set of fixed points of strongly relatively nonexpansive mappings and the set of zero points of maximal monotone operators in a real uniformly smooth and uniformly convex Banach space are proposed. Some weak convergence theorems are obtained, which extend and complement some previous work.

g-η-Monotone mapping and resolvent operator technique for solving generalized implicit variational-like inclusions

A new class of g-η-monotone mappings and a class of generalized implicit variational-like inclusions involving g-η-monotone mappings are introduced. The resolvent operator of g-η-monotone mappings is defined and its Lipschitz continuity is presented, An iterative algorithm for approximating the solutions of generalized implicit wriational- like inclusions is suggested and analyzed. The convergence of iterative sequences generated by the algorithm is also proved,

Strong convergence theorem for relatively nonexpansive mapping and inverse-strongly-monotone mapping in a Banach space

In this paper, we introduce an iterative sequence for finding a common element of the set of fixed points of a relatively nonexpansive mapping and the set of solutions of the variational inequality for an inverse-strongly-monotone mapping in a Banach space. Then, we show that the sequence converges strongly to a common element of the two sets. Our results improve and extend the corresponding results reported by many others.

SOME RESULTS ON GENERALIZED EQUILIBRIUM PROBLEMS INVOLVING STRICTLY PSEUDOCONTRACTIVE MAPPINGS

In this paper,we consider an iterative sequence for generalized equilibrium problems and strictly pseudocontractive mappings.We show that the iterative sequence converges strongly to a common element of the solution set of generalized equilibrium problems and of the fixed point set of strictly pseudocontractive mappings.

A NEW ITERATIVE METHOD FOR FINDING COMMON SOLUTIONS OF GENERALIZED EQUILIBRIUM PROBLEM,FIXED POINT PROBLEM OF INFINITE k-STRICT PSEUDO-CONTRACTIVE MAPPINGS,AND QUASI-VARIATIONAL INCLUSION PROBLEM

In this article, we introduce a hybrid iterative scheme for finding a common element of the set of solutions for a generalized equilibrium problems, the set of common fixed point for a family of infinite k-strict pseudo-contractive mappings, and the set of solutions of the variational inclusion problem with multi-valued maximal monotone mappings and inverse-strongly monotone mappings in Hilbert space. Under suitable conditions, some strong convergence theorems are proved. Our results extends the recent results in G.L.Acedo and H.K.Xu [2], Zhang, Lee and Chan [8], Wakahashi and Toyoda [9], Takahashi and Takahashi [I0] and S. S. Chang, H. W. Joseph Lee and C. K. Chan [II], S.Takahashi and W.Takahashi [12]. Moreover, the method of proof adopted in this article is different from those of [4] and [12].

Implementation Framework and Validation of Cluster-Nuclei Based Channel Model Using Environmental Mapping for 6G Communication Systems

With the research of the upcoming sixth generation(6 G) systems, new technologies will require wider bandwidth, larger scale antenna arrays and more diverse wireless communication scenarios on the future channel modeling. Considering channel model is prerequisite for system design and performance evaluation of 6 G technologies, we face a challenging task: how to accurately and efficiently model 6 G channel for various scenarios? This paper tries to answer it. Firstly, the features of cluster-nuclei(CN) and principle of cluster-nuclei based channel model(CNCM) are introduced. Then, a novel modeling framework is proposed to implement CNCM,which consists four steps: propagation environment reconstruction, cluster-nuclei identification, multipath parameters generation, and channel coefficients generation. Three-dimensional environment with material information is utilized to map CN with scatterers in the propagation pathway. CN are identified by geometrical and electric field calculation based on environmental mapping, and multipath components within CN are calculated by statistical characteristics of angle, power and delay domains. Finally, we present a three-level verification structure to investigate the accuracy and complexity of channel modeling comprehensively. Simulation results reveal that CNCM can perform higher accuracy than geometrybased stochastic model while lower complexity compared with ray-tracing model for practical propagation environment.

MAXIMAL ELEMENTS FOR G_B-MAJORIZED MAPPINGS IN PRODUCT G_CONVEX SPACES AND APPLICATIONS (Ⅱ)

A new family of set_valued mappings from a topological space into generalized convex spaces was introduced and studied. By using the continuous partition of unity theorem and Brouwer fixed point theorem, several existence theorems of maximal elements for the family of set_valued mappings were proved under noncompact setting of product generalized convex spaces. These theorems improve, unify and generalize many important results in recent literature.

MAXIMAL ELEMENTS FOR G_B-MAJORIZED MAPPINGS IN PRODUCT G-CONVEX SPACES AND APPLICATIONS (Ⅰ)

A new family of set_valued mappings from a topological space into generalized convex spaces was introduced and studied. By using the continuous partition of unity theorem and Brouwer fixed point theorem, several existence theorems of maximal elements for the family of set_valued mappings were proved under noncompact setting of product generalized convex spaces. These theorems improve, unify and generalize many important results in recent literature.

ELXED POINT THEOREM OF COMPOSITION g-CONTRACTION MAPPING AND ITS APPLICATIONS

Any composition sequential mapping, periodic composition mapping of a complete non-empty metric space M into M with geometric mean contraction ratio less than 1 ( simplifying as 'g-contraction mapping' ) has a unique fixed point in M . Applications of the theorem to the proof of existence and uniqueness of the solutions of a set of non-linear differential equations and a coupled integral equations of symmetric bending of shallow shell of revolution are given.

CONVERGENCE OF HYBRID VISCOSITY AND STEEPEST-DESCENT METHODS FOR PSEUDOCONTRACTIVE MAPPINGS AND NONLINEAR HAMMERSTEIN EQUATIONS

In this article, we first introduce an iterative method based on the hybrid viscos- ity approximation method and the hybrid steepest-descent method for finding a fixed point of a Lipschitz pseudocontractive mapping （assuming existence） and prove that our proposed scheme has strong convergence under some mild conditions imposed on algorithm parameters in real Hilbert spaces. Next, we introduce a new iterative method for a solution of a non- linear integral equation of Hammerstein type and obtain strong convergence in real Hilbert spaces. Our results presented in this article generalize and extend the corresponding results on Lipschitz pseudocontractive mapping and nonlinear integral equation of Hammerstein type reported by some authors recently. We compare our iterative scheme numerically with other iterative scheme for solving non-linear integral equation of Hammerstein type to verify the efficiency and implementation of our new method.

A NEW ALGORITHM FOR MONOTONE INCLUSION PROBLEMS AND FIXED POINTS ON HADAMARD MANIFOLDS WITH APPLICATIONS

In this article,we propose a new algorithm and prove that the sequence generalized by the algorithm converges strongly to a common element of the set of fixed points for a quasi-pseudo-contractive mapping and a demi-contraction mapping and the set of zeros of monotone inclusion problems on Hadamard manifolds.As applications,we use our results to study the minimization problems and equilibrium problems in Hadamard manifolds.

A Monotonicity Condition for Strong Convergence of the Mann Iterative Sequence for Demicontractive Maps in Hilbert Spaces

Let?be a real Hilbert space and?C?be a nonempty closed convex subset of H. Let T : C?→?C?be a demicontractive map satisfying?〈Tx, x〉?≥?‖x‖2 for all?x?∈ D (T). Then the Mann iterative sequence given by?xn + 1?= (1 - an) xn +?anT xn, where an ∈?(0, 1) n?≥?0, converges strongly to an element of F (T):= {x?∈ C : Tx = x}. This strong convergence is obtained without the compactness-type assumptions on C, which many previous results (see e.g. [1]) employed.

Weighted Integral Means of Mixed Areas and Lengths Under Holomorphic Mappings

This note addresses monotonic growths and logarithmic convexities of the weighted （（1-t2）αdt2, -∞〈α〈∞, 0〈t〈1） integral means Aα,β（ f ,·） and Lα,β（ f ,·） of the mixed area （πr2）-βA（ f ,r） and the mixed length （2πr）-βL（ f ,r） （0≤β≤1 and 0〈r〈1） of f （rD） and？f （rD） under a holomorphic map f from the unit disk D into the finite complex plane C.

Modified Subgradient Extragradient Method for Pseudomonotone Variational Inequalities

Many approaches have been put forward to resolve the variational inequality problem. The subgradient extragradient method is one of the most effective. This paper proposes a modified subgradient extragradient method about classical variational inequality in a real Hilbert interspace. By analyzing the operator’s partial message, the proposed method designs a non-monotonic step length strategy which requires no line search and is independent of the value of Lipschitz constant, and is extended to solve the problem of pseudomonotone variational inequality. Meanwhile, the method requires merely one map value and a projective transformation to the practicable set at every iteration. In addition, without knowing the Lipschitz constant for interrelated mapping, weak convergence is given and R-linear convergence rate is established concerning algorithm. Several numerical results further illustrate that the method is superior to other algorithms.

5G Oriented Exponential Effective Signal to Interference plus Noise Ratio Mapping Algorithm Based on Channel Classification

In the future the fifth generation( 5 G) communication systems,channel models may be very complicated and it is difficult to calculate equivalent signal to interference plus noise ratio( SINR)of a random fading channel. Therefore,methods for the calculation of equivalent SINR of a random fading channel are very necessary.In this paper,an enhanced algorithm on the exponential effective SINR mapping( EESM) model for random fading channels was proposed. First, the optimal adjustment parameters of typical channel fading models including extended pedestrian A( EPA)model,extended vehicular A( EVA) model and extended typical urban( ETU) model were obtained by simulation. Then the proposed solution was used to actualize channel classification according to the maximum multipath delay and the average power of the random channel. The solution can determine the typical channel closest to random channel for obtaining the optimal adjustment value of EESM. The evaluation results indicate that the proposed one can improve the whole system throughput significantly and meanwhile the accuracy of the link prediction algorithm is also guaranteed.

Mapping of QTL for Fiber Length Using Interspecific Gossypium hirsutum × G.barbadense F_2 Population

Cotton occupies a pre-eminent place among cash crops as it guides the destiny of a large section of the farming community as well as that of a flourishing textile industry.As the yarn manufacturing industry has undergone a technological revolution,more emphasis is given to quality of the raw

Algorithm for solving a class of general mixed variational inequalities and nonexpansive mappings in Hilbert spaces

This paper is devoted to study the convergence of a new class of generalized system for variational inequalities.The results presented in this paper modify and improve the recent result announced by Chang.[S.S.Chang,H.W.Joseph Lee,Generalzed system for relaxed cocoercive variational inequalities in Hilerbert space,doi:10.1016/j.aml.2006.04.017].

G-Contractive Sequential Composite Mapping Theorem in Banach or Probabilistic Banach Space and Application to Prey-Predator System and A &H Stock Prices

Theorems of iteration g-contractive sequential composite mapping and periodic mapping in Banach or probabilistic Bannach space are proved, which allow some contraction ratios of the sequence of mapping might be larger than or equal to 1, and are more general than the Banach contraction mapping theorem. Application to the proof of existence of solutions of cycling coupled nonlinear differential equations arising from prey-predator system and A&H stock prices are given.