• Journal of the Korea Institute of Military Science and Technology
• /
• v.21 no.6
• /
• pp.807-816
• /
• 2018

Threat hunting is defined as a process of proactively and iteratively searching through networks to detect and isolate advanced threats that evade existing security solutions. The main concept of threat hunting is to find out weak points and remedy them before actual cyber threat has occurred. And HMM(Hunting Maturity Matrix) is suggested to evolve hunting processes with five levels, therefore, CSOC(Cyber Security Operations Center) can refer HMM how to make them safer from complicated and organized cyber attacks. We are developing a system for cyber situation awareness system with pro-active threat hunting process called unMazeTM. With this unMaze, it can be upgraded CSOC's HMM level from initial level to basic level. CSOC with unMaze do threat hunting process not only detecting existing cyber equipment post-actively, but also proactively detecting cyber threat by fusing and analyzing cyber asset data and threat intelligence.

• 한국정보통신설비학회:학술대회논문집
• /
• 2004.08a
• /
• pp.109-112
• /
• 2004

오늘날 급속한 컴퓨팅 환경의 변화에 따라 방송, 통신, 기계 등 디지털 컨버전스 패러다임으로 데스크탑 컴퓨터에 제한적이던 정보 서비스가 언제, 어느곳에서든 가능한 유비쿼터스 시대가 도래하고 있다. 가정에서도 또한, 유비쿼터스 홈 환경이 조성 되면서 댁내 보안, 건강 모니터링 및 진료, 오락, 교육, 전자상거래 등 다양한 서비스가 이루어질 것이다. 이러한 환경에 적절한 멀티미디어 컨텐츠의 안전하고 체계적인 관리 및 보호가 필요할 것이다. 본 논문에서는 이러한 유비쿼터스 환경에서의 멀티미디어서비스를 사용자의 상황인지 정보를 통해 지능화된 미디어 서비스 및 멀티미디어 컨텐츠의 체계적이고 안전한 관리 및 보호를 위한 시스템을 제안한다.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.3D
• /
• pp.355-361
• /
• 2011

In order to properly evaluate ITS services exposed in SMART Highway project, a confident dynamic origin-destination (OD) is inevitably needed. This paper used WAVE communication information as a part of call and response (C&R) communication which constitutes core part of the technology for constructing OD. This information includes node information and vehicle information (e.g., latitude and longitude) as well as trajectory data and sample path volume date calculated using node information and vehicle information. A procedure developed to construct a dynamic OD and to validate OD is consist of 1) making toy network and one-hour 00 (random distribution), 2) collecting link information and vehicle information, 3) constructing five-minute OD, and 4) validating estimated OD result using traffic volume and travel time simultaneously. The constructed OD is about 84.79% correct within less than 20% error range for 15min traffic volume, and about 85.42%, within less than 20% error rate of 15 min travel time. Some limitations and future research agenda have also been discussed.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.24 no.1
• /
• pp.107-114
• /
• 2021

By analyzing the voice communication performance of the existing tactical FM radios, the performance target of the newly developing TICN combat network radio system VHF band tactical voice communication waveform was derived. In addition, a vocoder and modulation method that can satisfy the performance target and additional requirements are presented, and the expected voice communication quality is analyzed.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1987.04a
• /
• pp.184-187
• /
• 1987

The method of Conjugate Gradient(C.G.M) is applied to the solution of current distribution from body of revolution (B.O.R).Using the C.G.M it is possible to analyze electrically large arbtrarily oriented B.O.R. The fundamental differences between C.G.M and moment method are outlined. This method converges for any initial guess and this techniqe gurantees a monotonic convergence. Numerical results are presented for electromagnetic case which show good agreement with moment solution.

• Electronics and Telecommunications Trends
• /
• v.16 no.5 s.71
• /
• pp.189-195
• /
• 2001

본 고에서는 국제 표준화 기관인 ITU-R에서 진행되고 있는 IMT-2000 시스템의 기술 규격, 국제이동 및 불요방사 등의 측면을 다루고 있는 WP 8F의 표준화 활동에 대하여 주요 표준화 현황을 설명한다.

• Electronics and Telecommunications Trends
• /
• v.31 no.5
• /
• pp.80-89
• /
• 2016

현재 이동통신 분야에서는 5세대(5th Generation: 5G) 이동통신 표준화 작업이 한창 진행 중이며, 그 표준화 현황을 살펴보기 위하여 대표적인 국제 표준화 단체인 ITU-R에서의 활동 및 3GPP에서의 활동을 살펴보고자 한다. 최근 ITU-R WP 5D에서는 IMT-2020으로 명명되는 5세대 이동통신 비전 문서를 토대로 기술 요구사항 및 평가 기준 마련을 위한 작업이 수행되고 있으며, 3GPP의 TSG SA, RAN 및 하위 WG에서는 관련 상위 레벨 요구사항 정립 및 무선 구간에서의 기술적인 SI 논의가 수행되고 있다. 본고에서는 위 두 표준화 활동을 위주로 5G 이동통신에 대한 현황을 기술한다.

• 한국정보통신설비학회:학술대회논문집
• /
• 2003.08a
• /
• pp.215-217
• /
• 2003

본 논문에서는 음악이나 동영상과 같은 디지털 미디어 컨텐츠의 유통과 보안을 위하여 개인 사용자의 접속 권한을 부여하고 제한을 가할 수 있는 OpenIPMP에 대하여 살펴본다. 그리고 본 논문은 디지털 미디어 컨텐츠의 저작권보호와 복제 방제를 위해 워터마킹 기술을 OpenIPMP에 연동시켰다. 아울러 디지털 미디어 권한에 대하여 표현하고 처리하고자 하는 목적으로 MPEG-21 REL을 역시 OpenIPMP에 연동시켰다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.5
• /
• pp.1-12
• /
• 2008

In this paper, we described about core technologies required for the seamless service implementation and the communication system structure conceiving required for call & response services in order that the real-time traffic information service is consecutively provided to the vehicle moving at high speed. The SMART highway service is the information communication environment build-up concept which the real-time C&R service is comprised of the vehicle moving with 160km/h above. It was possible in case of being the low speed car in the DSRC system structure. However, there is a limit in the high speed environment as the DSRC system like a convention. In this paper, we proposed the structure of fitting for the SMART highway environment using the hand-over technique compositing the base station and several repeaters of DSRC system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.149-154
• /
• 2015

In this paper proposes a stable marriage algorithm. The proposed algorithm firstly constructs an $n{\times}n$ matrix of men's and women's sum preference over opposite sex $p_{ij}$. It then repeatedly deletes row or column corresponding to the then maximum dispreference sum $_{max}p_{ij}$ until ${\forall}(|r_i|=1{\cap}|c_j|=1)$. If $|r_i|=1$ or $|c_j|=1$ then we select the $p_{ij}$ of $|r_i|=1$ or $|c_j|=1$ then the row or column values are deleted repeatedly until ${\forall}(|r_i|=1{\cap}|c_j|=1)$. When tested on 7 stable marriage problems, the proposed algorithm has proved to improve on the existing solutions.