<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0"><channel><atom:link rel="hub" href="http://tumblr.superfeedr.com/" xmlns:atom="http://www.w3.org/2005/Atom"/><description>Pauls Gedanken.

Paŭlo’s thoughts.</description><title>Pensoj de Paŭlo</title><generator>Tumblr (3.0; @paul-ebermann)</generator><link>http://paul-ebermann.tumblr.com/</link><item><title>The Internet is broken: could we please fix it?</title><description>&lt;a href="http://blog.cryptographyengineering.com/2012/02/how-to-fix-internet.html"&gt;The Internet is broken: could we please fix it?&lt;/a&gt;</description><link>http://paul-ebermann.tumblr.com/post/18687030133</link><guid>http://paul-ebermann.tumblr.com/post/18687030133</guid><pubDate>Sat, 03 Mar 2012 23:26:31 +0100</pubDate><category>cryptography</category></item><item><title>Horrible tags on Stack Overflow</title><description>&lt;p&gt;Every once in a while I stumble about a tag on &lt;a href="http://stackoverflow.com/"&gt;Stack Overflow&lt;/a&gt; which&lt;/p&gt;

&lt;ul&gt;&lt;li&gt;has no useful meaning; or&lt;/li&gt;
&lt;li&gt;is a marker for questions which are generally off-topic or not constructive.&lt;/li&gt;
&lt;/ul&gt;&lt;p&gt;Sometimes I try to open a post on &lt;a href="http://meta.stackoverflow.com/"&gt;Meta Stack Overflow&lt;/a&gt; about these to collect some help to clean them up.
But as each user has only a limited amount of close-votes (and you need five votes from different users (or one from a moderator) to close a question), one can do that only every so often, these questions would take votes away from each other.&lt;/p&gt;

&lt;p&gt;So here I&amp;#8217;ll try to have a list of these tags so I don&amp;#8217;t forget.&lt;/p&gt;

&lt;ul&gt;&lt;li&gt;&lt;a href="http://stackoverflow.com/search?q=%5Bfuture%5D+closed%3A0"&gt;[future]&lt;/a&gt;: A lot of these are questions about future events. &lt;a href="http://meta.stackoverflow.com/questions/110042/help-wanted-clean-up-the-future-tag"&gt;Prophesies are not on-topic on SO.&lt;/a&gt;. The on-topic meaning would be the &lt;a href="http://en.wikipedia.org/wiki/Futures_and_promises"&gt;concept used in concurrent programming&lt;/a&gt;.&lt;/li&gt;
&lt;li&gt;&lt;a href="http://stackoverflow.com/questions/tagged/protected"&gt;[protected]&lt;/a&gt;: About quite some different things, like the &lt;code&gt;protected&lt;/code&gt; keyword in some programming languages, protected memory, protected Twitter accounts, password-protected files, protecting video downloads, &amp;#8230; . I&amp;#8217;m not sure how to sensibly retag this. (The tag also has no tag wiki.)&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;a href="http://stackoverflow.com/search?q=%5Balternative%5D+closed%3A0"&gt;[alternative]&lt;/a&gt;: This looks like another tag which contains many non-constructive questions.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;&lt;a href="http://stackoverflow.com/questions/tagged/documents"&gt;[documents]&lt;/a&gt;&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;[word] vs. [msword]&lt;/li&gt;
&lt;/ul&gt;&lt;p&gt;I&amp;#8217;ll add more later as I stumble about them.&lt;/p&gt;</description><link>http://paul-ebermann.tumblr.com/post/12037471093</link><guid>http://paul-ebermann.tumblr.com/post/12037471093</guid><pubDate>Fri, 28 Oct 2011 19:35:00 +0200</pubDate><category>stackoverflow</category><category>english</category></item><item><title>Abstimmen für den Deutschen Esperanto-Bund</title><description>&lt;a href="https://verein.ing-diba.de/kultur/10317/deutscher-esperanto-bund-ev"&gt;Abstimmen für den Deutschen Esperanto-Bund&lt;/a&gt;: &lt;p&gt;Die “Ing-DiBa” Bank hat gerade eine Kampagne laufen, bei der an 1000 Vereine für gemeinnützige Projekte je 1000 Euro verteilt werden.&lt;/p&gt;

&lt;p&gt;Einer der Kandidaten ist der Deutsche Esperanto-Bund, welcher damit Reisekosten von ausländischen Teilnehmern zu Esperanto-Treffen in Deutschland bezuschussen will.&lt;/p&gt;

