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 subject of counting positive lattice points in n-dimensional simplexes has interested mathematicians for decades due to its applications in singularity theory and number the- ory. Enumerating the lattice points in a right-angled simplex is equivalent to determining the geometric genus of a singularity of a weighted homogeneous complex polynomial. It is also a method to shed insight into large gaps in the sequence of prime numbers. Seeking to contribute to these applications, this research project proves the Yau Geometric Con- jecture in six dimensions, a sharp upper bound for the number of positive lattice points in a six-dimensional tetrahedron. The main method of proof is summing existing sharp upper bounds for the number of points in 5-dimensional simplexes over the cross sections of the six- dimensional simplex. This research project paves the way for the proof of a fully general sharp upper bound for the number of lattice points in a simplex. It also moves the mathematical community one step closer towards proving the Yau Geometric and Yau Number-Theoretic Conjectures in full generality.

▲With the rapid development of bicycle-sharing system since 2016, illegal parking has become one of the most significant social issues. While the existing management methods cannot meet the demand, object detection technology provides a possibility. The Video Surveillance System can be utilized as a rich source of information. However, there is technical challenge to handle complex scenarios. Faster R-CNN, chosen because of its excellent overall performance, cannot specify the proposals of shared bikes especially in distant view. Processing the consecutive images in videos is neither necessary nor efficient. The original results are limited by interference of moving bikes and blocking effects. ▲ In this paper, I introduce a Faster R-CNN over Attention (FoA) that combines the from-coarse-to-fine visual mechanism with deep neural networks. FoA realizes fine-grained detection of shared bikes in complex circumstances. It consists of an Attention Region Extraction (ARE) and an optimized Faster R-CNN. In ARE, I introduce the concept of Attention Region and define it as video background, then apply Gaussian Mixture Model. ARE processes the surveillance video into discrete regions, allowing concentration on certain areas and efficiency in detection. In Faster R-CNN, I put forward an anchor box optimization in regards of the remarkable region-based characteristic in R-CNN. The optimization applies k-means to refine the anchor boxes and generate more appropriate region proposals. ▲ I construct a categorized shared bike data set of 4,291 images and 12,697 labeled objects for FoA training and testing. FoA performs excellently with the detection and recognition ratios of 94.19% and 92.73% respectively. The optimization is proved to make a difference. ▲ The paper not only provides a new direction for solving illegal parking issue and managing bicycle-sharing system, but also generalizes FoA into a new detection framework of Attention Region Extraction plus Region-Based Convolutional Neural Network, which can be applied to certain object detection in various scenes. The mechanism that combines ARE and R-CNN organically allows the towards-real-time detection to possess both practicality and universality. FoA is one of its robust implements.

No abstract uploaded!