A Class of Parallel Implicit Runge-Kutta Formulas

A class of parallel implicit Runge-Kutta formulas is constructed for multiprocessor system. A family of parallel implicit two-stage fourth order Runge-Kutta formulas is given. For these formulas, the convergence is proved and the stability analysis is given. The numerical examples demonstrate that these formulas can solve an extensive class of initial value problems for the ordinary differential equations.

Two Implicit Runge-Kutta Methods for Stochastic Differential Equation

In this paper, the Ito-Taylor expansion of stochastic differential equation is briefly introduced. The colored rooted tree theory is applied to derive strong order 1.0 implicit stochastic Runge-Kutta method(SRK). Two fully implicit schemes are presented and their stability qualities are discussed. And the numerical report illustrates the better numerical behavior.

A PARALLEL COMPUTATION SCHEME FOR IMPLICIT RUNGE-KUTTA METHODS AND THE ITERATIVELY B-CONVERGENCE OF ITS NEWTON ITERATIVE PROCESS

In this paper, based on the implicit Runge-Kutta(IRK) methods, we derive a class of parallel scheme that can be implemented on the parallel computers with Ns(N is a positive even number) processors efficiently, and discuss the iteratively B-convergence of the Newton iterative process for solving the algebraic equations of the scheme, secondly we present a strategy providing initial values parallelly for the iterative process. Finally, some numerical results show that our parallel scheme is higher efficient as N is not so large.

Stability and Time-Step Constraints of Implicit-Explicit Runge-Kutta Methods for the Linearized Korteweg-de Vries Equation

This paper provides a study on the stability and time-step constraints of solving the linearized Korteweg-de Vries(KdV)equation,using implicit-explicit(IMEX)Runge-Kutta(RK)time integration methods combined with either finite difference(FD)or local discontinuous Galerkin(DG)spatial discretization.We analyze the stability of the fully discrete scheme,on a uniform mesh with periodic boundary conditions,using the Fourier method.For the linearized KdV equation,the IMEX schemes are stable under the standard Courant-Friedrichs-Lewy(CFL)conditionτ≤λh.Here,λis the CFL number,τis the time-step size,and h is the spatial mesh size.We study several IMEX schemes and characterize their CFL number as a function ofθ=d/h^(2)with d being the dispersion coefficient,which leads to several interesting observations.We also investigate the asymptotic behaviors of the CFL number for sufficiently refined meshes and derive the necessary conditions for the asymptotic stability of the IMEX-RK methods.Some numerical experiments are provided in the paper to illustrate the performance of IMEX methods under different time-step constraints.

Stability Analysis and Performance Evaluation of Additive Mixed-Precision Runge-Kutta Methods

Additive Runge-Kutta methods designed for preserving highly accurate solutions in mixed-precision computation were previously proposed and analyzed.These specially designed methods use reduced precision for the implicit computations and full precision for the explicit computations.In this work,we analyze the stability properties of these methods and their sensitivity to the low-precision rounding errors,and demonstrate their performance in terms of accuracy and efficiency.We develop codes in FORTRAN and Julia to solve nonlinear systems of ODEs and PDEs using the mixed-precision additive Runge-Kutta(MP-ARK)methods.The convergence,accuracy,and runtime of these methods are explored.We show that for a given level of accuracy,suitably chosen MP-ARK methods may provide significant reductions in runtime.

Impaired implicit emotion regulation in patients with panic disorder:An event-related potential study on affect labeling

BACKGROUND Panic disorder(PD)involves emotion dysregulation,but its underlying mechanisms remain poorly understood.Previous research suggests that implicit emotion regulation may play a central role in PD-related emotion dysregulation and symptom maintenance.However,there is a lack of studies exploring the neural mechanisms of implicit emotion regulation in PD using neurophysiological indicators.AIM To study the neural mechanisms of implicit emotion regulation in PD with eventrelated potentials(ERP).METHODS A total of 25 PD patients and 20 healthy controls(HC)underwent clinical evaluations.The study utilized a case-control design with random sampling,selecting participants for the case group from March to December 2018.Participants performed an affect labeling task,using affect labeling as the experimental condition and gender labeling as the control condition.ERP and behavioral data were recorded to compare the late positive potential(LPP)within and between the groups.RESULTS Both PD and HC groups showed longer reaction times and decreased accuracy under the affect labeling.In the HC group,late LPP amplitudes exhibited a dynamic pattern of initial increase followed by decrease.Importantly,a significant group×condition interaction effect was observed.Simple effect analysis revealed a reduction in the differences of late LPP amplitudes between the affect labeling and gender labeling conditions in the PD group compared to the HC group.Furthermore,among PD patients under the affect labeling,the late LPP was negatively correlated with disease severity,symptom frequency,and intensity.CONCLUSION PD patients demonstrate abnormalities in implicit emotion regulation,hampering their ability to mobilize cognitive resources for downregulating negative emotions.The late LPP amplitude in response to affect labeling may serve as a potentially valuable clinical indicator of PD severity.

