RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제
      • 좁혀본 항목 보기순서

        • 원문유무
        • 원문제공처
        • 학술지명
        • 주제분류
        • 발행연도
        • 작성언어
        • 저자
          펼치기

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • Keygene Crop Phenome Center

        Gert-Jan Speckmann,Shital Dixit,Koen Huvenaars,Jose Guerra,Marco van Schriek 한국육종학회 2012 한국육종학회 심포지엄 Vol.2012 No.07

        As genotyping is becoming more of a commodity, the bottleneck in functional marker development is more and more shifted towards phenotyping. For this reason we invested in building a Crop Phenome Center at the KeyGene Wageningen facility at which we investigated various approaches for phenotype quality improvements. The KeyGene Crop Phenome Center focuses on a robust phenotyping platform in a greenhouse setup (PhenoFab) that allows for digital phenotyping as an approach to acquire more precise phenotypic data. The phenotyping is based on imaging technology and uses the potential of a track that moves all plants fully automated through the greenhouse compartment and scanning areas. The plants grow in individual containers and are photographed at pre-set points in time and from different angles. This approach was validated in various projects with diverse sets of crop plants and on both plant and root development. Data and conclusions of these experiments will be presented.

      • Digital phenotyping allows for precise plant growth analysis

        Marco van Schriek,Jose Guerra,Gert-Jan Speckmann,Koen Huvenaars 한국육종학회 2012 한국육종학회 심포지엄 Vol.2012 No.07

        Drought is one of the major abiotic stresses in agriculture affecting major crops worldwide. Any step taken towards improvement of either crops or its growing conditions which enables the crop to produce comparable yield with less water will help substantially to combat this problem. Water regulating gel-like growth substrate called PRS claims to improve the water use of the plants and helps them to grow better and bigger with less water. To test this claim, we used two crops Pepper and Ficus to grow in pot system with and without PRS. To monitor their growth variation with detailed and precision phenotyping we used the high-throughput, non-destructive digital phenotyping platform- PhenoFab®. The continuous growth information enabled capturing of minor growth variations seen in the plants treated with and without PRS. Results reveal that no significant growth differences were found between PRS treated and non-treated plants, however the PRS treated plants needed 35% less water compared to the non-treated plants. Hence, PRS allows use of less water to grow plants.

      • Empty pseudo-triangles in point sets

        Ahn, H.K.,Bae, S.W.,van Kreveld, M.,Reinbacher, I.,Speckmann, B. North Holland ; Elsevier Science Ltd 2011 Discrete applied mathematics Vol.159 No.18

        We study empty pseudo-triangles in a set P of n points in the plane, where an empty pseudo-triangle has its vertices at the points of P, and no points of P lie inside. We give bounds on the minimum and maximum number of empty pseudo-triangles. If P lies inside a triangle whose corners must be the convex vertices of the pseudo-triangle, then there can be between Θ(n<SUP>2</SUP>) and Θ(n<SUP>3</SUP>) empty pseudo-triangles. If the convex vertices of the pseudo-triangle are also chosen from P, this number lies between Θ(n<SUP>3</SUP>) and Θ(n<SUP>6</SUP>). If we count only star-shaped pseudo-triangles, the bounds are Θ(n<SUP>2</SUP>) and Θ(n<SUP>5</SUP>). We also study optimization problems: minimizing or maximizing the perimeter or the area over all empty pseudo-triangles defined by P. If P lies inside a triangle whose corners must be used, we can solve these problems in O(n<SUP>3</SUP>) time. In the general case, the running times are O(n<SUP>6</SUP>) for the maximization problems and O(nlogn) for the minimization problems.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