• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.563-572
• /
• 2008

In this paper, we discuss about a generalization of the Key Distribution Pattern which was proposed by C. Mitchell and F. Piper[6]. It is allowing secure communication between every n-pair of users($n\leq2$) in a large network for reducing storage requirements. We further suggest a generalization of K. Quinn's bounds in [9] for the number of subkeys in such general Key Distribution Patterns.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.63-81
• /
• 1995

This paper presents a model and algorithm for solving the multi-factor plant layout problem. The model can incorporate more than two factors that may be either quantitative or qualitative. The algorithm is based on simulated annealing, which has been successfully applied for the solution of combinatorial problems. A set of problems previously used by various authors is solved to demonstrate the effectiveness of the proposed methods. The results indicate that the proposed methods can yield good quality for each of eleven test problems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.4
• /
• pp.301-305
• /
• 2004

In a warehouse, plates listed in the different orders are placed mixed. Nevertheless, when plates are going out, a group of plates listed in the same order should be sequentially loaded on a transporter. Since the access to the plates is only from the top of the stack, it happens often that we have to move some plates on a temporary place in order to access a plate below them. This paper deals with a problem of sequencing orders for transportation to minimize the number of plates temporarily moved.

• Journal of the Korean Mathematical Society
• /
• v.32 no.4
• /
• pp.713-724
• /
• 1995

In 1954 Frame, Robinson and Thrall [5] gave the hook formula for the number of standard Young tableaux of a given shape. Since then many proofs for the hook formula have been given using various methods. See [9] forprobabilistic method and see [6] or [12] for combinatorial ones. Regev [10] has given asymptotic values for these numbers and Gouyou-Beauchamps [8] gave exact formulas for the number of standard Young tableaux having n cells and at most k rows in the cases k = 4 and k = 5.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.308-311
• /
• 2008

The ant colony optimization (ACO) is a metaheuristic inspired by the behavior of real ants. Recently, ACO has been widely used to solve the difficult combinatorial optimization problems. In this paper, we propose an ACO algorithm to solve the two disjoint paths problem with dual link cost structure (TDPDCP). We propose a dual pheromone structure and a procedure for solution construction which is appropriate for the TDPDCP. Computational comparisons with the state-of-the-arts algorithms are also provided.

• Bulletin of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.215-219
• /
• 1995

The most fundamental examples of (combinatorial) geometries are projective geometries PG(n - 1,q) of dimension n - 1, representable over GF(q), where q is a prime power. Every upper interval of a projective geometry is a projective geometry. The Whitney numbers of the second kind are Gaussian coefficients. Every flat of a projective geometry is modular, so the projective geometry is supersolvable in the sense of Stanley [6].

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.7
• /
• pp.1340-1345
• /
• 2001

In this paper, we proposed the method computing the optimal solution of Optical Flow(OF) representing the moving information of moving object and improving the operating speed. In order to do that, we computed the optimal solution of OF using the Combinatorial Hough Transform(CHT) and Voting accumulation and simply searched the moving object compared to conventional method.

• Communications of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.553-563
• /
• 2017

Different topological dimensions related to the pseudo-prime spectrum of topological modules are studied. An example of topological modules is introduced. Also, we give a result about Noetherianness of the pseudo-prime spectrum of topological modules.

• Proceedings of the PSK Conference
• /
• 2002.10a
• /
• pp.86-87
• /
• 2002

Recent technological innovations in the drug discovery process such as combinatorial synthesis and high throughput screening have led to the identification of an increasingly large number of compounds at the hits-to-leads stage. Therefore, rapid and precise pharmacokinetic/metabolic screening is essential to enhance the tractability of selected leads and to minimize the risk of failure in the later stages of drug development. (omitted)

• Proceedings of the PSK Conference
• /
• 2002.10a
• /
• pp.92-93
• /
• 2002

With the recent development of combinatorial chemistry, recombinant biotechnology and rational drug design, millions of compounds are being produced in the laboratories of pharmaceutical companies. These new drug candidates are evaluated their efficacy and toxicity through in vivo animal model studies which is very important in drug development. From these studies, very successful drug candidates are selected. (omitted)