• Journal of KIISE
• /
• v.42 no.8
• /
• pp.961-971
• /
• 2015

As a representative area-decomposed algorithm, an area-based quad-trie (AQT) has an issue of search performance. The search procedure must continue to follow the path to its end, due to the possibility of the higher priority-matching rule, even though a matching rule is encountered in a node. A leaf-pushing AQT improves the search performance of the AQT by making a single rule node exist in each search path. This paper proposes a new algorithm to further improve the search performance of the leaf-pushing AQT. The proposed algorithm implements a leaf-pushing AQT using a hash table and an on-chip Bloom filter. In the proposed algorithm, by sequentially querying the Bloom filter, the level of the rule node in the leaf-pushing AQT is identified first. After this procedure, the rule database, which is usually stored in an off-chip memory, is accessed. Simulation results show that packet classification can be performed through a single hash table access using a reasonable sized Bloom filter. The proposed algorithm is compared with existing algorithms in terms of the memory requirement and the search performance.

• Annual Conference on Human and Language Technology
• /
• 2018.10a
• /
• pp.69-74
• /
• 2018

최근 빅 데이터와 인공지능의 발달과 함께 감성 분석에 대한 연구가 활발해지고 있다. 더불어 감성 분석을 위한 긍/부정 어휘가 풍부한 텍스트 문서들에 대한 수집의 필요성도 높아지고 있다. 본 논문은 긍/부정어휘가 풍부한 텍스트 문서들을 수집하는 기존의 수집 방법에 대한 문제점에 대하여 해결방안을 제시한다. 기존의 수집 방법으로 일단 모든 URL들을 저장하고 필터링 과정을 거쳐 긍/부정 어휘가 풍부한 텍스트 문서들을 수집하고자 한다면 불필요한 텍스트 문서 저장과 필터링 과정에서 메모리와 시간을 낭비하게 된다. 기존의 수집 방법에 블룸 필터라는 자료구조를 적용시켜 메모리와 시간을 낭비하게 되는 문제점을 해결하고자 한다.

• Journal of Korean Library and Information Science Society
• /
• v.41 no.2
• /
• pp.107-126
• /
• 2010

Education is an intentional and planned change process for achieving the objective. Thus, an educational objects sets is very important in elementary and secondary instructional practice. Bloom created the original taxonomy of the cognitive, affective, psychomotor domain for categorizing level of abstraction of questions that commonly occur in educational settings in 1956. During the 1990, Anderson & Krathwohl, Marzano led a new educational taxonomy which met for the purpose of updating the Bloom's taxonomy, hoping to add relevance for 21st century teaching and learning. The educational taxonomy with information literacy process is relationship. The purpose of this study is restructure of information literacy process based on educational object taxonomy.

• Journal of Science Education
• /
• v.34 no.1
• /
• pp.164-174
• /
• 2010

The purpose of this study was to find out taxonomic characteristics of objectives infered from questions of summative evaluation by analyzing those objectives with Bloom's revised taxonomy of educational objectives. 1,711 questions of midterm and final examinations collected from 25 middle schools were analyzed to classify objective of each question. The major findings of the study were as follows: first, from the analysis of objectives in the knowledge dimension, the assessment of factual knowledge was most prevailing(67.6%) in the biology summative evaluation. In the cognitive process dimension, memory assessment was most dominant(76.1%). Thus, the main objectives of evaluation leaned toward particular classes in the Bloom's revised taxonomy, which was different from the findings of earlier studies on the weights of evaluation areas. Second, the level of the objectives should be determined in consideration of the grade of middle schoolers, as their cognitive level improves with grade. In fact, however, there was no difference among three grades in characteristics of objective taxonomy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3B
• /
• pp.152-158
• /
• 2008

Recently, DDoS (Distributed Denial of Service) attack has emerged as one of the major threats and it's main characteristic is to send flood of data packets toward a specific victim. Thus, several attack detection schemes which monitor the destination IP address of packets have been suggested. The existing Bloom Filter based attack detection scheme is simple and can support real-time monitoring. However, since this scheme monitors the separate fields of destination IP address independently, wrong detection is comparatively high. In this paper, in order to solve this drawback, an efficient Bloom Filter based destination address monitoring scheme is proposed, which monitors not only separate fields but also relationship among separate fields. In the results of simulation, the proposed monitoring scheme outperforms the existing Bloom Filter based detection scheme. Also, to improve the correctness of detection, multi-layerd structure is proposed and the correctness of result is improved according to the number of layers and extra tables.

• Journal of Digital Convergence
• /
• v.18 no.7
• /
• pp.73-84
• /
• 2020

The whole world is making a variety of efforts to cope with the revolutionary changes in the economy and society that are emerging from intelligent information technology. Therefore, this study defined national public officials' intelligence information competency in the intelligent information society, and tried to derive competency clusters and sub-elements. To achieve this objective, this study explores literature research about bloom's digital taxonomy, information competency, and national ICT policies and national public officials' intelligence information competency was defined based on bloom's digital taxonomy perspective was modified and supplemented with this study and provisional constituent elements of competency were derived. In addition, 5 experts verified the content validity. As a result, 7 competency clusters and 22 sub-elements are finally derived. The findings of this study are expected to be useful as the basis for the national intelligence information human resource development.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.2
• /
• pp.371-381
• /
• 2011

Recently, there are some social issues that personal sensitive data in database were let out. The best method to protect these personal sensitive data is used by the database encryption method. But the encrypting database makes the query difficult. So, there are a lot of study to protect the database and increase the query efficiency as well. In this paper, we analysed recent research trend to protect the sensitive data and propose the combined method using buckets and the bloom filter for the medical database with range property. Compared to bucket index model, the proposed method can increase bucket index value and protect data distribution exposure. We can estimate that this proposed method can improve searching time and efficiency.

• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.165-170
• /
• 2010

This paper proposes an in-network join strategy SBJ(Semi & Bloom Join), an efficient join strategy for sensor networks, that minimizes communication cost. SBJ is a hybrid join strategy that can reduce energy consumption by using a bloom filter to reduce the size of data that needs to be sent or received in sensor network. The key to reducing the communication cost in SBJ is to eliminate data not involved in the join result in the early stages of join processing. Through simulation, the paper shows that compared to other join strategies in sensor network, SBJ join strategy is more efficient in reducing the communication cost resulting in a significant reduction in battery consumption.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.14 no.5
• /
• pp.60-70
• /
• 2018

A software defined storage (SDS) is being deployed in cloud environment to allow multiple users to virtualize physical servers, but a solution for optimizing space efficiency with limited physical resources is needed. In the conventional data deduplication system, it is difficult to deduplicate redundant data uploaded to distributed storages. In this paper, we propose a distributed deduplication method using similarity-based clustering and multi-layer bloom filter. Rabin hash is applied to determine the degree of similarity between virtual machine servers and cluster similar virtual machines. Therefore, it improves the performance compared to deduplication efficiency for individual storage nodes. In addition, a multi-layer bloom filter incorporated into the deduplication process to shorten processing time by reducing the number of the false positives. Experimental results show that the proposed method improves the deduplication ratio by 9% compared to deduplication method using IP address based clusters without any difference in processing time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.848-854
• /
• 2015

There are a lot of encryption methods to secure database proposed recently. Those encryption methods can protect the sensitive data of users effectively, but it deteriorates the search performance of database query. In this paper, we proposed the selective element encryption method in order to complement those drawbacks. In addition, we compared the performance of the proposed method with that of tuple level encryption method using the various queries. As a result, we found that the proposed method, which use the selective element encryption with bloom filter as a index, has better performance than the other encryption method.