• Title/Summary/Keyword: experiments and practices

Search Result 271, Processing Time 0.028 seconds

Thermal Index for the Assessment of the Impacted Area by the Thermal Discharge from Nuclear Power Plant in Korea (원자력 발전소 온배수 피해역 산정을 위한 영향지수 시안)

  • Ro, Young-Jae
    • The Sea:JOURNAL OF THE KOREAN SOCIETY OF OCEANOGRAPHY
    • /
    • v.12 no.1
    • /
    • pp.35-42
    • /
    • 2007
  • Thermal discharges from the nuclear power plants into neighboring Korean coastal waters have raised serious disputable arguments from the two parties of local fishermen and scientists involved since late 1970's. To meet the social demands and provide scientific and reasonable solutions, new set of standards have been established which will guide through measuring and processing the various variables and parameters in environmental and fishery impact assessment procedures for the thermal discharge from the nuclear power plants. These are made possible for the first time by the combined efforts by Korean Oceanography Society and Fishery Society. In this paper, Thermal Disharge Impact Index(TI) is proposed by the probability of the local temperatures exceeding critically to local fishery multiplied by the weighted sum of diverse environmental and ecological factors. The TI is essentially conceived to overcome the long-exising bad practices based on the particular excess temperature such as 1. The proposed TI based on the guideline principle proposed by the UNEP(2002) is expected to be practical, economic and self-adaptive. To prove the usefulness of the TI, it is highly recommended to conduct prototype experiments and exercises in a particular nuclear power plant site in the near future.

Growth Characteristics and Seed Yield of Medicinal Soybeans Collected in Korea

  • Seong, Rak-Chun;Hwang, Young-Hyun;Park, Chang-Ki
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.43 no.2
    • /
    • pp.105-112
    • /
    • 1998
  • Seeds of medicinal soybean [Glycine max(L.) Merill] are characterized by a black seed coat, white stripe at hilum border, yellow cotyledon, and very small seed weight. Production of this medicinal soybean has recently increased as a consumption increased. The objective of this study was to evaluate the growth characteristics and seed yield of collected medicinal soybeans and to obtain basic information on production practices and breeding materials. The collected medicinal soybean lines were cultivated at three locations for two years. Twenty-seven lines were planted at the Research Farm, Korea University, Namyangju city, on May 23, and at the Research Farm, Kyungpook National University, Taegu, on May 20, 1995. In 1996 field experiments, forty-four lines were planted on May 25, at Research Farm, Korea University, and twenty-seven lines among those were planted on June 7 at the Research Farm of National Yeongnam Agricultural Experiment Station, Milyang city. The investigated lines had purple or white flower. Flowering and maturing dates were similar or later than those of the control cultivars. Branch number was greater for the investigated lines. One hundred-seed weight of the lines ranged from 8.5 to 15.0 g. Mean seed yields ranged from 1.54 to 2.89 MT/ha. Nine lines of the investigated medicinal soybeans showed higher yield capacity than the control cultivars. Further research should be done on the improvement of the production system and breeding program of medicinal soybeans.

  • PDF

A Fast Block Matching Algorithm using Unit-Diamond and Flat-Hexagonal Search Patterns (단위 다이아몬드와 납작한 육각패턴을 이용한 고속 블록 정합 알고리즘)

  • 남현우;위영철;김하진
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.1
    • /
    • pp.57-65
    • /
    • 2004
  • In the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the unit-diamond search pattern and the flat-hexagon search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the unit-diamond search pattern, and then fastly finds the other motion vectors that are not close to the center of search window using the flat-hexagon search pattern. Through experiments, compared with the hexagon-based search algorithm(HEXBS), the proposed unit-diamond and flat-hexagonal pattern search algorithm(UDFHS) improves as high as 11∼51% in terms of average number of search point per motion vector estimation and improves about 0.05∼0.74㏈ in terms of PSNR(Peak Signal to Noise Ratio).

