• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.2
• /
• pp.71-78
• /
• 2019

As the capacity of SSDs rapidly increases, the amount of DRAM to keep a mapping table size in SSDs becomes very huge. To address a Demand-based FTL (DFTL) scheme that caches part of mapping entries in DRAM is considered to be a feasible alternative. However, owing to its unpredictable behaviors, DFTL fails to provide consistent I/O response times. In this paper, we a) analyze a root cause that results in fluctuation on read latency and b) propose a new demand-based FTL scheme that ensures guaranteed read response time with low write amplification. By preventing mapping evictions while serving reads, the proposed technique guarantees every host read requests to be done in 2 NAND read operations. Moreover, only with 25% of a cache ratio, the proposed scheme improves random write performance and random mixed performance by 1.65x and 1.15x, respectively, over the traditional DFTL.

• Kyungpook Mathematical Journal
• /
• v.46 no.3
• /
• pp.445-448
• /
• 2006

Let N be a normal subgroup of a path-connected topological group (G, $t$). In this paper, the authors consider the existence of path-connectedness in refined topologies in order to address the property of maximal path-connectedness in topological groups. In particular, refinements on $t$ and refinements on the quotient topology on G/N are studied. The preservation of path-connectedness in extending topologies and translation topologies is also considered.

• 한국어정보학회:학술대회논문집
• /
• 2016.10a
• /
• pp.239-242
• /
• 2016

데이터베이스 기반 자동 주소번역은 입력 오류에 취약하며 범용 기계번역을 이용한 주소번역은 입력 및 번역 주소에 대한 품질 평가가 어렵다. 본 논문에서는 예측할 수 없는 입력 오류에도 대응할 수 있는 자동 주소번역 시스템을 제안한다. 제안 시스템은 n-gram 기반 검색, 미검색/오검색 분류, 번역, 신뢰도 자동평가로 구성된다. 신뢰할 수 있는 입력으로 자동 분류한 영문 국내주소를 국문으로 번역한 결과 95%이상의 정확도를 보였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.393-395
• /
• 2000

현재 인터넷이 직면하고 있는 IP 주소 부족문제 해결을 위한 새로운 방안으로서 데이터 플로우 구별에 의한 네트워크 주소 변환(NAT-FS : NAT by Flow Separation) 기법을 제안하고 기술한다. 이 방식은 기존의 NAPT와 같이 단 하나의 글로벌 IP 주소에 모든 로컬 호스트가 할당되면서도 Basic NAT 방식처럼 DNA와 연동하여 Full Access 기능도 지원할 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.409-411
• /
• 2003

현재 SIP를 가지고 모빌리티를 지원하는 방안은 계속 연구되고 있다. 본 논문은 SIP를 이용한 모빌리티 지원 방안에 대하여 연구하여 계층적으로 등록을 하게 함으로써 하나의 도메인 내에서의 이동에서는 글로벌 등록을 하지 않음으로 등록에 걸리는 지연과 네트워크의 낭비를 줄이고 도메인 내에서의 이동으로 인한 핸드오프 시 도메인간의 이동에 빠른 핸드오프를 지원하는 방안을 제시함으로써 핸드오프 지연으로 인한 패킷의 분실을 줄이는 방안을 위해 SIP에서 3PCC(third party call control)와 NAT(Network Address Translation)를 사용하는 방법을 제안하고 있다. 또한. 도메인 안에서의 핸드오프에도 NAT를 이용하여 빠른 핸드오프를 지원할 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1746-1755
• /
• 1996

In this paper, we propose the protocol stact and the server functions of IWU which interconnects distributed LAN's users by using of B-ISDN. The protocol stact of interconnecting IWU under consideration users TCP/IP in upper layer. TCP/IP is popular communication protocol in interconnecting distributed LANs. The interconnecting IWU has server functions for transfering datagrams to B-ISDN such as address translation, fragment and reassembly, CL server, signalling and traffic control. We analyze the performance ofinterconnecting IWU with M/M/1/K queueing model and obtain the throughput and buffer size of interconnecting IWU.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.01a
• /
• pp.133-134
• /
• 2018

본 논문에서는 네트워크상에 연결된 두 개의 단말이 클라우드나 외장형 메모리 없이 파일을 송수신할 수 있는 방법을 제안하고 이를 구현한다. 제안한 방법은 NAT로 나눠진 두 단말사이의 송수신을 위하여 TCP- Relaying 기법을 활용함으로써 데이터의 송수신을 하여 신뢰도는 높이면서 간단한 파일을 송수신할 수 있다.

• Journal of the Korea Convergence Society
• /
• v.9 no.10
• /
• pp.45-53
• /
• 2018

Recently, studies about bilingual word embedding have been gaining much attention. However, bilingual word embedding with Korean is not actively pursued due to the difficulty in obtaining a sizable, high quality corpus. Local embeddings that can be applied to specific domains are relatively rare. Additionally, multi-word vocabulary is problematic due to the lack of one-to-one word-level correspondence in translation pairs. In this paper, we crawl 868,163 paragraphs from a Korean-English law corpus and propose three mapping strategies for word embedding. These strategies address the aforementioned issues including multi-word translation and improve translation pair quality on paragraph-aligned data. We demonstrate a twofold increase in translation pair quality compared to the global bilingual word embedding baseline.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.73-80
• /
• 2011

In this paper, we design and implementation of effective remote management system for VoIP(Voice over IP) terminal. Ordinary VoIP terminal is connected inside of NAT(Network Address Translation) assigned private IP address. NAT provides address mapping between outside public IP address and inside private IP address, for outside system telephone call is connected to inside VoIP terminal. In this paper, we also design and implementation of UDP hole punching function that the outside calls pass through the NAT, for outside management system call is connected to internal VoIP terminal, and gathered to management information of the VoIP terminal. Also, we evaluated and analysed of developed system in the test environment. As a result of test, It showed that it was well performed without any data error and data loss in the connectivity, and It showed that it was well gathered management information of the VoIP terminal.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.2
• /
• pp.90-102
• /
• 2010

Flash memory has been widely used as an important storage device for consumer electronics. For the flash memory-based storage systems, FTL (Flash Translation Layer) is used to handle the mapping between a logical page address and a physical page address. Especially, log buffer-based FTLs provide a good performance with small-sized mapping information. In designing the log buffer-based FTL, one important factor is to determine the mapping structure between data blocks and log blocks, called associativity. While previous works use static associativity fixed at the design time, we propose a new log block mapping scheme which adjusts associativity based on the run-time workload. Our proposed scheme improves the I/O performance about 5~16% compared to the static scheme by adjusting the associativity to provide the best performance.