• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.3 no.1
• /
• pp.26-33
• /
• 1991

An experimental study has been performed on the heat transfer by the natural convection from a conducting tube with two axial fins to a surrounding cylinder. In case of vertical fins, the maximum local Nusselt number of conducting tube appears at ${\theta}{\fallingdotseq}145^{\circ}$ and that of outer cylinder appears at ${\theta}=0^{\circ}$, for $l_F=0.3$. In case of horizontal fins, the maximum local Nusselt number of conducting tube appears at ${\theta}=180^{\circ}$ and that of outer cylinder appears at ${\theta}=0^{\circ}$. The local Nusselt number of the upper fin and the downward fin shows negative values for $l_F=1.0$. The local Nusselt number of the lower fin and the downward fin shows higher values than that of the upper fin and the upward fin. The mean Nusselt number of conducting tube in case of vertical fins are increased in order of $l_F=0.6$, 0.3, 1.0 and 0.0, but in case of horizontal fins, in order of $l_F=1.0$, 0.6, 0.3, and 0.0. The mean Nusselt number of outer cylinder in case of vertical fins are increased in order of $l_F=1.0$, 0.0, 0.3 and 0.6, but in case of horizontal fins, in order of $l_F=0.6$, 1.0, 0.3, and 0.0.

• Journal of Advanced Marine Engineering and Technology
• /
• v.32 no.5
• /
• pp.698-706
• /
• 2008

Performance improvement of Small hydro turbine is a very important subject to solve in the stage of introduction and development of the turbine. Cross-flow hydro turbine should be also studied more in detail for the turbine performance in order to extend the sites of application. In order to improve the turbine performance, the effect of the turbine shape on the turbine performance should be examined. Therefore, the effect of runner blade number on the turbine performance is investigated by use of a commercial CFD code. The results show that runner blade number gives remarkable effect on the efficiency and output power of the turbine. Pressure on the surface of the runner blade changes considerably by the blade number at Stage 1, but relatively small change of velocity distribution occurs in the flow passage.

• Journal of applied mathematics & informatics
• /
• v.14 no.1_2
• /
• pp.185-191
• /
• 2004

Given a connected graph G, we say that a set EC\;{\subseteq}\;V(G)$ is convex in G if, for every pair of vertices x, $y\;{\in}\;C$, the vertex set of every x - y geodesic in G is contained in C. The convexity number of G is the cardinality of a maximal proper convex set in G. In this paper, we show that every pair k, n of integers with $2\;{\leq}k\;{\leq}\;n\;-\;1$ is realizable as the convexity number and order, respectively, of some connected triangle-free graph, and give a lower bound for the convexity number of k-regular graphs of order n with n > k+1.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.03a
• /
• pp.101-105
• /
• 1998

A large system predictor, which can perform prediction of sales trend in a huge number of distribution centers, is presented using neural predictive model. There are 20,000 number of distribution centers, and each distribution center need to forecast future demand in order to establish a reasonable inventory policy. Therefore, the number of forecasting models corresponds to the number of distribution centers, which is not possible to estimate that kind of huge number of accurate models in ERP (Enterprise Resource Planning)module. Multilayer neural net as universal approximation is employed for fitting the prediction model. In order to improve prediction accuracy, a sequential simulation procedure is performed to get appropriate network structure and also to improve forecasting accuracy. The proposed simulation procedure includes neural structure identification and virtual predictive model generation. The predictive model generation consists of generating virtual signals and estimating predictive model. The virtual predictive model plays a key role in tuning the real model by absorbing the real model errors. The complement approach, based on real and virtual model, could forecast the future demands of various distribution centers.

• Journal of The Korean Astronomical Society
• /
• v.52 no.5
• /
• pp.159-172
• /
• 2019

