• 한국약용작물학회지
• /
• 제26권2호
• /
• pp.148-156
• /
• 2018

Background: Hot steaming is known to be effective in improving the biological activities of plant extracts by breaking down useful compounds to low molecular weight ones. Methods and Results: This study aimed to develop an optimal extraction and steam processing method for enhancing the low molecular ginsenoside contents of the adventitious roots culture of wild mountain ginseng. The total ginsenoside was optimally extracted when 70% EtOH was used at $50^{\circ}C$, whereas low molecule ginsenoside such as Rg2, Rh1, Rh4 and Rk1 could be extracted using 70% EtOH at $70^{\circ}C$. The adventitious roots culture of wild mountain ginseng is known to contain four major ginsenosides, i.e., Rb2, Rb1, Rg1 and Rd, however new ginsenosides Rg6, Rh4, Rg3, Rk1 and Rg5 were new abundantly obtaind after steam processing method was applied. The contents of total ginsenosides were the highest when thermal steam processing was conducted at $120^{\circ}C$ for 120 min. Unlike ginsenosides such as Rg1, Re, Rb1, Rc, Rb2, and Rh1, which decreased after steam processing, Rg3, Rk1, and Rg5 increased after thermal processing. Steam processing significanltly reduced the content of Rb1, increased that of Rg6 by about ten times than that in the adventitious roots culture of wild mountain ginseng. Conclusions: Our study showed that the optimal extraction and steam processing method increased the content of total ginsenosides and allowed the extraction of minor ginsenosides from major ones.

• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.305-314
• /
• 2007

This paper considers single machine scheduling problems where the processing time of a job increases as a function of its position in the sequence. In this model, the later a given job is scheduled in the sequence, the longer its processing time. It is shown that the optimal schedule may be very different from that of the classical version of the problem. We introduce polynomial solutions for the makespan minimization problem, the sum of completion times minimization problem and the sum of earliness penalties minimization problem. For two resource constrained problems, based on the analysis of the problems, the optimal resource allocation methods are presented, respectively.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2017년도 춘계학술발표대회
• /
• pp.178-180
• /
• 2017

Virtualization was devised as a resource management and optimization technique for mainframes having scaleless computing capabilities. The resource scaling can be done with a variety of virtualization methods such as VM creation, deletion, and migration. In this paper, we designed to achieve the load balancing, several load balancing schemes such as Minimum Execution Time (MET), Min-Min scheduling, Cloud Analyst have been reported in literature in addition to a comprehensive study on First Come First Serve (FCFS) and Round-robin schedulers.

• Journal of Information Processing Systems
• /
• 제4권3호
• /
• pp.103-112
• /
• 2008

This paper proposes a policy adjuster-driven Grid workflow management system for collaborative healthcare platform, which supports collaborative heart disease diagnosis applications. To select policies according to service level agreement of users and dynamic resource status, we devised a policy adjuster to handle workflow management polices and resource management policies using policy decision scheme. We implemented this new architecture with workflow management functions based on policy quorum based resource management system for providing poincare geometrycharacterized ECG analysis and virtual heart simulation service. To evaluate our proposed system, we executed a heart disease identification application in our system and compared the performance to that of the general workflow system and PQRM system under different types of SLA.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2004년도 추계학술발표논문집(상)
• /
• pp.279-282
• /
• 2004

In this paper, we present the methodology of performance testing for web based university resource planning systems. The methodology contains an adequate procedure and workload assessment method. We execute real performance testing to the university resource system during system test stage. To verify the adequacy of the methodology, We compare the result between testing system's hardware utilization and operating system's. The result is nearly the same. Empirical experiments are also shown.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2014년도 추계학술발표대회
• /
• pp.215-217
• /
• 2014

In Software Defined Network (SDN), data plane and control plane are decoupled. Dummy switches on the data plane simply forward packet based on the flow entries that are stored in its flow table. The flow entries are generated by a centralized controller that acts as a brain of the network. However, the size of flow table is limited and it can conduct a security issue related to Distributed Denial of Service (DDoS). Especially, it related to resource attack that consumes all flow table resource and consumes controller resources. In this paper, we will analyze the impact of flow table limitation to the controller. Then we propose an approach that is called Flow Table Management to handle flow table limitation.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2019년도 추계학술발표대회
• /
• pp.901-903
• /
• 2019

인공지능 기술의 발전에 따라 산업, 교육, 게임, 의료, 국방, 교통 등에서 여러 가지 방면으로 활용되어가고 있다. 하지만 인공지능을 게임에 접목해 게임 내에서 사람보다 월등한 성적을 낼 수 있다는 것이다. 과거에는 메모리 변조, 패킷 변조 등의 공정한 플레이 규정을 파괴하는 프로그램을 사용하였다면 현재에는 딥러닝을 통해 학습된 게임 알고리즘은 이제까지의 프로그램과는 다르므로 게임 인공지능 산업의 개선방안을 제안하고자 한다.

• Journal of Information Processing Systems
• /
• 제6권1호
• /
• pp.107-120
• /
• 2010

The Internet has been growing at unprecedented rates. The problem of an address shortage could act as a barrier on this growth. In principle, a new Internet standard, IPv6 solves the problem of the address shortage because it has a very large address space. But IPv6 is not yet compatible with the IPv4 and during the IPv4-to-IPv6 transition period IPv4 address will continue to be in demand. Thus for quite some time, the problem of IP address shortage will persist. To solve the problem, we propose the mechanism of secure IP address trading. This mechanism is based on the Resource PKI (RPKI). The RPKI is the working item of IETF. This proposed mechanism maximizes the trust of IP address trading using RPKI.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2001년도 춘계학술발표논문집 (상)
• /
• pp.507-510
• /
• 2001

HTTP/1.1 standard reduces latencies and overhead from closing and re-establishing connections by supporting persistent connections as a default, which encourage multiple transfers of objects over one connection. HTTP/1.1, however, does not define explicitly connection-closing time but specifies a certain fixed holding time model. This model may induce wasting server's resource when server maintains conn ection with the idle-state client that requests no data for a certain time. This paper proposes the mechanism of a heuristic connection management supported by the client-side under persistent HTTP, in addition to HTTP/1.1's fixed holding time model on server-side. The client exploits the tag information within transferred HTML page so that decides connection-closing time. As a result, the mechanism allows server to use server's resource more efficiently without server's efforts.

• Journal of Information Processing Systems
• /
• 제19권4호
• /
• pp.450-464
• /
• 2023

To address the problems of large system overhead and low timeliness when dealing with task scheduling in mobile edge cloud computing, a task scheduling and resource management strategy for edge cloud computing based on an improved genetic algorithm was proposed. First, a user task scheduling system model based on edge cloud computing was constructed using the Shannon theorem, including calculation, communication, and network models. In addition, a multi-objective optimization model, including delay and energy consumption, was constructed to minimize the sum of two weights. Finally, the selection, crossover, and mutation operations of the genetic algorithm were improved using the best reservation selection algorithm and normal distribution crossover operator. Furthermore, an improved legacy algorithm was selected to deal with the multi-objective problem and acquire the optimal solution, that is, the best computing task scheduling scheme. The experimental analysis of the proposed strategy based on the MATLAB simulation platform shows that its energy loss does not exceed 50 J, and the time delay is 23.2 ms, which are better than those of other comparison strategies.