Yazar "Fratu, Octavian" seçeneğine göre listele

Listeleniyor 1 - 3 / 3
  • Küçük Resim Yok
    Öğe
    A Bioinspired Test Generation Method Using Discretized and Modified Bat Optimization Algorithm
    (Mdpi, 2024) Arasteh, Bahman; Arasteh, Keyvan; Kiani, Farzad; Sefati, Seyed Salar; Fratu, Octavian; Halunga, Simona; Tirkolaee, Erfan Babaee
    The process of software development is incomplete without software testing. Software testing expenses account for almost half of all development expenses. The automation of the testing process is seen to be a technique for reducing the cost of software testing. An NP-complete optimization challenge is to generate the test data with the highest branch coverage in the shortest time. The primary goal of this research is to provide test data that covers all branches of a software unit. Increasing the convergence speed, the success rate, and the stability of the outcomes are other goals of this study. An efficient bioinspired technique is suggested in this study to automatically generate test data utilizing the discretized Bat Optimization Algorithm (BOA). Modifying and discretizing the BOA and adapting it to the test generation problem are the main contributions of this study. In the first stage of the proposed method, the source code of the input program is statistically analyzed to identify the branches and their predicates. Then, the developed discretized BOA iteratively generates effective test data. The fitness function was developed based on the program's branch coverage. The proposed method was implemented along with the previous one. The experiments' results indicated that the suggested method could generate test data with about 99.95% branch coverage with a limited amount of time (16 times lower than the time of similar algorithms); its success rate was 99.85% and the average number of required iterations to cover all branches is 4.70. Higher coverage, higher speed, and higher stability make the proposed method suitable as an efficient test generation method for real-world large software.
  • Küçük Resim Yok
    Öğe
    A Hybrid Heuristic Algorithm Using Artificial Agents for Data Replication Problem in Distributed Systems
    (Mdpi, 2023) Arasteh, Bahman; Sefati, Seyed Salar; Halunga, Simona; Fratu, Octavian; Allahviranloo, Tofigh
    One of the key issues with large distributed systems, such as IoT platforms, is gaining timely access to data objects. As a result, decreasing the operation time of reading and writing data in distributed communication systems become essential demands for asymmetric system. A common method is to replicate the data objects across multiple servers. Replica placement, which can be performed statically or dynamically, is critical to the effectiveness of distributed systems in general. Replication and placing them on the best available data servers in an optimal manner is an NP-complete optimization problem. As a result, several heuristic strategies for replica placement in distributed systems have been presented. The primary goals of this research are to reduce the cost of data access time, reduce the number of replicas, and increase the reliability of the algorithms for placing replicas. In this paper, a discretized heuristic algorithm with artificial individuals and a hybrid imitation method were developed. In the proposed method, particle and gray-wolf-based individuals use a local memory and velocity to search for optimal solutions. The proposed method includes symmetry in both local and global searches. Another contribution of this research is the development of the proposed optimization algorithm for solving the data object replication problem in distributed systems. Regarding the results of simulations on the standard benchmark, the suggested method gives a 35% reduction in data access time with about six replicates. Furthermore, the standard deviation among the results obtained by the proposed method is about 0.015 which is lower than the other methods in the same experiments; hence, the method is more stable than the previous methods during different executions.
  • Küçük Resim Yok
    Öğe
    Meet User's Service Requirements in Smart Cities Using Recurrent Neural Networks and Optimization Algorithm
    (Ieee-Inst Electrical Electronics Engineers Inc, 2023) Sefati, Seyed Salar; Arasteh, Bahman; Halunga, Simona; Fratu, Octavian; Bouyer, Asgarali
    Despite significant advancements in Internet of Things (IoT)-based smart cities, service discovery, and composition continue to pose challenges. Current methodologies face limitations in optimizing Quality of Service (QoS) in diverse network conditions, thus creating a critical research gap. This study presents an original and innovative solution to this issue by introducing a novel three-layered recurrent neural network (RNN) algorithm. Aimed at optimizing QoS in the context of IoT service discovery, our method incorporates user requirements into its evaluation matrix. It also integrates long short-term memory (LSTM) networks and a unique black widow optimization (BWO) algorithm, collectively facilitating the selection and composition of optimal services for specific tasks. This approach allows the RNN algorithm to identify the top-K services based on QoS under varying network conditions. Our methodology's novelty lies in implementing LSTM in the hidden layer and employing backpropagation through time (BPTT) for parameter updates, which enables the RNN to capture temporal patterns and intricate relationships between devices and services. Further, we use the BWO algorithm, which simulates the behavior of black widow spiders, to find the optimal combination of services to meet system requirements. This algorithm factors in both the attractive and repulsive forces between services to isolate the best candidate solutions. In comparison with existing methods, our approach shows superior performance in terms of latency, availability, and reliability. Thus, it provides an efficient and effective solution for service discovery and composition in IoT-based smart cities, bridging a significant gap in current research.