Improved Bat Algorithm for Reliability-Redundancy Allocation Problems

Yubao Liu 보안공학연구지원센터 2016 International Journal of Security and Its Applicat Vol.10 No.2

The bat algorithm is a recently proposed meta-heuristic algorithm. Usually in solving the problem of optimization, the position of virtual bats is updated by flying speed, which decreases efficiency of the algorithm and accuracy of the solution. This paper has improved the location update strategy and individual selection strategy of bat algorithm, then puts forward an improved bat algorithm. The algorithm is used to solve three typical reliability-redundancy allocation problems, and the simulation experiment results show that the presented algorithm greatly enhances the computation efficiency, convergence speed and precision of the optimal solution in addressing the problem of reliability redundancy optimization. When compared with the best results reported in the previous literatures, the algorithm achieves a better or equally good optimal solution. It is demonstrated that the proposed algorithm is effective in solving reliability-redundancy allocation problems.

Reliability Redundancy Optimization Algorithm based on Eagle Strategy and PSO

Yubao Liu,Guihe Qin 보안공학연구지원센터 2014 International Journal of Multimedia and Ubiquitous Vol.9 No.12

A new algorithm combined Eagle Strategy with PSO is proposed. The new algorithm performs by two phases: First Eagle Strategy is used to do global search; Second PSO algorithm is used to do fast local search around a promising solution. The balance of global search and local search is considered simultaneously. It is not only help to jump out of local optimum but also accelerate local convergence. Experimental results on three benchmark problems illustrate that the presented approach is effective, efficient and accurate for solving reliability redundancy optimization problems.

Rapid and Sensitive Detection of Lettuce Necrotic Yellows Virus and Cucumber Mosaic Virus Infecting Lettuce (Lactuca sativa L.) by Reverse Transcription Loop-Mediated Isothermal Amplification

Yubao Zhang,Zhongkui Xie,John D Fletcher,Yajun Wang,Ruoyu Wang,Zhihong Guo,Yuhui He 한국식물병리학회 2020 Plant Pathology Journal Vol.36 No.1

Cucumber mosaic virus (CMV) is damaging to the growth and quality of lettuce crops in Lanzhou, China. Recently, however, for the first time an isolate of lettuce necrotic yellows virus (LNYV) has been detected in lettuce crops in China, and there is concern that this virus may also pose a threat to lettuce production in China. Consequently, there is a need to develop a rapid and efficient detection method to accurately identify LNYV and CMV infections and help limit their spread. Reverse transcription loop-mediated isothermal amplification (RT-LAMP) assays were developed to detect the nucleoprotein (N) and coat protein (CP) genes of LNYV and CMV, respectively. RT-LAMP amplification products were visually assessed in reaction tubes separately using green fluorescence and gel electrophoresis. The assays successfully detected both viruses in infected plants without cross reactivity recorded from either CMV or LNYV or four other related plant viruses. Optimum LAMP reactions were conducted in betaine-free media with 6 mM Mg2+ at 65°C for LNYV and 60°C for 60 min for CMV, respectively. The detection limit was 3.5 pg/ml and 20 fg/ml using RT-LAMP for LNYV and CMV plasmids, respectively. Detection sensitivity for both RT-LAMP assays was greater by a factor of 100 compared to the conventional reverse transcription polymerase chain reaction assays. This rapid, specific, and sensitive technique should be more widely applied due to its low cost and minimal equipment requirements.

PANCYCLIC ARCS IN HAMILTONIAN CYCLES OF HYPERTOURNAMENTS

Yubao Guo,Michel Surmacs 대한수학회 2014 대한수학회지 Vol.51 No.6

A k-hypertournament H on n vertices, where 2 ≤ k ≤ n, is a pair H = (V,A), where V is the vertex set of H and A is a set of k-tuples of vertices, called arcs, such that for all subsets S ⊆ V with |S| = k, A contains exactly one permutation of S as an arc. Recently, Li et al. showed that any strong k-hypertournament H on n vertices, where 3 ≤ k ≤ n − 2, is vertex-pancyclic, an extension of Moon’s theorem for tournaments. In this paper, we prove the following generalization of another of Moon’s theorems: If H is a strong k-hypertournament on n vertices, where 3 ≤ k ≤ n−2, and C is a Hamiltonian cycle in H, then C contains at least three pancyclic arcs.

A DE Algorithm Combined with Lévy Flight for Reliability Redundancy Allocation Problems

Yubao Liu,Guihe Qin 보안공학연구지원센터 2015 International Journal of Hybrid Information Techno Vol.8 No.5

In this paper, a differential evolution (DE) algorithm combined with Lévy flight is proposed to solve the reliability redundancy allocation problems. The Lévy flight is incorporated to enhance the ability of global search of differential evolution algorithm. DE is used for local search mainly. The method considers the trade-off of the diversification and the intensification simultaneously. Experimental results for three benchmark problems demonstrate that the proposed algorithm is more effective for solving the reliability redundancy allocation problems.

Rapid Detection of Lily mottle virus and Arabis mosaic virus Infecting Lily (Lilium spp.) Using Reverse Transcription Loop-Mediated Isothermal Amplification

Yubao Zhang,Yajun Wang,Zhongkui Xie,Ruoyu Wang,Zhihong Guo,Yuhui He 한국식물병리학회 2020 Plant Pathology Journal Vol.36 No.2

