• 한국공간구조학회논문집
• /
• 제14권3호
• /
• pp.101-108
• /
• 2014

Recently, natural disasters such as earthquake, tsunami, typhoon and tornado are increasing, and cause huge economical loses and victim. Thus, when the disaster occurs, it is important to prepare emergency evacuation shelters for fast and easy construction compared to general building system. And, deployable structures will provide a great help for such aim. Deployable structures have the great advantage of being faster and easier to erect and dismantle compared to conventional building forms. In this study, we confirm the possibility of deployment for shelter structures using scissor structure system. First, Basic model was performed to recognize the appllicability of the deployable systems of the dome-shaped structure. Second, Advanced model that more improved inner space and deployment mechanism was confirmed.

• 수산해양교육연구
• /
• 제28권3호
• /
• pp.872-880
• /
• 2016

The purpose of this study is to find the research trends relating to flipped learning through keyword network analysis. For investigating this topic, final 100 papers (removed due to overlap in all 205 papers) were selected as subjects from the result of research databases such as RISS, DBPIA, and KISS. After keyword extraction, coding, and data cleaning, we made a 2-mode network with final 202 keywords. In order to find out the research trends, frequency analysis, social network structural property analysis based on co-keyword network modeling, and social network centrality analysis were used. Followings were the results of the research: (a) Achievement, writing, blended learning, teaching and learning model, learner centered education, cooperative leaning, and learning motivation, and self-regulated learning were found to be the most common keywords except flipped learning. (b) Density was .088, and geodesic distance was 3.150 based on keyword network type 2. (c) Teaching and learning model, blended learning, and satisfaction were centrally located and closed related to other keywords. Satisfaction, teaching and learning model blended learning, motivation, writing, communication, and achievement were playing an intermediary role among other keywords.

• 대한수학회논문집
• /
• 제9권3호
• /
• pp.641-648
• /
• 1994

Let M be a minimally immersed closed hypersurface in $S^{n+1}$, II the second fundamental form and $S = \Vert II \Vert^2$. It is well known that if $0 \leq S \leq n$, then $S \equiv 0$ or $S \equiv n$ and totally geodesic hypersheres and Clifford tori are the only possible minimal hypersurfaces with $S \equiv 0$ or $S \equiv n$ ([6], [2]). From these results, Chern suggested some questions on the study of compact minimal hypersurfaces on the sphere with S =constant: what are the next possible values of S to n, and does in the ambient sphere\ulcorner By the way, S is defined extrinsically but, in fact, it is an intrinsic invariant for the minimal hypersurface, i.e., S = n(n-1) - R, where R is the scalar, curvature of M. Some partial answers have been obtained for dim M = 3: Assuming $M^3 \subset S^4$ is closed and minimal with S =constant, de Almeida and Brito [1] proved that if $R \geq 0$ (or equivalently $S \leq 6$), then S = 0, 3 or 6, Peng and Terng ([5]) proved that if M has 3 distint principal curvatures, then S = 6, and in [3] Chang showed that if there exists a point which has two distinct principal curvatures, then S = 3. Hence the problem for dim M = 3 is completely done. For higher dimensional cases, not much has been known and these problems seem to be very hard without imposing some more conditions on M.

• ETRI Journal
• /
• 제41권6호
• /
• pp.797-810
• /
• 2019

Image saliency detection is the basis of perceptual image processing, which is significant to subsequent image processing methods. Most saliency detection methods can detect only a single object with a high-contrast background, but they have no effect on the extraction of a salient object from images with complex low-contrast backgrounds. With the prior knowledge, this paper proposes a method for detecting salient objects by combining the boundary contrast map and the geodesics-like maps. This method can highlight the foreground uniformly and extract the salient objects efficiently in images with low-contrast backgrounds. The classical receiver operating characteristics (ROC) curve, which compares the salient map with the ground truth map, does not reflect the human perception. An ROC curve with distance (distance receiver operating characteristic, DROC) is proposed in this paper, which takes the ROC curve closer to the human subjective perception. Experiments on three benchmark datasets and three low-contrast image datasets, with four evaluation methods including DROC, show that on comparing the eight state-of-the-art approaches, the proposed approach performs well.

• 한국CDE학회논문집
• /
• 제19권1호
• /
• pp.19-28
• /
• 2014

The filament winding method is widely used to manufacture products of fiber reinforced plastics (FRP), such as high pressure vessels, launch tubes and pipes. For reducing winding time, the method of winding by filament band which consists of several filament fibers is used. NC winding machine is used for precise winding and NC path is needed. Before filament winding, users should verify that winding path which presented by a line is appropriate by filament winding simulation. Also, the used length of each filament is different. So, if the peak filament exhausted, it causes to stop manufacturing. In this research, we developed software which visualizes 3D graphic of filament band winding path and simulates winding process on real time. And we proposed algorithm about calculation of each filament usage. We use geodesic equation for generating filament band surface and calculating the usage length of each filament.

• 항공우주기술
• /
• 제9권1호
• /
• pp.72-77
• /
• 2010

