• Journal of Information Processing Systems
• /
• 제7권3호
• /
• pp.397-412
• /
• 2011

Granular Computing has emerged as a unified and coherent framework of designing, processing, and interpretation of information granules. Information granules are formalized within various frameworks such as sets (interval mathematics), fuzzy sets, rough sets, shadowed sets, probabilities (probability density functions), to name several the most visible approaches. In spite of the apparent diversity of the existing formalisms, there are some underlying commonalities articulated in terms of the fundamentals, algorithmic developments and ensuing application domains. In this study, we introduce two pivotal concepts: a principle of justifiable granularity and a method of an optimal information allocation where information granularity is regarded as an important design asset. We show that these two concepts are relevant to various formal setups of information granularity and offer constructs supporting the design of information granules and their processing. A suite of applied studies is focused on knowledge management in which case we identify several key categories of schemes present there.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2000년도 가을 학술발표논문집 Vol.27 No.2 (1)
• /
• pp.483-485
• /
• 2000

소프트웨어 산업계는 컴포넌트 기반의 개발이 소프트웨어의 생산성과 품질을 향상 시킬 것으로 기대하고 있다. 최근에 많은 연구를 통해 한 시스템의 컴포넌트들은 각각 granularity를 가지는 것이 밝혀졌다. 그러나 지금까지 제시된 많은 방법론들이 컴포넌트 granularity를 정확하고 세부적으로 도출하지 못하고 있다. 본 연구에서는 컴포넌트의 granularity를 도출하는 수학적인 방법을 제시한다. 그리고 이론적인 연구를 통해 비즈니스 단위의 컴포넌트와 공통 컴포넌트가 분리된다는 것을 보인다. 사례 연구를 통해 우리는 우리가 제시한 granularity의 도출 방법이 유용함을 증명하고 컴포넌트를 분리시키는 경계선이 존재한다는 것을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권4호
• /
• pp.1110-1127
• /
• 2022

To improve the training efficiency and generalization performance of a support vector machine (SVM) in a large-scale set, an optimal SVM learning method based on adaptive sparse sampling and the granularity shift factor is presented. The proposed method combines sampling optimization with learner optimization. First, an adaptive sparse sampling method based on the potential function density clustering is designed to adaptively obtain sparse sampling samples, which can achieve a reduction in the training sample set and effectively approximate the spatial structure distribution of the original sample set. A granularity shift factor method is then constructed to optimize the SVM decision hyperplane, which fully considers the neighborhood information of each granularity region in the sparse sampling set. Experiments on an artificial dataset and three benchmark datasets show that the proposed method can achieve a relatively higher training efficiency, as well as ensure a good generalization performance of the learner. Finally, the effectiveness of the proposed method is verified.

• 정보처리학회논문지A
• /
• 제8A권2호
• /
• pp.117-124
• /
• 2001

At NOW (Networks Of Workstations), the load sharing is very important role for improving the performance. The known load sharing strategy is fixed-granularity, variable-granularity and adaptive-granularity. The variable-granularity algorithm is sensitive to the various parameters. But Send algorithm, which implements the fixed-granularity strategy, is robust to task granularity. And the performance difference between Send and variable-granularity algorithm is not substantial. But, in Send algorithm, the computing time and the communication time are not overlapped. Therefore, long latency time at the network has influence on the execution time of the parallel program. In this paper, we propose the preSend algorithm. In the preSend algorithm, the master node can send the data to the slave nodes in advance without the waiting for partial results from the slaves. As the master node sent the next data to the slaves in advance, the slave nodes can process the data without the idle time. As stated above, the preSend algorithm can overlap the computing time and the communication time. Therefore we reduce the influence of the long latency time at the network and the execution time of the parallel program on the NOW. To compare the execution time of two algorithms, we use the $320{\times}320$ matrix multiplication. The comparison results of execution times show that the preSend algorithm has the shorter execution time than the Send algorithm.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2001년도 The Pacific Aisan Confrence On Intelligent Systems 2001
• /
• pp.385-392
• /
• 2001

This paper proposes a meta modeling technique which permits to describe a KBS according to three axis: the object of reuse axis, the levels of granularity axis and the reuse process axis. The object of reuse axis allows to see a KBS as a set of inter-related components for reuse purposes. The levels of granularity axis allows to describe the KBS components according to different levels of granularity for clarity and reuse purposes. The reuse process axis allows to see the KBS components as (re)usable components.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.245-248
• /
• 2003

