• Title/Summary/Keyword: 판단트리

Search Result 214, Processing Time 0.033 seconds

A Comparison on Dry Matter Yield and Feed Value of Winter Forage Crops Cultivated after Rice Harvest in the Central Inland Region (중부내륙지방에서 벼 수확 후 재배한 월동 사료작물들의 생산성 및 사료가치 비교)

  • Lee, Sang Moo
    • Journal of The Korean Society of Grassland and Forage Science
    • /
    • v.39 no.1
    • /
    • pp.31-38
    • /
    • 2019
  • This study was carried out to investigate the growth characteristics, yield, and chemical compositions of winter forage crops cultivated after rice harvest in the central inland region. The experimental design was arranged in a randomized block design with three replications. The treatments consisted of 4 species (Rye, Oat, Triticale and Italian ryegrass), and varieties were "Marton", "Donghan", "Shinyoung" and "Kowinnearly", respectively. As a result, dry matter yield and TDN yield were higher in rye than in the other winter forage crops, and lowest in Oat(p<0.05). Crude protein and crude fat content were significantly higher in Italian ryegrass(p<0.05). However, Crude ash and ADF content did not show significant difference among winter forage crops. NDF content was higher in order of Rye > Triticale > Oat > Italian ryegrass(p<0.05). TDN and total amino acid content (EAA+NEAA) were higher in order of winter forage crop with high crude protein content (Italian ryegrass > Oat > Triticale > Rye). Total mineral content was higher in order of Rye > Triticale > Oat > Italian ryegrass(p<0.05), and total free sugar content was higher in order of Oat > Italian Ryegrass > Triticale > Rye(p<0.05). Compared with the results above, Italian ryegrass and Oat are high in crude protein, TDN, amino acid and free sugar content. Rye and Triticale have the merit that feed value is decreased but high yield(dry matter and TDN yield) can be maintained. Therefore, it is advantageous to grow Rye and Triticale as winter forage crops after rice harvest in the central inland region.

Classification of False Alarms based on the Decision Tree for Improving the Performance of Intrusion Detection Systems (침입탐지시스템의 성능향상을 위한 결정트리 기반 오경보 분류)

  • Shin, Moon-Sun;Ryu, Keun-Ho
    • Journal of KIISE:Databases
    • /
    • v.34 no.6
    • /
    • pp.473-482
    • /
    • 2007
  • Network-based IDS(Intrusion Detection System) gathers network packet data and analyzes them into attack or normal. They raise alarm when possible intrusion happens. But they often output a large amount of low-level of incomplete alert information. Consequently, a large amount of incomplete alert information that can be unmanageable and also be mixed with false alerts can prevent intrusion response systems and security administrator from adequately understanding and analyzing the state of network security, and initiating appropriate response in a timely fashion. So it is important for the security administrator to reduce the redundancy of alerts, integrate and correlate security alerts, construct attack scenarios and present high-level aggregated information. False alarm rate is the ratio between the number of normal connections that are incorrectly misclassified as attacks and the total number of normal connections. In this paper we propose a false alarm classification model to reduce the false alarm rate using classification analysis of data mining techniques. The proposed model can classify the alarms from the intrusion detection systems into false alert or true attack. Our approach is useful to reduce false alerts and to improve the detection rate of network-based intrusion detection systems.

Unusual data local access using inverse order tree (역순트리를 이용한 특이데이터 국소적 접근)

  • Rim, Kwang-Cheol;Seol, Jung-Ja
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.3
    • /
    • pp.595-601
    • /
    • 2014
  • With the advent of the Smart information-communication era, the number of data has increased exponentially. Accordingly, figuring out and analyzing in which area and circumstance the data has been created becomes one of the factors for prompt actions. In this paper identifies how to analyze the data by implementing a route from the lowest module to highest one in an inverse order for the part judgement for the particular data. The script first identifies cluster analisys, paralizes the analysis using the sum of each factors of the cluster with the tree structure, and finally transpose the answer into number. Also, it is designed to place priority on particular answer, thereafter, draws the wanted answer real-time.

