بدائل البحث:
structure optimization » structural optimization (توسيع البحث), structure determination (توسيع البحث)
design optimization » bayesian optimization (توسيع البحث)
image design » images designed (توسيع البحث), simple design (توسيع البحث), space design (توسيع البحث)
b structure » _ structure (توسيع البحث), 3d structure (توسيع البحث), 2d structure (توسيع البحث)
binary b » binary _ (توسيع البحث)
structure optimization » structural optimization (توسيع البحث), structure determination (توسيع البحث)
design optimization » bayesian optimization (توسيع البحث)
image design » images designed (توسيع البحث), simple design (توسيع البحث), space design (توسيع البحث)
b structure » _ structure (توسيع البحث), 3d structure (توسيع البحث), 2d structure (توسيع البحث)
binary b » binary _ (توسيع البحث)
-
1
-
2
-
3
-
4
-
5
-
6
-
7
Sample image for illustration.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
8
Quadratic polynomial in 2D image plane.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
9
-
10
-
11
-
12
-
13
Algoritmo de clasificación de expresiones de odio por tipos en español (Algorithm for classifying hate expressions by type in Spanish)
منشور في 2024"…</li></ul><p dir="ltr"><b>File Structure</b></p><p dir="ltr">The code generates and saves:</p><ul><li>Weights of the trained model (.h5)</li><li>Configured tokenizer</li><li>Training history in CSV</li><li>Requirements file</li></ul><p dir="ltr"><b>Important Notes</b></p><ul><li>The model excludes category 2 during training</li><li>Implements transfer learning from a pre-trained model for binary hate detection</li><li>Includes early stopping callbacks to prevent overfitting</li><li>Uses class weighting to handle category imbalances</li></ul><p dir="ltr">The process of creating this algorithm is explained in the technical report located at: Blanco-Valencia, X., De Gregorio-Vicente, O., Ruiz Iniesta, A., & Said-Hung, E. (2025). …"
-
14
-
15
-
16
Comparison analysis of computation time.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
17
Process flow diagram of CBFD.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
18
Precision recall curve.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
19
Fortran & C++: design fractal-type optical diffractive element
منشور في 2022"…</p> <p>(2) calculate diffraction fields for fractal and/or grid-matrix (binary) phase-holograms.</p> <p>(3) optimize the fractal and/or grid-matrix holograms for given target diffraction images, using annealing algorithms. …"
-
20