Development and validation of a multimodal automatic interictal epileptiform discharge detection model: a prospective multi-center study.

Background: Visual identification of interictal epileptiform discharge (IED) is expert-biased and time-consuming. Accurate automated IED detection models can facilitate epilepsy diagnosis. This study aims to develop a multimodal IED detection model (vEpiNetV2) and conduct a multi-center validation.

An EEG dataset for interictal epileptiform discharge with spatial distribution information.

Interictal epileptiform discharge (IED) and its spatial distribution are critical for the diagnosis, classification, and treatment of epilepsy. Existing publicly available datasets suffer from limitations such as insufficient data amount and lack of spatial distribution information. In this paper, we present a comprehensive EEG dataset containing annotated interictal epileptic data from 84 patients, each contributing 20 minutes of continuous raw EEG recordings, totaling 28 hours.

Does the digital transformation of enterprises affect capital mismatch? evidence from Chinese listed firms.

In this study, based on the data of the Chinese listed firms, the effect of digital transformation on capital mismatch was examined. And the potential mechanism was also further discussed. It was found that digital transformation can significantly suppress capital mismatch, especially for non-state-owned enterprises, mature enterprises, and regions with high marketization and financial technology level.

Some convergently three-term trust region conjugate gradient algorithms under gradient function non-Lipschitz continuity.

This paper introduces two three-term trust region conjugate gradient algorithms, TT-TR-WP and TT-TR-CG, which are capable of converging under non-Lipschitz continuous gradient functions without any additional conditions. These algorithms possess sufficient descent and trust region properties, and demonstrate global convergence. In order to assess their numerical performance, we compare them with two classical algorithms in terms of restoring noisy gray-scale and color images as well as solving large-scale unconstrained problems.

vEpiNet: A multimodal interictal epileptiform discharge detection method based on video and electroencephalogram data.

To enhance deep learning-based automated interictal epileptiform discharge (IED) detection, this study proposes a multimodal method, vEpiNet, that leverages video and electroencephalogram (EEG) data. Datasets comprise 24 931 IED (from 484 patients) and 166 094 non-IED 4-second video-EEG segments. The video data is processed by the proposed patient detection method, with frame difference and Simple Keypoints (SKPS) capturing patients' movements.

A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations.

For large-scale unconstrained optimization problems and nonlinear equations, we propose a new three-term conjugate gradient algorithm under the Yuan-Wei-Lu line search technique. It combines the steepest descent method with the famous conjugate gradient algorithm, which utilizes both the relevant function trait and the current point feature. It possesses the following properties: (i) the search direction has a sufficient descent feature and a trust region trait, and (ii) the proposed algorithm globally converges.

An active-set algorithm for solving large-scale nonsmooth optimization models with box constraints.

It is well known that the active set algorithm is very effective for smooth box constrained optimization. Many achievements have been obtained in this field. We extend the active set method to nonsmooth box constrained optimization problems, using the Moreau-Yosida regularization technique to make the objective function smooth.

The Modified HZ Conjugate Gradient Algorithm for Large-Scale Nonsmooth Optimization.

In this paper, the Hager and Zhang (HZ) conjugate gradient (CG) method and the modified HZ (MHZ) CG method are presented for large-scale nonsmooth convex minimization. Under some mild conditions, convergent results of the proposed methods are established. Numerical results show that the presented methods can be better efficiency for large-scale nonsmooth problems, and several problems are tested (with the maximum dimensions to 100,000 variables).

Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models.

Two new PRP conjugate Algorithms are proposed in this paper based on two modified PRP conjugate gradient methods: the first algorithm is proposed for solving unconstrained optimization problems, and the second algorithm is proposed for solving nonlinear equations. The first method contains two aspects of information: function value and gradient value. The two methods both possess some good properties, as follows: 1) βk ≥ 0 2) the search direction has the trust region property without the use of any line search method 3) the search direction has sufficient descent property without the use of any line search method.

A Modified BFGS Formula Using a Trust Region Model for Nonsmooth Convex Minimizations.

This paper proposes a modified BFGS formula using a trust region model for solving nonsmooth convex minimizations by using the Moreau-Yosida regularization (smoothing) approach and a new secant equation with a BFGS update formula. Our algorithm uses the function value information and gradient value information to compute the Hessian. The Hessian matrix is updated by the BFGS formula rather than using second-order information of the function, thus decreasing the workload and time involved in the computation.

A Limited-Memory BFGS Algorithm Based on a Trust-Region Quadratic Model for Large-Scale Nonlinear Equations.

In this paper, a trust-region algorithm is proposed for large-scale nonlinear equations, where the limited-memory BFGS (L-M-BFGS) update matrix is used in the trust-region subproblem to improve the effectiveness of the algorithm for large-scale problems. The global convergence of the presented method is established under suitable conditions. The numerical results of the test problems show that the method is competitive with the norm method.