• ETRI Journal
• /
• v.28 no.5
• /
• pp.631-637
• /
• 2006

In this paper we study the optimization issues of ring networks employing novel parallel multi-granularity hierarchical optical add-drop multiplexers (OADMs). In particular, we attempt to minimize the number of control elements for the off-line case. We present an integer linear programming formulation to obtain the lower bound in optimization, and propose an efficient heuristic algorithm called global bandwidth resource assignment that is suitable for the design of large-scale OADM networks.

• Journal of Information Processing Systems
• /
• v.10 no.2
• /
• pp.271-282
• /
• 2014

The advancement of knowledge society has enabled the social network community (SNC) to be perceived as another space for learning where individuals produce, share, and apply content in self-directed ways. The content generated within social networks provides information of value for the participants in real time. Thus, this study proposes the social network community activity-based content model (SoACo Model), which takes SNC-based activities and embodies them within learning objects. The SoACo Model consists of content objects, aggregation levels, and information models. Content objects are composed of relationship-building elements, including real-time, changeable activities such as making friends, and participation-activity elements such as "Liking" specific content. Aggregation levels apply one of three granularity levels considering the reusability of elements: activity assets, real-time, changeable learning objects, and content. The SoACo Model is meaningful because it transforms SNC-based activities into learning objects for learning and teaching activities and applies to learning management systems since they organize activities -- such as tweets from Twitter -- depending on the teacher's intention.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.1542-1545
• /
• 2011

형식개념분석기법(FCA : Formal Concept Analysis)은 주어진 데이터로부터 공통속성을 갖는 객체들을 클러스터링하여 정보의 최소단위로써 개념(Concept)들을 추출하고 그들 사이의 관계를 토대로 계층화하여 데이터에 내재된 개념들의 구조를 가시화 해주는 Granular Computing의 한 종류이다. 형식 개념분석기법에서는 공통속성을 갖는 객체들을 추출한다는 전제조건을 토대로 개념을 추출하기 때문에 다양한 상황이나 조건에 적합한 새로운 개념들을 추출하기에는 한계가 있다. 이와 같은 문제를 해결하기 위한 한 가지 방법으로써, 본 논문에서는 입자화 정도(granularity level)를 기반으로 하는 형식 개념분석기법을 제안한다. 본 논문에서 제안하는 기법에서는 형식개념분석기법에 입자화 정도를 도입하여 다양한 조건과 추상화 수준을 토대로 하여, 개념들을 추출하고 개념계층구조를 구축할 수 있다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.95-102
• /
• 2003

The buffering is a promising solution to resolve the contention problem in optical network. we study the packet loss probability and the dimensioning of optical buffer using a Fiber Delay Line for variable length packet. In this paper, we study the relation between the granularity and the loss of FDL buffer in Single-Stage FDL buffer and propose the Single-Bundle Multi-Stage FDL buffer. The Multi-Stage FDL buffer is too early yet to apply to the current backbone network, considering the current technology in view of costs. but we assume that the above restriction will be resolved in these days. The appropriate number of delay and pass line for a dimensioning is based on a amount of occupied time by packets. Once more another multi-stage FDL buffer is proposed, Split-Bundle multi-stage FDL buffer. The Split-Bundle ms-FDL buffer is more feasible for a FDL buffer structure, considering not only a size of switching matrix but also a bulk of switching element. its feasibility will be demonstrated from a loss probability.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.1-9
• /
• 2003

In this paper, we propose a new method dispersing spatially C(Cyan), M(Magenta), Y(Yellow) instead of K(black) in the bright region. The overlapping of black dots decreases brightness in the dark region, and black dots are very sensitive to human visual system in the bright region. Therefore, to avoid this problem, bright and dark gray region in the color image is considered in the proposed approach. A new method which uses CMY simultaneously in single mask is proposed, and CMY dots are used dispersing spatially for the bright region instead of black dot by this method. And tone curve connection is used to consider the gray level of dark region. In previous method, BNM (Blue Noise Mask) has high granularity and a narrow dynamic range. But the proposed method has the low granularity, wide dynamic range, and high contrast properties. Because the proposed method uses three times dots spatially in the different position than a conventional BNM, it can express more spatial information and a similar gray level compared with BNM.

