• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.10
• /
• pp.57-64
• /
• 2002

The structure of conventional CAM(Content Addressable Memory) cell, used to Look-up table scheme in Huffman CODEC, is not performed by being separated in reading, writing and match operation. So, there is disadvantages that the control is complicated, and the floating states of match line force wrong operation to be happened in reading, writing operation. In this paper, in order to improve the disadvantages and proces the data fast, fast Look-up table is designed using DBLCAM(Dual Bit Line CAM)-performing the reading, writing operation and match operation independently and Two-port SRAM being more fast than RAM in an access speed. Look-up table scheme in Huffman CODEC, using DBLCAM and Two-port SRAM proposed in this paper, is designed in Cadence tool, and layout is performed in 0.6${\mu}{\textrm}{m}$ 2-poly 3-metal CMOS full custom. And simulation is peformed with Hspice.

• ETRI Journal
• /
• v.42 no.6
• /
• pp.899-911
• /
• 2020

The data in tables are accurate and rich in information, which facilitates the performance of information extraction and question answering (QA) tasks. TableQA, which is based on tables, solves problems by understanding the table structure and searching for answers to questions. In this paper, we introduce both novice and intermediate Korean TableQA tasks that involve deducing the answer to a question from structured tabular data and using it to build a question answering pair. To solve Korean TableQA tasks, we use S3-NET, which has shown a good performance in machine reading comprehension (MRC), and propose a method of converting structured tabular data into a record format suitable for MRC. Our experimental results show that the proposed method outperforms a baseline in both the novice task (exact match (EM) 96.48% and F1 97.06%) and intermediate task (EM 99.30% and F1 99.55%).

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.4
• /
• pp.569-574
• /
• 2013

With probably too many smart phone applications downloaded, it is sometimes frustrating to find frequently used applications quickly. In this paper, we propose a learning application that learns what applications a user frequently uses and match them with several signals that user designated. This learning applications uses ART2 algorithm that is good for stable real-time learning. By executing this learning application, a user simply chooses an application that is to be quickly searched and then draw a figure that would match the designated application at the upper left corner of our learning application. The proposed learning application transforms the background with 0's and the figure with 1's and normalize them to be used as inputs for ART2 and ART2 does clustering to setup a match table between applications and figures. After learning, a user simply draws a figure to execute one's frequently used application.

• Human Ecology Research
• /
• v.54 no.4
• /
• pp.415-426
• /
• 2016

We researched the modern meanings of traditional dining table courtesy education and its correlation with the main values of contemporary personality education based on dining table courtesy education stated in the social norms texts of the Joseon dynasty. Among the social norms of the Joseon dynasty, we chose Sohak, Naehun, Dongmongsuji, Seonghakjibyo, Gyeongmongyogyeol, Jeungbosallimgyeongje, Sasojeol, and Koamgahoon for research. As a result of our research on these documents and books, the modern meanings of the courtesy education at the dining table can be summarized as follow. First, the courtesy education has table manners appropriate for the development level of early children. Second, it teaches right-handed dining manners that match the features of Korean food culture. Third, it has the self-discipline and the values of community life, sharing, solicitude, and communication. Fourth, parents and grandparents are involved in the education. Fifth, it has the core values of modern personality education: manners, filial piety, respect, solicitude, communication, cooperation, and responsibility. Future courtesy education at the dining table should include practical education programs that can consolidate the bond of sympathy between the home, school, and society, and can improve its practice; in addition, to expand the opportunities for education, proactive social support is demanded.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.2B
• /
• pp.138-143
• /
• 2003

