• Journal of the Korea Society for Simulation
• /
• v.26 no.3
• /
• pp.105-113
• /
• 2017

This study considers an optimal investment planning for improving survivability from an air threat in the layered air defense system. To establish an optimization model, we first represent the layered air defense system as a network model, and then, present two optimization models minimizing the failure probability of counteracting an air threat subject to budget limitation, in which one deals with whether to invest and the other enables continuous investment on the subset of nodes. Nonlinear objective functions are linearized using log function, and we suggest dynamic programming algorithm and linear programing for solving the proposed models. After designing a layered air defense system based on a virtual scenario, we solve the two optimization problems and analyze the corresponding optimal solutions. This provides necessity and an approach for an effective investment planning of the layered air defense system.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.12
• /
• pp.976-985
• /
• 2018

Modern radars such as the phase array radar can handle various tasks by generating a beam from a phased array antenna. Radar can be used for miscellaneous applications such as surveillance, tracking, missile guidance etc. Previous radar systems could handle only one task at a time. As such, multiple radars were required to perform simultaneous tasks. Multi-function radars can perform many tasks using only one radar system. However, the radar's resources are limited in this instance. To efficiently utilize time, it is necessary to properly schedule tasks in the radar's timeline. In this report, we investigate the efficiency of different scheduling tasks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.35-57
• /
• 2021

Fog computing aims to provide the solution of bandwidth, network latency and energy consumption problems of cloud computing. Likewise, management of data generated by healthcare IoT devices is one of the significant applications of fog computing. Huge amount of data is being generated by healthcare IoT devices and such types of data is required to be managed efficiently, with low latency, without failure, and with minimum energy consumption and low cost. Failures of task or node can cause more latency, maximum energy consumption and high cost. Thus, a failure free, cost efficient, and energy aware management and scheduling scheme for data generated by healthcare IoT devices not only improves the performance of the system but also saves the precious lives of patients because of due to minimum latency and provision of fault tolerance. Therefore, to address all such challenges with regard to data management and fault tolerance, we have presented a Fault Tolerant Data management (FTDM) scheme for healthcare IoT in fog computing. In FTDM, the data generated by healthcare IoT devices is efficiently organized and managed through well-defined components and steps. A two way fault-tolerant mechanism i.e., task-based fault-tolerance and node-based fault-tolerance, is provided in FTDM through which failure of tasks and nodes are managed. The paper considers energy consumption, execution cost, network usage, latency, and execution time as performance evaluation parameters. The simulation results show significantly improvements which are performed using iFogSim. Further, the simulation results show that the proposed FTDM strategy reduces energy consumption 3.97%, execution cost 5.09%, network usage 25.88%, latency 44.15% and execution time 48.89% as compared with existing Greedy Knapsack Scheduling (GKS) strategy. Moreover, it is worthwhile to mention that sometimes the patients are required to be treated remotely due to non-availability of facilities or due to some infectious diseases such as COVID-19. Thus, in such circumstances, the proposed strategy is significantly efficient.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.3
• /
• pp.517-526
• /
• 2021

Recently, the acceleration of the development of quantum computers has raised the issue of the safety of factorization and discrete logarithm based digital signature schemes used in existing Internet environments. To solve the issue, several digital signature schemes are presented that are safe in post-quantum computing environments, including standardization work by the National Institute of Standards and Technology(NIST). In this paper, we design and present a multi-signature scheme based on the TACHYON announced by Behnia et al. in 2018 CCS conference, and prove the security. Multi-signature schemes are key techniques that can distribute the dependence of cryptocurrency-wallet on private keys in the cryptocurrency field, which has recently received much attention as an digital signature application, and many researchers and developers have recently been interested. The multi-signature scheme presented in this paper enables public key aggregation in a plain public key model, which does not require additional zero-knowledge proof, and can construct an effective scheme with only an aggregated public key.

• The Korean Journal of Pesticide Science
• /
• v.16 no.4
• /
• pp.282-287
• /
• 2012

This study was carried out to clarify the effects of the application of pesticide by different spray nozzle types on pesticide residues. The average droplet size and discharge rate were investigated when the manual compressed sprayer with two head disk type nozzle and the knapsack engine powered sprayer with two head fan shape nozzles were used. The fan type nozzles were classified into three types by the number of orifice in the nozzle. Three type nozzles tested were fan with one orifice, fan with two orifices and fan with three orifices. Fan (trade name : D-3) with 2.4 L/min. of the discharge rate and $76{\mu}m$ of the average droplet size while maintaining constant pressure $1.1{\pm}0.2$ MPa, and fan D-35 with 2.6 L/min. and $90{\mu}m$ while maintaining constant pressure $1.0{\pm}0.2$ MPa were appropriate. The orifice size of D-3 was 0.65 mm length ${\times}$ 0.45 mm width and the orifice size of D-35 was 0.62 mm length ${\times}$ 0.46 mm width. The residue levels of imidacloprid on perilla leaves among four applications by four different nozzles show significantly difference with 5% significance level. The residue levels $3.76{\sim}3.92mg\;kg^{-1}$ by fan or disk type is smaller than $4.52{\sim}4.92mg\;kg^{-1}$ by fan II or fan III. The residue levels of imidacloprid on perilla leaf were different depend on the spray nozzles type.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1373-1381
• /
• 1999

