• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.147-158
• /
• 1995

In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solution of a bicriterion linear program. We show that problem (P) can arise in a variety of practical situations. Since the efficient set is in general a nonoconvex set, problem (P) can be classified as a global optimization problem. The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations. The algorithm can be easily implemented using only linear programming method.

• Korean Journal of Mathematics
• /
• v.31 no.3
• /
• pp.305-311
• /
• 2023

We exhibit some properties of the weighted Berezin transform T_αf on L^∞(B_n) and on L¹(B_n). As the main result, we prove that if f ∈ L^∞(B_n) with lim_k→∞ T^k_αf exists, then there exist unique M-harmonic function g and $h{\in}{\bar{(I-T_{\alpha})L^{\infty}(B_n)}}$ such that f = g + h. We also show that of the norm of weighted Berezin operator T_α on L¹(B_n, ν) converges to 1 as α tends to infinity, where ν is an ordinary Lebesgue measure.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.84-90
• /
• 2023

In this article the problem of computing floating-point reciprocal cube root functions is considered. Our new algorithms for this task decrease the number of arithmetic operations used for computing $1/{\sqrt[3]{x}}$. A new approach for selection of magic constants is presented in order to minimize the computation time for reciprocal cube roots of arguments with movable decimal point. The underlying theory enables partitioning of the base argument range x∈[1,8) into 3 segments, what in turn increases accuracy of initial function approximation and decreases the number of iterations to one. Three best algorithms were implemented and carefully tested on 32-bit microcontroller with ARM core. Their custom C implementations were favourable compared with the algorithm based on cbrtf(x) function taken from C ＜math.h＞ library on three different hardware platforms. As a result, the new fast approximation algorithm for the function $1/{\sqrt[3]{x}}$ was determined that outperforms all other algorithms in terms of computation time and cycle count.

• Nuclear Engineering and Technology
• /
• v.52 no.3
• /
• pp.461-468
• /
• 2020

The improvements of the DeCART/MUSAD code system for uncertainty analysis of HTGR neutronic parameters are presented in this paper. The function for quantifying an uncertainty of critical-spectrumweighted few group cross section was implemented using the generalized adjoint B₁ equation solver. Though the changes between the infinite and critical spectra cause a considerable difference in the contribution by the graphite scattering cross section, it does not significantly affect the total uncertainty. To reduce the number of iterations of the generalized adjoint transport equation solver, the generalized adjoint B₁ solution was used as the initial value for it and the number of iterations decreased to 50%. To reflect the implicit uncertainty, the correction factor was derived with the resonance integral. Moreover, an additional correction factor for the double heterogeneity was derived with the effective cross section of the DH region and it reduces the difference from the complete uncertainty. The code system was examined with the MHTGR-350 Ex.II-2 3D core benchmark. The k_eff uncertainty for Ex.II-2a with only the fresh fuel block was similar to that of the block and the uncertainty for Ex.II-2b with the fresh fuel and the burnt fuel blocks was smaller than that of the fresh fuel block.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.8
• /
• pp.2666-2687
• /
• 2022

As a new alternative communication scheme in 5G, unmanned aerial vehicle (UAV) is used as a relay in the remote base station (BS) for assistant communication. In order to ameliorate the quality of the backhaul link, a UAV backhaul transmission scheme based on improved Nash equilibrium (NE) strategy is proposed. First, the capacity of air-to-ground (A2G) channel by the link preprocess is maximized. Then, the maximum utility function of each UAV is used as the basis of obtaining NE point according to the backhaul channel and the backhaul congestion. Finally, the improved NE strategy is applied in multiple iterations until maximum utility functions of all the UAVs are reached, and the UAVs which are rejected by air-to-air (A2A) link during the process would participate in the source recovery process to construct a multi-hop backhaul network. Simulation results show that average effective backhaul rate, minimum effective backhaul rate increases by 10%, 28.5% respectively in ideal A2G channel, and 11.8%, 42.3% respectively in fading channel, comparing to pure NE strategy. And the average number of iterations is decreased by 5%.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.4
• /
• pp.735-741
• /
• 2009