非线性控制系统的Runge-Kutta方法的输入状态稳定

研究在什么条件下Runge-Kutta方法能够保持非线性控制系统的输入状态稳定。给出了Runge-Kutta方法生成的近似解保持控制系统真解的输入状态稳定的充分条件,特别证明了在一些常规条件下,所有Gauss-Legendre,Radau IA,Radau IIA,Lobatto IIIC型方法生成的近似解能够保持控制系统真解的输入状态稳定,这为实际应用中如何选择控制系统的数值方法问题奠定了理论基础。

Analysis of The Use of Implicit Nursing Knowledge in The Teaching of Cardiovascular Internal Medicine Nursing

Objective: To explore the utilization of implicit nursing knowledge in the teaching of cardiovascular internal medicine nursing and to provide a reference for improving the quality and efficiency of cardiovascular internal medicine nursing work. Methods: Thirty-six trainee nurses working in the cardiovascular internal medicine department of our hospital from September 2022 to September 2023 were selected and randomly divided into a control group and an observation group of 18 trainees each. The control adopted the traditional teaching methods while the observation group adopted the implicit nursing knowledge in their clinical practice work. The assessment scores and teamwork ability of the two groups were analyzed and compared. Results: The performance of the observation group was better than that of the control group, and the difference between the two groups was statistically significant (P < 0.05). The teamwork ability of the observation group was significantly better than that of the control group in teamwork ability (P < 0.05). Conclusion: Implicit nursing knowledge teaching is conducive to the cultivation of high-quality nursing talents and meets the development needs of hospitals. Therefore, the importance of implicit nursing knowledge should be strengthened in the teaching of cardiovascular internal medicine nursing and it should be comprehensively organized to improve the quality of nursing services.

ORDER RESULTS FOR ALGEBRAICALLY STABLEMONO-IMPLICIT RUNGE-KUTTA METHODS

It is well known that mono-implicit Runge-Kutta methods have been applied in the efficient numerical solution of initial or boundary value problems of ordinary differential equations. Burrage (1994) has shown that the order of an s-stage monoimplicit Runge-Kutta method is at most s+1 and the stage order is at most 3. In this paper, it is shown that the order of an s-stage mono-implicit Runge-Kutta method being algebraically stable is at most min((s) over tilde, 4), and the stage order together with the optimal B-convergence order is at most min(s, 2), where [GRAPHICS]

含Caputo-Fabrizio分数阶算子的非线性刚性泛函微分方程Runge-Kutta方法的稳定性

该文针对一类带有Caputo-Fabrizio分数阶算子的非线性刚性泛函微分方程初值问题,利用线性插值技巧离散Caputo-Fabrizio算子,结合求解常微分方程的数值方法,构造了求解该问题的Runge-Kutta方法,给出了在一定条件下方法的非线性稳定性结果.

An efficient method for train-track-substructure dynamic interaction analysis by implicit-explicit integration and multi-time-step solution

In this work,a method is put forward to obtain the dynamic solution efficiently and accurately for a large-scale train-track-substructure(TTS)system.It is called implicit-explicit integration and multi-time-step solution method(abbreviated as mI-nE-MTS method).The TTS system is divided into train-track subsystem and substruc-ture subsystem.Considering that the root cause of low effi-ciency of obtaining TTS solution lies in solving the alge-braic equation of the substructures,the high-efficient Zhai method,an explicit integration scheme,can be introduced to avoid matrix inversion process.The train-track system is solved by implicitly Park method.Moreover,it is known that the requirement of time step size differs for different sub-systems,integration methods and structural frequency response characteristics.A multi-time-step solution is pro-posed,in which time step size for the train-track subsystem and the substructure subsystem can be arbitrarily chosen once satisfying stability and precision demand,namely the time spent for m implicit integral steps is equal to n explicit integral steps,i.e.,mI=nE as mentioned above.The numeri-cal examples show the accuracy,efficiency,and engineering practicality of the proposed method.

