58
How to give a good research talk Andreas Zeller

The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

  • Upload
    others

  • View
    4

  • Download
    0

Embed Size (px)

Citation preview

Page 1: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

How to give a good research talkAndreas Zeller

Page 2: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Goals of the Seminar

• Find your way into scientific cha!enges!

• Structure and present scientific material"

• Train your social and communication skills

Page 3: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

The Purpose of your Talk

Page 4: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

The Purpose of your Talk

Page 5: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

The Purpose of your Talk

• Make the audience read your paper (and talk about it)!

• Give them an intuitive feel for your idea"

• Engage, excite, provoke them!

• Make them glad they came

Page 6: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Preparation

• Check the material!

• Identify central topics and claims!

• Outline the talk!

• Make a detailed sketch

Page 7: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Ask Yourself

• Do the claims hold?!

• Are the examples illustrative?!

• Can I do better in presenting?!

• What are the central claims, anyway?!

• And how are they supported?

Page 8: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Ask Yourself

• If someone remembers one thing from my research talk, what should it be?

Page 9: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

The Perfect Talk

• Hug0Pratt!

Page 10: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Your Audience

• Have read all your earlier papers!

• Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial Optimization!

• Are eagerly awaiting your latest and greatest!

• Are fresh, alert, and ready for action

have never heard of youhave heard of it, but wish they had not

could not care less

just came back from lunch and are ready for a nap

Page 11: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Your Audience

Page 12: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Organizing Your Talk

• Motivation!

• Solution (including failures)!

• Results!

• Conclusion

Page 13: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial
Page 14: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Motivation

• Present the general topic A vi!age in the woods"

• Show a concrete problem (and make it the audience’s problem) Wicked dragon attacks the peasants"

• Show that the state of the art is not enough Peasants’ forks can not pierce dragon armor

Page 15: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Solution + Results

• Show new approach and its advantages Hero comes with vorpal blade and fights dragon"

• Show how approach solves concrete problem Vorpal blade goes snicker-snick; dragon is slayed"

• Does the approach generalize? Would this work for other dragons, too? Why?

Page 16: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Examples: Your main Weapon

• Motivate work!

• Convey basic intuition!

• Illustrate idea in action!

• Use examples first, generalize afterwards

Page 17: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Outline

• Tell a story!

• Make slides invisible!

• Use examples, lots of examples!

• Connect to the audience!

• Hope for questions and feedback

Page 18: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Outlines

• Don’t use talk outlines at the beginning!

• Don’t use talk outlines in between!

• Actually, don’t use talk outlines at a!!

• Better: Use a diagram after 5 minutes!

• Think of this diagram as a memorizable image

Page 19: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

CHABADA

Checking App Behavior Against App Descriptions

Alessandra Gorla · Ilaria Tavecchia⇤ · Florian Gross · Andreas ZellerSaarland University

Saarbrücken, Germany{gorla, tavecchia, fgross, zeller}@cs.uni-saarland.de

ABSTRACTHow do we know a program does what it claims to do? After clus-tering Android apps by their description topics, we identify out-liers in each cluster with respect to their API usage. A “weather”app that sends messages thus becomes an anomaly; likewise, a“messaging” app would typically not be expected to access the cur-rent location. Applied on a set of 22,500+ Android applications,our CHABADA prototype identified several anomalies; additionally,it flagged 56% of novel malware as such, without requiring anyknown malware patterns.

1. INTRODUCTIONChecking whether a program does what it claims to do is a long-

standing problem for developers. Unfortunately, it now has becomea problem for computer users, too. Whenever we install a new app,we run the risk of the app being “malware”—that is, to act againstthe interests of its users.

Research and industry so far have focused on detecting malwareby checking static code and dynamic behavior against predefinedpatterns of malicious behavior. However, this will not help againstnew attacks, as it is hard to define in advance whether some pro-gram behavior will be beneficial or malicious. The problem is thatany specification on what makes behavior beneficial or maliciousvery much depends on the current context. In the mobile world, forinstance, behavior considered malicious in one app may well be afeature of another app:

• An app that sends a text message to a premium number toraise money is suspicious? Maybe, but on Android, this is alegitimate payment method for unlocking game features.

• An app that tracks your current position is malicious? Not ifit is a navigation app, a trail tracker, or a map application.

• An application that takes all of your contacts and sends themto some server is malicious? This is what WhatsApp doesupon initialization, one of the world’s most popular mobilemessaging applications.

⇤Ilaria Tavecchia is now with S.W.I.F.T., Brussels, Belgium.

