• Journal of the Korean Data and Information Science Society
• /
• 제17권2호
• /
• pp.569-579
• /
• 2006

Recently, the amount of genome sequence is increasing rapidly due to advanced computational techniques and experimental tools in the biological area. Sequence comparisons are very useful operations to predict the functions of the genes or proteins. However, it takes too much time to compare long sequence data and there are many research results for fast sequence comparisons. In this paper, we propose a hybrid grid system to improve the performance of the sequence comparisons based on the LanLinux system. Compared with conventional approaches, hybrid grid is easy to construct, maintain, and manage because there is no need to install SWs for every node. As a real experiment, we constructed an orthologous database for 89 prokaryotes just in a week under hybrid grid; note that it requires 33 weeks on a single computer.

• 대한핵의학회:학술대회논문집
• /
• 대한핵의학회 2002년도 제41차 추계학술대회
• /
• pp.32.2-32.2
• /
• 2002

• 한국정보처리학회논문지
• /
• 제7권7호
• /
• pp.2060-2071
• /
• 2000

Scheduling parallel tasks, represented as a Directed Acyclic Graph (DAG) or task graph, on a multiprocessor system has been an important research area in the past decades. List scheduling algorithms assign priorities to a node or an edge in an input DAG, and then generate a schedule according to the assigned priorities. This appear proposes a list scheduling algorithms with effective method of priority assignments. The paper also analyzes the worst case performance and optimality condition for the proposed algorithm. The performance comparison study shows that the proposed algorithms outperforms existing scheduling algorithms especially for input DAGs with high communication overheads. The performance improvement over existing algorithms becomes larger as the input DAG becomes more dense and the level of parallelism in the DAG is increased.

• 한국경영과학회지
• /
• 제36권2호
• /
• pp.51-65
• /
• 2011

We compared a CONWIP(constant work-in-process) system with a kanban system in a production line with constant processing times. Based on the observation that a WIP-controlled line production system such as CONWIP and kanban is equivalent to a m-node tandem queue with finite buffer, we applied a max-plus algebra based solution method for the tandem queue to evaluate the performance of two systems. Numerical examples with 6 workstations were used to demonstrate the proposed analysis. The numerical results support the previous studies that CONWIP outperforms kanban in terms of expected waiting time and WIP. Unlike the kanban case, sequencing workstations in a CONWIP does not affect the performance of the system.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.81-98
• /
• 1997

Given a rooted tree T with profits and node demands, the capacitated subtree of a tree problem (GSTP) consists of finding a rooted subtree of maximum profit, subject to having total demand no larger than the given capacity H. We first define the so-called critical item for CSTP and find an upper bound on the optimal value of CSTP in O(n$^{2}$) time, where n is the number of nodes in T. We then present our branch and bound algorithm for solving CSTP and illustrate the algiruthm by using an example. Finally, we implement our branch-and-bound algorithm and compare the computational results with those for both CPLEX and a dynamic programming algorithm. The comparison shows that our branch-and-bound algorithm performs much better than both CPLEX and the dynamic programming algorithm, where n and H are the range of [50, 500] and [5000, 10000], respectively.

• Steel and Composite Structures
• /
• 제9권1호
• /
• pp.59-75
• /
• 2009

In this study, a simple approach for bending analysis of Reissner-Mindlin plates is presented using the four-node quadrilateral domain transformation based on discrete singular convolution. In the proposed approach, irregular physical domain is transformed into a rectangular domain by using the geometric coordinate transformation. The DSC procedures are then applied to discrete the governing equations and boundary conditions. The accuracy of the proposed method is verified by comparison with known solutions obtained by other numerical or analytical methods. Results for Reissner-Mindlin plates show a satisfactory agreement with the analytical and numerical solutions.

• Structural Engineering and Mechanics
• /
• 제63권1호
• /
• pp.103-113
• /
• 2017

Free vibration analysis of plates is necessary for the field of structural engineering because of its wide applications in practical life. Free vibration of plates is largely dependent on its thickness, aspect ratios, and boundary conditions. Here we investigate the natural frequencies of simply supported tapered isotropic rectangular plates with internal cutouts using a nine node isoparametric element. The effect of rotary inertia on Eigenfrequencies was demonstrated by calculating with- and without rotary inertia. We found that rotary inertia has a significant effect on thick plates, while rotary inertia term can be ignored in thin plates. Based on comparison with literature data, we propose that the present formulation is capable of yielding highly accurate results. Internal cutouts at various positions in tapered rectangular simply supported plates were also studied. Novel data are also reported for skew taper plates.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(D)
• /
• pp.465-467
• /
• 2012

PMIPv6(Proxy Mobile IPv6)는 이동 노드(Mobile Node: MN)을 대신하여 엑세스 네트워크에서 노드의 이동성을 지원하기 위한 프로토콜로써 네트워크-기반 이동성 지원 기법이다. PMIPv6 프로토콜에서는 또한 여러 개의 인터페이스를 가지고 있는 MN이 각각의 인터페이스를 이용하여 도메인에 접속할 수 있게 함으로써 데이터 서비스를 다른 인터페이스로 이동하여 받을 수 있도록 하는 플로우 이동성에 대한 논의가 활발히 이루어지고 있다. 이 논문에서는 특별히 플로우 이동성에서 고려해야 할 문제 중의 하나인 트리거에 따른 플로우 이동성 관리에 대해 표준 제안들과 비표준 제안들의 절차를 비교한다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1998년도 추계학술대회 논문집
• /
• pp.397-400
• /
• 1998

This paper has a dual purpose. First, we consider a relaxation algorithm which seems to be particularly suitable for multicasting routing problems. We show that the algorithm has polynomial complexity. Second, to measure the quality of solutions in comparison to the optimal solutions over a wide range of network sizes for which the computation of the optimal costs is too excessive, we also propose a random graph generation scheme in which an asymptotic lower bound on the expected optimal cost can be computed as a function of network node size.

• 한국통신학회논문지
• /
• 제36권5A호
• /
• pp.521-528
• /
• 2011

센서 네트워크 환경에서 센서 노드의 위치를 추정하는 일은 매우 중요하다. 센서 네트워크에서 GPS 신호 없이 노드의 위치 알아내기 위한 방법으로는 앵커 로봇을 활용하는 방법이 대표적이다. 따라서 본 논문은 4대의 이동형 앵커 로봇을 활용하여 빠른 시간 안에 효율적으로 센서 노드의 위치를 확정하는 4-Robot Localization Scheme(4RLS)방법을 제안한다. 그리고 실제 구현과 분석을 통해 4RLS 기법이 3 대의 이동로봇을 활용하는 기존 방법에 비해 성능이 개선됨을 보인다.