Preventing ELF(Executable and Linking Format)-File-Infecting Malware using Signature Verification for Embedded Linux (임베디드 리눅스에서 서명 검증 방식을 이용한 악성 프로그램 차단 시스템)

  • Lee, Jong-Seok;Jung, Ki-Young;Jung, Daniel;Kim, Tae-Hyung;Kim, Yu-Na;Kim, Jong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.6
    • /
    • pp.589-593
    • /
    • 2008
  • These days, as a side effect of the growth of the mobile devices, malwares for the mobile devices also tend to increase and become more dangerous. Because embedded Linux is one of the advanced OSes on mobile devices, a solution to preventing malwares from infecting and destroying embedded Linux will be needed. We present a scheme using signature verification for embedded Linux that prevents executallle-Infecting malwares. The proposed scheme works under collaboration between mobile devices and a server. Malware detection is delegated to the server. In a mobile device, only integrity of all executables and dynamic libraries is checked at kernel level every time by kernel modules using LSM hooks just prior to loading of executables and dynamic libraries. All procedures in the mobile devices are performed only at kernel level. In experiments with a mobile embedded device, we confirmed that the scheme is able to prevent all executable-Infecting malwares while minimizing damage caused by execution of malwares or infected files, power consumption and performance overheads caused by malware check routines.

An Efficient Method for Real-Time Broken Lane Tracking Using PHT and Least-Square Method (PHT와 최소자승법을 이용한 효율적인 실시간 점선차선 추적)

  • Xu, Sudan;Lee, Chang-Woo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.6
    • /
    • pp.619-623
    • /
    • 2008
  • A lane detection system is one of the major components of intelligent vehicle systems. Difficulties in lane detection mainly come from not only various weather conditions but also a variety of special environment. This paper describes a simple and stable method for the broken lane tracking in various environments. Probabilistic Hough Transform (PHT) and the Least-square method (LSM) are used to track and correct the lane orientation. For the efficiency of the proposed method, two regions of interest (ROIs) are placed in the lower part of each image, where lane marking areas usually appear with less intervention in our system view. By testing in both a set of static images and video sequences, the experiments showed that the proposed approach yielded robust and reliable results.

Classification Model of Types of Crime based on Random-Forest Algorithms and Monitoring Interface Design Factors for Real-time Crime Prediction (실시간 범죄 예측을 위한 랜덤포레스트 알고리즘 기반의 범죄 유형 분류모델 및 모니터링 인터페이스 디자인 요소 제안)

  • Park, Joonyoung;Chae, Myungsu;Jung, Sungkwan
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.9
    • /
    • pp.455-460
    • /
    • 2016
  • Recently, with more severe types felonies such as robbery and sexual violence, the importance of crime prediction and prevention is emphasized. For accurate and prompt crime prediction and prevention, both a classification model of crime with high accuracy based on past criminal records and well-designed system interface are required. However previous studies on the analysis of crime factors have limitations in terms of accuracy due to the difficulty of data preprocessing. In addition, existing crime monitoring systems merely offer a vast amount of crime analysis results, thereby they fail to provide users with functions for more effective monitoring. In this paper, we propose a classification model for types of crime based on random-forest algorithms and system design factors for real-time crime prediction. From our experiments, we proved that our proposed classification model is superior to others that only use criminal records in terms of accuracy. Through the analysis of existing crime monitoring systems, we also designed and developed a system for real-time crime monitoring.

