The effects of the calorimetric buffer solutions were investigated while the two colorimetric reactions of AI-ferron complex and Fe-ferron complex occurred individually, and the effects of the testing wavelength and t...The effects of the calorimetric buffer solutions were investigated while the two colorimetric reactions of AI-ferron complex and Fe-ferron complex occurred individually, and the effects of the testing wavelength and the pH of the solutions were also investigated. A timed complexatian colorimetric analysis method of Al-Fe-ferron in view of the total concentration of {AI + Fe} was then established to determine the species distribution of polymeric Al-Fe. The testing wavelength was recommended at 362 net and the testing pH value was 5. With a comparison of the ratios of n(Al)/n(Fe), the standard adsorption curves of the polymeric Al-Fe solutions were derived from the experimental results. Furthermore, the solutions' composition were carious in both the molar n(Al)/n(Fe) ratios, i.e. 0/0, 5/5, 9/1 and 0/10, and the concentrations associated with the total ( Al + Fe which ranged from 10(-5) to 10(-4) mol/L..展开更多
Al Ferron timed complex colorimetric method (AFM) and 27 Al NMR spectroscopy method(ANM) were discussed. For the former, the different colorimetric reagent preparation methods' results indicate that the...Al Ferron timed complex colorimetric method (AFM) and 27 Al NMR spectroscopy method(ANM) were discussed. For the former, the different colorimetric reagent preparation methods' results indicate that there are some differences beteween them, and the combined method can be used as a simplified procedure. For the latter, the small tube method is more accurate. Eventually, the Al 13 (ANM) was compared to the Al b (AFM).展开更多
The choice of self-concordant functions is the key to efficient algorithms for linear and quadratic convex optimizations, which provide a method with polynomial-time iterations to solve linear and quadratic convex opt...The choice of self-concordant functions is the key to efficient algorithms for linear and quadratic convex optimizations, which provide a method with polynomial-time iterations to solve linear and quadratic convex optimization problems. The parameters of a self-concordant barrier function can be used to compute the complexity bound of the proposed algorithm. In this paper, it is proved that the finite barrier function is a local self-concordant barrier function. By deriving the local values of parameters of this barrier function, the desired complexity bound of an interior-point algorithm based on this local self-concordant function for linear optimization problem is obtained. The bound matches the best known bound for small-update methods.展开更多
Through introducing the concept of complex current and resetting cross-coupling term, this paper proposes a novel complex permanent magnet synchronous motor system and analyzes its properties. Based on a complex perma...Through introducing the concept of complex current and resetting cross-coupling term, this paper proposes a novel complex permanent magnet synchronous motor system and analyzes its properties. Based on a complex permanent magnet synchronous motor system, we design controllers and achieve lag synchronizations both in real part and imaginary part with backstepping method. In our study, we take complex current, time delay, and structure of complex system into consideration. Numerical simulation results demonstrate the validity of controllers.展开更多
Nowadays, increased information capacity and transmission processes make information security a difficult problem. As a result, most researchers employ encryption and decryption algorithms to enhance information secur...Nowadays, increased information capacity and transmission processes make information security a difficult problem. As a result, most researchers employ encryption and decryption algorithms to enhance information security domains. As it progresses, new encryption methods are being used for information security. In this paper, a hybrid encryption algorithm that combines the honey encryption algorithm and an advanced DNA encoding scheme in key generation is presented. Deoxyribonucleic Acid (DNA) achieves maximal protection and powerful security with high capacity and low modification rate, it is currently being investigated as a potential carrier for information security. Honey Encryption (HE) is an important encryption method for security systems and can strongly prevent brute force attacks. However, the traditional honeyword encryption has a message space limitation problem in the message distribution process. Therefore, we use an improved honey encryption algorithm in our proposed system. By combining the benefits of the DNA-based encoding algorithm with the improved Honey encryption algorithm, a new hybrid method is created in the proposed system. In this paper, five different lookup tables are created in the DNA encoding scheme in key generation. The improved Honey encryption algorithm based on the DNA encoding scheme in key generation is discussed in detail. The passwords are generated as the keys by using the DNA methods based on five different lookup tables, and the disease names are the input messages that are encoded by using the honey encryption process. This hybrid method can reduce the storage overhead problem in the DNA method by applying the five different lookup tables and can reduce time complexity in the existing honey encryption process.展开更多
基金TheNationalNaturalScienceFoundationofChina (No .2 96 770 0 4)
文摘The effects of the calorimetric buffer solutions were investigated while the two colorimetric reactions of AI-ferron complex and Fe-ferron complex occurred individually, and the effects of the testing wavelength and the pH of the solutions were also investigated. A timed complexatian colorimetric analysis method of Al-Fe-ferron in view of the total concentration of {AI + Fe} was then established to determine the species distribution of polymeric Al-Fe. The testing wavelength was recommended at 362 net and the testing pH value was 5. With a comparison of the ratios of n(Al)/n(Fe), the standard adsorption curves of the polymeric Al-Fe solutions were derived from the experimental results. Furthermore, the solutions' composition were carious in both the molar n(Al)/n(Fe) ratios, i.e. 0/0, 5/5, 9/1 and 0/10, and the concentrations associated with the total ( Al + Fe which ranged from 10(-5) to 10(-4) mol/L..
文摘Al Ferron timed complex colorimetric method (AFM) and 27 Al NMR spectroscopy method(ANM) were discussed. For the former, the different colorimetric reagent preparation methods' results indicate that there are some differences beteween them, and the combined method can be used as a simplified procedure. For the latter, the small tube method is more accurate. Eventually, the Al 13 (ANM) was compared to the Al b (AFM).
基金supported by the National Natural Science Foundation of China (Grant No.10771133)the Shanghai Leading Academic Discipline Project (Grant No.S30101)the Research Foundation for the Doctoral Program of Higher Education (Grant No.200802800010)
文摘The choice of self-concordant functions is the key to efficient algorithms for linear and quadratic convex optimizations, which provide a method with polynomial-time iterations to solve linear and quadratic convex optimization problems. The parameters of a self-concordant barrier function can be used to compute the complexity bound of the proposed algorithm. In this paper, it is proved that the finite barrier function is a local self-concordant barrier function. By deriving the local values of parameters of this barrier function, the desired complexity bound of an interior-point algorithm based on this local self-concordant function for linear optimization problem is obtained. The bound matches the best known bound for small-update methods.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 61173183, 60973152, and 60573172)the Superior University Doctor Subject Special Scientific Research Foundation of China (Grant No. 20070141014)+2 种基金the Program for Liaoning Excellent Talents in University (GrantNo. LR2012003)the National Natural Science Foundation of China (Grant No. 20082165)the Fundamental Research Funds for the Central Universities of China (Grant No. DUT12JB06)
文摘Through introducing the concept of complex current and resetting cross-coupling term, this paper proposes a novel complex permanent magnet synchronous motor system and analyzes its properties. Based on a complex permanent magnet synchronous motor system, we design controllers and achieve lag synchronizations both in real part and imaginary part with backstepping method. In our study, we take complex current, time delay, and structure of complex system into consideration. Numerical simulation results demonstrate the validity of controllers.
文摘Nowadays, increased information capacity and transmission processes make information security a difficult problem. As a result, most researchers employ encryption and decryption algorithms to enhance information security domains. As it progresses, new encryption methods are being used for information security. In this paper, a hybrid encryption algorithm that combines the honey encryption algorithm and an advanced DNA encoding scheme in key generation is presented. Deoxyribonucleic Acid (DNA) achieves maximal protection and powerful security with high capacity and low modification rate, it is currently being investigated as a potential carrier for information security. Honey Encryption (HE) is an important encryption method for security systems and can strongly prevent brute force attacks. However, the traditional honeyword encryption has a message space limitation problem in the message distribution process. Therefore, we use an improved honey encryption algorithm in our proposed system. By combining the benefits of the DNA-based encoding algorithm with the improved Honey encryption algorithm, a new hybrid method is created in the proposed system. In this paper, five different lookup tables are created in the DNA encoding scheme in key generation. The improved Honey encryption algorithm based on the DNA encoding scheme in key generation is discussed in detail. The passwords are generated as the keys by using the DNA methods based on five different lookup tables, and the disease names are the input messages that are encoded by using the honey encryption process. This hybrid method can reduce the storage overhead problem in the DNA method by applying the five different lookup tables and can reduce time complexity in the existing honey encryption process.
