Conjoint Special Issue - Enabling Next Generation Structural Health Monitoring, Selected Papers from the 13th International Workshop on Structural Health Monitoring
A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Algorithms and Mathematical Models for Computer-Assisted Diagnostic Systems".
Deadline for manuscript submissions: closed (31 May 2022) | Viewed by 590
Special Issue Editor
Interests: structural health monitoring; condition monitoring; piezoelectric transducers; PZT; data science; wind turbines
Special Issues, Collections and Topics in MDPI journals
Special Issue Information
Dear Colleagues,
This conjoint Special Issue comprises extended and expanded versions of proceedings papers from the 13th International Workshop on Structural Health Monitoring (IWSHM), held on 7–9 December 2021 at Stanford University, CA. The IWSHM is the leading international conference in the field of structural health monitoring that aims to assess the current state-of-the-art technologies and to identify key breakthroughs and emerging R&D challenges that are critical to structural health monitoring; at the same time, its goal is to feature reviews of SHM growth in the last two decades and examine opportunities for future SHM research and applications.
The theme of 2021 IWSHM is "Enabling Next-Generation SHM for Cyber-Physical Systems." Papers in support of autonomous inspection or intelligent data-driven diagnostic systems and the Industry Internet of Things (IIOT) for preventive maintenance will be welcome in addition to general applications in aerospace, mechanical engineering, and civil infrastructure.
These papers will be peer-reviewed and published with the aim of providing rapid and wide dissemination of research results, advances, and applications.
Prof. Dr. Francesc Pozo
Guest Editor
Manuscript Submission Information
Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.
Benefits of Publishing in a Special Issue
- Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
- Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
- Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
- External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
- e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.
Further information on MDPI's Special Issue polices can be found here.