Implicit Continuous User Authentication for Mobile Devices based on Deep Reinforcement Learning

The predominant method for smart phone accessing is confined to methods directing the authentication by means of Point-of-Entry that heavily depend on physiological biometrics like,fingerprint or face.Implicit continuous authentication initiating to be loftier to conventional authentication mechanisms by continuously confirming users’identities on continuing basis and mark the instant at which an illegitimate hacker grasps dominance of the session.However,divergent issues remain unaddressed.This research aims to investigate the power of Deep Reinforcement Learning technique to implicit continuous authentication for mobile devices using a method called,Gaussian Weighted Cauchy Kriging-based Continuous Czekanowski’s(GWCK-CC).First,a Gaussian Weighted Non-local Mean Filter Preprocessing model is applied for reducing the noise pre-sent in the raw input face images.Cauchy Kriging Regression function is employed to reduce the dimensionality.Finally,Continuous Czekanowski’s Clas-sification is utilized for proficient classification between the genuine user and attacker.By this way,the proposed GWCK-CC method achieves accurate authen-tication with minimum error rate and time.Experimental assessment of the pro-posed GWCK-CC method and existing methods are carried out with different factors by using UMDAA-02 Face Dataset.The results confirm that the proposed GWCK-CC method enhances authentication accuracy,by 9%,reduces the authen-tication time,and error rate by 44%,and 43%as compared to the existing methods.

Runge-Kutta型多尺度神经网络求解非定常偏微分方程

提出了基于Runge-Kutta的多尺度神经网络方法求解非定常偏微分方程.利用q阶Runge-Kutta构造时间迭代格式,通过建立多时间步的总损失函数,实现多时间步的神经网络参数共享,并预测时域内任意时刻的函数值.同时采用m-缩放因子加快损失函数收敛,提高数值解精度.最后,给出了若干数值实验验证所提方法的有效性.

Speeding-up direct implicit particle-in-cell simulations in bounded plasma by obtaining future electric field through explicitly propulsion of particles

The direct implicit particle-in-cell is a powerful kinetic method for researching plasma characteristics.However,it is time-consuming to obtain the future electromagnetic field in such a method since the field equations contain time-dependent matrix coefficients.In this work,we propose to explicitly push particles and obtain the future electromagnetic field based on the information about the particles in the future.The new method retains the form of implicit particle pusher,but the future field is obtained by solving the traditional explicit equation.Several numerical experiments,including the motion of charged particle in electromagnetic field,plasma sheath,and free diffusion of plasma into vacuum,are implemented to evaluate the performance of the method.The results demonstrate that the proposed method can suppress finite-grid-instability resulting from the coarse spatial resolution in electron Debye length through the strong damping of high-frequency plasma oscillation,while accurately describe low-frequency plasma phenomena,with the price of losing the numerical stability at large time-step.We believe that this work is helpful for people to research the bounded plasma by using particle-in-cell simulations.

Interactive Restoration of Three-Dimensional Implicit Surface with Irregular Parts

Implicit surface generation based on the interpolation of surface points is one of the well-known modeling methods in the area of computer graphics.Several methods for the implicit surface reconstruction from surface points have been proposed on the basis of radial basis functions,a weighted sum of local functions,splines,wavelets,and combinations of them.However,if the surface points contain errors or are sparsely distributed,irregular components,such as curvature-shaped redundant bulges and unexpectedly generated high-frequency components,are commonly seen.This paper presents a framework for restoring irregular components generated on and around surfaces.Users are assumed to specify local masks that cover irregular components and parameters that determine the degree of restoration.The algorithm in this paper removes the defects based on the user-specific masks and parameters.Experiments have shown that the proposed methods can effectively remove redundant protrusions and jaggy noise.

Grey Wolf-Based Method for an Implicit Authentication of Smartphone Users

