• 소성∙가공
• /
• 제12권7호
• /
• pp.615-622
• /
• 2003

In the automobile industry, the design of optimal blank shape becomes a significant part of the stamping. It provides many evident advantages, sush as enhancement of formability, reduction of material cost and product development period. However, the nesting process, required for the optimal usage of materials in the blanking becomes more complicated as the blank shape becomes complicated, like most optimal blank shape. In this study, stamping process optimization system for the optimal usage of material has been developed through the integration of optimal blank design and optimal nesting. For optimal blank design, a radius vector method, the modified version of the initial nodal velocity method, the past work of the present author, have been proposed. Both the optimal blank design and optimal nesting programs have been developed under the GUI environment for the convenience of engineers. The efficiency of the optimization system has been verified with some chosen problems.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2009년도 춘계학술대회 논문집
• /
• pp.41-42
• /
• 2009

• The Journal of the Acoustical Society of Korea
• /
• 제18권3E호
• /
• pp.37-43
• /
• 1999

In this paper, we present a new technique for the optimal local decomposition of convex structuring elements on a hexagonal grid, which are used as templates for morphological image processing. Each basis structuring element in a local decomposition is a local convex structuring element, which can be contained in hexagonal window centered at the origin. Generally, local decomposition of a structuring element results in great savings in the processing time for computing morphological operations. First, we define a convex structuring element on a hexagonal grid and formulate the necessary and sufficient conditions to decompose a convex structuring element into the set of basis convex structuring elements. Further, a cost function was defined to represent the amount of computation or execution time required for performing dilations on different computing environments and by different implementation methods. Then the decomposition condition and the cost function are applied to find the optimal local decomposition of convex structuring elements, which guarantees the minimal amount of computation for morphological operation. Simulation shows that optimal local decomposition results in great reduction in the amount of computation for morphological operations. Our technique is general and flexible since different cost functions could be used to achieve optimal local decomposition for different computing environments and implementation methods.

• Journal of Information Processing Systems
• /
• 제2권2호
• /
• pp.88-94
• /
• 2006

In wireless cellular networks, previous researches on admission control policies and resource allocation algorithm considered the QoS (Quality of Service) in terms of CDP (Call Dropping Probability) and CBP (Call Blocking Probability). However, since the QoS was considered only within a predetermined cell capacity, the results indicated a serious overload problem of systems not guaranteeing both CDP and CBP constraints, especially in the hotspot cell. That is why a close interrelationship between CDP, CBP and cell capacity exists. Thus, it is indispensable to consider optimal cell capacity guaranteeing multiple QoS (CDP and CBP) at the time of initial cell planning for networks deployment. In this paper, we will suggest a distributed determination scheme of optimal cell capacity guaranteeing both CDP and CBP from a long-term perspective for initial cell planning. The cell-provisioning scheme is performed by using both the two-dimensional continuous-time Markov chain and an iterative method called the Gauss-Seidel method. Finally, numerical and simulation results will demonstrate that our scheme successfully determines an optimal cell capacity guaranteeing both CDP and CBP constraints for initial cell planning.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1859-1864
• /
• 2004

An effective methodology is reported for the optimal design of multisite batch production/transportation and storage networks under uncertain demand forecasting. We assume that any given storage unit can store one material type which can be purchased from suppliers, internally produced, internally consumed, transported to or from other plant sites and/or sold to customers. We further assume that a storage unit is connected to all processing and transportation stages that consume/produce or move the material to which that storage unit is dedicated. Each processing stage transforms a set of feedstock materials or intermediates into a set of products with constant conversion factors. A batch transportation process can transfer one material or multiple materials at once between plant sites. The objective for optimization is to minimize the probability averaged total cost composed of raw material procurement, processing setup, transportation setup and inventory holding costs as well as the capital costs of processing stages and storage units. A novel production and inventory analysis formulation, the PSW(Periodic Square Wave) model, provides useful expressions for the upper/lower bounds and average level of the storage inventory. The expressions for the Kuhn-Tucker conditions of the optimization problem can be reduced to two sub-problems. The first yields analytical solutions for determining lot sizes while the second is a separable concave minimization network flow subproblem whose solution yields the average material flow rates through the networks for the given demand forecast scenario. The result of this study will contribute to the optimal design and operation of large-scale supply chain system.

• 한국위성정보통신학회논문지
• /
• 제8권4호
• /
• pp.100-104
• /
• 2013

