http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
박범수 ( Bumsoo Park ),안우근 ( Woogeun Ahn ),이장용 ( Jangyong Lee ),고덕곤 ( Duck Kon Ko ) 한국항행학회 2022 韓國航行學會論文誌 Vol.26 No.1
종래 유도탄의 경우 대부분 유도탄의 전방부에 GPS (Global Positioning System) 안테나가 장착되는 경우가 많아 종말 유도단계에서 수직 낙하하는 유도탄의 경우 GPS 안테나가 전방부에 위치하면 동체에 의한 위성 신호 가림 현상이 생겨 GPS 성능이 떨어진다. 본 논문에서는 위성 신호에 대한 가시영역을 최대로 확보하기 위해 GPS 안테나를 유도탄의 후방 부에 기울임을 주어 배치하였으며 배열안테나의 패치를 기울여 설계하는 것을 제안하였다. 제안된 안테나 배치 형상에 대하여 GPS 신호의 신호 수신 범위를 분석하기 위해 LOS (Line Of Sight) 관점에서 가시영역을 분석하였고 실제 무반향 챔버에서 수신 신호 세기 측정을 통해 위성 신호의 유효 수신영역을 분석하였다. 또한 야외시험과 비행시험을 통해서 위성 신호의 음영지역이 줄어드는 것을 확인함으로써 GPS 안테나가 유도탄의 후방에 배치되었을 때 얻을 수 있는 장점을 확인하였다. In this paper we investigate the advantages when the GPS Antenna is installed on the rear missile body. In conventional design the GPS antenna locates on the front part of missile. However it causes degraded GPS positioning performance since the missile body blocks the GPS signals. This paper proposes the GPS array antenna design which locates on the rear part of missile body and has the tilted antenna patches to achieve the maximum area of receiving GPS signals. We simulate LOS region of receiving signals and conducted anechoic chamber test to define the effective signal receiving region. And we conduct field test and flight test to check out the enhancement of signal receiving area.
線型計劃法의 單體解法에 나타나는 Simplex criterion에 관한 硏究
高德坤 圓光大學校 1981 論文集 Vol.15 No.1
The Simplex method of Linear Programming uses the basic concepts of matrix algebra to solve for the intersection of two or more lines or planes. It begines at some feasible solution, one which satisfies all restrictions, and sucessively obtains solutions at intersections which offer better values in the objective the function. The main purpose of this study aims at a theorem of the simplex criterion which criterized of optimal solution. By the simplex procedure, once any basic(extremepoint) feasible solution has been determined, obtain a maximum feasible solution in a finite number of steps. These steps consist in finding a new feasible solution whose corresponding value of the objective function for the proceeding solution. This process is continued until a maximum solution has been reached. All extreme-solutions and especially the maximum solution, have m linearly independent vectors associated with them. We then limit our search to those solutions that are generated by m linearly independent vectors. Certain numbers (called Simplex criterion) are computed that indicate when the optimal solution has been reached, or show which variable to enter into the solution next. Meaning of ?? and ?? A ?? is the reduction in the value of the objective function due to the changes in the values of the variables in the presnet basic feasible solution caused by introducing one unit of ?? into the solution. In order words ?? represented the decrease in the objective function due to the indirect effects of introducing a unit of ?? into the solution. Since ?? is the direct effect on the objective function of introducing aunit of ?? into the solution, ?? is the not increase from introducing a unit of ?? into the solution. Thus the simplex criterion ??is the negative of the net increase from introducing a unit of ?? into the solution. Therefore ?? is the net decrease in the objective function due to introducing a unit of ?? into the solution. And so, an optimum solution has been found when all ?? .