As of now we have approved the list of talks for YAPC::NA 2012. You made it tough. We had 150 talks submitted, and only had room in the schedule for 95! So we had to make some tough choices.
If your talk was chosen you have until April 19th to confirm it on the site. If you do not confirm it by April 19th then your talk will be removed from the schedule, and a replacement talk will be scheduled. Likewise, if for any reason you no longer want to or cannot give the talk, please let us know.
If your talk was not chosen, fear not, there is still hope. Your best bet for getting your talk on the schedule is to convert it into a 5 minute lightening talk. There is room at the end of each day for 10+ lightening talks, and none of them have been scheduled yet. Also, some people will definitely drop out from the list that was chosen. When they do, a spot opens up for those talks that have been submitted but not chosen.
The YAPC::NA 2012 staff would like to thank you all for your talk submissions. You have ensured that we will have a spectacular conference in Madison this year!
In my chapter on subroutines, I need to explain recursion. One example program I give draws mazes recursively. Here's a variation of the program, somewhat expanded beyond the book example.
Some days ago, Marpa::XS reached version 1.0. Jeffrey Kegler, Marpa's godfather already wrote a some blogs about the algorithm operating behind.
In order to get a feeling on how to use Marpa, I decided to try it for parsing CSS. Thankfully, the official grammar for CSS is available. So I tried to become a friend of Marpa::XS. I was used to work with Parse::RecDescent in the past, so I could not imagine to get into trouble. However, using both modules is different. Parse::RecDescent handles the scanning process by itself and allows various shortcuts for repeating elements inside a grammar. Marpa on the other hand needs a separate scanner to feed it with tokens and only allows very simple grammar rules. Parse::RecDescent combines parser code and grammar rules in one string. Marpa keeps the grammar clean and calls action methods based on rules defined inside the grammar.
Some of my scripts are still set in stone age when it comes to the practice of sending emails. They almost invariably use Mail::Sendmail, a module that has not been updated since 2003 (and why should it if it doesn't break, right?). So far there's no complaints. The usual incantation for sending email using this module is:
use Mail::Sendmail;
mail(From=>$rfc_from, Sender=>$env_sender, Subject=>$subject,
To=>$rcpt, Cc=>$other_rcpt,
Message=>$body) or warn "Can't send mail: $Mail::Sendmail::error";
But today I need to switch transport to sendmail. Despite what the name might suggest, Mail::Sendmail uses SMTP for transport and there's no alternative transport. There's also no support for SMTP auth, which my SMTP server now requires even for access from localhost. From what I read and tried once or twice in the past, the current "best practice" or recommended way is to use Email::Sender. Here's the incantation for sending mail using sendmail:
How should a JSON parser handle character strings with non-ASCII characters? My humble opinion: fatal error. Here's what the JSON parsers on my machine did:
My employer decided to opensource one of their internal tools: STF. STF is a distributed object store, much like MogileFS. The main difference is that STF uses HTTP (as opposed to a custom protocol) as its main protocol, uses components such as Apache/nginx, MySQL, memcached, Q4M/TheSchwartz. It's also new and therefore natively speaks PSGI internally, so you can use all your PSGI aware goodies. We also have an proof of concept setup to deploy STF on dotCloud platform.
Livedoor serves about 300 million objects (which means about 1.4 billion physical entities) using commodity hardware, running Apache 2.2 (+mod_reproxy), Memcached, MySQL 5.1, Q4M. Dispatchers are deployed on Plack + Starlet. We're also wrapping the application processes with Server::Starter for zero-downtime deployment (that means I can deploy to these heavily bombarded servers pretty much any time I want!)
Lee Aylward will be giving a talk at YAPC::NA 2012 described as:
After investigating oEmbed, I came to the conclusion that oEmbed is a great idea, but difficult to use in practice. oEmbed providers are inconsistent and unreliable. So I built Noembed, a consistent oEmbed gateway to a large list of sites (many that don’t even support oEmbed themselves.)
Noembed was built using a mix of Plack and AnyEvent. It is used by us at Ars Technica, and will soon be used by a fairly popular Twitter client.
I’ll give a quick overview of the oEmbed spec, show some of the Noembed internals, and then do short demo.
No, really. This clown apparently thinks he can make money by stalking you online. The problem, as even he recognizes, is that you're able to prevent creeps like LOLchromatic from stalking you. The solution is that most people don't know that LOLchromatic and his ilk exist.
Was using an ubuntu virtual machine. Issued "ack" It said to install it using "sudo apt-get install ack". I did it. It didn't install App::Ack :( it is some other stupid tool. So, "sudo apt-get remove ack" followed by "sudo cpan App::Ack".
Breno de Oliveira will be giving a talk at YAPC::NA 2012 described as:
Tall and tan and young and lovely, the Brazilian Perl communities have grown a lot over the past decade and have a lot to share with other communities worldwide. Sadly, though, most of the time it feels like there are huge barriers between South America and North America/Europe. I hope to change that a bit now :)
In this talk I share a little about the Brazilian Perl communities’ past, present and future, and try to raise some awareness to the things we’re doing around these parts, and how we’re doing it.
Oh, and also invite everyone to visit us for some hacking by the beach, of course :)
2011 is my most productive year yet in my "CPAN career": 495 releases (compared to 119 in 2010 and 54 in 2009). So far I have 115 distributions listed under my account (compared to around 15-20 in 2010, around 10 in 2009, and 2 before that). It really never occured to me that I would release over a hundred modules to CPAN, but all of a sudden I did. Perhaps next goal should be 1000 :)
Dist::Zilla helps a lot. I can't imagine doing manual tar and updating version numbers and README and all those distribution meta files manually for tens, let alone hundreds of releases. So thanks again to RJBS and other Dist::Zilla contributors!
Marpa::XS is now
1.000000.
Marpa::XS is the current lead implementation of Marpa,
an algorithm that I hope will become
standard for
those parsing problems which are too
complex for regular expressions.
Apparently quite a number of people have put
the beta to use.
Feedback has been positive -- often extremely so.
What is Marpa?
Marpa is a general BNF parser --
it parses anything you can write in BNF, no exceptions.
Left-recursion, right-recursion, ambiguity and
even infinite ambiguity, you name it, Marpa parses it.
If the grammar is of
a class in practical use,
Marpa parses it in linear time -- O(n).
I'm trying to contact Jeff Kim about his Net::Amazon::EC2 module. I have a repo on github that closes most of the open tickets on RT for this module. I'd very much like to prepare and upload a new distribution to CPAN and close those RT tickets.
Jeff, if you see this please email me: mallen at cpan dot org.
R Geoffrey Avery will be giving a talk at YAPC::NA 2012 that he describes as:
When attempting to learn Dancer I ran into the problem that all the documentation started from “Here is a ‘Hello World’ script”. But that was assuming many things were set up and configured and that just was not true, at least not on my server.
The MetaCPAN logo contest is now in full swing, thanks in no small part to FLORA for his blood, sweat and tears in organizing it and also to the Enlightened Perl Organization, which fully funded this contest with astonishing speed.
Now, you don't need to be a designer to get involved. Here are a couple of ways you can help out:
1) Get the word out. Let your designer friends know there is $400 up for grabs (not to mention eternal glory). If you're active on Twitter, please tweet about it as well. Send an email to your local PerlMongers group etc.
2) Comment on the entries. Because there is no limit on the number of entries per contestant, the logo submission process is allowed to be iterative. Constructive criticism can lead to authors resubmitting tweaked versions of their logos, which can only be good for the contest.
Not nearly so exciting as my announcement of Zoidberg, but today I announce the release of Tie::Array::CSV version 0.04.
Tie::Array::CSV leverages Tie::File and Text::CSV to allow access to a CSV file as a native Perl 2D array (i.e. array of array references), without having to read the (entire) file into memory.
The major improvement in 0.04 was inspired by a conversation with David Mertens at the WindyCity.pm imformal meeting a couple weeks back. As I was explaining T::A::CSV to the group over a couple beers, David asked if the file is updated at every change. I said proudly that it was, however he noted that this has some drawbacks.
Dancer uses a simple model of interfacing with templating engines (based on
Dancer::Template::Abstract) and makes it very easy to add support for new
engines. Thanks to this, if you're not happy with the default simple engine
or with Template Toolkit, there is now
a dozen different alternatives to choose from. Let's take a look at some of
them.