CNVR Detection Reflecting the Properties of the Reference Sequence in HLA Region (레퍼런스 시퀀스의 특성을 고려한 HLA 영역에서의 CNVR 탐지)

  • Lee, Jong-Keun;Hong, Dong-Wan;Yoon, Jee-Hee
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.6
    • /
    • pp.712-716
    • /
    • 2010
  • In this paper, we propose a novel shape-based approach to detect CNV regions (CNVR) by analyzing the coverage graph obtained by aligning the giga-sequencing data onto the human reference sequence. The proposed algorithm proceeds in two steps: a filtering step and a post-processing step. In the filtering step, it takes several shape parameters as input and extracts candidate CNVRs having various depth and width. In the post-processing step, it revises the candidate regions to make up for errors potentially included in the reference sequence and giga-sequencing data, and filters out regions with high ratio of GC-contents, and returns the final result set from those candidate CNVRs. To verify the superiority of our approach, we performed extensive experiments using giga-sequencing data publicly opened by "1000 genome project" and verified the accuracy by comparing our results with those registered in DGV database. The result revealed that our approach successfully finds the CNVR having various shapes (gains or losses) in HLA (Human Leukocyte Antigen) region.

Multiple Classifier Fusion Method based on k-Nearest Templates (k-최근접 템플릿기반 다중 분류기 결합방법)

  • Min, Jun-Ki;Cho, Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.4
    • /
    • pp.451-455
    • /
    • 2008
  • In this paper, the k-nearest templates method is proposed to combine multiple classifiers effectively. First, the method decomposes training samples of each class into several subclasses based on the outputs of classifiers to represent a class as multiple models, and estimates a localized template by averaging the outputs for each subclass. The distances between a test sample and templates are then calculated. Lastly, the test sample is assigned to the class that is most frequently represented among the k most similar templates. In this paper, C-means clustering algorithm is used as the decomposition method, and k is automatically chosen according to the intra-class compactness and inter-class separation of a given data set. Since the proposed method uses multiple models per class and refers to k models rather than matches with the most similar one, it could obtain stable and high accuracy. In this paper, experiments on UCI and ELENA database showed that the proposed method performed better than conventional fusion methods.

Image Retrieval based on Color-Spatial Features using Quadtree and Texture Information Extracted from Object MBR (Quadtree를 사용한 색상-공간 특징과 객체 MBR의 질감 정보를 이용한 영상 검색)

  • 최창규;류상률;김승호
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.6
    • /
    • pp.692-704
    • /
    • 2002
  • In this paper, we present am image retrieval method based on color-spatial features using quadtree and texture information extracted from object MBRs in an image. Tile proposed method consists of creating a DC image from an original image, changing a color coordinate system, and decomposing regions using quadtree. As such, conditions are present to decompose the DC image, then the system extracts representative colors from each region. And, image segmentation is used to search for object MBRs, including object themselves, object included in the background, or certain background region, then the wavelet coefficients are calculated to provide texture information. Experiments were conducted using the proposed similarity method based on color-spatial and texture features. Our method was able to refute the amount of feature vector storage by about 53%, but was similar to the original image as regards precision and recall. Furthermore, to make up for the deficiency in using only color-spatial features, texture information was added and the results showed images that included objects from the query images.

Design and Implementation of the KRISTAL-II Web Gateway for Efficiently Processing a Large Number of On-line Retrieval Requests (대규모 온라인 검색 요구를 효율적으로 처리하기 위한 KRISTAL-II웹 게이트웨이의 설계 및 구현)

  • Lee, Ki-Yong;Kwak, Tae-Yeong;Seo, Jung-Hyun;Kim, Myoung-Ho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.5
    • /
    • pp.496-504
    • /
    • 2000
  • The Web gateway is key technology for inter-operating WWW and databases. The previous KRISTAL-II information retrieval system, developed by KORDIC(Korea Research & Development Information Center), used a simple CGI structure web gateway. While the simple CGI structure web gateway is easy to implement, it is not suitable for processing a large number of on-line retrival requests. When considering the growth of the Internet and WWW, it is very important to develop a web gateway efficiently supporting a large number of concurrent users. In this paper, we propose a 3-tier client-server structure web gateway for the KRISTAL-II information system. We also evaluate the performance of the proposed web gateway through experiments.

  • PDF