Permission to make digital or hard copies of all or part of this work forpersonal or classroom use is granted without fee provided that copies arenot made or distributed for profit or commercial advantage and that copiesbear this notice and the full citation on the first page. To copy otherwise, torepublish, to post on servers or to redistribute to lists, requires prior specificpermission and/or a fee.ICSE ’14 Hyderabad, IndiaCopyright 20XX ACM X-XXXXX-XX-X/XX/XX ...$15.00.

1. App collection 2. Topics

"Weather","Map"…

"Travel", "Map"…

"Theme"

3. Clusters

Weather + Travel

Themes

Access-LocationInternet Access-LocationInternet Send-SMS

4. APIs 5. Outliers

Figure 1: Detecting applications with unadvertised behavior.Starting from a collection of “good” apps (1), we identify theirdescription topics (2) to form clusters of related apps (3). Foreach cluster, we identify the APIs used, grouped by related per-mission (4), and can then identify outliers that use APIs that areuncommon for that cluster (5).

The question thus is not whether the behavior of an app matchesa specific pattern or not; it is whether the program behaves as ad-vertised. In all the examples above, the user would be informed andasked for authorization before any questionable behavior. It is thecovert behavior that is questionable or downright malicious.

In this paper, we attempt to check implemented app behavioragainst advertised app behavior. Our domain is Android apps,so chosen because of its market share and history of attacks andfrauds. As a proxy for the advertised behavior of an app, we useits natural language description from the Google Play Store. As aproxy for its implemented behavior, we use the set of Android ap-plication programming interfaces (APIs) that are used from withinthe app binary. The key idea is to associate descriptions and API us-age to detect anomalies: “This ‘weather’ application accesses themessaging API, which is unusual for this category.”

Specifically, our CHABADA approach1 takes five steps, illustratedin Figure 1 and detailed later in the paper:

1. CHABADA starts with a collection of 22,500+ “good” An-droid applications downloaded from the Google Play Store.

1CHABADA stands for CHecking App Behavior Against Descrip-tions of Apps. “Chabada” is a French word for the base ternaryrhythm pattern in Jazz.

Page 20: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Slide Contents

• Concentrate on the bare necessities (e.g. at most 5 bullets per slide)!

• Do not present full sentences on a slide, because these are far too long and hard to read; also, they may tempt you in reading them loud.

Page 21: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Death by Powerpoint

Page 22: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Stemminglooking for a restaurant, a bar, a pub or just to have fun in london? search no more! this application has all the information you need: • you can search for every type of food you want: french, british, chinese, indian etc. • you can use it if you are in a car, on a bicycle or walking • you can view all objectives on the map • you can search objectives • you can view objectives near you • you can view directions (visual route, distance and duration) • you can use it with street view • you can use it with navigation keywords: london, restaurants, bars, pubs, food, breakfast, lunch, dinner, meal, eat, supper, street view, navigation

Page 23: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Stemminglooking for a restaurant, a bar, a pub or just to have fun in london? search no more! this application has all the information you need: • you can search for everi type of food you want: french, british, chinese, indian etc. • you can use it if you are in a car, on a bicycle or walking • you can view all objectives on the map • you can search objectives • you can view objectives near you • you can view directions (visual route, distance and duration) • you can use it with street view • you can use it with navigation keywords: london, restaurants, bars, pubs, food, breakfast, lunch, dinner, meal, eat, supper, street view, navigation

look restaur bar pub just funlondon search

search

applicinform need

can

cancancancancan

cancan

search

search

everi type food

food

want frenchbritish chines indian etc

us car bicycl walkview object map

objectobjectview

viewnear

direct visual routdurat

usus

street viewnavig

keyword london restaur bar pubbreakfast lunch dinner meal eat supper street viewnavig

distanc

Page 24: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Stemming

look restaur bar pub just funlondon search applic

inform needcan search everi type food want french

british chines indian etc car bicycl walk

can canus view object map visual rout

searchcan cansearch object view distanc

can objectview neardirectdurat

can canus usstreet view navig

foodkeyword london restaur bar pub view

breakfast lunch dinner meal eat supper street navig

Page 25: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Make Slides Invisible

• Focus on clarity!

• Avoid all that distracts from the message!

• Slides should support your (spoken) word!

• Always prefer diagrams over text!

• Avoid bullet lists (like this one)

Page 26: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

“Travel” Cluster

Page 27: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Maths

fh,!(x, y) = !Ex,y

! t!

0Lx,y!(!u)"(x) du

= h

!Lx,z"(x)#x(dz)

+ h

"1t!

#Ey

! t!

0Lx,yx(s)"(x) ds ! t!

!Lx,z"(x)#x(dz)

$

+1t!

#Ey

! t!

