• Title/Summary/Keyword: 솔루션 알고리즘

Search Result 147, Processing Time 0.024 seconds

Anomaly Detection for IEC 61850 Substation Network (IEC 61850 변전소 네트워크에서의 이상 징후 탐지 연구)

  • Lim, Yong-Hun;Yoo, Hyunguk;Shon, Taeshik
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.23 no.5
    • /
    • pp.939-946
    • /
    • 2013
  • This paper proposes normal behavior profiling methods for anomaly detection in IEC 61850 based substation network. Signature based security solutions, currently used primarily, are inadequate for APT attack using zero-day vulnerabilities. Recently, some researches about anomaly detection in control network are ongoing. However, there are no published result for IEC 61850 substation network. Our proposed methods includes 3-phase preprocessing for MMS/GOOSE packets and normal behavior profiling using one-class SVM algorithm. These approaches are beneficial to detect APT attacks on IEC 61850 substation network.

Enhancing Security of Transaction Session in Financial Open API Environment Using Hybrid Session Protection Protocol Combined with NTRU (NTRU를 결합한 하이브리드 세션 보호 프로토콜을 이용한 금융 오픈 API 환경의 거래 세션 안전성 강화)

  • Sujin Kwon;Deoksang Kim;Yeongjae Park;Jieun Ryu;Ju-Sung Kang;Yongjin Yeom
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.33 no.1
    • /
    • pp.75-86
    • /
    • 2023
  • Public key cryptography algorithm such as RSA and ECC, which are commonly used in current financial transaction services, can no longer guarantee security when quantum computers are realized. Therefore it is necessary to convert existing legacy algorithms to Post-Quantum Cryptography, but it is expected that will take a considerable amount of time to replace them. Hence, it is necessary to study a hybrid method combining the two algorithms in order to prepare the forthcoming transition period. In this paper we propose a hybrid session key exchange protocol that generates a session key by combining the legacy algorithm ECDH and the Post-Quantum Cryptographic algorithm NTRU. We tried the methods that proposed by the IETF for TLS 1.3 based hybrid key exchange, and as a result, it is expected that the security can be enhanced by applying the protocol proposed in this paper to the existing financial transaction session protection solution.

