• English Language & Literature Teaching
• /
• v.16 no.3
• /
• pp.1-18
• /
• 2010

This study examined the effects of previewing and providing background knowledge on low level EFL readers' comprehension of expository texts and their responses to these treatments. 130 college freshmen were randomly placed into one of three treatment groups and read two expository texts reflecting unfamiliar cultural information. Prior to reading, one group was given previewing instruction, which included vocabulary preteaching and summaries, and a second group was provided with culture-specific background knowledge through watching videos and slides. The third group read each text without any prereading instruction. Immediately after reading a passage, subjects answered a 10-item multiple-choice test. Results showed significant positive effects of the previewing treatment and weak positive effects of the providing background knowledge treatment. Students' responses on the questionnaires revealed that the majority felt that the experimental treatments contributed to comprehension enhancement, made reading more enjoyable, and expedited their reading process. Students in the control group, however, indicated that they needed explicit prereading instruction in order to understand the texts. Pedagogical implications of the findings for EFL reading instruction are provided.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.4
• /
• pp.625-640
• /
• 2023

This paper propose a circuit that can measure the inductance of an inductive sensor used in IOT applications. The circuit was constructed using the characteristics of an RL low-pass filter circuit, comparator, current control switch, and capacitor, and the inductance value within the range 1[nH] < L ≤ 1[H] can be derived through the duration time during the output voltage of the RL low-pass filter circuit is greater than the reference voltage.

• Journal of Korean Library and Information Science Society
• /
• v.39 no.3
• /
• pp.479-500
• /
• 2008

This study investigates Kim Inhue's view of reading through the analysis of reference books in Haseo-Chunjib(하서전집). As the result, he had read 123 different books ar least. He had quoted frequently $Sish{\bar{u}}$ $S{\bar{a}}nj{\bar{i}}ng$(사서삼경), $Sh{\check{i}}ji$(사기), $H{\grave{a}}nsh{\bar{u}}$(한서), $Zhu{\bar{a}}ngz{\check{i}}$(장자), $G{\check{u}}wenzh{\bar{e}}nb{\check{a}}o$(고문진보), $Ch{\check{u}}c{\acute{i}}$(초사), $W{\acute{e}}nxu{\check{a}}n$(문선). He had read books beyond the contemporary(sixteen centurtry) scholar's common list, and had enjoyed reading over the boundaries of stereotyped idea. While he had emphasized on the scripture of Confucian, had earned more knowledges for usefulness and the bases of scholarly writings by reading a wide spectrum of books.

• Journal of Korean Library and Information Science Society
• /
• v.44 no.3
• /
• pp.5-27
• /
• 2013

The purpose of this study is to examine the characteristics and continuity of 'One Book, One City' community reading campaign in the U.S.A. An analysis of 584 'One Book' projects registered in the Library of Congress, the Center for the Books shows that this innovative model of reading campaign has been diffused through three stages: the beginning(1998-2001), the growth (2002-2006), and the second take-off(2007-present). The stability of more than fifty 'One Book' projects was confirmed and the continuing diffusion of 'One Book' model through 'The Big Read' Initiative and some projects' attempt to try new directions seem worth observing.

• Smart Media Journal
• /
• v.7 no.2
• /
• pp.23-33
• /
• 2018

A musical sheet is read by optical music recognition (OMR) systems that automatically recognize and reconstruct the read data to convert them into a machine-readable format such as XML so that the music can be played. This process, however, is very challenging due to the large variety of musical styles, symbol notation, and other distortions. In this paper, we present a model for the recognition of musical symbols through the use of a mobile application, whereby a camera is used to capture the input image; therefore, additional difficulties arise due to variations of the illumination and distortions. For our proposed model, we first generate a line adjacency graph (LAG) to remove the staff lines and to perform primitive detection. After symbol segmentation using the primitive information, we use a covariance-matching method to estimate the similarity between every symbol and pre-defined templates. This method generates the three hypotheses with the highest scores for likelihood measurement. We also add a global consistency (time measurements) to verify the three hypotheses in accordance with the structure of the musical sheets; one of the three hypotheses is chosen through a final decision. The results of the experiment show that our proposed method leads to promising results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.306-316
• /
• 2016

In this paper, an NMOS-diode eFuse OTP (One-Time Programmable) memory cell is proposed using a parasitic junction diode formed between a PW (P-Well), a body of an isolated NMOS (N-channel MOSFET) transistor with the small channel width, and an n+ diffusion, a source node, in a DNW (Deep N-Well) instead of an NMOS transistor with the big channel width as a program select device. Blowing of the proposed cell is done through the parasitic junction formed in the NMOS transistor in the program mode. Sensing failures of '0' data are removed because of removed contact voltage drop of a diode since a NMOS transistor is used instead of the junction diode in the read mode. In addition, a problem of being blown for a non-blown eFuse from a read current through the corresponding eFuse OTP cell is solved by limiting the read current to less than $100{\mu}A$ since a voltage is transferred to BL by using an NMOS transistor with the small channel width in the read mode.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.2
• /
• pp.168-175
• /
• 2017

