• Transactions of the Korean Society of Mechanical Engineers
• /
• v.11 no.1
• /
• pp.26-35
• /
• 1987

As an attempt to make the multi-objection for the line design of the rope way, the resulted formulas from the catenary curve as exact ones were summarized, and it was found out that the Kuhn-Tucker's optimality conditions and regions of the objective functions can analytically be expressed with dimensionless parameters. The Pareto's optimum solution set was analytically obtained through the objective function-the minimum relation of $W^{*}$, and $W^{*}$ is a trade-off relation. From this, The dimension of a rope and the value of an initial tension that are the standard in design of the rope way were determined. It was concluded that $V^{*}$ should become minimum, and that the ratio of the dimension of rope to the value of and initial tension become larger than superposition factor corresponding to curve AB.to curve AB.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.263-269
• /
• 2014

In this paper, I disprove Hadwiger conjecture of the vertex coloring problem, which asserts that "All $K_k$-minor free graphs can be colored with k-1 number of colors, i.e., ${\chi}(G)=k$ given $K_k$-minor." Pursuant to Hadwiger conjecture, one shall obtain an NP-complete k-minor to determine ${\chi}(G)=k$, and solve another NP-complete vertex coloring problem as a means to color vertices. In order to disprove Hadwiger conjecture in this paper, I propose an algorithm of linear time complexity O(V) that yields the exact solution to the vertex coloring problem. The proposed algorithm assigns vertex with the minimum degree to the Maximum Independent Set (MIS) and repeats this process on a simplified graph derived by deleting adjacent edges to the MIS vertex so as to finally obtain an MIS with a single color. Next, it repeats the process on a simplified graph derived by deleting edges of the MIS vertex to obtain an MIS whose number of vertex color corresponds to ${\chi}(G)=k$. Also presented in this paper using the proposed algorithm is an additional algorithm that searches solution of ${\chi}^{{\prime}{\prime}}(G)$, the total chromatic number, which also remains NP-complete. When applied to a $K_4$-minor graph, the proposed algorithm has obtained ${\chi}(G)=3$ instead of ${\chi}(G)=4$, proving that the Hadwiger conjecture is not universally applicable to all the graphs. The proposed algorithm, however, is a simple algorithm that directly obtains an independent set minor of ${\chi}(G)=k$ to assign an equal color to the vertices of each independent set without having to determine minors in the first place.

• Journal of Digital Contents Society
• /
• v.9 no.1
• /
• pp.53-60
• /
• 2008

Based on similarities between fuzzy set theory and mathematical morphology, Grabish proposed a fuzzy morphology based on the Sugeno fuzzy integral. This paper proposes a fuzzy mathematical morphology based on the defuzzification of the fuzzy measure which corresponds to fuzzy integral. Its process makes a fuzzy set used as a measure of the inclusion of each fuzzy measure for subsets. To calculate such an integral a $\lambda$-fuzzy measure is defined which gives every subsets associated with the universe of discourse, a definite non-negative weight. Fast implementable definitions for erosion and dilation based on the fuzzy measure was given. An application for robust skeletonization of two-dimensional objects was presented. Simulation examples showed that the object reconstruction from their skeletal subsets that can be achieved by using the proposed was better than by using the binary mathematical morphology in most cases.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.1
• /
• pp.37-47
• /
• 2011

Stock price index option market has various investment strategies that have been developed. Specially, arbitrage strategies are very important to be efficient in option market. The purpose of this study is to improve profit using rough set and Box spread by using past option trading data. Option trading data was based on an actual stock exchange market tick data ranging from 2001 to 2006. Validation process was carried out by transferring the tick data into one-minute intervals. Box spread arbitrage strategies is low risk but low profit. It can be accomplished by back-testing of the existing strategy of the past data and by using rough set, which limit the time line of dealing. This study can make more stable profits with lower risk if control the strategy that can produces a higher profit module compared to that of the same level of risk.

• Journal of Korean Library and Information Science Society
• /
• v.47 no.4
• /
• pp.289-307
• /
• 2016

This paper introduces a software system and process model for constructing domain-specific relation extraction datasets semi-automatically. The system uses a set of terms such as genes, proteins diseases and so forth as inputs and then by exploiting massive biological interaction database, generates a set of term pairs which are utilized as queries for retrieving sentences containing the pairs from scientific databases. To assess the usefulness of the proposed system, this paper applies it into constructing a genic interaction dataset related to Alzheimer's disease domain, which extracts 3,510 interaction-related sentences by using 140 gene names in the area. In conclusion, the resulting outputs of the case study performed in this paper indicate the fact that the system and process could highly boost the efficiency of the dataset construction in various subfields of biomedical research.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.179-186
• /
• 2011

