• Title/Summary/Keyword: File Cluster

Search Result 114, Processing Time 0.02 seconds

The relationship between the numbers of natural teeth and nutritional status of elderly in Korea -based on 2007~2009 national health and nutrition survey data- (한국 노인의 자연치아 수와 영양소 섭취상태와의 관련성 -2007~2009년 국민건강영양조사 자료에 근거하여-)

  • Shin, Bo-Mi;Bae, Su-Myoung;Ryu, Da-Young;Choi, Yong-Keum
    • Journal of Korean society of Dental Hygiene
    • /
    • v.12 no.3
    • /
    • pp.521-531
    • /
    • 2012
  • Objectives : The aim of this study was to evaluate the relation between the state of dental health(number of natural teeth) and nutritional status of Korean elderly using Korean Dietary Reference Intakes, which was an objective standard for nutritional intake based on database of Korea National Health and Nutrition Examination Survey, large scale of sample obtained by the government. Methods : Complex sampling procedure was used to analyze the fourth data(2007-2009) of Korea National Health and Nutrition Examination Survey. When preparing planning file, the estimator of variance as a stratification variance (variance name : kstrata), population of survey unit as a cluster variance(variance name : PSU), and previous exam and nutritional related weighted as a weighted were analyzed by considering reproduced survey and nutritional related total weighted. Complex samples chi-square test was used to estimate the relation between number of natural teeth and inadequate intake and relation factors included in the model were analyzed by complex samples logistic regression analysis. Results : The group of edentulous had a higher risk to intake less nutrient, except calcium, riboflavin and vitamin C than recommended level comparing to reference group which had natural teeth more than 20(phosphate : OR=1.763; 95% CI=1.273-2.443, thiamine : OR=1.748; 95% CI=1.276-2.395, protein : OR=1.610; 95% CI=1.213-2.138). Conclusions : The number of teeth in Korean elderly over 65 years old had a relation with nutritional status in this investigation. Especially, intake level of nutrients was different between the edentulous group and the reference group. Therefore, dental health care is needed from young and middle age to keep health dental condition for through whole life as well as old age. Although the dental condition of the aged is not good, it is evitable to educate them about the relation between dental health and nutritional ingestion to take balanced nutrition, we think.

A Watermarking Scheme Based on k-means++ for Design Drawings (k-means++ 기반의 설계도면 워터마킹 기법)

  • Lee, Suk-Hwan;Kwon, Ki-Ryong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.5
    • /
    • pp.57-70
    • /
    • 2009
  • A CAD design drawing based on vector data that is very important art work in industrial fields has been considered to content that the copyright protection is urgently needed. This paper presents a watermarking scheme based on k-means++ for CAD design drawing. One CAD design drawing consists of several layers and each layer consists of various geometric objects such as LINE, POLYLINE, CIRCLE, ARC, 3DFACE and POLYGON. POLYLINE with LINE, 3DFACE and ARC that are fundamental objects make up the majority in CAD design drawing. Therefore, the proposed scheme selects the target object with high distribution among POLYLINE, 3DFACE and ARC objects in CAD design drawing and then selects layers that include the most target object. Then we cluster the target objects in the selected layers by using k-means++ and embed the watermark into the geometric distribution of each group. The geometric distribution is the normalized length distribution in POLYLINE object, the normalized area distribution in 3DFACE object and the angle distribution in ARC object. Experimental results verified that the proposed scheme has the robustness against file format converting, layer attack as well as various geometric editing provided in CAD editing tools.