&lt;p&gt;Um dafür ausgewählt zu werden, müssen viele Leute dafür stimmen.
Dazu muss man auf der Webseite der Ing-DiBa seine E-Mail-Adresse eingeben (und noch ein Captcha lösen, um zu zeigen, dass man nicht blind ist), und dann in dem in der erhaltenen E-Mail enthaltenen Link seine Stimme bestätigen.&lt;/p&gt;

&lt;p&gt;Man darf pro E-Mail-Adresse bis zu drei mal abstimmen, für den gleichen oder auch verschiedene Vereine. Der DEB ist zur Zeit auf Position 1882. Die Aktion läuft noch bis zum 15. November, und wir hoffen, dass wir dann mindestens auf Position 1000 sind.&lt;/p&gt;</description><link>http://paul-ebermann.tumblr.com/post/11784083700</link><guid>http://paul-ebermann.tumblr.com/post/11784083700</guid><pubDate>Sat, 22 Oct 2011 21:22:54 +0200</pubDate><category>Deutsch</category><category>esperanto</category></item><item><title>Reposurgeon - manipulate revision histories</title><description>&lt;a href="http://www.catb.org/~esr/reposurgeon/reposurgeon.html"&gt;Reposurgeon - manipulate revision histories&lt;/a&gt;</description><link>http://paul-ebermann.tumblr.com/post/10473790480</link><guid>http://paul-ebermann.tumblr.com/post/10473790480</guid><pubDate>Wed, 21 Sep 2011 08:02:06 +0200</pubDate><category>git</category><category>dvcs</category><category>english</category></item><item><title>Syntax highlighting in LaTeX: minted</title><description>&lt;a href="http://tug.ctan.org/tex-archive/macros/latex/contrib/minted/"&gt;Syntax highlighting in LaTeX: minted&lt;/a&gt;: &lt;p&gt;The standard answer to embedding source code listings in a LaTeX document is the &lt;a href="http://tug.ctan.org/tex-archive/macros/latex/contrib/listings"&gt;listings&lt;/a&gt; package. It works in pure LaTeX, by parsing the source code and highlighting some parts of them.&lt;/p&gt;

&lt;p&gt;An alternative I just &lt;a href="http://stackoverflow.com/q/1985330/600500"&gt;found on Stack Overflow&lt;/a&gt; is the &lt;a href="http://tug.ctan.org/tex-archive/macros/latex/contrib/minted/"&gt;minted&lt;/a&gt; package, created by Konrad Rudolph. It uses the &lt;a href="http://pygments.org/"&gt;Pygments&lt;/a&gt; library to do the actual parsing and highlighting.&lt;/p&gt;

&lt;p&gt;I did not yet try the package, but I will and then update this post for my experiences.&lt;/p&gt;</description><link>http://paul-ebermann.tumblr.com/post/9917421233</link><guid>http://paul-ebermann.tumblr.com/post/9917421233</guid><pubDate>Wed, 07 Sep 2011 16:00:05 +0200</pubDate><category>pygments</category><category>minted</category><category>syntax-highlighting</category><category>latex</category><category>stackoverflow</category><category>english</category></item><item><title>Javascript Cryptography Considered Harmful</title><description>&lt;a href="http://www.matasano.com/articles/javascript-cryptography/"&gt;Javascript Cryptography Considered Harmful&lt;/a&gt;</description><link>http://paul-ebermann.tumblr.com/post/9910411153</link><guid>http://paul-ebermann.tumblr.com/post/9910411153</guid><pubDate>Wed, 07 Sep 2011 08:00:06 +0200</pubDate><category>cryptography</category><category>javascript</category></item><item><title>Panopticlick - how unique (and trackable) is your browser?</title><description>&lt;a href="http://panopticlick.eff.org/"&gt;Panopticlick - how unique (and trackable) is your browser?&lt;/a&gt;: &lt;p&gt;It shows that each of my seven browsers here has a unique fingerprint.&lt;/p&gt;

