• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.77-86
• /
• 2002

Ford and Fulkerson have shown that a stationary maximal dynamic flow can be obtained by solving a transhipment problem associated with the static network and thereby finding the maximal temporally repeated dynamic flow. This flow is known to be an optical dynamic flow. This paper presents an algorithm for second best temporal1y repeated flows. A numerical example is presented.

• Journal of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.11-21
• /
• 1998

A condition for a certain maximal operator to be of strong type (p,p) is characterized in terms of Carleson measure.

• Journal of Applied and Pure Mathematics
• /
• v.5 no.1_2
• /
• pp.121-128
• /
• 2023

The aim of this article is to extend hesitant fuzzy minimal open and hesitant fuzzy maximal open sets in hesitant fuzzy topological space. Further, we investigate some properties with these new sets.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.16.1-16
• /
• 2003

A subset S of vertices of a graph G is independent if no two vertices of S are adjacent by an edge in G. Also we say that S is maximal independent if it is contained In no larger independent set in G. A planted plane tree is a tree that is embedded in the plane and rooted at an end-vertex. A (k＋1) -valent tree is a planted plane tree in which each vertex has degree one or (k＋1). We classify maximal independent sets of (k＋1) -valent trees into two groups, namely, type A and type B maximal independent sets and consider specific independent sets of these trees. We study relations among these three types of independent sets. Using the relations, we count the number of all maximal independent sets of (k＋1) -valent trees with n vertices of degree (k＋1).

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.4
• /
• pp.139-155
• /
• 2006

The facility location problem of this paper is distinguished from the maximal covering location problem and the flxed-charge facility location problem. We propose the maximal profiting location problem (MPLP) that is the facility location problem maximizing profit with multi-product. We apply to the simulated annealing algorithm, the stochastic evolution algorithm and the accelerated simulated annealing algorithm to solve this problem. Through a scale-down and extension experiment, the MPLP was validated and all the three algorithm enable the near optimal solution to produce. As the computational complexity is increased, it is shown that the simulated annealing algorithm' is able to find the best solution than the other two algorithms in a relatively short computational time.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.3
• /
• pp.205-210
• /
• 2006

Curve tessellation, which generates a sequence of points from a curve, is very important for curves rendering on a computer screen and for NC machining. For the most case the sequence of discrete points is used rather than a continuous curve. This paper deals with a method of tessellation by calculating the maximal deviation of a curve. The maximal deviation condition is introduced to find the point with the maximal chordal deviation on a curve segment. In the previous research a curve tessellation was tried by the subdivision method, that is, a curve is subdivided until the maximal chordal deviation is less than the given tolerance. On the other hand, a curve tessellation by sequential method is tried in this paper, that is, points are generated successively by using the local property of a curve. The sequential method generates relatively much less points than the subdivision method. Besides, the sequential method can generate a sequence of points from a spatial curve by approximation to a planar curve. The proposed method can be applied for high-accuracy curve tessellation and NC tool-path generation.

• Journal of Oral Medicine and Pain
• /
• v.6 no.1
• /
• pp.9-14
• /
• 1981

Maximal active movements of the mandible in the vertical and the horizontal plane were measured in 106 mem and 78 women. ranging from 20 to 29 years old, with a method devised by agerberg. The studied persons who were dental students of the School of Dentistry Seoul National University (SNU), nurses and dental auxiliaries of the SNU Hospital, had no pain or severe symptoms of dysfunction of the masticatory system. The obtained results were as follows : 1. The mean values for maximal opening and protrusion differed significantly between men and women, 55.9 mm and 49.7 mm, 9.3 mm and 7.4 mm respectively. 2. The means found for maximal lateral movement to the right and to the left were practically the same, 8.5 - 9 mm and did not differ with sex. 3. The lower limit of the normal range of horizontal movements may be regarded as 4 mm for men and 3 mm for women and maximal opening as 44 mm for men and 39 mm for women. 4. The maximal mandibular movement ranges of 20-year old person with 95 % probability were calculated and presented grphically.

• Journal of the Korean Mathematical Society
• /
• v.40 no.2
• /
• pp.241-250
• /
• 2003

Let (B, m$_{B}$, k) be a maximal commutative $textsc{k}$-subalgebra of M$_{m}$(k). Then, for some element z $\in$ Soc(B), a k-algebra R = B［X,Y］/I, where I ＝ (m$_{B}$X, m$_{B}$Y, X$^2$- z,Y$^2$- z, XY) will create an interesting maximal commutative $textsc{k}$-subalgebra of a matrix algebra which is neither a $C_1$-construction nor a $C_2$-construction. This construction will also be useful to embed a maximal commutative $textsc{k}$-subalgebra of matrix algebra to a maximal commutative $textsc{k}$-subalgebra of a larger size matrix algebra.gebra.a.

• Communications for Statistical Applications and Methods
• /
• v.9 no.2
• /
• pp.347-354
• /
• 2002

An n-point design is maximal fan if all the models with n-terms satisfying the divisibility condition are estimable. Such designs tend to be space filling and look very similar to the ″Latin-hypercube″ designs used in computer experiments. Caboara, Pistone, Riccomago and Wynn (1997) conjectured that a maximal fan design on an integer grid exists for any n and m, where m is the number of factors. In this paper we examine the relationship between maximal fan design and latin-hypercube to give a partial solution for the conjecture.

• East Asian mathematical journal
• /
• v.27 no.5
• /
• pp.545-555
• /
• 2011

Based on the A-maximal(m)-relaxed monotonicity frameworks, the approximation solvability of a general class of variational inclusion problems using the relaxed proximal point algorithm is explored, while generalizing most of the investigations, especially of Xu (2002) on strong convergence of modified version of the relaxed proximal point algorithm, Eckstein and Bertsekas (1992) on weak convergence using the relaxed proximal point algorithm to the context of the Douglas-Rachford splitting method, and Rockafellar (1976) on weak as well as strong convergence results on proximal point algorithms in real Hilbert space settings. Furthermore, the main result has been applied to the context of the H-maximal monotonicity frameworks for solving a general class of variational inclusion problems. It seems the obtained results can be used to generalize the Yosida approximation that, in turn, can be applied to first- order evolution inclusions, and can also be applied to Douglas-Rachford splitting methods for finding the zero of the sum of two A-maximal (m)-relaxed monotone mappings.