<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06105408</id>
  <dt>a</dt>
  <an>06105408</an>
  <augroup>
    <au>Xu, Zhi-Peng</au>
    <au>Wang, Zhong-Bin</au>
  </augroup>
  <ti>Research on memory strategies of shearer cutting path.</ti>
  <so>Huang, De-Shuang (ed.) et al., Intelligent computing theories and applications. 8th international conference, ICIC 2012, Huangshan, China, July 25--29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31575-6/pbk). Lecture Notes in Computer Science 7390. Lecture Notes in Artificial Intelligence, 642-647 (2012).</so>
  <py>2012</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>Memory strategy</ut>
    <ut>fuzzy processing</ut>
    <ut>shearer</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-31576-3_81</li>
  </ligroup>
  <abgroup>
    <ab>Summary: In this paper the author did a deep research on the memory problem which involved in the process of shearer automatic cutting, analyzed the data priority of the shearer path memory, selected a few points on cutting path as the memory points, simplified the data structure of the memory points, and compressed the final memory data. Reduced the storage space of cutting path data as far as possible under the premise of the data integrity; provided an accurate and reliable data base for the shearer automatic cutting.</ab>
    <rv></rv>
  </abgroup>
</item>