&lt;p&gt;In most of them, even the Accept header is already unique (there is Esperanto as first language, followed by German and English).&lt;/p&gt;</description><link>http://paul-ebermann.tumblr.com/post/9537019580</link><guid>http://paul-ebermann.tumblr.com/post/9537019580</guid><pubDate>Mon, 29 Aug 2011 08:00:05 +0200</pubDate><category>privacy</category><category>english</category></item><item><title>A Stick Figure Guide to the Advanced Encryption Standard (AES)</title><description>&lt;a href="http://www.moserware.com/2009/09/stick-figure-guide-to-advanced.html"&gt;A Stick Figure Guide to the Advanced Encryption Standard (AES)&lt;/a&gt;: &lt;p&gt;By Jeff Moser, this is a guide in stick-figure-comic form, which explains how AES came to be, how the AES cryptography works, and also some of the math behind it.&lt;/p&gt;

&lt;p&gt;It also mentions “Confusion” and “Diffusion”, the important principles in Cryptographic algorithms.&lt;/p&gt;

&lt;p&gt;There is a corresponding &lt;a href="https://github.com/moserware/AES-Illustrated"&gt;implementation at GitHub&lt;/a&gt;.&lt;/p&gt;</description><link>http://paul-ebermann.tumblr.com/post/9325656907</link><guid>http://paul-ebermann.tumblr.com/post/9325656907</guid><pubDate>Wed, 24 Aug 2011 08:00:05 +0200</pubDate><category>cryptography</category><category>AES</category><category>stick-figures</category></item><item><title>Falsehoods Programmers Believe About Names</title><description>&lt;a href="http://www.kalzumeus.com/2010/06/17/falsehoods-programmers-believe-about-names/"&gt;Falsehoods Programmers Believe About Names&lt;/a&gt;</description><link>http://paul-ebermann.tumblr.com/post/8987096406</link><guid>http://paul-ebermann.tumblr.com/post/8987096406</guid><pubDate>Tue, 16 Aug 2011 08:00:05 +0200</pubDate><category>english</category><category>names</category></item><item><title>Managing Hierarchical Data in MySQL</title><description>&lt;a href="http://mikehillyer.com/articles/managing-hierarchical-data-in-mysql/"&gt;Managing Hierarchical Data in MySQL&lt;/a&gt;: &lt;p&gt;An article about how to model hierarchical data in a relational database (specifically MySQL, but likely also applying to other relational DBMS).&lt;/p&gt;

&lt;p&gt;Originally, this article was on the MySQL developement site, and linked heavily as &lt;code&gt;&lt;a href="http://dev.mysql.com/tech-resources/articles/hierarchical-data.html"&gt;http://dev.mysql.com/tech-resources/articles/hierarchical-data.html&lt;/a&gt;&lt;/code&gt;. But now Oracle (which owns MySQL after buying Sun, which itself bought MySQL some years ago) seems to have reorganized its site, with the effect that this link goes only to an Oracle search page.&lt;/p&gt;

&lt;p&gt;This was remarked by some anonymous Stack Overflow user, who suggested the following &lt;a href="http://stackoverflow.com/suggested-edits/86358"&gt;edit&lt;/a&gt; to an answer linking to this page:&lt;/p&gt;

&lt;blockquote&gt;
  &lt;p&gt;— UPDATE: The link is dead. Thanks Oracle. —&lt;/p&gt;
&lt;/blockquote&gt;

&lt;p&gt;I saw this edit suggestion by browsing through the list of suggested edits, and thought &lt;em&gt;this article should not have been completely gone away&lt;/em&gt;.&lt;/p&gt;

&lt;p&gt;&lt;a href="http://www.google.com/search?q=http://dev.mysql.com/tech-resources/articles/hierarchical-data.html"&gt;Googleing the URL&lt;/a&gt; did not really result in finding the current location of the article (only in some pages linking to the original one).
A good idea in such cases is the &lt;em&gt;Wayback Machine&lt;/em&gt; of the &lt;a href="http://www.archive.org/"&gt;Internet Archive&lt;/a&gt;. It stores previous versions of lots of pages - &lt;a href="http://web.archive.org/web/20100105135622/http://dev.mysql.com/tech-resources/articles/hierarchical-data.html"&gt;this one, too (last accessed in January 2010)&lt;/a&gt;.&lt;/p&gt;

&lt;p&gt;If I only wanted to read the old article, this would be enough - but no, I in fact want to correct the link, and it is not a good idea to link to the Wayback machine. But having the article itself, it was easy to copy a sampe sentence to Google, which finally found me the &lt;a href="http://mikehillyer.com/articles/managing-hierarchical-data-in-mysql/"&gt;new location&lt;/a&gt; of the article (on the web site of its original author).&lt;/p&gt;

