期刊文献+

M26矮化中间砧和乔化苹果园第4年至盛果期管理技术

下载PDF
导出
摘要 1 修剪1.1发芽前1.1.1疏疏除主干延长枝下的2~3个竞争枝;疏除基轴粗度超过主干1/3的主枝:疏除主干和主枝上过密过粗的枝,一般20cm左右留1个;非过密枝一般不疏。1.1.2甩中心干延长枝甩放,对留下的所有枝条一般全甩放。1.13拉(坠)对所有主枝和主干上的枝条一律拉平:对主枝上剪留的粗度低于主枝1/3的分枝除了留下4~6个背上枝不拉外,全部拉向下垂,用绳子或石块坠,并调整枝条密度,把枝条引向有空间的地方,整形、结果并举。
出处 《河北果树》 2014年第2期36-36,共1页 Hebei Fruits
  • 相关文献

参考文献13

  • 1Liefke H,Dan S.XMill:An efficient Compressor for XML data.Proc of the 2000 ACM SIGMOD Int'l Conf on Management of Data 2000,New York,May 2000,153-164.
  • 2Tolani P M,Haritsa J R.XGRIND:A Query-friendly XML Compressor.Proc of the 18th Int'l Conf on Data Engineering (ICDE' 02).Washington,February 2002,225-225.
  • 3Min J K,Park M J,Chung C W,et al.XPRESS:A Queriable Compression for XML data.In:Proc of the 2003 ACM SIGMOD Int'l Conf on Management of Data,New York,June 2003,122-133.
  • 4Manolopoalos Y,Theodoridis Y,Tsotras V J.Advanced Database Indexing.Boston:Kluwer Academic Publishers,1999,61-81.
  • 5Papakonstantinou Y,Garcia-Molina H,Widom J.Object Exchange Across Heterogeneous Information Sources.In:Proc of the 11th Int'l Conf on Data Engineering (ICDE' 95).Washington,March 1995,251-260.
  • 6Lelewer D A,Hirschberg D S.Data Compression.ACM Computing Surveys,1987,19(3):261-296.
  • 7Cormen T H,Leiserson C E,Rivest R L.Introduction to algorithms.Cambridge:MIT Press,1990.
  • 8Bloom B H.Space/Time Trade-Offs in Hash Coding with Allowable Errors.Communications of the ACM,1970,13(7):422-426.
  • 9Diao Y,Franklin M.Query Processing for High-Volume XML Message Brokering.Proceedings of the 29th Very Large Data Bases Conference (VLDB'03),San Fransisco,September 2003.261-272.
  • 10Altinel M,Franklin M J.Efficient Filtering of XML Documents for Selective Dissemination of Information.Proceedings of the 26th Very Large Data Bases Conference (VLDB'00),San Fransisco,September 2000.53-64.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部