This parer proposes the six color separation using th color difference and granularity. Conventional method using the color difference increases the graininess in the bright region due to the usage of the cyan or magenta. To reduce the graininess in the bright region, we proposed the six color separation minimizing the graininess within the tolerance of the co]or difference. Initially, granularity is calculated based on the standard deviation of the lightness value and chrominance of the SCIELAB space and is applied to the six color separation using the color difference. Proposed six color separation using the color difference and granularity reduces the graininess in the bright region and obtains the smooth tone.

• 웰빙융합연구
• /
• 제6권3호
• /
• pp.1-11
• /
• 2023

Purpose: This research aims to facilitate a smooth transition from KCD-8 to ICD-11 through the study of ICD-11. Research design, data and methodology: Skilled Health Information Managers (HIMs) in Korea performed manual mapping and conducted a study of the code structure of ICD-11 chapters 11 and 12. Results: When comparing the granularity between ICD-11 and KCD-8, 58.1% of ICD-11 codes showed higher granularity, and 38.6% had similar granularity. The granularity of the circulatory system was higher than that of the respiratory system. When comparing the KCD-8 codes mapped by ICD-11 with the total 924 KCD-8 codes, it was found that about 50% of KCD-8 codes were not mapped to ICD-11. This means that 50% of diseases in the KCD-8 do not have individual codes as they did in ICD-11. Conclusions: ICD-11 demonstrated high granularity, indicating its effectiveness in describing cutting-edge medical technology in modern society. However, we also observed that some diseases were removed from KCD-8, while others were added to ICD-11. To ensure smooth statistics transition from KCD8 to ICD-11, especially for leading domestic diseases, integrated management, including the preparation of KCD-9 reflecting ICD-11 and ICD-11 training, will be necessary through the analysis of new codes and the removal of codes.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2007년도 정기학술대회
• /
• pp.29-41
• /
• 2007

Concepts of greater and greater complexity can be constructed by building systems of entities, by relating other entities to that system with a figure-ground relation, by embedding concepts of figure-ground in the concept of change, by embedding that in causality, and by coarsening the granularity and beginning the process over again. This process can be called the Ontological Ascent. It pervades natural language discourse, and suggests that to do lexical semantics properly, we must carefully axiomatize abstract theories of systems of entities, the figure-ground relation, change, causality, and granularity. In this paper, I outline what these theories should look like.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제2권8호
• /
• pp.343-348
• /
• 2013

본 논문에서는 멀티미디어 서비스를 위한 파워-효율적인 고정 우선순위의 실시간 스케쥴링 알고리즘으로 다중 세분화 자원 예약 기반의 정적 전압 조절 알고리즘 (STATIC-MULTIRSV)을 제안한다. 다중 세분화 자원 예약은 전통적인 데드라인 기반의 자원 예약 보다 높은 연산 자원 사용률과 더 나은 태스크간 독립성을 제공하는 모델로서 [2]에서 소개된바 있다. 다중 세분화 모델을 기반으로 제안된 STATIC-MULTIRSV 알고리즘은 비디오 스트림들의 I-프레임들을 각각의 데드라인을 모두 만족하는 것을 보장하면서 파워 소비를 줄이도록 고안되었다. 제안된 알고리즘은 실시간 리눅스[6] 상에서 구현을 통해 실험적으로 기존의 방법에 비해 파워 소모를 최대 15%까지 줄였음을 보였다.

• 한국정보처리학회논문지
• /
• 제6권4호
• /
• pp.851-867
• /
• 1999

Numerous proposals for extending the relational data model as well as conceptual and object-oriented data models have been suggested. However, there has been relatively less research in the area of defining segmented storage structure and data migration strategies for temporal data. This paper presents the segmented storage structure in order to increment search performance and the two data migration strategies for segmented storage structure. this paper presents the two data migration strategies : the migration strategy by Time granularity, the migration strategy by LST-GET. In the migration strategy by Time Granularity, the dividing time point to assign the entity versions to the past segment, the current segment, and future segment is defined and the searching and moving process for data validity at a granularity level are described. In the migration strategy by LST-GET, we describe the process how to compute the value of dividing criterion. searching and moving processes are described for migration on the future segment and the current segment and entity versions 새 assign on each segment are defined. We simulate the search performance of the segmented storage structure in order to compare it with conventional storage structure in relational database system. And extensive simulation studies are performed in order to compare the search performance of the migration strategies with the segmented storage structure.