&lt;p&gt;Thus I edited this &lt;a href="http://stackoverflow.com/q/3438663/600500"&gt;answer&lt;/a&gt; to include the new link (and the &lt;em&gt;title&lt;/em&gt; of the article).&lt;/p&gt;

&lt;p&gt;A short &lt;a href="http://www.google.com/search?q=http://dev.mysql.com/tech-resources/articles/hierarchical-data.html"&gt;google search for the original URL on stackoverflow alone&lt;/a&gt; shows that the link was quite popular. So I started an editing spree, starting to replace each occurrence of this link with the new one. I always try to correct other issues with the post, as well, or course.&lt;/p&gt;

&lt;p&gt;Have a look at my &lt;a href="http://stackoverflow.com/users/600500/paulo-ebermann?tab=activity"&gt;activity log&lt;/a&gt; to see how many edits I had to do for this (most entries with &lt;em&gt;revised&lt;/em&gt;, starting at 16:15 UTC today).&lt;/p&gt;</description><link>http://paul-ebermann.tumblr.com/post/8521103900</link><guid>http://paul-ebermann.tumblr.com/post/8521103900</guid><pubDate>Fri, 05 Aug 2011 20:11:36 +0200</pubDate><category>MySQL</category><category>stackoverflow</category><category>cool-uris</category></item><item><title>Cryptography Stack Exchange: public beta</title><description>&lt;a href="http://crypto.stackexchange.com/"&gt;Cryptography Stack Exchange: public beta&lt;/a&gt;: &lt;p&gt;Just half an hour ago, the new Cryptography Stack Exchange site transitioned from private beta to public beta.&lt;/p&gt;

&lt;p&gt;The original private beta period was extended because of &lt;a href="http://meta.crypto.stackexchange.com/q/42/58"&gt;not enough questions&lt;/a&gt;. Now we have 70 questions, 152 answers (and only two questions without any answers at all, apart from some ones closed as off-topic).&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;If you ever had a cryptographic question, ask it now&lt;/strong&gt;. You don’t even need to get an account.&lt;/p&gt;

&lt;p&gt;These were my questions (in reverse chronological order, and at the same time in vote number order):&lt;/p&gt;

&lt;ul&gt;&lt;li&gt;&lt;a href="http://crypto.stackexchange.com/q/270/58"&gt;Guarding against cryptanalytic breakthroughs: combining multiple hash functions&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="http://crypto.stackexchange.com/q/142/58"&gt;bcrypt: can one efficiently iterate valid hash output values?&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="http://crypto.stackexchange.com/q/116/58"&gt;Is using slow password hashing on the client side easier attackable than on the server side?&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;</description><link>http://paul-ebermann.tumblr.com/post/8399235133</link><guid>http://paul-ebermann.tumblr.com/post/8399235133</guid><pubDate>Tue, 02 Aug 2011 23:43:00 +0200</pubDate><category>crypto.stackexchange</category><category>english</category><category>cryptography</category></item><item><title>Does your choice of browser relate to your IQ?</title><description>&lt;a href="http://skeptics.stackexchange.com/q/5553/3497"&gt;Does your choice of browser relate to your IQ?&lt;/a&gt;: &lt;p&gt;Some study seems to show that lower-IQ users tend to use more Internet Explorer (and even more older IE versions), while higher-IQ ones tend to use Opera and Camino (and IE with Chrome Frame). Firefox, Safari and Chrome are preferred by the “middle” bunch.&lt;/p&gt;

