http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
( Feng Yun Gong ),( Ding Yu Zhang ),( Jiang Guo Zhang ),( Li Li Wang ),( Wei Li Zhan ),( Jun Ying Qi ),( Jian Xin Song ) 생화학분자생물학회(구 한국생화학분자생물학회) 2014 BMB Reports Vol.47 No.4
To gain insights into the effect of MexB gene under the short interfering RNA (siRNA), we synthesized 21 bp siRNA duplexes against the MexB gene. RT-PCR was performed to determine whether the siRNA inhibited the expression of MexB mRNA. Changes in antibiotic susceptibility in response to siRNA were measured by the E-test method. The efficacy of siRNAs was determined in a murine model of chronic P. aeruginosa lung infection. MexB-siRNAs inhibited both mRNA expression and the activity of P. aeruginosa in vitro. In vivo, siRNA was effective in reducing the bacterial load in the model of chronic lung infection and the P. aeruginosa-induced pathological changes. MexB-siRNA treatment enhanced the production of inflammatory cytokines in the early infection stage (P < 0.05). Our results suggest that targeting of MexB with siRNA appears to be a novel strategy for treating P. aeruginosa infections. [BMB Reports 2014; 47(4): 203-208]
Apply Partition Tree to Compute Canonical Labelings of Graphs
HAO Jian-Qiang,GONG Yun-Zhan,Tan Li,Duan Da-Gao 보안공학연구지원센터 2016 International Journal of Grid and Distributed Comp Vol.9 No.5
This paper establishes a theoretical framework by defining a set of concepts useful for classifying graphs and computing the canonical labeling Cmax(G) of a given undirected graph G, which including the partition tree PartT(G), maximum partition tree MaxPT(G), centre subgraph Cen(G), standard regular sequence SRQ(G), standard maximum regular sequence SMRQ(G), and so on. The implementations of algorithms 1 to 5 show how to calculate them accordingly. The worst time complexities of algorithms 1, 2, 4, and 5 are O(n2) respectively. The time complexity of Algorithm 3 is O(n). By Theorem 3, all leaf nodes of PartT(G) and MaxPT(G) are the regular subgraphs. By Theorem 4 and 5, there exists only one Cen(G) in G. Regular Partition Theorem 6 shows that there exists just one corresponding PartT(G), SRQ(G), MaxPT(G), and SMRQ(G). One can use Classification Theorem 7 to category graphs. Theorem 8 and 9 establish the link between the Cen(G) and the calculation of the first node u1 added into MaxQ(G) corresponding to the canonical labeling Cmax(G) of G. Further, it utilizes the Cen(G) to calculate the first node u1 added into MaxQ(G). The proposed methods can be extended to deal with the directed graphs and weighted graphs.
Using the Eigenvalue Partition to Compute the Automorphism Group
HAO Jian-Qiang,GONG Yun-Zhan,LIU Hong-Zhi 보안공학연구지원센터 2016 International Journal of Hybrid Information Techno Vol.9 No.6
To solve the automorphism group of a graph is a fundamental problem in graph theory. Moreover, it usually is an essential process for graph isomorphism testing. At present, because existing algorithms ordinarily cannot efficiently compute the automorphism group of a graph, ones cannot entirely resolve the graph isomorphism problem. To calculate the automorphism group of a weighted graph, first, briefly review the history of automorphism. Second, introduce the concept of eigenvalue partition. Third, using algebraic methods, examine not only the relationships between the diagonal form of an adjacency matrix and its eigenvalues and eigenvectors, but also the relationships between its eigenvalues and eigenvectors and the automorphism group. Furthermore, prove Theorem 2 to 8. In addition, propose Conjecture 1 and three open problems. By these theorems, present a novel method to resolve the automorphism group of a weighted graph. If a graph has no duplicate eigenvalues and Conjecture 1 is true, it can determine the automorphism group of a weighted graph in polynomial time by the method. Although this method has certain limitations and needs improvements, it is theoretically a necessary complement to solve the automorphism group. Finally, it shows the close relationships that exist between an orthogonal matrix and a permutation matrix, also an orthogonal matrix and an automorphism.