• Journal of Korea Multimedia Society
• /
• v.23 no.1
• /
• pp.31-42
• /
• 2020

During the 4th Industrial Revolution, service platforms utilizing diverse contents are emerging, and research on recommended systems that can be customized to users to provide quality service is being conducted. hybrid recommendation systems that provide high accuracy recommendations are being researched in various domains, and various filtering techniques, machine learning, and deep learning are being applied to recommended systems. However, in a recommended service environment where data must be analyzed and processed real time, the accuracy of the recommendation is important, but the computational speed is also very important. Due to high level of model complexity, a hybrid recommendation system or a Deep Learning-based recommendation system takes a long time to calculate. In this paper, a Cascade-hybrid recommended algorithm is proposed that can reduce the computational time while maintaining the accuracy of the recommendation. The proposed algorithm was designed to reduce the complexity of the model and minimize the computational speed while processing sequentially, rather than using existing weights or using a hybrid recommendation technique handled in parallel. Therefore, through the algorithms in this paper, contents can be analyzed and recommended effectively and real time through services such as SNS environments or shared economy platforms.

• Journal of the Korean Ceramic Society
• /
• v.48 no.6
• /
• pp.493-498
• /
• 2011

Optimal atomic configurations in a nanoparticle were predicted by genetic algorithm. A truncated octahedron with a fixed composition of 1 : 1 was investigated as a model system. A Python code for genetic algorithm linked with a molecular dynamics method was developed. Various operators were implemented to accelerate the optimization of atomic configuration for a given composition and a given morphology of a nanoparticle. The combination of random mix as a crossover operator and total_inversion as a mutation operator showed the most stable structure within the shortest calculation time. Pt-Ag core-shell structure was predicted as the most stable structure for a nanoparticle of approximately 4 nm in diameter. The calculation results in this study led to successful prediction of the atomic configuration of nanoparticle, the size of which is comparable to that of practical nanoparticls for the application to the nanocatalyst.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.232-248
• /
• 2014

A series of kernel regression (KR) algorithms, such as the classic kernel regression (CKR), the 2- and 3-D steering kernel regression (SKR), have been proposed for image and video super-resolution. In existing KR frameworks, a single algorithm is usually adopted and applied for a whole image/video, regardless of region characteristics. However, their performances and computational efficiencies can differ in regions of different characteristics. To take full advantage of the KR algorithms and avoid their disadvantage, this paper proposes a kernel regression framework for video super-resolution. In this framework, each video frame is first analyzed and divided into three types of regions: flat, non-flat-stationary, and non-flat-moving regions. Then different KR algorithm is selected according to the region type. The CKR and 2-D SKR algorithms are applied to flat and non-flat-stationary regions, respectively. For non-flat-moving regions, this paper proposes a similarity-assisted steering kernel regression (SASKR) algorithm, which can give better performance and higher computational efficiency than the 3-D SKR algorithm. Experimental results demonstrate that the computational efficiency of the proposed framework is greatly improved without apparent degradation in performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2469-2490
• /
• 2019

A low-energy adaptive clustering hierarchy (LEACH) protocol is a low-power adaptive cluster routing protocol which was proposed by MIT's Chandrakasan for sensor networks. In the LEACH protocol, the selection mode of cluster-head nodes is a random selection of cycles, which may result in uneven distribution of nodal energy and reduce the lifetime of the entire network. Hence, we propose a new selection method to enhance the lifetime of network, in this selection function, the energy consumed between nodes in the clusters and the power consumed by the transfer between the cluster head and the base station are considered at the same time. Meanwhile, the improved FTBA algorithm integrating the curve strategy is proposed to enhance local and global search capabilities. Then we combine the improved BA with LEACH, and use the intelligent algorithm to select the cluster head. Experiment results show that the improved BA has stronger optimization ability than other optimization algorithms, which the method we proposed (FTBA-TC-LEACH) is superior than the LEACH and LEACH with standard BA (SBA-LEACH). The FTBA-TC-LEACH can obviously reduce network energy consumption and enhance the lifetime of wireless sensor networks (WSNs).

• Advances in Computational Design
• /
• v.6 no.1
• /
• pp.31-42
• /
• 2021

This research aims to demonstrate the optimal geometrical design of splayed multiple cross-sectional pin fin heat sinks (SMCSPFHS), which are a type of side-inlet-side-outlet heat sink (SISOHS). The optimiser strength Pareto evolutionary algorithm2 (SPEA2)is employed to explore a set of Pareto optimalsolutions. Objective functions are the fan pumping power and junction temperature. Function evaluations can be accomplished using computational fluid dynamics(CFD) analysis. Design variablesinclude pin cross-sectional areas, the number of fins, fin pitch, thickness of heatsink base, inlet air speed, fin heights, and fin orientations with respect to the base. Design constraints are defined in such a way as to make a heat sink usable and easy to manufacture. The optimum results obtained from SPEA2 are compared with the straight pin fin design results obtained from hybrid population-based incremental learning and differential evolution (PBIL-DE), SPEA2, and an unrestricted population size evolutionary multiobjective optimisation algorithm (UPSEMOA). The results indicate that the splayed pin-fin design using SPEA2 issuperiorto those reported in the literature.

• Nuclear Engineering and Technology
• /
• v.56 no.7
• /
• pp.2498-2515
• /
• 2024

