This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solve...This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.展开更多
In order to improve the attack efficiency of the New FORK-256 function, an algorithm based on Grover's quantum search algorithm and birthday attack is proposed. In this algorithm, finding a collision for arbitrary...In order to improve the attack efficiency of the New FORK-256 function, an algorithm based on Grover's quantum search algorithm and birthday attack is proposed. In this algorithm, finding a collision for arbitrary hash function only needs O(2m/3) expected evaluations, where m is the size of hash space value. It is proved that the algorithm can obviously improve the attack efficiency for only needing O(2 74.7) expected evaluations, and this is more efficient than any known classical algorithm, and the consumed space of the algorithm equals the evaluation.展开更多
Motion estimation is an important part of the MPEG- 4 encoder, due to its significant impact on the bit rate and the output quality of the encoder sequence. Unfortunately this feature takes a significant part of the e...Motion estimation is an important part of the MPEG- 4 encoder, due to its significant impact on the bit rate and the output quality of the encoder sequence. Unfortunately this feature takes a significant part of the encoding time especially when the straightforward full search(FS) algorithm is used. In this paper, a new algorithm named diamond block based gradient descent search (DBBGDS) algorithm, which is significantly faster than FS and gives similar quality of the output sequence, is proposed. At the same time, some other algorithms, such as three step search (TSS), improved three step search (ITSS), new three step search (NTSS), four step search (4SS), cellular search (CS) , diamond search (DS) and block based gradient descent search (BBGDS), are adopted and compared with DBBGDS. As the experimental results show, DBBGDS has its own advantages. Although DS has been adopted by the MPEG- 4 VM, its output sequence quality is worse than that of the proposed algorithm while its complexity is similar to the proposed one. Compared with BBGDS, the proposed algorithm can achieve a better output quality.展开更多
In this letter, an improved three-step search algorithm is presented, which uses both gray and chromatic information to boost the performance with random optimization and converge the motion vectors to global optima. ...In this letter, an improved three-step search algorithm is presented, which uses both gray and chromatic information to boost the performance with random optimization and converge the motion vectors to global optima. Experimental results show that this algorithm can efficiently improve the PSNR after motion compensation.展开更多
Pancreatic head carcinoma is characterized by high malignancy and a low survival rate and its mortality ranks fourth for malignant tumors with a 5-year survival rate of only 5%[1].Treatment of this cancer relies on su...Pancreatic head carcinoma is characterized by high malignancy and a low survival rate and its mortality ranks fourth for malignant tumors with a 5-year survival rate of only 5%[1].Treatment of this cancer relies on surgical resection.However,the resection rate is only about 20%,because majority of the patients are classified as unresectable when diagnosed due to distant metastasis or展开更多
In this paper, a three-dimensional quantitative structure-activity relationships(3 D-QSAR) study for 20 HIV-1 reverse transcriptase(RT) inhibitors was established using Topomer Co MFA. The models were built based on d...In this paper, a three-dimensional quantitative structure-activity relationships(3 D-QSAR) study for 20 HIV-1 reverse transcriptase(RT) inhibitors was established using Topomer Co MFA. The models were built based on different fragment cutting models, with the most effective model of the multiple correlation coefficients of fitting(r^2) to be 0.920, cross-validation(q^2) of 0.575, and external validation(Q_(ext)~2) being 0.701. The results indicated that the model obtained has both favorable estimation stability and good prediction capability. Topomer Search was used to search R-group from ZINC database. As a result, a series of R-groups with relatively high activity contribution was obtained. By No. 6 molecule filtering, 3 R_1 and 15 R_2 groups were selected, and employed to alternately substitute for the R_1 and R_2 of sample 6. Finally, 45 new compounds were designed, and the Topomer CoMFA model was used to predicate the biological activity, so the Topomer Search is effective in screening and can guide the design of new HIV/AIDS drugs. The molecular docking method was also used to study the interactions of these drugs by docking the ligands into HIV-1 RT active site, which revealed the likely bioactive conformations. This study showed that there are extensive interactions between the 1,3,4-thiazolidinone revertase inhibitors and His84, Asp145, Lys33 and Leu83 residues in the active site of HIV-1 RT. These results provide useful insights for the design of potent new inhibitors of RT.展开更多
Upon the latest reform to the college entrance examination in China(i.e.,Gaokao),high schools began implementing an optional class system.Under this scheme,students’time slots become complex,thereby increasing the di...Upon the latest reform to the college entrance examination in China(i.e.,Gaokao),high schools began implementing an optional class system.Under this scheme,students’time slots become complex,thereby increasing the difficulty in formulating a suitable timetable from the available ones.To address this problem,the coursescheduling model was improved.On the basis of the original hard constraints,the“concurrent group”was considered,and the softer constraints were regarded as optimization goals,such as“teaching plans synchronously”,“no idle periods in the timetables of teachers”,and“evenly distributed lessons”.Given these soft constraints,the model becomes more practical.In this study,a two-phase tabu search algorithm was proposed to solve the problem.The proposed algorithm uses the characteristics of the graph coloring model to eliminate redundant calculations in the neighborhood search process,thereby effectively improving computational efficiency.Fifteen practical instances of different scales were selected for testing to verify the effectiveness of the algorithm.The proposed algorithm can formulate high-quality available timetables(The average satisfaction rate of soft constraints is more than 71%)in a short period.展开更多
基金the National Science and Tech-nology Council,Taiwan for their financial support(Grant Number NSTC 111-2221-E-019-048).
文摘This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.
基金Supported by the National High Technology Research and Development Program(No.2011AA010803)the National Natural Science Foundation of China(No.U1204602)
文摘In order to improve the attack efficiency of the New FORK-256 function, an algorithm based on Grover's quantum search algorithm and birthday attack is proposed. In this algorithm, finding a collision for arbitrary hash function only needs O(2m/3) expected evaluations, where m is the size of hash space value. It is proved that the algorithm can obviously improve the attack efficiency for only needing O(2 74.7) expected evaluations, and this is more efficient than any known classical algorithm, and the consumed space of the algorithm equals the evaluation.
文摘Motion estimation is an important part of the MPEG- 4 encoder, due to its significant impact on the bit rate and the output quality of the encoder sequence. Unfortunately this feature takes a significant part of the encoding time especially when the straightforward full search(FS) algorithm is used. In this paper, a new algorithm named diamond block based gradient descent search (DBBGDS) algorithm, which is significantly faster than FS and gives similar quality of the output sequence, is proposed. At the same time, some other algorithms, such as three step search (TSS), improved three step search (ITSS), new three step search (NTSS), four step search (4SS), cellular search (CS) , diamond search (DS) and block based gradient descent search (BBGDS), are adopted and compared with DBBGDS. As the experimental results show, DBBGDS has its own advantages. Although DS has been adopted by the MPEG- 4 VM, its output sequence quality is worse than that of the proposed algorithm while its complexity is similar to the proposed one. Compared with BBGDS, the proposed algorithm can achieve a better output quality.
文摘In this letter, an improved three-step search algorithm is presented, which uses both gray and chromatic information to boost the performance with random optimization and converge the motion vectors to global optima. Experimental results show that this algorithm can efficiently improve the PSNR after motion compensation.
基金supported by a grant from Beijing Municipal Administration of Hospitals’Mission Plan(SML 20152201)
文摘Pancreatic head carcinoma is characterized by high malignancy and a low survival rate and its mortality ranks fourth for malignant tumors with a 5-year survival rate of only 5%[1].Treatment of this cancer relies on surgical resection.However,the resection rate is only about 20%,because majority of the patients are classified as unresectable when diagnosed due to distant metastasis or
基金supported by the National Natural Science Foundation of China(21475081,21275094)the Graduate Innovation Fund of Shaanxi University of Science and Technology
文摘In this paper, a three-dimensional quantitative structure-activity relationships(3 D-QSAR) study for 20 HIV-1 reverse transcriptase(RT) inhibitors was established using Topomer Co MFA. The models were built based on different fragment cutting models, with the most effective model of the multiple correlation coefficients of fitting(r^2) to be 0.920, cross-validation(q^2) of 0.575, and external validation(Q_(ext)~2) being 0.701. The results indicated that the model obtained has both favorable estimation stability and good prediction capability. Topomer Search was used to search R-group from ZINC database. As a result, a series of R-groups with relatively high activity contribution was obtained. By No. 6 molecule filtering, 3 R_1 and 15 R_2 groups were selected, and employed to alternately substitute for the R_1 and R_2 of sample 6. Finally, 45 new compounds were designed, and the Topomer CoMFA model was used to predicate the biological activity, so the Topomer Search is effective in screening and can guide the design of new HIV/AIDS drugs. The molecular docking method was also used to study the interactions of these drugs by docking the ligands into HIV-1 RT active site, which revealed the likely bioactive conformations. This study showed that there are extensive interactions between the 1,3,4-thiazolidinone revertase inhibitors and His84, Asp145, Lys33 and Leu83 residues in the active site of HIV-1 RT. These results provide useful insights for the design of potent new inhibitors of RT.
基金supported by the National Natural Science Foundation Program of China(Grant Nos.:72122006 and 71771099).
文摘Upon the latest reform to the college entrance examination in China(i.e.,Gaokao),high schools began implementing an optional class system.Under this scheme,students’time slots become complex,thereby increasing the difficulty in formulating a suitable timetable from the available ones.To address this problem,the coursescheduling model was improved.On the basis of the original hard constraints,the“concurrent group”was considered,and the softer constraints were regarded as optimization goals,such as“teaching plans synchronously”,“no idle periods in the timetables of teachers”,and“evenly distributed lessons”.Given these soft constraints,the model becomes more practical.In this study,a two-phase tabu search algorithm was proposed to solve the problem.The proposed algorithm uses the characteristics of the graph coloring model to eliminate redundant calculations in the neighborhood search process,thereby effectively improving computational efficiency.Fifteen practical instances of different scales were selected for testing to verify the effectiveness of the algorithm.The proposed algorithm can formulate high-quality available timetables(The average satisfaction rate of soft constraints is more than 71%)in a short period.
