• Progress in Medical Physics
• /
• v.24 no.4
• /
• pp.271-277
• /
• 2013

In prostate IMRT planning, the planning target volume (PTV), extended from a clinical target volume (CTV), often contains an overlap air volume from the rectum, which poses a problem inoptimization and prescription. This study was aimed to establish a planning method for such a case. There can be three options in which volume should be considered the target during optimization process; PTV including the air volume of air density ('airOpt'), PTV including the air volume of density value one, mimicking the tissue material ('density1Opt'), and PTV excluding the air volume ('noAirOpt'). Using 10 MV photon beams, seven field IMRT plans for each target were created with the same parameter condition. For these three cases, DVHs for the PTV, bladder and the rectum were compared. Also, the dose coverage for the CTV and the shifted CTV were evaluated in which the shifted CTV was a copied and translated virtual CTV toward the rectum inside the PTV, thus occupying the initial position of the overlap air volume, simulating the worst condition for the dose coverage in the target. Among the three options, only density1Opt plan gave clinically acceptable result in terms of target coverage and maximum dose. The airOpt plan gave exceedingly higher dose and excessive dose coverage for the target volume whereas noAirOpt plan gave underdose for the shifted CTV. Therefore, for prostate IMRT plan, having an air region in the PTV, density modification of the included air to the value of one, is suggested, prior to optimization and prescription for the PTV. This idea can be equally applied to any cases including the head and neck cancer with the PTV having the overlapped air region. Further study is being under process.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.2
• /
• pp.231-242
• /
• 2013

Recently, automated software testing methods such as fuzzing have been researched to find software vulnerabilities. The purpose of fuzzing is to disclose software vulnerabilities by providing a software with malformed data. In order to increase the probability of vulnerability discovery by fuzzing, we must solve the test suite reduction problem because the probability depends on the test case quality. In this paper, we propose a new method to solve the test suite reduction problem which is suitable for the long test case such as file. First, we suggested the length of test case as a measure in addition to old measures such as coverage and redundancy. Next we designed a test suite reduction algorithm using the new measure. In the experimental results, the proposed algorithm showed better performance in the size and length reduction ratio of the test suite than previous studies. Finally, results from an empirical study suggested the viability of our proposed measure and algorithm for file fuzzing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.543-548
• /
• 2017

In the conventional algorithm, the D2D message dissemination algorithm based on the Epidemic routing protocol frequently causes a problem of duplication of the received messages due to the overlaps of D2D transmission coverages. It is because all D2D devices that receive the messages perform relaying the message replicas to other D2D devices within their transmission range. Therefore, we herein propose the farthest-k relay selection algorithm to mitigate this message duplication problem. In the farthest-k relay selection algorithm, less than k devices within the D2D transmission range perform message relay. Furthermore, we perform comparative performance analysis between the conventional D2D data dissemination algorithm and our farthest-k relay selection algorithm. By using intensive MATLAB simulations we prove the performance excellency of our farthest-k relay algorithm compared with the conventional algorithm with respect to coverage probability, the total number of initially and duplicately received messages, and transmission efficiency.

• Journal of Communications and Networks
• /
• v.13 no.6
• /
• pp.664-677
• /
• 2011

In order to control interference and improve spectrum efficiency in the femtocell and macrocell overlaid system (FMOS), we propose a joint frequency bandwidth dynamic division, clustering and power control algorithm (JFCPA) for orthogonal-frequency-division-multiple access-based downlink FMOS. The overall system bandwidth is divided into three bands, and the macro-cellular coverage is divided into two areas according to the intensity of the interference from the macro base station to the femtocells, which are dynamically determined by using the JFCPA. A cluster is taken as the unit for frequency reuse among femtocells. We map the problem of clustering to the MAX k-CUT problem with the aim of eliminating the inter-femtocell collision interference, which is solved by a graph-based heuristic algorithm. Frequency bandwidth sharing or splitting between the femtocell tier and the macrocell tier is determined by a step-migration-algorithm-based power control. Simulations conducted to demonstrate the effectiveness of our proposed algorithm showed the frequency-reuse probability of the FMOS reuse band above 97.6% and at least 70% of the frequency bandwidth available for the macrocell tier, which means that the co-tier and the cross-tier interference were effectively controlled. Thus, high spectrum efficiency was achieved. The simulation results also clarified that the planning of frequency resource allocation in FMOS should take into account both the spatial density of femtocells and the interference suffered by them. Statistical results from our simulations also provide guidelines for actual FMOS planning.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.108-116
• /
• 2015

A missile defense system is composed of radars detecting incoming missiles aiming at defense assets, command control units making the decisions on weapon target assignment, and artillery batteries firing of defensive weapons to the incoming missiles. Although, the technology behind the development of radars and weapons is very important, effective assignment of the weapons against missile threats is much more crucial. When incoming missile targets toward valuable assets in the defense area are detected, the asset-based weapon target assignment model addresses the issue of weapon assignment to these missiles so as to maximize the total value of surviving assets threatened by them. In this paper, we present a model for an asset-based weapon assignment problem with shoot-look-shoot engagement policy and fixed set-up time between each anti-missile launch from each defense unit. Then, we show detailed linear approximation process for nonlinear portions of the model and propose final linear approximation model. After that, the proposed model is applied to several ballistic missile defense scenarios. In each defense scenario, the number of incoming missiles, the speed and the position of each missile, the number of defense artillery battery, the number of anti-missile in each artillery battery, single shot kill probability of each weapon to each target, value of assets, the air defense coverage are given. After running lpSolveAPI package of R language with the given data in each scenario in a personal computer, we summarize its weapon target assignment results specified with launch order time for each artillery battery. We also show computer processing time to get the result for each scenario.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.4
• /
• pp.846-851
• /
• 2007

