Paper for next month, and a proposal?

[Jamison Dance]

The last meeting was great. Thanks to Aaron for coming.

We need to pick a paper for next time. Any suggestions?

Bret brought up picking papers where we can actual code up what they describe, and comparing implementations. This could give us more insight in to what they are actually talking about. What do you guys think?

Also, how can we get more people to come? I am trying to advertise it some, but turnout could still be a little higher. Ideas?

[Bret Little]

Here is a paper:  https://courses.csail.mit.edu/6.042/spring12/mcs.pdf 

You'd probably have time to read it during your lunch hour ;)

[Dan Dorman]

On Monday, July 16, 2012 at 12:16 PM, Jamison Dance wrote:

We need to pick a paper for next time. Any suggestions?

Digging through my reading pile, I found “Arguments and Results” by James Noble. It’s about thirteen pages. Here's the abstract:

If an object oriented program is a collection of communicating objects, then the objects' protocols define the languages the program speaks. Unfortunately, protocols are difficult to design in isolation, so many programs' protocols are not as well designed as they could be. This paper presents six patterns which describe how objects protocols can be designed or redesigned. By using these patterns, programs and designs can be made more simple, more general, and more easy to change.

I don't know how well it will work with Bret's idea of implementing code—which is a really good one—but it seems like there could be some interesting principles we could work with. I've attached the PDF.

 

Also, how can we get more people to come? I am trying to advertise it some, but turnout could still be a little higher. Ideas?

Twitter account? Web site?

Dan 

[Jamison Dance]

I like the idea of a Twitter account.

I found this sweet website the other day that lists some top papers by
citations: http://citeseerx.ist.psu.edu/stats/articles

It has a few interesting ones I have never heard of, and hopefully
since they are mostly older they might require less specific knowledge
of their fields to understand.

> --
> You received this message because you are subscribed to the Google Groups
> "Papers in Computer Science" group.
> To post to this group, send email to
> papers-in-com...@googlegroups.com.
> To unsubscribe from this group, send email to
> papers-in-computer-...@googlegroups.com.
> For more options, visit https://groups.google.com/groups/opt_out.
>
>

[Dan Dorman]

On Thursday, July 19, 2012 at 10:39 AM, Jamison Dance wrote:

I found this sweet website the other day that lists some top papers by

citations: http://citeseerx.ist.psu.edu/stats/articles

That looks like a great resource. Anything grab you? 

[Bret Little]

I like the idea of sorting by citations. Generally the more citations, the more influential the paper has been. I think we could easily enough start with a simple twitter account, and maybe at some point put together a small website.

[Blake Lucchesi]

I havn't read the paper yet, but it seems like a great topic for discussion.  Can't wait to join in at the next discussion.

Blake

[Bret Little]

Here is a good list: http://jeffhuang.com/best_paper_awards.html

[Jamison Dance]

Looks like an interesting resource. I am wary of recent papers because
many of them depend on deep domain knowledge, but if some of them are
easily understandable that could be a great resource.

Found this list today too:
http://en.wikipedia.org/wiki/List_of_important_publications_in_computer_science

We need to pick the next paper. Any other suggestions besides Dan's?

> --
> You received this message because you are subscribed to the Google Groups
> "Papers in Computer Science" group.
> To post to this group, send email to
> papers-in-com...@googlegroups.com.
> To unsubscribe from this group, send email to
> papers-in-computer-...@googlegroups.com.

> To view this discussion on the web visit
> https://groups.google.com/d/msg/papers-in-computer-science/-/FQ3sr-2QPTIJ.

[Joseph Coco]

I'm assuming this is relatively open to the public. I recently got my Masters in CS with a Bioinformatics concentration. Most of the papers I have been reading lately have been biology and stats heavy for this reason but I also have some great digital forensics papers I've read within the past year or so. Unfortunately nothing semi-general jumps out at the moment as a suggestion.

Unfortunately most of 

[Jamison Dance]

Joseph, this is absolutely open to the public. Welcome.

My undergrad was CS with a Bioinformatics emphasis, though I haven't
used it much. The rest of your email disappeared, but if someone has
expertise in a field that people are interested in and can explain it
like I am five years old, then maybe we could tackle some more
specific papers.

http://www.cs.cmu.edu/~cga/behavior/rabiner1.pdf - A Tutorial on
Hidden Markov Models and Selected Applications in Speech Recognition
is interesting, but the math is pretty intense for me in some parts.

I have also been looking at Indexing By Latent Semantic Analysis -
http://www.cs.cmu.edu/~cga/behavior/rabiner1.pdf, which is related to
natural language processing and information retrieval. It has some
linear algebra, but seems less intense, and shorter, than the Hidden
Markov Model one.

