• Title/Summary/Keyword: 테이블 모델

Search Result 270, Processing Time 0.02 seconds

A Statistical Study on Sikryo-chanryo by Applying Database (데이터베이스를 이용한 식료찬요(食療纂要)의 통계적 연구)

  • Lee, Byung Wook;Kim, Ki Wook;Hwang, Su-Jung
    • Culinary science and hospitality research
    • /
    • v.21 no.4
    • /
    • pp.251-270
    • /
    • 2015
  • This study was, based on traditional know-how indigenous to Korea, to systemize the knowledge on how to improve health by dining, and to make the best of it statistically. For this purpose, the knowledge in the Sikryo-chanryo(食療纂要), in Korean pronunciation and Siglyochan-yo in Chinese characters, which is an old text referring to diet therapy peculiar to Korea, was compiled into a database and analyzed statistically. Data processing was used as a 'Relational data model'. In addition, we have used nine data table to express diet therapy peculiar to Korea in the Siglyochan-yo. The software used for data construction was Microsoft Access 2014. As a result, the Sikryo-chanryo database, which can provide information on both disease treatment by food, medicines, and gourmet ingredients applicable to every kind of symptom, as well as the names of disease, was set up at in a PC interface. By employing the 'Relational data model', we can replace researching in the conventional method by employing the database.

Real-Time Simulation of Single and Multiple Scattering of Light (빛의 단일 산란과 다중 산란의 실시간 시뮬레이션 기법)

  • Ki, Hyun-Woo;Lyu, Ji-Hye;Oh, Kyoung-Su
    • Journal of Korea Game Society
    • /
    • v.7 no.2
    • /
    • pp.21-32
    • /
    • 2007
  • It is significant to simulate scattering of light within media for realistic image synthesis; however, this requires costly computation. This paper introduces a practical image-space approximation technique for interactive subsurface scattering. We use a general two-pass approach, which creates transmitted irradiance samples onto shadow maps and computes illumination using the shadow maps. We estimate single scattering efficiently using a method similar to common shadow mapping with adaptive deterministic sampling. A hierarchical technique is applied to evaluate multiple scattering, based on a diffusion theory. We further accelerate rendering speed by tabulating complex functions and utilizing level of detail. We demonstrate that our technique produces high-quality images of animated scenes with blurred shadow at hundreds frames per second on graphics hardware. It can be integrated into existing interactive systems easily.

  • PDF

Analysis and Design of Functional Blocks for IIPv4/IPv6 Protocol and Address Translation (IPv4/IPv6 프로토콜 및 주소변환 기능의 요소기술 분석 및 설계)

  • 이승민;진재경;민상원
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.1
    • /
    • pp.117-125
    • /
    • 2003
  • IPv6 (IP version 6), which was standardized by the IETF (Internet Engineering Task Force) to cope with existing IPv4 problems, needs several approaches for interoperation with IPv4. The internetworking of IPv6 with IPv4 is an important key to the deployment of the next generation Internet. As the solutions to the transition mechanism, both tunneling and translator methods have been proposed. In this paper, we analyze functional elements for implementation design of a transition mechanism based on the NAT-PT (NAT-Protocol Translation), and propose an extension algorithm that uses ports for effective use of global IPv4 addresses. The algorithm presented in this paper is a method of combining NAT-PT with Port Translation mechanism. The algorithm does not assign an IPv4 address to the host that needs IPv4 address, but allocates a single temporary IPv4 address and a port number in order to identify host.

Automatic Augmentation Technique of an Autoencoder-based Numerical Training Data (오토인코더 기반 수치형 학습데이터의 자동 증강 기법)

  • Jeong, Ju-Eun;Kim, Han-Joon;Chun, Jong-Hoon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.5
    • /
    • pp.75-86
    • /
    • 2022
  • This study aims to solve the problem of class imbalance in numerical data by using a deep learning-based Variational AutoEncoder and to improve the performance of the learning model by augmenting the learning data. We propose 'D-VAE' to artificially increase the number of records for a given table data. The main features of the proposed technique go through discretization and feature selection in the preprocessing process to optimize the data. In the discretization process, K-means are applied and grouped, and then converted into one-hot vectors by one-hot encoding technique. Subsequently, for memory efficiency, sample data are generated with Variational AutoEncoder using only features that help predict with RFECV among feature selection techniques. To verify the performance of the proposed model, we demonstrate its validity by conducting experiments by data augmentation ratio.

