Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.9
2.7
Journals
Symmetry
Special Issues
Recent Advances in Software for Symmetry
share announcement

Recent Advances in Software for Symmetry

A special issue of Symmetry (ISSN 2073-8994). This special issue belongs to the section "Computer".

Deadline for manuscript submissions: closed (31 October 2023) | Viewed by 17647

Special Issue Editors

Dr. SeongKi Kim

E-Mail Website
Guest Editor
Division of SW Convergence, Sangmyung University, Seoul, Korea
Interests: software; verification; IoT; cloud; big data; mixed reality; game; blockchain; natural language processing; computer graphics
Prof. Dr. Muhammad Fazal Ijaz

E-Mail Website
Guest Editor
Department of Intelligent Mechatronics Engineering, Sejong University, Seoul 05006, Republic of Korea
Interests: data science; machine learning; data structures and algorithms; systems engineering; neural networks; data mining; project management; tensor flow; predictive modelling; artificial intelligence; hadoop; apache spark; software development; empirical researchbig data
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Information Technology has developed rapidly in recent years and software systems can play a critical role in the symmetry of the technology. In particular, software is used to control the entire hardware system. Due to this, software has become part of the most complex components and its use has grown more and more. Indeed, its growth has caused new algorithms and development methodologies to be developed, and software is being applied to more and more areas.

Besides the use of software for information technology, mixed reality and games software has been widely used for various purposes, including symmetry. For example, serious games and MR content has been developed for the purposes of rehabilitation and education. In addition, software can support symmetry. As described in the examples, the use of software has been widespread across entire systems and independent content.

Due to these trends, we invite the submission of high-quality papers that discuss the development of new ideas, software, algorithms, models, paradigms, and systems to overcome various challenges.

Symmetry is an extraordinary characteristic which has been widely deployed in diverse research fields of computer engineering. This Special Issue invites original research that investigates software technologies related to the concept of symmetry. Potential topics include, but are not limited to:

  • Software engineering;
  • Software for the Internet of Things (IoT);
  • Software for autonomous vehicles;
  • Software for cloud computing;
  • Mixed/virtual/augmented reality;
  • Games;
  • Artificial Intelligence (AI);
  • Computer vision;
  • Computer graphics;
  • Hardware systems for software.

Dr. SeongKi Kim
Dr. Muhammad Fazal Ijaz
Guest Editors

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. Symmetry 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 2400 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.

Keywords

  • software
  • verification
  • IoT
  • cloud
  • big data
  • mixed reality
  • game
  • blockchain
  • natural language processing
  • computer graphics
  • computer vision
  • artificial intelligence
  • software engineering