This paper suggests the minimum number of vertex guards algorithm. Given n rooms, the exact number of minimum vertex guards is proposed. However, only approximation algorithms are presented about the maximum number of vertex guards for polygon and orthogonal polygon without or with holes. Fisk suggests the maximum number of vertex guards for polygon with n vertices as follows. Firstly, you can triangulate with n-2 triangles. Secondly, 3-chromatic vertex coloring of every triangulation of a polygon. Thirdly, place guards at the vertices which have the minority color. This paper presents the minimum number of vertex guards using dominating set. Firstly, you can obtain the visibility graph which is connected all edges if two vertices can be visible each other. Secondly, you can obtain dominating set from visibility graph or visibility matrix. This algorithm applies various art galley problems. As a results, the proposed algorithm is simple and can be obtain the minimum number of vertex guards.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.3
• /
• pp.193-199
• /
• 2019

In this paper I propose an algorithm of linear time complexity for NP-complete Maximum Independent Set (MIS) problem. Based on the basic property of the MIS, which forbids mutually adjoining vertices, the proposed algorithm derives the solution by repeatedly selecting vertices in the ascending order of their degree, given that the degree remains constant when vertices ${\nu}$ of the minimum degree ${\delta}(G)$ are selected and incidental edges deleted in a graph of n vertices. When applied to 22 graphs, the proposed algorithm could obtain the MIS visually yet effortlessly. The proposed linear MIS algorithm of time complexity O(n) always executes ${\alpha}(G)$ times, the cardinality of the MIS, and thus could be applied as a general algorithm to the MIS problem.

• Proceedings of the Korean Society of Coastal and Ocean Engineers Conference
• /
• 1995.10a
• /
• pp.31-31
• /
• 1995

TIN은 Triangulated Irregular Network의 약자로 불규칙한 대소삼각형의 집합으로 삼각망을 구성, 지표면을 Digital Terrain Model로 만드는 기법이다. 지표면(해저지형포함)은 수치화된 등고선의 벡터 데이터와 점의 표고데이터 또는 표고 평행배열의 Raster데이터로부터 모형화되며 또는 제 3의 방법인 TIN에 의해 모형화된다. 이 TIN에 의한 도형은 컴퓨터가 위성측량, 항공측량, 광파측량 또는 음차수심측량등 측량결과를 받아 어떤 특정 프로그램을 구동 삼각형의 정점에 해당하는 점의 X, Y, Z의 좌표로부터 닫한 삼각형을 작성한다. (중략)

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.365-367
• /
• 2003

염기서열 디자인은 DNA computing, 샘물정보학 등의 분야에서 실험 설계시 고려해야할 중요한 문제 중의 하나이다. 이 문제는 다양한 조건을 만족시키는 최적의 염기서열 집합을 생성하는 조합 최적화 문제로 생각될 수 있으며, 염기서열이 갖추어야 할 조건을 적합도 함수로 사용한 진화 연산 등의 방법이 적용되어 왔다. 본 논문에서는 여러 논문들에서 제시된 적합도 함수의 구체적인 형태를 해 공간상에서 조사해 보았으며, 각 적합도 함수간의 관계도 분석해 보았다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.73-75
• /
• 2001

데이터베이스에서 질의의 결과로 되돌려지는 레코드의 수가 많을 때, 이를 일정 개수의 레코드 단위로 구분하여 일부만 돌려주는 응용이 많다. 추가의 결과를 요청할 경우, 이를 수행하기 위해 기존에는 다시 동일한 질의를 수행한 후 필요한 레코드 위치까지 순차적으로 접근을 하는 방식을 썼다. 본 논문에서는 인덱스가 정의된 필드를 기준으로 정렬된 결과 집합에서 효율적으로 순위 탐색을 지원하기 위한 Ranking-tree 인덱스 구조를 제안한다. 순위 탐색은 어떤 기준에 의해 정렬된 결과 레코드에서 N번째 순서에 해당하는 레코드부터 탐색하는 것을 말한다. Ranking-tree를 통해 불필요한 질의 결과 탐색 시간을 줄여 성능 향상을 가져올 수 있다.