• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10c
• /
• pp.355-357
• /
• 2002

최근 인터넷이 발달하면서 인터넷 상의 다양한 컴퓨터들을 연결함으로써 이기종 클러스터 환경 구축이 용이해졌다. 이러한 이기종 클러스터 환경에서 알고리즘의 이식성을 높이기 위해서는 네트워크의 특성 및 노드의 이질성에 따른 부하 불균형에 효과적으로 적응할 수 있어야 한다 본 논문에서는 이기종 클러스터 환경에서 Message Passing 방식을 이용한 고성능 클러스터 컴퓨팅 작업 시 최적의 효율을 얻을 수 있는 Enhanced-WF 알고리즘을 제시한다 Enhanced-WF 알고리즘은 부하공유를 위하여 Weighted Factoring 알고리즘을 기반으로 적응할당정책을 적용하는 동시에 네트워크 통신시간과 계산시간을 겹치게 한다. Enhanced-WF 알고리즘의 성능을 측정하기 위해 이기종 PC클러스터 환경에서 PVM을 이용한 행렬곱셈 프로그램을 이용하였다. 그 결과, Enhanced-WF 알고리즘이 이기종 클러스터 환경에서 Send, GSS, Weighted Factoring 알고리즘과 같은 기존의 부하공유 알고리즘보다 효과적임을 보였다.

• Kyungpook Mathematical Journal
• /
• v.56 no.2
• /
• pp.611-624
• /
• 2016

This paper gives for every positive integer n an explicit construction of a graph G with fewer than $15{\log}^2n-{\frac{5}{2}}{\log}n+28$ vertices, such that there exists a nontrivial factoring of n if and only if G is 3-colorable.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.44
• /
• pp.85-107
• /
• 2009

L/C allows the exporter to have a bank's payment undertaking against shipping documents required by L/C. This means that the exporter can take export proceeds from a L/C issuing bank regardless of importer's payments and therefore the L/C better mitigate importer's credit risk compared to remittance and collections. Recently the use of L/C has been on down trend in line with increasing use of T/T, causing a big change of payment system. This tells that the payment method change in Korea is positive as the change also happens same in developed countries. This however gives more buyer's credit risk to exporters and therefore a systematic solution to this negative effect is required. In Korea, export credit insurance has been widely used to cover the buyer's credit risk. But the export credit insurance is limited because of lack of government's financial support and strict evaluation of buyer and exporter. Now Korea is ranked 10the largest trading country and therefore the exporters shall find another source for credit risk protection elsewhere. And as such this paper suggest International Factoring as a tool for the credit risk protection. The International Factoring gives advantages to the exporter in terms of credit protection and advances by purchasing account receivables on a without recourse basis.

• Journal of Korea Multimedia Society
• /
• v.7 no.2
• /
• pp.264-271
• /
• 2004

A load-sharing algorithm must deal with load imbalance caused by characteristics of a network and heterogeneity of nodes in Internet-based clustering systems. This paper has proposed the Efficient Load-Sharing algorithm. Efficient-Load-Sharing algorithm creates a scheduler based on the WF(Weighted Factoring) algorithm and then allocates tasks by an adaptive granularity strategy and the refined fixed granularity algorithm for better performance. In this paper, adaptive granularity strategy is that master node allocates tasks of relatively slower node to faster node and refined fixed granularity algorithm is to overlap between the time spent by slave nodes on computation and the time spent for network communication. For the simulation, the matrix multiplication using PVM is performed on the heterogeneous clustering environment which consists of two different networks. Compared to other algorithms such as Send, GSS and Weighted Factoring, the proposed algorithm results in an improvement of performance by 75%, 79% and 17%, respectively.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.215-224
• /
• 2003

Since there are various networks and heterogeneity of nodes in Internet, the existing load-sharing algorithms are hardly adapted for use in Internet-based clustering systems. Therefore, in Internet-based clustering systems, a load-sharing algorithm must consider various conditions such as heterogeneity of nodes, characteristics of a network and imbalance of load, and so on. This paper has proposed an expanded-WF algorithm which is based on a WF (Weighted Factoring) algorithm for load-sharing in Internet-based clustering systems. The proposed algorithm uses an adaptive granularity strategy for load-sharing and duplicate execution of partial job for fault-tolerance. For the simulation, the to matrix multiplication using PVM is performed on the heterogeneous clustering environment which consists of two different networks. Compared to other algorithms such as Send, GSS and Weighted Factoring, the proposed algorithm results in an improvement of performance by 55%, 63% and 20%, respectively. Also, this paper shows that It can process the fault-tolerance.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.12 no.20
• /
• pp.47-53
• /
• 1989

This paper presents an algorithm CAPFACT to evaluate the reliability of a capacitated two terminal network such as a communication network, a power distribution network, and a pipeline network. The network is good(working) if and only if it is possible to transmit successfully the required system capacity from one specified terminal to the other. This paper defines new Capacitated series-parallel reduction to be applied to a series-parallel structure of the network. New Capacitated factoring method is applied to a non-series-parallel structure. The method is based on the factoring theorem given by Agrawal and Barlow. According to the existing studies on the reliability evaluation of the network that the capacity is not considered, the factoring method using reduction is efficient. The CAPFACT is more efficient than Aggarwal algorithm which enumerated and combined the paths. The efficiency is proved by the result of testing the number of operations and cpu time on FORTRAN compiler of VAX-11/780 at Hanyang University.

• Journal of the Korean Statistical Society
• /
• v.33 no.4
• /
• pp.401-410
• /
• 2004

We address the problem of parameter estimation in multivariate distributions under ignorable non-monotone missing data. The factoring likelihood method for monotone missing data, termed by Rubin (1974), is extended to a more general case of non-monotone missing data. The proposed method is algebraically equivalent to the Newton-Raphson method for the observed likelihood, but avoids the burden of computing the first and the second partial derivatives of the observed likelihood. Instead, the maximum likelihood estimates and their information matrices for each partition of the data set are computed separately and combined naturally using the generalized least squares method.

• East Asian mathematical journal
• /
• v.19 no.1
• /
• pp.81-89
• /
• 2003

There are many algorithms for factoring integers. The trial division algorithm is one of the most efficient algorithms for factoring small integers(say less than 10,000,000,000). For a number n to be factored, the runtime of the trial division algorithm depends mainly on the size of a nontrivial factor of n. In this paper, we create a function named factors that can implement the trial division algorithm in ActionScript and using the factors function we construct an interactive Prime Factorization Movie and an interactive GCD Movie.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.57-65
• /
• 2011

Since software reuse and agile development methods are seen as ways to shorten development time and accept frequent requirement changes, respectively, there has been growing interest and research on integrating these approaches. But despite the increasing number of software companies which have successfully adopted agile development methods, there has been little research on reuse in agile methods to further improve productivity. In this paper, we identify a new type of reuse asset and propose a task factoring technique by taking advantage of iteration characteristics to support reuse in agile software development methods. In addition, we can apply the proposed technique and show prototyping of task reuse in a video rental application.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.4
• /
• pp.737-744
• /
• 2018

The RSA cryptosystem is a one of the first public-key cryptosystems and is widely used for secure data transmission and electric signature. The security of the RSA cryptosystem is based on the difficulty of factoring large numbers.. Though many studies on finding methods for factoring large numbers are going on, the results of that are all experimental or probabilistic. We, in this paper, construct an algorithm for finding large prime factors of integers without factoring integers using properties of the structure of semigroup of imaginary quadratic order and non-invertible ideal, then propose our methods foe deterministic attack against RSA cryptosystem.