• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.8
• /
• pp.692-698
• /
• 2015

This paper represents a trajectory design and analysis technique which uses invariant manifolds of the circular restricted three body problem. Instead of the classical patched conic method based on 2-body problem, the equation of motion and dynamical behavior of spacecraft in the circular restricted 3-body problem are introduced, and the characteristics of Lyapunov orbits near libration points and their invariant manifolds are covered in this paper. The trajectories from/to Lyapunov orbits are numerically generated with invariant manifolds in the Earth-moon system. The trajectories in the Sun-Jupiter system are also analyzed with various initial conditions in the boundary surface. These methods can be effectively applied to interplanetary trajectory designs.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2001.10a
• /
• pp.17-44
• /
• 2001

지적도는 모든 지도중 가장 큰 대축척 지도이며 토지에 대하여 필지별로 지번, 위치 및 경계 등 소유권의 범위를 등록하는 것으로서 국민의 기본권리인 토지에 대한 소유권과 그 이용을 보장할 수 있는 가장 기본적인 특성을 가지고 있다. 도형자료인 현재의 지적도는 1910년 토지조사사업에 의하여 실제 토지필지를 1/1,200로 축소하여 도면에 등록한 도해지적으로 제도오차, 축척오차, 신축오차, 도곽접합 등의 기술적인 오차와 측량을 할 때마다 각기 측량사에 따라 개인오차의 누적으로 성과결정에 있어서 차질을 가져다주고 있다. 따라서 이러한 문제를 해결하기 위하여는 지적재조사사업이 가장 바람직하지만 복잡한 과정을 거쳐야 함으로 그 이전에라도 축척변경사업을 통하여 새로운 지적체계로서 토지이용상태에 따라 토지의 경계를 수치좌표로 등록하는 수치지적체계로 전환하여 지적측량의 정확도와 정밀도를 높여 지적불부합지에 대한 민원을 해소함으로써 재산적 가치를 증대할 뿐만 아니라 국민의 소유권 보호 및 양질의 서비스 개선에 그 목적이 있다. 본 연구에서는 해당지역의 지적도를 독취, 정도곽으로 보정하여 일필지를 공부상면적의 공차범위 이내로 조정한 후 현형도와 지적도를 조정(Orientation)하여 좌표를 저장하였다. 일필지 좌표결정 방법에는 CAD기능을 이용하여 컴퓨터의 모니터에서 지적도를 이동 및 회전함으로써 위치를 결정하는 방식, 모니터상에서 국부적으로 위치를 결정하는 방식 및 디지타이져상에서 결정하여 모니터상에서 조정하는 방식있다. 현실적으로 국부적인 방법이 합리적이라고 생각되어 모니터상에서 조정(Orientation)하여 국부적으로 좌표 위치를 결정하는 방법으로 연구하고 성과를 비교, 검토하였으며, 그 결과 다음과 같은 결론을 얻었다. 1. 지적도면은 토지조사사업 한지를 배접한 켄트지를 사용함으로써 종이의 신축으로 인하여 정도곽으로 보정을 하면 독취면적은 대부분 공부상면적보다 늘어났다. 2. 좌표의 이동량이 일률적이지 못하므로 기초점에 대한 문제라고 생각되며, 따라서 도해지적을 수치지적으로 전환함에 있어서 가장 우선되어야 할 사항이 기초점 정비라 하겠다.

• The KIPS Transactions:PartA
• /
• v.14A no.3 s.107
• /
• pp.133-140
• /
• 2007

The SWBF(shrink-wrapped boundary face) algorithm is a recent mesh reconstruction method for constructing a surface model from a set of unorganized 3D points. In this paper, we point out the surface duplication problem of SWBF and propose an improved mesh reconstruction scheme. Our method tries to classify the non-boundary cells as the inner cell or the outer cell, and makes an initial mesh without surface duplication by adopting the improved boundary face definition. To handle the directional unbalance of surface sampling density arise in typical 3D scanners, two dimensional connectivity in the cell image is introduced and utilized. According to experiments, our method is proved to be very useful to overcome the surface duplication problem of the SWBF algorithm.

• Journal of the Korean Geographical Society
• /
• v.44 no.5
• /
• pp.661-674
• /
• 2009

In recent academic debates within the UN Group of Experts on Geographical Names, two contrasting views evolved as regards to the status of the names of transboundary features or features beyond a single sovereignty. The partial view posits that a name is an endonym only for those portions of a feature where the name corresponds to the language used while the whole view argues that a name in its official language is an endonym for the whole feature. In either of these views, the name East Sea should be given due respect, for the Korean territorial waters at least or as an endonym for the entire sea. This paper supports the partial view that a geographical feature can be separated and each separated portion can have different name forms and status. Regarding the separation of a feature, the limits to which local people perceive as 'their' sea should be used. The name East Sea is proposed as the translated form of an endonym Donghae.

• Tunnel and Underground Space
• /
• v.27 no.4
• /
• pp.230-242
• /
• 2017

