• Asian Pacific Journal of Cancer Prevention
• /
• v.14 no.10
• /
• pp.6189-6193
• /
• 2013

In December 2011, the Cancer Research Centre of the Cancer Institute of Iran sponsored a 3-day workshop on "Cancer Registration Principle and Challenges in Iran", which convened cancer registry experts. The objectives of the workshop were: to introduce standard cancer registration, to review the policy and procedure of cancer registration in Iran, and to review the best practices in the cancer registries in Iran. Challenges to cancer registration were discussed and recommendations were developed. The workshop was evaluated by participants for better organization of subsequent workshops. The objective of publication of this report is that based on Cancer in 5 Continents, many low- or middle-income countries do not meet the criteria for a standard population-based cancer registry (PBCR); on the other hand cancer is the most important cause of mortality and the essential part of any cancer control program is the cancer registry. Therefore this report focuses on problems and challenges of PBCR and provides recommendations which might help other developing countries to decrease their PBCR defects.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1106-1110
• /
• 2010

This paper proposes a method of optimizing a stacking strategy for an automated container terminal using multi-objective evolutionary algorithms (MOEAs). Since the yard productivities of seaside and landside are conflicting objectives to be optimized, it is impossible to maximize them simultaneously. Therefore, we derive a Pareto optimal set instead of a single best solution using an MOEA. Preliminary experiments showed that the population is frequently stuck in local optima because of the difficulty of the given problem depending on the yard occupancy rate. To cope with this problem, we propose another method of simultaneously optimizing two problems with different difficulties so that diverse solutions can be preserved in the population. Experimental results showed the proposed method can derive better stacking policies than the compared method solving a single problem given the same computational costs.

• KIISE Transactions on Computing Practices
• /
• v.22 no.12
• /
• pp.663-674
• /
• 2016

Traditional supercomputing services suffer from limited accessibility and low utilization in that users(researchers) may perform computational executions only using terminal-based command line interfaces. To address this problem, in this paper, we provide the design and implementation details of National supercomputing service framework. The proposed framework supports all the fundamental primitive functions such as user management/authentication, heterogeneous computing resource management, HPC (High Performance Computing) job management, etc. so that it enables various 3rd-party applications to be newly built on top of the proposed framework. Our framework also provides Web-based RESTful OpenAPIs and the abstraction interfaces of job schedulers (as well as bundle scheduler plug-ins, for example, LoadLeveler, Open Grid Scheduler, TORQUE) in order to easily integrate the broad spectrum of heterogeneous computing clusters. To show and validate the effectiveness of the proposed framework, we describe the best practice scenario of high energy physics Lattice-QCD as an example application.

• KIISE Transactions on Computing Practices
• /
• v.23 no.1
• /
• pp.45-56
• /
• 2017

In astronomy, the amount of data generated using wide-field optical telescope has increased exponentially. However, the fixed-size small-scale computing environment and the complexity of data analysis tools, results in difficulties to process the massive observation data collected. To resolve this problem, we propose a cloud-based automation system for the efficient processing of the enormous data gathered. The proposed system consists of a Workflow Execution Manager which manages various workflow templates and controls the execution of workflows instantiated from theses templates, and an Elastic Resource Manager that dynamically adds/deletes computing resources, according to the amount of data analysis requests. To show the effectiveness of our proposed system, we exhaustively explored a board spectrum of experiments, like elastic resources allocation, system load, etc. Finally, we describe the best practice case of DEEP-SOUTH scheduling system as an example application.

• KIISE Transactions on Computing Practices
• /
• v.23 no.1
• /
• pp.1-12
• /
• 2017

Preventive maintenance is required for best performance of facilities in large scale industry. Ultimately, the efficiency of production is maximized by preventing the failure of facilities in advance. Typically, regular maintenance is conducted manually; however, it is hard to prevent repeated failures. Also, since measures to prevent failure depend on proactive problem-solving by the facility expert, they have limitations when the expert is absent or diagnosis error is made by an unskilled expert. Alarm system is used to aid manual facility diagnosis and early detection. However, it is not efficient in practice, since it is designed to simply collect information and is activated even with small problems. In this study, we designed and developed an automated preventive maintenance system based on expert's experience in detecting failure, determining the cause, and predicting future system failure. We also discussed the system structure designed to reuse the expert's knowledge and its applications.

• Journal of Korea Water Resources Association
• /
• v.51 no.6
• /
• pp.491-501
• /
• 2018

This study presents a systematic framework to derive the best values of design and planning parameters for low impact development (LID) practices. LID was developed to rehabilitate the distorted hydrological cycle due to the rapid urbanization. This study uses Water Management Analysis Module (WMAM) to perform sensitivity analysis and multiple scenario analysis for LID design and planning parameters of Storm Water Management Model (SWMM). This procedure was applied to an urban watershed which have experienced rapid urbanization in recent years. As a result, the design and planning scenario derived by WMAM shows lower total flows and peak flow, and larger infiltration than arbitrary scenarios for LID design and planning parameters. In the future, economic analysis can be added for this application in the field.

