• The Korean Journal of Applied Statistics
• /
• v.35 no.3
• /
• pp.335-346
• /
• 2022

Profile control chart aims to detect a change in the functional relationship of multivariate characteristics in the statistical process control. In monitoring two variables, a linear profile is of interest composed of the intercept and slope of one variable (response variable) against the other (explanatory variable). The previous studies on monitoring of the linear profile mostly assume that the explanatory variables are the same for all profiles. However, there are also cases where they vary depending on profiles. This paper intends to extend the monitoring method to where explanatory variables are different for each profile. We compare the new method's performance through simulation and apply it to monitoring a network intrusion using NSL-KDD data.

• Journal of the Korean Society for information Management
• /
• v.24 no.3
• /
• pp.245-269
• /
• 2007

The standard metadata systems are very popular for the description of structures and semantics of information resources to realize sharing and exchanging information in global ubiquitous environment. In real application domain, various metadata elements are reused together with mix-and-match manner. An application system using diverse metadata systems is compelled with refinement and interoperability of metadata elements. Application profile is the general approach to resolve the various problems occurred in metadata application systems. This paper proposes Application Profile Core Ontology (APO) that can achieve the goals and functions of application profile, and describes metadata application system based on APO.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.30 no.4
• /
• pp.29-50
• /
• 2019

This study was to suggest the considerations for application profiles of 2019 revised RDA using literature reviews and case studies according to new RDA that revised in order to reflect the LRM and linked data. First, the additional elements were recommended as the contents of application profiles such as inverse element, broader element, narrow element, domain, range, alternate label name, mapping to MARC, mapping to BIBFRAME, and RDA description examples as new elements as well as element name, element ID, element URL, description method, vocabulary encoding scheme, data provenance element, data provenance value, and notes as the elements that were already suggested by previous researches. Second, RDA rules' representations in forms of flow chart and application profiles through analyzing RDA rules were suggested in order to apply the rules to RDA application profiles to structure the rules in which every element has 4 types of description method, many conditions, and options. Third, the RDA mapping to BIBFRAME was suggested in RDA application profiles because RDA and BIBFRAME are co-related in context of content standard and encoding format, and mapping BIBFRAME and RDA is necessitated for programming BIBFRAME editors with RDA as content standard. This study will contribute to find the methods for constructing RDA application profiles and BIBFRAME application profiles with RDA as content standard.

• The Korean Journal of Applied Statistics
• /
• v.12 no.1
• /
• pp.97-107
• /
• 1999

프로파일 분석은 반복측정 자료를 분석하는데 있어서 널리 사용되는 다변량 분석모형이다. 프로파일 분석에서는 처리 그룹간의 비교와 반응 프로파일의 평행성 검정을 위해서 4가지 검정통계량이 널리 사용되고 있다. 이들 검정통계량은 Wilks의 통계량($\Lambda$), Pillai's Trace 통계량(V), Hotelling-Lawley Trace 통계량(U), Roy's Maximum Root 통계량($\Theta$ )이다. 그 동안 이들 통계량들을 비교하기 위한 여러 연구가 있었지만 주로 일반적인 다변량 분산분석 모형에 근거한 비교였다. 본 논문에서는 자료가 반복측정 자료이고 우리의 관심이 프로파일 분석에 있을 때에 이 4가지 통계량의 비교에 초점을 맞추었다.

• Broadcasting and Media Magazine
• /
• v.7 no.3
• /
• pp.12-18
• /
• 2002

JVT is an international video coding standard that is being developed jointly by VCEG of ITU and MPEG of ISO. The standardization efforts are targeted mainly for a very high compression ratio. JVT is a general video coding technology that may be used in various application fields. JVT began to work seriously on the profiles and levels issues since Geneva meeting, January 2002. Profiles are sub sets of technical tools from the entire tools and levels limit processing power and memory resources of a decoder As of now, three profiles of Baseline, Main and X (not defined name yet) and hierarchically structured levels are defined in JVT FCD. The profiling issue is very important for the JVT s initial objective of Baseline royalty free policy. Royalty free Baseline profiling is currently under practical hurdles and this issue may impact as one of critical factors on the success of JVT standard.

