• Korean Journal of Health Education and Promotion
• /
• v.29 no.5
• /
• pp.1-12
• /
• 2012

Objectives: Dietary modifications are common treatment strategies for adults with metabolic syndrome, but it is unclear how often these individuals read food labels. The objective of this study was to examine if adults with metabolic syndrome read food labels when buying packaged foods and to determine factors related to label use. Methods: From the database of the Fifth Korean National Health and Nutrition Examination Survey(KNHANES-V), 1,335 adults with metabolic syndrome and 3,696 those without were selected. Data were analyzed using frequency distributions, $X^2$ test and multiple logistic regression with the SPSS win 18.0 program. Results: Adults with metabolic syndrome read food labels less than individuals without it when they purchase packaged foods(12.5% vs 29.0%). Among those without metabolic syndrome, food label use was significantly higher among participants who were women, younger, educated, and trying to control weight. Conclusions: Strategies to use food label as a diet management tool for metabolic syndrome are needed.

• Journal of KIISE:Software and Applications
• /
• v.26 no.8
• /
• pp.955-963
• /
• 1999

다단계 보안 실시간 데이타베이스 시스템은 데이타베이스의 일관성 유지와 실시간 요구인 마감시간의 만족, 그리고 기밀성을 띤 데이타가 노출될 수 있는 비밀채널(covert-channel)의 방지라는 요구사항을 모두 만족해야 한다. 기존의 SRT-2PL(Secure Real-Time 2 Phase Locking)은 원본과 복사본으로 데이타 객체를 분리시켜 다른 등급간에 불간섭(non-interference)을 유지하여 비밀채널의 방지를 가능하게 하였으나, 복사본이 모든 데이타 객체에 대해 항상 존재하므로 메모리의 낭비가 있을 수 있고, 복사본의 갱신을 위한 갱신 큐의 관리에 따르는 오버헤드와 그에 따른 예측성 결여라는 문제점을 갖고 있다. 이를 개선하기 위하여 본 논문에서는 다단계 보안 실시간 데이타베이스 시스템의 요구사항을 모두 만족하는 동적 복사 프로토콜을 제안한다. 동적 복사 프로토콜은 로킹 기법을 기초로 동작하고, 트랜잭션의 작업에 따라 동적으로 복사본을 생성하고 삭제한다. 모의 실험 결과 제안한 동적 복사 프로토콜은 비밀채널을 방지하고 동적인 복사본의 생성으로 SRT-2PL의 단점인 메모리 낭비를 줄일 수 있으며, 예측성을 높여 마감시간 오류율을 감소시켰다.Abstract Concurrency control of real-time secure database system must satisfy not only logical data consistency but also timing constraints and security requirements associated with transactions. These conflicting natures between timing constraints and security requirements are often resolved by maintaining several versions(or secondary copies) on the same data items. In this paper, we propose a new lock-based concurrency control protocol, Dynamic Copy Security Protocol, ensuring both two conflicting requirements. Our protocol aims for reducing the storage overhead of maintaining secondary copies and minimizing the processing overhead of update history. Main idea of our protocol is to keep a secondary copy only when it is needed to resolve the conflicting read/write operations in real time secure database systems. For doing this, a secondary copy is dynamically created and removed during a transaction's read/write operations according to our protocol. We have also examined the performance characteristics of our protocol through simulation under different workloads while comparing the existing real time security protocol. The results show that our protocol consumed less storage and decreased the missing deadline transactions.

• Journal of Korea Multimedia Society
• /
• v.12 no.2
• /
• pp.165-177
• /
• 2009

Embedded database systems (EDBMS) based on NAND flash memories are widely adopted for logging data on sensor nodes. Since write and erase operations of a flash memory are time consuming compared to read operations and wear memory cells, it is important to reduce these operations to enhance the EDBMS performance and to extend the memory life. In this paper, we propose a delayed write scheme to archive this goal. Proposed scheme stores updated parts of database pages into delayed write records to reduce the database page writes. By doing that, it decreases write and erase operations on a flash memory. Therefore, the proposed scheme enhances the logging performance of a write-intensive EDBMS on a sensor node and extends the flash memory life.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.209-212
• /
• 2001

In this paper, an intelligent notification system has been presented. The system operates on both wired and wireless internet. When a new message has been uploaded in a bulletin board systems(BBS) on HTTP web server, it sends the same message to their cellular phones of all members of a given group at the same time via SMS(Short Message Service). In addition, on reading SMS message, those who read them respond to a WAP server using pulling technique via wireless internet. Therefore, the HTTP server does know the members who did not read the message yet. Two different web servers, the HTTP server and the WAP server, running on a single system has been implemented. They share the single database which covers al1 related information about the BBS. The set of experiments shows that the notification system works well as we have expected Thus, we conclude that the proposed system that operates on both wired and wireless internet is the one of successful model for such environments.

• Transactions of the Society of Information Storage Systems
• /
• v.6 no.2
• /
• pp.41-46
• /
• 2010

