• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1081-1086
• /
• 2017

A program analysis of a large-scale open-source software repository has a significant meaning in that it allows us to examine the changes and improvements of the software in repositories, and this brings more reliable results based on a large amount of programs. In this paper, we introduce a new static analysis framework WALABOA, which enables a scalable static analysis of large-scale software repositories. In addition, we show new findings from applying WALABOA, together with a module comparing the analysis results from a static analysis and a dynamic analysis, in evaluation of the field-based analysis, one of JavaScript static analysis techniques used in WALA.

• The korean journal of orthodontics
• /
• v.41 no.4
• /
• pp.288-296
• /
• 2011

Objective: The purposes of this study were to evaluate the relationship between the dental and basal arch forms; to analyze their differences in the tapered, ovoid, and square arch forms in normal occlusion by using three-dimensional (3D) virtual models; and to test the hypothesis that the overjet and maxillomandibular basal arch width difference have a significantly positive correlation. Methods: Seventy-seven normal occlusion plaster casts were examined by 3D scanning. Facial axis (FA) and WALA points were digitized using the Rapidform 2006 software. The dimensions of the dental and basal arches and the overjet were measured. The samples were classified into 3 groups according to arch forms: tapered (n = 20), ovoid (n = 20), and square (n = 37). Analysis of variance (ANOVA) was used to compare the dental and basal arch dimensions. The Pearson correlation coefficients between the intercanine as well as the intermolar widths at the FA and WALA points were calculated. Results: With regard to the basal arch dimensions, the tapered arch form showed a larger mandibular intermolar depth than the ovoid. Strong correlations were noted between the basal and dental intermolar widths in both the upper and lower arches (r = 0.83 and 0.85, respectively). Moderate correlation was found between the upper and lower intercanine widths (r = 0.65 and 0.48, respectively). Conclusions: The 3 dental arch form groups differed only in some dimensions of the skeletal arch. Moderate correlations were found between the basal and dental intercanine widths. These findings suggest that the basal arch may not be a principle factor in determining the dental arch form.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.927-930
• /
• 2001

정보 시스템의 눈부신 발전과 인터넷의 급속한 보급으로 인하여 누구나 웹상에서 그들의 정보 요구를 충족할 수 있게 되었다. 그러나 웹상에서의 정보 교환의 폭발적 증가로 인한 시스템의 중요 정보 및 자원 유출이 심각한 문제로 대두 되고 있다. 그러므로 관리자가 시스템에서 보유하고 있는 자원의 유출을 방지하고 시스템의 사용 원칙에 위배되는 해킹 행위를 추적하기 위한 감사 기능이 제공되어야 한다. 이에 본 논문에서는 감사 추적의 중요한 정보가 되는 유닉스 시스템의 로그 파일을 자동적으로 분석하는 시스템(WALAS)을 설계하였다. WALAS 는 UNIX 시스템 내의 방대한 로그정보의 최적화를 통해 관리자가 해킹이나 사용자의 잘못된 시스템 사용 등을 효율적으로 감시하고 조사, 분석하는데 있어서의 자동화된 로그 파일 분석 시스템이다. WALAS는 관리 대상 호스트의 로그 정보로부터 보안 정보를 추출하여 침입을 판단하며 침입으로 판정되면, 이를 웹 기반의 관리자 인터페이스로 전달하게 된다. 또한 방대한 양의 로그 정보를 적절히 분류하고 분석하며, 실시간으로 호스트 로그 파일을 모니터링하여 침입 발견 시 관리자의 즉각적 대응이라는 이점을 제공한다.

• International Journal of Computer Science & Network Security
• /
• v.22 no.12
• /
• pp.197-204
• /
• 2022

Sorting is an important data structure in many applications in the real world. Several sorting algorithms are currently in use for searching and other operations. Sorting algorithms rearrange the elements of an array or list based on the elements' comparison operators. The comparison operator is used in the accurate data structure to establish the new order of elements. This report analyzes and compares the time complexity and running time theoretically and experimentally of insertion, merge, and heap sort algorithms. Java language is used by the NetBeans tool to implement the code of the algorithms. The results show that when dealing with sorted elements, insertion sort has a faster running time than merge and heap algorithms. When it comes to dealing with a large number of elements, it is better to use the merge sort. For the number of comparisons for each algorithm, the insertion sort has the highest number of comparisons.