• 한국수자원학회:학술대회논문집
• /
• 한국수자원학회 2020년도 학술발표회
• /
• pp.115-115
• /
• 2020

Water network partitioning (WNP) is an initiative technique to divide the original water distribution network (WDN) into several sub-networks with only sparse connections between them called, District Metered Areas (DMAs). Operating and managing (O&M) WDN through DMAs is bringing many advantages, such as quantification and detection of water leakage, uniform pressure management, isolation from chemical contamination. The research of WNP recently has been highlighted by applying different methods for dividing a network into a specified number of DMAs. However, it is an open question on how to determine the optimal number of DMAs for a given network. In this study, we present a method to divide an original WDN into DMAs (called Clustering) based on community structure algorithm for auto-creation of suitable DMAs. To that aim, many hydraulic properties are taken into consideration to form the appropriate DMAs, in which each DMA is controlled as uniform as possible in terms of pressure, elevation, and water demand. In a second phase, called Sectorization, the flow meters and control valves are optimally placed to divide the DMAs, while minimizing the pressure reduction. To comprehensively evaluate the WNP performance and determine optimal number of DMAs for given WDN, we apply the framework of multiple-criteria decision analysis. The proposed method is demonstrated using a real-life benchmark network and obtained permissible results. The approach is a decision-support scheme for water utilities to make optimal decisions when designing the DMAs of their WDNs.

• 대한기계학회논문집A
• /
• 제38권8호
• /
• pp.881-886
• /
• 2014

5 축 기반 3 차원 금속 프린팅에서는 파트형상에 overhang/undercut 형상이 존재하여도 tilting과 rotating의 2 축을 이용하여 파트형상의 조형 방향을 자유롭게 바꾸어 지지구조물(support structure) 형상피처의 추가 없이 3-D 적층(3DL: 3-D layering)이 가능하게 된다. 이를 위해서는 overhang/undercut의 형상근처에서 국부적으로 tilting과 rotating 정보에 맞는 조형 층 적층 정보를 제공하는 새로운 전처리기(preprocessor) 기능이 필요하게 된다. 본 논문에서는 overhang/undercut 과 같은 형상들을 자동으로 진단하고 검출하여 3 차원 layering 이 가능할 수 있도록 방사형 기울기 측정법(calculation of radial gradient: CRG)과 은유적 자동 분할 알고리듬(implicit auto-partitioning algorithm: IAP)을 통해 다중 적층 알고리듬(Multi-part Layering Algorithm: MPL)을 구현함을 제시하고 이를 실제 STL 형상파일에 적용하여 제시된 이론을 검증하고자 하였다.

• 대한화장품학회:학술대회논문집
• /
• 대한화장품학회 2003년도 IFSCC Conference Proceeding Book I
• /
• pp.499-500
• /
• 2003

To investigate the potency of some natural extracts as skin whitening agents, in this study, 25 natural plants were prepared from natural sources including medicinal plants, such as Angelica dahurica using methylene dichloride, ethyl acetate, n-butyl alcohol, and water as the extraction and/or the partitioning solvents. These natural extracts were subsequently subjected to in-vitro DOPA auto-oxidation test in the media containing human or mushroom tyrosinase as the oxidation promoting enzymes. Most of the extracts showed relatively higher enzyme inhibition(omitted)

• Journal of Communications and Networks
• /
• 제11권3호
• /
• pp.248-260
• /
• 2009

