http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
An Algorithm Solving SAT Problem Based on Splitting Rule and Extension Rule
Xu, Youjun Korea Information Processing Society 2017 Journal of information processing systems Vol.13 No.5
The satisfiability problem is always a core problem in artificial intelligence (AI). And how to improve the efficiency of algorithms solving the satisfiability problem is widely concerned. Algorithm IER (Improved Extension Rule) is based on extension rule. The number of atoms and the number of clauses affect the efficiency of the algorithm IER. DPLL rules are helpful to reduce these numbers. Then a complete algorithm CIER based on splitting rule and extension rule is proposed in this paper in order to improve the efficiency. At first, the algorithm CIER (Complete Improved Extension Rule) reduces the scale of a clause set with DPLL rules. Then, the clause set is split into a group of small clause sets. In the end, the satisfiability of the clause set is got from these small clause sets'. A strategy MOAMD (maximum occurrences and maximum difference) for the algorithm CIER is given. With this strategy, a better arrangement of atoms could be got. This arrangement could make the number of small clause sets fewer and the scale of these sets smaller. So, the algorithm CIER will be more efficient.
An Algorithm Solving SAT Problem Based on Splitting Rule and Extension Rule
Youjun Xu 한국정보처리학회 2017 Journal of information processing systems Vol.13 No.5
The satisfiability problem is always a core problem in artificial intelligence (AI). And how to improve theefficiency of algorithms solving the satisfiability problem is widely concerned. Algorithm IER (ImprovedExtension Rule) is based on extension rule. The number of atoms and the number of clauses affect theefficiency of the algorithm IER. DPLL rules are helpful to reduce these numbers. Then a complete algorithmCIER based on splitting rule and extension rule is proposed in this paper in order to improve the efficiency. At first, the algorithm CIER (Complete Improved Extension Rule) reduces the scale of a clause set with DPLLrules. Then, the clause set is split into a group of small clause sets. In the end, the satisfiability of the clause setis got from these small clause sets’. A strategy MOAMD (maximum occurrences and maximum difference)for the algorithm CIER is given. With this strategy, a better arrangement of atoms could be got. Thisarrangement could make the number of small clause sets fewer and the scale of these sets smaller. So, thealgorithm CIER will be more efficient.
Yan Cheng,Youjun Feng,Ping Luo,Jiang Gu,Shu Yu,Wei-jun Zhang,Yan-qing Liu,Qing-xu Wang,Quan-ming Zou,Xu-hu Mao 한국미생물학회 2009 The journal of microbiology Vol.47 No.4
Shiga toxin 2 (Stx2) is a major virulence factor for enterohemorrhagic Escherichia coli (EHEC), which is encoded by λ lysogenic phage integrated into EHEC chromosome. Stx2A1, A1 subunit of Stx2 toxin has gathered extensive concerns due to its potential of being developed into a vaccine candidate. However, the substantial progress is hampered in part for the lack of a suitable in vitro expression system. Here we report use of the prokaryotic system pET-28a::espA-Stx2A1/BL21 to carry out the fusion expression of Stx2A1 which is linked to E. coli secreted protein A (EspA) at its N-terminus. Under the IPTG induction, EspA- Stx2A1 fusion protein in the form of inclusion body was obtained successfully, whose expression level can reach about 40% of total bacterial protein at 25°C, much higher than that at 37°C. Western blot test suggested the refolded fusion protein is of excellent immuno-reactivity with both monoclonal antibodies, which are specific to EspA and Stx2A1, respectively. Anti-sera from Balb/c mice immunized with the EspA-Stx2A1 fusion protein were found to exhibit strong neutralization activity and protection capability in vitro and in vivo. These data have provided a novel feasible method to produce Stx2A1 in large scale in vitro, which is implicated for the development of multivalent subunit vaccines candidate against EHEC O157:H7 infections.