• Title/Summary/Keyword: Covering method

Search Result 634, Processing Time 0.026 seconds

Studies on the suppression of transmission of anthracnose with covering method and environment friendly agricultural materials (EFAM) in pepper field

  • Kang, B.R.;Ko, S.J.;Kim, D.I.;Choi, D.S.;Kim, J.D.;Choi, K.J.
    • Korean Journal of Organic Agriculture
    • /
    • v.19 no.spc
    • /
    • pp.291-294
    • /
    • 2011
  • We studies a model for management of pepper anthracnose based covering method and spraying system in field. 1. Among 82 organic fungicides, 42 materials showed most effective inhibition against mycelia growth of the Colletotrichum acutatum in vitro. 23 formulated biocontrol agents were chosen to control the disease from 42 biocontrol agents in greenhouse. In the end, five kinds (2 plant extracts, 2 biopesiticides, 1 Bordeaux mixture) were selected from 23 materials in the field. 2. The mulching materials of bed covering in fruit season were thin non-woven fabric sheet and black plastic. The use of a fabric sheet was reduced the spread of anthracnose as compared to the plastic covering. 3. The application with the chosen materials was reduced 34% of anthracnose for 7 times sprays to planting 70 days as compared to the untreated control. In yield, nonwoven fabric sheet with formulated biopesticides was increased 17% than black plastic. 4. This result indicated that the developed biocontrol strategy could be an effective and economic crop protection system in organic pepper cultivation field.

A Study on the Adaptation of 'YURAGI theory' of Wall Covering (크로스벽재에 대한 'YURAGI이론' 적용가능성에 관한 고찰연구)

  • Park Chan-Don;Kim Byeong-Joo
    • Journal of the Korean housing association
    • /
    • v.16 no.4
    • /
    • pp.57-64
    • /
    • 2005
  • The purpose of this paper is to find out and to show that the probability of the adaption of YURAGI theory of wall covering in interior design. By using personal computer, visible image of wall covering is inputted to a computer program as 'bmp' file, Windows bitmap file format, for Fourier transform. The evaluation indexes such as 'Map', 'YURAGI coefficient', 'Rest error', and 'Linearity' are defined to display the analytical result. The result of this study is shown by visual image and numerical value. As a result of this paper, we can understand that the psychological evaluations about wall coverings are different according to the YURAGI coefficient which came out by fluctuation analysis method as YURAGI theory. So, now we are able to know that the adaptation of YURAGI theory is very useful at psychological evaluation about wall covering.

Temperature History of Concrete According to the Covering Method of Double Layer Bubble Sheet (이중버블시트의 포설방법에 따른 콘크리트의 온도이력특성)

  • Baek, Dae-Hyun;Son, Ho-Jung;Hong, Seak-Min;Han, Min-Cheol;Han, Cheon-Goo
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2010.05a
    • /
    • pp.71-72
    • /
    • 2010
  • The study is compared temperature history and strength of concrete followed by covering method of insulation curing of cold weather concrete with double bubble sheet. The results were as follows. First of all, in temperature history of concrete, the internal temperature of concrete fell down to $0^{\circ}C$ before/after 60 hours, having nothing to do with covering method. The study could see that, when sheet was isolated, it fell down to low temperature quickly in early curing. When the study measured compressive strength of core specimen, there were no large differences among placing methods. However, compressive strength fell down in all ages when sheet was isolated.

  • PDF

Evaluation of Soil Loss According to Surface Covering and Tillage Methods in Corn Cultivation

  • Lee, Jeong-Tae;Lee, Gye-Jun;Ryu, Jong-Soo;Kim, Jeom-Soon;Han, Kyung-Hwa;Park, Seok-Ho
    • Korean Journal of Soil Science and Fertilizer
    • /
    • v.46 no.6
    • /
    • pp.510-518
    • /
    • 2013
  • Corn was mainly cultivated in slope land during summer season when heavy rain falls so that soil loss occurs severely. Especially, soil disturbance and exposure of topsoil by conventional tillage intensifies soil loss by heavy rain. The aim of this study was to develop surface covering and tillage methods for reducing soil loss in corn cultivation. The experiment was conducted in 17% sloped lysimeter with 8 treatments including strip tillage after surface covering with rye residue, strip tillage after residue covering of several crops and sod culture, black polyethylene film covering after conventional tillage and control. Amount of runoff water and eroded soil, and corn growth were investigated. Amounts of runoff water in all plots except black polyethylene plot ranged from 152 to 375 $m^3\;ha^{-1}$, accounting for 13~32% of 1,158 $m^3\;ha^{-1}$ in control. Amount of eroded soil decreased by 94 to 99% (3 to 89 kg $ha^{-1}$) in plots of strip tillage after covering with crop residues compared to control with 1,739 kg $ha^{-1}$. Corn yields in plots of strip tillage after covering with crop residues ranged from 6.0 to 6.9 Mg $ha^{-1}$, while that of control was 6.5 Mg $ha^{-1}$. The results suggest that strip tillage methods after surface covering with crop residues are very effective on soil conservation of slope land in corn cultivation.