A White Box Implementation of Lightweight Block Cipher PIPO (경량 블록 암호 PIPO의 화이트박스 구현 기법)

  • Ham, Eunji;Lee, Youngdo;Yoon, Kisoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.32 no.5
    • /
    • pp.751-763
    • /
    • 2022
  • With the recent increase in spending growth in the IoT sector worldwide, the importance of lightweight block ciphers to encrypt them is also increasing. The lightweight block cipher PIPO algorithm proposed in ICISC 2020 is an SPN-structured cipher using an unbalanced bridge structure. The white box attack model refers to a state in which an attacker may know the intermediate value of the encryption operation. As a technique to cope with this, Chow et al. proposed a white box implementation technique and applied it to DES and AES in 2002. In this paper, we propose a white box PIPO applying a white box implementation to a lightweight block cipher PIPO algorithm. In the white box PIPO, the size of the table decreased by about 5.8 times and the calculation time decreased by about 17 times compared to the white box AES proposed by Chow and others. In addition, white box PIPO was used for mobile security products, and experimental results for each test case according to the scope of application are presented.

A Study on Establishment of the Levee GIS Database Using LiDAR Data and WAMIS Information (LiDAR 자료와 WAMIS 정보를 활용한 제방 GIS 데이터베이스 구축에 관한 연구)

  • Choing, Yun-Jae
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.17 no.3
    • /
    • pp.104-115
    • /
    • 2014
  • A levee is defined as an man-made structure protecting the areas from temporary flooding. This paper suggests a methodology for establishing the levee GIS database using the airborne topographic LiDAR(Light Detection and Ranging) data taken in the Nakdong river basins and the WAMIS(WAter Management Information System) information. First, the National Levee Database(NLD) established by the USACE(United States Army Corps Engineers) and the levee information tables established by the WAMIS are compared and analyzed. For extracting the levee information from the LiDAR data, the DSM(Digital Surface Model) is generated from the LiDAR point clouds by using the interpolation method. Then, the slope map is generated by calculating the maximum rates of elevation difference between each pixel of the DSM and its neighboring pixels. The slope classification method is employed to extract the levee component polygons such as the levee crown polygons and the levee slope polygons from the slope map. Then, the levee information database is established by integrating the attributes extracted from the identified levee crown and slope polygons with the information provided by the WAMIS. Finally, this paper discusses the advantages and limitations of the levee GIS database established by only using the LiDAR data and suggests a future work for improving the quality of the database.

An Interoperable Mapping Model between SEP 2.0 & OpenADR 2.0b for ICT Grid Convergence (ICT 전력 융합을 위한 SEP 2.0과 OpenADR 2.0b간의 상호운용 매핑 모델)

  • Choi, Min-Young;Lee, June-Kyoung;Lee, Kyoung-Hak
    • Journal of the Korea Convergence Society
    • /
    • v.8 no.8
    • /
    • pp.41-49
    • /
    • 2017
  • The 'NIST Framework and Road Map for Smart Grid Interoperability Standards' proposes an architecture framework to secure the direction of development and standard interoperability of smart grid and provides a list of identified standard, standard cyber security strategies, and certification framework. In particular, SEP 2.0 and OpenADR 2.0 are the examples. SEP 2.0 and OpenADR 2.0 can functionally link HEMS and Smart Grid, but interoperability standards between the two protocols are not planned in above document. The OpenADR Alliance also announced that work is underway to define mapping tables for interoperability between OpenADR 2.0 and SEP 2.0, but no information is yet available. Therefore, In this paper, in developing energy efficiency improvement HEMS, we propose a mapping model that supports syntactic and semantic founded interoperability between SEP 2.0 and OpenADR 2.0b for ICT grid convergence based on the standard specification document of each protocol and confirmed through an example of the semantic mapping function based on the demand response service scenario.