Smartphones have now become an integral part of our everyday lives.User authentication on smartphones is often accomplished by mechanisms(like face unlock,pattern,or pin password)that authenticate the user’s identity.These technologies are simple,inexpensive,and fast for repeated logins.However,these technologies are still subject to assaults like smudge assaults and shoulder surfing.Users’touch behavior while using their cell phones might be used to authenticate them,which would solve the problem.The performance of the authentication process may be influenced by the attributes chosen(from these behaviors).The purpose of this study is to present an effective authentication technique that implicitly offers a better authentication method for smartphone usage while avoiding the cost of a particular device and considering the constrained capabilities of smartphones.We began by concentrating on feature selection methods utilizing the grey wolf optimization strategy.The random forest classifier is used to evaluate these tactics.The testing findings demonstrated that the grey wolf-based methodology works as a better optimum feature selection for building an implicit authentication mechanism for the smartphone environment when using a public dataset.It achieved a 97.89%accuracy rate while utilizing just 16 of the 53 characteristics like utilizing minimum mobile resources mainly;processing power of the device and memory to validate individuals.Simultaneously,the findings revealed that our approach has a lower equal error rate(EER)of 0.5104,a false acceptance rate(FAR)of 1.00,and a false rejection rate(FRR)of 0.0209 compared to the methods discussed in the literature.These promising results will be used to create a mobile application that enables implicit validation of authorized users yet avoids current identification concerns and requires fewer mobile resources.

基于NAD算子的三阶Runge-Kutta方法及波场模拟

为求解二维声波方程,本文结合空间高阶偏导数离散化的八阶NAD算子和时间导数离散化的三阶Runge-Kutta方法,推导出八阶NAD-RK算法。详细研究了八阶NAD-RK算法的计算效率和地震波数值模拟。结果显示:在达到相同精度下,八阶NAD-RK算法的内存需求约为八阶LWC算法的20%,约为八阶SG算法的25%;八阶NAD-RK算法的计算速度约为八阶LWC算法的5.8倍,约为八阶SG算法的1.52倍。地震波数值模拟实验进一步验证八阶NAD-RK算法数值频散压制效果。

A New Analysis of an Implicit Mimetic Scheme for the Heat Equation

A mimetic finite difference scheme for the transient heat equation under Robin’s conditions is presented. The scheme uses second order gradient and divergence mimetic operators, on a staggered grid, to approximate the space derivatives. The temporal derivative is replaced by a first order backward difference approximation to obtain an implicit formulation. The resulting scheme contains nonstandard finite difference stencils. An original convergence analysis by the matrix’s method shows that the proposed scheme is unconditionally stable. A comparative study against standard finite difference schemes, based on central difference or first order one side approximations, reveals the advantages of our scheme without being its implementation more expensive or difficult to achieve.

Solving Arithmetic Word Problems of Entailing Deep Implicit Relations by Qualia Syntax-Semantic Model

Solving arithmetic word problems that entail deep implicit relations is still a challenging problem.However,significant progress has been made in solving Arithmetic Word Problems(AWP)over the past six decades.This paper proposes to discover deep implicit relations by qualia inference to solve Arithmetic Word Problems entailing Deep Implicit Relations(DIR-AWP),such as entailing commonsense or subject-domain knowledge involved in the problem-solving process.This paper proposes to take three steps to solve DIR-AWPs,in which the first three steps are used to conduct the qualia inference process.The first step uses the prepared set of qualia-quantity models to identify qualia scenes from the explicit relations extracted by the Syntax-Semantic(S2)method from the given problem.The second step adds missing entities and deep implicit relations in order using the identified qualia scenes and the qualia-quantity models,respectively.The third step distills the relations for solving the given problem by pruning the spare branches of the qualia dependency graph of all the acquired relations.The research contributes to the field by presenting a comprehensive approach combining explicit and implicit knowledge to enhance reasoning abilities.The experimental results on Math23K demonstrate hat the proposed algorithm is superior to the baseline algorithms in solving AWPs requiring deep implicit relations.

Knowledge-enriched joint-learning model for implicit emotion cause extraction

Emotion cause extraction(ECE)task that aims at extracting potential trigger events of certain emotions has attracted extensive attention recently.However,current work neglects the implicit emotion expressed without any explicit emotional keywords,which appears more frequently in application scenarios.The lack of explicit emotion information makes it extremely hard to extract emotion causes only with the local context.Moreover,an entire event is usually across multiple clauses,while existing work merely extracts cause events at clause level and cannot effectively capture complete cause event information.To address these issues,the events are first redefined at the tuple level and a span-based tuple-level algorithm is proposed to extract events from different clauses.Based on it,a corpus for implicit emotion cause extraction that tries to extract causes of implicit emotions is constructed.The authors propose a knowledge-enriched jointlearning model of implicit emotion recognition and implicit emotion cause extraction tasks(KJ-IECE),which leverages commonsense knowledge from ConceptNet and NRC_VAD to better capture connections between emotion and corresponding cause events.Experiments on both implicit and explicit emotion cause extraction datasets demonstrate the effectiveness of the proposed model.