• The KIPS Transactions:PartD
• /
• v.8D no.6
• /
• pp.813-822
• /
• 2001

In this paper we proposed four data migration methods based on time segmented storage structure including past segment, current segment, and future segment. The migration methods proposed in this paper are the Time Granularity migration method, the LST-GET (Least valid Start Time-Greatest valid End Time) migration method, the AST-AET (Average valid Start Time-Average valid End Time) migration method, and the Min-Overlap migration method. In the each data migration method we define the dividing criterion among segments and entity versions to store on each segment. We measured the response time of queries for the proposed migration methods. When there are no LLTs (Long Lived Tuples), the average response time of AST-AET migration method and LST-GET migration method are smaller than that of Time Granularity migration method. In case of existing LLT, the performance of the LST-GET migration method decreased. The AST-AET migration method resulted in better performance for queries than the Time Granularity migration method and the LST-GET migration method. The Min-Overlap migration method resulted in the almost equal performance for queries compared with the AST-AET migration method, in case of storage utilization more efficient than the AST-AET.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.4 s.304
• /
• pp.49-59
• /
• 2005

This paper proposed a six-color separation using additional colorants and quantitative granularity metric to reduce color difference and graininess. In the conventional method, light magenta and light cyan are used in the bright region instead of magenta and cyan. However, the hue value of liBht magenta and light cyan is different from the one of magenta and cyan in CIELAB space, so that this makes the colorimetric reproduction more or less inaccurate. To improve this inaccuracy, the proposed method uses yellow and light magenta colorants as the additional colorants. In the bright region, magenta is replaced with light magenta and yellow, while cyan is replaced with light cyan and light magenta. This selection reduces hue difference because it creates the color of similar hue to magenta and cyan. In addition, smooth image can be simultaneously obtained by the less dot visibility of additional colorants. In the middle region, magenta is replaced with light magenta and magenta, while cyan is replaced with light cyan and cyan. The use of two colorants having a different concentration makes the dot Pattern coarse. To reflect this Phenomenon, quantitative granularity metric is used. In the dark region, only magenta and cyan colorant is used as usual. Through experiments, it is shown that the proposed method improves both colorimetric and smooth tone reproductions.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06a
• /
• pp.244-245
• /
• 2007

• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.435-447
• /
• 2017

Associative and bidirectional associative memories are examples of associative structures studied intensively in the literature. The underlying idea is to realize associative mapping so that the recall processes (one-directional and bidirectional ones) are realized with minimal recall errors. Associative and fuzzy associative memories have been studied in numerous areas yielding efficient applications for image recall and enhancements and fuzzy controllers, which can be regarded as one-directional associative memories. In this study, we revisit and augment the concept of associative memories by offering some new design insights where the corresponding mappings are realized on the basis of a related collection of landmarks (prototypes) over which an associative mapping becomes spanned. In light of the bidirectional character of mappings, we have developed an augmentation of the existing fuzzy clustering (fuzzy c-means, FCM) in the form of a so-called collaborative fuzzy clustering. Here, an interaction in the formation of prototypes is optimized so that the bidirectional recall errors can be minimized. Furthermore, we generalized the mapping into its granular version in which numeric prototypes that are formed through the clustering process are made granular so that the quality of the recall can be quantified. We propose several scenarios in which the allocation of information granularity is aimed at the optimization of the characteristics of recalled results (information granules) that are quantified in terms of coverage and specificity. We also introduce various architectural augmentations of the associative structures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.7
• /
• pp.553-564
• /
• 1990

The co-efficient matrix of linear second-order partial differential equations in the general form is partitioned with (n-1)x(n-1) submartices and is transformed into the block tridiagonal system. Then the cyclic odd-even reduction technique is applied to this system with the large-grain data granularity and the block cyclic reduction algorithm to solve unknown vectors of this system is created. But this block cyclic reduction technique is not suitable for the parallel processing system because of its parallelism chanigng at every computing stages. So a new algorithm for solving linear second-order partical differential equations is presentes by the block cyclic reduction technique which is modified in order to keep its parallelism constant, and to reduce gteatly its execution time. Both of these algoriths are compared and studied.