• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.585-587
• /
• 2007

본 논문에서는 피라미드 그래프 내에 내재된 사이클 특성을 분석한다. 사이클 확장 연산을 이용하여 사이클의 크기를 신장시켜 나가는 일련의 과정에서 가능한 모든 정점들을 포함시키기 위해 불가피하게 피해야 할 조건들에 대해 분석한다.

• The KIPS Transactions:PartA
• /
• v.13A no.3 s.100
• /
• pp.253-260
• /
• 2006

In this paper, we analyze the Hamiltonian property of Pyramid graphs. We prove that it is always possible to construct a Hamiltonian cycle of length $(4^N-1)/3$ by applying the proposed algorithm to construct series of cycle expansion operations into two adjacent cycles in the Pyramid graph of height N.

• The KIPS Transactions:PartA
• /
• v.15A no.2
• /
• pp.119-124
• /
• 2008

In this paper, we analyze a cycle property embedded in pyramid graphs. We prove that it is always possible to construct diverse cycles of all lengths from 3 to ($4^N-1$)/3 by applying series of cycle expansion operations to the pyramid graph of height N. This means that the pyramid graph has the pancyclic property.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1464-1473
• /
• 2000

In this paper, we analyze the cycle property of the (n,k)-star graph that has an attention as an alternative interconnection network topology in recent years. Based on the graph-theoretic properties in (n,k)-star graphs, we show the pancyclic property of the graph and also present the corresponding algorithm. Based on the recursive structure of the graph, we present such top-down approach that the resulting cycle can be constructed by applying series of "dimension expansion" operations to a kind of cycles consisting of sub-graphs. This processing naturally leads to such property that the resulting cycles tend to be integrated compactly within some minimal subset of sub-graphs, and also means its applicability of another classes of the disjoint-style cycle problems. This result means not only the graph-theoretic contribution of analyzing the pancyclic property in the underlying graph model but also the parallel processing applications such a as message routing or resource allocation and scheduling in the multi-computer system with the corresponding interconnection network.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.9 no.6
• /
• pp.795-800
• /
• 1985

The ideal Brayton cycle has been analyzed with the heat exchange processes between the working fluid and the heat source and the sink while their heat capacity rates are constant. The power fo the cycle can be expressed in terms of a temperature of the cycle and the heat capacity rate of the working fluid. There exists an optimum power condition where the heat capacity rate of the working fluid has a value between those of the heat source and the heat sink, and the cycle efficiency is determined by the inlet temperatures of the heat source and the sink.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.867-870
• /
• 2005

본 논문에서는 피라미드 그래프를 대상으로 링을 임베딩하는 문제를 다룬다. 사이클 확장 연산을 이용하는 사이클의 크기를 확대시켜 나가는 일련의 과정을 통하여 최대 크기의 링을 의미하는 헤밀톤 사이클을 찾을 수 있는 알고리즘을 제시함으로써 임의의 높이 N인 피라미드 그래프 내에 길이 $4^N-1/3$인 링을 임베딩 할 수 있음을 증명한다.

• Resources Recycling
• /
• v.24 no.5
• /
• pp.22-32
• /
• 2015

This study aims to discuss the concept of upcycling as it applies to diaper recycling. Upcycling is the process of converting waste materials into new products of better quality. Through benchmarking of upcycling examples, useless objects can be transformed into valuable materials. However, current upcycling examples determine value creation related to qualitative elements, so that it is difficult to establish any quantitative strategy of upcycled products. Therefore, this study expands a B2B (Business to business) product for improving market availability and establishes a direction using both recovered pulp and mixed plastic at the same time. As a result, the upcycling method for recovered pulp and mixed plastics, is the application of a cellulose insulator. Within the near future, the high quality insulator market will grow more than three times. An upcycling strategy targeting the high quality insulator market needs to be established.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9A
• /
• pp.685-696
• /
• 2009

The requirements of the NGA are to provide broader bandwidth, higher splitting ratio, and longer reach than those of the current FTTH. In the TDMA PON accounting for large percentage in the total FTTH, the increase in distance between the OLT and the ONU leads to the increase in propagation delay and in packet delay three times more than the propagation delay. It is because a packet arrived in the ONU is handled through bandwidth request, grant, and transmission. To reduce the increased packet delay, the OLT have to reduce the cycle time. However, it will cause increased overhead and reduced link efficiency. In this paper, we investigate several problems in TDMA PON when the subscriber access network extended to 60 or 100 Km reach as a NGA goal and provide a method that determines an optimal cycle time to satisfy QoS for delay sensitive traffics. In particular, we suggest a variable equalized round trip delay method and a variable cycle time method. It is shown that the former reduces the packet delay and the latter increase the link efficiency.

• Information and Communications Magazine
• /
• v.26 no.9
• /
• pp.16-23
• /
• 2009

본고에서는 최근 화두가 되고 있는 저탄소 녹색성장을 달성하기 위한 IT의 역할에 대해 살펴보고, 미래 그린 IT의 환경적, 경제적 효과를 높이기 위한 주요한 수단으로서 그린 소프트웨어 기술 동향과 적용분야에 대해 살펴본다. 특히 그동안 데이터 센터와 IT제품의 라이프 사이클관리에 집중 되어온 그린 IT의 논의를 보다 확장하여 전 산업부문에서 IT를 활용하여 경제 전반을 그린화하는 적극적인 의미의 그린 IT에 대해 살펴본다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.3
• /
• pp.347-353
• /
• 2008

The realization of intelligence by using ontology is getting attention recently. However, it is necessary to design ontology models suitable to their purpose in order to use efficiently the intelligence realized by ontology. In this paper, we define a cognition cycle for intelligent agents representing a process that the intelligent agents recognize an event and react to it. Moreover, we design an ontology-based intelligent agent, and propose an ontology model that is possible to change the agent's states, to express its emotions, and to expand its intelligence through ontological inference. Finally, we develop an intelligent agent named Helen, confirm the change of her inner states according to the environment and situation, and show the easiness of the extension of her intelligence.