필라멘트 와인딩으로 제작된 고체 모터 연소관의 구조강성저하 평가 및 파열특성을 확인하기 위한 수압시험을 수행하였다. 본 연소관의 파손 요구조건으로서 운용 중 최대 예상압력(MEOP)의 1.5배 이상의 압력에서 실린더 파손이 일어나야함을 제시하였다. 해석 결과 연소관의 내부압력이 2088psig 일 때 실린더층의 섬유가 끊어지는 것으로 나타났으며 수압시험을 수행하여 2200psig 수준에서 실린더 부위가 파손됨을 검증하였다. 또한 제작 후 1년 정도 경과 후에도 강성저하가 없음을 알 수 있었다.

• Journal of Computational Design and Engineering
• /
• 제1권1호
• /
• pp.48-54
• /
• 2014

In this paper, the authors propose a system for assisting mold designers of plastic parts. With a CAD model of a part, the system automatically determines the optimal ejecting direction of the part with minimum undercuts. Since plastic parts are generally very thin, many rib features are placed on the inner side of the part to give sufficient structural strength. Our system extracts the rib features from the CAD model of the part, and determines the possible ejecting directions based on the geometric properties of the features. The system then selects the optimal direction with minimum undercuts. Possible ejecting directions are represented as discrete points on a Gauss map. Our new point distribution method for the Gauss map is based on the concept of the architectural geodesic dome. A hierarchical structure is also introduced in the point distribution, with a higher level "rough" Gauss map with rather sparse point distribution and another lower level "fine" Gauss map with much denser point distribution. A system is implemented and computational experiments are performed. Our system requires less than 10 seconds to determine the optimal ejecting direction of a CAD model with more than 1 million polygons.

• 한국추진공학회:학술대회논문집
• /
• 한국추진공학회 2010년도 제34회 춘계학술대회논문집
• /
• pp.421-427
• /
• 2010

이 논문은 필라멘트 와인딩 공법으로 제작된 복합재 lattice 구조물에 대한 연구이다. 복합재 lattice 구조물은 helical rib과 hoop rib 구조로 이루어져 있다. 이 구조는 탄소 섬유를 에폭시에 함침 시켜 섬유의 끊어짐이 없이 연속적으로 실리콘 고무 금형의 홈 안에 필라멘트 와인딩하여 제작한 것이다. 본 연구에서는 lattice 구조물의 helical rib의 각도, 두께, 폭, 간격등을 안전율에 대하여 최적화 하는 이론을 제시하였다. 그리고 lattice 구조물의 제작방법을 기술하고 해석 및 시험결과를 기술하였다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (B)
• /
• pp.232-234
• /
• 2006

본 논문에서는 마르코프 결정 문제 (Markov decision problem)의 풀이 효율을 잴 수 있는 척도를 알아보기 위해 복잡계 네트워크 (complex network) 의 관점에서 MDP를 하나의 그래프로 나타내고, 그 그래프의 위상학적 성질들을 여러 네트워크 척도 (network measurements)들을 이용하여 측정하고 그 MDP의 풀이 효율과의 관계를 분석하였다. 실세계의 여러 문제들이 MDP로 표현될 수 있고, 모델이 알려진 경우에는 평가치 반복(value iteration)이나 모델이 알려지지 않은 경우에도 강화 학습(reinforcement learning) 알고리즘등을 사용하여 풀 수 있으나, 이들 알고리즘들은 시간 복잡도가 높아 크기가 큰 실세계 문제에 적용하기 쉽지 않다. 이 문제를 해결하기 위해 제안된 것이 MDP를 계층적으로 분할하거나, 여러 단계를 묶어서 수행하는 등의 시간적 추상화(temporal abstraction) 방법들이다. 시간적 추상화를 도입할 경우 MDP가 보다 효율적으로 풀리는 꼴로 바뀐다는 사실에 착안하여, MDP의 풀이 효율을 네트워크 척도를 이용하여 측정할 수 있는 여러 위상학적 성질들을 기반으로 분석하였다. 다양한 구조와 파라미터를 가진 MDP들을 사용해 네트워크 척도들과 MDP의 풀이 효율간의 관계를 분석해 본 결과, 네트워크 척도들 중 평균 측지 거리 (mean geodesic distance) 가 그 MDP의 풀이 효율을 결정하는 가장 중요한 기준이라는 사실을 알 수 있었다.

• Journal of applied mathematics & informatics
• /
• 제39권1_2호
• /
• pp.155-163
• /
• 2021

For a connected graph G of order n, a set S of vertices is called a double geodetic set of G if for each pair of vertices x, y in G there exist vertices u, v ∈ S such that x, y ∈ I[u, v]. The double geodetic number dg(G) is the minimum cardinality of a double geodetic set. Any double godetic set of cardinality dg(G) is called a dg-set of G. A connected double geodetic set of G is a double geodetic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected double geodetic set of G is the connected double geodetic number of G and is denoted by dgc(G). A connected double geodetic set of cardinality dgc(G) is called a dgc-set of G. Connected graphs of order n with connected double geodetic number 2 or n are characterized. For integers n, a and b with 2 ≤ a < b ≤ n, there exists a connected graph G of order n such that dg(G) = a and dgc(G) = b. It is shown that for positive integers r, d and k ≥ 5 with r < d ≤ 2r and k - d - 3 ≥ 0, there exists a connected graph G of radius r, diameter d and connected double geodetic number k.