Comparative Study of Machine learning Techniques for Spammer Detection in Social Bookmarking Systems (소셜 복마킹 시스템의 스패머 탐지를 위한 기계학습 기술의 성능 비교)

  • Kim, Chan-Ju;Hwang, Kyu-Baek
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.5
    • /
    • pp.345-349
    • /
    • 2009
  • Social bookmarking systems are a typical web 2.0 service based on folksonomy, providing the platform for storing and sharing bookmarking information. Spammers in social bookmarking systems denote the users who abuse the system for their own interests in an improper way. They can make the entire resources in social bookmarking systems useless by posting lots of wrong information. Hence, it is important to detect spammers as early as possible and protect social bookmarking systems from their attack. In this paper, we applied a diverse set of machine learning approaches, i.e., decision tables, decision trees (ID3), $na{\ddot{i}}ve$ Bayes classifiers, TAN (tree-augment $na{\ddot{i}}ve$ Bayes) classifiers, and artificial neural networks to this task. In our experiments, $na{\ddot{i}}ve$ Bayes classifiers performed significantly better than other methods with respect to the AUC (area under the ROC curve) score as veil as the model building time. Plausible explanations for this result are as follows. First, $na{\ddot{i}}ve$> Bayes classifiers art known to usually perform better than decision trees in terms of the AUC score. Second, the spammer detection problem in our experiments is likely to be linearly separable.

Embedded System Reliability Measurement Use Markov Chain Model (마르코프 체인 모델을 이용한 임베디드 시스템 신뢰도 측정)

  • Kawk Dong-Gyu;Cho Yong-Yoon;Park Ho-Byung;Yoo Chea-Woo
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.433-435
    • /
    • 2005
  • 임베디드 시스템은 다수의 디바이스를 컨트롤하여 시스템의 목적을 수행한다. 최근 임베디드 시스템의 요구사항이 증가함에 따라 하나의 임베디드 소프트웨어가 컨트롤하는 디바이스의 종류가 다양해지고 수도 증가하는 추세이다. 다수의 디바이스를 가지고 있는 임베디드 시스템에서 시스템의 신뢰도는 각 디바이스의 신뢰도에 많은 영향을 받는다. 본 논문은 임베디드 시스템의 신뢰도를 측정하기 위해서 통계적 신뢰도 측정 방법 중 한 가지인 마르코프 체인을 이용한 방법을 제안한다. 마르코프 체인은 여러 분야에서 복잡한 시스템을 단순화하여 모델링하고 과거의 변화를 토대로 미래를 예측할 수 있는 방법을 제공한다. 또한 전체 시스템의 확률을 행렬로 계측할 수 있는 방법을 가지고 있어 특정 부분의 확률이 전체 시스템의 확률에 미치는 영향을 산술적으로 계산할 수 있는 장점을 가지고 있다. 본 논문에서 제안하는 임베디드 소프트웨어 마르코프 체인은 테스트 대상 소스를 분석하여 디바이스를 컨트롤하는 루틴과 에러를 핸들링하는 루틴, 일반적인 루틴으로 나누어 각각을 상태로 정의한다. 정의한 각 상태간의 전이는 통계적으로 측정한 디바이스 신뢰도를 확률로 표현한다. 마르코프 체인을 이용하여 임베디드 시스템의 신뢰도를 측정하기 위한 시스템은 소스 분석기와 신뢰도 측정기로 나누어 설계한다. 소스 분석기는 테스트 대상이 되는 소스와 디바이스 드라이버 라이블러리 테이블을 입력으로 하고 소프트웨어의 마르코프 체인을 출력으로 한다 마르코프 체인은 행렬로 표현하고 연산하여 시스템의 신뢰도를 측정한다. 제안하는 시스템의 신뢰도 측정 방법은 부분이 가지고 있는 신뢰도가 전체 신뢰도에 미치는 영향을 산술적으로 측정할 수 있어 시스템이 요구하는 신뢰도에 접근할 수 있는 방법과 근거를 제공하는 장점이 있다.소시키는 장점을 갖는다.것으로 조사되었으며 40대 이상의 연령층은 점심비용으로 더 많은 지출을 하고 있는 것으로 나타났다. 4) 끼니별 한식에 대한 선호도는 아침식사의 경우가 가장 높았으며, 이는 40대와 50대에서 높게 나타났다. 점심 식사로 가장 선호되는 음식은 중식, 일식이었으며 저녁 식사에서 가장 선호되는 메뉴는 전 연령층에서 일식, 분식류 이었으며, 한식에 대한 선택 정도는 전 연령층에서 매우 낮게 나타났다. 5) 각 연령층에서 선호하는 한식에 대한 조사에서는 된장찌개가 전 연령층에서 가장 높은 선호도를 나타내었고, 김치는 40대 이상의 선호도가 30대보다 높게 나타났으며, 흥미롭게도 30세 이하의 선호도는 30대보다 높게 나타났다. 그 외에도 떡과 죽에 대한 선호도는 전 연령층에서 낮게 조사되었다. 장아찌류의 선호도는 전 연령대에서 낮았으며 특히 30세 이하에서 매우 낮게 조사되었다. 한식의 맛에 대한 만족도 조사에서는 연령이 올라갈수록 한식의 맛에 대한 만족도는 낮아지고 있었으나, 한식의 맛에 대한 만족도가 높을수록 양과 가격에 대한 만족도는 높은 경향을 나타내었다. 전반적으로 한식에 대한 선호도는 식사 때와 식사 목적에 따라 연령대 별로 다르게 나타나고 있으나, 선호도는 성별이나 세대에 관계없이 폭 넓은 선호도를 반영하고 있으며, 이는 대학생들을 대상으로 하는 연구 등에서도 나타난바 같다. 주 5일 근무제의 확산과 초 중 고생들의 토요일 휴무와 더불어 여행과 엔터테인먼트산업은 더욱 더 발전을 거듭하고 있으며, 외식은 여행과 여가 활동의 필수적인 요소로써 그 역할을 일조하고 있다. 이와 같은 여가시간의 증가는 독신자들에게는 좀더 많은 여유시간을 가족을 이루고 있는 가족구성원들에게는 가족과의 유대를 강화하는 휴식과 오락의 소비 트렌드를 창출시켰

  • PDF