Cache-Answerability of XML Queries in Regular Path Expressions on the Web (웹에서 정규경로 표현식을 포함한 XML 질의의 캐쉬를 이용한 처리)

  • 박정기;강현철
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04b
    • /
    • pp.58-60
    • /
    • 2004
  • 웹의 확산과 더불어 웹 페이지 검색의 성능 즉, 빠른 응답시간과 확장성(scalability)은 각 웹 사이트의 절대적 평가 기준이 되었다. 웹 옹용은 일반적으로 불특정 다수를 대상으로 하기 때문에 확장성 또한 주요 성능의 척도가 된다. 이와 같은 웹 사이트 성능을 담보하기 위한 대표적 요소기술이 웹 캐슁이다. 본 논문은 웹 상에서 XML 데이터베이스 기반의 웹 응용(XML database-backed web application)을 위한 응용서버의 XML 캐쉬를 이용하여 주어진 XML 질의를 변환, 처리하는 기법과 구현에 관한 것으로 XPath의 경로표현식 중 가장 중요한 세 가지 기능인 조건을 명시하는 필터 연산자, 부모-자식 관계를 나타내는 경로 연산자(/), 그리고 조상-후손 관계를 나타내는 경로 연산자(//)를 연구 범위로 하였다. [2]에서는 조상-후손 관계를 나타내는 경로 연산자(//)가 없는 경우에 경로표현식으로 주어진 XML 질의를 캐쉬를 이용하여 변환, 처리하는 알고리즘을 제시하였는데 본 논문에서는 [2]의 알고리즘을 확장하여 경로 연간자(//)가 지원되도록 하였다. 조상-후손 경로 연산자(//)로는 정규경로 표현식(regular path expression)을 나타낼 수 있는데 이는 스키마가 불확실한 반구조적 데이터인 XML 데이터에 대한 질의 표현에 유용하다. 제시된 알고리즘에서는 DTD를 이용하여 경로 정보를 얻어 처리함으로써 주어진 질의를 캐쉬와 하부 XML 소스에 대한 질의로 변환하였다. 이 알고리즘을 바탕으로 관계 DBMS를 이용하여 구현된 시스템으로 실제 웹 상에서 성능 실험을 수행하였다. 성능 실험 결과 정규 경로 표현식을 포함하는 XML 질의에 대해서도 웹에서 캐쉬를 이용한 처리가 효율적임을 확인하였다.키는데 목적이 있다.RED에 비해 향상된 성능을 보여주었다.웍스 네트워크상의 다양한 디바이스들간의 네트워크 다양화와 분산화 기능을 얻을 수 있었고, 기존의 고가의 해외 솔루션인 Echelon사의 LonMaker 소프트웨어를 사용하지 않고도 국내의 순수 솔루션인 리눅스 기반의 LonWare 3.0 다중 바인딩 기능을 통해 저 비용으로 홈 네트워크 구성 관리 서버 시스템 개발에 대한 비용을 줄일 수 있다. 기대된다.e 함량이 대체로 높게 나타났다. 점미가 수가용성분에서 goucose대비 용출함량이 고르게 나타나는 경향을 보였고 흑미는 알칼리가용분에서 glucose가 상당량(0.68%) 포함되고 있음을 보여주었고 arabinose(0.68%), xylose(0.05%)도 다른 종류에 비해서 다량 함유한 것으로 나타났다. 흑미는 총식이섬유 함량이 높고 pectic substances, hemicellulose, uronic acid 함량이 높아서 콜레스테롤 저하 등의 효과가 기대되며 고섬유식품으로서 조리 특성 연구가 필요한 것으로 사료된다.리하였다. 얻어진 소견(所見)은 다음과 같았다. 1. 모년령(母年齡), 임신회수(姙娠回數), 임신기간(姙娠其間), 출산시체중등(出産時體重等)의 제요인(諸要因)은 주산기사망(周産基死亡)에 대(對)하여 통계적(統計的)으로 유의(有意)한 영향을 미치고 있어 $25{\sim}29$세(歲)의 연령군에서, 2번째 임신과 2번째의 출산에서 그리고 만삭의 임신 기간에, 출산시체중(出産時體重) $3.50{\sim}3.99kg$사이의 아이에서 그 주산기사망률(周産基死亡率)이 각각 가장 낮았다. 2. 사산(死産)과 초생아사망(初生兒死亡)을 구분(區分)하여 고려해 볼때 사산(死産)은 모성(母性)의 임신력(

  • PDF

Traffic Offloading Algorithm Using Social Context in MEC Environment (MEC 환경에서의 Social Context를 이용한 트래픽 오프로딩 알고리즘)

  • Cheon, Hye-Rim;Lee, Seung-Que;Kim, Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.2
    • /
    • pp.514-522
    • /
    • 2017
  • Traffic offloading is a promising solution to solve the explosive growth of mobile traffic. One of offloading schemes, in LIPA/SIPTO(Local IP Access and Selected IP Traffic Offload) offloading, we can offload mobile traffic that can satisfy QoS requirement for application. In addition, it is necessary for traffic offloading using social context due to large traffic from SNS. Thus, we propose the LIPA/SIPTO offloading algorithm using social context. We define the application selection probability using social context, the application popularity. Then, we find the optimal offloading weighting factor to maximize the QoS(Quality of Service) of small cell users in term of effective data rate. Finally, we determine the offloading ratio by this application selection probability and optimal offloading weighting factor. By performance analysis, the effective data rate achievement ratio of the proposed algorithm is similar with the conventional one although the total offloading ratio of the proposed algorithm is about 46 percent of the conventional one.

Cross-layer Optimization for Multichannel Multiradio Multisession Wireless Networks with Network Coding (멀티채널 멀티라디오 멀티세션 무선 네트워크를 위한 네트워크 코딩 기반 계층간 최적화 기법)

  • Park, Museong;Yoon, Wonsik
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.5
    • /
    • pp.18-24
    • /
    • 2013
  • Network coding has been extensively studied to increase the network throughput by exploiting the broadcast and overhearing capabilities. In this paper, we formulate a network utility maximization problem to improve the network utility in multichannel, multiradio and multisession wireless multihop network with intrasession network coding. To find the solution of this problem, we propose a congestion control, distributed rate control, and heuristic resource allocation algorithm. We find the network utility and evaluate the performance in multichannel, multiradio and multisession environment by using MATLAB. Finally, the results show that the proposed schemes can achieve throughput improvement by performing the network utility optimization in wireless multihop network.

A Genetic Algorithm for Production Scheduling of Biopharmaceutical Contract Manufacturing Products (바이오의약품 위탁생산 일정계획 수립을 위한 유전자 알고리즘)

  • Ji-Hoon Kim;Jeong-Hyun Kim;Jae-Gon Kim
    • The Journal of Bigdata
    • /
    • v.9 no.1
    • /
    • pp.141-152
    • /
    • 2024
  • In the biopharmaceutical contract manufacturing organization (CMO) business, establishing a production schedule that satisfies the due date for various customer orders is crucial for competitiveness. In a CMO process, each order consists of multiple batches that can be allocated to multiple production lines in small batch units for parallel production. This study proposes a meta-heuristic algorithm to establish a scheduling plan that minimizes the total delivery delay of orders in a CMO process with identical parallel machine. Inspired by biological evolution, the proposed algorithm generates random data structures similar to chromosomes to solve specific problems and effectively explores various solutions through operations such as crossover and mutation. Based on real-world data provided by a domestic CMO company, computer experiments were conducted to verify that the proposed algorithm produces superior scheduling plans compared to expert algorithms used by the company and commercial optimization packages, within a reasonable computation time.

Virtual Network Mapping Algorithm for Minimizing Piecewise Linear Cost Function (Piecewise Linear 비용함수의 최소화를 위한 가상 네트워크 매핑 알고리즘)

  • Pyoung, Chan-kyu;Baek, Seung-jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.6
    • /
    • pp.672-677
    • /
    • 2016
  • Development of Internet has been successfully inspired with extensive deployment of the network technology and application. However, increases in Internet usage had caused a lot of traffic overload in these days. Thus, we need a continuous research and development on the network virtualization for effective resource allocation. In this paper, we propose a minimal cost virtual network mapping algorithm using Piecewise Linear Cost Function. We exploited an algorithm with Linear Programming and D-VINE for node mapping, and Shortest Path Algorithm based on linear programming solution is used for link mapping. In this way, we compared and analyzed the average cost for arrival rate of VN request with linear and tree structure. Simulation results show that the average cost of our algorithm shows better efficiency than ViNEyard.

An Efficiency Analysis on Mutation Operation with TSP solved in Genetic Algorithm

  • Yoon, Hoijin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.12
    • /
    • pp.55-61
    • /
    • 2020
  • Genetic Algorithm(GA) is applied to a problem that could not figure out its solution in a straightway. It is called as NP-hard problem. GA requires a high-performance system to be run on since the high-cost operations are needed such as crossover, selection, and mutation. Moreover, the scale of the problem domain is normally huge. That is why the straightway cannot be applied. To reduce the drawback of high-cost requirements, we try to answer if all the operations including mutation are necessary for all cases. In the experiment, we set up two cases of with/without mutation operations and gather the number of generations and the fitness of a solution. The subject in the experiment is Travelling Salesman Problem(TSP), which is one of the popular problems solved by GA. As a result, the cases with mutation operation are not faster and the solution is fitter than the case with mutation operation. From the result, the conclusion is that mutation operation does not always need for a better solution in a faster way.

Research on a Method for Efficient u-Healthcare Data Transmission in M2M Environment (M2M 기반 유헬스케어 데이터의 효율적인 전송 방안 연구)

  • Cho, Gyoun-Yon
    • Journal of Digital Convergence
    • /
    • v.12 no.4
    • /
    • pp.251-257
    • /
    • 2014
  • In u-Healthcare environment, large amounts of important vital information is processed through M2M(Machine to Machine). M2M is configured by wireless networks and has several problems for limited bandwidth and low reliability. Therefore, in this paper is proposed a method called uHLZW(u-Healthcare LZW) to improve channel efficiency to solve such problem. uHLZW algorithm has high compression ratio for vital data. The results showed that the average compression ratio of uHLZW got from 1.6 times to 4.0 times better than existing methods(Huffman and LZW compression).

Stitching Method of Videos Recorded by Multiple Handheld Cameras (다중 사용자 촬영 영상의 영상 스티칭)

  • Billah, Meer Sadeq;Ahn, Heejune
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.22 no.3
    • /
    • pp.27-38
    • /
    • 2017
  • This Paper Presents a Method for Stitching a Large Number of Images Recorded by a Large Number of Individual Users Through a Cellular Phone Camera at a Venue. In Contrast to 360 Camera Solutions that Use Existing Fixed Rigs, these Conditions must Address New Challenges Such as Time Synchronization, Repeated Transformation Matrix Calculations, and Camera Sensor Mismatch Correction. In this Paper, we Solve this Problem by Updating the Transformation Matrix Using Time Synchronization Method Using Audio, Sensor Mismatch Removal by Color Transfer Method, and Global Operation Stabilization Algorithm. Experimental Results Show that the Proposed Algorithm Shows better Performance in Terms of Computation Speed and Subjective Image Quality than that of Screen Stitching.