0Lx,yx(s)"(x) ds ! Ex,y

! t!

0Lx,y!(!s)"(x) ds

$%

= h&Lx"(x) + h$!(x, y)(64)

Page 28: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

State abstraction abs:V ! S

Concrete state v = (x1, x2, . . . , xn)v ! V

xi

with– Return value of an inspector

Trace t =!

(v1,m1, v!

1), (v2,m2, v!

2), . . ."

vi ! V mi and – name of a mutatorwith

Transition condition!(v,m,v

") # t · abs(v) = s $ abs(v") = s"

sm!! s

" s, s! " Swith iff

Formal Background

Model with transitions sm!! s

" s, s! " Sand states

Page 29: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Maths

• Avoid maths.!

• Formulae are for papers, not slides!

• Few people can read + understand complex formulae in 30 seconds!

• Demonstrate that the formal foundation can be presented on demand

Page 30: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Examples

• Examples are more important than maths!

• Have one example throughout your talk to illustrate the key idea!

• Use additional examples for specifics!

• Your audience will get excited by the example – and read your paper for the full foundations

Page 31: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

216 Structural Testing

{ char *eptr = encoded;

char *dptr = decoded;

int ok = 0;

char c;

c = *eptr;

if (c == '+') {

*dptr = ' ';

}

while (*eptr) {

True

*dptr = '\0';

return ok;

}

False

True

int digit_high = Hex_Values[*(++eptr)];

int digit_low = Hex_Values[*(++eptr)];

if (digit_high == -1 || digit_low == -1) {

True

ok = 1;

}

True

else {

*dptr = 16 * digit_high + digit_low;

}

False

++dptr;

++eptr;

}

False

False

elseif (c == '%') {

else

*dptr = *eptr;

}

int cgi_decode(char *encoded, char *decoded)

A

C

B

D E

F G

H I

L

M

Figure 12.2: The control flow graph of function cgi decode from Figure 12.1

Draft version produced August 1, 2006

A

B

C

D E

GF

H I

LM

“test”✔

✔✔

Page 32: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

216 Structural Testing

{ char *eptr = encoded;

char *dptr = decoded;

int ok = 0;

char c;

c = *eptr;

if (c == '+') {

*dptr = ' ';

}

while (*eptr) {

True

*dptr = '\0';

return ok;

}

False

True

int digit_high = Hex_Values[*(++eptr)];

int digit_low = Hex_Values[*(++eptr)];

if (digit_high == -1 || digit_low == -1) {

True

ok = 1;

}

True

else {

*dptr = 16 * digit_high + digit_low;

}

False

++dptr;

++eptr;

}

False

False

elseif (c == '%') {

else

*dptr = *eptr;

}

int cgi_decode(char *encoded, char *decoded)

A

C

B

D E

F G

H I

L

M

Figure 12.2: The control flow graph of function cgi decode from Figure 12.1

Draft version produced August 1, 2006

A

B

C

D E

GF

H I

LM

“test”✔

✔✔

0

25

50

75

100

Abdeckung

63

Page 33: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

216 Structural Testing

{ char *eptr = encoded;

char *dptr = decoded;

int ok = 0;

char c;

c = *eptr;

if (c == '+') {

*dptr = ' ';

}

while (*eptr) {

True

*dptr = '\0';

return ok;

}

False

True

int digit_high = Hex_Values[*(++eptr)];

int digit_low = Hex_Values[*(++eptr)];

if (digit_high == -1 || digit_low == -1) {

True

ok = 1;

}

True

else {

*dptr = 16 * digit_high + digit_low;

}

False

++dptr;

++eptr;

}

False

False

elseif (c == '%') {

else

*dptr = *eptr;

}

int cgi_decode(char *encoded, char *decoded)

A

C

B

D E

F G

H I

L

M

Figure 12.2: The control flow graph of function cgi decode from Figure 12.1

Draft version produced August 1, 2006

A

B

C

D E

GF

H I

LM

“test”✔

✔✔

“a+b”

0

25

50

75

100

Abdeckung

72

Page 34: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

216 Structural Testing

{ char *eptr = encoded;

char *dptr = decoded;

int ok = 0;

char c;

c = *eptr;

if (c == '+') {

*dptr = ' ';

}

while (*eptr) {

True

*dptr = '\0';

return ok;

}

False

True

int digit_high = Hex_Values[*(++eptr)];

int digit_low = Hex_Values[*(++eptr)];

if (digit_high == -1 || digit_low == -1) {

True

ok = 1;

}

True

else {

*dptr = 16 * digit_high + digit_low;

}

False

++dptr;

++eptr;

}

False

False

elseif (c == '%') {

else

*dptr = *eptr;

}