• Journal of Wetlands Research
• /
• v.22 no.3
• /
• pp.217-224
• /
• 2020

Waterlogging and unintended lake formation become the main problem in some parts of the world. Starting from 1989, the waterlogging problem was observed in the farmland of the Jarso community of Konso Woreda adjacent to the Segen River in Ethiopia. Therefore, the objectives are determining the extent and causes of unintended lake formation using GIS/RS in addition to a preliminary field survey to mitigate the problem. The analysis of satellite images revealed that over the years invasion of the irrigable land by unwanted water had increased, as, in 1989, the size of the wetland area was about 8 Km²; in 2000 the size of the un-intended lake was only 8.23 ㎢. Alarmingly the size of the lake increased to 19.68 Km² in 2014. Silting up of Weir and changing the flow of River Segen and Human Intervention and changing the natural flow of River Yanda were the main causes of this unwanted prolonged water-logging. The ecological and social environment has been degrading as the people of the waterlogged area have been experiencing some settlement and losing their land. Another problem encountered was flooding from River Barka and invasion of the farmland. Sediment control best management practices (BMPs) i.e, Removal of sediment, providing sandbags and well-scheduled maintenance; Changing the junction point of Yanda and Segen River were suggested for the long-term and short term possible remedial measures. Gabion retaining wall on the bank of the Segen River to the face of Barka River was suggested to protect the farmland from flooding.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.24 no.3
• /
• pp.42-56
• /
• 1996

The citizens seek to maximize convenience, pleasantness and safety when they use urban facilities. However, existing practices of urban neighborhood parks have applied not qualitative standards such as adequacy, efficiency, accessibility, equity, or socioeconomic issues but very limited quantitative standards such as area per person. Therefore it is not rare that citizens have lost their accessibility to near-by neighborhood parks. And park regulations based on the distance of lien are supposed to be uniformally accomplished regardless of the consideration about users or geographical special situations. Futhermore, it has been found that some urban neighborhood parks don't reach to the standards given by the regulations. This study tries to accomplished several purposes. The first purpose is to extract the boundary of real user-accessible zones derived from the city survey. Comparing with boundary of real user-accessible zones, the second one is to propose the most efficient measurement indices among many accessibility measurement index. Based upon the above arguments, the last one is to review the propriety of the access distances(e.g., semidiameter) of an urban neighborhood park in a law. The measurement indices of accessibility examined in this study are walking distance, walking time and walking difficulty. The comparison of visual discrimination, the comparison of area and the comparison of differences of maximum distance showed similar results. Each index can also be compared in the size of area and differences of maximum distance. Walking difficulty with the turning showed the best measurement values among the measurement indices. This indicates that walking difficulty with crossing and/or turning may be another important indices in measuring accessibility, while other existing studues have mainly dealt with walking time and distance as accessibility indices. The results of this study also supported that the existing regulations related to park allocation(e.g., access diameter) are close to the findings of this study.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.5
• /
• pp.578-587
• /
• 2003

The DSTM (Dual Stack Transition Mechanism), one of tunneling mechanism, is considered as the best solution in IPv4/IPv6 transition recently. The DSTM provides a method to assure IPv4/v6 connectivity based on 4over6 (IPv4-over-IPv6) tunneling and temporal allocation of a global IPv4 address to a host requiring such communication. A TEP (Tunnel End Point) operates as a border router between IPv6 domain and IPv4 Internet, which performs encapsulation and decapsulation of 4over6 tunneling packets to assure hi-directional forwarding between both networks. In this paper, we analyze basic standards of the IPv6 protocol. And, we design and implement a DSTM TEP daemon block. The TEP daemon analyzes a fevers tunneling packet that is forwarded by the DSTM node, establishes the TEP's 4over6 interface, and supplies communication between a DSTM and a IPv4-only node. Finally, we construct a DSTM testbed and measure performance of the DSTM TEP. Our observation results show that performance of TEP supports the DSTM service.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.2
• /
• pp.244-253
• /
• 2000

Since no single routing-switching combination performs the best under various different types of applications, a flexible network is required to support a range of polices. This paper introduces an implementation of a look-up table routing engine offering flexible routing and switching polices without performance degradation unlike those based on microprocessors. By deciding contents of look-up tables, the engine can implement wormhole routing, virtual cut-through routing, and packet switching, as well as hybrid switching, under a variety of routing algorithms. Since the routing engine has a piplelined look-up table architecture, the routing delay is as small as one flit, and thus it can overlap multiple routing actions without performance degradation in comparison with hardwired routers dedicated to a specific policy. Because four pipeline stages do not induce a hazard, expensive forwarding logic is not required. The routing engine can accommodate four physical links with a time shared cut-through bus or single link with a cross-bar switch. It is implemented using Xilinx 4000 series FPGA.