国外应用文和学术论文的格式
- 格式:doc
- 大小:92.50 KB
- 文档页数:16
Application paper
The purpose of the application paper is to give you an opportunity to apply the concepts of psychology to your everyday life. The application paper requires you to integrate a theory from the information we've studied with an event or events from your personal experience. In other words, you are to use a theory to analyze and to explain something that has taken place in your life. This is not a theoretical review paper nor is it a simple report of a personal experience. An in-depth review of the theoretical material that you are going to discuss is not necessary. This is simply repeating what I can find in our text or in class notes. It would be unnecessary work for you to use space to provide an in-depth review of material already available. Instead, your task becomes one of using this knowledge to consider viable explanations for your and/or others' behavior. You want to use your example as an illustration of the theory you've chosen, with your goal being to convince me that you actually do understand what the theory and concepts are all about.
*T echnical presentation covers :
* Paper Title
* The Abstract
* The Introduction
* Related Work
* The Body
* Performance Experiments
* The Conclusions
* Future Work
* The Acknowledgements
* Citations
* Appendices
* Grammar and Small-Scale Presentation Issues
* Mechanics
* Versions and Distribution
Tips for Writing Technical Papers
Jennifer Wid om, January 2006
∙Here are the notes from a presentation I gave at the Stanford InfoLab Friday lunch, 1/27/06, with a few (not many) revisions when
I reprised the talk on 12/4/09. The presentation covered:Paper Title
∙The Abstract
∙The Introduction
∙Related Work
∙The Body
∙Performance Experiments
∙The Conclusions
∙Future Work
∙The Acknowledgements
∙Citations
∙Appendices
∙Grammar and Small-Scale Presentation Issues
∙Mechanics
∙Versions and Distribution
Running Example
As a running (fictitious!) example, suppose you've designed and run experiments with a new algorithm for external multipass merge-sort. Y our algorithm reduces the complexity from O(n log n) to O(n), under the premise that it's acceptable to have some bounded "unsortedness" in the result. Y ou plan to write up the results for submission to a major conference.
Note: This example was used throughout the live presentation but I haven't foll owed through much in these notes. Thus, the notes include several exercises for the reader.
Paper Title
∙Titles can be l ong and descriptive:Linear-Time External Multipass Sorting