Samuel Chukwuemeka Olisa, Muhammad A. Khan, Andrew Starr
Human health monitoring (HHM) is essential for continued daily task execution, as is structural health monitoring (SHM) for structures to ensure the continual performance of their designed tasks with optimal efficiency. The existence of damage in a structure affects its optimal use through stiffness deterioration. Damage of different forms could occur in a structure but have the singular objective of material degradation, leading to its underuse for a task. Guided wave ultrasonics has shown strength in detecting sundry damage in structures, but most of the damage monitored and detected is unfilled with substances. However, some damage could trap and accumulate substances that could hasten material degradation through corrosion activities under favorable conditions, especially in the oil and gas industry. This study used the ultrasonic-guided waves’ pitch–catch inspection technique to identify damage filled with different materials. The assessment was based on the RMSD of the dominant Lamb wave mode’s average maximum amplitude and the response signals’ transmission coefficient (TC). A five-cycle tone burst of excitation signals of different frequencies was created to generate propagating Lamb waves in the structure. The fundamental antisymmetric mode was found to be more sensitive than the fundamental symmetric mode when detecting damage filled with various substances. At 80 kHz, the deviation of the current response signals from the baseline response signals due to different filled substances in the damage was distinct and decreased with increased fluid viscosity. Given that structures in the oil and gas sector are particularly susceptible to substance-induced damage, the outcomes of this study are paramount.
{"title":"Elastic Wave Mechanics in Damaged Metallic Plates","authors":"Samuel Chukwuemeka Olisa, Muhammad A. Khan, Andrew Starr","doi":"10.3390/sym15111989","DOIUrl":"https://doi.org/10.3390/sym15111989","url":null,"abstract":"Human health monitoring (HHM) is essential for continued daily task execution, as is structural health monitoring (SHM) for structures to ensure the continual performance of their designed tasks with optimal efficiency. The existence of damage in a structure affects its optimal use through stiffness deterioration. Damage of different forms could occur in a structure but have the singular objective of material degradation, leading to its underuse for a task. Guided wave ultrasonics has shown strength in detecting sundry damage in structures, but most of the damage monitored and detected is unfilled with substances. However, some damage could trap and accumulate substances that could hasten material degradation through corrosion activities under favorable conditions, especially in the oil and gas industry. This study used the ultrasonic-guided waves’ pitch–catch inspection technique to identify damage filled with different materials. The assessment was based on the RMSD of the dominant Lamb wave mode’s average maximum amplitude and the response signals’ transmission coefficient (TC). A five-cycle tone burst of excitation signals of different frequencies was created to generate propagating Lamb waves in the structure. The fundamental antisymmetric mode was found to be more sensitive than the fundamental symmetric mode when detecting damage filled with various substances. At 80 kHz, the deviation of the current response signals from the baseline response signals due to different filled substances in the damage was distinct and decreased with increased fluid viscosity. Given that structures in the oil and gas sector are particularly susceptible to substance-induced damage, the outcomes of this study are paramount.","PeriodicalId":48874,"journal":{"name":"Symmetry-Basel","volume":"214 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136316466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The maximum clique problem is a problem that takes many forms in optimization and related graph theory problems, and also has many applications. Because of its NP-completeness (nondeterministic polynomial time), the question arises of its solvability for larger instances. Instead of the traditional approaches based on the use of approximate or stochastic heuristic methods, we focus here on the use of integer programming models in the GAMS (General Algebraic Modelling System) environment, which is based on exact methods and sophisticated deterministic heuristics incorporated in it. We propose modifications of integer models, derive their time complexities and show their direct use in GAMS. GAMS makes it possible to find optimal solutions to the maximum clique problem for instances with hundreds of vertices and thousands of edges within minutes at most. For extremely large instances, good approximations of the optimum are given in a reasonable amount of time. A great advantage of this approach over all the mentioned algorithms is that even if GAMS does not find the best known solution within the chosen time limit, it displays its value at the end of the calculation as a reachable bound.
{"title":"The Maximum Clique Problem and Integer Programming Models, Their Modifications, Complexity and Implementation","authors":"Milos Seda","doi":"10.3390/sym15111979","DOIUrl":"https://doi.org/10.3390/sym15111979","url":null,"abstract":"The maximum clique problem is a problem that takes many forms in optimization and related graph theory problems, and also has many applications. Because of its NP-completeness (nondeterministic polynomial time), the question arises of its solvability for larger instances. Instead of the traditional approaches based on the use of approximate or stochastic heuristic methods, we focus here on the use of integer programming models in the GAMS (General Algebraic Modelling System) environment, which is based on exact methods and sophisticated deterministic heuristics incorporated in it. We propose modifications of integer models, derive their time complexities and show their direct use in GAMS. GAMS makes it possible to find optimal solutions to the maximum clique problem for instances with hundreds of vertices and thousands of edges within minutes at most. For extremely large instances, good approximations of the optimum are given in a reasonable amount of time. A great advantage of this approach over all the mentioned algorithms is that even if GAMS does not find the best known solution within the chosen time limit, it displays its value at the end of the calculation as a reachable bound.","PeriodicalId":48874,"journal":{"name":"Symmetry-Basel","volume":"12 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134907498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Georgia Irina Oros, Gheorghe Oros, Daniela Andrada Bardac-Vlada
The study presented in this paper follows a line of research familiar for Geometric Function Theory, which consists in defining new integral operators and conducting studies for revealing certain geometric properties of those integral operators such as univalence, starlikness, or convexity. The present research focuses on the Bessel function of the first kind and order ν unveiling the conditions for this function to be univalent and further using its univalent form in order to define a new integral operator on the space of holomorphic functions. For particular values of the parameters implicated in the definition of the new integral operator involving the Bessel function of the first kind, the well-known Alexander, Libera, and Bernardi integral operators can be obtained. In the first part of the study, necessary and sufficient conditions are obtained for the Bessel function of the first kind and order ν to be a starlike function or starlike of order α∈[0,1). The renowned prolific method of differential subordination due to Sanford S. Miller and Petru T. Mocanu is employed in the reasoning. In the second part of the study, the outcome of the first part is applied in order to introduce the new integral operator involving the form of the Bessel function of the first kind, which is starlike. Further investigations disclose the necessary and sufficient conditions for this new integral operator to be starlike or starlike of order 12.
本文提出的研究遵循了几何函数理论的研究路线，包括定义新的积分算子，并进行研究，以揭示这些积分算子的某些几何性质，如一元性、星形性或凸性。本文研究了第一类和阶的贝塞尔函数，揭示了该函数为一元的条件，并进一步利用其一元形式在全纯函数空间上定义了一个新的积分算子。对于包含第一类贝塞尔函数的新积分算子的定义中所包含的参数的特定值，可以得到著名的Alexander、Libera和Bernardi积分算子。在研究的第一部分中，得到了第一类和阶ν的Bessel函数是一个星形函数或阶α∈[0,1]的星形函数的充分必要条件。在推理中采用了Sanford S. Miller和Petru T. Mocanu著名的多产的差别从属方法。在第二部分的研究中，应用第一部分的结果，引入新的积分算子，涉及第一类贝塞尔函数的星形形式。进一步的研究揭示了这个新的积分算子是星形或12阶星形的充要条件。
{"title":"Study on the Criteria for Starlikeness in Integral Operators Involving Bessel Functions","authors":"Georgia Irina Oros, Gheorghe Oros, Daniela Andrada Bardac-Vlada","doi":"10.3390/sym15111976","DOIUrl":"https://doi.org/10.3390/sym15111976","url":null,"abstract":"The study presented in this paper follows a line of research familiar for Geometric Function Theory, which consists in defining new integral operators and conducting studies for revealing certain geometric properties of those integral operators such as univalence, starlikness, or convexity. The present research focuses on the Bessel function of the first kind and order ν unveiling the conditions for this function to be univalent and further using its univalent form in order to define a new integral operator on the space of holomorphic functions. For particular values of the parameters implicated in the definition of the new integral operator involving the Bessel function of the first kind, the well-known Alexander, Libera, and Bernardi integral operators can be obtained. In the first part of the study, necessary and sufficient conditions are obtained for the Bessel function of the first kind and order ν to be a starlike function or starlike of order α∈[0,1). The renowned prolific method of differential subordination due to Sanford S. Miller and Petru T. Mocanu is employed in the reasoning. In the second part of the study, the outcome of the first part is applied in order to introduce the new integral operator involving the form of the Bessel function of the first kind, which is starlike. Further investigations disclose the necessary and sufficient conditions for this new integral operator to be starlike or starlike of order 12.","PeriodicalId":48874,"journal":{"name":"Symmetry-Basel","volume":"3 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134909244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In our ongoing study, we explore the concepts of I3-Cauchy and I3-Cauchy for triple sequences in the context of random 2-normed spaces (RTNS). Moreover, we introduce and analyze the notions of I3-convergence, I3-convergence, I3-limit points, and I3-cluster points for random 2-normed triple sequences. Significantly, we establish a notable finding that elucidates the connection between I3-convergence and I3-convergence within the framework of random 2-normed spaces, highlighting their interrelation. Additionally, we provide an illuminating example that demonstrates how I3-convergence in a random 2-normed space might not necessarily imply I3-convergence. Our observations underscore the importance of condition (AP3) when examining summability using ideals. Furthermore, we thoroughly investigate the relationship between the properties (AP) and (AP3), illustrating through an example how the latter represents a less strict condition compared to the former.
{"title":"Regarding the Ideal Convergence of Triple Sequences in Random 2-Normed Spaces","authors":"Feras Bani-Ahmad, Mohammad H. M. Rashid","doi":"10.3390/sym15111983","DOIUrl":"https://doi.org/10.3390/sym15111983","url":null,"abstract":"In our ongoing study, we explore the concepts of I3-Cauchy and I3-Cauchy for triple sequences in the context of random 2-normed spaces (RTNS). Moreover, we introduce and analyze the notions of I3-convergence, I3-convergence, I3-limit points, and I3-cluster points for random 2-normed triple sequences. Significantly, we establish a notable finding that elucidates the connection between I3-convergence and I3-convergence within the framework of random 2-normed spaces, highlighting their interrelation. Additionally, we provide an illuminating example that demonstrates how I3-convergence in a random 2-normed space might not necessarily imply I3-convergence. Our observations underscore the importance of condition (AP3) when examining summability using ideals. Furthermore, we thoroughly investigate the relationship between the properties (AP) and (AP3), illustrating through an example how the latter represents a less strict condition compared to the former.","PeriodicalId":48874,"journal":{"name":"Symmetry-Basel","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134907483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Basem Ibrahim Mukhtar, Mahmoud Said Elsayed, Anca D. Jurcut, Marianne A. Azer
The Internet of Things (IoT) is rapidly growing and is projected to develop in future years. The IoT connects everything from Closed Circuit Television (CCTV) cameras to medical equipment to smart home appliances to smart automobiles and many more gadgets. Connecting these gadgets is revolutionizing our lives today by offering higher efficiency, better customer service, and more effective goods and services in a variety of industries and sectors. With this anticipated expansion, many challenges arise. Recent research ranked IP cameras as the 2nd highest target for IoT attacks. IoT security exhibits an inherent asymmetry where resource-constrained devices face attackers with greater resources and time, creating an imbalanced power dynamic. In cybersecurity, there is a symmetrical aspect where defenders implement security measures while attackers seek symmetrical weaknesses. The SILEX malware case highlights this asymmetry, demonstrating how IoT devices’ limited security made them susceptible to a relatively simple yet destructive attack. These insights underscore the need for robust, proactive IoT security measures to address the asymmetrical risks posed by adversaries and safeguard IoT ecosystems effectively. In this paper, we present the IoT vulnerabilities, their causes, and how to detect them. We focus on SILEX, one of the famous malware that targets IoT, as a case study and present the lessons learned from this malware.
{"title":"IoT Vulnerabilities and Attacks: SILEX Malware Case Study","authors":"Basem Ibrahim Mukhtar, Mahmoud Said Elsayed, Anca D. Jurcut, Marianne A. Azer","doi":"10.3390/sym15111978","DOIUrl":"https://doi.org/10.3390/sym15111978","url":null,"abstract":"The Internet of Things (IoT) is rapidly growing and is projected to develop in future years. The IoT connects everything from Closed Circuit Television (CCTV) cameras to medical equipment to smart home appliances to smart automobiles and many more gadgets. Connecting these gadgets is revolutionizing our lives today by offering higher efficiency, better customer service, and more effective goods and services in a variety of industries and sectors. With this anticipated expansion, many challenges arise. Recent research ranked IP cameras as the 2nd highest target for IoT attacks. IoT security exhibits an inherent asymmetry where resource-constrained devices face attackers with greater resources and time, creating an imbalanced power dynamic. In cybersecurity, there is a symmetrical aspect where defenders implement security measures while attackers seek symmetrical weaknesses. The SILEX malware case highlights this asymmetry, demonstrating how IoT devices’ limited security made them susceptible to a relatively simple yet destructive attack. These insights underscore the need for robust, proactive IoT security measures to address the asymmetrical risks posed by adversaries and safeguard IoT ecosystems effectively. In this paper, we present the IoT vulnerabilities, their causes, and how to detect them. We focus on SILEX, one of the famous malware that targets IoT, as a case study and present the lessons learned from this malware.","PeriodicalId":48874,"journal":{"name":"Symmetry-Basel","volume":"18 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135013084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
There are several goals of the two-dimensional data analysis: one may be interested in searching for groups of similar objects (clustering), another one may be focused on searching for some dependencies between a specified one and other variables (classification, regression, associate rules induction), and finally, some may be interested in serching for well-defined patterns in the data called biclusters. It was already proved that there exists a mathematically proven symmetry between some patterns in the matrix and implicants of data-defined Boolean function. This paper provides the new look for a specific pattern search—the pattern named the δ-shifting pattern. The shifting pattern is interesting, as it accounts for constant fluctuations in data, i.e., it captures situations in which all the values in the pattern move up or down for one dimension, maintaining the range amplitude for all the dimensions. Such a behavior is very common in real data, e.g., in the analysis of gene expression data. In such a domain, a subset of genes might go up or down for a subset of patients or experimental conditions, identifying functionally coherent categories. A δ-shifting pattern meets the necessity of shifting pattern induction together with the bias of the real values acquisition where the original shifts may be disturbed with some outer conditions. Experiments with a real dataset show the potential of our approach at finding biclusters with δ-shifting patterns, providing excellent performance. It was possible to find the 12×9 pattern in the 112×9 input data with MSR=0.00653. The experiments also revealed that δ-shifting patterns are quite difficult to be found by some well-known methods of biclustering, as these are not designed to focus on shifting patterns—results comparable due to MSR had much more variability (in terms of δ) than patterns found with Boolean reasoning.
{"title":"Shifting Pattern Biclustering and Boolean Reasoning Symmetry","authors":"Marcin Michalak, Jesús S. Aguilar-Ruiz","doi":"10.3390/sym15111977","DOIUrl":"https://doi.org/10.3390/sym15111977","url":null,"abstract":"There are several goals of the two-dimensional data analysis: one may be interested in searching for groups of similar objects (clustering), another one may be focused on searching for some dependencies between a specified one and other variables (classification, regression, associate rules induction), and finally, some may be interested in serching for well-defined patterns in the data called biclusters. It was already proved that there exists a mathematically proven symmetry between some patterns in the matrix and implicants of data-defined Boolean function. This paper provides the new look for a specific pattern search—the pattern named the δ-shifting pattern. The shifting pattern is interesting, as it accounts for constant fluctuations in data, i.e., it captures situations in which all the values in the pattern move up or down for one dimension, maintaining the range amplitude for all the dimensions. Such a behavior is very common in real data, e.g., in the analysis of gene expression data. In such a domain, a subset of genes might go up or down for a subset of patients or experimental conditions, identifying functionally coherent categories. A δ-shifting pattern meets the necessity of shifting pattern induction together with the bias of the real values acquisition where the original shifts may be disturbed with some outer conditions. Experiments with a real dataset show the potential of our approach at finding biclusters with δ-shifting patterns, providing excellent performance. It was possible to find the 12×9 pattern in the 112×9 input data with MSR=0.00653. The experiments also revealed that δ-shifting patterns are quite difficult to be found by some well-known methods of biclustering, as these are not designed to focus on shifting patterns—results comparable due to MSR had much more variability (in terms of δ) than patterns found with Boolean reasoning.","PeriodicalId":48874,"journal":{"name":"Symmetry-Basel","volume":"3 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136381460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Akeel A. AL-saedi, Omid Nikan, Zakieh Avazzadeh, António M. Lopes
This paper addresses a numerical approach for computing the solitary wave solutions of the generalized Rosenau–Kawahara–RLW model established by coupling the generalized Rosenau–Kawahara and Rosenau–RLW equations. The solution of this model is accomplished by using the finite difference approach and the upwind local radial basis functions-finite difference. Firstly, the PDE is transformed into a nonlinear ODEs system by means of the radial kernels. Secondly, a high-order ODE solver is implemented for discretizing the system of nonlinear ODEs. The main advantage of this technique is its lack of need for linearization. The global collocation techniques impose a significant computational cost, which arises from calculating the dense system of algebraic equations. The proposed technique estimates differential operators on every stencil. As a result, it produces sparse differentiation matrices and reduces the computational burden. Numerical experiments indicate that the method is precise and efficient for long-time simulation.
{"title":"Solitary Wave Propagation of the Generalized Rosenau–Kawahara–RLW Equation in Shallow Water Theory with Surface Tension","authors":"Akeel A. AL-saedi, Omid Nikan, Zakieh Avazzadeh, António M. Lopes","doi":"10.3390/sym15111980","DOIUrl":"https://doi.org/10.3390/sym15111980","url":null,"abstract":"This paper addresses a numerical approach for computing the solitary wave solutions of the generalized Rosenau–Kawahara–RLW model established by coupling the generalized Rosenau–Kawahara and Rosenau–RLW equations. The solution of this model is accomplished by using the finite difference approach and the upwind local radial basis functions-finite difference. Firstly, the PDE is transformed into a nonlinear ODEs system by means of the radial kernels. Secondly, a high-order ODE solver is implemented for discretizing the system of nonlinear ODEs. The main advantage of this technique is its lack of need for linearization. The global collocation techniques impose a significant computational cost, which arises from calculating the dense system of algebraic equations. The proposed technique estimates differential operators on every stencil. As a result, it produces sparse differentiation matrices and reduces the computational burden. Numerical experiments indicate that the method is precise and efficient for long-time simulation.","PeriodicalId":48874,"journal":{"name":"Symmetry-Basel","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134907496","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We study an abstract variant of squares (and shuffle squares) defined by a constraint graph G, specifying which pairs of words form a square. So, a shuffle G-square is a word that can be split into two disjoint subwords U and W (of the same length), which are joined by an edge. This setting generalizes a recently introduced model of shuffle squares based on word symmetry and permutations. By using the probabilistic method, we provide a sufficient condition for a constraint graph G guaranteeing the avoidability of shuffle G-squares. By a more-elementary method (known as Rosenfeld counting), we prove that G-squares are avoidable over an alphabet of size 4α, α>1, provided that the degree of every word of length n in G is at most αn. We also introduce the concept of the cutting distance between words and state several conjectures involving this notion and various kinds of shuffle squares. We suspect that, for every k⩾2, there is a constant ck such that every even word can be turned into a shuffle square by cutting it in at most ck places and rearranging the resulting pieces. We present some computational, as well as theoretical evidence in favor of this conjecture.
{"title":"More Variations on Shuffle Squares","authors":"Jarosław Grytczuk, Bartłomiej Pawlik, Mariusz Pleszczyński","doi":"10.3390/sym15111982","DOIUrl":"https://doi.org/10.3390/sym15111982","url":null,"abstract":"We study an abstract variant of squares (and shuffle squares) defined by a constraint graph G, specifying which pairs of words form a square. So, a shuffle G-square is a word that can be split into two disjoint subwords U and W (of the same length), which are joined by an edge. This setting generalizes a recently introduced model of shuffle squares based on word symmetry and permutations. By using the probabilistic method, we provide a sufficient condition for a constraint graph G guaranteeing the avoidability of shuffle G-squares. By a more-elementary method (known as Rosenfeld counting), we prove that G-squares are avoidable over an alphabet of size 4α, α>1, provided that the degree of every word of length n in G is at most αn. We also introduce the concept of the cutting distance between words and state several conjectures involving this notion and various kinds of shuffle squares. We suspect that, for every k⩾2, there is a constant ck such that every even word can be turned into a shuffle square by cutting it in at most ck places and rearranging the resulting pieces. We present some computational, as well as theoretical evidence in favor of this conjecture.","PeriodicalId":48874,"journal":{"name":"Symmetry-Basel","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134907090","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Muhammad Dawood, Shanshan Tu, Chuangbai Xiao, Hisham Alasmary, Muhammad Waqas, Sadaqat Ur Rehman
Cloud computing is an innovative technique that offers shared resources for stock cache and server management. Cloud computing saves time and monitoring costs for any organization and turns technological solutions for large-scale systems into server-to-service frameworks. However, just like any other technology, cloud computing opens up many forms of security threats and problems. In this work, we focus on discussing different cloud models and cloud services, respectively. Next, we discuss the security trends in the cloud models. Taking these security trends into account, we move to security problems, including data breaches, data confidentiality, data access controllability, authentication, inadequate diligence, phishing, key exposure, auditing, privacy preservability, and cloud-assisted IoT applications. We then propose security attacks and countermeasures specifically for the different cloud models based on the security trends and problems. In the end, we pinpoint some of the futuristic directions and implications relevant to the security of cloud models. The future directions will help researchers in academia and industry work toward cloud computing security.
{"title":"Cyberattacks and Security of Cloud Computing: A Complete Guideline","authors":"Muhammad Dawood, Shanshan Tu, Chuangbai Xiao, Hisham Alasmary, Muhammad Waqas, Sadaqat Ur Rehman","doi":"10.3390/sym15111981","DOIUrl":"https://doi.org/10.3390/sym15111981","url":null,"abstract":"Cloud computing is an innovative technique that offers shared resources for stock cache and server management. Cloud computing saves time and monitoring costs for any organization and turns technological solutions for large-scale systems into server-to-service frameworks. However, just like any other technology, cloud computing opens up many forms of security threats and problems. In this work, we focus on discussing different cloud models and cloud services, respectively. Next, we discuss the security trends in the cloud models. Taking these security trends into account, we move to security problems, including data breaches, data confidentiality, data access controllability, authentication, inadequate diligence, phishing, key exposure, auditing, privacy preservability, and cloud-assisted IoT applications. We then propose security attacks and countermeasures specifically for the different cloud models based on the security trends and problems. In the end, we pinpoint some of the futuristic directions and implications relevant to the security of cloud models. The future directions will help researchers in academia and industry work toward cloud computing security.","PeriodicalId":48874,"journal":{"name":"Symmetry-Basel","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134907319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Han Li, Yiming Li, Peng Chen, Guizhen Yu, Yaping Liao
Recently, with the assistance of 5G networks and the Internet of Things, specialized applications of autonomous driving to mining sites have been explored, with the goal of realizing the unmanned operation of mining systems and enhancing the safety of the mining industry. After receiving the loading task, the autonomous driving system will generate a feasible trajectory for the mining truck. It requires that the trajectory be generated in advanced within a limited-time high-latency network. In addition, the secure trajectory planning for mining sites involves factors in the complex environment and an unstable network. Thus, a secure trajectory planning method for autonomous trucks at mining sites is proposed. It simplifies the planning by decoupling the planning into front-end path searching and back-end trajectory generation. First, the planner enhances the Hybrid A* search algorithm to find the hauling path within the boundary of the mining site, and then, it post-processes the path with a well-designed symmetric optimization-based method. Then, considering the interaction with other autonomous trucks, a topology-guided search method for secure decision making is proposed, considering the possibility of cybersecurity. The proposed method was validated in real scenarios of the mining environment. The results verify that the planner can generate the secure trajectory under network delay 2.0 s conditions.
{"title":"A Secure Trajectory Planning Method for Connected Autonomous Vehicles at Mining Site","authors":"Han Li, Yiming Li, Peng Chen, Guizhen Yu, Yaping Liao","doi":"10.3390/sym15111973","DOIUrl":"https://doi.org/10.3390/sym15111973","url":null,"abstract":"Recently, with the assistance of 5G networks and the Internet of Things, specialized applications of autonomous driving to mining sites have been explored, with the goal of realizing the unmanned operation of mining systems and enhancing the safety of the mining industry. After receiving the loading task, the autonomous driving system will generate a feasible trajectory for the mining truck. It requires that the trajectory be generated in advanced within a limited-time high-latency network. In addition, the secure trajectory planning for mining sites involves factors in the complex environment and an unstable network. Thus, a secure trajectory planning method for autonomous trucks at mining sites is proposed. It simplifies the planning by decoupling the planning into front-end path searching and back-end trajectory generation. First, the planner enhances the Hybrid A* search algorithm to find the hauling path within the boundary of the mining site, and then, it post-processes the path with a well-designed symmetric optimization-based method. Then, considering the interaction with other autonomous trucks, a topology-guided search method for secure decision making is proposed, considering the possibility of cybersecurity. The proposed method was validated in real scenarios of the mining environment. The results verify that the planner can generate the secure trajectory under network delay 2.0 s conditions.","PeriodicalId":48874,"journal":{"name":"Symmetry-Basel","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135216520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：