• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2670-2685
• /
• 2020

Flying ad-hoc networks (FANETs) is a vibrant research area nowadays. This type of network ranges from various military and civilian applications. FANET is formed by micro and macro UAVs. Among many other problems, there are two main issues in FANET. Limited energy and high mobility of FANET nodes effect the flight time and routing directly. Clustering is a remedy to handle these types of problems. In this paper, an efficient clustering technique is proposed to handle routing and energy problems. Transmission range of FANET nodes is dynamically tuned accordingly as per their operational requirement. By optimizing the transmission range packet loss ratio (PLR) is minimized and link quality is improved which leads towards reduced energy consumption. To elect optimal cluster heads (CHs) based on their fitness we use k-means. Selection of optimal CHs reduce the routing overhead and improves energy consumption. Our proposed scheme outclasses the existing state-of-the-art techniques, ACO based CACONET and PSO based CLPSO, in terms of energy consumption and cluster building time.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.2
• /
• pp.96-102
• /
• 2014

The embedded processor market has grown rapidly and consistently with the appearance of mobile devices. In an embedded system, the power consumption and execution time are important factors affecting the performance. The system performance is determined by both hardware and software. Although the hardware architecture is high-end, the software runs slowly due to the low quality of codes. This study compared the performance of two major compilers, LLVM and GCC on a32-bit EISC embedded processor. The dynamic instructions and static code sizes were evaluated from these compilers with the EEMBC benchmarks.LLVM generally performed better in the ALU intensive benchmarks, whereas GCC produced a better register allocation and jump optimization. The dynamic instruction count and static code of GCCwere on average 8% and 7% lower than those of LLVM, respectively.

• International Journal of Computer Science & Network Security
• /
• v.24 no.3
• /
• pp.12-22
• /
• 2024

The travelling salesman problem is very famous and very difficult combinatorial optimization problem that has several applications in operations research, computer science and industrial engineering. As the problem is difficult, finding its optimal solution is computationally very difficult. Thus, several researchers have developed heuristic/metaheuristic algorithms for finding heuristic solutions to the problem instances. In this present study, a new hybrid genetic algorithm (HGA) is suggested to find heuristic solution to the problem. In our HGA we used comprehensive sequential constructive crossover, adaptive mutation, 2-opt search and a new local search algorithm along with a replacement method, then executed our HGA on some standard TSPLIB problem instances, and finally, we compared our HGA with simple genetic algorithm and an existing state-of-the-art method. The experimental studies show the effectiveness of our proposed HGA for the problem.

• Proceedings of the KSME Conference
• /
• 2003.04a
• /
• pp.1234-1239
• /
• 2003

In the product design process computer-aided engineering and optimization tools are widely utilized in order to reduce the total development time and cost. Since several simulation tools are involved in the process, information losses, omissions, or errors are common and the importance of seamless information exchange among the tools has been increased. In this study ISO STEP standards are adopted to represent the neutral format for CAE/CAO information exchange. The schema of AP209 is used to define the information of finite element analysis and the new schema is proposed to describe the information of structural optimization based on the STEP methodology. The schema is implemented by EXPRESS, information modeling language, and ST-Developer is employed to generate C++ classes and STEP Rose Library by using the schema denoted. To substantiate the proposed approach, the information access interfaces of the finite element modeling software (FEMAP), structural optimization software (GENESIS) and in-house topology optimization program are developed. Examples of the size optimization of a three-bar truss and topology optimization of a MBB beam are shown to validate the information exchange of finite element analysis and structural optimization using STEP standards.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.16 no.3
• /
• pp.119-124
• /
• 2017

Machining optimization using typical computer-aided manufacturing (CAM) software mainly depends on tool paths, and it is impossible to predict the behavior of material or cutting force. In this paper, cutting force analysis simulation is performed on the Unibody Case of a mobile phone with the aim of optimizing cutting-force-based machining using the Third Wave Systems' AdventEdge Production Module. Machining time after optimization was shortened by 42% for roughing compared to pre-optimization, and actual machining time was reduced by 36.8%. For finishing, machining time was reduced by 92%, and actual machining time was reduced around 90%. A surface roughness analysis found that the post-optimization surface roughness was $1.16{\mu}m$ Ra, compared to a pre-optimization value of $1.75{\mu}m$ Ra.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.1951-1972
• /
• 2018