Recently, Flash Memory Drives are one of the best media to support portable and desktop computers' storage devices. Their features include non-volatility, low power consumption, and fast access time for read operations, which are sufficient to present flash memories as major database storage components for desktop and server computers. However, we need to improve traditional storage management schemes based on HDD(Hard Disk Drive) and RAID(Redundant Array of Independent Disks) due to the relatively slow or freezing characteristics of write operations of SSDs, as compared to fast read operations. In order to achieve this goal, we propose a new storage management scheme called Hetero-Mirroring based on traditional HDD mirroring scheme. Hetero-Mirroring-based storage management improves RAID-1 operation performance by balancing write-workloads and delaying write operations to avoid SSD freezing.

• Journal of Korea Multimedia Society
• /
• v.13 no.9
• /
• pp.1299-1313
• /
• 2010

Top-k queries return k objects that users most want in the database. The Partitioned-Layer Index (simply, the PL -index) is a representative method for processing the top-k queries efficiently. The PL-index partitions the database into a number of smaller databases, and then, for each partitioned database, constructs a list of sublayers over the partitioned database. Here, the $i^{th}$ sublayer in the partitioned database has the objects that can be the top-i object in the partitioned one. To retrieve top k results, the PL-index merges the sublayer lists depending on the user's query. The PL-index has the advantage of reading a very small number of objects from the database when processing the queries. However, since many random accesses occur in merging the sublayer lists, query performance of the PL-index is not good in environments like disk-based databases. In this paper, we propose the Abstracted Partitioned-Layer Index (simply, the APL-index) that significantly improves the query performance of the PL-index in disk-based environments by reducing the number of random accesses. First, by abstracting each sublayer of the PL -index into a virtual (point) object, we transform the lists of sublayers into those of virtual objects (ie., the APL-index). Then, we virtually process the given query by using the APL-index and, accordingly, predict sublayers that are to be read when actually processing the query. Next, we read the sublayers predicted from each sublayer list at a time. Accordingly, we reduce the number of random accesses that occur in the PL-index. Experimental results using synthetic and real data sets show that our APL-index proposed can significantly reduce the number of random accesses occurring in the PL-index.

• The KIPS Transactions:PartD
• /
• v.9D no.1
• /
• pp.11-20
• /
• 2002

We propose a new concurrency control algorithm for enhancing the degree of parallelism of the transactions in fully replicated databases designed to improve the availability and the reliability. The update transactions can be logically decomposed of a read-only transaction and a write-only transaction. In our algorithm, a set of read operations of an update transaction is treated as a read-only transaction and the read-only transaction reads data items in the site to which it is submitted. And a set of write operations of the update transaction is treated as a write-only transaction and it is submitted to all corresponding sites after the update transaction has been completed. By using the proposed update protocol, all write-only transactions can execute at all sites atomically. The proposed algorithm can have transactions execute concurrently at the site to which they are submitted and, after the completion of each transaction, the update protocol is performed for updating their data items and checking their serializability. Therefore, the degree of parallelism of the transactions can be improved. Especially, if the probability of conflict among transactions is low, we can expect the higher degree of their parallelism.

• Journal of Community Nutrition
• /
• v.7 no.2
• /
• pp.107-113
• /
• 2005

This study was conducted to develop a web expert system for nutrition counseling and menu management. This program manipulates a food, dish and menu and search database that has been developed. Clients can select a recommended general and therapeutic menu using this system. The web expert system can analyze nutrients in menus and compare nutrient contents of menus with Korean Recommended Dietary Allowances. It can access the food, dish and menu database. The expert menu database can insert, store and generate the synthetic information of age, sex, and therapeutic purpose of disease. With investigation and analysis of the client's needs, the menu planning program on the internet has been continuously developed. This system consists of the database that reaches to the food composition, the dishes and the menu. Clients can search food composition and conditional food based on nutrient name and amounts. This system is able to draw up the food with its order in dish. The menu planning can be organized and nutrients analysis can be compared with Korea Recommended Allowance. This system is able to read the nutrient composition of the each food, the dish and the menu. The results of analysis is presented quickly and accurately. Therefore it can be used by not only usual people but also dietitians and nutritionists who take charge of making a menu and experts in the field of food and nutrition. It is expected that the web expert system can be useful of nutrition education, nutrition counseling and expert menu management.

• Journal of Korean Society of Archives and Records Management
• /
• v.21 no.1
• /
• pp.249-255
• /
• 2021

The Korea Democracy Foundation's archives offer its collection of records about Korean democratization movements through "Open-Archives," allowing users to read and use them conveniently. One particular article aimed to promote an overall understanding of its photo database to offer more promising services through the "Open-Archives." Similarly, many different archives hold photographic records, but they have difficulty releasing them to the public. Therefore, the present study introduced the case of Korea Democracy Foundation's project of building a photo database for Tony Chung in 2019-2020 to improve its establishment process, significance, and future tasks.

• Proceedings of the Korea Contents Association Conference
• /
• 2014.11a
• /
• pp.33-34
• /
• 2014

이 논문에서는 클라우드 데이터베이스를 위한 분리수행이 가능한 트랜잭션 처리시스템을 제안한다. 제안하는 시스템은 기존의 클라우드 데이터베이스의 수정을 최소화 하면서 트랜잭션 처리가 가능하도록 할수 있다. 질의를 클라우드 데이터베이스의 CRUD(Create, Read, Update, Delete) 연산의 조합으로 변환하여 수행시킴으로써 동시성제어와 장애복구에 관한 기능을 제공한다.