• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.2
• /
• pp.173-180
• /
• 2010

The research of the preserving privacy of sensitive information has been popular recently. Many researches about the techniques of generalizing records under k-anonymity rules have been done. Considering that data anonymity requires a lot of time and resources, it would be important to decide whether a table is vulnerable to privacy attacks before being opened in terms of the improvement of data utilization as well as the privacy protection. It is also important to check to which attack the table is vulnerable and which of anonymity methods should be applied in the table. This paper describe two possible privacy attacks based upon related references. Also, we suggest the technique to check whether data table is vulnerable to any attack of them and describe what kind of anonymity methods should be done in the table. The technique we suggest in this paper can also be applied for checking the safety of anonymity tables in which insert or delete operations occurred as well from privacy attacks.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.569-578
• /
• 2003

Data dependencies are one of major hurdles to limit ILP(Instruction Level Parallelism), so several related works have suggested that the limit imposed by data dependencies can be overcome to some extent with use of the data value prediction. Hybrid value predictor can obtain the high prediction accuracy using advantages of various predictors, but it has a defect that same instruction has overlapping entries in all predictor. In this paper, we propose a new hybrid value predictor which achieves high performance by using the information of static and dynamic classification. The proposed predictor can enhance the prediction accuracy and efficiently decrease the prediction table size of predictor, because it allocates each instruction into single best-suited predictor during the fetch stage by using the information of static classification. Also, it can enhance the prediction accuracy because it selects a best- suited prediction method for the “Unknown”pattern instructions by using the dynamic classification mechanism. Simulation results based on the SimpleScalar/PISA tool set and the SPECint95 benchmarks show the average correct prediction rate of 85.1% by using the static classification mechanism. Also, we achieve the average correction prediction rate of 87.6% by using static and dynamic classification mechanism.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.1
• /
• pp.107-115
• /
• 2002

We propose a new hybrid value predictor which achieves high performance by combining several predictors. Because the proposed hybrid value predictor can update the prediction table speculatively, it efficiently reduces the number of mispredicted instructions due to stale data. Also, the proposed predictor can enhance the prediction accuracy and efficiently decrease the hardware cost of predictor, because it allocates instructions into the best-suited predictor during instruction fetch stage by using the information of static classification which is obtained from the profile-based compiler implementation. For the 16-issue superscalar processors, simulation results based on the SimpleScalar/PISA tool set show that we achieve the average prediction rates of 73% by using speculative update and the average prediction rates of 88% by adding static classification for the SPECint95 benchmark programs.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.1233-1236
• /
• 2009

현재 다량의 네트워크 대역폭을 소모하는 응용 프로그램 트래픽을 확인하고 분류하는데 많은 방법들이 사용되고 있지만 정통적인 트래픽 분류 방법론인, 포트 번호, ip 등 등의 헤더 정보만으로는 응용 프로그램의 트랙픽을 정확하게 분류하지 못한다. 최근 동적인 포트 번호를 사용하는 새로운 트래픽 응용의 등장과 방화벽을 통과하기 위한 포트번호 변경으로 인하여 전통적인 TCP/UDP 헤더 기반의 트랙픽 분류 방법은 부정확해지고 있다. 이러한 트래픽을 정확하게 식별하고 분류하기 위해서는 패킷의 페이로드 내용에 대한 조사도 병행되어야 하고 시그니처 기반의 식별 방법을 사용하여야 한다. 하지만 이 방법은 정확도가 높은 반면 시그니처의 목록을 매번 최신 상태로 유지하여야 하는 단점과 길어지는 탐색 시간에 따른 시스템 부하의 문제를 가지고 있다. 본 연구에서는 이러한 단점을 향상시키는 목적으로 새로운 시그니처 기반의 해쉬 테이블에 캐시를 이용한 방법론인 효율적인 알고리즘을 제안하고 시그니처의 자료구조와 실제 패킷과 시그니처의 비교 방식을 수정함으로써 효율성을 높이는데 목적을 두고 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.865-867
• /
• 2001

