• Nuclear Engineering and Technology
• /
• v.29 no.4
• /
• pp.299-309
• /
• 1997

The neutronic feasibility of typical Korean three-loop 900MWe class PWR core loaded with mixed oxide fuels for both annual and 18-month cycle strategies has been investigated as a means for spent fuel management. For this study, a method of determining equivalent plutonium content was developed under the equivalence concept which gives the same cycle length as uranium fuel. Optimal plutonium zoning within the MOX assembly was also designed with the aim of minimizing the peak md power. Conceptual core designs hate hen developed for equilibrium cycle with the following variations: annual and 18-month cycle, 1/3 and full MOX loading schemes, and typical and high moderation lattice. The analysis of key core physics parameters shows that in all cases considered satisfactory core designs seem to be feasible, though addition of control rod system and change in Technical Specification for soluble boron concentration are required for full MOX loading in order to meet the current design requirements.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.12
• /
• pp.1273-1277
• /
• 2011

This paper proposes a control-based approach for duty cycle adaptation in wireless sensor networks. The proposed method, QCon, controls duty cycle through queue management in order to achieve high performance under variable traffic rates. To minimize energy consumption while meeting delay requirement, we design a feedback controller, which adapts the sleeping time according to dynamically changing traffic by constraining the queue length at a predetermined value. Based on control theory, we analyze the adaptive behavior of QCon and derive conditions for system stability. Results from asymptotic analysis and simulations indicate that QCon outperforms existing scheduling protocol by achieving more energy savings while satisfying delay requirement.

• Proceedings of the Korean Nuclear Society Conference
• /
• 2003.10a
• /
• pp.68.1-68.1
• /
• 2003

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.5
• /
• pp.1753-1763
• /
• 2013

In this paper, we show that tree products of certain subgroup separable groups amalgamating normal subgroups are cyclic subgroup separable. We then extend this result to certain graph product of certain subgroup separable groups amalgamating normal subgroups, that is we show that if the graph has exactly one cycle and the cycle is of length at least four, then the graph product is cyclic subgroup separable.

• The Research Journal of the Costume Culture
• /
• v.16 no.2
• /
• pp.219-234
• /
• 2008

The purpose of this thesis is to conduct research on the degree of satisfaction (for both wearing and functioning) of cycle wear; to present the basic data to develop cycle wears which can lesson the trouble for human body and have an excellent feeling in wearing. To inquire the degree of satisfaction, the method of questionnaire was used for 100 peoples consisted of male cycling players. As the result of the satisfaction degree in wearing, it can be certain that the users are satisfied overall and yet they express the lowest satisfaction at material among material, design, color and function. When it comes to unsatisfactory factors of wearing cycle wear, the most unsatisfactory one is the poor function of clothing on the whole. As the result of the site suitability of cycle wear, we can find the problems on the girth of neck and armhole of the upper garment, and on the part from waist to hip length and the girth from thigh through knee to calf of lower garment. As the result of the motion suitability of cycle wears, we can acknowledge that there are problems on the part of neck, armpit, and abdomen of the upper garment rather than the lower one.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.809-817
• /
• 2009

We call a cycle C be a small cycle if the length of C equals to 3 or 4. In this paper, we obtain two sufficient conditions to ensure the existence of vertex-disjoint small cycles in graph and propose several problems.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1996.10a
• /
• pp.198-207
• /
• 1996

Electro sensitive traffic system can't consider passenger car unit, so, it causes start up delay time and passenger waiting time. In this paper, it antecedently creates optimal traffic cycle of passenger car unit at the bottom traffic intersection. But, sometimes it can make mistakes due to changes in car weight, car speed, and control of feed-back data. Moreover, to prevent spillback, it can adapt control even though upper traffic intersection has a different saturation rate, road length, road slope and road width.

• Biotechnology and Bioprocess Engineering:BBE
• /
• v.8 no.6
• /
• pp.349-353
• /
• 2003

The physiological characteristics of cultures of very high cell mass (e.g. 10g cell mass/L), termed“ultrahigh cell density cultures”is reviewed. A close relationship was found between the length of the optical path (OP) in flat-plate reactors and the optimal cell density of the culture as well as its areal (g m$\^$-2/ day$\^$-1/) productivity. Cell-growth inhibition (GI) unfolds as culture density surpasses a certain threshold. If it is constantly relieved, a 1.0cm OP reactor could produce ca. 50% more than reactors with longer OP, e.g. 5 or 10cm. This unique effect, discovered by Hu et al. [3], is explained in terms of the relationships between the frequency of the light-dark cycle (L-D cycle), cells undergo in their travel between the light and dark volumes in the reactor, and the turnover time of the photosynthetic center (PC). In long OP reactors (5cm and above) the L-D cycle time may be orders of magnitude longer than the PC turnover time, resulting in a light regime in which the cells are exposed along the L-D cycle, to long, wasteful dark periods. In contrast, in reactors with an OP of ca. 1.0 cm, the L-D cycle frequency approaches the PC turnover time resulting in a significant reduction of the wasteful dark exposure time, thereby inducing a surge in photosynthetic efficiency. Presently, the major difficulty in mass cultivation of ultrahigh-density culture (UHDC) concerns cell growth inhibition in the culture, the exact nature of which is awaiting detailed investigation.

• Journal of Korean Medicine for Obesity Research
• /
• v.18 no.1
• /
• pp.50-56
• /
• 2018

Obesity is associated with menstrual cycle disorder. The aim of this study was to investigate the clinical effect of the obesity therapy with Korean herbal medicine (KHM) on obese female patient with oligomenorrhea or amenorrhea. This is a retrospective observational study performed on obesity patients with oligomenorrhea or amenorrhea. Nine patients were treated with KHM and lifestyle management at least 2 months. During the treatment, body weight, body mass index (BMI), percent body fat (PBF) and menstrual cycle length were checked afterwards. Body weight, BMI, and PBF of the patients were decreased during treatments. Five of 9 subjects recovered to normal menstrual cycle. Two subjects improved menstrual cycle. The other subjects remained at oligomenorrhea or amenorrhea. This study shows that the obesity therapy including KHM could be effective to improve menstrual cycle on obese patient. Further large scale studies are necessary for more evidences.

• Kyungpook Mathematical Journal
• /
• v.48 no.2
• /
• pp.287-302
• /
• 2008

The vertex set of a digraph D is denoted by V (D). A c-partite tournament is an orientation of a complete c-partite graph. A digraph D is called cycle complementary if there exist two vertex disjoint cycles $C_1$ and $C_2$ such that V(D) = $V(C_1)\;{\cup}\;V(C_2)$, and a multipartite tournament D is called weakly cycle complementary if there exist two vertex disjoint cycles $C_1$ and $C_2$ such that $V(C_1)\;{\cup}\;V(C_2)$ contains vertices of all partite sets of D. The problem of complementary cycles in 2-connected tournaments was completely solved by Reid [4] in 1985 and Z. Song [5] in 1993. They proved that every 2-connected tournament T on at least 8 vertices has complementary cycles of length t and ${\mid}V(T)\mid$ - t for all $3\;{\leq}\;t\;{\leq}\;{\mid}V(T)\mid/2$. Recently, Volkmann [8] proved that each regular multipartite tournament D of order ${\mid}V(D)\mid\;\geq\;8$ is cycle complementary. In this article, we analyze multipartite tournaments that are weakly cycle complementary. Especially, we will characterize all 3-connected c-partite tournaments with $c\;\geq\;3$ that are weakly cycle complementary.