It is known that the number of astronomers of a country registered to the International Astronomical Union (IAU) is correlated with that country's gross domestic product (GDP). However, the robustness of this relationship could be doubted, as the fraction of astronomers joining the IAU differs from country to country. Here we revisit this correlation by using more recent data, updated as of 2017. We find a similar correlation by using the total number of astronomers and astrophysicists with PhD degrees that are working in each country, instead of adopting the number of IAU members. We confirm the existence of the correlation. We also confirm the existence of two subgroups within this correlation. One group consists of advanced European countries having a long history of modern astronomy, while the other group consists of countries having experienced recent rapid economic development. In order to determine the cause for the correlation, we obtained the long-term variations of the number of astronomers, population, and the GDP for a number of countries. We find that the number of astronomers per capita for recently developing countries has increased more rapidly as GDP per capita increased, than that for fully developed countries. We collected demographic data of the Korean astronomical community and find that it has experienced recent rapid growth. From these findings we estimate the proper size of the Korean astronomical community by considering Korea economic power and population. The current number of PhD astronomers working in Korea is approximately 310, but it should be 550 in order for it to be comparable and competitive to the sizes of the Spanish, Canadian, and Japanese astronomical communities. If current trends continue, this number will be reached by 2030. In order to be comparable to the German, French, and Italian communities, there should be 800 PhD astronomers in Korea. We discuss ways to overcome the vulnerability of the Korean astronomical community, based on the statistics of national R&D expenditure structure in comparison with that of other major advanced countries.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.42 no.2
• /
• pp.19-34
• /
• 2017

In this study, we develop an optimal sourcing strategy considering compensation orders to mitigate the supply chain disruption risks. We considered two-echelon supply chain consisting of a single buyer and multiple suppliers who have fixed transaction cost and probabilistic disruption risks. Under this setting, we provide the joint optimization method to determine the number of suppliers and the order quantities. Through numerical examples, we provide managerial implications on the sourcing strategy by investigating changes in the order quantities and the number of suppliers due to the degree of supply chain disruption risks.

• Structural Engineering and Mechanics
• /
• v.3 no.1
• /
• pp.49-60
• /
• 1995

In the present study, a finite strip method for the vibration and stability analyses of anisotropic laminated composite plates is developed according to the higher-order shear deformation theory. This theory accounts for the parabolic distribution of the transverse shear strains through the thickness of the plate and for zero transverse shear stresses on the plate surfaces. In comparison with the finite strip method based on the first-order shear deformation theory, the present method gives improved results for very thick plates while using approximately the same number of degrees of freedom. It also eliminates the need for shear correction factors in calculating the transverse shear stiffness. A number of numerical examples are presented to show the effect of aspect ratio, length-to-thickness ratio, number of plies, fibre orientation and stacking sequence on the natural frequencies and critical buckling loads of simply supported rectangular cross-ply and arbitrary angle-ply composite laminates.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.4
• /
• pp.1031-1038
• /
• 2021

The main aim of this article is to study quantitative structure of finite simple exceptional groups F₄(2ⁿ) with n > 1. Here, we prove that the finite simple exceptional groups F₄(2ⁿ), where 2⁴ⁿ + 1 is a prime number with n > 1 a power of 2, can be uniquely determined by their orders and the set of the number of elements with the same order. In conclusion, we give a positive answer to J. G. Thompson's problem for finite simple exceptional groups F₄(2ⁿ).

• Korean Journal of Mathematics
• /
• v.30 no.2
• /
• pp.391-402
• /
• 2022

For a given graph G = (V, E), a dominating set is a subset V' of the vertex set V so that each vertex in V ＼ V' is adjacent to a vertex in V'. The minimum cardinality of a dominating set of G is called the domination number of G and is denoted by γ(G). For an integer k ≥ 1, the k-th power G^k of a graph G with V (G^k) = V (G) for which uv ∈ E(G^k) if and only if 1 ≤ d_G(u, v) ≤ k. Note that G² is the square graph of a graph G. In this paper, we obtain some tight bounds for the sum of the domination numbers of a graph and its square graph in terms of the order, order and size, and maximum degree of the graph G. Also, we characterize such extremal graphs.

• Management Science and Financial Engineering
• /
• v.9 no.2
• /
• pp.47-68
• /
• 2003

We consider the customer order scheduling problem with job capacity restriction where the number of jobs in the shop at the same time is fixed. In the customer order scheduling problem, each job is part of some batch (customer order) and the composition of the jobs (product) in the batch is pre-specified. The objective function is associated with the completion time of the batches instead of the completion time of the jobs. We first summarize the known results for the general customer order scheduling problems. Then, we establish some new properties for the problems with job capacity restriction. For the case of unit processing time with the objective of minimizing makespan, we develop a polynomial-time optimal procedure for the two machine case. For the same problem with a variation of no batch alternation, we also develop a polynomial-time optimal procedure. Then, we show that the problems with the objectives of minimizing makespan and minimizing average batch completion time become NP-hard when there exist arbitrary number of machines. Finally, We propose optimal solution procedures for some special cases.