Search alternatives:
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search)
algorithm brain » algorithm ai (Expand Search), algorithm against (Expand Search), algorithm within (Expand Search)
python function » protein function (Expand Search)
brain function » barrier function (Expand Search), protein function (Expand Search)
algorithm both » algorithm blood (Expand Search), algorithm b (Expand Search), algorithm etc (Expand Search)
both function » body function (Expand Search), growth function (Expand Search), beach function (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search)
algorithm brain » algorithm ai (Expand Search), algorithm against (Expand Search), algorithm within (Expand Search)
python function » protein function (Expand Search)
brain function » barrier function (Expand Search), protein function (Expand Search)
algorithm both » algorithm blood (Expand Search), algorithm b (Expand Search), algorithm etc (Expand Search)
both function » body function (Expand Search), growth function (Expand Search), beach function (Expand Search)
-
241
Results of the replicated simulations.
Published 2024“…We propose a <i>K</i>-means-type algorithm in which each cluster is defined by a function-on-function regression model, which, inter alia, allows for multiple functional explanatory variables. …”
-
242
-
243
Presentation of the DySCo framework.
Published 2025“…<p>A: What is dynamic Functional Connectivity: i) We can start from any set of brain recordings, where each signal is referred to a brain location (e.g. fMRI, EEG, intracranial recordings in rodents, and more). ii) “Static” Functional Connectivity (FC) is a matrix where each entry is a time aggregated functional measure of interaction between two regions, for example, the Pearson Correlation Coefficient. iii) Dynamic Functional Connectivity (dFC) is a FC matrix (that can be calculated in different ways, see below) that changes with time, under the assumption that patterns of brain interactions are non-stationary. …”
-
244
S1 File -
Published 2024“…<div><p>In the proposed protection coordination scheme, the depreciation of the operation time of the entire relay in the primary and backup protection modes for all possible fault locations is considered as the objective function. The limitations of this problem include the equations for calculating the operation time of the relays in both forward and reverse directions, the limitation of the coordination time interval, the limitation of the setting parameters of the proposed relays, the restriction of the size of the reactance that limits the fault current, and the limitation of the standing time of distributed generation per small signal fault. …”
-
245
Flowchart of SAOA.
Published 2024“…<div><p>In the proposed protection coordination scheme, the depreciation of the operation time of the entire relay in the primary and backup protection modes for all possible fault locations is considered as the objective function. The limitations of this problem include the equations for calculating the operation time of the relays in both forward and reverse directions, the limitation of the coordination time interval, the limitation of the setting parameters of the proposed relays, the restriction of the size of the reactance that limits the fault current, and the limitation of the standing time of distributed generation per small signal fault. …”
-
246
Flowchart of overall solution procedure.
Published 2024“…<div><p>In the proposed protection coordination scheme, the depreciation of the operation time of the entire relay in the primary and backup protection modes for all possible fault locations is considered as the objective function. The limitations of this problem include the equations for calculating the operation time of the relays in both forward and reverse directions, the limitation of the coordination time interval, the limitation of the setting parameters of the proposed relays, the restriction of the size of the reactance that limits the fault current, and the limitation of the standing time of distributed generation per small signal fault. …”
-
247
Summary of the CEC-2017 test functions.
Published 2025“…<div><p>The icing failures of wind turbine blades are critical factors that affect both power generation efficiency and safety. To improve the diagnostic accuracy and speed, an improved weighted kernel extreme learning machine (IWKELM) optimized by multi-strategy adaptive coati optimization algorithm (MACOA) for icing fault diagnosis model is proposed, i.e., MACOA-IWKELM. …”
-
248
-
249
-
250
-
251
Simulation specifications for figure.
Published 2024“…Both the ensemble and stochastic models presented in this work have been verified using Monte Carlo molecular dynamic simulations that utilize the Gillespie algorithm. …”
-
252
Expected behavior system of ODEs.
Published 2024“…Both the ensemble and stochastic models presented in this work have been verified using Monte Carlo molecular dynamic simulations that utilize the Gillespie algorithm. …”
-
253
Example fluorophores.
Published 2024“…Both the ensemble and stochastic models presented in this work have been verified using Monte Carlo molecular dynamic simulations that utilize the Gillespie algorithm. …”
-
254
-
255
Functional Projection <i>K</i>-means
Published 2025“…In contrast to existing literature, which largely considers the smoothing as a pre-processing step, in our proposal regularization is integrated with the identification of both subspace and cluster partition. An alternating least squares algorithm is introduced to compute model parameter estimates. …”
-
256
The value functions for different set-up costs.
Published 2025“…These expressions are determined using the copula function, and an algorithm is designed to construct the corresponding transition probability matrix. …”
-
257
Ablation comparison experimental data.
Published 2025“…During experimental evaluation, the efficiency of OP-ZOA was verified using the CEC2017 test functions, demonstrating superior performance compared to seven recently proposed meta-heuristic algorithms (Bloodsucking Leech Algorithm (BSLO), Parrot Optimization Algorithm (PO), Polar Lights Algorithm (PLO), Red-tailed Hawk Optimization Algorithm (RTH), Bitterling Fish Optimization Algorithm (BFO), Spider Wasp Optimization Algorithm (SWO) and Zebra Optimization Algorithm (ZOA)). …”
-
258
Box plot of ablation experiment data.
Published 2025“…During experimental evaluation, the efficiency of OP-ZOA was verified using the CEC2017 test functions, demonstrating superior performance compared to seven recently proposed meta-heuristic algorithms (Bloodsucking Leech Algorithm (BSLO), Parrot Optimization Algorithm (PO), Polar Lights Algorithm (PLO), Red-tailed Hawk Optimization Algorithm (RTH), Bitterling Fish Optimization Algorithm (BFO), Spider Wasp Optimization Algorithm (SWO) and Zebra Optimization Algorithm (ZOA)). …”
-
259
Iterative curve of ablation experiment.
Published 2025“…During experimental evaluation, the efficiency of OP-ZOA was verified using the CEC2017 test functions, demonstrating superior performance compared to seven recently proposed meta-heuristic algorithms (Bloodsucking Leech Algorithm (BSLO), Parrot Optimization Algorithm (PO), Polar Lights Algorithm (PLO), Red-tailed Hawk Optimization Algorithm (RTH), Bitterling Fish Optimization Algorithm (BFO), Spider Wasp Optimization Algorithm (SWO) and Zebra Optimization Algorithm (ZOA)). …”
-
260
Decoding evidence for feature triplets on test tasks.
Published 2025“…This figure shows average decoding evidence for features associated with the more and less rewarding training policies on test trials (y-axis) as a function of brain region (x-axis). Feature information could not be decoded above chance in the four brain regions of interest (corrected <i>p-</i>values > 0.05). …”