이 논문에서는 통신망 설계 응용분야의 문제를 그래프 이론 문제로써 고려해 보았다. 개별 기업체가 서로 떨어진 두 곳을 연결하고자 할 때 공용통신망의 회선을 빌려 통신망을 구축하게 되는데 많은 경우 여러 종류의 회선들이 공급됨으로 어떤 회선을 선택하느냐의 문제가 생긴다. 일반적으로 빠른 회선(low delay)은 느린 회선(high delay)에 비해 비싸다. 그러나 서비스의 질(Quality of Service)이라는 요구사항이 종종 종단지연(end-to-end delay)시간에 의해 결정되므로, 무조건 낮은 가격의 회선만을 사용할 수는 없다. 결국 개별 기업체의 통신망을 위한 통로를 공용 통신망 위에 덮어씌워(overlaying) 구축하는 것의 여부는 두 개의 상반된 인자인 가격과 속도의 조절에 달려 있다. 따라서 일반적인 최소경로 찾기의 변형이라 할 수 있는 다음의 문제가 본 논문의 관심사이다. 두 개의 지점을 연결하는데 종단지연시간의 한계를 만족하면서 최소경비를 갖는 경로에 대한 해결을 위하여, 그래프 채색(coloring) 문제와 최단경로문제를 함께 포함하는 그래프 이론의 문제로 정형화시켜 살펴본다. 배낭문제로의 변환을 통해 이 문제는 {{{{NP-complete임을 증명하였고 {{{{O($\mid$E$\mid$D_0 )시간에 최적값을 주는 의사선형 알고리즘과O($\mid$E$\mid$)시간의 근사 알고리즘을 보였다. 특별한 경우에 대한 {{{{O($\mid$V$\mid$ + $\mid$E$\mid$)시간과 {{{{O($\mid$E$\mid$^2 + $\mid$E$\mid$$\mid$V$\mid$log$\mid$V$\mid$)시간 알고리즘을 보였으며 배낭 문제의 해결책과 유사한 그리디 휴리스틱(greedy heuristic) 알고리즘이 그물 구조(mesh) 그래프 상에서 좋은 결과를 보여주고 있음을 실험을 통해 확인해 보았다.Abstract This paper considers a graph-theoretic problem motivated by a telecommunication network optimization. When a private organization wishes to connect two sites by leasing physical lines from a public telecommunications network, it is often the cases that several categories of lines are available, at different costs. Typically a faster (low delay) lines costs more than a slower (high delay) line. However, low cost lines cannot be used exclusively because the Quality of Service (QoS) requirements often impose a bound on the end-to-end delay. Therefore, overlaying a path on the public network involves two diametrically opposing factors: cost and delay. The following variation of the standard shortest path problem is thus of interest: the shortest route between the two sites that meets a given bound on the end-to-end delay. For this problem we formulate a graph-theoretical problem that has both a shortest path component as well as coloring component. Interestingly, the problem could be formulated as a knapsack problem. We have shown that the general problem is NP-complete. The optimal polynomial-time algorithms for some special cases and one heuristic algorithm for the general problem are described.

• The Korean Journal of Pesticide Science
• /
• v.16 no.3
• /
• pp.230-235
• /
• 2012

This study was carried out to clarify effects of field location and sprayer on the level of pesticide residue in chilli peppers. As confirmed by statistical analysis, the residue levels in green pepper among three greenhouses did not show significant difference at the first day after spraying with the same engine sprayer and nozzle. But the residue levels in green peppers collected from the exposed outside of crop were 2 times higher than those from the hidden inside. The sampling site was one of variation elements of pesticide residue. The residue levels after application by knapsack engine powered sprayer were 1.7 times higher than those by manual compressed sprayer. As the spraying pressure of the engine power sprayer is 2 times higher than the commonly used pressure of the manual compressed sprayer, the pressure of the sprayer and nozzles were considered to affect on the residue levels in peppers.

• The Korean Journal of Pesticide Science
• /
• v.16 no.4
• /
• pp.336-342
• /
• 2012

This study was carried out in order to compare the residue levels of pesticides among lettuce, kale and perilla leaf depending on the morphological characteristics of plant. Residue levels were investigated at the zero, second, fifth days after last application, 9 species of systemic or non-systemic pesticide were twice applied with 7 days interval by knapsack power sprayer with 2 heads fan shape nozzle. Ratios of leaf area to weight ($cm^2$ $g^{-1}$) were 58 of perilla leaf, 27 of lettuce and 23 of kale. Ratios of leaf area to weight of perilla leaf was 2.1 times higher than that of lettuce. Residue levels of perilla leaf were 1.3 to 2.3 times higher than those of lettuce at the day of spraying and 1.3 to 3.3 times higher at the fifth day. Therefore the differences of pesticide residues between perilla leaf and lettuce were affected by the ratio of leaf area to weight. Residue levels in lettuce were 2.4 to 7.3 times higher than those in kale at the day of spraying because the adhesive effect of pesticide particles on kale leaf was low.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.64-77
• /
• 2013

In this paper, we propose a joint bandwidth allocation and path selection scheme for IEEE 802.16j networks in uplink with cooperative relaying, and we evaluate the performance of the proposed scheme by using OPNET based simulation in hilly terrain with heavy tree density. The proposed scheme maximizes the system throughput in uplink with cooperative relaying in IEEE 802.16j networks. Then, we transform the proposed scheme into multi-dimensional multiple choice knapsack problem (MMKP) based scheme. We also propose uplink throughput maximization scheme and MMKP based scheme without cooperative relaying. We show that the system throughput of the proposed MMKP based scheme is higher than that of link quality based scheme, and cooperative relaying provides higher system throughput than the conventional case without cooperative relaying in uplink.