The Lily mottle virus (LMoV) impedes the growth and quality of lily crops in Lanzhou, China. Recently Arabis mosaic virus (ArMV) has been detected in LMoV- infected plants in this region, causing plant stunting as well as severe foliar symptoms, and likely posing a threat to lily production. Consequently, there is a need to develop simple, sensitive, and reliable detection methods for these two viruses to prevent them from spreading. Reverse transcription (RT) loop-mediated isothermal amplification (LAMP) assays have been de- veloped to detect LMoV and ArMV using two primer pairs that match six conserved sequences of LMoV and ArMV coat proteins, respectively. RT-LAMP assay results were visually assessed in reaction tubes using green fluorescence and gel electrophoresis. Our assays successfully detected both LMoV and ArMV in lily plants without the occurrence of viral cross-reactivity from other lily viruses. Optimal conditions for LAMP reactions were 65°C and 60°C for 60 min for LMoV and ArMV, respectively. Detection sensitivity for both RT-LAMP assays was a hundredfold greater than that of our comparative RT-polymerase chain reaction as- says. We have also found this relatively rapid, target specific and sensitive method can also be used for samples collected in the field and may be especially useful in regions with limited or no laboratory facilities.

PANCYCLIC ARCS IN HAMILTONIAN CYCLES OF HYPERTOURNAMENTS

Guo, Yubao,Surmacs, Michel Korean Mathematical Society 2014 대한수학회지 Vol.51 No.6

A k-hypertournament H on n vertices, where $2{\leq}k{\leq}n$, is a pair H = (V,A), where V is the vertex set of H and A is a set of k-tuples of vertices, called arcs, such that for all subsets $S{\subseteq}V$ with |S| = k, A contains exactly one permutation of S as an arc. Recently, Li et al. showed that any strong k-hypertournament H on n vertices, where $3{\leq}k{\leq}n-2$, is vertex-pancyclic, an extension of Moon's theorem for tournaments. In this paper, we prove the following generalization of another of Moon's theorems: If H is a strong k-hypertournament on n vertices, where $3{\leq}k{\leq}n-2$, and C is a Hamiltonian cycle in H, then C contains at least three pancyclic arcs.

Tripartite Motif Containing 3 inhibits the aggressive behaviors of papillary thyroid carcinoma and indicates lower recurrence risk

Song Yubao,Gao Zefeng,Yan Zhifeng,Zheng Caihong 한국유전학회 2022 Genes & Genomics Vol.44 No.4

Background: Tripartite Motif Containing 3 (TRIM3) has been reported to be downregulated in several malignancies. However, its prognostic significance in thyroid cancer remains unknown. Objective: Here we aimed to investigate TRIM3's expression and its involvement in papillary thyroid carcinoma (PTC). Methods: Clinicopathological analyses were performed in patients with PTC. Expression of TRIM3 protein was evaluated by IHC. The prognostic role of TRIM3 in PTC patients was assessed by univariate and multivariate analyses. Cell proliferation and invasion were tested in two PTC cell lines following overexpression or knockdown. Results: TRIM3 was decreased in PTC tissues compared to adjacent thyroid tissues on both mRNA and protein levels. Additionally, low expression of TRIM3 was significantly related to tumor size, lymph node metastasis and TNM stage. Moreover, TRIM3 was identified as an independent prognosis factor by multivariate analysis. Cellular data revealed that TRIM3 can inhibit the proliferation and invasion of PTC cells. Consistently, TRIM3 can upregulate the expression level of E-cadherin, while downregulate N-cadherin, Vimentin, and cyclin D1 expression. Conclusions: TRIM3 expression was downregulated in PTC tissues comparing with that in adjacent nontumorous thyroid tissues. Lower TRIM3 expression in PTC can contribute independently to a poorer prognosis by enhancing PTC proliferation and invasion, highlighting its potential as a novel therapeutic target and prognostic biomarker.

Locally semicomplete digraphs with a factor composed of $k$cycles

Ronald J. Gould,Yubao Guo 대한수학회 2004 대한수학회지 Vol.41 No.5

A digraph is locally semicomplete if for every vertex x, the set of in-neighbors as well as the set of out-neighbors of x induce semicomplete digraphs. Let D be a k-connected locally semicomplete digraph with k ≥ 3 and g denote the length of a longest induced cycle of D. It is shown that if D has at least 7(k − 1)g vertices, then D has a factor composed of k cycles; furthermore, if D is semicomplete and with at least 5k + 1 vertices, then D has a factor composed of k cycles and one of the cycles is of length at most 5. Our results generalize those of [3] for tournaments to locally semicomplete digraphs.

v-PATHS OF ARCS IN REGULAR MULTIPARTITE TOURNAMENTS

Yao, Tianxing,Guo, Yubao,Zhang, Kemin Korean Mathematical Society 1999 대한수학회보 Vol.36 No.2

A v-path of an arc xy in a multipartite tournament T is an oriented oath in T-y which starts at x such that y does not dominate and end vertex of the path. We show that if T is a regular n-partite (n$\geq$7) tournament, then every arc of T has a v-path of length m for all m satisfying 2$\leq$m$\leq$n-2. Our result extends the corresponding result for regular tournaments, due to Alspach, Reid and Roselle [2] in 1974, to regular multipartite tournaments.