http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
윤기섭,김동욱,이수갑 대한기계학회 2019 JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY Vol.33 No.4
Since the 2000s, the advancing global economy has increased the demand for turboprop regional aircraft, and various studies have been conducted to resolve aircraft noise-related problems. Despite the progress made by previous studies, turboprop regional aircraft still have a poor noise environment compared to other vehicles. In addition, although an application of active noise control (ANC) method had improved the noise environment of the cabin, none of studies were conducted in consideration of a relationship between the application of ANC method and the resulting change of an (short-term) annoyance. Therefore, in the current study, an annoyance reduction evoked by active noise control (ANC) methodology on a turboprop regional aircraft cabin noise was investigated in three experiments. In the first experiment, 50 participants estimated the perception limit of psychoacoustic parameters on aircraft interior noise to identify the cognitive characteristic of the noise. Furthermore, the noise reduction achieved by applying ANC was identified based on the empirical results of the second experiment. Finally, the third experiment examined the relationship between psychoacoustic parameters (loudness and sharpness) and annoyance with the assistance of 50 participants. As a result, the difference between the noise reduction and the annoyance reduction was identified. Furthermore, the degree of annoyance reduction of implementing ANC in cabin noise was identified.
무제한 2차원 절단문제에 대해 개선된 최적-우선 분지한계 해법
윤기섭,강맹규,방성규 한국경영과학회 2005 韓國經營科學會誌 Vol.30 No.4
In this paper, we develop an improved branch and bound algorithm for the (un)weighted unconstrained two-dimensional cutting problem. In the proposed algorithm, we improve the branching strategies of the existing exact algorithm and reduce the size of problem by removing the dominated pieces from the problem. We apply the newly proposed definition of dominated cutting pattern and it can reduce the number of nodes that must be searched during the algorithm procedure. The efficiency of the proposed algorithm is presented through comparison with the exact algorithm known as the most efficient.
비가중 무제한 2차원 절단문제에 대한 최적-우선 분지한계 해법
윤기섭,윤희권,강맹규 한국산업경영시스템학회 2008 한국산업경영시스템학회 학술대회 Vol.2008 No.춘계
In this paper, a best-first branch and bound algorithm based upon the bottom-up approach for the unweighted unconstrained two-dimensional cutting problem is proposed to find the optimal solution to the problem. The algorithm uses simple and effective methods to prevent constructing duplicated patterns and reduces the searching space by dividing the branched node set. It also uses a efficient bounding strategy to fathom the set of patterns. Computational results are compared with well-known exact algorithms and demonstrate the efficiency of the proposed algorithm.