Seminar: Recreational Computer Science 2. How to write a (Seminar) - - PowerPoint PPT Presentation

seminar recreational computer science
SMART_READER_LITE
LIVE PREVIEW

Seminar: Recreational Computer Science 2. How to write a (Seminar) - - PowerPoint PPT Presentation

Seminar: Recreational Computer Science 2. How to write a (Seminar) Paper Gabi R oger Universit at Basel October 2, 2017 Getting started Structure Citation Common problems Getting started Getting started Structure Citation Common


slide-1
SLIDE 1

Seminar: Recreational Computer Science

  • 2. How to write a (Seminar) Paper

Gabi R¨

  • ger

Universit¨ at Basel

October 2, 2017

slide-2
SLIDE 2

Getting started Structure Citation Common problems

Getting started

slide-3
SLIDE 3

Getting started Structure Citation Common problems

Aim

You Other seminar participants Practice reading and writing scientific reports Who is the audience? What do they already know? What should they learn?

slide-4
SLIDE 4

Getting started Structure Citation Common problems

Getting Material

Finding material references in the material you already have https://scholar.google.com reference section in wikipedia articles library ask advisor for help Article only available for money? homepages of the authors university subscription library

slide-5
SLIDE 5

Getting started Structure Citation Common problems

Understand the Material

www.xkcd.com do not ignore complicated details speak with your advisor if you need help

slide-6
SLIDE 6

Getting started Structure Citation Common problems

Structure

slide-7
SLIDE 7

Getting started Structure Citation Common problems

A Typical Structure

abstract introduction background main parts related work conclusion references

slide-8
SLIDE 8

Getting started Structure Citation Common problems

Abstract I

Sorting Algorithms

Hans Meier Seminar on Algorithms and Data Structures University of Basel HS 20XX

Abstract A sorting algorithm orders the elements of a list according to a given total order relation. We explain three different such algorithms, namely merge sort, heap sort and quick sort and analyse their time and space

  • complexity. An empirical evaluation illustrates in which scenarios these

algorithms have their strenghts and weaknesses.

1 Introduction

slide-9
SLIDE 9

Getting started Structure Citation Common problems

Abstract II

very brief description of what is in the paper should help potential readers to decide whether the paper is relevant to them contains no references in L

AT

EX: \begin{abstract}...\end{abstract}

slide-10
SLIDE 10

Getting started Structure Citation Common problems

Introduction

setting high-level description of the topic motivation why the topic is interesting structure of the paper

slide-11
SLIDE 11

Getting started Structure Citation Common problems

Introduction

setting high-level description of the topic motivation why the topic is interesting structure of the paper

We start by introducing the SAS+ planning formalism and our new framework, which is based on operator- counting constraints. Afterwards, we present a wide range of such constraints and explain how they can be used to express existing heuristics. We then prove some theoretical results on interesting connections between the heuristics and end with an experimental study and conclusions.

[Pommerening et al., ICAPS 2014]

slide-12
SLIDE 12

Getting started Structure Citation Common problems

Background

introduces basic terminology and notation builds the fundament for the main parts

  • ften general, well-known definitions or work by others

papers must be self-contained, here is the place to achieve this section title not necessarily “background”

e.g. Pommerening et al. [ICAPS 2014]

slide-13
SLIDE 13

Getting started Structure Citation Common problems

Main Parts

core of the paper sub-structure depends very much on topic

slide-14
SLIDE 14

Getting started Structure Citation Common problems

Related Work

brief description of other approaches to the same problem focus on core ideas sometimes also directly after introduction

slide-15
SLIDE 15

Getting started Structure Citation Common problems

Conclusion

wraps up the paper short summary of main findings should not repeat the abstract or introduction

  • ften closes with open questions or an outlook to future work
slide-16
SLIDE 16

Getting started Structure Citation Common problems

References

list of used literature should be complete and consistent

do not write “Proceedings of the Xth Conference on Blabla” for one conference and “Proc. ACRONYM 2000” for another

  • r even worse: the same conference

use bibtex, biblatex, . . . read the messages of these tools

warnings for incomplete entries

slide-17
SLIDE 17

Getting started Structure Citation Common problems

Citation

slide-18
SLIDE 18

Getting started Structure Citation Common problems

Citation

“Meier and Huber (2013) have shown. . . ” “For the n2-puzzle, finding the shortest solution is NP-complete (Ratner and Warmuth 1986).” Theorem 1 (Murphy’s law, Sack 1952). Anything that can possibly go wrong, does. not “(Meier and Huber 2013) have shown. . . ” not “In (Meier and Huber 2013) . . . ”’

slide-19
SLIDE 19

Getting started Structure Citation Common problems

Bibtex

@Article{stewart-gallery, author = "Ian Stewart", title = "How Many Guards in the Gallery?", journal = "Scientific American", year = "1994", volume = "270", issue = "5", pages = "118--120" } (Demo)

slide-20
SLIDE 20

Getting started Structure Citation Common problems

Common problems

slide-21
SLIDE 21

Getting started Structure Citation Common problems

How to Fill the Paper?

add explanations add examples

slide-22
SLIDE 22

Getting started Structure Citation Common problems

Common Issues

Usage of terms before their introduction Only translation of original text Colloquial or imprecise language

slide-23
SLIDE 23

Getting started Structure Citation Common problems

Questions Questions?

slide-24
SLIDE 24

Getting started Structure Citation Common problems

References

Pommerening, F., R¨

  • ger, G., Helmert, M., and Bonet, B.

(2014). LP-based heuristics for cost-optimal planning. In Proc. ICAPS 2014, pages 226–234. Ratner, D. and Warmuth, M. (1986). Finding a shortest solution for the nxn extension of the 15-puzzle is intractable. In Proc. AAAI 1986, pages 168–172. Sack, J. (1952). The Butcher: The Ascent of Yerupaja epigraph. Rinehart & Co, inc.