In this paper, a 5V small-area NMOS-diode eFuse OTP memory cell is proposed. This cell which is used in PMICs consists of a 5V NMOS transistor and an eFuse link as a memory part, based on a BCD process. Also, a regulated voltage of V2V ($=2.0V{\pm}10%$) instead of the conventional VDD is used to the pull-up loads of a VREF circuit and a BL S/A circuit to obtain a wider operational voltage range of the eFuse memory cell. When this proposed cells are used in the simulation, their sensing resistances are found to be $15.9k{\Omega}$ and $32.9k{\Omega}$, in the normal read mode and in the program-verify-read mode, respectively. Furthermore, the read current flowing through a non-blown eFuse is restricted to $97.7{\mu}A$. Thus, the eFuse link of a non-blown eFuse OTP memory cell is kept non-blown. The layout area of the designed 1kb eFuse OTP memory IP based on Dongbu HiTek's BCD process is $168.39{\mu}m{\times}479.45{\mu}m(=0.08mm^2)$.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.15-26
• /
• 2002

Most work on multimedia storage systems has assumed that client will be serviced using a round-robin strategy. The server services the clients in rounds and each client is allocated a time slice within that round. Furthermore, most such algorithms are evaluated on the basis of a tightly coupled cost function. This is the basis of well-known algorithm such as FCFS, SCAN, SCAN-EDF, etc. In this paper, we describe a scheduling module called Request Unifier(RU) that takes as input, a set of client request, and a set of constraints on the desired performance such as client waiting time or maximum disk bandwidth, and a cost function. It produces as output a Unified Read Request(URR), telling the storage server which data items to read and when these data items to be delivered to the clients. Given a cost function, a URR is optimal if there is no other URR satisfying the constraints with a lower cost. We present three algorithms in this paper that can accomplish this kind of request merging and compare their performance through an experimental evaluation.

• Proceedings of the Korean Printing Society Conference
• /
• 2001.06a
• /
• pp.63-77
• /
• 2001

PDF(Portable Document Format) is a file format that Adobe advances postscritp technique and use in managing document information or electric publishing(internet, CD-ROM, DVD). PDF is a devised document type for being able to read and print anywhere, independent of OS, printer type, resolution, and the kind of computer etc. Because this includes a compressing function, it transfers document through a small size of file in internet or intranet. In addition, that is a file format has various advantages-sharing of information and transfering documents in on line or off line environment. In this paper, we developed electronic document system using PDF format. Electronic document system consists of filter, automatic indexing, special searching system and web server. The information used in this paper is database made using Zwon\`s DocuCom. The filter recognizes various kinds of document structure. And according to property of document, it produces ASCII output. In addition to processing various formats of document, the filter can extract keywords in documents of MS WORD, Excel, Powerpoint, PDF, CAD etc. This filter uses the structure of window printer drive and can extract the information for text, page, font type and size from relevant document. The automatic indexing recognizes the formatted tag of document form ASCII text produced by filter and extracts adequate keyword to structure and property of document. PDF electronic document systems proposed in this paper can be used in Internet, PC communication. Users can choose and read electronic documents by two ways. First, users can choose and read relevant books using PDF electronic document homepage. Second, users can use PDF integrated-search system. User can search after inputing keyword and choose reference field and type of data. But, now, PDF products of Adobe can\`t support the Korean character. If this problem is resolved, we thick that PDF applications system looks active. Although there is limited function in case of using Zwon DocuCom used in this study, we think that there isn\`t a great deal of difficulty in electronic document and building digital database.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3274-3297
• /
• 2021

Permission delegation is an important research issue in access control. It allows a user to delegate some of his permissions to others to reduce his workload, or enables others to complete some tasks on his behalf when he is unavailable to do so. As an ideal solution for controlling read access on outsourced data objects on the cloud, Ciphertext-Policy Attribute-Based Encryption (CP-ABE) has attracted much attention. Some existing CP-ABE schemes handle the read permission delegation through the delegation of the user's private key to others. Still, these schemes lack the further consideration of granularity and traceability of the permission delegation. To this end, this article proposes a flexible and fine-grained CP-ABE key delegation approach that supports white-box traceability. In this approach, the key delegator first examines the relations between the data objects, read permission thereof that he intends to delegate, and the attributes associated with the access policies of these data objects. Then he chooses a minimal attribute set from his attributes according to the principle of least privilege. He constructs the delegation key with the minimal attribute set. Thus, we can achieve the shortest delegation key and minimize the time of key delegation under the premise of guaranteeing the delegator's access control requirement. The Key Generation Center (KGC) then embeds the delegatee's identity into the key to trace the route of the delegation key. Our approach prevents the delegatee from combining his existing key with the new delegation key to access unauthorized data objects. Theoretical analysis and test results show that our approach helps the KGC transfer some of its burdensome key generation tasks to regular users (delegators) to accommodate more users.