데이터 종속성을 제거하기 위해서 명령어의 결과값을 예상하는 여러 결과값 예측기의 장점을 이용하여 놓은 성능을 얻을 수 있는 새로운 혼합형 예측 메커니즘을 제안한다. 제안된 혼합형 결과값 예측기는 예상 테이블을 모험적으로 갱신할 수 있기 때문에 부적절한(Stale) 데이터로 인해 잘못 예상되는 명령어의 수를 효과적으로 감소시킨다. 또한 정적 분류 정보를 사용하여 명령의 반입시 적절한 예측기에 할당함으로써 예상 정확도를 더욱 향상시키며, 하드웨어 비용을 효율적으로 감소시키도록 하였다. 5개의 SPECint 95 벤치마크 프로그램에 대해 SimpleScalar/PISA 3.0 툴셋을 사용하여 실험하였다. 16-이슈 폭에서 모험적 갱신을 사용한 평균 예상 정확도는 73%의 실험 결과가 나왔으며, 정적 분류 정보를 사용하였을 경우 예상 정확도가 88%로 증가된 결과를 얻었다.

• The Journal of Society for e-Business Studies
• /
• v.9 no.4
• /
• pp.117-136
• /
• 2004

As the time-to-market gets more important for competitiveness of an enterprise in manufacturing industry, it becomes important to shorten the development cycle of a product. Reuse of existing design models and e-Catalog for components are required for faster product development. To achieve this goal, an electric catalog must provide parametric CAD models since parametric information is indispensable for configuration design. There are difficulties in building up a parametric library of all the necessary combination using a CAD system, since we have too many combinations of components for a product. For example, there are at least 80 million combinations of components on one page of paper catalog of a mold base. To solve this problem, we propose the method of table parametric for the automatic generation of parametric CAD models. Any combination of mold base can be generated by mapping between a classification system of an electric catalog and the design parameters set of the table parametric. We propose how to select parametric models and to construct the design parameters set.

• Journal of the Korean Society for information Management
• /
• v.19 no.1
• /
• pp.135-161
• /
• 2002

This study presents a multilingual integrated ontological approach that enables linking classification systems. thesauri. and terminology databases in science and technology for more effective indexing and information retrieval online. In this integrated system, we designed a thesaurus model with concept as a unit and designated essential data elements for a terminology database on the basis of ISO 12620 standard. The classification system for science and technology adopted in this study provides subject access channels from other existing classification systems through its mapping table. A prototype system was implemented with the field of nuclear energy as an application area.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06c
• /
• pp.45-47
• /
• 2012

지식기반 사회가 도래하여 기술혁신이 가속화되고, 글로벌 경쟁이 심화됨에 따라 과학기술 R&D 수행에 선행기술 분석의 중요성이 증대하고 있다. 논문과 특허는 이 작업에 있어서 특허 단독으로는 학술 문헌으로 얻어진 기술 정보가 시장 관점에서 어떻게 활용될 수 있는가를 검증하는데 이용될 수 있다는 점에서 의미가 있지만 분류체계 및 데이터 특성이 다른 논문과 특허를 연계하는 연구는 또 다른 이슈와 가치를 지니며, 아직까지 국내 연구가 부족한 상황이다. 따라서 본 연구에서는 상호 주제 해석이 불가능한 논문과 특허의 분류체계를 일원화할 수 있는 매핑 테이블을 생성해서 두 유형의 문서가 상호 연계가 가능한 환경을 만들고자 한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.6
• /
• pp.657-668
• /
• 2002

Software life cycle consists of requirement analysis, design, implementation, and maintenance phases, and the product of each phase has various format. The UML normalizes such products, and the class diagram, use case diagram, activity diagram and collaboration diagram are usually used for the requirement analysis phase. Because most of UML development tools store such diagrams in a file, there nay be some difficulties of information retrieval and co-work among users. To cope with the difficulties, this paper proposes a database supported methodology to store and manage the diagrams produced by the requirement analysis. In this methodology, the constituents of class, use case, activity and collaboration diagram are first analyzed and then transformed in the form of relational fables. The constituents of such diagrams are stored as tables in a database, and can be easily retrieved from the database by using some queries. This database supported methodology provides the concurrent sharing and high reuse of diagrams.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1124-1131
• /
• 2002

The banyan network is a popular and basic structure of the multi-stage ATM switches. This paper presents a novel approach to resolve the internal blocking of the banyan network by using a Non-Blocking Permutation Generator (NBPG). The NBPG performs two functions, i.e., the first is to extract the conflict cells from the incoming cells and Ole second is to re-assign new input port addresses to the conflict cells. As a result, NBPG generates non-blocking I/O permutations. To estimate the performance of the NBPG, we provide the results of several simulations.