• 제목/요약/키워드: 신성비례

Search Result 23, Processing Time 0.018 seconds

Cyber attack group classification based on MITRE ATT&CK model (MITRE ATT&CK 모델을 이용한 사이버 공격 그룹 분류)

  • Choi, Chang-hee;Shin, Chan-ho;Shin, Sung-uk
    • Journal of Internet Computing and Services
    • /
    • v.23 no.6
    • /
    • pp.1-13
    • /
    • 2022
  • As the information and communication environment develops, the environment of military facilities is also development remarkably. In proportion to this, cyber threats are also increasing, and in particular, APT attacks, which are difficult to prevent with existing signature-based cyber defense systems, are frequently targeting military and national infrastructure. It is important to identify attack groups for appropriate response, but it is very difficult to identify them due to the nature of cyber attacks conducted in secret using methods such as anti-forensics. In the past, after an attack was detected, a security expert had to perform high-level analysis for a long time based on the large amount of evidence collected to get a clue about the attack group. To solve this problem, in this paper, we proposed an automation technique that can classify an attack group within a short time after detection. In case of APT attacks, compared to general cyber attacks, the number of attacks is small, there is not much known data, and it is designed to bypass signature-based cyber defense techniques. As an attack model, we used MITRE ATT&CK® which modeled many parts of cyber attacks. We design an impact score considering the versatility of the attack techniques and proposed a group similarity score based on this. Experimental results show that the proposed method classified the attack group with a 72.62% probability based on Top-5 accuracy.

Revenue Change by Peak Hour Fare Imposition for Senior Free Ride : Using Seoul Metropolitan Subway Smart Card Data (노인무임승차 첨두시 요금부과에 따른 수입금 변화 : 수도권 스마트카드자료를 이용하여)

  • Seongil Shin;Jinhak Lee;Hasik Lee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.22 no.2
    • /
    • pp.1-14
    • /
    • 2023
  • This study derives quantitative data on how much the fiscal deficit of subway operation agencies can be reduced in the process of charging free rides for the elderly in metropolitan subways during peak periods. In smart card data, every trip of elderly is recorded except fares. Therefore, it is required to establish a methodology for estimating the fares of elderly passengers and distributing them to subway opertation agencies as income. This study builds a simultaneous dynamic traffic allocation model that reflects the assumption that elderly selects a minimum time route based on the departure time. The travel route of the elderly is estimated, and the distance-proportional fare charged to the elderly is calculated based on this, and the fare is distributed by reflecting the connected railway revenue allocation principle of the metropolitan subway operating agencies. As a result of conducting a case study for before and after COVID-19 in 2019 and 2020, it is analyzed that Seoul Metro's annual free loss of 360 billion won could be reduced 6~8% at the morning peak (07:00-08:59), and 13~16% at the morning and afternoon peak (18:00-19:59).

Development of User Customized Path Finding Algorithm for Public Transportation Information (대중교통 정보제공을 위한 맞춤형 경로탐색 알고리즘 개발)

  • Shin, Sung Il;Park, Je Jin;Lee, Jong Chul;Ha, Tae Jun
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.28 no.3D
    • /
    • pp.317-323
    • /
    • 2008
  • Mass transit information can contribute many benefits to users. Especially, transportation information technology is developing highly with information technology in Korea recently. Hereafter, it is expected to give customized transportation information to users individually with the advent of ubiquitous age in earnest. This public transportation information service can be realized by path finding algorithm in public transportation networks including travel and transfer attributes. In this research, constraints are constructed with the primary facts influencing users. Moreover, the method reducing user's path finding condition arbitrarily is proposed by making the maximum value as variables. In this study, transfer frequency, total travel time, seat confirmation, transfer time and travel time become constraint condition based on k path finding algorithm considering service time constraint condition. Moreover, case study about user customized transfer information is performed in Seoul and metropolitan subway networks.