&lt;p&gt;Is this really so? (I’m using Opera, by the way.)&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Update&lt;/strong&gt; (2011-08-08): Looks like this report was a hoax. The linked question had an answer detailed analyzing this, but it is deleted now, instead there is an answer explaining the hoax.&lt;/p&gt;</description><link>http://paul-ebermann.tumblr.com/post/8394449381</link><guid>http://paul-ebermann.tumblr.com/post/8394449381</guid><pubDate>Tue, 02 Aug 2011 21:40:00 +0200</pubDate><category>sceptics.stackexchange</category><category>english</category><category>IQ</category></item><item><title>TeXPrinter</title><description>&lt;a href="http://texprinter.sourceforge.net/"&gt;TeXPrinter&lt;/a&gt;</description><link>http://paul-ebermann.tumblr.com/post/7596122751</link><guid>http://paul-ebermann.tumblr.com/post/7596122751</guid><pubDate>Thu, 14 Jul 2011 03:42:54 +0200</pubDate><category>tex.stackexchange</category></item><item><title>Schnell tippen?</title><description>&lt;p&gt;&lt;a href="http://speedtest.schnell-schreiben.de" style="display: block; width: 300px; height: 100px; background: url('http://speedtest.schnell-schreiben.de/img/badge1.png') no-repeat; padding-top: 50px; padding-left: 60px; color: #009933; font-weight: bold; text-decoration: none; font-family: Times New Roman, Arial, serif; font-size: 40px;"&gt;399&amp;#160;Wörter&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;a href="http://speedtest.schnell-schreiben.de"&gt;Speedtest&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Mehr geht leider nicht - nach 400&amp;#160;Wörtern kommt nur noch &amp;#8220;undefined&amp;#8221;.&lt;/p&gt;

&lt;script src="https://gist.github.com/1081431.js?file=Prog.java"&gt;&lt;/script&gt;</description><link>http://paul-ebermann.tumblr.com/post/7587732784</link><guid>http://paul-ebermann.tumblr.com/post/7587732784</guid><pubDate>Wed, 13 Jul 2011 23:54:00 +0200</pubDate></item><item><title>Efficient XML Interchange format</title><description>&lt;a href="http://www.w3.org/TR/exi/"&gt;Efficient XML Interchange format&lt;/a&gt;: &lt;p&gt;Ein Transportformat für XML (bzw. genauer: für die selben Daten, die man auch mit XML übertragen kann), aber deutlich kompakter.&lt;/p&gt;

&lt;p&gt;Das verwendet als letzte Stufe auch Deflate.&lt;/p&gt;</description><link>http://paul-ebermann.tumblr.com/post/7572626047</link><guid>http://paul-ebermann.tumblr.com/post/7572626047</guid><pubDate>Wed, 13 Jul 2011 16:00:05 +0200</pubDate><category>deflate-zlib-etc</category><category>exi</category><category>xml</category><category>deflate</category></item><item><title>Question title that doesn't describe the problem</title><description>&lt;a href="http://meta.stackoverflow.com/q/41976/156902"&gt;Question title that doesn't describe the problem&lt;/a&gt;: &lt;p&gt;An example on how &lt;strong&gt;not&lt;/strong&gt; to ask questions and give answers on Stack Overflow.&lt;/p&gt;</description><link>http://paul-ebermann.tumblr.com/post/7564674780</link><guid>http://paul-ebermann.tumblr.com/post/7564674780</guid><pubDate>Wed, 13 Jul 2011 08:00:05 +0200</pubDate><category>stackoverflow</category><category>english</category><category>humor</category></item><item><title>Cryptography stack exchange started private beta</title><description>&lt;p&gt;Some hours ago (at 18:38 UTC, to be precise), the new &lt;a href="http://area51.stackexchange.com/proposals/15811/cryptography"&gt;Stack Exchange site about Cryptography&lt;/a&gt; entered the private beta phase.&lt;/p&gt;

&lt;p&gt;Now, three hours later, there are already 16 questions, of which most (all but one) received some answers, and 4 answers are even accepted (one of those being one of my two answers, which consisted mainly of a link &lt;a href="http://paul-ebermann.tumblr.com/post/6722421653/how-to-safely-store-a-password"&gt;I posted here before&lt;/a&gt;, with some additional sentences.)&lt;/p&gt;

&lt;p&gt;This looks good for a start on this complex topic.&lt;/p&gt;