Biological Characteristics and Current Status of Nutria (Myocastor coypus) Introduced in Jeju Island (제주도에 도입된 뉴트리아(Myocastor coypus)의 생물학적 특성 및 서식 현황)

  • Kim, Ga-Ram;Oh, Hong-Shik
    • Journal of Environmental Impact Assessment
    • /
    • v.26 no.1
    • /
    • pp.1-10
    • /
    • 2017
  • The study was carried out to understand the inhabiting status and biological features of nutria (Myocastor coypus) in the Jeju Island from May, 2013 to August, 2016. Five individuals were captured by traps and two individuals were collected in dead. Of the 7 individuals, those whose bio-information could not be known were excluded to perform autopsy of the rest of them. The results from morphological, cranial and anatomical analyses, it was found that the females achieved sexual maturation but had no breeding experience. An adult male showed similar sizes to those found in the Korean Peninsula. After collecting the 7 individuals in 2013, 1 nutria individual was filmed by the scouting camera in May, 2014 but not captured. The long-term investigation of the research area found no inhibiting individual. It is deemed the nutria was either died of natural death or migrated. In order to establish a proper nutria control, the environmental characteristics of Jeju Island should be considered where indigenous and introduced species coexist in a limited space. Our findings will provide helpful information for understanding biological features of nutria and planning protection program of natural ecosystems of Jeju Island.

Barrier Option Pricing with Binomial Trees Applying Generalized Catalan Numbers (이항분포모형에 일반화된 카탈란 수를 적용한 배리어 옵션의 가격 산정)

  • Choi, Seung-il
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.12
    • /
    • pp.226-231
    • /
    • 2016
  • Binomial trees are used to price barrier options. Since barrier options are path dependent, option values of each node are calculated from binomial trees using backward induction. We use generalized Catalan numbers to determine the number of cases not reaching a barrier. We will generalize Catalan numbers by imposing upper and lower bounds. Reaching a barrier in binomial trees is determined by the difference between the number of up states and down states. If we count the cases that the differences between the up states and down states remain in a specific range, the probability of not reaching a barrier is obtained at a final node of the tree. With probabilities and option values at the final nodes of the tree, option prices are computable by discounting the expected option value at expiry. Without calculating option values in the middle nodes of binomial trees, option prices are computable only with final option values. We can obtain a probability distribution of exercising an option at expiry. Generalized Catalan numbers are expected to be applicable in many other areas.

Fast Join Mechanism that considers the switching of the tree in Overlay Multicast (오버레이 멀티캐스팅에서 트리의 스위칭을 고려한 빠른 멤버 가입 방안에 관한 연구)

  • Cho, Sung-Yean;Rho, Kyung-Taeg;Park, Myong-Soon
    • The KIPS Transactions:PartC
    • /
    • v.10C no.5
    • /
    • pp.625-634
    • /
    • 2003
  • More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

An Efficient Snapshot Technique for Shared Storage Systems supporting Large Capacity (대용량 공유 스토리지 시스템을 위한 효율적인 스냅샷 기법)

  • 김영호;강동재;박유현;김창수;김명준
    • Journal of KIISE:Databases
    • /
    • v.31 no.2
    • /
    • pp.108-121
    • /
    • 2004
  • In this paper, we propose an enhanced snapshot technique that solves performance degradation when snapshot is initiated for the storage cluster system. However, traditional snapshot technique has some limits adapted to large amount storage shared by multi-hosts in the following aspects. As volume size grows, (1) it deteriorates crucially the performance of write operations due to additional disk access to verify COW is performed. (2) Also it increases excessively the blocking time of write operation performed during the snapshot creation time. (3)Finally, it deteriorates the performance of write operations due to additional disk I/O for mapping block caused by the verification of COW. In this paper, we propose an efficient snapshot technique for large amount storage shared by multi-hosts in SAN Environments. We eliminate the blocking time of write operation caused by freezing while a snapshot creation is performing. Also to improve the performance of write operation when snapshot is taken, we introduce First Allocation Bit(FAB) and Snapshot Status Bit(SSB). It improves performance of write operation by reducing an additional disk access to volume disk for getting snapshot mapping block. We design and implement an efficient snapshot technique, while the snapshot deletion time, improve performance by deallocation of COW data block using SSB of original mapping entry without snapshot mapping entry obtained mapping block read from the shared disk.

