• Journal of Preventive Medicine and Public Health
• /
• v.47 no.3
• /
• pp.136-143
• /
• 2014

The Global Burden of Disease (GBD) study has been instrumental in guiding global health policy development since the early 1990s. The GBD 2010 project provided rich information about the key causes of mortality, disability-adjusted life years, and their associated risk factors in Japan and provided a unique opportunity to incorporate these data into health planning. As part of the latest update of this project, GBD 2013, the Japanese GBD collaborators plan to update and refine the available burden of disease data by incorporating sub-national estimates of the burden of disease at the prefectural level. These estimates will provide health planners and policy makers at both the national and prefectural level with new, more refined tools to adapt local public health initiatives to meet the health needs of local populations. Moreover, they will enable the Japanese health system to better respond to the unique challenges in their rapidly aging population and as a complex combination of non-communicable disease risk factors begin to dominate the policy agenda. Regional collaborations will enable nations to learn from the experiences of other nations that may be at different stages of the epidemiological transition and have different exposure profiles and associated health effects. Such analyses and improvements in the data collection systems will further improve the health of the Japanese, maintain Japan's excellent record of health equity, and provide a better understanding of the direction of health policy in the region.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2002.11a
• /
• pp.72-81
• /
• 2002

Management for security product and application is becoming more difficult because they became more specialized. Most of research is focused on combining policies for information security management policy, security standard, and security tools. However, there are no researches for total solution for both application and security policy. Thereby, the purpose of this research is to propose a remote integrated management system based on linux. The system could efficiently manage data update for application and policy update for a server supporting the distinct configuration of each server. By using the remote integrated management system, system manager with poor secure knowledge also could easily manage their system securely.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.11a
• /
• pp.72-81
• /
• 2002

Management for security product and application is becoming more difficult because they became more specialized. Most of research is focused on combining policies for information security management policy, security standard, and security tools. However, there are no researches for total solution for both application and security policy. Thereby, the purpose of this research is to propose a remote integrated management system based on linux. The system could efficiently manage data update for application and policy update for a server supporting the distinct configuration of each server. By using the remote integrated management system, system manager with poor secure knowledge also could easily manage their system securely.

• Asia pacific journal of information systems
• /
• v.13 no.4
• /
• pp.191-206
• /
• 2003

More views in data warehouse, can respond to the users more rapidly because the user's requests might be processed by accessing only the materialized views with higher probabilities rather than accessing base relations. But, the update duration for maintaining materialized views limits the number of materialized views in data warehouse. In this paper, we propose the algorithm for reducing update duration of materialized views, of which aggregation functions are maintained by self-maintenance. We also implement the proposed algorithm and evaluate the performance of the algorithm.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.3
• /
• pp.121-130
• /
• 2017

NAND flash memory has advantages of non-volatility, little power consumption and fast access time. However, it suffers from inability that does not provide to update-in-place and the erase cycle is limited. Moreover, the unit of read/write operation is a page and the unit of erase operation is a block. Therefore, erase operation is slower than other operations. The AGC, the proposed garbage collection policy focuses on not only garbage collection time reduction for real-time guarantee but also wear-leveling for a flash memory lifetime. In order to achieve above goals, we define three garbage collection operating modes: Fast Mode, Smart Mode, and Wear-leveling Mode. The proposed policy decides the garbage collection mode depending on system CPU usage rate. Fast Mode selects the dirtiest block as victim block to minimize the erase operation time. However, Smart Mode selects the victim block by reflecting the invalid page number and block erase count to minimizing the erase operation time and deviation of block erase count. Wear-leveling Mode operates similar to Smart Mode and it makes groups and relocates the pages which has the similar update time. We implemented the proposed policy and measured the performance compare with the existing policies. Simulation results show that the proposed policy performs better than Cost-benefit policy with the 55% reduction in the operation time. Also, it performs better than Greedy policy with the 87% reduction in the deviation of erase count. Most of all, the proposed policy works adaptively according to the CPU usage rate, and guarantees the real-time performance of the system.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.8
• /
• pp.808-812
• /
• 2008

In recent years, the software vulnerability becomes an important problem to the safety in operating system kernel. Many organizations endeavor to publish patches soon after discovery of vulnerability. In spite of the effort, end-system administrators hesitate to apply the patches to their system. The reasons of hesitation are the reboot disruption and the distrust of patches. To solve this problem we propose a dynamic update system for non-updatable kernel, named DUNK. The DUNK provides: 1) a dynamic update mechanism at function-level granularity to overcome the reboot disruption and 2) a safety verification mechanism to overcome the distrust problem, named MAFIA. In this paper, we describe the design of DUNK and detailed algorithm of MAFIA.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1150-1156
• /
• 2019

This paper explores a model-free value-based approach for solving survival gridworld problem. Survival gridworld problem opens up a challenge involving taking risks to gain better rewards. Classic value-based approach in model-free reinforcement learning assumes minimal risk decisions. The proposed method involves a hybrid on-policy and off-policy updates to experience roll-outs using a modified Q-based update equation that introduces a parametric linear rectifier and motivational discount. The significance of this approach is it allows model-free training of agents that take into account risk factors and motivated exploration to gain better path decisions. Experimentations suggest that the proposed method achieved better exploration and path selection resulting to higher episode scores than classic off-policy and on-policy Q-based updates.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.3
• /
• pp.689-696
• /
• 2007

This paper considers a Bayesian approach to determine an optimal PM policy with random maintenance quality. Thus, we assume that the quality of a PM action is a random variable following a probability distribution. When the failure time is Weibull distribution with uncertain parameters, a Bayesian approach is established to formally express and update the uncertain parameters for determining an optimal PM policy. Finally, the numerical examples are presented for illustrative purpose.

• Proceedings of the Korean Reliability Society Conference
• /
• 2002.06a
• /
• pp.273-273
• /
• 2002

In this paper, we investigate a software release policy with software reliability growth factor during the warranty period by assuming that the software reliability growth is assumed to occur after the testing phase with probability p and the software reliability growth is not assumed to occur after the testing phase with probability 1-p. The optimal release policy to minimize the expected total software cost is discussed. Numerical examples are shown to illustrate the results of the optimal policy. And we consider a Bayesian decision theoretic approach to determine an optimal software release policy. This approach enables us to update our uncertainty when determining optimal software release time, When the failure time is Weibull distribution with uncertain parameters, a bayesian approach is established. Finally, numerical examples are presented for illustrative propose.

• ETRI Journal
• /
• v.41 no.4
• /
• pp.465-472
• /
• 2019

The major challenge in wireless body area networks (WBAN) is setting up a protected communication between data consumers and a body area network controller while meeting the security and privacy requirements. This paper proposes efficient and secure data communication in WBANs using a Twofish symmetric algorithm and ciphertext-policy attribute-based encryption with constant size ciphertext; in addition, the proposed scheme incorporates policy updating to update access policies. To the best of the author's knowledge, policy updating in WBAN has not been studied in earlier works. The proposed scheme is evaluated in terms of message size, energy consumption, and computation cost, and the results are compared with those of existing schemes. The result shows that the proposed method can achieve higher efficiency than conventional methods.