Published Papers (6 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

13 pages, 1585 KiB  
Article
Efficient I/O Merging Scheme for Distributed File Systems
by Byoung Chul An and Hanul Sung
Symmetry 2023, 15(2), 423; https://doi.org/10.3390/sym15020423 - 05 Feb 2023
Cited by 1 | Viewed by 1043
Abstract
Recently, decentralized file systems are widely used to overcome centralized file systems’ load asymmetry between nodes and the scalability problem. Due to the lack of a metadata server, decentralized systems require more RPC requests to control metadata processing between clients and servers, which [...] Read more.
Recently, decentralized file systems are widely used to overcome centralized file systems’ load asymmetry between nodes and the scalability problem. Due to the lack of a metadata server, decentralized systems require more RPC requests to control metadata processing between clients and servers, which adversely impacts the I/O performance and traffic imbalance by increasing RPC latency. In this paper, we propose an efficient I/O scheme to reduce the RPC overhead in decentralized file systems. Instead of sending a single RPC request at a time, we enqueued the RPCs in the global queue and merged them into larger RPC requests, thus avoiding excessive RPC latency overheads. The experimental results showed that our scheme improves write and read performance by up to 13% and 16%, respectively, compared with those of the original. Full article
(This article belongs to the Special Issue Recent Advances in Software for Symmetry)
►▼ Show Figures

Figure 1

17 pages, 548 KiB  
Article
A Novel Real Coded Genetic Algorithm for Software Mutation Testing
by Deepti Bala Mishra, Biswaranjan Acharya, Dharashree Rath, Vassilis C. Gerogiannis and Andreas Kanavos
Symmetry 2022, 14(8), 1525; https://doi.org/10.3390/sym14081525 - 26 Jul 2022
Cited by 5 | Viewed by 1959
Abstract
Information Technology has rapidly developed in recent years and software systems can play a critical role in the symmetry of the technology. Regarding the field of software testing, white-box unit-level testing constitutes the backbone of all other testing techniques, as testing can be [...] Read more.
Information Technology has rapidly developed in recent years and software systems can play a critical role in the symmetry of the technology. Regarding the field of software testing, white-box unit-level testing constitutes the backbone of all other testing techniques, as testing can be entirely implemented by considering the source code of each System Under Test (SUT). In unit-level white-box testing, mutants can be used; these mutants are artificially generated faults seeded in each SUT that behave similarly to the realistic ones. Executing test cases against mutants results in the adequacy (mutation) score of each test case. Efficient Genetic Algorithm (GA)-based methods have been proposed to address different problems in white-box unit testing and, in particular, issues of mutation testing techniques. In this research paper, a new approach, which integrates the path coverage-based testing method with the novel idea of tracing a Fault Detection Matrix (FDM) to achieve maximum mutation coverage, is proposed. The proposed real coded GA for mutation testing is designed to achieve the highest Mutation Score, and it is thus named RGA-MS. The approach is implemented in two phases: path coverage-based test data are initially generated and stored in an optimized test suite. In the next phase, the test suite is executed to kill the mutants present in the SUT. The proposed method aims to achieve the minimum test dataset, having at the same time the highest Mutation Score by removing duplicate test data covering the same mutants. The proposed approach is implemented on the same SUTs as these have been used for path testing. We proved that the RGA-MS approach can cover maximum mutants with a minimum number of test cases. Furthermore, the proposed method can generate a maximum path coverage-based test suite with minimum test data generation compared to other algorithms. In addition, all mutants in the SUT can be covered by less number of test data with no duplicates. Ultimately, the generated optimal test suite is trained to achieve the highest Mutation Score. GA is used to find the maximum mutation coverage as well as to delete the redundant test cases. Full article
(This article belongs to the Special Issue Recent Advances in Software for Symmetry)
►▼ Show Figures

Figure 1

14 pages, 2750 KiB  
Article
Automatic Classification of Equivalent Mutants in Mutation Testing of Android Applications
by Muhammad Bello Kusharki, Sanjay Misra, Bilkisu Muhammad-Bello, Ibrahim Anka Salihu and Bharti Suri
Symmetry 2022, 14(4), 820; https://doi.org/10.3390/sym14040820 - 14 Apr 2022
Cited by 6 | Viewed by 2160
Abstract
Software and symmetric testing methodologies are primarily used in detecting software defects, but these testing methodologies need to be optimized to mitigate the wasting of resources. As mobile applications are becoming more prevalent in recent times, the need to have mobile applications that [...] Read more.
Software and symmetric testing methodologies are primarily used in detecting software defects, but these testing methodologies need to be optimized to mitigate the wasting of resources. As mobile applications are becoming more prevalent in recent times, the need to have mobile applications that satisfy software quality through testing cannot be overemphasized. Testing suites and software quality assurance techniques have also become prevalent, which underscores the need to evaluate the efficacy of these tools in the testing of the applications. Mutation testing is one such technique, which is the process of injecting small changes into the software under test (SUT), thereby creating mutants. These mutants are then tested using mutation testing techniques alongside the SUT to determine the effectiveness of test suites through mutation scoring. Although mutation testing is effective, the cost of implementing it, due to the problem of equivalent mutants, is very high. Many research works gave varying solutions to this problem, but none used a standardized dataset. In this research work, we employed a standard mutant dataset tool called MutantBench to generate our data. Subsequently, an Abstract Syntax Tree (AST) was used in conjunction with a tree-based convolutional neural network (TBCNN) as our deep learning model to automate the classification of the equivalent mutants to reduce the cost of mutation testing in software testing of android applications. The result shows that the proposed model produces a good accuracy rate of 94%, as well as other performance metrics such as recall (96%), precision (89%), F1-score (92%), and Matthew’s correlation coefficients (88%) with fewer False Negatives and False Positives during testing, which is significant as it implies that there is a decrease in the risk of misclassification. Full article
(This article belongs to the Special Issue Recent Advances in Software for Symmetry)
►▼ Show Figures

Figure 1

18 pages, 663 KiB  
Article
Cross-Project Defect Prediction Considering Multiple Data Distribution Simultaneously
by Yu Zhao, Yi Zhu, Qiao Yu and Xiaoying Chen
Symmetry 2022, 14(2), 401; https://doi.org/10.3390/sym14020401 - 17 Feb 2022
Cited by 8 | Viewed by 3207
Abstract
Software testing is the main method for finding software defects at present, and symmetric testing and other methods have been widely used, but these testing methods will cause a lot of waste of resources. Software defect prediction methods can reasonably allocate testing resources [...] Read more.
Software testing is the main method for finding software defects at present, and symmetric testing and other methods have been widely used, but these testing methods will cause a lot of waste of resources. Software defect prediction methods can reasonably allocate testing resources by predicting the defect tendency of software modules. Cross-project defect prediction methods have huge advantages when faced with missing datasets. However, most cross-project defect prediction methods are designed based on the settings of a single source project and a single target project. As the number of public datasets continues to grow, the number of source projects and defect information is increasing. Therefore, in the case of multi-source projects, this paper explores the problems existing when using multi-source projects for defect prediction. There are two problems. First, in practice, it is not possible to know in advance which source project is used to build the model to obtain the best prediction performance. Second, if an inappropriate source project is used in the experiment to build the model, it can lead to lower performance issues. According to the problems found in the experiment, the paper proposed a multi-source-based cross-project defect prediction method MSCPDP. Experimental results on the AEEEM dataset and PROMISE dataset show that the proposed MSCPDP method effectively solves the above two problems and outperforms most of the current state-of-art cross-project defect prediction methods on F1 and AUC. Compared with the six cross-project defect prediction methods, the F1 median is improved by 3.51%, 3.92%, 36.06%, 0.49%, 17.05%, and 9.49%, and the ACU median is improved by −3.42%, 8.78%, 0.96%, −2.21%, −7.94%, and 5.13%. Full article
(This article belongs to the Special Issue Recent Advances in Software for Symmetry)
►▼ Show Figures

Figure 1

18 pages, 12519 KiB  
Article
GomJau-Hogg’s Notation for Automatic Generation of k-Uniform Tessellations with ANTWERP v3.0
by Valentin Gomez-Jauregui, Harrison Hogg, Cristina Manchado and Cesar Otero
Symmetry 2021, 13(12), 2376; https://doi.org/10.3390/sym13122376 - 09 Dec 2021
Cited by 4 | Viewed by 4752
Abstract
Euclidean tilings are constantly applied to many fields of engineering (mechanical, civil, chemical, etc.). These tessellations are usually named after Cundy & Rollett’s notation. However, this notation has two main problems related to ambiguous conformation and uniqueness. This communication explains the GomJau-Hogg’s notation [...] Read more.
Euclidean tilings are constantly applied to many fields of engineering (mechanical, civil, chemical, etc.). These tessellations are usually named after Cundy & Rollett’s notation. However, this notation has two main problems related to ambiguous conformation and uniqueness. This communication explains the GomJau-Hogg’s notation for generating all the regular, semi-regular (uniform) and demi-regular (k-uniform, up to at least k = 3) in a consistent, unique and unequivocal manner. Moreover, it presents Antwerp v3.0, a free online application, which is publicly shared to prove that all the basic tilings can be obtained directly from the GomJau-Hogg’s notation. Full article
(This article belongs to the Special Issue Recent Advances in Software for Symmetry)
►▼ Show Figures

Figure 1

23 pages, 24041 KiB  
Article
Software Defect Prediction Using Wrapper Feature Selection Based on Dynamic Re-Ranking Strategy
by Abdullateef Oluwagbemiga Balogun, Shuib Basri, Luiz Fernando Capretz, Saipunidzam Mahamad, Abdullahi Abubakar Imam, Malek A. Almomani, Victor Elijah Adeyemo, Ammar K. Alazzawi, Amos Orenyi Bajeh and Ganesh Kumar
Symmetry 2021, 13(11), 2166; https://doi.org/10.3390/sym13112166 - 12 Nov 2021
Cited by 16 | Viewed by 2561
Abstract
Finding defects early in a software system is a crucial task, as it creates adequate time for fixing such defects using available resources. Strategies such as symmetric testing have proven useful; however, its inability in differentiating incorrect implementations from correct ones is a [...] Read more.
Finding defects early in a software system is a crucial task, as it creates adequate time for fixing such defects using available resources. Strategies such as symmetric testing have proven useful; however, its inability in differentiating incorrect implementations from correct ones is a drawback. Software defect prediction (SDP) is another feasible method that can be used for detecting defects early. Additionally, high dimensionality, a data quality problem, has a detrimental effect on the predictive capability of SDP models. Feature selection (FS) has been used as a feasible solution for solving the high dimensionality issue in SDP. According to current literature, the two basic forms of FS approaches are filter-based feature selection (FFS) and wrapper-based feature selection (WFS). Between the two, WFS approaches have been deemed to be superior. However, WFS methods have a high computational cost due to the unknown number of executions available for feature subset search, evaluation, and selection. This characteristic of WFS often leads to overfitting of classifier models due to its easy trapping in local maxima. The trapping of the WFS subset evaluator in local maxima can be overcome by using an effective search method in the evaluator process. Hence, this study proposes an enhanced WFS method that dynamically and iteratively selects features. The proposed enhanced WFS (EWFS) method is based on incrementally selecting features while considering previously selected features in its search space. The novelty of EWFS is based on the enhancement of the subset evaluation process of WFS methods by deploying a dynamic re-ranking strategy that iteratively selects germane features with a low subset evaluation cycle while not compromising the prediction performance of the ensuing model. For evaluation, EWFS was deployed with Decision Tree (DT) and Naïve Bayes classifiers on software defect datasets with varying granularities. The experimental findings revealed that EWFS outperformed existing metaheuristics and sequential search-based WFS approaches established in this work. Additionally, EWFS selected fewer features with less computational time as compared with existing metaheuristics and sequential search-based WFS methods. Full article
(This article belongs to the Special Issue Recent Advances in Software for Symmetry)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-6
Back to TopTop