Advanced Metaheuristic Algorithms on Solving Multimodal Functions: Experimental Analyses and Performance Evaluations

Author(s):  
Yiğit Çağatay Kuyu ◽  
Fahri Vatansever
2012 ◽  
Vol 21 (03) ◽  
pp. 1240010 ◽  
Author(s):  
XIN-SHE YANG

The increasing popularity of metaheuristic algorithms has attracted a great deal of attention in algorithm analysis and performance evaluations. No-free-lunch theorems are of both theoretical and practical importance, while many important studies on convergence analysis of various metaheuristic algorithms have proven to be fruitful. This paper discusses the recent results on no-free-lunch theorems and algorithm convergence, as well as their important implications for algorithm development in practice. Free lunches may exist for certain types of problem. In addition, we will highlight some open problems for further research.


Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1471
Author(s):  
Jun-Yeong Lee ◽  
Moon-Hyun Kim ◽  
Syed Asif Raza Raza Shah ◽  
Sang-Un Ahn ◽  
Heejun Yoon ◽  
...  

Data are important and ever growing in data-intensive scientific environments. Such research data growth requires data storage systems that play pivotal roles in data management and analysis for scientific discoveries. Redundant Array of Independent Disks (RAID), a well-known storage technology combining multiple disks into a single large logical volume, has been widely used for the purpose of data redundancy and performance improvement. However, this requires RAID-capable hardware or software to build up a RAID-enabled disk array. In addition, it is difficult to scale up the RAID-based storage. In order to mitigate such a problem, many distributed file systems have been developed and are being actively used in various environments, especially in data-intensive computing facilities, where a tremendous amount of data have to be handled. In this study, we investigated and benchmarked various distributed file systems, such as Ceph, GlusterFS, Lustre and EOS for data-intensive environments. In our experiment, we configured the distributed file systems under a Reliable Array of Independent Nodes (RAIN) structure and a Filesystem in Userspace (FUSE) environment. Our results identify the characteristics of each file system that affect the read and write performance depending on the features of data, which have to be considered in data-intensive computing environments.


2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Adrian Furnham ◽  
Luke Treglown ◽  
Daria Topic

Purpose The study aims to look at whether trait emotional intelligence (EI) was related to the job performance level of a manager, their immediate team and their peers. Design/methodology/approach This study looked at the relationship between trait EI and performance appraisals, as evaluated by the person themselves, their peers, manager and team. Trait EI facets of 903 employees were compared to evaluated performance appraisals of the different groups four months later. Findings All 15 of the correlations (20 < r < 0.42) between the emotional intelligence facets and self-ratings were significantly positive whilst for managers 10, peers 6 and team only 4 were significant, though all were positive. In line with affective primacy theory, structural equation modelling revealed performance was rated higher by non-manager colleagues when employees exhibited traits associated with positive interpersonal interactions. Originality/value There are very few studies using multi-source ratings to explore the consequences of EI on a manager’s team and peers.


2021 ◽  
Vol 7 (1) ◽  
pp. 27
Author(s):  
Memduh Karalar ◽  
Murat Çavuşli

Strengthening historical buildings and evaluating their performances make great contributions to both the history of the country and the tourism of the country. In this study, performance analysis and evaluations of the historical cinema hall balcony, which was built in 1933 by a French company and served to Zonguldak province for a long time, are presented in detail. This cinema hall was frequently used by local people between 1933 and 1999 and hosted many Yeşilçam movies. Firstly, examinations were performed in the historical cinema hall and the areas (columns, beams and floors) that were damaged in time were identified. According to the obtained information, it was determined that there were significant damages in the carrier system of the building and there were visible cracks and damages in the columns of the cinema hall. It was also observed that explosions occurred in one of the main carrier columns of the balcony. After the core samples taken from the balcony were tested in the laboratory, the current status of the carrier elements and reinforcements were determined with the help of an x-ray rebar scanner. After all these processes, the structure was modeled as three dimensional (3D) using a special computer program and performance evaluations were performed regarding the current state of the structure. As a result of the performance evaluation, it was determined that the balcony of the historical cinema hall could not survive anymore and would collapse over time. It was concluded that there were great damages especially on the balcony columns and a reinforcement should be made on a total of 6 columns. Strengthening was made to 4 different main columns and a performance analysis was performed again in strengthened structure. After strengthening, it was understood that the columns of the balcony of the cinema hall could survive for a long time.


2016 ◽  
Vol 4 (2) ◽  
pp. 33-57 ◽  
Author(s):  
Seiya Okubo ◽  
Takaaki Ayabe ◽  
Tetsuro Nishino

In this paper, the authors elucidate the characteristics of the computer game Daihinmin, a popular Japanese card game that uses imperfect information. They first propose a method to extract feature values using n-gram statistics and a cluster analysis method that employs feature values. By representing the program card hands as several symbols, and the order of hands as simplified symbol strings, they obtain data that is suitable for feature extraction. The authors then evaluate the effectiveness of the proposed method through computer experiments. In these experiments, they apply their method to ten programs that were used in the UEC Computer Daihinmin Convention. In addition, the authors evaluate the robustness of the proposed method and apply it to recent programs. Finally, they show that their proposed method can successfully cluster Daihinmin programs with high probability.


Sign in / Sign up

Export Citation Format

Share Document