• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.73-77
• /
• 2016

This paper deals with the network reliability problem that decides the communication line between main two districts while the k districts were destroyed in military communication network that the n communication lines are connected in m districts. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with O(n) linear time complexity to solve the optimal solution for this problem. This paper suggests the flow path algorithm (FPA) and level path algorithm (LPA). The FPA is to search the maximum number of distinct paths between two districts. The LPA is to construct the levels and delete the unnecessary nodes and edges. The proposed algorithm can be get the same optimal solution as LP for experimental data.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.5
• /
• pp.845-856
• /
• 2009

A block of an orthomodular lattice L is a maximal Boolean subalgebra of L. A site is a subalgebra of an orthomodular lattice L of the form S = A $\cap$ B, where A and B are distinct blocks of L. An orthomodular lattice L is called with finite sites if |A $\cap$ B| < $\infty$ for all distinct blocks A, B of L. We prove that there exists a weakly path-connected orthomodular lattice with finite sites which is not path-connected and if L is an orthomodular lattice such that the height of the join-semilattice [ComL]$\vee$ generated by the commutators of L is finite, then L is pathconnected.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.1
• /
• pp.95-99
• /
• 2008

It is known that each eigenvalue of a real symmetric, irreducible, tridiagonal matrix has multiplicity 1. The graph of such a matrix is a path. In this paper, we extend the result by classifying those trees for which each of the associated acyclic matrices has distinct eigenvalues whenever the diagonal entries are distinct.

• The Journal of Korea Robotics Society
• /
• v.4 no.3
• /
• pp.233-242
• /
• 2009

This paper briefly reviews the path planning methods that are applicable to the autonomous mobile robots for the military. Two distinct path search algorithms, $A^*$ and $D^*$ that are most popular and flexible in public applications, among those reviewed are coded and analyzed in terms of combat environment assessment factors called METT+TC for the area of operations. The results imply that it is important to consider the characteristics of defense acquisition process and the specific requirements of defense operation so that the successful technology development of the Robot products is directly linked to the defense procurement of Robot products.

• Journal of Institute of Convergence Technology
• /
• v.1 no.1
• /
• pp.29-33
• /
• 2011

This study is performed to investigate the effect of the artificial light for room lightening. To do that, the experiments were done using the black room with 1m3 and performed to show the effect of the length between the room and light source and light intensities as LUX. The LUX of 18 sites in the room was measured using LUX meter. The length between the room and the light source was chosen as 500mm, 1000mm, and 1500mm and the light intensities was 3 levels. The results were shown the distinct difference between the part directly projected through the light path and non-directly projected. So, the light delivery path have to be modified for next step research. The results were very sensitive for the part directly projected through the light path. This study showed the basic results for room lightening using light source to simulate the solar lightening and was worth in a strict sense as fundamental study.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 2003.09a
• /
• pp.20-27
• /
• 2003

The nonparametric method was employed to obtain detailed broadband attenuation characteristics of horizontal Fourier spectra without generally assigned constraint that derived path terms be zeros at a reference distance. Instead, path terms fer a reference distance were obtained based on the physical phenomenon that the seismic phase is stable over the hypocentral distance range from 200km to 400km so that the Q-values evaluated at several distances inside that region should be the same. The inverted path terms show three distinct linear regions roughly divided by hypocentral distances at 65km and 115km. Also complex behavior at the near distance range below 100km was revealed which can not be properly fitted by combination of single $Q_{0}$ $f^{η}$ model and any geometrical spreading models.s.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.19 no.3
• /
• pp.264-269
• /
• 2013

This paper is to investigate propagation path characteristics of GPS potential jamming signal. To do this, the spherical ground diffraction model is applied to the potential jamming scenario referred to the GPS jamming events occurred in recent years. The fundamental theory on the propagation path loss is discussed and a specific model is applied to several vehicles types which have own heights of antennas in order to compare their propagation path loss values at same 2-D location. The transmitting powers are appropriately given as the ordinary GPS jamming events. And then the received powers in dBW are obtained with given transmitting powers and the estimated total loss. The result of received jamming power at various locations due to the given scenario was distinct. For example, propagation loss values were estimated as -147 ~ -142dBW and -167 ~ -162dBW in $10^6W$ and $10^4W$, respectively. This computation result of the loss can be seriously considered with the tolerable jammer power against L1- C/A GPS receiver under any real jamming situations.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.323-326
• /
• 2007

When traveling on real road network, it generally takes less travel time in a near straight path than a zig-zaged path with same source and destination. In order to making a left(right/u) turn, the delay should be required to decrease the speed. The traffic signal waiting time of left(right/u) turn is probably longer than straight driving. In this paper, we revise the previous hierarchical path finding algorithm to reduce the number of turns. The algorithm proposed in this paper complied with a hierarchical $A^*$ algorithm, but has a distinct strategy for edge weight. We define an edge that makes a turn as a turn-edge and give the turn-edge lower weight to maintain the straightness of the whole path.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.1
• /
• pp.40-51
• /
• 2009

A paired many-to-many k-disjoint path cover (paired k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. In this paper, we investigate disjoint path covers in recursive circulants G($cd^m$,d) with $d{\geq}3$ and tori, and show that provided the number of faulty elements (vertices and/or edges) is f or less, every nonbipartite recursive circulant and torus of degree $\delta$ has a paired k-DPC for any f and $k{\geq}1$ with $f+2k{\leq}{\delta}-1$.

• Convergence Security Journal
• /
• v.21 no.1
• /
• pp.93-100
• /
• 2021

Damage caused by intelligent cyber attacks not only disrupts system operations and leaks information, but also entails massive economic damage. Recently, cyber attacks have a distinct goal and use advanced attack tools and techniques to accurately infiltrate the target. In order to minimize the damage caused by such an intelligent cyber attack, it is necessary to block the cyber attack at the beginning or during the attack to prevent it from invading the target's core system. Recently, technologies for predicting cyber attack paths and analyzing risk level of cyber attack using big data or artificial intelligence technologies are being studied. In this paper, a cyber attack path analysis method using attack tree and RFI is proposed as a basic algorithm for the development of an automated cyber attack path prediction system. The attack path is visualized using the attack tree, and the priority of the path that can move to the next step is determined using the RFI technique in each attack step. Based on the proposed mechanism, it can contribute to the development of an automated cyber attack path prediction system using big data and deep learning technology.