• International Journal of Advanced Culture Technology
• /
• v.9 no.2
• /
• pp.91-99
• /
• 2021

In Korea, some pharmaceutical companies and agricultural machine manufacturers associate the length of the credit period with the retailer's order size. This kind of commercial practice is based on the principle of economy of scale from the supplier's point of view and tends to make retailer's order size large enough to qualify a certain credit period break. Also, the credit period allowed by the supplier makes it possible to reduce the retail price expecting that the retailer can earn more profits by the stimulating the customer's demand. Since the retailer's order size is affected by the end customer's demand, it is reasonable to determine the retail price and the order size simultaneously. In this regard, this paper analyzes the retailer's problem who has to decide his sales price and order quantity from a supplier who offers different credit periods depending on his order size. And we show that the retailer's order size large enough to qualify a certain credit period break. Also, it is assumed that the end customer's demand rate is represented by a linear decreasing function of the retail price.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.10
• /
• pp.2001-2013
• /
• 1994

In this paper, the method of processing a blurred noisy image has been researched. The conventional method of processing signal has faluts which are slow convergence speed and long time-consuming process at the singular point and or in the ill condition. There is the process, the Gauss Seidel's method to remove these faults, but it takes too much time because it processed singnal repeatedly. For overcoming the faults, this paper shows a image restoration method which takes shorter than the Gauss-Seidel's by comparing the Gauss Seidel's with proposed alogorithm and accelerating convergence speed at the singular point and/or in the ill condition. In this paper, the conventional process method(Gauss-Seidel) and proposed optimal algorithm were used to get a standard image($256{\times}56{\times}bits$). and then the results are simulated and compared each other in order to examine the variance of MSE(Mean Square Error) by the acceleration parameter in the proposed image restoration. The result of the signal process and the process time was measured at all change of acceleration parameter in order to verify the effectveness of the proposed algorithm.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.34 no.1
• /
• pp.42-48
• /
• 2006

In this study, a repetitive response surface enhancement technique (RRSET) is proposed as a new system approximation method for the efficient multidisciplinary design and optimization (MDO). In order to represent the highly nonlinear behavior of the response with second order polynomials, RRSET introduces a design space transformation using stretching functions and repetitive response surface improvement. The tentative optimal point is repetitively included to the set of experimental points to better approximate the response surface of the system especially near the optimal point, hence a response surface with significantly improved accuracy can be generated with very small experimental points and system iterations. As a system optimizer, the simulated annealing, which generates a global design solution is utilized. The proposed technique is applied to several numerical examples, and demonstrates the validity and efficiency of the method. With its improved approximation accuracy, the RRSET can contribute to resolve large and complex system design problems under MDO environment.

• Journal of Korean Society for Quality Management
• /
• v.50 no.4
• /
• pp.793-810
• /
• 2022

Purpose: As improving the search performance of aviation security equipment is considered essential, this study proposes the need for research on how to find an optimized test sequence that can reduce test time and operator power during the search function test of explosive detection systems. We derive the weights and work difficulty adjustment factor required to find the optimized test order. Methods: First, after setting the test factors, the time of each test and the difficulty scale determined by the worker who performed the test directly were used to derive weights. Second, the work difficulty adjustment coefficient was determined by combining the basic weight adjustment factor and corresponding to the body part used by the test using objective rating. Then the final standard time was derived by calculating the additional weights for the changeability of the test factors. Results: The order in which the final standard time is minimized when 50 tests are performed was defined as the optimized order. 50 tests should be conducted without duplication and the optimal order of tests was obtained when compared to previously numbered tests. As a result of minimizing the total standard time by using Excel's solver parameters, it was reduced by 379.14 seconds, about 6.32 minutes. Conclusion: We tried to express it in mathematical formulas to propose a method for setting an optimized test sequence even when testing is performed on other aviation security equipment. As a result, the optimal test order was derived from the operator's point of view, and it was demonstrated by minimizing the total standard time.

• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2000.05a
• /
• pp.16-21
• /
• 2000

In this paper we design a GA-fuzzy controller for position control and anti-swing at the destination point. Applied genetic algorithm is used to complement the demerit such as the difficulty of the component selection of fuzzy controller namely scaling factor membership function and control rules. lagrange equation is used to represent the motion equation of trolley and load in order to obtain mathematical modelling. Simulation results show that the proposed control technique is superior to a conventional optimal control in destination point moving and modification.

• Journal of the Korean Society of Safety
• /
• v.12 no.3
• /
• pp.23-29
• /
• 1997

In the control of crane system, the traversing time of the trolley must be reduced as much as possible and the swing must be stopped at the end point. To design the minimum time control system, Pontryagim maximum principle is applied. In order to implement the control algorithm, the dynamic equation is linearlized at an equilibrium point, so that the linear time invariant state equation can be obtained. The overall performance of the closed loop system is evaluated by means of computer simulations and practical experiments in a broad range of working conditions. The effectiveness is proved through the experimental results for the anti-sway control of the load and the position control of trolly. It is expected that the proposed system will make an important contribution to the industrial fields.

• Journal of Korea Multimedia Society
• /
• v.8 no.10
• /
• pp.1329-1336
• /
• 2005

We propose an optimal edge detection algorithm adaptive to the various widths of edges. In order to construct this algorithm, we introduce an alternative definition of edge point and generalize the directional derivatives in the pixel space to obtain an extended directional derivatives beyond scaling. The result from applying our algorithm to a 2D image is analyzed comparing to that from the other algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.334-339
• /
• 1994

In this work, we propose a planar three degree-of-freedom parallel mechanism as another type of assembly device which utilized joint compliances. These joint compliances can be adjusted either by properly replacing the joint compliances or by actively controlling stiffness at joints, in order to generate the desired operational compliance characteristics at RCC point, The operational compliance matrix for this mechanism is explicitly obtained by symbolic manipulation and its operational compliance characteristics are examined, it is found that the RCC point exists at the center of the workspace when the mechanism maintains symmetric configurations. Compliance characteristic and its sensitivity of this mechanism is analyzed with respect to the magnitude of the diagonal compliance components and two different matrix norms measuring compliance sensitivity. It is expected that the analysis results provide the designer with a helpful information to determine a set of optimal parameters of this RCC mechanism.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.5 no.3
• /
• pp.22-30
• /
• 1996

In order to compensate for out-of-straightness of shafts, an automatic straightening process composed of an automatic measuring module, an automatic control unit and operating softwares was developed with a hydraulic press. The out-of-sraightness of each shaft was measured automatically in the measuring stage. An optimal pressure point was determined to minimize TIR value of the shaft according to press count of 3-points bending process. In the geometric adaptive control procedure, punch stroke and springback of the shaft were predicted by an observer using on-line measured values of press force and deflection amount I each press count. An automatic straightening machine was realized with the measuring module, the GAC module, PLD, IBM-PC and the operating software on the hydraulic press. the validity of the proposed straightening process was confirmed through a series of experiments with cam shafts.

• Smart Media Journal
• /
• v.7 no.2
• /
• pp.9-14
• /
• 2018

The k-ary n-cube $Q^k_n$ is widely used in the design and implementation of parallel and distributed processing architectures. It consists of $k^n$ identical nodes, each node having degree 2n is connected through bidirectional, point-to-point communication channels to different neighbors. On $Q^k_n$ we would like to transmit packets from a source node to 2n destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $0{\leq}i{\leq}2n-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(n^3)$ routing algorithm on $Q^k_n$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.