看到一個(gè)不錯(cuò)的寫(xiě)文獻(xiàn)總結(jié)的提綱，列出來(lái)分享一下。

原本是一門(mén)課的作業(yè)，老師布置了幾篇論文，讓寫(xiě)個(gè)一頁(yè)的總結(jié)，paper summary。這個(gè)如果想糊弄，其實(shí)是很容易的，隨便copy幾段文字下來(lái)，就一頁(yè)了。但我想這樣做沒(méi)什么意義，不如認(rèn)認(rèn)真真的理一些思路出來(lái)。于是在網(wǎng)上搜到了這個(gè)樣板提綱。

我認(rèn)為這個(gè)提綱好在，他比較重視introduction部分的閱讀，前三個(gè)問(wèn)題都是intro里面的。弄懂這三個(gè)問(wèn)題，才能更好的把握文章背景信息。話說(shuō)回來(lái)，要寫(xiě)一篇好的文章，前8點(diǎn)內(nèi)容是必然要交代清楚的。如果從文章里提取不到這些信息，那文章不能說(shuō)是成功的文章，關(guān)鍵的問(wèn)題都沒(méi)交代清楚。

模板精簡(jiǎn)并翻譯如下：

1. What is the problem the authors are trying to solve? 作者想解決什么問(wèn)題？(研究目的)

2. What other approaches or solutions existed at the time that this work was done? 這個(gè)問(wèn)題現(xiàn)在有什么解決方法？

3. What was wrong with the other approaches or solutions? 這些方法存在什么問(wèn)題？

4. What is the authors' approach or solution? 作者提出了什么方法？

5. Why is it better than the other approaches or solutions? 為什么說(shuō)要作者的這個(gè)方法好于其他方法？

6. How did they test their solution? 作者如何檢驗(yàn)自己的方法？

7. How does it perform? 方法檢驗(yàn)效果如何？

8. Why is this work important? 為什么該文的研究比較重要？（研究意義）

more comments/questions 附加評(píng)注，或者問(wèn)題。隨讀者背景和認(rèn)識(shí)程度的不同，可以靈活的提出一些問(wèn)題。

本人拙作，也就是作業(yè)。歡迎拍磚。

summary on “A. Boucher (2009): Considering complex training images with search tree partitioning, Computers & Geosciences, 35, 1151-1158.”

1. What is the problem the authors are trying to solve?
To solve the difficulty of large complex TI to be used in SNESIM.

2. What other approaches or solutions existed at the time that this work was done?
To decrease the size of search tree, general approaches are taking a smaller TI or using a smaller template. Besides, there are two alternative approaches in current practice:  1) region approach 2) probability ?eld approach.

3. What was wrong with the other approaches or solutions?
A major issue with the region approach is that there is no guarantee that the different TIs used are compatible with one another. The problem with this probability ?eld approach is that integration changes the conditional probability derived from the search tree and affects the pattern reproduction in an unknown manner.

4. What is the authors' approach or solution?
  The authors proposed a search tree partitioning approach which includes:
        Applying the filters on the TI to gain a series of filter scores that are indicative of the underlying patterns.
        Defining partition classes through the filter scores with a clustering algorithm
        Building search tree for each partition class
        At each pixel along the simulation path, the partition class is retrieved first and used to select the appropriate search tree.

5. Why is it better than the other approaches or solutions?
The proposed algorithm adds local information without using a probability field which distorts the conditional distribution obtained from the TI. It improves the region approach by requiring a single complete TI and implicitly models the transitions between regions. It facilitates the use of hierarchical framework by identifying the hierarchy structures with partition classes.

6. How did they test their solution?
They gave two examples of implementation of their approach. The first example is to simulate a series of fracture.  The second is to simulate Shallow-water tidal system. They also made the comparison to the result pattern by global search tree approach.

7. How does it perform?
Performance is very good. In the fracture case, the trend in orientation is well reproduced. In the second one the geological consistency of the TI is reproduced. These features are not exhibited in the realization by global search tree approach. Besides, the speed improved.

8. Comments & other questions
*The simulation grid can be obtained in many ways. Do the different simulation grids influence realization?
*FILTERSIM as a similar approach is interesting to compare with the authors approach.
*A. Boucher’s effort to integrate new algorithm to SGeMS is interesting and respectable. Open Geostatistic software will allow more researchers to test, apply and extend the algorithm in an easier manner.

Sample Paper Summary
Name: Scott Brandt

Paper: Sage A. Weil, Scott A. Brandt, Ethan L. Miller, Darrell D. E. Long,
       and Carlos Maltzahn, ``Ceph: A Scalable, High-Performance, Distributed
       Object-based Storage System,'' Symposium on Operating Systems Design
       and Implementation (OSDI '06), Seattle, Washington, November 6-8, 2006,
       to appear.

1. What is the problem the authors are trying to solve?

  Existing storage systems do not scale well to petabytes of data and
  terabytes/second throughput.

2. What other approaches or solutions existed at the time that this work was done?

  Lots of other file systems existed. NFS is a standard for distributed
  file systems. Lustre is a distributed object-based file system, as
  is the Panasas file system.

3. What was wrong with the other approaches or solutions?

  All have limitations that prevent them from scaling to the desired level.
  Block-based file systems have problems dealing with the large number of
  blocks in such a system. Other object-based file systems fail to take full
  advantage of the object-based paradigm and still maintain object lists.

4. What is the authors' approach or solution?

  The authors solution includes:
  - Object-based storage devices
  - A globally known mapping function for locating file data
    (instead of object lists)
  - A scalable metadata manager that dynamically redelegates authority
    for directory subtrees based on load
  - A distributed autonomous system for managing the object stores

5. Why is it better than the other approaches or solutions?

  It scales to petabytes, provides nearly linear performance improvements
  as storage devices are added, degrades gracefully as storage devices are
  removed, and provides very high performance.

6. How did they test their solution?

  They ran parts of the storage system and observed their performance
  under various workloads. Data performance was tested on a single object
  store and on several object stores. Metadata performance was tested on
  a large cluster.

7. How does it perform?

  Performance is very good. The system appears to achieve its goals,
  although scalability could be improved in certain scenarios where a lot
  of sharing occurs.

8. Why is this work important?

  This work is important because storage systems continue to grow in size
  and data is becoming increasingly important.

3+ comments/questions

  * Why didn't they directly compare the performance of their system against
    that of any other storage systems?

  * What happens if you scale to exabytes? Will the system still work? What
    factors will limit its ability to scale further?

  * How much of the improvement is due to CRUSH, and how much to the design
    of the other parts of the system? Why didn't they do any tests to isolate
    the benefits of the individual design decisions?