In this study, we propose a fully parallelized adaptive particle refinement (APR) algorithm for smoothed particle hydrodynamics (SPH) to construct a stable and efficient multi-resolution computing system for nuclear safety analysis. The APR technique, widely employed by SPH research groups to adjust local particle resolutions, currently operates on a serialized algorithm. However, this serialized approach diminishes the computational efficiency of the system, negating the advantages of acceleration achieved through high-performance computing devices. To address this drawback, we propose a fully parallelized APR algorithm designed to enhance both efficiency and computational accuracy, facilitated by a new adaptive smoothing length model. For model validation, we simulated both hydrostatic and hydrodynamic benchmark cases in 2D and 3D environments. The results demonstrate improved computational efficiency compared to the conventional SPH method and APR with a serialized algorithm, and the model's accuracy was confirmed, revealing favorable outcomes near the resolution interface. Through the analysis of jet breakup, we verified the performance and accuracy of the model, emphasizing its applicability in practical nuclear safety analysis.

• International Journal of Computer Science & Network Security
• /
• v.23 no.4
• /
• pp.55-68
• /
• 2023

In recent years, the Television White Space (TVWS) has attracted the interest of many researchers due to its propagation characteristics obtainable between 470MHz and 790MHz spectrum bands. The plenty of unused channels in the TV spectrum allows the secondary users (SUs) to use the channels for broadband services especially in rural areas. However, when the number of SUs increases in the TVWS wireless network the aggregate interference also increases. Aggregate interferences are the combined harmful interferences that can include both co-channel and adjacent interferences. The aggregate interference on the side of Primary Users (PUs) has been extensively scrutinized. Therefore, resource allocation (power and spectrum) is crucial when designing the TVWS network to avoid interferences from Secondary Users (SUs) to PUs and among SUs themselves. This paper proposes a model to improve the resource allocation for reducing the aggregate interface among SUs for broadband services in rural areas. The proposed model uses joint power and spectrum hybrid Firefly algorithm (FA), Genetic algorithm (GA), and Particle Swarm Optimization algorithm (PSO) which is considered the Co-channel interference (CCI) and Adjacent Channel Interference (ACI). The algorithm is integrated with the admission control algorithm so that; there is a possibility to remove some of the SUs in the TVWS network whenever the SINR threshold for SUs and PU are not met. We considered the infeasible system whereby all SUs and PU may not be supported simultaneously. Therefore, we proposed a joint spectrum and power allocation with an admission control algorithm whose better complexity and performance than the ones which have been proposed in the existing algorithms in the literature. The performance of the proposed algorithm is compared using the metrics such as sum throughput, PU SINR, algorithm running time and SU SINR less than threshold and the results show that the PSOFAGA with ELGR admission control algorithm has best performance compared to GA, PSO, FA, and FAGAPSO algorithms.

• Journal of The Korean Association of Information Education
• /
• v.16 no.4
• /
• pp.463-474
• /
• 2012

The necessity of computer science education has been increased in the society which has been changing rapidly by the development of information science. But most elementary school teachers don't realize its necessity and don't recognize the notion of computational thinking which is the fundamental principle of computer science. In this research, we designed and implemented an algorithm learning program based on computational thinking with using Logo, which was for pre-service elementary school teachers to be able to realize the necessity of computer science education and recognize computational thinking. As the findings analyzed between pre- and post-test, the averages of correlational reasoning, combinatorial reasoning and the sum of overall logical thinking increased significantly. Also, participants' awareness of computer science education and computational thinking changed positively.

• Journal of The Korean Association of Information Education
• /
• v.23 no.6
• /
• pp.543-550
• /
• 2019

In 2006, Janet Wing defined computational thinking and operated SW education as a formal curriculum in the UK in 2013. This study collected related research papers by using computational thinking, which has recently increased in importance, and analyzed it using text mining. In the first, CONCOR analysis was conducted with the keyword of computational thinking. In the second, text mining of the components of computational thinking was selected by the repr23esentative academic journals at domestic and foreign. As a result of the two-time analysis, first, abstraction, algorithm, data processing, problem decomposition, and pattern recognition were the core of the study of computational thinking component. Second, research on convergence education centered on computational thinking and science and mathematics subjects was actively conducted. Third, research on computational thinking has been expanding since 2010. Research and development of the classification and definition of computational thinking and components and applying them to education sites should be conducted steadily.

• Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.226-249
• /
• 2016

The symbiotic organisms search (SOS) algorithm is an effective metaheuristic developed in 2014, which mimics the symbiotic relationship among the living beings, such as mutualism, commensalism, and parasitism, to survive in the ecosystem. In this study, three modified versions of the SOS algorithm are proposed by introducing adaptive benefit factors in the basic SOS algorithm to improve its efficiency. The basic SOS algorithm only considers benefit factors, whereas the proposed variants of the SOS algorithm, consider effective combinations of adaptive benefit factors and benefit factors to study their competence to lay down a good balance between exploration and exploitation of the search space. The proposed algorithms are tested to suit its applications to the engineering structures subjected to dynamic excitation, which may lead to undesirable vibrations. Structure optimization problems become more challenging if the shape and size variables are taken into account along with the frequency. To check the feasibility and effectiveness of the proposed algorithms, six different planar and space trusses are subjected to experimental analysis. The results obtained using the proposed methods are compared with those obtained using other optimization methods well established in the literature. The results reveal that the adaptive SOS algorithm is more reliable and efficient than the basic SOS algorithm and other state-of-the-art algorithms.