• International Journal of Highway Engineering
• /
• v.14 no.2
• /
• pp.157-164
• /
• 2012

Road signs serve guide informations for efficient traffic control and are regulated by Road Sign Regulation. But few road managers break the regulation because of civil complaint and cause driver's confusion. Also, as promote the road name guide signs and the new road signs on expressway, the driver's confusion being increased. This study analysis factors of driver's confusion, calculates limited information on road signs and specifies modes of driver's confusion caused by road signs. The traffic accident data during 3 years is calculated in order to see how much intimate connection between the road sign confusion and the traffic.

• Analytical Science and Technology
• /
• v.8 no.3
• /
• pp.237-248
• /
• 1995

The simultaneous analysis of 16 organic pesticides, which are listed as a part of 129 priority pollutants by EPA(Environmental Protection Agency), was performed by GC-ECD(electron capture detector) and GC/MS-SIM(selected ion monitoring). Two extraction procedures from SW-846, sonication extraction and Soxhlet extraction, were somewhat modified and compared as an extraction and concentration method for the analysis of priority pollutants in soil. Accuracy and precision of the methods were reported from the calculation of mean recovery, mean relative standard deviation, and method detection limit.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.199-204
• /
• 2017

In this study, we present a home appliance load identification algorithm. The algorithm utilizes complex sensory data in order to improve the existing NIALM using total power usage information. We define the influence graph between the appliance status and the measured sensor data. The device identification prediction result is calculated as the weighted sum of the predicted value of the sensor data processing algorithm and the predicted value based on the total power usage. We evaluate proposed algorithm to compare appliance identification accuracy with the existing NIALM algorithm.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.2
• /
• pp.76-82
• /
• 2017

Malware, including ransomware to quickly detect, in this study, to provide an analysis method of malicious code through the image analysis that has been learned in the deep learning of artificial intelligence. First, to analyze the 2,400 malware data, and learning in artificial neural network Convolutional neural network and to image data. Extracts subgraphs to convert the graph of abstracted image, summarizes the set represent malware. The experimentally analyzed the malware is not how similar. Using deep learning of artificial intelligence by classifying malware and It shows the possibility of accurate malware detection.

• Journal of the Korean Chemical Society
• /
• v.37 no.6
• /
• pp.590-598
• /
• 1993

The simultaneous analysis of samples, 16 organic pesticides in water among 129 priority pollutants listed by EPA, was performed by GC-ECD (electron capture detector) and GC/MS-SIM (selected ion monitoring). Two extraction procedures, liquid-liquid extraction (LLE) and solid-phase extraction (SPE), were studied as an extraction and concentration method. Accuracy and precision of the methods were measured by the calculation of mean recovery and mean relative standard deviation. Finally, the detection limits, the experimental limitations, and prospects were discussed.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.2
• /
• pp.185-195
• /
• 1999

1990년대에 들어 컴퓨터 시스템의 급진적 발전으로 인한 소형 컴퓨터의 성능 향상과 가격 하락으로 보급량이 증가하고, LAN/WAN 및 인터넷 통신 기술 발달에 힘입어 여러 분야에서 많은 응용들이 클라이언트/서버 환경에서 개발되고 있다. 클라이언트/서버 환경을 도입하는 이유는 개방형 시스템으로서의 표준화와 자원 공유, 확장성, 가용성, 응용의 생산성 등의 장점 때문이다. 클라이언트/서버 환경에서 운용되는 대부분의 프로그램은 다계층 구조에서 표현계층(사용자 인터페이스) , 응용 로직, 그리고 데이카로 나뉘어질 수 있다. 클라이언트/서버 환경에서 최적의 성능을 얻기 위해서는 어느 자원을 어디로 분산하여야 하는가 하는 것이 문제가 된다. 만약 개발자가 코딩 단계에서 각 노드의 시스템의 부하 정보를 얻을 수 있다면, 클라이언트/서버 환경에서 부하가 적절히 분산된 최적의 프로그램임을 쉽게 개발할수 있다. 본 연구에서는 자바 소스 코드의 분석을 통하여 시스템 부하를 측정할수 있는 시뮬레이터를 개발하였다. 시뮬레이터는 시스템 환경 변수와 자바 소스 코드를 받아들여 모의실험한 후, 응답시간을 라인 그래프 및 막대그래프의 형태로 표현한다. 마지막으로, 시뮬레이터의 정확성을 검증하기 위하여 임의의 프로그램을 선택하여 설제 실행 시간과 본 시뮬레이터에서 측정된 응답시간을 비교, 분석하였다.

