• TTA Journal
• /
• s.161
• /
• pp.89-94
• /
• 2015

• Korean Management Science Review
• /
• v.29 no.3
• /
• pp.1-11
• /
• 2012

This paper considers a localization problem in time difference of arrival (TDOA)-based radio frequency identification (RFID) systems. To estimate the position of a target tag, this paper suggests three localization algorithms that use benchmark tags. The benchmark tags are the same type as the target tag, but either the locations or distance of the benchmark tags are known. Two algorithms use the benchmarks for auxiliary information to improve the estimation accuracy of the other localization algorithms such as least squared estimator (LSE). The other one utilizes the benchmarks as essential tags to estimate the location. Numerical tests show that the localization accuracy can be improved by using benchmark tags especially when an algorithm using the LSE is applied to the localization problem. Furthermore, this paper shows that our benchmark algorithm is valuable when the measurement noise is large.

• Journal of the Korean earth science society
• /
• v.24 no.2
• /
• pp.93-99
• /
• 2003

The purpose of this study was to develop a new test instrument based on AAAS Benchmarks for Science Literacy, to assess k-12 students' progress in understanding nature of science (NOS). A total of 276 items were developed including 33 items for grade k-2, 36 items for grade 3-5, 78 items for grade 6-8 and 129 items for grade 9-12 and they were reviewed for validity and reliability. Key ideas that were the foundation of test items were extended, sophisticated and enriched according to the grade level. The general score of this test represents a student's cognitive state about an understanding of NOS. The result of this test can be expected to give some useful information for follow-up investigations, improving instructional design, and conducting further studies.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.5 no.2
• /
• pp.41-48
• /
• 1987

This paper is concerned with selection evaluation technique among three major performance evaluation techniques which are suitable for new computer system selection. It will discuss benchmarks, synthetic programs and simulation among various techniques for selection evaluation. It will show a formal technique using integer programming models for selecting a suitable job mix. It will suggest a simple method for comparing performance evaluation results. It will also provide benchmarks and synthetic program operation rules and expected outputs in appendix.

• Journal of Information Processing Systems
• /
• v.8 no.2
• /
• pp.331-346
• /
• 2012

Task-based programming is becoming the state-of-the-art method of choice for extracting the desired performance from multi-core chips. It expresses a program in terms of lightweight logical tasks rather than heavyweight threads. Intel Threading Building Blocks (TBB) is a task-based parallel programming paradigm for multi-core processors. The performance gain of this paradigm depends to a great extent on the efficiency of its parallel constructs. The parallel overheads incurred by parallel constructs determine the ability for creating large-scale parallel programs, especially in the case of fine-grain parallelism. This paper presents a study of TBB parallelization overheads. For this purpose, a TBB micro-benchmarks suite called TBBench has been developed. We use TBBench to evaluate the parallelization overheads of TBB on different multi-core machines and different compilers. We report in detail in this paper on the relative overheads and analyze the running results.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.07a
• /
• pp.267-270
• /
• 2019

Through this research, the rating data of shops were analyzed. The model was designed for discrete multiple classification as to the corresponding data, and the following experiments were initiated to observe the learned machine. By comparing each benchmarks in the experiments, which contains different setting variables for the machine model, the hit ratio was measured which indicates how much it is matched with the expected label. By analyzing those results from each benchmarks, the model was redesigned one time during the research and the effects of each setting variables on this machine were clarified. Furthermore, the research result left the future works, which are related with how the learning could be improved and what should be designed in the further research.

• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.180-186
• /
• 2021

In cloud computing service it is important to share the system resource among multiple instances according to user requirements. In particular, the issue of efficiently distributing I/O resources across multiple instances is paid attention due to the rise of emerging data-centric technologies such as big data and deep learning. However, it is difficult to evaluate the I/O resource distribution of a Linux container, which is one of the core technologies of cloud computing, since conventional I/O benchmarks does not support features related to container management. In this paper, we propose a new I/O performance benchmarking framework that can easily evaluate the resource distribution of Linux containers using existing I/O benchmarks by supporting container-related features and integrated user interface. According to the performance evaluation result with trace-replay benchmark, the proposed benchmark framework has induced negligible performance overhead while providing convenience in evaluating the I/O performance of multiple Linux containers.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.2
• /
• pp.31-39
• /
• 2020

In this paper, we introduce a technique for generating synthetic benchmarks based on time series data. Many of the data measured on IoT devices have a time series characteristic that measures numerical changes over time. However, there is a problem that it is difficult to model the data measured over a long period as generalized time series data. To solve this problem, this paper introduces the BST-IGT model. The BST-IGT model separates the entire data into sections that can be easily time-series modeled, collects the generated data into templates, and produces new synthetic benchmarks that share or modify characteristics based on them. As a result of making a new benchmark using the proposed modeling method, we could create a benchmark with multiple aspects by mixing the composite benchmark with the statistical features of the existing data and other benchmarks.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.803-804
• /
• 2006

This paper presents a multiple branch predictor with perceptrons. We describe our design and evaluate it with the SPEC 2000 benchmarks. Our predictor achieves increased accuracy than the previous multiple branch predictors.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.6
• /
• pp.628-641
• /
• 2014

Stepwise efficiency improvement in data envelopment analysis (DEA)-based benchmarking is a realistic and effective method by which inefficient decision making units (DMUs) can choose benchmarks in a stepwise manner and, thereby, effect gradual performance improvement. Most of the previous research relevant to stepwise efficiency improvement has focused primarily on how to stratify DMUs into multiple layers and how to select immediate benchmark targets in leading levels for lagging-level DMUs. It can be said that the sequence of benchmark targets was constructed in a myopic way, which can limit its effectiveness. To address this issue, this paper proposes an optimization approach to the construction of a sequence of benchmarks in DEA-based benchmarking, wherein two optimization criteria are employed : similarity of input-output use patterns, and proximity of input-output use levels between DMUs. To illustrate the proposed method, we applied it to the benchmarking of 23 national universities in South Korea.