The wireless sensor network is one of the most practical and cost-effective solutions for monitoring systems covering wild and wide area such as wildfire monitoring. However, the RF distance between sensor nodes is very short due to the need of low power consumption of the sensor node, so the number of sensor nodes to be deployed in the target area is more than tens of thousands. In this paper, we design and analyze the deployment issues as well as re-deployment problem occurred when the battery is exhausted. We also propose the needs and solutions for coverage problem in dynamic deployment. By the experimental evaluations, we analyze the packet success ratio between sensor nodes under various environments such as obstacles and variable distances.

• Journal of Digital Convergence
• /
• v.19 no.12
• /
• pp.369-376
• /
• 2021

The purpose of this study is to identify the effect of depression on chewing problems and the importance of oral aids through a point-in-time analysis. The data are the 4th(2008, 2^nd year) and the 7th(2018, 3^rd year) of the National Health and Nutrition Survey. The analysis method was frequency analysis and regression analysis using the SPSS/WIN 24.0 program. Studies have shown that depression has affected chewing problems(p<.001). Chronic diseases and the use of oral aids affected the chewing problem. The prevalence and treatment of depression affected the chewing problems(p<.001). In addition, private health insurance coverage increased in 2018 compared to 2008. In the future, the comparative studies considering various subjects and chronic diseases, the educational methods for the use of oral aids are needed.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.1-8
• /
• 2021

In Mobile Ad-Hoc Network (MANET) Application, routing protocol is essential to ensure successful data transmission to all nodes. Ad-hoc On-demand Distance Vector (AODV) Protocol is a reactive routing protocol that is mostly used in MANET applications. However, the protocol causes Route Request (RREQ) message flooding issue due to the broadcasting method at the route request stage to find a path to a particular destination, where the RREQ will be rebroadcast if no Request Response (RREP) message is received. A scalable neighbor-based routing (SNBR) protocol was then proposed to overcome the issue. In the SNBR protocol, the RREQ message is only rebroadcast if the number of neighbor nodes less than a certain fix number, known as drop factor. However, since a network always have a dynamic characteristic with a dynamic number of neighbor nodes, the fix drop factor in SNBR protocol could not provide an optimal flooding problem solution in a low dense network environment, where the RREQ message is continuously rebroadcast RREQ message until reach the fix drop factor. To overcome this problem, a new broadcasting method as Dynamic SNBR (DSNBR) is proposed, where the drop factor is determined based on current number of neighbor nodes. This method rebroadcast the extra RREQ messages based on the determined dynamic drop factor. The performance of the proposed DSNBR is evaluated using NS2 and compared with the performance of the existing protocol; AODV and SNBR. Simulation results show that the new routing protocol reduces the routing request overhead, energy consumption, MAC Collision and enhances end-to-end delay, network coverage ratio as a result of reducing the extra route request messages.

• Journal of Cadastre & Land InformatiX
• /
• v.48 no.2
• /
• pp.185-195
• /
• 2018

In the Seoul Metropolitan City, the PM(pariculate matter) application used by the citizens provides the PM concentration of the nearest monitoring stations located on the PM monitoring stations. Currently, the selecting method of the PM monitoring network considered by the Ministry of Environment is based on considering the monitoring station distribution and population density only. In this study, we analyzed the distance between PM monitoring station and the administrative center point in addition to the above considerations. The number of test sites was verified and the range of coverage of each monitoring stations was indicated by using the Voronoi algorithm and hexagon grid. The spatial position problem of the PM monitoring station was suggested by spatial data analysis. The variables of spatial data analysis are single-family houses, apartments, $1^{st}$ class neighborhood, $2^{nd}$ class neighborhood, garbage disposal plant, hazardous material disposal facility, factory, and the density map. The analysis result of the selection criterion considering the additional variables for new PM monitoring stations was presented, in addition to the selection criteria provided by the Ministry of Environment.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.1
• /
• pp.33.1-33.1
• /
• 2021

The overprediction of the number of satellite galaxies in the LCDM paradigm compared to that of the Milky Way (MW) and M31 (the "missing satellites" problem) has been a long-standing issue. Recently, a large host-to-host scatter of satellite populations has been recognized both from an observational perspective with a larger sample and from a theoretical perspective including baryons, and it is crucial to collect diverse and complete samples with a large survey coverage to investigate underlying factors contributing to the diversity. In this study, we discuss the diversity in terms of galaxy assembly history, using satellite populations of both observed systems and simulated systems from IllustrisTNG. In addition to previously studied satellite systems, we identify satellite candidates from 25deg2 of Hyper Suprime-Cam Subaru Strategic Program (HSC-SSP) Wide layer around NGC 4437, a spiral galaxy of about one-fourth of the MW mass, paired with a ~2 magnitude fainter dwarf spiral galaxy NGC 4592. Using the surface brightness fluctuations (SBF) method, we confirm five dwarf galaxies as members of the NGC 4437 group, resulting in a total of seven members. The group consists of two distinct subgroups, the NGC 4437 subgroup and the NGC 4592 subgroup, which resembles the relationship between the MW and M31. The number of satellites is larger than that of other observed and simulated galaxy groups in the same host stellar mass range. However, the discrepancy decreases if compared with galaxy groups with similar magnitude gaps (V12 ~ 2), defined as the V-band magnitude difference between the two brightest galaxies in the group. Using simulated galaxy groups in IllustrisTNG, we find that groups with smaller V12 have richer satellite systems, host more massive dark matter halos, and have assembled more recently. These results show that the host-to-host scatter of satellite populations can be attributed to the diversity in galaxy assembly history and be probed by V12 to some degree and that NGC 4437 group is likely a recently assembled galaxy group with a large halo mass compared to galaxy groups of similar luminosity.