One of the important design issues for IP routers responsible for packet forwarding in computer networks is the route-lookup mechanism. For each incoming packet, IP routing requires that a router performs a longest-prefix-match address lookup in order to determine the next hop that the incoming packet should be forwarded to. In this paper, we present a new scheme which applies the hashing function for IP address lookup. In the proposed scheme, the forwarding table is composed of multiple SRAMs, and each SRAM represents an address lookup table in each prefix. Hashing function is applied in order to find out the matching entries from the address lookup tables in parallel, and the entry with the longest prefix match among them is selected. Simulation using the MAE-WEST router example shows that a large routing table with 37000 entries can be compacted to a forwarding table of 300 Kbytes in the proposed scheme. It is also shown that the proposed scheme achieves one route lookup every 1.93 memory accesses in average.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.65-71
• /
• 2005

The primary function of the Internet routers is to forward incoming packets toward their final destinations. IP address lookup is one of the most important functions in evaluating router performance since IP address lookup should be performed in wire-speed for the hundred-millions of incoming packets per second. With CIDR, the IP prefixes of routing table have arbitrary lengths, and hence address lookup by exact match is no longer valid. As a result, when packets arrive, routers compare the destination IP addresses of input packets with all prefixes in its routing table and determine the most specific entry among matching entries, and this is called the longest prefix matching. In this paper, based on parallel multiple hashing and prefix grouping, we have proposed a hardware architecture which performs an address lookup with a single memory access.

• Structural Engineering and Mechanics
• /
• v.17 no.2
• /
• pp.187-201
• /
• 2004

A shaking table test on a three-story one-bay steel frame model with metallic yield dampers and their parallel connection with oil dampers is carried out to study the dynamic characteristics and seismic performance of the energy dissipation system. It is found from the test that the combined energy dissipation system has favorable reducing vibration effects on structural displacement, and the structural peak acceleration can not evidently be reduced under small intensity seismic excitations, but in most cases the vibration reduction effect is very good under large intensity seismic excitations. Test results also show that stiffness of the energy dissipation devices should match their damping. Dynamic analysis method and mechanics models of these two dampers are proposed. In the analysis method, the force-displacement relationship of the metallic yield damper is represented by an elastic perfectly plastic model, and the behavior of the oil damper is simulated by a velocity and displacement relative model in which the contributions of the oil damper to the damping force and stiffness of the system are considered. Validity of the analytical model and the method is verified through comparison between the results of the shaking table test and numerical analysis.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.6
• /
• pp.766-772
• /
• 2007

As XML is widely used, many researches on the XML storage and query processing have been done. But, previous works on path query processing have mainly focused on the storage and retrieval methods for a large XML document or XML documents had a same DTD. Those researches did not efficiently process partial match queries on the differently-structured document set. To resolve the problem, we suggested a new index structure using relational table. The method constructs the $B^+$-tree index using backward label paths instead of forward label paths used in previous researches for storing path information and allows for finding the label paths that match the partial match queries efficiently using it when process the queries.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.18 no.1
• /
• pp.35-45
• /
• 2000

Recently, as the prepress mainstream is changed to the digital workflow, various digital proofing systems such as high price dye sublimation printers and low price ink jet printers are widely used in printing industry. However, most of the digital proofing devices have lower resolution than analog proofing systems and differ with actual color presses in the color gamuts. Therefore, proper color compensations are needed for digital color proofing in order to match colors between the proofs and the press sheets. This study shows the application method of Look-up Table to the digital color proofer of Rainbow, the analog proofer of Matchprint-II, and an actual offset press is effective on the color compensations.

• Proceedings of the Korean Printing Society Conference
• /
• 2000.12b
• /
• pp.17-28
• /
• 2000

Recently, as the prepress mainstream is changed to the digital workflow, various digital proofing systems such as high price dye sublimation printers and low price ink jet printers are widely used in printing industry. However, most of the digital proofing devices have lower resolutions than analog proofing systems and differ with actual color presses in the color gamuts. Therefore, proper color compensations are needed for digital color proofing in order to match color between the proofs and the press sheets. In this paper, we used 3-dimensional look-up table(LUT) and tetrahedral interpolation method for the color space conversion between the device independent color space(CIEXYZ or Lab) and the device dependent color space(CMY) to reduce the color differences between the original copy and digital color proofs and the press sheets.