This paper has completed the three-dimensional reconstruction of normal young people’s L4–L5 lumbar spine integration model and the integrated model of different degree of disk herniation. On the basis of the reconstruction model, add meshing and set the corresponding material properties of each component, and apply different concentrated forces and boundary conditions to the established finite element model to simulate different working conditions, and then obtain the corresponding nephogram of deformation, displacement and stress of the 3D model. By analyzing the biomechanical characteristics of the model, the validity of the constructed three-dimensional model was verified.
This paper uses the MC surface rendering method to extract the three-dimensional CT images of the lumbar spine. An integrated model of L4-L5 lumbar spine of normal youth was constructed, including anterior ligament, posterior ligament, ligamentum flavum, supraspinous ligament, interspinous ligament, annulus fibrosus, nucleus pulposus and other main human spine attached soft tissues. An integrated model of different stages of degenerative disk enlargement lesions (including mild enlargement lesions, moderate enlargement lesions, severe enlargement lesions, etc.) and other finite element mechanical model was constructed; model meshing and parameterized setting of the corresponding material properties of each component was carried out; finally, the loads and boundary conditions in different directions were defined to simulate the stress and deformation under different working conditions of degenerative disk enlargement model at normal youth and different stages. By comparing the stress, deformation and other mechanical test data, the biomechanical characteristics of the lesion model was analyzed according to the relevant mechanical model parameters and evaluation system, so as to verify the correctness and effectiveness of the constructed model, and then to provide accurate mechanical model reference for disease feature recognition, reliability of diagnosis and safety during surgery.
In this paper, we introduce an efficient and effective algorithm for Graph-based Semi-Supervised Learning (GSSL). Unlike other GSSL methods, our proposed algorithm achieves efficiency by constructing a bipartite graph, which connects a small number of representative points to a large volume of raw data by capturing their underlying manifold structures. This bipartite graph, with a sparse and anti-diagonal affinity matrix which is symmetrical, serves as a low-rank approximation of the original graph. Consequently, our algorithm accelerates both the graph construction and label propagation steps. In particular, on the one hand, our algorithm computes the label propagation in closed-form, reducing its computational complexity from cubic to approximately linear with respect to the number of data points; on the other hand, our algorithm calculates the soft label matrix for unlabeled data using a closed-form solution, thereby gaining additional acceleration. Comprehensive experiments performed on six real-world datasets demonstrate the efficiency and effectiveness of our algorithm in comparison to five state-of-the-art algorithms.
In numerous episodic reinforcement learning (RL) environments, SARSA-based methodologies are employed to enhance policies aimed at maximizing returns over long horizons. Traditional SARSA algorithms face challenges in achieving an optimal balance between bias and variation, primarily due to their dependence on a single, constant discount factor (). This study enhances the temporal difference decomposition method, TD(), by applying it to the SARSA algorithm, wherein the action-value function is segmented into several components based on the differences between action-value functions linked to specific discount factors. Each component, referred to as a delta estimator (D), is linked to a specific discount factor and learned independently. This modified technique is referred to as SARSA(). SARSA is a widely used on-policy RL method that enhances action-value functions via temporal difference updates. This decomposition, namely SARSA(), facilitates learning across a range of time scales. This analysis makes learning more effective and guarantees consistency, especially in situations where long-horizon improvement is needed. The results of this research show that the proposed technique works to lower bias in SARSA’s updates and speed up convergence in both deterministic and stochastic settings, even in dense-reward Atari environments. Experimental results from a variety of benchmark settings show that the proposed SARSA() outperforms existing TD learning techniques in both tabular and deep RL environments.
This paper discusses a reduction in the optimal time due to the presence of input redundancy in time-optimal control problems. By introducing a non-idle channel to represent an active input channel, we establish the necessary and sufficient conditions that ensure a strict reduction in the optimal time for affine nonlinear systems. In cases of identical input redundancy, its impact varies according to the type of input constraint, and certain types may not lead to a reduction in the optimal time. Ultimately, in linear time-invariant (LTI) systems, the extent of the optimal time reduction depends on the system’s controllability.