• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.43-43
• /
• 1995

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10b
• /
• pp.619-621
• /
• 1999

여러 대의 카메라를 통해 캡춰된 2차원 데이터를 사용하여 3차원의 좌표를 추출하기 위해서는 각 카메라의 2차원 영상 데이터들의 대응점(correpondence point)을 구해야 한다. 이를 위해 에피폴라 제약조건(epipolar constraints)을 이용하여 에피포라 라인(epipolar line)에 근접한 점을 추출할 수 있다. 에피폴라 제약조건을 사용하면, 실제 원하는 점 이외에 많은 수의 고스트(ghost)가 발생할 수 있다. 또한 카메라로부터 은닉(occlusion)된 점들로 인해 모든 카메라에서 대응되는 점이 존재하는지의 여부를 보장할 수 없다. 본 논문에서는 가 카메라의 대응관계를 k-partite graph로 모델링하고, 전역 탐색을 위해 가중치를 적용하여 클릭(clique)을 추출함으로서, 고스트가 제거된 대응점을 구한다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.21-31
• /
• 1998

Ordering is used to reduce the amount of fill-ins in the Cholesky factor of an symmetric definite matrix. One of most efficient ordering methods is the minimum degree ordering method. In this paper. we propose the two techniques to improve the performance of the minimum degree ordering which are implemented using clique storage structure. One is node absorption which is a generalized version of clique absorption. The other technique is using the lower bounds of degree to suspend the degree updates of nodes. finally, we provide computational results on the problems on NETLIB. These results show that the proposed techniques reduce the number of degree updates and the computational time considerably.

• Korean Management Science Review
• /
• v.10 no.1
• /
• pp.171-192
• /
• 1993

In this paper, a rule for dispatching operations, named the Most Dissimilar Resources (MDR) dispatching rule is presented. The MDR dispatching rule has been designed to maximize utilization of resources in a resource-constrained job shop with general precedence constraints. In shown that solving the above scheduling problem with the MDR dispatching rule is equivalent to multiple solving of the maximum clique problem. A graph theoretic approach is used to model the latter problem. The pairwise counting heuristic of computational time complexity O(n$^{2}$) is developed to solve the maximum clique problem. An attempt is made to combine the MDR dispatching rule with the existing look-ahead dispatching rules. Computational experience indicates that the combined MDR dispatching rules provide solutions of better quality and consistency than the dispatching rules tested in a resource-constrained job shop.

• ETRI Journal
• /
• v.37 no.5
• /
• pp.888-897
• /
• 2015

Group scheduling is an operation whereby control packets arriving in a time slot schedule their bursts simultaneously. Normally, those bursts that are of the same wavelength are scheduled on the same channel. In cases where the support of full wavelength converters is available, such scheduling can be performed on multiple channels for those bursts that are of an arbitrary wavelength. This paper presents a new algorithm for group scheduling on multiple channels. In our approach, to reach a near-optimal schedule, a maximum-weight clique needs to be determined; thus, we propose an additional algorithm for this purpose. Analysis and simulation results indicate that an optimal schedule is almost attainable, while the complexity of computation and that of implementation are reduced.

• Korean Journal of Health Education and Promotion
• /
• v.22 no.2
• /
• pp.173-193
• /
• 2005

Objectives: The purpose of this study is to analyze the peer group factor related to adolescent smoking in the social structure(network) of adolescent groups, by applying the theory of social network. Methods: The data was collected from boy students of one high school located in Gun-Po city of Kyonggi Province. The total number of the sample was 605(223 first grade, 198 second grade, 184 third grade). The survey using the questionnaire was carried out in April 2005. Social position is finally classified as clique member, liaison, isolate group by using the NetMiner II 2.5 version. Results: The current smoking rate was 15.0%, and the life-time smoking rate was 34.9%. The smoking rate increased significantly, as the grade went up. And it was significantly high among the group having smoking friends. The logistic regression analysis showed that the odds ratio of the smoking friends group was about 4 times higher than the no smoking friends group in experience of smoking. But the smoking rate was higher significantly in the isolate group within the network composed of 2. person's social-link. The odds ratio of the isolate group was about 4.5 times higher than the clique member. However, this pattern was not found in the network composed of 3 person's social-link. Therefore, the hypothesis that clique member would have a correlation with smoking was rejected. In reality, the isolate group had a tendency of smoking more frequently. Conclusions: The result of this study suggests that the role of the peer group in smoking is to be considered in the prevention program. More attentions should be paid for the isolate group.