int cgi_decode(char *encoded, char *decoded)

A

C

B

D E

F G

H I

L

M

Figure 12.2: The control flow graph of function cgi decode from Figure 12.1

Draft version produced August 1, 2006

A

B

C

D E

GF

H I

LM

“test”✔

✔✔

“a+b”

“%3d”

0

25

50

75

100

Abdeckung

91

Page 35: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

216 Structural Testing

{ char *eptr = encoded;

char *dptr = decoded;

int ok = 0;

char c;

c = *eptr;

if (c == '+') {

*dptr = ' ';

}

while (*eptr) {

True

*dptr = '\0';

return ok;

}

False

True

int digit_high = Hex_Values[*(++eptr)];

int digit_low = Hex_Values[*(++eptr)];

if (digit_high == -1 || digit_low == -1) {

True

ok = 1;

}

True

else {

*dptr = 16 * digit_high + digit_low;

}

False

++dptr;

++eptr;

}

False

False

elseif (c == '%') {

else

*dptr = *eptr;

}

int cgi_decode(char *encoded, char *decoded)

A

C

B

D E

F G

H I

L

M

Figure 12.2: The control flow graph of function cgi decode from Figure 12.1

Draft version produced August 1, 2006

A

B

C

D E

GF

H I

LM

“test”✔

✔✔

“a+b”

“%3d”

“%g”

0

25

50

75

100

Abdeckung

100

Page 36: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Diagrams

• Use simple, clear diagrams!

• Convey exactly one message per diagram

Page 37: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

App Classi!cation

Predicted as Malicious!

Predicted as!Benign

Malicious Apps 56 % 44 %

Benign Apps 16 % 84 %

With Clusters (our approach)

Page 38: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Correct Classi!cationWith Clusters (our approach)

Malicious Apps

Benign Apps

0 % 25 % 50 % 75 % 100 %

84 %

56 %

Page 39: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Visuals and Animation

• Visuals and animations are ok in diagrams!

• Every other use should be well motivated!

• Do not use them as decorations!

• Do not use them as distractions!

• Avoid overused graphic clichés

Page 40: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

What’s Wrong?

Page 41: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Death by Powerpoint

Page 42: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Strive for Simplicity

• Simple messages get across easier!

• Simple examples fit on one slide!

• Simple slides make the audience listen!

• Simple claims tend to be general, too!

• Simple = Hard!

Page 43: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

The Talk

• Do not read your slides (from paper or slides)!

• Speak slowly, loudly and clearly!

• Speak persona!y (Use “I”, not “one”)!

• Change your tone – and use pauses

Page 44: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

The Jelly Factor

• Every presenter is nervous (and so am I)!

• Legs start shaking!

• Need for air!

• Brain goes into stand-by mode!

• … but nobody will notice, let alone worry

Page 45: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

The Jelly Factor

Before the talk:!

• Wash your hands!

• Sit down!

• Go through your slides!

• Memorize the first sentences (no brain required)

Page 46: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Your Impression

7 %

38 %55 %

Body languageVoiceContent

Page 47: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

• Tell a story!

• Talk directly to the audience!

• Ask rhetorical questions (“What should the poor peasants do?”)&

• Search eye contact to audience (not to slides, not to professor)!

• Convey your own enthusiasm and excitement!

Connect to the Audience

Page 48: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Some Great Presenters

Page 49: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Steve Jobs

Page 50: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Lawrence Lessig

Page 51: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Concluding the Talk

• Refer to the beginning …and they lived in peace henceforth&

• Summarize …and the key point is:&

• Open issues …but there are more dragons that loom in the dark&

• Consequences If you ever see a dragon, …

Page 52: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Checking App Behavior Against App Descriptions

Andreas Zeller Saarland University, Saarbrücken, Germany

Joint work with Alessandra Gorla, Ilaria Tavecchia, and Florian Gross

http://www.st.cs.uni-saarland.de/chabada/

Page 53: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Any Questions?

• Good research raises lots of questions!!

• Questions are great to connect to the audience and to direct and shape own work!

• The worst embarrassment is to have no questions at a!

Page 54: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Dealing with Hard Questions

• Repeat question (helpful for audience + gives time for preparing an answer)!

• In doubt: “I don’t know, but I’ll look into it”!

• Or: “Let’s just take this offline”!

• Be respectful to the audience –no punching in the lecture room

Page 55: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Summary

Page 56: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial
Page 57: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial
Page 58: The Perfect Talk - uni-saarland.deYour Audience • Have read all your earlier papers! • Thoroughly understand Computational Complexity of Bio-inspired Computation in Combinatorial

Summary