Search alternatives:
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
algorithm its » algorithm i (Expand Search), algorithm iqa (Expand Search), algorithm steps (Expand Search)
algorithm etc » algorithm _ (Expand Search), algorithm b (Expand Search), algorithm a (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
python function » protein function (Expand Search)
algorithm its » algorithm i (Expand Search), algorithm iqa (Expand Search), algorithm steps (Expand Search)
algorithm etc » algorithm _ (Expand Search), algorithm b (Expand Search), algorithm a (Expand Search)
-
61
The Simulation and optimization process of pipe diameter selection.
Published 2022Subjects: “…evolutionary genetic algorithm…”
-
62
Optional pipe diameter and unit price of NYN.
Published 2022Subjects: “…evolutionary genetic algorithm…”
-
63
Optional pipe diameter and unit price of HN.
Published 2022Subjects: “…evolutionary genetic algorithm…”
-
64
-
65
-
66
-
67
-
68
-
69
-
70
-
71
Discovery of Protein Modifications Using Differential Tandem Mass Spectrometry Proteomics
Published 2021“…Termed SAMPEI for spectral alignment-based modified peptide identification, this open-source algorithm is designed for the discovery of functional protein and peptide signaling modifications, without prior knowledge of their identities. …”
-
72
Discovery of Protein Modifications Using Differential Tandem Mass Spectrometry Proteomics
Published 2021“…Termed SAMPEI for spectral alignment-based modified peptide identification, this open-source algorithm is designed for the discovery of functional protein and peptide signaling modifications, without prior knowledge of their identities. …”
-
73
-
74
The ALO algorithm optimization flowchart.
Published 2024“…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …”
-
75
The IALO algorithm solution flowchart.
Published 2024“…The average running time of the proposed algorithm in Sphere function and Griebank function was 2.67s and 1.64s, respectively. …”
-
76
Comparison of UACI among different algorithms.
Published 2025“…Based on the 2D-SQSM, this paper further designs a highly robust color image encryption algorithm. First, by introducing different hash functions multiple times, the correlation between the key and plaintext is enhanced, significantly improving resistance against brute-force attacks; second, cyclic shifting and segmentation-recombination operations are applied separately to the three RGB channels to effectively disrupt pixel distribution and significantly reduce spatial correlation between pixels; finally, the chaotic sequence generated by the 2D-SQSM is utilized for XOR diffusion, further enhancing the randomness and diffusion capability of the ciphertext. …”
-
77
Comparison of NPCR among different algorithms.
Published 2025“…Based on the 2D-SQSM, this paper further designs a highly robust color image encryption algorithm. First, by introducing different hash functions multiple times, the correlation between the key and plaintext is enhanced, significantly improving resistance against brute-force attacks; second, cyclic shifting and segmentation-recombination operations are applied separately to the three RGB channels to effectively disrupt pixel distribution and significantly reduce spatial correlation between pixels; finally, the chaotic sequence generated by the 2D-SQSM is utilized for XOR diffusion, further enhancing the randomness and diffusion capability of the ciphertext. …”
-
78
-
79
Algorithm of the main experiment targeted to measure the perceptual point spread function (pPSF) treating patients visual system including its optics, physiology and psychology as an integrated imaging system, and patient’s perceptions as its output signal.
Published 2024“…<p>In the algorithm, the following variables were used: “Ic” denotes the intensity of the central diode (Ic = 40 cd); “DIST(i)” is a randomly sorted list of “D” angular stimuli positions distributed equally as a function of distance from 0.24° to 7.67° from the central point (D = 10), while “i” is an index corresponding to the current distance of a probe diode (“d”); “N” denotes the number of trials for each stimuli position (N = 20); “s” denotes the perceptual brightness value transformed to diode luminous intensity by an array “I(s)” corresponds to the table “scale (level)” determined by the algorithm presented in <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0306331#pone.0306331.g003" target="_blank">Fig 3</a>; “cnt” is a counter of trials for the current probe diode’s distance, array threshold (d), and slope (d), i.e., it denotes the intensity of the single point of the pPSF and its uncertainty. …”
-
80
Benchmarking functions.
Published 2024“…Introducing nonlinear convergence factors based on positive cut functions to changing the convergence of algorithms, the early survey capabilities and later development capabilities of the algorithm are balanced. …”