• Journal of the Korea Computer Industry Society
• /
• v.2 no.4
• /
• pp.417-424
• /
• 2001

Internet networks consisting of existing routers show the limits in efficiency of traffic managements. In order to overcome the limits, MPLS System is high speed switching technology and is not based on IP address but based on label was designed. However MPLS system being based on ATM has the difficulties of supporting Qos(Quality of Service). This paper suggested the way to consist a service-assured-network using CR-LDP protocol which was designed for guaranteeing QoS in MPLS system being based on ATM switch and using qGSMP protocol, and the way to implicitly establish LSP by implementing QoS Translation and QoS Mapping in LER System.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.1
• /
• pp.79-86
• /
• 1996

In this paper we propose an architecture for VLC(Variable Length Coder) and VLD(Variable Length Decoder) which is simple with respect to implementation point and efficient in memory. We implemented encoding and decoding circuit where we need only 7-bit address memory space for 114 MPEG1 DCT coefficients and employed minimal number of flip-flops and logics for an architecture to integrate a shift register for serial-to-parallel or parallel-to-serial conversion of the data in code mapping ROM. We obtained 50Mbps operating speed in both encoding and decoding process as the result of simulation using 0.80.8${\mu}m$ CMOS standard cells.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.10
• /
• pp.45-55
• /
• 2018

R2RML is a W3C standard language that defines how to expose the relational data as RDF triples. The output from an R2RML mapping is only an RDF dataset. By definition, the dataset has no schema. The lack of schema makes the dataset in linked data portal impractical for integrating and analyzing data. To address this issue, we propose an approach for generating automatically schemas for RDF graphs populated by R2RML mappings. More precisely, we represent the schema using ShEx, which is a language for validating and describing RDF. Our approach allows to generate ShEx schemas as well as RDF datasets from R2RML mappings. Our ShEx schema can provide benefits for both data providers and ordinary users. Data providers can verify and guarantee the structural integrity of the dataset against the schema. Users can write SPARQL queries efficiently by referring to the schema. In this paper, we describe data structures and algorithms of the system to derive ShEx documents from R2RML documents and presents a brief demonstration regarding its proper use.

• Asia pacific journal of information systems
• /
• v.33 no.3
• /
• pp.702-736
• /
• 2023

Artificial Intelligence (AI) and the technologies powered by AI fuel the fourth industrial revolution. Being the primary adopter of such innovations, banking has recently started using the most common AI-based technology, i.e., conversational agents. Although research extensively focuses on this niche area and provides bibliometric understanding for such agents in other industries, a similar review with scientometric insights of the banking literature concerning AI conversational agents is absent till date. Furthermore, in the era following the pandemic, banks are faced with the imperative to provide solutions that align with the changing landscape of remote consumer behavior. As a result, banks are proactively integrating technology-driven solutions, such as automated agents, to effectively address the growing demand for remote customer support. Hence more research is needed to perfect such agents. In order to bridge these existing gaps, the present study undertook a comprehensive examination of two decades' worth of banking literature. A meticulous review was conducted, analyzing approximately 116 papers published from 2003 to 2023. The aim was to provide a scientometric overview of the topic, catering to the research needs of both academic and industrial professionals. Holistically, the study seeks to present a macro-view about the existing trends in AI based banking conversational agents' literature while focusing on quantity, qualitative and structural indicators that are effectively necessary to offer new directions for the AI-based banking solutions. Our study, therefore, presents insights surrounding the literature, using selected techniques related to performance analysis and science mapping.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.1
• /
• pp.30-43
• /
• 2008

Memory reference instructions such as loads or stores are critical factors that limit the processing power of processor. The prefetching technique is an effective way to reduce the latency caused from memory access. However, excessively aggressive prefetch leads to cache pollution so as to cancel out the advantage of prefetch. In this study, four filtering schemes have been compared and evaluated which dynamically decide whether to begin prefetch after referring a filtering table to decrease cache pollution. First, A bi-states scheme has been shown to analyze the lock problem of the conventional scheme, this scheme such as conventional scheme used to be N:1 mapping, but it has the two state to 1bit value of each entries. A complete state scheme has been introduced to be used as a reference for the comparative study. A block address lookup scheme has been proposed as the main idea of this paper which exhibits the most exact filtering performance. This scheme has a length of the table the same as the bi-states scheme, the contents of each entry have the fields the same as the complete state scheme recently, never referenced data block address has been 1:1 mapping a entry of the filter table. Experimental results from commonly used general benchmarks and multimedia programs show that average cache miss ratio have been decreased by 10.5% for the block address lookup scheme(BAL) compare to conventional dynamic filter scheme(2-bitSC).

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.1
• /
• pp.18-29
• /
• 2008