Neighborhood Search Algorithms for the Maximal Covering Problem (이웃해 탐색 기법을 이용한 Maximal Covering 문제의 해결)

  • Hwang, Jun-Ha
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.1 s.39
    • /
    • pp.129-138
    • /
    • 2006
  • Various techniques have been applied to solve the maximal covering problem. Tabu search is also one of them. But, existing researches were lacking of the synthetic analysis and the effort for performance improvement about neighborhood search techniques such as hill-climbing search and simulated annealing including tabu search. In this paper, I introduce the way to improve performance of neighborhood search techniques through various experiments and analyses. Basically, all neighborhood search algorithms use the k-exchange neighborhood generation method. And I analyzed how the performance of each algorithm changes according to various parameter settings. Experimental results have shown that simple hill-climbing search and simulated annealing can produce better results than any other techniques. And I confirmed that simple hill-climbing search can produce similar results as simulated annealing unlike general case.

  • PDF

Value Analysis of Floor Covering Methods Considering the Skid Resistance Performance (미끄럼저항성능을 고려한 바닥재 시공법의 성능평가방안)

  • Yoon, Cha-Woong;Seol, Jae-Nam;Seo, Jong-Won
    • Korean Journal of Construction Engineering and Management
    • /
    • v.13 no.2
    • /
    • pp.58-69
    • /
    • 2012
  • In modern society, rooftops and underground spaces are utilized for overcoming a confined space limitation of metropolitan areas. Therefore, floor covering construction is also increasing steadily. From the user's viewpoint, skid resistance performance of floor covering methods is a very important performance criterion for safety and amenity, but an appropriate design and assessment criteria for skid resistance performance are not available. This study presents the skid resistance performance assessment method of floor covering methods considering the sidewalk skid resistance standard of Seoul city and the guideline of the Ministry of Land, Transport and Maritime Affairs(MLTM) of Korea for road safety facilities'installation and maintenance. For this research, three alternatives among urethane floor covering methods are selected and their skid resistance performance is analyzed through an experimental study. The analyzed performance is also evaluated by the skid resistance performance assessment method. Finally, the comprehensive performance assessment including the results of skid resistance performance assessment is conducted by Value Analysis(VA) in order to encourage the construction methods of floor covering which have a high skid resistance performance. As a result of VA, the particle method which the skid resistance performance is improved up to four times more than other alternatives shows the highest performance index of 83.86.

An Enhanced Simulated Annealing Algorithm for the Set Covering Problem (Set Covering 문제의 해법을 위한 개선된 Simulated Annealing 알고리즘)

  • Lee, Hyun-Nam;Han, Chi-Geun
    • IE interfaces
    • /
    • v.12 no.1
    • /
    • pp.94-101
    • /
    • 1999
  • The set covering(SC) problem is the problem of covering all the rows of an $m{\times}n$ matrix of ones and zeros by a subset of columns with a minimal cost. It has many practical applications of modeling of real world problems. The SC problem has been proven to be NP-complete and many algorithms have been presented to solve the SC problem. In this paper we present hybrid simulated annealing(HSA) algorithm based on the Simulated Annealing(SA) for the SC problem. The HSA is an algorithm which combines SA with a crossover operation in a genetic algorithm and a local search method. Our experimental results show that the HSA obtains better results than SA does.

  • PDF

Low Power Design Using the Extraction of kernels (커널 추출을 이용한 저전력설계)

  • 이귀상;정미경
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.369-372
    • /
    • 1999
  • In this paper, we propose a new method for power estimation in nodes of multi-level combinational circuits and describe its application to the extraction of common expressions for low power design. It is assumed that each node is implemented as a complex gate and the capacitance and the switching activity of the nodes are considered in the power estimation. Extracting common expressions which is accomplished mostly by the extraction of kernels, can be transformed to the problem of rectangle covering. We describe how the newly proposed estimation method can be applied to the rectangle covering problem and show the experimental results with comparisons to the results of SIS-1.2.

  • PDF

Multi-ring Design Algorithm for Survivable WDM Networks (WDM 망에서의 다중 링 설계 알고리즘 연구)

  • Chung, Ji-Bok
    • Korean Management Science Review
    • /
    • v.26 no.3
    • /
    • pp.1-9
    • /
    • 2009
  • In this paper, we present mathematical models for the ring covering problems arising in the design of multi-ring WDM networks. Also, we present efficient algorithms to solve the suggested models. By the computational experiment, our model can solve the medium-sized networks efficiently and shows better performance than the existing heuristic method. Although we propose an efficient method for the column generation procedure, branching rule that does not destroy the column generation structure is unsolved. Further research is required to develop an effective branching rule.

Soft-Decision Decoding of the [23,12] Golay Code Using Covering Polynomials (커버링 다항식을 이용한 골레이 부호의 연판정 복호)

  • 성원진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.3A
    • /
    • pp.180-187
    • /
    • 2002
  • The decoding method using covering polynomials is an extended form of error-trapping decoding, and is a simple and effective means to implement decoders for cyclic codes. Covering polynomials can be used for soft-decision decoding as well as for decoding beyond the bounded distance of the code. The implementation complexity is proportional to the number of covering polynomials employed. In this paper, the soft-decision decoding procedure using covering polynomials is described, and the procedure is applied to the [23,12] Golay code. A new set of covering polynomials is derived for the procedure, which is presented as a generalized closed-form solution. The set can be efficiently utilized for decoding a class of cyclic codes including the Golay code. Computer simulation of the described procedure is performed to show the trade-offs between the decoder performance and complexity. It is demonstrated that soft-decision decoding of the Golay code using the derived set of covering polynomials has less than 0.2dB deviation from the optimal performance of maximum-likelihood decoding, with a reduced complexity when compared to the Chase Algorithm 2 combined with hard-decision decoding that has nearly identical performance.