In this paper, the differential equations for copolymerization of multiple monomers are derived based on the steady-status assumption of Alfrey-Goldfinger and Valvassori-Sartori respectively, and a numerical method is implemented in C++ language. The differential equations of copolymer composition with wide application presented in this paper provide a theoretical guidance for industrial production and academic research of multiple free radical copolymerization.

No abstract uploaded!

The linear congruence equations are the ancient and significant research contents. Most discussions of the linear congruence equations focus on the special cases, for example, there is a linear congruent theorem for solving the congruent linear equation in one unknown and the Chinese remainder theorem for solving the simultaneous congruent linear equations in one unknown, which are involved to find a special solution using the properties of the integer number, and some papers discuss the equation in unknowns. But all the results are not convenient and efficient to solve the equations and not adapt to solving the general system of congruent linear equations in n unknowns. There is no uniform, convenient and efficient technique and theory for the general system of congruent linear equations, like the theory of linear equations over real numbers. The inspiration arose from the elimination of variables when solving the linear equations over real numbers, Generalized the elementary transformations of matrix over real numbers to the integer numbers modulo m, the paper discussed the properties of the modular matrix under the elementary transformations and a similar equivalent transforming theorem for matrix modulom theorem was obtained that any matrix modulo m can be transformed into a canonical diagonal form by means of a finite number of elementary row and column operations. furthermore, by means of the equivalent transforming theorem, the solution criterion theorem and structure theorem were proposed for the general congruent linear equations based on the modular matrix transformations, which extended the theories of the congruent linear equations, and finally, the detailed steps of the uniform method were given for solving the general system of congruent linear equations based on the elementary transformations of matrix modulo m, it can be easily written out the solutions of the system immediately as determining solutions of the system conveniently by elementary matrix transformations. Analysis and discussions indicate that the results are most valuable in science and the proposed technique for solving the system is convenient, efficient and adaptable.

No abstract uploaded!

This work focuses on the problem of high quality style transfer for Chinese characters, converting Chinese printed with standard typograph into those in calligraphic style. Traditional approaches include employing derivative network structures of CNN, RNN, and GAN, yet generation results are not satisfactory enough. In this paper, we proposed an integrated system of pix2pix structure, auxiliary classifier, and WGAN. Trials were run to evaluate the performance of traditional CNN and GAN. Cross-comparative sets of experiments among GAN, AC-GAN, and our proposed AC-WGAN have been conducted to test the capabilities of our proposed model. Inference and interpolation tests are conducted as well. Our proposed model outperformed existing style transfer system in generation’s delicacy, similarity, and efficiency. Incorporated with WGAN, the model also demonstrated a strong ability in providing a truthful training indicator with its loss. Study also suggested that AC and pix2pix adaption hold huge significance in accelerating the training process. Research validates the viability of fulfilling Chinese character transformation with style transfer. With handwriting recognition network, fast, high-quality Chinese character style transfer forms the basis for instantaneous conversion between printed and written work. Optimization on algorithm may be another direction for further exploration.