NAND Flash memory has been growing popular storage device for the last years because of its low power consumption, fast access speed, shock resistance and light weight properties. However, it has the distinct characteristics such as erase-before-write architecture, asymmetric read/write/erase speed, and the limitation on the number of erasure per block. Due to these limitations, various Flash Translation Layers (FTLs) have been proposed to effectively use NAND flash memory. The systems that adopted the conventional FTL may result in severe performance degradation by the hot data which are frequently requested data for overwrite in the same logical address. In this paper, we propose a novel FTL algorithm called Adaptive Flash Translation Layer (AFTL) which uses sector mapping method for hot data and log-based block mapping method for cold data. Our system removes the redundant write operations and the erase operations by the separating hot data from cold data. Moreover, the read performance is enhanced according to sector translation that tends to use a few read operations. A series of experiments was organized to inspect the performance of the proposed method, and they show very impressive results.

• The KIPS Transactions:PartD
• /
• v.18D no.3
• /
• pp.157-168
• /
• 2011

Recently flash memory has been being utilized as a main storage device in mobile devices, and flashSSDs are getting popularity as a major storage device in laptop and desktop computers, and even in enterprise-level server machines. Unlike HDDs, on flash memory, the overwrite operation is not able to be performed unless it is preceded by the erase operation to the same block. To address this, FTL(Flash memory Translation Layer) is employed on flash memory. Even though the modified data block is overwritten to the same logical address, FTL writes the updated data block to the different physical address from the previous one, mapping the logical address to the new physical address. This enables flash memory to avoid the high block-erase cost. A flashSSD has an array of NAND flash memory packages so it can access one or more flash memory packages in parallel at once. To take advantage of the internal parallelism of flashSSDs, it is beneficial for DBMSs to request I/O operations on sequential logical addresses. However, the B-tree structure, which is a representative index scheme of current relational DBMSs, produces excessive I/O operations in random order when its node structures are updated. Therefore, the original b-tree is not favorable to SSD. In this paper, we propose AS(Always Sequential) B-tree that writes the updated node contiguously to the previously written node in the logical address for every update operation. In the experiments, AS B-tree enhanced 21% of B-tree's insertion performance.

• Journal of Intelligence and Information Systems
• /
• v.12 no.2
• /
• pp.33-48
• /
• 2006

The Semantic Web and its related technologies have been opening the era of information sharing via the Web. There are, however, several huddles still to overcome in the new era, and one of the major huddles is the issue of information integration, unless a single unified and huge ontology could be built and used which could address everything in the world. Particularly in the e-business area, the problem of information integration is of a great concern for product search and comparison at various Internet shopping sites and e-marketplaces. To overcome this problem, we proposed an ontology-driven mapping algorithm between heterogeneous product classification and description frameworks. We also peformed a comparative evaluation of the proposed mapping algorithm against a well-Down ontology mapping tool, PROMPT.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.6
• /
• pp.652-662
• /
• 2016

This paper proposes a user mobility management scheme which supports seamless service even if a user changes his accessing terminal in service in IP-based convergence network. Most of ongoing researches concerning mobility management as well as the existing mobility schemes have been focused to support terminal mobility. It is limited to support a variety of mobility types such as user mobility. The proposed scheme uses the mapping relationship between UID(User Identifier), user specific identifier and TID(Terminal Identifier), specific terminal identifier and forms packet address with user specific permanent 3 layer address for session continuity in case of user mobility. We numerically analyze and compare handover signaling cost between the existing user mobility scheme and the proposed scheme. The result shows that the proposed scheme has lower handover signaling cost than the existing one, [1].

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.5
• /
• pp.915-932
• /
• 2022

According to the Personal Information Protection Act and Pseudonymization Guidelines, the mapping is processed to the hash value of the combination key generation items including Salt value when different combination applicants wish to combine. Example of combination key generation items may include personal information like name, phone number, date of birth, address, and so on. Also, due to the properties of the hash functions, when different applicants store their items in exactly the same form, the combination can proceed without any problems. However, this method is vulnerable to combination in scenarios such as address changing and renaming, which occur due to different database update times of combination applicants. Therefore, we propose a privacy preserving combination key generation scheme robust to updates of items used to generate combination key even in scenarios such as address changing and renaming, based on the thresholds through probabilistic record linkage, and it can contribute to the development of domestic Big Data and Artificial Intelligence business.