• English Language & Literature Teaching
• /
• v.12 no.1
• /
• pp.29-54
• /
• 2006

The purpose of this study is two-fold: first, to examine the current status of e-dictionary use in Korea and the attitude toward its use by Korean college students; second, to investigate to what degree e-dictionaries may be useful and effective tools in helping to improve learners' overall English skills. The subjects were 84 college students and they were divided into two groups: the experiment group and the control group. The instrument employed was the Preliminary Student Usage Questionnaire, which was developed by the researcher, together with the questionnaire survey developed by Koyama and Takeuchi (2004), which was modified for the study. The findings from this research are as follows: First, a special instruction session on how to use e-dictionaries made a statistically significant difference among users of the dictionaries. Those subjects who had received the instruction displayed a more positive attitude toward the use of e-dictionaries. Second, the experiment group showed a more favorable attitude toward the use of e-dictionaries. On the basis of the above results, the researcher suggests that proper guidance on the use of e-dictionaries and their benefits should have a positive influence on users. The findings from the current research will shed light on the current status of electronic dictionary use among Korean college students.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.5
• /
• pp.39-48
• /
• 2002

long with the rapid spread of the Internet, a new class of commercial applications which process transactions with respect to electronic dictionaries become popular Typical examples are Internet search engines. In this paper, we present a new approach to achieving high performance electronic dictionaries. Different from the conventional approach which use Trie data structures for the implementation of electronic dictionaries, our approach used multi-dimensional binary trees. In this paper, we present the implementation of our electronic dictionary ED-MBT(Electronic Dictionary based on Multidimensional Binary Tree). Exhaustive performance study is also presented to assess the performance impact of ED-MBT on the real world applications.

• The KIPS Transactions:PartD
• /
• v.8D no.5
• /
• pp.587-592
• /
• 2001

Many applications are being developed to automate office works, and the electronic dictionary(e-Dictionary) is one of the main components of the office suites. Several requirements are proposed for the efficient e-dictionaries :1) Fast searching time, 2) Data compatibility with other e-dictionaries to deal with words and obsolete word, and 3) Reusable components to develop new customized e-dictionaries with minimized development time and cost. We propose a data format with which any e-dictionary can change data with others. We also develop System Dictionary component and Customer Dictionary component to enable-and-play component reuse. Our e-dictionary achieves fast searching time by efficiently managing Trie and B-tree index structure for the dictionary components.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.12
• /
• pp.4648-4663
• /
• 2020

This paper proposes the Lempel-Ziv 4(LZ4) compression accelerator optimized for scale-out servers in data centers. In order to reduce CPU loads caused by compression, we propose an accelerator solution and implement the accelerator on an Field Programmable Gate Array(FPGA) as heterogeneous computing. The LZ4 compression hardware accelerator is a fully pipelined architecture and applies 16 dictionaries to enhance the parallelism for high throughput compressor. Our hardware accelerator is based on the 20-stage pipeline and dictionary architecture, highly customized to LZ4 compression algorithm and parallel hardware implementation. Proposing dictionary architecture allows achieving high throughput by comparing input sequences in multiple dictionaries simultaneously compared to a single dictionary. The experimental results provide the high throughput with intensively optimized in the FPGA. Additionally, we compare our implementation to CPU implementation results of LZ4 to provide insights on FPGA-based data centers. The proposed accelerator achieves the compression throughput of 639MB/s with fine parallelism to be deployed into scale-out servers. This approach enables the low power Intel Atom processor to realize the Hadoop storage along with the compression accelerator.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.144-154
• /
• 2013

This paper proposes a new super-resolution algorithm where sharpness enhancement is merged in order to improve overall visual quality of up-scaled images. In the learning stage, multiple dictionaries are generated according to sharpness strength, and a proper dictionary among those dictionaries is selected to adapt to each patch in the inference stage. Also, additional post-processing suppresses boosting of artifacts in input low-resolution images during the inference stage. Experimental results that the proposed algorithm provides 0.3 higher CPBD than the bi-cubic and 0.1 higher CPBD than Song's and Fan's algorithms. Also, we can observe that the proposed algorithm shows better quality in textures and edges than the previous works. Finally, the proposed algorithm has a merit in terms of computational complexity because it requires the memory of only 17% in comparison with the previous work.

• Proceedings of the Korean Society for Cognitive Science Conference
• /
• 2006.06a
• /
• pp.103-109
• /
• 2006

