Compact difference method for solving the fractional reaction–subdiffusion equation with Neumann boundary value condition

In this paper, we derive a high-order compact finite difference scheme for solving the reaction–subdiffusion equation with Neumann boundary value condition. The L1 method is used to approximate the temporal Caputo derivative, and the compact difference operator is applied for spatial discretization. We prove that the compact finite difference method is unconditionally stable and convergent with order O(τ^2?α+h⁴) in L₂ norm, where τ, α, and h are the temporal step size, the order of time fractional derivative and the spatial step size, respectively. Finally, some numerical experiments are carried out to show the effectiveness of the proposed difference scheme.     

Numerical solution of nonlinear system of Klein–Gordon equations by cubic B-spline collocation method

A technique to approximate the solutions of nonlinear Klein–Gordon equation and Klein–Gordon-Schrödinger equations is presented separately. The approach is based on collocation of cubic B-spline functions. The above-mentioned equations are decomposed into a system of partial differential equations, which are further converted to an amenable system of ODEs. The obtained system has been solved by SSP-RK54 scheme. Numerical solutions are presented for five examples, to show the accuracy and usefulness of proposed approach. The approximate solutions of both the equations are computed without using any transformation and linearization. The technique can be applied with ease to solve linear and nonlinear PDEs and also reduces the computational work.     

Assessing the effects of gamification in the classroom: A longitudinal study on intrinsic motivation,social comparison,satisfaction, effort,and academic performance

Gamification, the application of game elements to non-game settings, continues to grow in popularity as a method to increase student engagement in the classroom. We tested students across two courses, measuring their motivation, social comparison, effort, satisfaction, learner empowerment, and academic performance at four points during a 16-week semester. One course received a gamified curriculum, featuring a leaderboard and badges, whereas the other course received the same curriculum without the gamified elements. Our results found that students in the gamified course showed less motivation, satisfaction, and empowerment over time than those in the non-gamified class. The effect of course type on students' final exam scores was mediated by students' levels of intrinsic motivation, with students in the gamified course showing less motivation and lower final exam scores than the non-gamified class. This suggests that some care should be taken when applying certain gamification mechanics to educational settings.     

Incremental subgradient method for nonsmooth convex optimization with fixed point constraints

This paper proposes an incremental subgradient method for solving the problem of minimizing the sum of nondifferentiable, convex objective functions over the intersection of fixed point sets of nonexpansive mappings in a real Hilbert space. The proposed algorithm can work in nonsmooth optimization over constraint sets onto which projections cannot be always implemented, whereas the conventional incremental subgradient method can be applied only when a constraint set is simple in the sense that the projection onto it can be easily implemented. We first study its convergence for a constant step size. The analysis indicates that there is a possibility that the algorithm with a small constant step size approximates a solution to the problem. Next, we study its convergence for a diminishing step size and show that there exists a subsequence of the sequence generated by the algorithm which weakly converges to a solution to the problem. Moreover, we show the whole sequence generated by the algorithm with a diminishing step size strongly converges to the solution to the problem under certain assumptions. We also give examples of real applied problems which satisfy the assumptions in the convergence theorems and numerical examples to support the convergence analyses.     

Fast local image inpainting based on the Allen–Cahn model

In this paper, we propose a fast local image inpainting algorithm based on the Allen–Cahn model. The proposed algorithm is applied only on the inpainting domain and has two features. The first feature is that the pixel values in the inpainting domain are obtained by curvature-driven diffusions and utilizing the image information from the outside of the inpainting region. The second feature is that the pixel values outside of the inpainting region are the same as those in the original input image since we do not compute the outside of the inpainting region. Thus the proposed method is computationally efficient. We split the governing equation into one linear equation and one nonlinear equation by using an operator splitting technique. The linear equation is discretized by using a fully implicit scheme and the nonlinear equation is solved analytically. We prove the unconditional stability of the proposed scheme. To demonstrate the robustness and accuracy of the proposed method, various numerical results on real and synthetic images are presented.     

Continuum electrostatic approach for evaluating positions and interactions of proteins in a bilayer membrane

Orientations of proteins in the membranes are crucial to their function and stability. Unfortunately the exact positions of these proteins in the lipid bilayer are mostly undetermined. Here, the spatial orientation of membrane proteins within the lipid membrane was evaluated using a Poisson–Boltzmann solvent continuum approach to calculate the electrostatic free energy of the protein solvation at various orientations in an implicit bilayer. The solvation energy was obtained by computing the difference in electrostatic energies of the protein in water and in lipid/water environments, treating each as an implicit solvent model. The optimal position of transmembrane proteins (TMP) in a lipid bilayer is identified by the minimum in the “downhill” pathway of the solvation energy landscape. The energy landscape pattern was considerably conserved in various TMP classes. Evaluation of the position of 1060 membrane proteins from the orientations of proteins in membranes (OPM) database revealed that most of the polytopic and β-barrel proteins were in good agreement with those of the OPM database. The study provides a useful scheme for estimating the membrane solvation energy made by lipid-exposed amino acids in membrane proteins. In addition, our results tested with the bacterial potassium channel model demonstrated the potential usefulness of the approach in assessing the quality of membrane protein models. The present approach should be applicable for constructing transmembrane proteins–lipid configuration suitable for membrane protein simulations and will have utility for the structural modeling of membrane proteins.