New Perturbed Proximal Point Algorithms for Set-valued Quasi Variational Inclusions

In this paper, by using some new and innovative techniques, some perturbed iterative algorithms for solving generalized set-valued variational inclusions are suggested and analyzed. Since the generalized set-valued variational inclusions include many variational inclusions , variational inequalities and set-valued operator equation studied by others in recent years, the results obtained in this paper continue to hold for them and represent a significant refinement and improvement of the previously known results in this area

On Euclidean, Hermitian and symplectic quasi-cyclic complementary dual codes

Linear complementary dual codes (LCD) intersect trivially with their dual. In this paper, we develop a new characterization for LCD codes, which allows us to judge the complementary duality of linear codes from the codeword level. Further, we determine the sufficient and necessary conditions for one-generator quasi-cyclic codes to be LCD codes involving Euclidean, Hermitian, and symplectic inner products. Finally, we constructed many Euclidean, Hermitian and symmetric LCD codes with excellent parameters, some improving the results in the literature. Remarkably, we construct a symplectic LCD $[28,6]_2$ code with symplectic distance $10$, which corresponds to an trace Hermitian additive complementary dual $(14,3,10)_4$ code that outperforms the optimal quaternary Hermitian LCD $[14,3,9]_4$ code

Biosynthesis and metabolic engineering of isoflavonoids in model plants and crops: a review

Isoflavonoids, the major secondary metabolites within the flavonoid biosynthetic pathway, play important roles in plant defense and exhibit free radical scavenging properties in mammals. Recent advancements in understanding the synthesis, transport, and regulation of isoflavonoids have identified their biosynthetic pathways as promising targets for metabolic engineering, offering potential benefits such as enhanced plant resistance, improved biomass, and restoration of soil fertility. This review provides an overview of recent breakthroughs in isoflavonoid biosynthesis, encompassing key enzymes in the biosynthetic pathway, transporters influencing their subcellular localization, molecular mechanisms regulating the metabolic pathway (including transcriptional and post-transcriptional regulation, as well as epigenetic modifications). Metabolic engineering strategies aimed at boosting isoflavonoid content in both leguminous and non-leguminous plants. Additionally, we discuss emerging technologies and resources for precise isoflavonoid regulation. This comprehensive review primarily focuses on model plants and crops, offering insights for more effective and sustainable metabolic engineering approaches to enhance nutritional quality and stress tolerance

Improved Extreme Learning Machine and Its Application in Image Quality Assessment

Extreme learning machine (ELM) is a new class of single-hidden layer feedforward neural network (SLFN), which is simple in theory and fast in implementation. Zong et al. propose a weighted extreme learning machine for learning data with imbalanced class distribution, which maintains the advantages from original ELM. However, the current reported ELM and its improved version are only based on the empirical risk minimization principle, which may suffer from overfitting. To solve the overfitting troubles, in this paper, we incorporate the structural risk minimization principle into the (weighted) ELM, and propose a modified (weighted) extreme learning machine (M-ELM and M-WELM). Experimental results show that our proposed M-WELM outperforms the current reported extreme learning machine algorithm in image quality assessment

Symplectic self-orthogonal quasi-cyclic codes

In this paper, we obtain sufficient and necessary conditions for quasi-cyclic codes with index even to be symplectic self-orthogonal. Then, we propose a method for constructing symplectic self-orthogonal quasi-cyclic codes, which allows arbitrary polynomials that coprime $x^{n}-1$ to construct symplectic self-orthogonal codes. Moreover, by decomposing the space of quasi-cyclic codes, we provide lower and upper bounds on the minimum symplectic distances of a class of 1-generator quasi-cyclic codes and their symplectic dual codes. Finally, we construct many binary symplectic self-orthogonal codes with excellent parameters, corresponding to 117 record-breaking quantum codes, improving Grassl's table (Bounds on the Minimum Distance of Quantum Codes. http://www.codetables.de)