Search

Functional marker (FM) is one of the most useful molecular markers in crop breeding, which facilitates the realization of high-throughput genotyping and marker-assisted selection (MAS). In this study, 22 KASP markers were developed according to the reported functional loci of important traits in soybean, including stem growth habit (Dt1), multi-seed pods (Ln), shattering pods (Pdh1), seed size (GmSSS1, GmST05), flowering time (J, GmPRR3a, GmPRR3b, GmFUL2a, GmLHY1a, GmLHY1b, GmSOC1a, E4), protein and oil content (GmSWEET39), carotene content (GmCCD4), phosphorus use efficiency (GmPHF1), nitrogen use efficiency (GmGLP20.4), symbiotic compatibility in nodulation (Rj2) and cytokinin biosynthesis (GmCXK7-1). All of the 21 markers could be used to accurately classify heterozygous and homozygous genotypes, except that the marker of e4-sore could not distinguish heterozygous samples. Combining with phenotypic information, the selection efficiency of multi-seed pod, leaf shape and stem growth habit markers was analyzed. The results showed that the selection efficiency of multi-seed pod (Ln) markers on phenotype was 84.0%, that on leaf shape was 94.8%, and that of stem growth habit (Dt1) markers on phenotype was 87.4%, showing a high level of selection accuracy. The 22 functional markers developed in this study can be used to accurately identify the genotypes and have important utilization value in marker assisted breeding of soybean. [ABSTRACT FROM AUTHOR]

This article explores a distributed optimal coordination control problem for multiple Euler–Lagrange systems with actuator faults. To address this problem, an event-triggered fault-tolerant optimisation algorithm is first proposed to eliminate unexpected faults and reduce the consumption of control resources. In order to further enhance the system's reliability, another algorithm based on the Nussbaum function is proposed to handle faulted systems with uncertain control directions. Note that an auxiliary system with adaptive gains is introduced to eliminate the need for agents to interact with their actual state information, and thus has the effect of protecting privacy. Moreover, the stochastic semi-Markov jumping networks are considered in the algorithms to describe the switching process of uncertain communication graphs. Additionally, the algorithms are fully distributed since it does not require global information of topologies. Finally, numerical simulations are conducted in the article to verify the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

This paper investigates the distributed optimization problem of networked Euler–Lagrange (EL) systems with actuator faults and unknown model parameters. In order to solve this issue, some event‐triggered fault‐tolerant (ETFT) optimal coordination algorithms with the mechanism of intermittent communication and intermittent controller update are designed for the first time to compensate for the impact of physical faults on the system, and reduce communication costs and control resource consumption. For practical applications, it is difficult for the system to have a secure environment if there exist malicious attacks blocking network channels among agents. Therefore, the resilient ETFT optimal coordination with intermittent communication subject to asynchronous denial‐of‐service (DoS) attacks is considered. Especially, auxiliary systems with adaptive gains are introduced in the algorithms due to the unavailability of the EL model parameters, which also enable virtual data exchange between agents and protect actual state information. Note that the algorithms are fully distributed as the global topology information is not required. Finally, the feasibility of the proposed algorithms is verified through numerical simulation of examples. [ABSTRACT FROM AUTHOR]

This article is concerned with the fixed‐time fault‐tolerant control problem of multiple Euler–Lagrange systems (MELSs) with intermittent communication, actuator faults and input disturbances. A nonsingular fixed‐time control framework with three parts is built for the above problem. In the first part, a novel adaptive controller is proposed for MELSs to ensure the fixed‐time stability of sliding modes while successfully solving the actuator faults, parameter uncertainties and unknown disturbances. In the second part, the fixed‐time estimators based on event‐triggered communication are designed by an error decomposition approach. In the third part, an auxiliary system is introduced for the singularity problem and sufficient condition for achieving the consensus is rigorously proved by synthesizing the results of the above two parts. The key feature of the proposed control framework is that the convergence time is constrained by a constant without involving initial states, and the singularity problems of fixed‐time control is avoided. Finally, simulation examples are provided to prove the efficacy of the proposed algorithms. [ABSTRACT FROM AUTHOR]