XML(extensible Markup Language)이 1996년 등장한 이후, 기존의 정보를 XML 기반으로 나타내기 위한 연구가 활발하게 이루어지고 있다. 언어자원(language Resource)과 관련된 분야는 80년대부터 그 연구가 있었으나, XML의 등장 이후, 보다 다양하고 특화된 영역의 정보를 구조화하기 위한 연구결과가 최근 소개되기 시작하였다. 본 연구에서는 이러한 분야 중 전자사전을 표식(markup)하는 XML기반 표준언어인 LEXml(Presentation/Representation of Entries in Dictionaries: LEXml)에 대하여 살펴보고, 기존에 XML로 구축된 전자사전을 LEXml로 변환하여, 그 구조의 확장성과 유효성을 검증할 것이다. 기반자료로써 2000년도에 구축된 MultiDICO의 불어 정보를 이용하였다. 이를 위해 MultiDICO의 XML문서 구조와 LEXml 구조 사이의 각 요소(element)별 대응표를 만들었으며, 이를 바탕으로 XSL(Extensible Style sheet Language)를 작성하였다. 본 연구결과 LEXml이 기존에 구축된 전자사전들을 표식하는데 어려움이 없을 뿐만 아니라, 기계가독성을 높일 수 있는 구조적 유연성이 매우 높은 것을 확인할 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2590-2606
• /
• 2017

Generally, research of classical image classification algorithms assume that training data and testing data are derived from the same domain with the same distribution. Unfortunately, in practical applications, this assumption is rarely met. Aiming at the problem, a domain adaption image classification approach based on multi-sparse representation is proposed in this paper. The existences of intermediate domains are hypothesized between the source and target domains. And each intermediate subspace is modeled through online dictionary learning with target data updating. On the one hand, the reconstruction error of the target data is guaranteed, on the other, the transition from the source domain to the target domain is as smooth as possible. An augmented feature representation produced by invariant sparse codes across the source, intermediate and target domain dictionaries is employed for across domain recognition. Experimental results verify the effectiveness of the proposed algorithm.

• International journal of advanced smart convergence
• /
• v.10 no.4
• /
• pp.30-37
• /
• 2021

Touch sensor interface has become the most useful input device in a smartphone. Unlike keypad/keyboard interfaces used in electronic dictionaries and feature phones, smartphone's touch interfaces allow for the recognition of various gestures that represent distinct features of each application's input. In this paper, we analyze application-specific input patterns that appear in smartphone's touch interfaces. Specifically, we capture touch input patterns from various Android applications, and analyze them. Based on this analysis, we observe a certain unique characteristics of application's touch input patterns. This can be utilized in various useful areas like user authentications, prevention of executing application by illegal users, or digital forensic based on logged touch patterns.

• The Journal of Information Technology
• /
• v.4 no.1
• /
• pp.125-139
• /
• 2001

EDI(Electronic Data Interchange) works by providing a collection of standard message formats and element dictionary in a simple way for businesses to exchange data via any electronic messaging service. Open-edi is electronic data interchange among autonomous parties using public standards and aiming towards interoperability over time, business sectors, information technology and data types. The number of Internet services using XML/EDI has grown rapidly since it is easily expansible and exchangeable. To use this service, the client does not have to install EDI S/W but only needs internet browser. Consequently, it became much easier and faster to handle the trading process in an office. eBusiness SML (extensible markup language) electronic data interchange. eXedi is the service that realizes B2B of XML/EDI. eXedi can be used easily in small and medium sized companies. Companies in any place can access to eXedi using the existing Internet connection. XML/EDI provides a standard framework to exchange different types of data -- for example, an invoice, healthcare claim, project status -- so that the information be it in a transaction, exchanged via an Application Program Interface (API), web automation, database portal, catalog, a workflow document or message can be searched, decoded, manipulated, and displayed consistently and correctly by first implementing EDI dictionaries and extending our vocabulary via on-line repositories to include our business language, rules and objects.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.4 s.346
• /
• pp.49-55
• /
• 2006

In this paper, a fault dictionary for fault locations is considered. The foremost problem in fault diagnosis is the size of the data. As circuits are large, the data for fault diagnosis increase to the point where they are impossible to be stored. The increased information makes it impossible to store the dictionary into storage media. In order to generate the dictionary, j.e. pass-fail dictionary some dictionaries store a portion of the information. The deleted data makes it difficult to diagnose fault models except single stuck-at fault. This paper proposes a new dictionary format. A new format makes a dictionary small size without deleting any informations.