• Journal of Mechanical Science and Technology
• /
• v.17 no.11
• /
• pp.1784-1792
• /
• 2003

A hybrid method with supercompact multiwavelets is suggested as an efficient and practical method to compress CFD dataset. Supercompact multiwavelets provide various advantages such as compact support and orthogonality in CFD data compression. The compactness is a crucial condition for approximated representation of CFD data to avoid unnecessary interaction between remotely spaced data across various singularities such as shock and vortices. But the supercompact multiwavelet method has to fit the CFD grid size to a product of integer and power of two, m${\times}$2$^n$. To resolve this problem, the hybrid method with combination of 3, 2 and 1 dimensional version of wavelets is studied. With the hybrid method, any arbitrary size can be handled without any shrinkage or expansion of the original problem. The presented method allows high data compression ratio for fluid simulation data. Several numerical tests substantiate large data compression ratios for flow field simulation successfully.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.7
• /
• pp.85-89
• /
• 2000

In this paper, by extending the previously developed self- and mutual-radiation impedance calculation method for a regular-square vibrating surface by using numerical series, we proposed a method to obtain the self-radiation impedance of a rectangular transducer with an arbitrary integer ratio of the length to width. The proposed method exhibits high accuracy and a short computation time. After investigating the accuracy and computation time as the number of elements changes, we have calculated the self-radiation impedance of several rectangular transducers, and compared the results with those in the literature.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11C
• /
• pp.1045-1052
• /
• 2005

The symbol error probability of M-ary PSK (MPSK) and QAM (MQAM) systems using the branch with the largest signal-to-noise ratio (SNR) at the output of L-branch selection combining (SC) in frequency-nonselective slow Nakagami fading channels with an additive white Gaussian noise (AWGN) is derived theoretically For integer values of the Nakagami fading parameter m, the general formula for evaluating symbol error rate (SER) of MPSK signals in the independent branch diversity system comprises numerical analyses with the integral-form expressions. An exact closed-form SER performance of MQAM signals under the effect of SC diversity via numerical integration is presented. These performance evaluations allow designers to determine M-ary modulation methods for Nakagami fading channels.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.410-417
• /
• 2002

We consider the constraint based explicit routing problem in MPLS based IP Network. In this problem, we are given a set of traffic demands and a network with different link capacities. The problem is to assign the demand commodities to the paths in the network while minimizing the maximum link load ratio. We formulate this problem as an integer programming problem and propose an efficient column generation technique. To strengthen the formulation, we consider some valid inequalities. We also incorporate the column generation technique with variable fixing scheme Computational results show that the algorithm gives high quality solutions in a short execution time.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.429-438
• /
• 2012

This study presents two reversible data hiding schemes based on the coefficient shifting (CS) algorithm. The first scheme uses the CS algorithm with a mean predictor in the spatial domain to provide a large payload while minimizing distortion. To guard against manipulations, the second scheme uses a robust version of the CS algorithm with feature embedding implemented in the integer wavelet transform domain. Simulations demonstrate that both the payload and peak signal-to-noise ratio generated by the CS algorithm with a mean predictor are better than those generated by existing techniques. In addition, the marked images generated by the variant of the CS algorithm are robust to various manipulations created by JPEG2000 compression, JPEG compression, noise additions, (edge) sharpening, low-pass filtering, bit truncation, brightness, contrast, (color) quantization, winding, zigzag and poster edge distortion, and inversion.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.36
• /
• pp.105-112
• /
• 1995

This paper presents that model 1 is to show an approach to determining unidirection or bidirection of the optimal flow path design, model 2 is to show the design of an AGV can determine the minimum number of required vehicles. Our purposes of this article are that first, it is easy to see that computationlly advanced efficient procedure with some pairwises of comparision, zero-one integer and northwest rule by using, second, to determine the minimum number of vehicles in the layout for manufacturing facility, we used a coefficient ratio with moved numbers of loaded & unloaded vehicles between stations and available time of AGV's capacity for per shift per vehicle. Example is presented to demonstrate the approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.1007-1017
• /
• 1997

The existing survivability measure is defined as the only ratio of survival traffic volume on the given traffic demand. In this paper we suggest a new network survivability evaluation model. Sinceit depends on the importance of traffic, we can evaluatethe affect of telecommunication disaster. With the suggested evaluation model we formulate optimization models for restoration paths and traffic assinment on them. The optimization models are represented as mixed integer programming problems, which are difficult to find exact solutions. We develop heuristic algorithms according to the optimization models and apply them to an example network with 10 nodes and 17 links.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.49
• /
• pp.1-10
• /
• 1999

A cost minimization model for designing AS/RS (Automated Storage/Retrieval Systems) has been developed, whose objective function includes penalty cost caused by the incapability of meeting throughput rate requirements as well as S/R machine cost, storage rack cost, and interface conveyor cost. Since the model is a nonlinear integer programming problem which is very hard to solve with large problem size the problem is divided into four cases according to the ratio of horizontal S/R machine speed to its vertical speed and the existence of the penalty cost. A solution procedure is developed which solves each problem exactly under the different number of S/R machines.

• East Asian mathematical journal
• /
• v.37 no.5
• /
• pp.613-617
• /
• 2021

Abstract. For a positive square-free integer m, let K = ℚ($\sqrt{m}$) be a real quadratic field. The relative class number H_d(f) of K of discriminant d is the ratio of class numbers 𝒪_K and 𝒪_f, where 𝒪_K is the ring of integers of K and 𝒪_f is the order of conductor f given by ℤ + f𝒪_K. In 1856, Dirichlet showed that for certain m there exists an infinite number of f such that the relative class number H_d(f) is one. But it remained open as to whether there exists such an f for each m. In this paper, we give a result for existence of real quadratic field ℚ($\sqrt{m}$) with relative class number one where the period of continued fraction expansion of $\sqrt{m}$ is 6.

• ETRI Journal
• /
• v.41 no.2
• /
• pp.207-223
• /
• 2019

Network function virtualization can significantly improve the flexibility and effectiveness of network appliances via a mapping process called service function chaining. However, the failure of any single virtualized network function causes the breakdown of the entire chain, which results in resource wastage, delays, and significant data loss. Redundancy can be used to protect network appliances; however, when failures occur, it may significantly degrade network efficiency. In addition, it is difficult to efficiently map the primary and backups to optimize the management cost and service reliability without violating the capacity, delay, and reliability constraints, which is referred to as the reliability-aware service chaining mapping problem. In this paper, a mixed integer linear programming formulation is provided to address this problem along with a novel online algorithm that adopts the joint protection redundancy model and novel backup selection scheme. The results show that the proposed algorithm can significantly improve the request acceptance ratio and reduce the consumption of physical resources compared to existing backup algorithms.