• 대한공업교육학회지
• /
• v.30 no.1
• /
• pp.149-159
• /
• 2005

우리 사회에서 학벌주의는 여러 가지 사회 경제적 문제를 유발시키고 있다. 또한, 학벌주의는 과열 사교육비의 증가, 과도한 대학 입시 경쟁, 대학의 서열 고착화 등의 교육문제를 유발시키면서 공업교육을 비롯한 직업교육을 기피하게 하는 원인을 제공하는 등 교육 전반에 걸쳐 큰 영향을 미치고 있다. 이러한 문제점을 내포하고 있는 학벌주의를 극복하기 위해 노력하는 일은 우리 사회를 능력중심사회로 발전시킬 수 있는 계기를 마련해 줄 수 있고, 학습자들의 소질과 적성에 부합하는 진로를 선택할 수 있는 계기를 제공해 준다는 점에서 그 의의가 매우 크다. 학벌주의의 극복을 위한 대책의 효율적인 추진을 위해서는 무엇보다도 다양한 사회 구성원의 학벌주의에 관한 인식을 정확하게 파악하는 연구가 필요하다. 더욱이 최근에 정부가 학벌주의 개선을 위한 다양한 대책을 구상하고 있는 현 시점에서는 그간에 논의된 이들 개선 대책에 관한 의견도 동시에 조사 분석할 필요가 있다. 이러한 필요성에 기초하여 이 연구에서는 우리 사회의 다양한 구성원을 대상으로 학벌주의에 관한 인식과 개선 요구를 조사 연구함을 주 목적으로 하였다. 이를 위하여 첫째, 사회의 다양한 구성원을 대상으로 학벌주의의 원인과 문제점에 대한 인식을 종합적으로 조사하였다. 둘째, 사회의 다양한 구성원을 대상으로 학벌주의의 개선 요구 사항을 종합적으로 조사하였다. 셋째, 조사 결과가 함의하는 시사점을 도출하였다. 연구 결과 학벌주의의 극복을 위한 실천 대책을 수립하는 과정에서 중시되어야 할 관점은 다음과 같다. 첫째, 학벌주의의 개념 정립이 필요하다. 둘째, 학벌주의는 다른 나라보다 우리나라에서 더욱 심각한 사회 문제로 접근되어야 한다. 셋째, 학벌주의 형성 원인에 대한 정확한 이해와 분석에 기초한 대책 수립이 필요하다. 넷째, 학벌주의의 원인은 교육제도 내에서보다는 사회 전반에서 구명되고, 그 극복 대책이 마련되어야 한다. 다섯째, 대증적(對症的)인 대책보다는 장기적이고 근본적인 대책 마련이 필요하다. 여섯째, 학벌주의 극복 대책의 지향점은 학습자의 올바른 진로정치의 계기 마련과 이를 통한 능력중심사회의 구현이 되어야 한다.

• Journal of the Korea Computer Graphics Society
• /
• v.16 no.4
• /
• pp.35-40
• /
• 2010

Due to the distribution of digital camera, many work for photo management has been studied. However, most work use a sequential grid layout which arranges photos considering one criterion of digital photo. This interface makes users have lots of scrolling and concentrate ability when they manage their photos. In this paper, we propose a clustering method based on a temporal sequence considering their color similarity in detail. First we cluster photos using Cooper's event clustering method. Second, we makes more detailed clusters from each clustered photo set, which are clustered temporal clustering before, using maximal clique finding algorithm of interval graph. Finally, we arrange each detailed dusters on a user screen with their overlap keeping their temporal sequence. In order to evaluate our proposed system, we conducted on user studies based on a simple questionnaire.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.558-567
• /
• 2001

Recently, data mining applications require a large amount of high-dimensional data Most algorithms for data mining applications however, do not work efficiently of high-dimensional large data because of the so-called curse of dimensionality[1] and the limitation of available memory. To overcome these problems, this paper proposes a new cell-based clustering which is more efficient than the existing algorithms for high-dimensional large data, Our clustering method provides a cell construction algorithm for dealing with high-dimensional large data and a index structure based of filtering .We do performance comparison of our cell-based clustering method with the CLIQUE method in terms of clustering time, precision, and retrieval time. Finally, the results from our experiment show that our cell-based clustering method outperform the CLIQUE method.

• Communications of the Korean Mathematical Society
• /
• v.34 no.2
• /
• pp.391-399
• /
• 2019

Let R be a commutative ring with identity and let M be an R-module. The main purpose of this paper is to calculate the chromatic number of the zero-divisor graphs over modules.