• Journal of Korean Library and Information Science Society
• /
• v.39 no.4
• /
• pp.353-376
• /
• 2008

The main purpose of this research is to develop a methodology for designing metadata application profiles(AP) and to design a comprehensive AP for Korea Art and Education Service(KACES), The process of developing a methodology is divided into three steps, analysis of standard metadata schema, analysis of user needs, and content analyses. Metadata principles and guidelines were utilized in designing a KACES AP along with the developed methodology in this study. This paper describes what role the methodology developed here plays in devising metadata elements. The paper also discusses the benefits of three methods for AP design. The study has values in that it provides implications for designing APs for other domains.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.3
• /
• pp.573-583
• /
• 2015

Amcache.hve file is a registry hive file regarding Program Compatibility Assistant, which stores the executed information of applications. With Amcache.hve file, We can know execution path, first executed time as well as deleted time. Since it checks both the first install time and deleted time, Amcache.hve file can be used to draw up the overall timeline of applications when used with the Prefetch files and Iconcache.db files. Amcache.hve file is also an important artifact to record the traces of anti-forensic programs, portable programs and external storage devices. This paper illustrates the features of Amcache.hve file and methods for utilization in digital forensics such as estimation of deleted time of applications.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.11b
• /
• pp.250-253
• /
• 2002

최근, 디지털 워터마킹에 대한 연구와 더불어 알고리즘의 안전성을 평가하는 평가기술에 대하여 그 중요도가 증가되고 있다. 본 논문은 기존에 개발되어진 벤치마킹 프로그램에 대하여 그 구조와 방법에 대하여 조사하고, 여러 응용 시스템에서 다른 목적으로 이용되는 워터마킹 기술들에 대한 안전성을 평가하는 평가 프로파일에 대하여 기술한다. 본 연구 결과로 작성된 프로파일은 워터마킹 알고리즘의 안전성 평가시, 유용한 자료로 사용될 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.89-91
• /
• 2012

플래시 저장장치는 순차 쓰기패턴에 높은 성능을 보이고, 랜덤 쓰기패턴에 낮은 성능을 보인다고 알려져 있다. 그러나 실제 응용 프로그램은 동작 방식에 따라 복합적인 패턴을 보일 수 있다. 본 논문은 대표적인 모바일 응용으로서 웹 브라우저 응용의 파일시스템 접근 특성을 정량적으로 분석하고자 한다. 최근에 안드로이드 스마트 폰에 채택된 Ext4 파일시스템을 기준으로 웹 브라우저 응용의 파일시스템 요청들을 성능개선점을 지적하고자 한다.

• Journal of KIISE:Software and Applications
• /
• v.32 no.3
• /
• pp.227-235
• /
• 2005

In the embedded system domain, both memory requirement and energy consumption are great concerns. To save memory and energy, the 32 bit ARM processor supports the 16 bit Thumb instruction set. For a given program, the Thumb code is typically smaller than the ARM code. However, the limitations of the Thumb instruction set can often lead to generation of poorer quality code. To generate codes with smaller size but a little slower execution speed, Krishnaswarmy suggests a profiling guided selection algorithm at module level for generating mixed ARM and Thumb codes for application programs. The resulting codes of the algorithm give significant code size reductions with a little loss in performance. When the instruction set is selected at module level, some functions, which should be compiled in Thumb mode to reduce code size, are compiled to ARM code. It means we have additional code size reduction chance. In this paper, we propose a profile guided selection algorithm at function level for generating mixed ARM and Thumb codes for application programs so that the resulting codes give additional code size reductions without loss in performance compared to the module level algorithm. We can reduce 2.7％ code size additionally with no performance penalty