Seismic velocities measured from in-situ tests (n=177) and through rock core samples (n=1,035) are reviewed in light of construction standards, widely used standards as a first-hand approximation of rock classification solely based on seismic velocities. In-situ down hole tests and refraction survey for soft rocks showed seismic velocities of 1,400~2,900 m/s which is faster than those specified in construction standards. For moderate~ hard rocks, in-situ down hole tests and refraction survey showed 2,300~3,800 m/s which roughly corresponds with the range specified in the construction standards. A similar trend is also observed for seismic velocities measured from rock core samples. The observed differences between construction standards and seismic velocities can be explained in two ways. If construction standards are correct the observed differences may be explained with seismic velocities affected by underlying fast velocities and also possibly with selection of intact cores for velocity measurement. Alternatively, construction standards may have intrinsic problems, namely artificial discrete boundaries between soft rocks and moderate rocks, application of foreign standards without consideration of geologic setting and lack of independent verification steps. Therefore, we suggest a carefully designed verification studies from a test site. We also suggest that care must be exercised when applying construction standards for the interpretation and accessment of rock mass properties.

• Information Systems Review
• /
• v.24 no.4
• /
• pp.23-40
• /
• 2022

Although Support Vector Machine(SVM) has been used in various fields such as bankruptcy prediction model, the hyperplane learned by SVM in class imbalance problem can be severely skewed toward minority class and has a negative impact on performance because the area of majority class is expanded while the area of minority class is invaded. This study proposed optimized uneven margin SVM(OPT-UMSVM) combining threshold moving or post scaling method with UMSVM to cope with the limitation of the traditional even margin SVM(EMSVM) in class imbalance problem. OPT-UMSVM readjusted the skewed hyperplane to the majority class and had better generation ability than EMSVM improving the sensitivity of minority class and calculating the optimized performance. To validate OPT-UMSVM, 10-fold cross validations were performed on five sub-datasets with different imbalance ratio values. Empirical results showed two main findings. First, UMSVM had a weak effect on improving the performance of EMSVM in balanced datasets, but it greatly outperformed EMSVM in severely imbalanced datasets. Second, compared to EMSVM and conventional UMSVM, OPT-UMSVM had better performance in both balanced and imbalanced datasets and showed a significant difference performance especially in severely imbalanced datasets.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.4
• /
• pp.335-341
• /
• 2009

In this paper, review of developed MLS-based finite elements and a proposal for their applications are described. The shape functions and their derivatives of MLS-based finite elements are constructed using Moving-Least Square approximation. In MLS-based finite element, using the adequate influence domain of weight function used in MLS approximation, kronecker delta condition could be satisfied at the element boundary. Moreover, because of the characteristics of MLS approximation, we could easily add extra nodes at an arbitrary position in MLS-based finite elements. For these reasons, until now, several variable-node elements(2D variable element for linear case and quadratic case and 3D variable-node elements) and finite crack elements are developed using MLS-based finite elements concept. MLS-based finite elements could be extended to 2D variable-node triangle element, 2D finite crack triangle element, variable-node shell element, finite crack shell element, and 3D polyhedron element. In this paper, we showed the feasibility of 3D polyhedron element at the case of femur meshing.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.571-578
• /
• 2002

In temporal database, extended time dimension for history management brings about complexity of join operation and increased cost. To solve this problem, a method that joins the divided segment time data after partition the time range into fixed time interval is introduced. But existing methods can't solve the ambiguity problem of time border that caused by temporal granularity in the partition point. In this paper, We suggested Fuzzy Minimum Interval Partition (FMIP) method that introduced the possibility distribution of fuzzy theory considered uncertainty time interval border in the partition line.

• Journal of Digital Convergence
• /
• v.13 no.2
• /
• pp.159-175
• /
• 2015

The two-dimensional QR code has advantages such as directional nature, enough data storage capacity, ability of error correction, and ability of data restoration. There are two major issues like speed and correctiveness of recognition in the two-dimensional QR code. Therefore, this paper proposes a morphology-based algorithm of detecting the interest region of a barcode. Our research contents can be summarized as follows. First, the interest region of a barcode image was detected by close operations in morphology. Second, after that, the boundary of the barcode are detected by intersecting four cross line outside in a code. Three, the projected image is then rectified into a two-dimensional barcode in a square shape by the reverse-perspective transform. In result, it shows that our detection and recognition rates for the barcode image is also 97.20% and 94.80%, respectively and that outperforms than previous methods in various illumination and distorted image environments.

• Journal of KIISE:Software and Applications
• /
• v.30 no.9
• /
• pp.876-884
• /
• 2003

It is essential to identify both the pupil and iris boundaries for iris recognition. The circular edge detector proposed by Daugman is the most common and powerful method for the iris region extraction. The method is accurate but requires lots of computational time since it is based on the exhaustive search. Some heuristic methods have been proposed to reduce the computational time, but they are not as accurate as that of Daugman. In this paper, we propose a pupil and iris boundary finding algorithm which is faster than and as accurate as that of Daugman. The proposed algorithm searches the boundaries using the Daugman's circular edge detector, but reduces the search region using the problem domain knowledge. In order to find the pupil boundary, the search region is restricted in the maximum and minimum bounding circles in which the pupil resides. The bounding circles are obtained from the binarized pupil image. Two iris boundary points are obtained from the horizontal line passing through the center of the pupil region obtained above. These initial boundary points, together with the pupil point comprise two bounding circles. The iris boundary is searched in this bounding circles. Experiments show that the proposed algorithm is faster than that of Daugman and more accurate than the conventional heuristic methods.