Wi-Fi Access Point (AP) optimization approaches are used in indoor positioning systems for signal coverage enhancement, as well as positioning precision improvement. Although the huge power consumption of the AP optimization forms a serious problem due to the signal coverage requirement for large-scale indoor environment, the conventional approaches treat the problem of power consumption independent from the design of indoor positioning systems. This paper proposes a new Fast Water-filling algorithm Group Power Constraint (FWA-GPC) based Wi-Fi AP optimization approach for indoor positioning in which the power consumed by the AP optimization is significantly considered. This paper has three contributions. First, it is not restricted to conventional concept of one AP for one candidate AP location, but considered spare APs once the active APs break off. Second, it utilizes the concept of water-filling model from adaptive channel power allocation to calculate the number of APs for each candidate AP location by maximizing the location fingerprint discrimination. Third, it uses a fast version, namely Fast Water-filling algorithm, to search for the optimal solution efficiently. The experimental results conducted in two typical indoor Wi-Fi environments prove that the proposed FWA-GPC performs better than the conventional AP optimization approaches.

• Steel and Composite Structures
• /
• v.47 no.5
• /
• pp.601-613
• /
• 2023

Numerous methods have been proposed in predicting formability of sheet metals based on microstructural and macro-scale properties of sheets. However, there are limited number of papers on the optimization problem to increase formability of sheet metals. In the present study, we aim to use novel optimization algorithms in neural networks to maximize the formability of sheet metals based on tensile curve and texture of aluminum sheet metals. In this regard, experimental and numerical evaluations of effects of texture and tensile properties are conducted. The texture effects evaluation is performed using Taylor homogenization method. The data obtained from these evaluations are gathered and utilized to train and validate an artificial neural network (ANN) with different optimization methods. Several optimization method including grey wolf algorithm (GWA), chimp optimization algorithm (ChOA) and whale optimization algorithm (WOA) are engaged in the optimization problems. The results demonstrated that in aluminum alloys the most preferable texture is cube texture for the most formable sheets. On the other hand, slight differences in the tensile behavior of the aluminum sheets in other similar conditions impose no significant decreases in the forming limit diagram under stretch loading conditions.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.30 no.7
• /
• pp.68-80
• /
• 2002

An approach for composing a performance optimized computational code is suggested for latest microprocessors. The concept of the code optimization, called here as localization, is maximizing the utilization of the second level cache that is common to all the latest computer system, and minimizing the access to system main memory. In this study, the localized optimization of LU-SGS (Lower-Upper Symmetric Gauss-Seidel) code for the solution of fluid dynamic equations was carried out in three different levels and tested for several different microprocessor architectures most widely used in these days. The test results of localized optimization showed a remarkable performance gain up to 7.35 times faster solution, depending on the system, than the baseline algorithm for producing exactly the same solution on the same computer system.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.10
• /
• pp.27-35
• /
• 2021

Local search has been used to solve various combinatorial optimization problems. One of the most important factors in local search is the method of generating a neighbor solution. In this paper, we propose neighbor generation strategies of local search for permutation-based combinatorial optimization, and compare the performance of each strategies targeting the traveling salesman problem. In this paper, we propose a total of 10 neighbor generation strategies. Basically, we propose 4 new strategies such as Rotation in addition to the 4 strategies such as Swap which have been widely used in the past. In addition, there are Combined1 and Combined2, which are made by combining basic neighbor generation strategies. The experiment was performed by applying the basic local search, but changing only the neighbor generation strategy. As a result of the experiment, it was confirmed that the performance difference is large according to the neighbor generation strategy, and also confirmed that the performance of Combined2 is the best. In addition, it was confirmed that Combined2 shows better performance than the existing local search methods.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.7
• /
• pp.1-7
• /
• 2021

In this paper, we propose a feature selection technique for multi-label classification. Many existing feature selection techniques have selected features by calculating the relation between features and labels such as a mutual information scale. However, since the mutual information measure requires a joint probability, it is difficult to calculate the joint probability from an actual premise feature set. Therefore, it has the disadvantage that only a few features can be calculated and only local optimization is possible. Away from this regional optimization problem, we propose a feature selection technique that constructs a low-rank space in the entire given feature space and selects features with sparsity. To this end, we designed a regression-based objective function using Nuclear norm, and proposed an algorithm of gradient descent method to solve the optimization problem of this objective function. Based on the results of multi-label classification experiments on four data and three multi-label classification performance, the proposed methodology showed better performance than the existing feature selection technique. In addition, it was showed by experimental results that the performance change is insensitive even to the parameter value change of the proposed objective function.