Dynamic Cache Management Scheme on Demand-Based FTL Considering Data Access Pattern (데이터 접근 패턴을 고려한 요구 기반 FTL 내 캐시의 동적 관리 기법)

  • Lee, Bit-Na;Song, Nae-Young;Koh, Kern
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06a
    • /
    • pp.547-550
    • /
    • 2011
  • 플래시 메모리는 낮은 전력 소비와 높은 성능으로 인해 휴대용 기기에 널리 사용되고 있다. FTL은 플래시 내 자료를 관리하는 소프트웨어 계층으로 플래시 전체의 성능에 영향을 끼친다. 그 중 페이지 레벨 매핑 기법을 적용한 FTL은 유연성이 높고 속도가 빠르나 주소 변환 테이블의 크기가 큰 단점이 있다. 이를 해결하기 위해 자주 접근되는 영역의 매핑 주소만을 매핑 테이블 캐시에 올려놓는 Demand-based FTL(DFTL)이 제안되었다. DFTL 에서는 CMT(Cache Mapping Table)의 참조율이 떨어지는 경우 빈번한 플래시 메모리 접근 오버헤드가 발생하게 된다. 이러한 문제는 흔히 발생하는 일반적인 순차 접근에서조차 문제가 된다. 이에 본 논문에서는 저장 장치의 접근 패턴을 예측하여 CMT의 참조 엔트리를 미리 읽어오는 기법을 제안한다. 제안하는 기법은 저장 장치 접근 패턴의 순차성을 판단하여 연속된 매핑 주소를 미리 CMT에 올려놓고, 읽어오는 매핑 주소 엔트리의 양은 동적으로 관리한다. 추가적으로 CMT에서 발생하는 스래싱(thrashing) 을 파악하기 위해 쫓겨나는 희생 엔트리의 접근 여부를 분석하여 이를 활용하였다. 실험 결과에서 본 기법은 기존의 DFTL에 비해 약간의 공간 오버헤드와 함께 평균 50% 증가한 참조율을 보였다.

Telemetry Data Recovery Method Using Multiple PCM Data (다중 PCM 데이터를 이용한 텔레메트리 데이터 복구 방법)

  • Jung, Haeseung;Kim, Joonyun
    • Aerospace Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.96-102
    • /
    • 2012
  • Recently, interests about frame error reduction method, using multiple PCM data which are received at several ground stations, are increasing. Simple data merge method is already applied to data processing system at Naro Space Center and have been used in the first and the second flight test analysis of KSLV-I. This paper is focused on error reduction with error correcting merge algorithm and time-delayed data correction algorithm. Result of applying the proposed algorithms to the flight test data shows 1.32% improvement in error rate, compared to simple-data-merge method. It is considered that presented algorithms could be very useful in generating various telemetry merge data.

Defects Detection of the Underground Distribution Power Cables by Very Low Frequency Voltage Source (초저주파전원을 이용한 지중배전 전력케이블의 결함검출)

  • 김주용;송일근
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.12 no.3
    • /
    • pp.45-50
    • /
    • 1998
  • This paper presents experimental results on the application of very low frequency(VLF) voltage to replace conventional DC test as an after laying test for underground distribution cables. We carried out several tests to prove defects detecting ability of VLF test on the 5m length real cables having knife-cut or needle type defects which is made in our La.. Through this experiment we proved it is very difficult to initiate electrical tree from the defects inside of the cable insulation but once the electrical tree is initiated it grows very fast and VLF does not make new defects and expand the defect. Therefore VLF test equipment for quality inspection test of manufacture is more effective than field application for underground distribution cables.

  • PDF