• 한국컴퓨터정보학회논문지
• /
• 제21권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.

• 대한수학회보
• /
• 제46권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.

• 대한수학회보
• /
• 제45권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.

• 로봇학회논문지
• /
• 제4권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.

• 융복합기술연구소 논문집
• /
• 제1권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.

• 한국지진공학회:학술대회논문집
• /
• 한국지진공학회 2003년도 추계 학술발표회논문집
• /
• 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.

• 해양환경안전학회지
• /
• 제19권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.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2007년도 춘계종합학술대회
• /
• pp.323-326
• /
• 2007

실제 도로에서 목적지까지 이동할 때, 일반적으로 직선 경로가 방향전환이 잦은 경로보다 이동시간이 적게 걸린다. 왜냐하면, 방향을 바꾸기 위해서는 속도를 줄여야 하기 때문이다. 또한, 교차로에서 좌회전(우회전, U턴)을 하려면 직진의 경우보다 신호 대기 시간이 길 가능성이 높다. 이 논문에서는 방향전환을 줄이기 위해서 기존의 경로 탐색 알고리즘을 개선한 알고리즘을 제안한다. 제안하는 알고리즘은 기본적으로 기존의 계층적 $A^*$ 알고리즘을 따르지만, 간선에 대한 가중치 부여 방법이 다르다. 즉, 방향이 바뀌는 간선에 대해서 가중치를 낮게 주어 전체 경로의 직진성을 유지한다.

• 한국정보과학회논문지:시스템및이론
• /
• 제36권1호
• /
• pp.40-51
• /
• 2009

그래프 G의 쌍형 다대다 k-서로소인 경로 커버(쌍형 k-DPC)는 k개의 서로 다른 소스-싱크 쌍을 연결하며 그래프에 있는 모든 정점을 지나는 k개의 서로소인 경로 집합이다. 이 논문에서는 재귀원형군 G($cd^m$,d), $d{\geq}3$과 토러스에서 서로소인 경로 커버를 고려하여, 이분 그래프가 아니고 분지수가 $\delta$인 재귀원형군과 토러스는 고장 요소(정점이나 에지)가 f개 이하일 때 $f+2k{\leq}{\delta}-1$을 만족하는 임의의 f, $k{\geq}1$에 대하여 쌍형 k-DPC를 가짐을 보인다.

• 융합보안논문지
• /
• 제21권1호
• /
• pp.93-100
• /
• 2021

지능형 사이버 공격으로 인한 피해는 시스템 운영 중단과 정보 유출뿐만 아니라 엄청난 규모의 경제적 손실을 동반한다. 최근 사이버 공격은 공격 목표가 뚜렷하며, 고도화된 공격 도구와 기법을 활용하여 정확하게 공격 대상으로 침투한다. 이러한 지능적인 사이버 공격으로 인한 피해를 최소화하기 위해서는 사이버 공격이 공격 대상의 핵심 시스템까지 침입하지 못하도록 공격 초기 또는 과정에서 차단해야 한다. 최근에는 빅데이터나 인공지능 기술을 활용하여 사이버 공격 경로를 예측하고 위험 수준을 분석하는 보안 기술들이 연구되고 있다. 본 논문에서는 자동화 사이버 공격 경로 예측 시스템 개발을 위한 기초 메커니즘으로 공격 트리와 RFI 기법을 활용한 사이버 공격 경로 분석 방법을 제안한다. 공격 트리를 활용하여 공격 경로를 가시화하고 각 공격 단계에서 RFI 기법을 이용하여 다음 단계로 이동할 수 있는 경로를 판단한다. 향후에 제안한 방법을 기반으로 빅데이터와 딥러닝 기술을 활용한 자동화된 사이버 공격 경로 예측 시스템의 메커니즘으로 활용할 수 있다.