본 논문은 열영상 기반의 화염 검출을 위한 기존의 문턱치 설정 기법들을 분석하고 최적 문턱치 설정 방안을 제시한다. 기존의 열영상 기반의 화염검출 알고리즘들은 보통 고정 문턱치를 이용하여 화염 후보영역을 추출하고 후처리를 통해 화염 검출을 최종 판정하므로 화염 후보영역의 결정 과정은 최종 화재 검출 결과에 많은 영향을 준다. 따라서 카메라의 종류나 운영 환경에 따라 입력 영상의 대비와 밝기의 변화가 발생하기 때문에 화염 검출 문턱치는 입력영상의 특성에 연동하여 설정되어져야 한다. 따라서 최적 문턱치 설정 방안을 제시하기 위해 고정 명암도, 평균값, 표준편차 및 최대값을 이용한 문턱치 설정 기법들을 비교 분석하였다. 결론적으로 최적 문턱치는 평균과 표준편차의 합보다 크며 최대값 보다는 작은 값으로 설정 한다면 화염 검출 정확도가 기존 고정 문턱치 방식에 비해 크게 개선될 것으로 기대된다.

• 한국해양바이오학회지
• /
• 제14권1호
• /
• pp.9-24
• /
• 2022

Low-molecular weight peptides derived from fish collagen exhibit several bioactivities, including antioxidant, antiwrinkle, antimicrobial, antidiabetic, and antihypertension effects. These peptides are also involved in triglyceride suppression and memory improvement. This study aimed to investigate the optimal processing condition for preparing low-molecular weight peptides from flounder skin, and the properties of the hydrolysate. The optimal processing conditions for peptic hydrolysis were as follows: a ratio of pepsin to dried skin powder of 2% (w/w), pH of 2.0, and a temperature of 50℃. Peptic hydrolysate contains several low-molecular weight peptides below 300 Da. Gly-Pro-Hyp(GPHyp) peptide, a process control index, was detected only in peptic hydrolysate on matrix-assisted laser desorption/ionization-time-of-flight(MALDI-TOF) spectrum. 2,2'-azinobis-(3-3-ethylbenzothiazolline-6- sulfonic acid(ABTS) radical scavenging activity of the peptic hydrolysate was comparable to that of 1 mM ascorbic acid, which was used as a positive control at pH 5.5, whereas collagenase inhibition was five times higher with the peptic hydrolysate than with 1 mM ascorbic acid at pH 7.5. However, the tyrosinase inhibition ability of the peptic hydrolysate was lower than that of arbutin, which was used as a positive control. The antibacterial effect of the peptic hydrolysate against Propionibacterium acne was not observed. These results suggest that the peptic hydrolysate derived from a flounder skin is a promising antiwrinkle agent that can be used in various food and cosmetic products to prevent wrinkles caused by ultraviolet radiations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권8호
• /
• pp.2881-2894
• /
• 2014

In complicated environment, context information plays an important role in image segmentation/labeling. The recently proposed auto-context algorithm is one of the effective context-based methods. However, the standard auto-context approach samples the context locations utilizing a fixed radius sequence, which is sensitive to large scale-change of objects. In this paper, we present a scale invariant auto-context (SIAC) algorithm which is an improved version of the auto-context algorithm. In order to achieve scale-invariance, we try to approximate the optimal scale for the image in an iterative way and adopt the corresponding optimal radius sequence for context location sampling, both in training and testing. In each iteration of the proposed SIAC algorithm, we use the current classification map to estimate the image scale, and the corresponding radius sequence is then used for choosing context locations. The algorithm iteratively updates the classification maps, as well as the image scales, until convergence. We demonstrate the SIAC algorithm on several image segmentation/labeling tasks. The results demonstrate improvement over the standard auto-context algorithm when large scale-change of objects exists.

• 융합신호처리학회 학술대회논문집
• /
• 한국신호처리시스템학회 2005년도 추계학술대회 논문집
• /
• pp.306-309
• /
• 2005

We consider the multi-objective optimization of a multi-service arrayed-waveguide grating-based single-hop metro WDM network with the two conflicting objectives of maximizing throughput while minimizing delay. We develop and evaluate a genetic algorithm based methodology for finding the optimal throughput-delay tradeoff curve, the so-called Pareto-optimal frontier. Our methodology provides the network architecture and the Medium Access Control protocol parameters that achieve the Pareto-optima in a computationally efficient manner. The numerical results obtained with our methodology provide the Pareto-optimal network planning and operation solution for a wide range of traffic scenarios. The presented methodology is applicable to other networks with a similar throughput-delay tradeoff.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1608-1611
• /
• 2004

Anti-lock brake systems (ABS) are being increasingly used in a wide range of applications due to safety. This paper deals with a high performance optimal sliding mode controller for slip-ratio control in the ABS. In this approach a sliding surface square is considered as an appropriate cost function. The optimum brake torque as a system input is determined by minimizing the cost function and used in the controller. Simulation results reveal the effectiveness of the proposed sliding mode controller.