To connect a mobile ad hoc network (MANET) with an IP network and to carryout communication, ad hoc network node needs to be configured with unique IP adress. Dynamic host configuration protocol (DHCP) server autoconfigure nodes in wired networks. However, this cannot be applied to ad hoc network without introducing some changes in auto configuration mechanism, due to intrinsic properties (i.e., multi-hop, dynamic, and distributed nature) of the network. In this paper, we propose a scalable autoconfiguration scheme for MANETs with hierarchical topology consisting of leader and member nodes, by considering the global Internet connectivity with minimum overhead. In our proposed scheme, a joining node selects one of the pre-configured nodes for its duplicate address detection (DAD) operation. We reduce overhead and make our scheme scalable by eliminating the broadcast of DAD messages in the network. We also propose the group leader election algorithm, which takes into account the resources, density, and position information of a node to select a new leader. Our simulation results show that our proposed scheme is effective to reduce the overhead and is scalable. Also, it is shown that the proposed scheme provides an efficient method to heal the network after partitioning and merging by enhancing the role of bordering nodes in the group.

• International Journal of Contents
• /
• 제13권2호
• /
• pp.29-34
• /
• 2017

Cloud computing is becoming an effective and efficient way of computing resources and computing service integration. Through centralized management of resources and services, cloud computing delivers hosted services over the internet, such that access to shared hardware, software, applications, information, and all resources is elastically provided to the consumer on-demand. The main enabling technology for cloud computing is virtualization. Virtualization software creates a temporarily simulated or extended version of computing and network resources. The objectives of virtualization are as follows: first, to fully utilize the shared resources by applying partitioning and time-sharing; second, to centralize resource management; third, to enhance cloud data center agility and provide the required scalability and elasticity for on-demand capabilities; fourth, to improve testing and running software diagnostics on different operating platforms; and fifth, to improve the portability of applications and workload migration capabilities. One of the key features of cloud computing is elasticity. It enables users to create and remove virtual computing resources dynamically according to the changing demand, but it is not easy to make a decision regarding the right amount of resources. Indeed, proper provisioning of the resources to applications is an important issue in IaaS cloud computing. Most web applications encounter large and fluctuating task requests. In predictable situations, the resources can be provisioned in advance through capacity planning techniques. But in case of unplanned and spike requests, it would be desirable to automatically scale the resources, called auto-scaling, which adjusts the resources allocated to applications based on its need at any given time. This would free the user from the burden of deciding how many resources are necessary each time. In this work, we propose an analytical and efficient VM-level scaling scheme by modeling each VM in a data center as an M/M/1 processor sharing queue. Our proposed VM-level scaling scheme is validated via a numerical experiment.

• 융합보안논문지
• /
• 제22권4호
• /
• pp.169-178
• /
• 2022

도메인이 여러 개로 구성된 멀티 네트워크를 운영하는 조직에서는 단일 화면 상에 다수의 네트워크 토폴로지를 시각화하여 전체 노드들과 링크들을 감시할 수 있는 기능이 필요한데, 도메인간의 연결점이 없는 토폴로지를 단일 화면 상에 표시하는 것은 간단하지가 않다. 게다가, 다수의 네트워크 형상들을 단일 화면 상에 실제와 같은 물리적 모습으로 표시하는 것은 어렵기 때문에, 멀티 도메인 네트워크를 하나의 화면을 통해 관리하는데는 어려움이 있다. 본 연구에서는 멀티 도메인 환경에서 노드간의 최소 연결 정보만을 이용하여 토폴로지를 시각화하는 효율적인 방법을 제안한다. 이 방법은 네트워크를 구성하는 노드들의 중심성 지수를 활용하여 도메인별 중심 노드를 찾고, 자식 노드들과의 연결정보를 재귀적으로 탐색하여 토폴로지를 생성한다. 화면 상의 도메인별 토폴로지 표시 영역은 자식 노드들의 가중치의 합으로 계산 및 동적 분할되고, 가상의 Root 노드를 활용하여 3D 공간 상에 전체 노드들을 배치함으로써 멀티 도메인 토폴로지를 시각화한다. 이 방법은 노드간의 최소 연결 정보만을 이용하는 단순한 방법이지만, 멀티 도메인 네트워크의 물리적 형상을 유지하면서 하나의 화면에 표시할 수 있는 효율적인 토폴로지 시각화 방법이다.