• Journal of the Speleological Society of Korea
• /
• no.88
• /
• pp.38-44
• /
• 2008

This study aims to identify the efficiency by applying diverse index to the positions of vertex in the network among the network analysis methods in order to identify the relational location features of caves. The first consideration was about the relational location features according to the linking degree and centrality of cave. The second consideration was about the structural equivalence between caves or between caves and the surrounding tourists attractions. A variety of index examined in this study is very efficient for identifying the positions of caves in the network. Furthermore, the relational location features in consideration of surrounding tourists attractions identified the availability of more objective and quantitative expression. In particular, when there are other caves around a cave, it is also very useful to identify the structural equivalence or comparison with other caves.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2022.05a
• /
• pp.169-169
• /
• 2022

최근 기후변화와 도시화로 인해 집중호우, 홍수 등 극한 강우의 빈도와 규모가 증가하고 있는 추세이다. 또한, 극한 강우의 빈도가 증가함으로 가능최대강수량(Probable Maximum Precipitation, PMP)에 관한 관심도 증가하고 있다. 가능최대강수량의 경우 대규모 수공 구조물, 댐의 설계나 가능최대홍수량(Probable Maximum Flood, PMF) 산정에 사용 되며, 세계 기상 기구(World Meteorological Organiztion, WMO)는 가능최대강수량 산정 방법으로 수문기상학적 방법, 통계학적 방법, 포락 곡선 방법을 제안하고 있으며, 통계학적 가능최대강수량 산정방법으로는 Hershfield가 제안한 방법을 제시하고 있다. Hershfield가 제안한 방법의 경우 빈도계수를 사용하며, Hershfield(1961)는 빈도계수의 값을 15로 제안하였으나, 1965년에 빈도계수는 강우 지속시간과 평균에 따라 5~20 값을 갖는 노모그래프를 제안하였다. 본 연구에서는 빈도계수 산정 방법, 노모그래프를 이용한 빈도계수의 값 2가지를 산정한 후 국내 가능최대강수량 보고서와 비교하여 통계학적 가능최대강수량 산정 방법을 결정한 후, 결정된 빈도계수 산정 방법을 SSP시나리오에 이용하여 미래의 통계학적 가능최대강수량을 산정하여 가능최대강수량의 변화를 분석하고자 한다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.721-726
• /
• 2012

In this paper, we proposed an efficient algorithm based on SPFA(shortest path faster algorithm), which is an improved the Bellman-Ford algorithm. The Bellman-Ford algorithm can be used on graphs with negative edge weights unlike Dijkstra's algorithm. And SPFA algorithm used a queue to store the nodes, to avoid redundancy, though the Bellman-Ford algorithm takes a long time to update the nodes table. In this improved algorithm, an adjacency list is also used to store each vertex of the graph, applying dynamic optimal approach. And a queue is used to store the data. The improved algorithm can find the optimal path by continuous relaxation operation to the new node. Simulations to compare the efficiencies for Dijkstra's algorithm, SPFA algorithm and improved Bellman-Ford were taken. The result shows that Dijkstra's algorithm, SPFA algorithm have almost same efficiency on the random graphs, the improved algorithm, although the improved algorithm is not desirable, on grid maps the proposed algorithm is very efficient. The proposed algorithm has reduced two-third times processing time than SPFA algorithm.

• The KIPS Transactions:PartB
• /
• v.16B no.5
• /
• pp.359-366
• /
• 2009

Analysis of 3-dimensional (3D) protein structure plays an important role of structural bioinformatics. The protein structure alignment is the main subjects of the structural bioinformatics and the most fundamental problem. Protein Structures are flexible and undergo structural changes as part of their function, and most existing protein structure comparison methods treat them as rigid bodies, which may lead to incorrect alignment. We present a new method that carries out the flexible structure alignment by means of finding SSPs(Similar Substructure Pairs) and flexible points of the protein. In order to find SSPs, we encode the coordinates of atoms in the backbone of protein into RDA(Relative Direction Angle) using local similarity of protein structure. We connect the SSPs with Floyd-Warshall algorithm and make compatible SSPs. We compare the two compatible SSPs and find optimal flexible point in the protein. On our well defined performance experiment, 68 benchmark data set is used and our method is better than three widely used methods (DALI, CE, FATCAT) in terms of alignment accuracy.