&lt;p&gt;After one week, the site will go public (and then I&amp;#8217;ll add the link here). (&lt;strong&gt;Update&lt;/strong&gt; (2011-07-19): The private beta will be a bit longer, since there are not really much questions yet.)&lt;/p&gt;

&lt;p&gt;Now I&amp;#8217;ll have to think about my own questions I have to ask there (I commited of asking at least 3 questions during the beta period).&lt;/p&gt;</description><link>http://paul-ebermann.tumblr.com/post/7546906963</link><guid>http://paul-ebermann.tumblr.com/post/7546906963</guid><pubDate>Tue, 12 Jul 2011 23:36:00 +0200</pubDate></item><item><title>Stackoverflow auf Deutsch? »Programming (in German)«</title><description>&lt;a href="http://area51.stackexchange.com/proposals/31024/programming-in-german?referrer=rbwTGQYQFyeNXpvwd9QwpQ2"&gt;Stackoverflow auf Deutsch? »Programming (in German)«&lt;/a&gt;: &lt;p&gt;Ein Vorschlag, um eine deutsche Fragen-und-Antworten-Site im &lt;a href="http://stackexchange.com/"&gt;Stack-Exchange-Netzwerk&lt;/a&gt; zu erstellen. Das wäre damit eine deutsche Version von &lt;a href="http://stackoverflow.com/"&gt;Stack Overflow&lt;/a&gt;.&lt;/p&gt;

&lt;p&gt;Zur Zeit befindet sich der Vorschlag in der &lt;strong&gt;Definitions-Phase&lt;/strong&gt;: Es werden Fragen gesammelt, die on-topic bzw. off topic sind (und jeweils dafür gestimmt, zu welcher dieser Kategorien sie gehören - oder »bad example«).&lt;/p&gt;

&lt;p&gt;Danach kommt die &lt;strong&gt;Commitment-Phase&lt;/strong&gt; - hier müssen sich mindestens 200 Leute finden, die zusagen, sich in der beta-Phase am Beleben des Projektes zu beteiligen, davon mindestens 100, die bereits in anderen Stack-Exchange-Sites aktiv sind (in mindestens einer mindestens 200 Reputation haben). Außerdem müssen diese zusammen eine gewisse Reputation gesammelt haben.&lt;/p&gt;

&lt;p&gt;Darauf folgt dann eine &lt;strong&gt;private Beta-Phase&lt;/strong&gt;, in der die Committer anfangen, die Site mit Fragen und Antworten zu füllen, Tags (Kategorien) anlegen, Moderatoren wählen, einen geeigneten Namen finden (»Programming (in German)« ist zwar gut für die Definition auf Area 51, aber nicht als endgültiger Name), etc.&lt;/p&gt;

&lt;p&gt;Ist das erfolgreich, kommt die &lt;strong&gt;öffentliche Beta&lt;/strong&gt;. Hier kommt es darauf an, Öffentlichkeit zu gewinnen (mehr Frager und Antworter, mehr Besucher, …).&lt;/p&gt;

&lt;p&gt;Wenn die öffentliche Beta-Phase gut läuft, wird die Site offiziell Mitglied im Stack-Exchange-Netwerk, eventuell mit ihrem eigenen Domain-Namen. Falls nicht, wird sie wieder gelöscht.&lt;/p&gt;

&lt;p&gt;Falls ihr Interesse daran habt, registriert euch dort als “Follower” und tragt bei zur Definition der Site. Und später als “Committer”, natürlich.&lt;/p&gt;

&lt;hr&gt;&lt;p&gt;Etwas Hintergrund.&lt;/p&gt;

&lt;p&gt;&lt;a href="http://area51.stackexchange.com/"&gt;Area 51&lt;/a&gt; ist die Site im Stack-Exchange-Netzwerk, welche sich mit der Erstellung neuer Sites beschäftigt.&lt;/p&gt;

&lt;p&gt;Andere interessante Vorschläge, die zur Zeit diskutiert werden, sind diese:&lt;/p&gt;

&lt;ul&gt;&lt;li&gt;&lt;a href="http://area51.stackexchange.com/proposals/15811/cryptography?referrer=ZOXFTaR1i7WQqTER2XreYQ2"&gt;Cryptography&lt;/a&gt;  (auf Englisch, über Kryptographie) hat Commitment-Phase vor kurzem abgeschlossen, demnächst wird die private Beta starten. (Man kann noch Committer werden, denke ich.)&lt;/li&gt;
&lt;li&gt;&lt;a href="http://area51.stackexchange.com/proposals/12409/planned-and-constructed-languages?referrer=5V68iShI7gpOXgEW5Vh1eQ2"&gt;Planned and Constructed Languages&lt;/a&gt; (über Konstruierte bzw. Plansprachen, wie z.B. Esperanto) hat Anfang Juni die Commitment-Phase begonnen … und stagniert jetzt bei knapp über 30 Committern (ich bin Nummer 32).&lt;/li&gt;
&lt;/ul&gt;&lt;p&gt;Diese Sites sind zur Zeit in der Beta-Phase:&lt;/p&gt;

&lt;ul&gt;&lt;li&gt;&lt;a href="http://german.stackexchange.com/"&gt;German Language and Usage&lt;/a&gt;: Über deutsche Sprache und ihre (korrekte?) Verwendung. Der erste einer Reihe von ähnlichen Vorschlägen für diverse Sprachen, am 31. Mai von private beta zu public beta übergegangen. Fragen und Antworten können sowohl auf Deutsch als auch auf Englisch erfolgen (und werden teilweise dann von der Community in die jeweils andere Sprache übersetzt).&lt;/li&gt;
&lt;li&gt;&lt;a href="http://skeptics.stackexchange.com/"&gt;Sceptics&lt;/a&gt; zu wissenschaftlichem Skeptizismus (auf Englisch). Hier kann man Fragen zu allem möglichen stellen (bevorzugt zu öffentlich getätigten Aussagen), und die Antworten untersuchen den Wahrheitsgehalt, hinterlegt mit Referenzen zu wissenschaftlichen Untersuchungen.&lt;/li&gt;
&lt;li&gt;&lt;a href="http://security.stackexchange.com/"&gt;IT Security&lt;/a&gt; zur Sicherheit in der Informationstechnik.&lt;/li&gt;
&lt;li&gt;&lt;a href="http://ux.stackexchange.com/"&gt;User Experience&lt;/a&gt; zu Nutzerschnittstellen u.ä.&lt;/li&gt;
&lt;/ul&gt;&lt;p&gt;Schon eine Weile aus dem Beta-Status heraus sind etwa diese (alle auf Englisch):&lt;/p&gt;

&lt;ul&gt;&lt;li&gt;&lt;a href="http://math.stackexchange.com/"&gt;Mathematics&lt;/a&gt; zu Mathematik in allen Formen&lt;/li&gt;
&lt;li&gt;&lt;a href="http://tex.stackexchange.com/"&gt;TeX&lt;/a&gt; zu TeX, LaTeX und verwandten Programmen&lt;/li&gt;
&lt;li&gt;&lt;a href="http://askubuntu.com/"&gt;Ask Ubuntu&lt;/a&gt; für Fragen zu Ubuntu (einer der populärsten Linux-Distributionen)&lt;/li&gt;
&lt;/ul&gt;&lt;p&gt;Schon vor der Einführung des Area-51-Prozesses gab es diese Sites (bisher auch die größten im Netzwerk):&lt;/p&gt;

&lt;ul&gt;&lt;li&gt;&lt;a href="http://stackoverflow.com/"&gt;Stack Overflow&lt;/a&gt; für Programmierer (und Fragen zu konkreten Problemen)&lt;/li&gt;
&lt;li&gt;&lt;a href="http://serverfault.com/"&gt;Server Fault&lt;/a&gt; für System-Administratoren&lt;/li&gt;
&lt;li&gt;&lt;a href="http://superuser.com/"&gt;Super User&lt;/a&gt; für “normale” Computer-Nutzer&lt;/li&gt;
&lt;/ul&gt;</description><link>http://paul-ebermann.tumblr.com/post/7484675884</link><guid>http://paul-ebermann.tumblr.com/post/7484675884</guid><pubDate>Mon, 11 Jul 2011 08:00:05 +0200</pubDate><category>Deutsch</category><category>area51.stackexchange</category><category>stackoverflow</category></item><item><title>creating »Planned and Constructed Languages«</title><description>&lt;a href="http://area51.stackexchange.com/proposals/12409/planned-and-constructed-languages?referrer=5V68iShI7gpOXgEW5Vh1eQ2"&gt;creating »Planned and Constructed Languages«&lt;/a&gt;: &lt;p&gt;This is a proposal to create a questions-and-answers site about constructed languages (like Esperanto) in the &lt;a href="http://stackexchange.com/"&gt;Stack Exchange&lt;/a&gt; network. It just some days ago got from the definition phase (when it was discussed and decided which types of questions would be on topic and off topic) into the commitment phase.&lt;/p&gt;

&lt;p&gt;To be created, the proposal needs commitments from more potential users, including some that are already a bit active at other Stack Exchange sites (like &lt;a href="http://stackoverflow.com/"&gt;Stack Overflow&lt;/a&gt;).&lt;/p&gt;

&lt;p&gt;Then there will be a private beta phase, when the committers will ask questions, answer them, define tags and so on. Then comes a public beta - here the we would need to attract the crowd.&lt;/p&gt;

&lt;p&gt;At the end of the public beta phase the site will be either become an official Stack Exchange site, or be deleted again (if there was not enough traffic or similar).&lt;/p&gt;

&lt;p&gt;(This procedure is the same for all proposals, and explained in the &lt;a href="http://area51.stackexchange.com/faq"&gt;Area 51 FAQ&lt;/a&gt;.)&lt;/p&gt;

&lt;p&gt;For my part, I think I will mostly answering questions about Esperanto (and maybe general ones).&lt;/p&gt;

&lt;p&gt;There is also a proposal &lt;a href="http://area51.stackexchange.com/proposals/13148/esperanto-language-usage?referrer=Pi08IMLv1q4eXSk3YLrsbA2"&gt;Esperanto Language &amp; Usage&lt;/a&gt;, but this is still in the defining phase, and not even near the commitment phase.&lt;/p&gt;</description><link>http://paul-ebermann.tumblr.com/post/7382399620</link><guid>http://paul-ebermann.tumblr.com/post/7382399620</guid><pubDate>Fri, 08 Jul 2011 16:01:06 +0200</pubDate><category>english</category><category>are51.stackexchange</category></item><item><title>Kreado de paĝaro »Planned and Constructed Languages«</title><description>&lt;a href="http://area51.stackexchange.com/proposals/12409/planned-and-constructed-languages?referrer=5V68iShI7gpOXgEW5Vh1eQ2"&gt;Kreado de paĝaro »Planned and Constructed Languages«&lt;/a&gt;: &lt;p&gt;Jen propono por krei demando-kaj-respondo-paĝaron pri konstruitaj lingvoj (kiel Esperanto) en la reto &lt;a href="http://stackexchange.com/"&gt;Stack Exchange&lt;/a&gt;. Antaŭ kelkaj tagoj ĝi iris de la difina fazo (kiam oni diskutis kiaj demandoj estu laŭtemaj kaj kiel ekstertemaj) al la sindediĉa fazo.&lt;/p&gt;

&lt;p&gt;Por esti kreota, la propono bezonas sindediĉojn (aŭ sindevigojn?) de pliaj ontaj uzantoj, el kiuj kelkaj jam estu membroj de aliaj paĝaroj en la reto Stack Exchange (ekzemple &lt;a href="http://stackoverflow.com/"&gt;Stack Overflow&lt;/a&gt; por pri-programadaj demandoj).&lt;/p&gt;

&lt;p&gt;Sekvos privata beta-fazo, kiam la sindediĉintoj demandos demandojn, respondos ilin, difinas markojn ktp. Poste ni havos publikan beta-fazon: nun ni bezonos altiri la homamasojn por demandi pliajn demandojn (kaj respondi ilin).&lt;/p&gt;

&lt;p&gt;Fine de la publika beta-fazo la paĝaro aŭ iĝos oficiala membro de la Stack Exchange reto, aŭ estos forigota (se ĝi ne sukcesis).&lt;/p&gt;

&lt;p&gt;(Tiu proceduro estos sama por ĉiuj proponoj, kaj klarigota en la &lt;a href="http://area51.stackexchange.com/faq"&gt;oftaj demandoj de Area 51&lt;/a&gt;.&lt;/p&gt;

&lt;p&gt;Mi supozas ke mi mem ĉefe respondos demandojn pri Esperanto, kaj eble kelkajn ĝeneralajn, ĉar mi scias preskaŭ nenion pri aliaj konstruitaj lingvoj. Sed jen eblo por ankaŭ demandi ion :-)&lt;/p&gt;

&lt;p&gt;Estas ankaŭ propono &lt;a href="http://area51.stackexchange.com/proposals/13148/esperanto-language-usage?referrer=Pi08IMLv1q4eXSk3YLrsbA2"&gt;Esperanto Language &amp; Usage&lt;/a&gt;, sed ĝi ankoraŭ estas en la difina fazo, kaj eĉ ne proksima al la sindediĉa fazo (laŭ kvanto de sekvantoj).&lt;/p&gt;</description><link>http://paul-ebermann.tumblr.com/post/7374401815</link><guid>http://paul-ebermann.tumblr.com/post/7374401815</guid><pubDate>Fri, 08 Jul 2011 08:01:06 +0200</pubDate><category>esperanto</category><category>area51.stackexchange</category></item></channel></rss>
