• Journal of the Korean Statistical Society
• /
• v.10
• /
• pp.122-127
• /
• 1981

A parallel flats fraction for the $3^n$ factorial is symbolically written as $At=C=(C_1 C_2 \cdots C_f)$ where C is a rxf matrix and A is rxn matrix with rank r. It is shown that the set of all possible parallel flats fraction C for a given A and given size can be partitioned into equivalence classes. The number of those classes are enumerated in general.

• Journal of the Korean Statistical Society
• /
• v.13 no.2
• /
• pp.114-120
• /
• 1984

A parallel flats fraction for the $3^n$ design is defined as union of flats ${t}At=c_i(mod 3)}, i=1,2,\cdots, f$ and is symbolically written as At=C where A is rank r. The A matrix partitions the effects into n+1 alias sets where $u=(3^{n-r}-1)/2. For each alias set the f flats produce an ACPM from which a detection matrix is constructed. The set of all possible parallel flats fraction C can be partitioned into equivalence classes. In this paper, we develop some properties of a detection matrix and C.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.265-268
• /
• 2002

Parallel-computation is very interesting topic. This paper describes that we apply it into the Boltzmann machine with the Parallel-Transit-Evaluation Method successfully.

• Communications of the Korean Mathematical Society
• /
• v.10 no.3
• /
• pp.735-750
• /
• 1995

We present a domain decomposition algorithm for solving large sparse linear systems of equations arising from queuing networks. Such techniques are attractive since the problems in subdomains can be solved independently by parallel processors. Many of the methods proposed so far use some form of the preconditioned conjugate gradient method to deal with one large interface problem between subdomains. However, in this paper, we propose a "nested" domain decomposition method where the subsystems governing the interfaces are small enough so that they are easily solvable by direct methods on machines with many parallel processors. Convergence of the algorithms is also shown.lso shown.

• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.387-401
• /
• 2001

If the distance between two vertices becomes longer after the removal of a vertex u, then u is called a hinge vertex. In this paper, a linear time sequential algorithm is presented to find all hinge vertices of an interval graph. Also, a parallel algorithm is presented which takes O(n/P + log n) time using P processors on an EREW PRAM.

• Journal of applied mathematics & informatics
• /
• v.6 no.2
• /
• pp.649-659
• /
• 1999

This paper presents a parallel implementation of stiff-ness matrix calculation based on the processor farm model on a net-work of workstations running PVM programming environment. As the computational characteristics of stiffnes matrix exhibits good po-tentials for effective prallel computation the performance improve-ment is show to be almost linear with the number of sorkstations involved in the computation.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2006.06a
• /
• pp.303-310
• /
• 2006

The sorting algorithms have been developed to take advantage of distributed computers. But the speedup of parallel sorting algorithms decrease rapidly with increased number of processors due to parallel processing overhead such as context switching time and inter-processor communication cost. In this paper, we propose a parallel sorting method which provides linear speedup of an optimal serial algorithm for a system with a large number of processors. This algorithm may even provide superlinear speedup for a practical system. The algorithm takes advantage of an interconnection network properties and its protocol.

• Journal of applied mathematics & informatics
• /
• v.19 no.1_2
• /
• pp.77-92
• /
• 2005

An efficient parallel algorithm is presented to find a maximum weight independent set of a permutation graph which takes O(log n) time using O($n^2$/ log n) processors on an EREW PRAM, provided the graph has at most O(n) maximal independent sets. The best known parallel algorithm takes O($log^2n$) time and O($n^3/log\;n$) processors on a CREW PRAM.

• Journal of applied mathematics & informatics
• /
• v.6 no.1
• /
• pp.65-78
• /
• 1999

We present a fast/parallel Poisson solver on disks, based on efficient evaluation of the exact solution given by the Newtonian potential and the Poisson integral. Derived from an integral formula-tion it is more accurate and simpler in parallel implementation and in upgrading to a higher order algorithm than an algorithm which solves the linear system obtained from a differential formulation.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.1045-1058
• /
• 2000

In usual synchronous parallel computing, workload balance is a crucial factor to reduce idle times of some processors that have finished their jobs earlier than others. However, it is difficult to achieve on a heterogeneous workstation clusters where the available computing power of each processor is unpredictable. As a way to overcome such a problem, the idea of asynchronous methods has grown out and is being increasingly used and studied, but there is none for eigenvalue problems yet. In this paper, we suggest a new asynchronous method to solve some singular matrix problems, that can also be used for finding a certain eigenvector of some matrices.