> --
> You received this message because you are subscribed to the Google Groups
> "Papers in Computer Science" group.
> To post to this group, send email to
> papers-in-com...@googlegroups.com.
> To unsubscribe from this group, send email to
> papers-in-computer-...@googlegroups.com.
> To view this discussion on the web visit

> https://groups.google.com/d/msg/papers-in-computer-science/-/50RK8BX2oTcJ.

[James Bell]

>> Also, how can we get more people to come? I am trying to advertise it
>> some, but turnout could still be a little higher. Ideas?

Open to the public? Looking for more people? Sweet - as a Computer Engineer by training who has spent a good deal of the last ten years working on simple web applications, I'd love to jump in on this.

>> We need to pick a paper for next time. Any suggestions?

There's another good resource of interesting papers from the CS Theory Stackexchange: http://cstheory.stackexchange.com/questions/1168/what-papers-should-everyone-read.

Not all of them have links though. I'd suggest this: What Every Computer Scientist Should Know About Floating-Point Arithmetic - http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.102.244&rep=rep1&type=pdf which seems to cover everyone's favorite mathematical rounding issue. I'm sure I covered this back at Uni, but it'd be a good to refresh.
 
The paper Dan suggested looks interesting too..

James

[Jamison Dance]

Sorry, been a little crazy this month so I have been neglecting this.

Since there doesn't seem to be a strong consensus either way, I think we should read Dan's suggestion. As for a time, how does Wednesday the 23rd at 7:00 pm MST sound for everybody?

--
You received this message because you are subscribed to the Google Groups "Papers in Computer Science" group.
To post to this group, send email to papers-in-com...@googlegroups.com.
To unsubscribe from this group, send email to papers-in-computer-...@googlegroups.com.

To view this discussion on the web visit https://groups.google.com/d/msg/papers-in-computer-science/-/1p07uYrThnUJ.

[Jamison Dance]

Are you guys good to meet on Wednesday the 23rd at 7:00 pm MST? We are
talking about the Arguments and Results paper on object-oriented
system available here: www.laputan.org/pub/patterns/noble/noble.pdf.

[Jamison Dance]

Also, we will be meeting via this Google+ hangout:
https://plus.google.com/hangouts/_/181a574d98f8d13907be753264e424e51b544e4a?authuser=0&hl=en-US

[Scott Nielsen]

There is no Wednesday August 23rd until 2017. I'm assuming the 22nd. :)

Scott

[Jamison Dance]

Whoops. Next month's paper will be on manipulating the space-time
continuum. Until then, yeah, the 22nd. :)

[Stephen M. McQuay]

On Mon, Aug 20, 2012 at 12:24:17PM -0600, Scott Nielsen wrote:
>There is no Wednesday August 23rd until 2017. I'm assuming the 22nd. :)

Oh, all that snark without some code to show how you came to that
conclusion!?

--
Stephen M. McQuay
http://mcquay.me/vcf

[Scott Nielsen]

Initially, I just looked at a calendar, but since you've requested it, here is a script to print the all the years which have August 23rd falling on a Wednesday for the rest of the century.

#!/usr/bin/env python
import datetime

for year in range(2012, 2100):
if datetime.date(year, 8, 23).weekday() == 2:
print year

[Jamison Dance]

Here is my python script to change space-time to make this wednesday the 23rd.

#! /usr/bin/env python
import spacetime

# phenomenal cosmic power
spacetime.days.subtract(1)

[James Bell]

I won't be able to make it as my first meeting, as I'll be somewhere over the North Atlantic. It seems an interesting paper though, and I'm looking forward to next month..

[Jamison Dance]

Final reminder. We are meeting tonight at 7:00 PM MST at this Google+
hangout: https://plus.google.com/hangouts/_/181a574d98f8d13907be753264e424e51b544e4a?authuser=0&hl=en-US.

We are talking about Arguments and Results, available here:
http://www.laputan.org/pub/patterns/noble/noble.pdf

See you guys tonight!

[Bret Little]

Won't make it tonight :( Got back from vacation in Seattle last night at 2:00am. See ya next month!

--
You received this message because you are subscribed to the Google Groups "Papers in Computer Science" group.
To post to this group, send email to papers-in-com...@googlegroups.com.
To unsubscribe from this group, send email to papers-in-computer-...@googlegroups.com.

For more options, visit https://groups.google.com/groups/opt_out.

--

Bret Little

Cell: 801-615-3255

Work: 801-373-0151 x1492