• 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.

• 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.

• Information and Communications Magazine
• /
• v.21 no.7
• /
• pp.83-93
• /
• 2004

본 고에서는 Beyond IMT-2000 시스템의 전송방식으로 고려 중인 multiple-antenna OFDM (Orthogonal Frequency Division Multiplexing) 방식에 대하여 기술한다. OFDM 방식은 무선채널에서 고속으로 데이터 전송을 하고자 할 경우 다중경로에 의해 발생하는 심각한 주파수 선택적 페이딩 채널에 쉽게 대처할 수 있고, 셀내 간섭이 존재하지 않으며, 자원 할당의 granularity가 우수하고, FFT와 1-탭 등화기를 사용하여 고속으로 구현할 수 있다는 장점이 있어 4G 이동통신의 전송 방식으로 최근 활발히 연구되고 있다［1］-［4］.(중략)

• Korean Journal of Cognitive Science
• /
• v.11 no.1
• /
• pp.67-80
• /
• 2000

Distributed cooperative information system is the one that has various knowledge sources as well as problem solving capabilities to get information in a distributed and heterogeneous data environment. In a distributed cooperative information system. a control mechanism to facilitate the available information is very important. and usually the role of the control mechanism determines the behavior of the total system In this research. we proposed a model of the distributed cooperative information system which is based on the multi-agent paradigm. We also implemented a test system to show l its feasibility. The proposed system makes the knowledge sources into agents and a special agent called 'facilitator' controls the cooperation between the knowledge agents The facilitator uses the knowledge granularity level to determine the sequence of the activation of the agents. In other words. the knowledge source with simple but fast processing mechanism activates first while more sophisticated but slow knowledge sources are activated late. In an environment in which we have several knowledge sources for the same topic. the proposed system will simulate the focusing mechanism of human cognitive process.

• 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.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.61-70
• /
• 2013

The increasing number of mobile users and the popularity of real-time applications make wired-wireless integrated network extremely attractive. In this case, quality of service (QoS) adaptability is particularly important since some important features of the integrated network call for QoS adaptability, such as mobility, bursty applications and so on. Traditional QoS schemes include integrated service (IntServ) and differentiated service (DiffSev) as well as their variants. However, they are not able to balance well between scalability and QoS granularity. For example, IntServ faces the scalability problem, while DiffServ can only provide coarse granular QoS. In addition, they are also unable to efficiently support QoS adaptability. Therefore, a per-packet differentiated queueing service (DQS) was proposed. DQS was originally proposed to balance between scalability and QoS granularity in wired networks and then extended to wireless networks. This paper mainly discusses how to use DQS to support QoS adaptability in wired-wireless integrated networks. To this end, we propose a scheme to determine dynamic delay bounds, which is the key step to implement DQS to support QoS adaptability. Simulation studies along with some discussions are further conducted to investigate the QoS adaptability of the proposed scheme, especially in terms of its support of QoS adaptability to mobility and to bursty real-time applications.

• Journal of Information Technology Services
• /
• v.5 no.2
• /
• pp.137-153
• /
• 2006

SOA(Service Oriented Architecture) can be a technique to make compassable software from mapping business service to software component. To support effective SOA, it is important that services have to be defined or classified more independently for dynamic and reusable composition. Several methods have been issued but no ways to defined service granularities, service type or service unit. In this paper we introduce 3 level views, service level, service granularity to reuse effectively. And, we suggest service definition guidelines using them.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.376-379
• /
• 2003

In this paper we describe DCClass, a tool for fuzzy information granulation with transparency constraints. The tool is particularly suited to solve fuzzy classification problems, since it is able to automatically extract information granules with class labels. For transparency pursuits, the resulting information granules are represented in form of fuzzy Cartesian product of one-dimensional fuzzy sets. As a key feature, the proposed tool is capable to self-determining the optimal granularity level of each one-dimensional fuzzy set by exploiting class information. The resulting fun information granules can be directly translated in human-comprehensible fuzzy rules to be used for class inference. The paper reports preliminary experimental results on a medical diagnosis problem that shows the utility of the proposed tool.

• Journal of the Korean Society for Library and Information Science
• /
• v.54 no.3
• /
• pp.165-186
• /
• 2020

Although BIBFRAME is recognized as a new bibliographic standard that can replace the existing MARC structure, the vastness of the descriptive items shows many limitations to be applied in library communities. Thus this study proposed separating the descriptive levels of BIBFRAME as a way to enhance the applicability of BIBFRAME. The descriptive level of BIBFRAME was divided into three stages: core, standard, and detailed levels based on the bibliographic area of ISBD 2011. This separation was semantically implemented using RDF/RDFS syntax. The levels of description in BIBFRAME was defined as Class Granularity and Class Element, and the Property Relation was defined for the linkage between the Classes defined and the BIBFRAME. By applying this syntactic structure, the relationships between the BIBFRAME descriptive items separated by each descriptive level could be linked with each other. This approach is expected to ensure applicability in the creation and sharing of bibliographic data using BIBFRAME.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.94-96
• /
• 2022

Plug & Play techniques have been proposed in various ways to overcome the complexity of sensors/drivers in IoT application development. IEEE1451 standard abstracts sensors/drivers into a data structure called TEDS. As a result, characteristics of the sensor/driver are unnecessary when connecting the sensor/driver to the host device. The method proposed by ETRI is a format in which device drivers of sensors/drivers are dynamically loaded and connected to hosts, and there is no particular abstraction data structure. Both schemes are located at both ends in terms of the abstraction unit of the sensor/driver. We present the problem based on this fact, and what optimized methods can exist in the middle of it. In this paper, we analyze existing Plug&Play techniques. Also, we specify abstraction units of sensors/drivers, and analyze them.