• Journal of Korean Home Economics Education Association
• /
• v.6 no.2
• /
• pp.13-30
• /
• 1994

Currently, textbooks of practical arts in the elementary school are being revised for the sixth time. All the students in the third, fourth, fifth and sixth grade of elementary school will learn these new textbooks beginning in March, 1995. The purpose of this study is to develop teaching models suitable for the new textbooks of practical arts under the sixth curriculum in the elementary school. The results of this study are summarized as follow: 1. Teaching guidances with subject matters in new textbooks are presented in Table 2, 3, 4, 5. The subject matters for each grade are divided into four main areas under the sixth curriculum. 2. The subject matters under the sixth curriculum are clothing, food, houseing, gradening, computer, industry and commerce. These are included in the four main areas of handling, making, cultivating or breeding and keeping. Activities or contents in these main areas are not necessarily related to each other in sequence. 3. The subject matters in the main areas are not perfectly constructed in accordance with the level of child development. 4. Teaching models and their example for each teaching unit are presented in Table 6, 7, 8, 9, 10.

• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.187-197
• /
• 2005

In this paper, we propose an extended TB-tree, called ETB-tree, which can improve the performance of an existing TB-tree proposed for indexing the trajectories of moving objects in Location-Based Service(LBS). The proposed ETB-tree directly accesses the preceding node by maintaining a direct table, called D-Table which contains the page number in disk and memory pointers pointing the leaf node with the first and last lines segment of moving objects. It can improve the insertion performance by quick searching the preceding node of a moving object and retrieval performance owing to accessing directly the corresponding trajectories In disk for the trajectory-based query. In addition, the ETB-tree provides consistency of a tree by reflecting a newly inserted line segment to the tree both in memory and disk. The experimental results show that the proposed indexing technique gains better performance than other traditional ones with respect to the insertion and retrieval of a trajectory query.

• The Journal of the Korea Contents Association
• /
• v.11 no.4
• /
• pp.155-163
• /
• 2011

In television broadcasts, There is an acute shortage of children's content. Children's program has no place to exist because of economical approach. Popular program which is supported by advertisement spot on broadcast's table of program. Children will be leading part of our society. If this environment has lasted for long period, children will lose emotional and cultural identity. A few powerful nation of culture encroach our culture industry. Many nation such as England, Canada, France, and Japan implement protectionist policy for culture from the government. First of all, it should be appreciate children' content is foundation for future content industry.

• The Journal of the Korea Contents Association
• /
• v.8 no.4
• /
• pp.86-91
• /
• 2008

To present the design procedure of discretized 8-bit tent map executing the transformation of tent function which is one of the chaotic functions, first, the truth table of discretized tent map was written, and then according to the simplified Boolean algebra equations obtained from the truth table, the discretized map is implemented with the exclusive logic gate as a real hardware. The discretized tent map circuit which provides the feedback circuit for generating the period-8 states relevant to the 8-bit finite precision is also designed and presented in this paper. Furthermore, it might be used stream cipher system with a new key-stream circuit for generate of chaotic binary sequence.

• The Journal of the Korea Contents Association
• /
• v.10 no.4
• /
• pp.55-65
• /
• 2010

We present a method for increasing network lifetime without link failure due to lack of battery capacity of nodes in wireless ad-hoc networks with low mobility. In general, a node with larger remaining battery capacity represents the one with lesser traffic load. Thus, a modified AODV routing protocol is proposed to determine a possible route by considering a remaining battery capacity of a node. Besides, the total energy consumption of all nodes increase rapidly due to the huge amount of control packets which should be flooded into the network. To reduce such control packets efficiently, a source node can store information about alternative routes to the destination node into its routing table. When a link failure happens, the source node should retrieve the route first with the largest amount of the total remaining battery capacity from its table entries before initiating the route rediscovery process. To do so, the possibility of generating unnecessary AODV control packets should be reduced. The method proposed in this paper increases the network lifetime by 40% at most compared with the legacy AODV and MMBCR.

• Journal of Digital Contents Society
• /
• v.11 no.1
• /
• pp.91-97
• /
• 2010

Flash memory has been used by many digital devices for data storage, exploiting the advantages of non-volatility, low power, stability, and so on, with the help of high integrity, large capacity, and low price. As the fast growing popularity of flash memory, the density of it increases so significantly that its entire address mapping table becomes too big to be stored in SRAM. This paper proposes the associated page address cache with an efficient table management scheme for hybrid flash translation layer mapping. For this purpose, all tables are integrated into a map block containing entire physical page tables. Simulation results show that the proposed scheme can save the extra memory areas and decrease the searching time with less 2.5% of miss ratio on PC workload and can decrease the write overhead by performing write operation 33% out of total writes requested.

• Journal of Digital Contents Society
• /
• v.17 no.6
• /
• pp.461-469
• /
• 2016

A novel steganography based on ternary BCH code with t = 2 is presented in this paper. Proposed method utilizes powerful BCH code with t = 2 for data hiding to the DCT coefficients from JPEG images. The presented data hiding technique uses a proposed look up table approach for searching multiple solutions for ternary BCH code with t = 2. The proposed look up table approach enables fast and efficient search for locations of DCT coefficients, which are necessary to modify for hiding data. Presented data hiding technique is the first steganography technique based on ternary BCH code. Experimental results clearly indicate advantages of using ternary BCH compared to binary BCH.

• Journal of Korea Multimedia Society
• /
• v.16 no.8
• /
• pp.954-961
• /
• 2013

To enhance the efficiency of network, content-centric networking (CCN), one of future Internet architectures, allows network nodes to temporally cache transmitted contents and then to directly respond to request messages which are relevant to previously cached contents. Also, since CCN uses a hierarchical content-name, not a host identity like source/destination IP address, for request/response packet routing and CCN request message does not include requester's information for privacy protection, contents-providers/ network nodes can not identify practical requesters sending request messages. So to send back relevant contents, network nodes in CCN records both a request message and its incoming interfaces on Pending Interest Table (PIT). Then the devices refer PIT to return back a response message. If PIT is exhausted, the device can not normally handle request/response messages anymore. Hence, it is needed to detect/react attack to exhaust PIT. Hence, in this paper, we propose improved detection/reaction schemes against attacks to exhaust PIT. In practice, for fine-grained control, this proposal is applied to each incoming interface. Also, we propose the message framework to control attack traffic and evaluate the performance of our proposal.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.84-88
• /
• 2007

In a general tendency that DBMS is used as a tool for storing large size of triple knowledge, it still remains in issue that which DBMS schema should be designed for storing, managing, inferring, and querying the triple knowledge efficiently. In this paper, we present, in the view point of efficient query process, a method that processes a query using Expanded Class-Property Views (ECPV) and, as a result, improvement in response time. The response time of DBMS-based inference systems is proportioned to table size and the number of table join operations. The more query is complex, the more join operations it requires, and the longer response time it requires. ECPV is a table obtained by processing possible join operations before queries. To use ECPV in the query process, SPARQL queries should be converted into corresponding ECPV-based SQL queries. This paper describes the conversion process and shows the improvement in response time by experiments.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1074-1077
• /
• 2002

This paper proposes an adaptive pricing system with scheduling to balance the demand for contents and to realize an effective use of resources in contents delivery networks. In the proposed adaptive pricing system, the table of the service levels and prices (tariff) is shown to each user at the start of service and each user chooses one of the service classes. These prices are decided adaptively reflecting the congestion state of the networks. Then, by the proposed scheduling algorithm, these requests are scheduled so as to keep the service level agreements completely.