Design and implementation of student management system of integrated programmable device programming system

With the continuous growth and development of society, the reform of higher education is gradually taking shape, and colleges and universities are taking more and more responsibilities in promoting education. The main element of university management is the student management system, which is very important to the development of the university. Under the objective environment of colleges and universities seeking to expand the scale of running schools and rapid economic and social development, the current student management system has been unable to meet the various needs of contemporary students. The integration of programmable device programming systems offers a student management system distinct advantages in terms of reliability, flexibility, and user-friendly operation. This study focuses on developing an effective and affordable student management system by incorporating a programmable device programming system. To evaluate the system's performance, this paper suggests the utilization of a BP neural network, renowned for its high nonlinear approximation capabilities and effectiveness in handling complex nonlinear functional relationships. The experimental findings highlight a significant contribution, demonstrating that the system achieved a throughput of 180 times per second, with a maximum CPU utilization of 99%. Notably, the system's stability exceeded 95%, contrasting sharply with the traditional student management system's stability at a mere 65%. These results underscore the substantial contribution of the proposed system, showcasing its enhanced stability compared to conventional student management systems.

An adaptive multitasking optimization algorithm based on population distribution

Evolutionary multitasking optimization (EMTO) handles multiple tasks simultaneously by transferring and sharing valuable knowledge from other relevant tasks. How to effectively identify transferred knowledge and reduce negative knowledge transfer are two key issues in EMTO. Many existing EMTO algorithms treat the elite solutions in tasks as transferred knowledge between tasks. However, these algorithms may not be effective enough when the global optimums of the tasks are far apart. In this paper, we study an adaptive evolutionary multitasking optimization algorithm based on population distribution information to find valuable transferred knowledge and weaken the negative transfer between tasks. In this paper, we first divide each task population into K sub-populations based on the fitness values of the individuals, and then the maximum mean discrepancy (MMD) is utilized to calculate the distribution difference between each sub-population in the source task and the sub-population where the best solution of the target task is located. Among the sub-populations of the source task, the sub-population with the smallest MMD value is selected, and the individuals in it are used as transferred individuals. In this way, the solution chosen for the transfer may be an elite solution or some other solution. In addition, an improved randomized interaction probability is also included in the proposed algorithm to adjust the intensity of inter-task interactions. The experimental results on two multitasking test suites demonstrate that the proposed algorithm achieves high solution accuracy and fast convergence for most problems, especially for problems with low relevance.

Domain Adaptation Multitask Optimization

Multitask optimization (MTO) is a new optimization paradigm that leverages useful information contained in multiple tasks to help solve each other. It attracts increasing attention in recent years and gains significant performance improvements. However, the solutions of distinct tasks usually obey different distributions. To avoid that individuals after intertask learning are not suitable for the original task due to the distribution differences and even impede overall solution efficiency, we propose a novel multitask evolutionary framework that enables knowledge aggregation and online learning among distinct tasks to solve MTO problems. Our proposal designs a domain adaptation-based mapping strategy to reduce the difference across solution domains and find more genetic traits to improve the effectiveness of information interactions. To further improve the algorithm performance, we propose a smart way to divide initial population into different subpopulations and choose suitable individuals to learn. By ranking individuals in target subpopulation, worse-performing individuals can learn from other tasks. The significant advantage of our proposed paradigm over the state of the art is verified via a series of MTO benchmark studies.