Implementation of the Agent using Universal On-line Q-learning by Balancing Exploration and Exploitation in Reinforcement Learning (강화 학습에서의 탐색과 이용의 균형을 통한 범용적 온라인 Q-학습이 적용된 에이전트의 구현)

  • 박찬건;양성봉
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.7_8
    • /
    • pp.672-680
    • /
    • 2003
  • A shopbot is a software agent whose goal is to maximize buyer´s satisfaction through automatically gathering the price and quality information of goods as well as the services from on-line sellers. In the response to shopbots´ activities, sellers on the Internet need the agents called pricebots that can help them maximize their own profits. In this paper we adopts Q-learning, one of the model-free reinforcement learning methods as a price-setting algorithm of pricebots. A Q-learned agent increases profitability and eliminates the cyclic price wars when compared with the agents using the myoptimal (myopically optimal) pricing strategy Q-teaming needs to select a sequence of state-action fairs for the convergence of Q-teaming. When the uniform random method in selecting state-action pairs is used, the number of accesses to the Q-tables to obtain the optimal Q-values is quite large. Therefore, it is not appropriate for universal on-line learning in a real world environment. This phenomenon occurs because the uniform random selection reflects the uncertainty of exploitation for the optimal policy. In this paper, we propose a Mixed Nonstationary Policy (MNP), which consists of both the auxiliary Markov process and the original Markov process. MNP tries to keep balance of exploration and exploitation in reinforcement learning. Our experiment results show that the Q-learning agent using MNP converges to the optimal Q-values about 2.6 time faster than the uniform random selection on the average.