Application of Dandelion Optimization Algorithm in Pattern Synthesis of Linear Antenna Arrays Article Swipe
Jianhui Li
,
Yan Liu
,
Wanru Zhao
,
TianNing Zhu
·
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.3390/math12071111
YOU?
·
· 2024
· Open Access
·
· DOI: https://doi.org/10.3390/math12071111
This paper introduces an application of the dandelion optimization (DO) algorithm in antenna arrays. This is the first time that the DO algorithm has been used for optimizing antenna arrays. For antenna array optimization, sidelobe level (SLL) and deep nulls are key technical indicators. A lower SLL can improve the signal-to-noise ratio and reduce the impact of clutter signals outside the main beam. Deep nulls need to be aligned with the direction of interference to eliminate the influence of interference sources. The combination of the two can effectively improve the anti-interference ability of the entire system. Therefore, antenna arrays with ultra-low sidelobes and ultra-deep nulls are currently hot in the field of antenna array design and are also some of the key technologies needed to achieve modern high-performance radar systems. As a new type of evolutionary algorithm inspired by nature, the DO algorithm is inspired by the wind propagation behavior of dandelions in nature. This algorithm iteratively updates the population from three stages of ascent, descent, and landing, ultimately finding the optimal position. It has good optimization ability in solving complex problems such as those involving nonlinearity, discreteness, and non-convexity, and the antenna array pattern synthesis optimization problem belongs to multivariate nonlinear problems. Therefore, the DO algorithm can be effectively applied in the field of antenna array optimization. In this work, we use the following method to obtain an optimized pattern of a linear array with the lowest sidelobe level (SLL), null placement in particular directions, and a lower notch in particular directions: by controlling the antenna array’s element spacing and leaving the phase unchanged to optimize the current amplitudes and by controlling the excitation current and phase fixation of the antenna array and changing the element spacing. In the first and second examples, different algorithms are used to reduce the SLL of the antenna. In the first example, the DO algorithm reduces the SLL to −33.37 dB, which is 2.67 dB, 2.67 dB, 3.77 dB, 2.74 dB, and 2.52 dB lower than five other algorithms. In the second example, the SLL optimized by the DO algorithm is −42.56 dB, which is 5.04 dB and 1.48 dB lower than two other algorithms. In both examples, the DO algorithm reduces the SLL lower than other algorithms when the main lobe of the antenna is not significantly widened. Examples 3, 4, and 5 use the DO algorithm to optimize the amplitude of the current, generating deep nulls and deep notches in specific directions. In Example 3, the DO algorithm obtains a depth of nulls equal to −187.6 dB, which is 66.7 dB and 44.3 dB lower than that of the flower pollination algorithm (FPA) and the chaotic colony predation algorithm (CCPA), respectively. In Example 4, the deep null obtained by the DO algorithm is as low as −98.69 dB, which is 6.67 dB lower than the deep null obtained by the grey wolf optimization (GWO) algorithm. In Example 5, the deep notch obtained by the DO algorithm is as low as −63.1 dB, which is 6.4 dB and 1.9 dB lower than the spider monkey optimization (SMO) algorithm and the grasshopper optimization algorithm (GOA), respectively. The data prove that the DO algorithm produces deeper nulls and notches than other algorithms. The last two examples involve reducing sidelobe levels and generating deep nulls by optimizing the spacing between elements. In Example 5, the SLL obtained using the DO algorithm is −22.8766 dB, which is 0.1998 dB lower than the lowest SLL of −22.6768 dB among other algorithms. In Example 6, the SLL obtained using the DO algorithm is −20.1012 dB, and the null depth is −125.1 dB, which is 1.592 dB lower than the SLL obtained by the cat swarm optimization (CSO) algorithm and 19.1 dB lower than the deep null obtained by the GWO algorithm, respectively. In summary, the results of six simulation experiments indicate that the DO algorithm has better optimization ability in linear array optimization than other evolutionary algorithms.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.3390/math12071111
- https://www.mdpi.com/2227-7390/12/7/1111/pdf?version=1712499915
- OA Status
- gold
- Cited By
- 12
- References
- 38
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4394576871
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4394576871Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.3390/math12071111Digital Object Identifier
- Title
-
Application of Dandelion Optimization Algorithm in Pattern Synthesis of Linear Antenna ArraysWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2024Year of publication
- Publication date
-
2024-04-07Full publication date if available
- Authors
-
Jianhui Li, Yan Liu, Wanru Zhao, TianNing ZhuList of authors in order
- Landing page
-
https://doi.org/10.3390/math12071111Publisher landing page
- PDF URL
-
https://www.mdpi.com/2227-7390/12/7/1111/pdf?version=1712499915Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://www.mdpi.com/2227-7390/12/7/1111/pdf?version=1712499915Direct OA link when available
- Concepts
-
Antenna array, Antenna (radio), Computer science, Algorithm, Interference (communication), Radiation pattern, Optimization problem, Beam pattern, Radar, Electronic engineering, Telecommunications, Engineering, Channel (broadcasting)Top concepts (fields/topics) attached by OpenAlex
- Cited by
-
12Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 9, 2024: 3Per-year citation counts (last 5 years)
- References (count)
-
38Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4394576871 |
|---|---|
| doi | https://doi.org/10.3390/math12071111 |
| ids.doi | https://doi.org/10.3390/math12071111 |
| ids.openalex | https://openalex.org/W4394576871 |
| fwci | 15.82927369 |
| type | article |
| title | Application of Dandelion Optimization Algorithm in Pattern Synthesis of Linear Antenna Arrays |
| biblio.issue | 7 |
| biblio.volume | 12 |
| biblio.last_page | 1111 |
| biblio.first_page | 1111 |
| topics[0].id | https://openalex.org/T11946 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9994999766349792 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2202 |
| topics[0].subfield.display_name | Aerospace Engineering |
| topics[0].display_name | Antenna Design and Optimization |
| topics[1].id | https://openalex.org/T13965 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9526000022888184 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2206 |
| topics[1].subfield.display_name | Computational Mechanics |
| topics[1].display_name | Laser and Thermal Forming Techniques |
| topics[2].id | https://openalex.org/T10262 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.9352999925613403 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2208 |
| topics[2].subfield.display_name | Electrical and Electronic Engineering |
| topics[2].display_name | Microwave Engineering and Waveguides |
| is_xpac | False |
| apc_list.value | 1800 |
| apc_list.currency | CHF |
| apc_list.value_usd | 1949 |
| apc_paid.value | 1800 |
| apc_paid.currency | CHF |
| apc_paid.value_usd | 1949 |
| concepts[0].id | https://openalex.org/C62191587 |
| concepts[0].level | 3 |
| concepts[0].score | 0.5960522890090942 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q4771249 |
| concepts[0].display_name | Antenna array |
| concepts[1].id | https://openalex.org/C21822782 |
| concepts[1].level | 2 |
| concepts[1].score | 0.5814750790596008 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q131214 |
| concepts[1].display_name | Antenna (radio) |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.5336233973503113 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C11413529 |
| concepts[3].level | 1 |
| concepts[3].score | 0.48772796988487244 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[3].display_name | Algorithm |
| concepts[4].id | https://openalex.org/C32022120 |
| concepts[4].level | 3 |
| concepts[4].score | 0.48128265142440796 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q797225 |
| concepts[4].display_name | Interference (communication) |
| concepts[5].id | https://openalex.org/C151764478 |
| concepts[5].level | 3 |
| concepts[5].score | 0.47222900390625 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q571921 |
| concepts[5].display_name | Radiation pattern |
| concepts[6].id | https://openalex.org/C137836250 |
| concepts[6].level | 2 |
| concepts[6].score | 0.4616028666496277 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q984063 |
| concepts[6].display_name | Optimization problem |
| concepts[7].id | https://openalex.org/C2988395205 |
| concepts[7].level | 3 |
| concepts[7].score | 0.4241161346435547 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q571921 |
| concepts[7].display_name | Beam pattern |
| concepts[8].id | https://openalex.org/C554190296 |
| concepts[8].level | 2 |
| concepts[8].score | 0.4125223159790039 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q47528 |
| concepts[8].display_name | Radar |
| concepts[9].id | https://openalex.org/C24326235 |
| concepts[9].level | 1 |
| concepts[9].score | 0.3478996753692627 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q126095 |
| concepts[9].display_name | Electronic engineering |
| concepts[10].id | https://openalex.org/C76155785 |
| concepts[10].level | 1 |
| concepts[10].score | 0.2779579162597656 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q418 |
| concepts[10].display_name | Telecommunications |
| concepts[11].id | https://openalex.org/C127413603 |
| concepts[11].level | 0 |
| concepts[11].score | 0.261598140001297 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[11].display_name | Engineering |
| concepts[12].id | https://openalex.org/C127162648 |
| concepts[12].level | 2 |
| concepts[12].score | 0.07892954349517822 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q16858953 |
| concepts[12].display_name | Channel (broadcasting) |
| keywords[0].id | https://openalex.org/keywords/antenna-array |
| keywords[0].score | 0.5960522890090942 |
| keywords[0].display_name | Antenna array |
| keywords[1].id | https://openalex.org/keywords/antenna |
| keywords[1].score | 0.5814750790596008 |
| keywords[1].display_name | Antenna (radio) |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.5336233973503113 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/algorithm |
| keywords[3].score | 0.48772796988487244 |
| keywords[3].display_name | Algorithm |
| keywords[4].id | https://openalex.org/keywords/interference |
| keywords[4].score | 0.48128265142440796 |
| keywords[4].display_name | Interference (communication) |
| keywords[5].id | https://openalex.org/keywords/radiation-pattern |
| keywords[5].score | 0.47222900390625 |
| keywords[5].display_name | Radiation pattern |
| keywords[6].id | https://openalex.org/keywords/optimization-problem |
| keywords[6].score | 0.4616028666496277 |
| keywords[6].display_name | Optimization problem |
| keywords[7].id | https://openalex.org/keywords/beam-pattern |
| keywords[7].score | 0.4241161346435547 |
| keywords[7].display_name | Beam pattern |
| keywords[8].id | https://openalex.org/keywords/radar |
| keywords[8].score | 0.4125223159790039 |
| keywords[8].display_name | Radar |
| keywords[9].id | https://openalex.org/keywords/electronic-engineering |
| keywords[9].score | 0.3478996753692627 |
| keywords[9].display_name | Electronic engineering |
| keywords[10].id | https://openalex.org/keywords/telecommunications |
| keywords[10].score | 0.2779579162597656 |
| keywords[10].display_name | Telecommunications |
| keywords[11].id | https://openalex.org/keywords/engineering |
| keywords[11].score | 0.261598140001297 |
| keywords[11].display_name | Engineering |
| keywords[12].id | https://openalex.org/keywords/channel |
| keywords[12].score | 0.07892954349517822 |
| keywords[12].display_name | Channel (broadcasting) |
| language | en |
| locations[0].id | doi:10.3390/math12071111 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4210192031 |
| locations[0].source.issn | 2227-7390 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2227-7390 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | True |
| locations[0].source.display_name | Mathematics |
| locations[0].source.host_organization | https://openalex.org/P4310310987 |
| locations[0].source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310310987 |
| locations[0].source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://www.mdpi.com/2227-7390/12/7/1111/pdf?version=1712499915 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Mathematics |
| locations[0].landing_page_url | https://doi.org/10.3390/math12071111 |
| locations[1].id | pmh:oai:doaj.org/article:838ea6668c7f4743aa7bb3c6a778d6fa |
| locations[1].is_oa | False |
| locations[1].source.id | https://openalex.org/S4306401280 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | DOAJ (DOAJ: Directory of Open Access Journals) |
| locations[1].source.host_organization | |
| locations[1].source.host_organization_name | |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | Mathematics, Vol 12, Iss 7, p 1111 (2024) |
| locations[1].landing_page_url | https://doaj.org/article/838ea6668c7f4743aa7bb3c6a778d6fa |
| indexed_in | crossref, doaj |
| authorships[0].author.id | https://openalex.org/A5100372603 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-5256-8421 |
| authorships[0].author.display_name | Jianhui Li |
| authorships[0].countries | CN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I120825670 |
| authorships[0].affiliations[0].raw_affiliation_string | School of Physics and Electronic Information, Yunnan Normal University, Kunming 650500, China |
| authorships[0].institutions[0].id | https://openalex.org/I120825670 |
| authorships[0].institutions[0].ror | https://ror.org/00sc9n023 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I120825670 |
| authorships[0].institutions[0].country_code | CN |
| authorships[0].institutions[0].display_name | Yunnan Normal University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Jianhui Li |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | School of Physics and Electronic Information, Yunnan Normal University, Kunming 650500, China |
| authorships[1].author.id | https://openalex.org/A5100351086 |
| authorships[1].author.orcid | https://orcid.org/0009-0002-6765-4589 |
| authorships[1].author.display_name | Yan Liu |
| authorships[1].countries | CN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I120825670 |
| authorships[1].affiliations[0].raw_affiliation_string | School of Physics and Electronic Information, Yunnan Normal University, Kunming 650500, China |
| authorships[1].institutions[0].id | https://openalex.org/I120825670 |
| authorships[1].institutions[0].ror | https://ror.org/00sc9n023 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I120825670 |
| authorships[1].institutions[0].country_code | CN |
| authorships[1].institutions[0].display_name | Yunnan Normal University |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Yan Liu |
| authorships[1].is_corresponding | True |
| authorships[1].raw_affiliation_strings | School of Physics and Electronic Information, Yunnan Normal University, Kunming 650500, China |
| authorships[2].author.id | https://openalex.org/A5103050720 |
| authorships[2].author.orcid | https://orcid.org/0009-0004-4515-5580 |
| authorships[2].author.display_name | Wanru Zhao |
| authorships[2].countries | CN |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I120825670 |
| authorships[2].affiliations[0].raw_affiliation_string | School of Physics and Electronic Information, Yunnan Normal University, Kunming 650500, China |
| authorships[2].institutions[0].id | https://openalex.org/I120825670 |
| authorships[2].institutions[0].ror | https://ror.org/00sc9n023 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I120825670 |
| authorships[2].institutions[0].country_code | CN |
| authorships[2].institutions[0].display_name | Yunnan Normal University |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Wanru Zhao |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | School of Physics and Electronic Information, Yunnan Normal University, Kunming 650500, China |
| authorships[3].author.id | https://openalex.org/A5101231546 |
| authorships[3].author.orcid | |
| authorships[3].author.display_name | TianNing Zhu |
| authorships[3].countries | CN |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I120825670 |
| authorships[3].affiliations[0].raw_affiliation_string | School of Physics and Electronic Information, Yunnan Normal University, Kunming 650500, China |
| authorships[3].institutions[0].id | https://openalex.org/I120825670 |
| authorships[3].institutions[0].ror | https://ror.org/00sc9n023 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I120825670 |
| authorships[3].institutions[0].country_code | CN |
| authorships[3].institutions[0].display_name | Yunnan Normal University |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Tianning Zhu |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | School of Physics and Electronic Information, Yunnan Normal University, Kunming 650500, China |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.mdpi.com/2227-7390/12/7/1111/pdf?version=1712499915 |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Application of Dandelion Optimization Algorithm in Pattern Synthesis of Linear Antenna Arrays |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T11946 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9994999766349792 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2202 |
| primary_topic.subfield.display_name | Aerospace Engineering |
| primary_topic.display_name | Antenna Design and Optimization |
| related_works | https://openalex.org/W4220699065, https://openalex.org/W2375658941, https://openalex.org/W4361251007, https://openalex.org/W2587873745, https://openalex.org/W2376364482, https://openalex.org/W2185261797, https://openalex.org/W2068570549, https://openalex.org/W4226058649, https://openalex.org/W2355070585, https://openalex.org/W2602804851 |
| cited_by_count | 12 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 9 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 3 |
| locations_count | 2 |
| best_oa_location.id | doi:10.3390/math12071111 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4210192031 |
| best_oa_location.source.issn | 2227-7390 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2227-7390 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | True |
| best_oa_location.source.display_name | Mathematics |
| best_oa_location.source.host_organization | https://openalex.org/P4310310987 |
| best_oa_location.source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310310987 |
| best_oa_location.source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://www.mdpi.com/2227-7390/12/7/1111/pdf?version=1712499915 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Mathematics |
| best_oa_location.landing_page_url | https://doi.org/10.3390/math12071111 |
| primary_location.id | doi:10.3390/math12071111 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4210192031 |
| primary_location.source.issn | 2227-7390 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2227-7390 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | True |
| primary_location.source.display_name | Mathematics |
| primary_location.source.host_organization | https://openalex.org/P4310310987 |
| primary_location.source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310310987 |
| primary_location.source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://www.mdpi.com/2227-7390/12/7/1111/pdf?version=1712499915 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Mathematics |
| primary_location.landing_page_url | https://doi.org/10.3390/math12071111 |
| publication_date | 2024-04-07 |
| publication_year | 2024 |
| referenced_works | https://openalex.org/W2916966516, https://openalex.org/W2339966425, https://openalex.org/W2975494384, https://openalex.org/W2793731433, https://openalex.org/W3023355711, https://openalex.org/W4221037957, https://openalex.org/W4206385679, https://openalex.org/W3089128151, https://openalex.org/W2602348733, https://openalex.org/W2154929945, https://openalex.org/W2152195021, https://openalex.org/W1595159159, https://openalex.org/W2014565368, https://openalex.org/W2099855707, https://openalex.org/W2324911657, https://openalex.org/W2123388266, https://openalex.org/W1585337363, https://openalex.org/W2789250272, https://openalex.org/W2016706055, https://openalex.org/W2151554678, https://openalex.org/W4285585607, https://openalex.org/W2010059576, https://openalex.org/W6690137439, https://openalex.org/W1977690098, https://openalex.org/W2909029697, https://openalex.org/W2168907715, https://openalex.org/W2104863478, https://openalex.org/W2026191794, https://openalex.org/W2506542142, https://openalex.org/W2262215759, https://openalex.org/W2965078169, https://openalex.org/W2484546859, https://openalex.org/W4386388688, https://openalex.org/W2340506370, https://openalex.org/W3001885470, https://openalex.org/W3174441041, https://openalex.org/W2066986651, https://openalex.org/W2239924092 |
| referenced_works_count | 38 |
| abstract_inverted_index.5 | 390 |
| abstract_inverted_index.A | 44 |
| abstract_inverted_index.a | 131, 232, 247, 418 |
| abstract_inverted_index.3, | 387, 413 |
| abstract_inverted_index.4, | 388, 452 |
| abstract_inverted_index.5, | 486, 558 |
| abstract_inverted_index.6, | 586 |
| abstract_inverted_index.As | 130 |
| abstract_inverted_index.DO | 21, 141, 205, 310, 345, 366, 393, 415, 459, 493, 528, 564, 592, 645 |
| abstract_inverted_index.In | 218, 288, 305, 336, 362, 411, 450, 484, 556, 584, 634 |
| abstract_inverted_index.It | 173 |
| abstract_inverted_index.an | 3, 228 |
| abstract_inverted_index.as | 183, 462, 464, 496, 498 |
| abstract_inverted_index.be | 67, 208 |
| abstract_inverted_index.by | 138, 145, 253, 271, 343, 457, 477, 491, 550, 613, 629 |
| abstract_inverted_index.dB | 330, 353, 356, 429, 432, 470, 504, 507, 572, 580, 607, 622 |
| abstract_inverted_index.in | 11, 108, 152, 178, 211, 243, 250, 408, 651 |
| abstract_inverted_index.is | 15, 143, 319, 347, 351, 382, 427, 461, 468, 495, 502, 566, 570, 594, 601, 605 |
| abstract_inverted_index.of | 5, 56, 72, 78, 83, 92, 111, 119, 134, 150, 163, 214, 231, 279, 302, 379, 399, 420, 436, 578, 638 |
| abstract_inverted_index.to | 66, 74, 124, 199, 226, 265, 298, 315, 395, 423 |
| abstract_inverted_index.we | 221 |
| abstract_inverted_index.1.9 | 506 |
| abstract_inverted_index.6.4 | 503 |
| abstract_inverted_index.For | 30 |
| abstract_inverted_index.GWO | 631 |
| abstract_inverted_index.SLL | 46, 301, 314, 341, 370, 560, 577, 588, 611 |
| abstract_inverted_index.The | 81, 523, 538 |
| abstract_inverted_index.and | 37, 52, 102, 115, 166, 188, 190, 246, 260, 270, 276, 283, 291, 328, 354, 389, 405, 430, 442, 505, 516, 533, 546, 597, 620 |
| abstract_inverted_index.are | 40, 105, 116, 296 |
| abstract_inverted_index.can | 47, 86, 207 |
| abstract_inverted_index.cat | 615 |
| abstract_inverted_index.dB, | 317, 321, 323, 325, 327, 349, 425, 466, 500, 568, 596, 603 |
| abstract_inverted_index.for | 26 |
| abstract_inverted_index.has | 23, 174, 647 |
| abstract_inverted_index.hot | 107 |
| abstract_inverted_index.key | 41, 121 |
| abstract_inverted_index.low | 463, 497 |
| abstract_inverted_index.new | 132 |
| abstract_inverted_index.not | 383 |
| abstract_inverted_index.six | 639 |
| abstract_inverted_index.the | 6, 16, 20, 49, 54, 60, 70, 76, 84, 89, 93, 109, 120, 140, 146, 158, 170, 191, 204, 212, 223, 236, 255, 262, 267, 273, 280, 285, 289, 300, 303, 306, 309, 313, 337, 340, 344, 365, 369, 376, 380, 392, 397, 400, 414, 437, 443, 453, 458, 473, 478, 487, 492, 510, 517, 527, 552, 559, 563, 575, 587, 591, 598, 610, 614, 625, 630, 636, 644 |
| abstract_inverted_index.two | 85, 359, 540 |
| abstract_inverted_index.use | 222, 391 |
| abstract_inverted_index.(DO) | 9 |
| abstract_inverted_index.1.48 | 355 |
| abstract_inverted_index.19.1 | 621 |
| abstract_inverted_index.2.52 | 329 |
| abstract_inverted_index.2.67 | 320, 322 |
| abstract_inverted_index.2.74 | 326 |
| abstract_inverted_index.3.77 | 324 |
| abstract_inverted_index.44.3 | 431 |
| abstract_inverted_index.5.04 | 352 |
| abstract_inverted_index.6.67 | 469 |
| abstract_inverted_index.66.7 | 428 |
| abstract_inverted_index.Deep | 63 |
| abstract_inverted_index.This | 0, 14, 154 |
| abstract_inverted_index.also | 117 |
| abstract_inverted_index.been | 24 |
| abstract_inverted_index.both | 363 |
| abstract_inverted_index.data | 524 |
| abstract_inverted_index.deep | 38, 403, 406, 454, 474, 488, 548, 626 |
| abstract_inverted_index.five | 333 |
| abstract_inverted_index.from | 160 |
| abstract_inverted_index.good | 175 |
| abstract_inverted_index.grey | 479 |
| abstract_inverted_index.last | 539 |
| abstract_inverted_index.lobe | 378 |
| abstract_inverted_index.main | 61, 377 |
| abstract_inverted_index.need | 65 |
| abstract_inverted_index.null | 241, 455, 475, 599, 627 |
| abstract_inverted_index.some | 118 |
| abstract_inverted_index.such | 182 |
| abstract_inverted_index.than | 332, 358, 372, 434, 472, 509, 535, 574, 609, 624, 655 |
| abstract_inverted_index.that | 19, 435, 526, 643 |
| abstract_inverted_index.this | 219 |
| abstract_inverted_index.time | 18 |
| abstract_inverted_index.type | 133 |
| abstract_inverted_index.used | 25, 297 |
| abstract_inverted_index.when | 375 |
| abstract_inverted_index.wind | 147 |
| abstract_inverted_index.with | 69, 99, 235 |
| abstract_inverted_index.wolf | 480 |
| abstract_inverted_index.(CSO) | 618 |
| abstract_inverted_index.(FPA) | 441 |
| abstract_inverted_index.(GWO) | 482 |
| abstract_inverted_index.(SLL) | 36 |
| abstract_inverted_index.(SMO) | 514 |
| abstract_inverted_index.1.592 | 606 |
| abstract_inverted_index.among | 581 |
| abstract_inverted_index.array | 32, 113, 193, 216, 234, 282, 653 |
| abstract_inverted_index.beam. | 62 |
| abstract_inverted_index.depth | 419, 600 |
| abstract_inverted_index.equal | 422 |
| abstract_inverted_index.field | 110, 213 |
| abstract_inverted_index.first | 17, 290, 307 |
| abstract_inverted_index.level | 35, 239 |
| abstract_inverted_index.lower | 45, 248, 331, 357, 371, 433, 471, 508, 573, 608, 623 |
| abstract_inverted_index.notch | 249, 489 |
| abstract_inverted_index.nulls | 39, 64, 104, 404, 421, 532, 549 |
| abstract_inverted_index.other | 334, 360, 373, 536, 582, 656 |
| abstract_inverted_index.paper | 1 |
| abstract_inverted_index.phase | 263, 277 |
| abstract_inverted_index.prove | 525 |
| abstract_inverted_index.radar | 128 |
| abstract_inverted_index.ratio | 51 |
| abstract_inverted_index.swarm | 616 |
| abstract_inverted_index.those | 184 |
| abstract_inverted_index.three | 161 |
| abstract_inverted_index.using | 562, 590 |
| abstract_inverted_index.which | 318, 350, 426, 467, 501, 569, 604 |
| abstract_inverted_index.work, | 220 |
| abstract_inverted_index.(GOA), | 521 |
| abstract_inverted_index.(SLL), | 240 |
| abstract_inverted_index.0.1998 | 571 |
| abstract_inverted_index.arrays | 98 |
| abstract_inverted_index.better | 648 |
| abstract_inverted_index.colony | 445 |
| abstract_inverted_index.deeper | 531 |
| abstract_inverted_index.design | 114 |
| abstract_inverted_index.entire | 94 |
| abstract_inverted_index.flower | 438 |
| abstract_inverted_index.impact | 55 |
| abstract_inverted_index.levels | 545 |
| abstract_inverted_index.linear | 233, 652 |
| abstract_inverted_index.lowest | 237, 576 |
| abstract_inverted_index.method | 225 |
| abstract_inverted_index.modern | 126 |
| abstract_inverted_index.monkey | 512 |
| abstract_inverted_index.needed | 123 |
| abstract_inverted_index.obtain | 227 |
| abstract_inverted_index.reduce | 53, 299 |
| abstract_inverted_index.second | 292, 338 |
| abstract_inverted_index.spider | 511 |
| abstract_inverted_index.stages | 162 |
| abstract_inverted_index.(CCPA), | 448 |
| abstract_inverted_index.Example | 412, 451, 485, 557, 585 |
| abstract_inverted_index.ability | 91, 177, 650 |
| abstract_inverted_index.achieve | 125 |
| abstract_inverted_index.aligned | 68 |
| abstract_inverted_index.antenna | 12, 28, 31, 97, 112, 192, 215, 256, 281, 381 |
| abstract_inverted_index.applied | 210 |
| abstract_inverted_index.arrays. | 13, 29 |
| abstract_inverted_index.ascent, | 164 |
| abstract_inverted_index.belongs | 198 |
| abstract_inverted_index.between | 554 |
| abstract_inverted_index.chaotic | 444 |
| abstract_inverted_index.clutter | 57 |
| abstract_inverted_index.complex | 180 |
| abstract_inverted_index.current | 268, 275 |
| abstract_inverted_index.element | 258, 286 |
| abstract_inverted_index.finding | 169 |
| abstract_inverted_index.improve | 48, 88 |
| abstract_inverted_index.involve | 542 |
| abstract_inverted_index.leaving | 261 |
| abstract_inverted_index.nature, | 139 |
| abstract_inverted_index.nature. | 153 |
| abstract_inverted_index.notches | 407, 534 |
| abstract_inverted_index.obtains | 417 |
| abstract_inverted_index.optimal | 171 |
| abstract_inverted_index.outside | 59 |
| abstract_inverted_index.pattern | 194, 230 |
| abstract_inverted_index.problem | 197 |
| abstract_inverted_index.reduces | 312, 368 |
| abstract_inverted_index.results | 637 |
| abstract_inverted_index.signals | 58 |
| abstract_inverted_index.solving | 179 |
| abstract_inverted_index.spacing | 259, 553 |
| abstract_inverted_index.system. | 95 |
| abstract_inverted_index.updates | 157 |
| abstract_inverted_index.−63.1 | 499 |
| abstract_inverted_index.Examples | 386 |
| abstract_inverted_index.antenna. | 304 |
| abstract_inverted_index.behavior | 149 |
| abstract_inverted_index.changing | 284 |
| abstract_inverted_index.current, | 401 |
| abstract_inverted_index.descent, | 165 |
| abstract_inverted_index.example, | 308, 339 |
| abstract_inverted_index.examples | 541 |
| abstract_inverted_index.fixation | 278 |
| abstract_inverted_index.indicate | 642 |
| abstract_inverted_index.inspired | 137, 144 |
| abstract_inverted_index.landing, | 167 |
| abstract_inverted_index.obtained | 456, 476, 490, 561, 589, 612, 628 |
| abstract_inverted_index.optimize | 266, 396 |
| abstract_inverted_index.problems | 181 |
| abstract_inverted_index.produces | 530 |
| abstract_inverted_index.reducing | 543 |
| abstract_inverted_index.sidelobe | 34, 238, 544 |
| abstract_inverted_index.sources. | 80 |
| abstract_inverted_index.spacing. | 287 |
| abstract_inverted_index.specific | 409 |
| abstract_inverted_index.summary, | 635 |
| abstract_inverted_index.systems. | 129 |
| abstract_inverted_index.widened. | 385 |
| abstract_inverted_index.−125.1 | 602 |
| abstract_inverted_index.−187.6 | 424 |
| abstract_inverted_index.−33.37 | 316 |
| abstract_inverted_index.−42.56 | 348 |
| abstract_inverted_index.−98.69 | 465 |
| abstract_inverted_index.algorithm | 10, 22, 136, 142, 155, 206, 311, 346, 367, 394, 416, 440, 447, 460, 494, 515, 520, 529, 565, 593, 619, 646 |
| abstract_inverted_index.amplitude | 398 |
| abstract_inverted_index.array’s | 257 |
| abstract_inverted_index.currently | 106 |
| abstract_inverted_index.dandelion | 7 |
| abstract_inverted_index.different | 294 |
| abstract_inverted_index.direction | 71 |
| abstract_inverted_index.elements. | 555 |
| abstract_inverted_index.eliminate | 75 |
| abstract_inverted_index.examples, | 293, 364 |
| abstract_inverted_index.following | 224 |
| abstract_inverted_index.influence | 77 |
| abstract_inverted_index.involving | 185 |
| abstract_inverted_index.nonlinear | 201 |
| abstract_inverted_index.optimized | 229, 342 |
| abstract_inverted_index.placement | 242 |
| abstract_inverted_index.position. | 172 |
| abstract_inverted_index.predation | 446 |
| abstract_inverted_index.problems. | 202 |
| abstract_inverted_index.sidelobes | 101 |
| abstract_inverted_index.synthesis | 195 |
| abstract_inverted_index.technical | 42 |
| abstract_inverted_index.ultra-low | 100 |
| abstract_inverted_index.unchanged | 264 |
| abstract_inverted_index.Therefore, | 96, 203 |
| abstract_inverted_index.algorithm, | 632 |
| abstract_inverted_index.algorithm. | 483 |
| abstract_inverted_index.algorithms | 295, 374 |
| abstract_inverted_index.amplitudes | 269 |
| abstract_inverted_index.dandelions | 151 |
| abstract_inverted_index.excitation | 274 |
| abstract_inverted_index.generating | 402, 547 |
| abstract_inverted_index.introduces | 2 |
| abstract_inverted_index.optimizing | 27, 551 |
| abstract_inverted_index.particular | 244, 251 |
| abstract_inverted_index.population | 159 |
| abstract_inverted_index.simulation | 640 |
| abstract_inverted_index.ultimately | 168 |
| abstract_inverted_index.ultra-deep | 103 |
| abstract_inverted_index.−20.1012 | 595 |
| abstract_inverted_index.−22.6768 | 579 |
| abstract_inverted_index.−22.8766 | 567 |
| abstract_inverted_index.algorithms. | 335, 361, 537, 583, 658 |
| abstract_inverted_index.application | 4 |
| abstract_inverted_index.combination | 82 |
| abstract_inverted_index.controlling | 254, 272 |
| abstract_inverted_index.directions, | 245 |
| abstract_inverted_index.directions. | 410 |
| abstract_inverted_index.directions: | 252 |
| abstract_inverted_index.effectively | 87, 209 |
| abstract_inverted_index.experiments | 641 |
| abstract_inverted_index.grasshopper | 518 |
| abstract_inverted_index.indicators. | 43 |
| abstract_inverted_index.iteratively | 156 |
| abstract_inverted_index.pollination | 439 |
| abstract_inverted_index.propagation | 148 |
| abstract_inverted_index.evolutionary | 135, 657 |
| abstract_inverted_index.interference | 73, 79 |
| abstract_inverted_index.multivariate | 200 |
| abstract_inverted_index.optimization | 8, 176, 196, 481, 513, 519, 617, 649, 654 |
| abstract_inverted_index.technologies | 122 |
| abstract_inverted_index.discreteness, | 187 |
| abstract_inverted_index.nonlinearity, | 186 |
| abstract_inverted_index.optimization, | 33 |
| abstract_inverted_index.optimization. | 217 |
| abstract_inverted_index.respectively. | 449, 522, 633 |
| abstract_inverted_index.significantly | 384 |
| abstract_inverted_index.non-convexity, | 189 |
| abstract_inverted_index.signal-to-noise | 50 |
| abstract_inverted_index.high-performance | 127 |
| abstract_inverted_index.anti-interference | 90 |
| cited_by_percentile_year.max | 99 |
| cited_by_percentile_year.min | 96 |
| corresponding_author_ids | https://openalex.org/A5100351086 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 4 |
| corresponding_institution_ids | https://openalex.org/I120825670 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/7 |
| sustainable_development_goals[0].score | 0.8799999952316284 |
| sustainable_development_goals[0].display_name | Affordable and clean energy |
| citation_normalized_percentile.value | 0.98461548 |
| citation_normalized_percentile.is_in_top_1_percent | True |
| citation_normalized_percentile.is_in_top_10_percent | True |