Design and Implementation of Game Server using the Efficient Load Balancing Technology based on CPU Utilization (게임서버의 CPU 사용율 기반 효율적인 부하균등화 기술의 설계 및 구현)

  • Myung, Won-Shig;Han, Jun-Tak
    • Journal of Korea Game Society
    • /
    • v.4 no.4
    • /
    • pp.11-18
    • /
    • 2004
  • The on-line games in the past were played by only two persons exchanging data based on one-to-one connections, whereas recent ones (e.g. MMORPG: Massively Multi-player Online Role-playings Game) enable tens of thousands of people to be connected simultaneously. Specifically, Korea has established an excellent network infrastructure that can't be found anywhere in the world. Almost every household has a high-speed Internet access. What made this possible was, in part, high density of population that has accelerated the formation of good Internet infrastructure. However, this rapid increase in the use of on-line games may lead to surging traffics exceeding the limited Internet communication capacity so that the connection to the games is unstable or the server fails. expanding the servers though this measure is very costly could solve this problem. To deal with this problem, the present study proposes the load distribution technology that connects in the form of local clustering the game servers divided by their contents used in each on-line game reduces the loads of specific servers using the load balancer, and enhances performance of sewer for their efficient operation. In this paper, a cluster system is proposed where each Game server in the system has different contents service and loads are distributed efficiently using the game server resource information such as CPU utilization. Game sewers having different contents are mutually connected and managed with a network file system to maintain information consistency required to support resource information updates, deletions, and additions. Simulation studies show that our method performs better than other traditional methods. In terms of response time, our method shows shorter latency than RR (Round Robin) and LC (Least Connection) by about 12%, 10% respectively.

  • PDF

An Analysis of Big Video Data with Cloud Computing in Ubiquitous City (클라우드 컴퓨팅을 이용한 유시티 비디오 빅데이터 분석)

  • Lee, Hak Geon;Yun, Chang Ho;Park, Jong Won;Lee, Yong Woo
    • Journal of Internet Computing and Services
    • /
    • v.15 no.3
    • /
    • pp.45-52
    • /
    • 2014
  • The Ubiquitous-City (U-City) is a smart or intelligent city to satisfy human beings' desire to enjoy IT services with any device, anytime, anywhere. It is a future city model based on Internet of everything or things (IoE or IoT). It includes a lot of video cameras which are networked together. The networked video cameras support a lot of U-City services as one of the main input data together with sensors. They generate huge amount of video information, real big data for the U-City all the time. It is usually required that the U-City manipulates the big data in real-time. And it is not easy at all. Also, many times, it is required that the accumulated video data are analyzed to detect an event or find a figure among them. It requires a lot of computational power and usually takes a lot of time. Currently we can find researches which try to reduce the processing time of the big video data. Cloud computing can be a good solution to address this matter. There are many cloud computing methodologies which can be used to address the matter. MapReduce is an interesting and attractive methodology for it. It has many advantages and is getting popularity in many areas. Video cameras evolve day by day so that the resolution improves sharply. It leads to the exponential growth of the produced data by the networked video cameras. We are coping with real big data when we have to deal with video image data which are produced by the good quality video cameras. A video surveillance system was not useful until we find the cloud computing. But it is now being widely spread in U-Cities since we find some useful methodologies. Video data are unstructured data thus it is not easy to find a good research result of analyzing the data with MapReduce. This paper presents an analyzing system for the video surveillance system, which is a cloud-computing based video data management system. It is easy to deploy, flexible and reliable. It consists of the video manager, the video monitors, the storage for the video images, the storage client and streaming IN component. The "video monitor" for the video images consists of "video translater" and "protocol manager". The "storage" contains MapReduce analyzer. All components were designed according to the functional requirement of video surveillance system. The "streaming IN" component receives the video data from the networked video cameras and delivers them to the "storage client". It also manages the bottleneck of the network to smooth the data stream. The "storage client" receives the video data from the "streaming IN" component and stores them to the storage. It also helps other components to access the storage. The "video monitor" component transfers the video data by smoothly streaming and manages the protocol. The "video translator" sub-component enables users to manage the resolution, the codec and the frame rate of the video image. The "protocol" sub-component manages the Real Time Streaming Protocol (RTSP) and Real Time Messaging Protocol (RTMP). We use Hadoop Distributed File System(HDFS) for the storage of cloud computing. Hadoop stores the data in HDFS and provides the platform that can process data with simple MapReduce programming model. We suggest our own methodology to analyze the video images using MapReduce in this paper. That is, the workflow of video analysis is presented and detailed explanation is given in this paper. The performance evaluation was experiment and we found that our proposed system worked well. The performance evaluation results are presented in this paper with analysis. With our cluster system, we used compressed $1920{\times}1080(FHD)$ resolution video data, H.264 codec and HDFS as video storage. We measured the processing time according to the number of frame per mapper. Tracing the optimal splitting size of input data and the processing time according to the number of node, we found the linearity of the system performance.