• Kyungpook Mathematical Journal
• /
• v.48 no.2
• /
• pp.303-315
• /
• 2008

In [8] M. Y. Alzoubi and M. M. Jaradat studied the basis number of the composition of paths and cycles with Ladders, Circular ladders and M$\"{o}$bius ladders. Namely, they proved that the basis number of these graphs is 4 except possibly for some cases in each of them. Since the lexicographic product is noncommutative, in this paper we investigate the basis number of the lexicographic product of the different kinds of ladders with paths and cycles. In fact, we prove that the basis number of almost all of these graphs is 4.

• Kyungpook Mathematical Journal
• /
• v.47 no.2
• /
• pp.165-714
• /
• 2007

The basis number of a graph G is the least positive integer $k$ such that G has a $k$-fold basis. In this paper, we prove that the basis number of the cartesian product of a path with a circular ladder, a M$\ddot{o}$bius ladder and path with a net is exactly 3. This improves the upper bound of the basis number of these graphs for a general theorem on the cartesian product of graphs obtained by Ali and Marougi, see [2]. Also, by this general result, the cartesian product of a theta graph with a M$\ddot{o}$bius ladder is at most 5. But in section 3 we prove that it is at most 4.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.3
• /
• pp.385-394
• /
• 2007

An upper bound of the basis number of the semi-strong product of cycles with bipartite graphs is given. Also, an example is presented where the bound is achieved.

• Kyungpook Mathematical Journal
• /
• v.45 no.1
• /
• pp.45-53
• /
• 2005

A basis of the cycle space C (G) is d-fold if each edge occurs in at most d cycles of C(G). The basis number, b(G), of a graph G is defined to be the least integer d such that G has a d-fold basis for its cycle space. MacLane proved that a graph G is planar if and only if $b(G)\;{\leq}\;2$. Schmeichel showed that for $n\;{\geq}\;5,\;b(K_{n}\;{\bullet}\;P_{2})\;{\leq}\;1\;+\;b(K_n)$. Ali proved that for n, $m\;{\geq}\;5,\;b(K_n\;{\bullet}\;K_m)\;{\leq}\;3\;+\;b(K_n)\;+\;b(K_m)$. In this paper, we give an upper bound for the basis number of the semi-strong product of a bipartite graph with a cycle.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.11a
• /
• pp.52-57
• /
• 2001

In this paper, the optimum designs of air-bearing surface(ABS) are achieved effectively by using reduced basis concept which can reduce the number of design variables although the design space is distended. Generally, the optimization method is more effective than the trial and error. However, the efficiency of the former is largely dependent on the number of the design variables. In order to reduce the number of design variables and increase the efficiency, reduced basis concept is applied. We can define the desired design as a linear combination of basis designs using this concept. From this optimization method with reduced basis concept, we easily obtain the optimum designs of ABS whose target flying heights are 25, 20, 15 nm.

• The Korean Journal of Emergency Medical Services
• /
• v.7 no.1
• /
• pp.55-64
• /
• 2003

The purposes of this study which was conducted by applying three projection formulae to the data from admission quota for paramedic of the Ministry of Education & Human Resources Development the number of ambulances the number of emergency medical centers of the Ministry of Health & Welfare and rate of successful candidates of annual report of the National Health Personnel Licensing Examination Board were to find out demand and supply of paramedic from 2002 to 2045 and to expand scope of practice of paramedic in Korea. The conclusions from this study were summarized as follows; (1) The simple formulae derived from the projection formula of the Economic Planning Board were applied under the present Emergency Medical Services Act including qualifying over 3-years experienced EMT-Basic for paramedic examinee, stationing paramedic or EMT-Basic or physician or nurse per ambulance, stationing paramedic or EMT-Basic per emergency medical center and under the amended Emergency Medical Services Act including qualifying only paramedic graduate for paramedic examinee, stationing 4.5 paramedics per ambulance, stationing 10 to 2 paramedics per emergency medical center. (2) It was estimated that on the American basis of 5.6 EMTs per 10,000 in 1996, the number of paramedics under the present act will reach the basis before 2020, the number of paramedics under the amended act will reach the basis about 2040. (3) It was estimated that on the basis of 22,000 paramedics demanded from the number of ambulances, the number of emergency medical centers in 2001, the number of paramedics under the present act will reach the basis before 2015, the number of paramedics under the amended act will reach the basis about 2030. (4) There was relationship between requirements for emergency medical centers scope of practice of paramedic in the act and demand-supply of paramedic, this necessitates surveys, studies, amendment of the act, legalization for expanded scope of practice of paramedic including EMD, instructor, teacher of safety. (5) This study which includes only expanded scope of practice of paramedic and projection for paramedic in the act needs complementary studies such as decision-making process in health manpower policy and so on.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.3
• /
• pp.343-348
• /
• 2003

In this study, optimum designs of the air-bearing surface (ABS) are achieved using the reduced basis concept which can effectively reduce the number of design variables without cutting down on the design space. Even though the optimization method is easier and more applicable to handle than the trial-and-error method, its efficiency is largely dependent on the number of the design variables. Hence, the reduced basis concept is applied, by which the desired design can be defined as a linear combination of basis designs. The simulation results show the effectiveness of the proposed approach by obtaining the optimum solutions of the sliders whose target flying heights are 25, 20, and 15nm.

• Korean Management Science Review
• /
• v.13 no.3
• /
• pp.105-113
• /
• 1996

Constructing an initial basis is an important process in the simplex method. An initial basis greatly affects the number of iterations of iterations and the execution time in the simplex method. The purpose of this paper is to construct a good initial basis. First, to avoid linear dependency among the chosen columns, an enhanced Gaussian elimination method and a method using non-duplicated nonzero elements are developed. Second, for an order to choose variables, the sparsity of the column is used. Experimenal results show that the proposed method can reduce the number of iterations and the execution time compared with Bixby's method by 12%.

• Korean Management Science Review
• /
• v.17 no.2
• /
• pp.13-20
• /
• 2000

In this research, we compare and analyze the two initial basis construction procedures: LPAKO’s procedure proposed by Seo et. al. and symbolic crash procedure proposed by Maros et. al.. Based on the analysis, we present a new procedure which complements the previous procedures. The new procedure shows superiority to the previous procedures with respects to the optimality of initial basis. Also, the linear basis Also. the initial basis constructed by the new procedure reduces the number of simplex iterations.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.2
• /
• pp.169-176
• /
• 2012

This paper uses loop-star basis functions to overcome the low frequency breakdown problem in method of moments (MoM) based on electric field integral equation(EFIE). In addition, p-Type Multiplicative Schwarz preconditioner (p-MUS) technique is employed to reduce the number of iterations required for the conjugate gradient method(CGM). Low frequency instability with Rao Wilton Glisson(RWG) basis functions in EFIE can be resolved using loop-start basis functions and frequency normalized techniques. However, loop-star basis functions, consisting of irrotational and solenoidal components of RWG basis functions, require a large number of iterations to calculate a solution through iterative methods, such as conjugate gradient method(CGM), due to high condition number. To circumvent this problem, in this paper, the pMUS preconditioner technique is proposed to reduce the number of iterations in CGM. Simulation results show that pMUS preconditioner is much faster than block diagonal preconditioner(BDP) when the sparsity of pMUS is the same as that of BDP.