This paper presents an algorithm for the permanent magnet shape optimization of a large scale BLDC(Brushless DC) motor to minimize the cogging torque. A response surface method (RSM) using multiquadric radial basis function is employed to interpolate the objective function in design parameter space. In order to get a reasonable response surface with relatively small number of sampling data points, additional sampling points are added on the basis of design sensitivity analysis computed by using FEM. The algorithm has 2 stages: the first stage is to determine the PM arc angle, and the 2nd stage is to optimize the magnet pole shape. The developed algorithm is applied to a 5MW BLDC motor to get a minimum cogging torque. After 3 iterations with 4 design parameters, the cogging torque is reduced to 13.2% of the initial one.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.4
• /
• pp.713-724
• /
• 2011

We study the dynamics of transcendental entire functions with Siegel disks whose singular values are just two points. One of the two singular values is not only a superattracting fixed point with multiplicity more than two but also an asymptotic value. Another one is a critical value with free dynamics under iterations. We prove that if the multiplicity of the superattracting fixed point is large enough, then the restriction of the transcendental entire function near the Siegel point is a quadratic-like map. Therefore the Siegel disk and its boundary correspond to those of some quadratic polynomial at the level of quasiconformality. As its applications, the logarithmic lift of the above transcendental entire function has a wandering domain whose shape looks like a Siegel disk of a quadratic polynomial.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.436-441
• /
• 2008

One of important factors in designing array-type MEMS resonators is obtaining a desired frequency response function (FRF) within a specific range. In this paper Krylov subspace-based model order reduction using moment-matching with non-zero expansion points is represented to calculate the FRF of array-type resonators. By matching moments at a frequency around a specific range of the array-type resonators, required FRFs can be efficiently calculated with significantly reduced systems regardless of their operating frequencies. In addition, because of the characteristics of moment-matching method, a minimal order of reduced system with a specified accuracy can be determined through an error indicator using successive reduced models, which is very useful to automate the order reduction process and FRF calculation for structural optimization iterations.

• Bulletin of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.113-119
• /
• 2010

If f is M-harmonic and integrable with respect to a weighted radial measure $\upsilon_{\alpha}$ over the unit ball $B_n$ of $\mathbb{C}^n$, then $\int_{B_n}(f\circ\psi)d\upsilon_{\alpha}=f(\psi(0))$ for every $\psi{\in}Aut(B_n)$. Equivalently f is fixed by the weighted Berezin transform; $T_{\alpha}f = f$. In this paper, we show that if a function f defined on $B_n$ satisfies $R(f\circ\phi){\in}L^{\infty}(B_n)$ for every $\phi{\in}Aut(B_n)$ and Sf = rf for some |r|=1, where S is any convex combination of the iterations of $T_{\alpha}$'s, then f is M-harmonic.

• Journal of Information Processing Systems
• /
• v.14 no.5
• /
• pp.1237-1253
• /
• 2018

Harmony search algorithm is an emerging meta-heuristic optimization algorithm, which is inspired by the music improvisation process and can solve different optimization problems. In order to further improve the performance of the algorithm, this paper proposes an improved harmony search algorithm. Key parameters including harmonic memory consideration (HMCR), pitch adjustment rate (PAR), and bandwidth (BW) are optimized as the number of iterations increases. Meanwhile, referring to the genetic algorithm, an improved method to generate a new crossover solutions rather than the traditional mechanism of improvisation. Four complex function optimization and pressure vessel optimization problems were simulated using the optimization algorithm of standard harmony search algorithm, improved harmony search algorithm and exploratory harmony search algorithm. The simulation results show that the algorithm improves the ability to find global search and evolutionary speed. Optimization effect simulation results are satisfactory.