Personalized exercise recommendation is essential for enhancing learning efficiency by adapting educational content to individual student needs. However, current approaches often fail to simultaneously minimize the number of exercises while ensuring students achieve specific learning objectives, and they overlook the nuanced knowledge structures revealed during problem-solving. To address these limitations, this paper introduces a novel framework for dynamic requirement-driven exercise recommendation (DRER), which combines confusion-aware knowledge tracing with nonlinear combinatorial optimization. DRER consists of two key stages. First, in the knowledge tracing stage, a hybrid knowledge concept matrix is constructed to model both the inherent relationships among knowledge concepts and the latent structures revealed through student interactions. Second, in the exercise recommendation stage, the problem is formulated as a Minimum nonlinear weighted set cover problem (MNLWSCP), aiming to identify the smallest set of exercises that enables students to reach a predefined proficiency threshold (e.g., 0.6). To solve this efficiently, a heuristic-based local search algorithm is proposed. Extensive experiments on real-world and academic datasets validate the effectiveness of the framework, demonstrating its ability to significantly reduce the number of recommended exercises while ensuring high accuracy in achieving learning objectives. This work represents a significant integration of data mining and combinatorial optimization, offering a scalable and practical solution for personalized education.
As a typical information system, a cloud file system enables the storage, retrieval, and management of data on remote servers or server clusters. The reliable design of such systems is critical to ensure the security of data and availability of services. However, designing correct-by-construction systems is challenging due to the complexity of and concurrency inherent in cloud file systems. Further, existing works on cloud file system analysis often focus on specific systems or lack formal modeling and verification, leading to potential design flaws and security vulnerabilities. To address these issues, we propose MSCFS-RP, which is a formal analysis model based on colored Petri nets. Leveraging the strengths of colored Petri nets in representing diverse information types with colored tokens and defining explicit rules for concurrent interactions, our model captures the writing and reading processes of clients, meta servers, and clusters. With strong formalism and support for verification using CPN Tools, we rigorously evaluate key properties such as replication consistency under various scenarios. The results demonstrate that MSCFS-RP satisfies these properties, validating its effectiveness and trustworthiness in managing information within cloud storage systems.
29 July 2025 in Journal of Artificial Intelligence Research
Pseudo-Boolean optimization (PBO) is usually used to model combinatorial optimization problems, especially for some real-world applications. Despite its significant importance in both theory and applications, the performance of current PBO solvers is still limited. This paper develops a novel local search algorithm for PBO, which has four main ideas. First, we design a new primary scoring function and a two-level selection strategy to evaluate all candidate variables. Second, we introduce a new weighting scheme to accurately guide the search process toward more promising directions. Third, we propose a novel deep optimization strategy to disturb some search processes. Fourth, an efficient solution space exploration mechanism is applied to help the algorithm jump out of local optimum. We conduct experiments on a broad range of public benchmarks, including three large-scale practical application benchmarks, two benchmarks from PB competitions, an integer linear programming optimization benchmark, a crafted combinatorial benchmark, and a combinatorial optimization knapsack benchmark to compare our proposed algorithm against twelve state-of-the-art competitors, including seven recently-proposed pure stochastic local search PBO solvers, a non-traditional stochastic local search combined with complete oracle, two complete PB solvers, and two mixed integer programming (MIP) solvers. Our proposed algorithm has been shown to perform best on these three real-world benchmarks. On the other five benchmarks, our algorithm shows competitive performance compared to state-of-the-art competitors, and it significantly outperforms all other local search algorithms, indicating that our algorithm greatly advances the state of the art in local search for solving PBO.