• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.689-696
• /
• 2003

Criticality prediction models that determine whether a design entity is fault-prone or non fault-prone are used for identifying trouble spots of software system in analysis or design phases. Many criticality prediction models for identifying fault-prone modules using complexity metrics have been suggested. But most of them need training data set. Unfortunately very few organizations have their own training data. To solve this problem, this paper builds a new prediction model, KSM, based on Kohonen SOM neural networks. KSM is implemented and compared with a well-known prediction model, BackPropagation neural network Model (BPM), considering internal characteristics, utilization cost and accuracy of prediction. As a result, this paper shows that KSM has comparative performance with BPM.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.373-375
• /
• 2002

하이퍼 텍스트 구조의 특성을 이용한 순위 평가 알고리즘 중의 하나인 HITS 알고리즘은 웹 페이지들의 상호간에 연결된 링크 정보로부터 웹 문서들의 중요도를 평가하여 순위에 따른 결과를 제시한다. 그러나 초기의 HITS 알고리즘은 문서 내의 링크 빈도 수만을 고려하고, 입력 값으로 주어지는 웹 문서 집합의 특성에 의존적인 단점을 가지고 있다. 본 논문에서는 여러 웹 검색 엔진들로부터 얻어진 문서 집합에 수정된 HITS 알고리즘을 수행하는 메타 검색 에이전트를 설계하여 보다 나은 검색 성능을 구하고, 결과의 지역성을 보완한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06b
• /
• pp.493-496
• /
• 2010

본 논문은 평면 위의 점 집합에서 지배되지 않는 점 집합을 찾아내는 병렬 알고리즘을 제안한다. 우리는 먼저 기존의 지배되지 않는 점을 계산하는 문제가 SIMD형 병렬계산 장치인 GPU에서 병렬화가 가능하다는 사실을 보이고, 실제 GPU를 이용한 병렬 알고리즘을 설계 구현하였다. 또한 실험 결과 직렬 알고리즘에 비해 2배 이상의 성능 향상을 얻을 수 있었다.

• The Journal of Society for e-Business Studies
• /
• v.8 no.2
• /
• pp.23-31
• /
• 2003

Link-based search engines generate the rank using linked information of related web-documents . HITS(Hypertext Internet Topic Search), representative ranking evaluation algorithm using a special feature of web-documents based on such link, evaluates the importance degree of related pages from linked information and presents by ranking information. Problem of such HITS algorithm only is considered the link frequency within documents and depends on the set of web documents as input value. In this paper, we design the search agent based on better HITS algorithm according to advanced suitability between query and search-result in the set of given documents from link-based web search engine. It then complements locality of advanced search performance and result.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.668-676
• /
• 2012

In this paper, on the assumption that MPI collective communication function is converted into a group of point-to-point communication functions in the transaction level, an algorithm that optimizes broadcast, scatter and gather function among MPI collective communication is proposed. The MPI hardware engine that operates the proposed algorithm was designed, and it was named the OCC-MPE (Optimized Collective Communication Message Passing Engine). The OCC-MPE operates point-to-point communication by using the standard send mode. The transmission order is arranged according to the algorithm that proposes the most frequently used broadcast, scatter and gather functions among the collective communications, so the whole communication time is reduced. To measure the performance of the proposed algorithm, the OCC-MPE with the Bus Functional Model (BFM) based on SystemC was designed. After evaluating the performance through the BFM based on SystemC, the proposed OCC-MPE is designed by using VerilogHDL. As a result of synthesizing with the TSMC $0.18{\mu}m$, the gate count of each OCC-MPE is approximately 1978.95 with four processing nodes. That occupies approximately 4.15% in the whole system, which means it takes up a relatively small amount. Improved performance is expected with relatively small amounts of area increase if the OCC-MPE operated by the proposed algorithm is added to the MPSoC (Multi-Processor System on a Chip).

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.373-384
• /
• 2000

There are many researches about metrics to measure a quality of Object-Oriented(OO) software. However, most of them have only discussed a concept or properties of metrics, and have not shown the detailed procedure for measuring them. They also define a measurement indicator as a threshold, but it has been influenced on a project size or application domains. In this paper, we propose metrics based on characteristics of OO design such as size, complexity, coupling and cohesion, and use a propotion to an average as the measurement indicator. It is easy to classify classes which have a result above the average, and to predict classes which reduced the quality of OO design. They will be modified to hold the average. Proposed metrics are analytically evaluated by Weyuker's nine properties. They are satisfied with seven properties except two properties co not apply to OO metrics. Also, we design a quality assessment system, ASSOD(ASsessment System of Object oriented Design), to measure the quality of the OO design independent of the platform.

• KIISE Transactions on Computing Practices
• /
• v.21 no.3
• /
• pp.269-274
• /
• 2015

As smart device companies such as Google or Apple develop competitive mobile-based automotive operating systems and navigation systems, the range of choice for users in such markets is expanding. Navigation systems equipped with mobile operating systems have increased convenience for users. However, since an API for the POI databases used in navigation systems doesn't exist, the number of applications using POI data is insufficient. In this paper, we designed and implemented system calls for navigation operating systems with a focus on POI search, in order to resolve such limitations. The system calls support set-based POI search functions, and therefore provides solutions to search performance degradation problems caused by false inputs. As a result of performance evaluation, not only did the search performance improve, but there was also no problem in applying APIs in applications.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.626-628
• /
• 1998

XML은 사용자가 각 응용에 따라 필요한 태그 집합과 문서 구조를 정의할 수 있는 효과적인 기반을 제공 하지만, 서로 다르게 정의되는 태그는 그 이름만으로는 정확한 의미를 식별하기가 어렵다. 본 논문에서는 데이터 레지스트리에 기반 하여 DTD를 작성함으로써 XML 태그에 문맥적인 의미를 부여하는 방법을 제시하였으며, 이를 지원하는 DTD 작성도구를 설계하였다. XML의 기능에 데이터 레지스트리가 제공하는 표준화된 의미를 추가시킴으로써 DTD에 독립적인 문서 교환이 가능하며, 태그의 의미를 이용한 문서의 검색을 효과적으로 수행할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.277-279
• /
• 1999

본 논문은 FDDI에 기반한 경성 실시간 통신에서 비동기 대역폭을 이용한 오류제어 기법을 제안하고 성능을 평가한다. 제안된 기법은 FDDi 프레임에 포함된 오류 탐지 기능을 기반으로 하고 있으며 오류 제어 과정에 여분의 대역폭을 이용하기 때문에 다른 실시간 메시지 전송에 간섭을 일으키지 않고 전송 오류에 의한 메시지 손실을 감소시켜 종료시한 만족도를 개선한다. 모의 실험 결과는 주어진 메시지 집합에 대해 실시간 메시지의 종료시간 만족도를 최대 29% 개선함과 아울러 비동기 트래픽의 부하에 대해서도 종료시한 만족도가 안정적임을 보인다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.4
• /
• pp.733-744
• /
• 2012

Dynamic threshold public-key encryption provides dynamic setting of the group of all users, receivers and the threshold value. Over recent years, there are many studies on the construction of scheme, called ID-based dynamic threshold encryption, which combines the ID-based encryption with dynamic threshold encryption. In this paper, we analyze the ID-based dynamic threshold encryption proposed by Xing and Xu in 2011, and show that their scheme has a structural problem. We propose a conversion method from ID-based encryption which uses the bilinear map to ID-based dynamic threshold encryption. Additionally, we prove this converted scheme has CPA security under the full model.