This article investigates the distributed Nash equilibrium seeking problem of quadratic time‐varying games with Euler–Lagrange (EL) players, where external disturbances and parametric uncertainties are involved. A gradient‐based hierarchical algorithm consisting of a game layer and a control layer is proposed. Specifically, in the game layer, EL players communicate with neighbors through a graph to reach the consensus on potential aggregate values, which will be employed to calculate the gradient of each player's objective function, and then, a gradient‐based sliding mode controller is developed to track time‐varying gradient in the control layer. Thus, the convergence results are hierarchically obtained through the Lyapunov stability method. In addition, the hierarchical control strategy is extended to address the constrained problems through the utilization of a smooth penalty function. By appropriately choosing control parameters, the Nash equilibrium seeking errors can be arbitrarily small. The relation between the optimal solutions of the original problem and the dual one is further discussed. Finally, the proposed methods are numerically verified. [ABSTRACT FROM AUTHOR]

The finite‐time nonlinear placement problem of networked Euler‐Lagrange systems (NELSs) is discussed in this paper. The problem is reformulated into a finite‐time aggregate game under an undirected graph. Then, several novel practical gradient‐based finite‐time hierarchical (GFTH) algorithms composed of a game layer, a Nash equilibrium (NE) seeking layer, and a control layer are proposed. Specifically, the game layer employs an aggregate function to reach a consensus on the potential aggregate value which is adopted by a gradient‐based finite‐time method to tackle the finite‐time NE seeking problem in the NE seeking layer, and then, the tracking problem is realized in the control layer. The convergence results are established by a nonsmooth Lyapunov function. In addition, the versatility of the GFTH algorithms is shown by extending to address the task‐space control problem of NELSs. The effectiveness of the proposed algorithms is illustrated via simulations. [ABSTRACT FROM AUTHOR]

In this paper, the collaborative control of multiple nonlinear Euler-Lagrange systems with actuator faults and stochastic semi-Markov jump networks (SMJNs) is concerned. In order to fulfil high reliability and low consumption, several novel event-triggered fault-tolerant control (ETFTC) algorithms are established to simultaneously eliminate the undesirable faults and save control resources, where only quantised partial-state signal of neighbours is required for the control process. Moreover, some ubiquitous constraints, such as unknown control directions and time-varying communication delays, are also comprehensively considered and effectively excluded so as to further enhance the control reliability. Meanwhile, some sufficient criteria on the algorithm synthesis and stability analysis without involving Zeno behaviour are successfully built with the aid of Lyapunov–Krasovskii functional. Finally, some illustrative simulations are performed to validate the feasibility and effectiveness of the derived ETFTC algorithms. [ABSTRACT FROM AUTHOR]

Objective: To study the related risk factors for surgical site infection following Pilon fracture surgery. METH ODS: The data of 561 patients with Pilon fractures treated with open reduction plate osteosynthesis at our institution's trauma centre were collected from January 2006 to December 2012. All the patients were divided into two groups: infection group and non-infection group. In the infection group, there were 23 males and 10 females, ranging in age from 21 to 69 years old, with an average of (45.50±4.40) years old. In the non-infection group, there were 296 males and 232 females, ranging in age from 16 to 76 years old, with an average of (43.50±7.19) years old. The possible risk factors such as age, gender, smoking, diabetes, alcohol abuse, open fractures, compartment syndrome and operative time were studied. The multivariate Logistic regression model was used to analyze the risk, factors., Results: The infection rate of surgical site after Pilon fracture surgery was 5.88%. There were significant statistical differences between infection group and non-infection group in operative time, open fractures and compartment syndrome. However, multivariate Logistic regression analysis revealed that only operative time was significantly associated with surgical site infection (P=0.005, OR=44.92)., Conclusion: Operation time is an independent predictor for post-operative surgical site infection of Pilon fracture treated with open reduction plate osteosynthesis. Though open fracture and compartment syndrome could increase the surgical site infection rate, they could not not be considered as independent predictors.