Terima kasih kepada Hanny dan Tikabanget yang sudah membantuku menerjemahkan surat misterius ini. Aku sebenarnya jadi bertanya-tanya, apakah Hanny yang memberikan jawaban ini sama atau tidak dengan Bu Hanny yang juga mengirimkan surat misterius ini? Ataukah kalian orang yang berbeda?

Isi suratnya adalah sebagai berikut. Aku salin ulang dari jawaban Hanny dan Tikabanget.

Hai, Anil!

Aku berharap kamu sudah beristirahat cukup setelah perjalanan panjang kamu mengarungi waktu. Aku hanya mengingatkan kalau kamu bisa tinggal di rumah ini sampai kapanpun kamu mau. Kamu tak usah pikirkan tentang biayamu di masa kini. Semua sudah aku siapkan. Aku akan kirimkan email untuk titik pengambilan kartu, buku tabungan, dan perlengkapan khusus untukmu.

Terima kasih.

Hanny.

Apa maksud dari kata “mengarungi waktu”? Email apa ya? Aku baru saja mencek, namun tak ada email apapun dari seseorang yang bernama Hanny. Ah, misteri baru lagi. Mudah-mudahan sakit kepalaku tak akan muncul lagi hanya karena teka-teki baru ini.

1. Cu Kiếm:

2. Cu Tú: trước khi nghỉ làm đã gài lại một quả bom to tướng. Trong lúc design lịch thi, cu cậu đã đổi dấu hỏi thành dấu huyền trong cụm từ “Buổi sáng”. Rất tiếc là quả bom này đã bị phát hiện trước khi đến tay mấy nghìn em gái xinh tươi trường ĐH CĐ. Nếu đây là hành động vô thức thì có lẽ tâm hồn non nớt của thằng bé đã bị bệnh thật rồi. Tội nghiệp.

Hari minggu kemarin aku menerima sebuah surat dari Bu Hanny dari Bogor, si pengontrak rumah yang kuhuni di Cinere ini. Pak Joko, si penunggu rumah, yang menemukan surat ini terselip di pagar rumah. Suratnya membuatku bingung karena aku tak mengerti sama sekali maksudnya. Sudah berulang kali aku baca surat itu, masih saja aku tak paham. Aku heran siapa sih Bu Hanny ini? Sedemikian misteriusnya dan rahasianya ia sampai harus mengirimkan surat dalam bahasa kode.

Aku salinkan suratnya di sini. Mudah-mudahan rekan pembaca ada yang bisa membantuku menerjemahkannya. Aku sih berharap ada sesuatu yang bisa memberiku jawaban akan keberadaanku di sini.

Hai, Anil!

Rxd snaqrarg xrzd bdurq snavbcvarqrc tdxdg bncnyrq gnawryrere grewrep xrzd znepradepv jrxcd. Rxd qrelr znepveprcxre xryrd xrzd svbr cveppry uv adzrq vev brzgrv xrgregde xrzd zrd. Xrzd crx dbrq gvxvaxre cnecrep svrlrzd uv zrbr xvev. Bnzdr bdurq rxd bvrgxre. Rxd rxre xvavzxre nzrvy decdx cvcvx gneprzsvyre xracd, sdxd crsdepre, ure gnaynepxrgre xqdbdb decdxzd.

Terima kasih.

Hanny.

AARGGH!! Pusing kan?

Aku duga setiap huruf ini mewakili huruf lainnya dalam 26 karakter abjad. Hanya saja huruf apa yang mewakili apa ya?

There are several programming techniques to avoid bugs in our programs, the problem is no one uses them!

Seriously, I don’t know of any programming technique that keeps you from adding some bugs here or there in your programs, regardless of the programming language, the programming platform or environment, or even the programming methodology or practices you are using. The only one “technique” I know of, and I use to rely on it a lot, to avoid bugs in my programs or pieces of code is careful attention, and tons and tons of tests before actually letting it go. I usually don’t trust computers, even my own code, until I see it working right for the most part or for 99% of the time. And if I understand correctly, there is only one way of producing 100% bug free code…. Not writing it.

Below is a link to a post from Wil Shipley’s blog at Blogger.com where he discusses some programming tips for young and not so young programmers about how we should code when we want to code something. Just to give you a taste of what he says:

“Think first. Think some more. Think about the whole problem. Think about a little part of the problem you’re going to start with. Think about the whole thing again, in relation to your idea on the starting point.”

If you noticed, there is not one line of  code written yet. Give it a read, it is really good and highly recommended.

http://wilshipley.com/blog/2005/02/free-programming-tips-are-worth-every.html

Since there’s no way to have programs without writing code, one good way to avoid bugs is to pay attention to whatever code we are writing, as well as verifying our code by letting others see it or review it. Although there is no warranty, this method has worked very well for me in the past. There’s no such thing as avoiding bugs by not writing any code.

Questo, que lotro…, salud!

Nombre: Code Geass: Lelouch of the Rebellion R2
Género:Accion, Mechas, Drama, Ciencia Ficción,
Año: 2008
Estado: Completa
Duracion: 24 Min. Aprox.
Cantidad de Episodios: 25
Idioma: Japonés
Subtitulos: Español
Fansub: Akatsuki no Fansub
Subido a: Varios Host

Sinopsis:

2018 a.t.b. Ha pasado un año tras el fracaso de la Rebelión Negra encabezada por Zero, el Área 11 ha sido degradado por el Emperador de Britannia a la categoría de Área de Remediación. Esto ha resultado en la aplicación de sentencias más severas de parte del Imperio y el inicio de una profunda represión a los Caballeros Negros, arrestando a varios de sus miembros y cerrando sus operaciones. El Imperio también está en graves tensiones con otras dos de las grandes superpotencias mundiales, los EUU, contra quien ha luchado una larga guerra, y la Federación China, que a su vez trata de conquistar el Área 11 sin luchar una guerra.
Al mismo tiempo, Lelouch Lamperouge parece llevar una vida normal como estudiante y haber olvidado su rebelde pasado como Zero, hasta el día en que se ve envuelto en un altercado y se reencuentra con la misteriosa mujer C.C. quien le revela

su propósito olvidado. Destruyendo a sus enemigos y declarándose como Zero una vez más, Lelouch se dispone a terminar lo que empezó.

Capitulos:

Code Geass R2 01:

Avi: Torrent // SendSpace
Mp4: Torrent // SendSpace

Code Geass R2 02:

Avi: Torrent // Megaupload // SendSpace
Mp4: SendSpace

Code Geass R2 03:

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 04

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 05

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 06

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 07

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // SendSpace

Code Geass R2 08

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 09
Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 10

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 11

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 12

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 13

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 14

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 15

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 16

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 17

Avi: Torrent // Megaupload // SendSpace

Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 18

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 19

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 20

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 21

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 22
Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 23

Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 24
Avi: Torrent // Megaupload // SendSpace
Mp4: Torrent // Megaupload // SendSpace

Code Geass R2 25

Avi: Torrent // Megaupload // SendSpace // RapidShare Parte1 Parte2 Parte3
Mp4: Torrent // Megaupload // SendSpace //RapidShare Parte1 Parte2 Parte3

[Online]

Code Geass R2 – Episodio 01
Code Geass R2 – Episodio 02
Code Geass R2 – Episodio 03
Code Geass R2 – Episodio 04
Code Geass R2 – Episodio 05
Code Geass R2 – Episodio 06
Code Geass R2 – Episodio 07
Code Geass R2 – Episodio 08
Code Geass R2 – Episodio 09
Code Geass R2 – Episodio 10
Code Geass R2 – Episodio 11
Code Geass R2 – Episodio 12
Code Geass R2 – Episodio 13
Code Geass R2 – Episodio 14
Code Geass R2 – Episodio 15
Code Geass R2 – Episodio 16
Code Geass R2 – Episodio 17
Code Geass R2 – Episodio 18
Code Geass R2 – Episodio 19
Code Geass R2 – Episodio 20
Code Geass R2 – Episodio 21
Code Geass R2 – Episodio 22
Code Geass R2 – Episodio 23
Code Geass R2 – Episodio 24
Code Geass R2 – Episodio 25

Datos Tecnicos:

Nombre: Code Geass Hangyaku no Lelouch
Nombre Opcional: Code Geass: Lelouch of the Rebellion
Año:   2006-2007
Género: Accion, Bishounen, Mecha, Military, SciFi, Seinen, Super Poderes, Violencia
Estudio: Sunrise, MBS, Sony Music Entertainment, Victor Entertainment, CLAMP
Cantidad de Episodios: 25
Tipo: Tv Series
Fansub: Wing Zero
Estado de Episodios: Completa
Idioma: Japones
Subtitulos: Español
Formato:  mp4
Peso: 170 MB Aprox.
Hosting: MegaUpload Premium
Uploader: CJRobert
Contraseña: http://cjnf.blogspot.com/

Capturas:

Episodios:

Rapidshare:
Episodio 01: Parte1, Parte2
Episodio 02: Parte1, Parte2
Episodio 03: Parte1, Parte2
Episodio 04: Parte1, Parte2
Episodio 05: Parte1, Parte2
Episodio 06: Parte1, Parte2
Episodio 07: Parte1, Parte2
Episodio 08: Parte1, Parte2
Episodio 09: Parte1, Parte2
Episodio 10: Parte1, Parte2
Episodio 11: Parte1, Parte2
Episodio 12: Parte1, Parte2
Episodio 13: Parte1, Parte2
Episodio 14: Parte1, Parte2
Episodio 15: Parte1, Parte2
Episodio 16: Parte1, Parte2
Episodio 17: Parte1, Parte2
Episodio 18: Parte1, Parte2

Megaupload:
Episodio 01: Parte1, Parte2
Episodio 02: Parte1, Parte2
Episodio 03: Parte1, Parte2
Episodio 04: Parte1, Parte2
Episodio 05: Parte1, Parte2
Episodio 06: Parte1, Parte2
Episodio 07: Parte1, Parte2
Episodio 08: Parte1, Parte2
Episodio 09: Parte1, Parte2
Episodio 10: Parte1, Parte2
Episodio 11: Parte1, Parte2
Episodio 12: Parte1, Parte2
Episodio 13: Parte1, Parte2
Episodio 14: Parte1, Parte2
Episodio 15: Parte1, Parte2
Episodio 16: Parte1, Parte2
Episodio 17: Parte1, Parte2
Episodio 18: Parte1, Parte2

[online]

Code Geass – Episodio 01
Code Geass – Episodio 02
Code Geass – Episodio 03
Code Geass – Episodio 04
Code Geass – Episodio 05
Code Geass – Episodio 06
Code Geass – Episodio 07
Code Geass – Episodio 08
Code Geass – Episodio 09
Code Geass – Episodio 10
Code Geass – Episodio 11
Code Geass – Episodio 12
Code Geass – Episodio 13
Code Geass – Episodio 14
Code Geass – Episodio 15
Code Geass – Episodio 16
Code Geass – Episodio 17
Code Geass – Episodio 18
Code Geass – Episodio 19
Code Geass – Episodio 20
Code Geass – Episodio 21
Code Geass – Episodio 22
Code Geass – Episodio 23
Code Geass – Episodio 24
Code Geass – Episodio 25

Segunda Temporada: Code Geass R2

I’m a big fan of ColdFusion Builder.  However, like most Eclipse-based GUIs, it can difficult to find the settings you’re looking for.  For those of you who are convinced there is no word wrap feature in CF Builder, here’s the information you’re looking for:

Preferences > HTML > Editors > Advanced tab > Enable word wrap

Ben shows me his solution to problem 22. So jealous that he can code so well. So maybe I am just a little bit nerdy.

Parent page: Service Functions – XML (QTP, VBScript) 

Note. Although there could be no “reusable function” that would construct XPath for you, I store current post under “XML Service Functions” category, as it’s closely related to it. XPath is fairly simple to learn and very powerful in use. 
You can use free XPath Designer Tool to validate queries you constructed.

What is XPath? The each element in XML tree has its own unique address.
The XPath expressions provide the ability to navigate around the tree, selecting elements (groups of nodes, single nodes, attributes, text values, etc.) by a variety of conditions.

What does it mean? You can address any XML tree element without looping through the tree, i.e. as you use array[index] notation to get an element of the array, for XML you would use XML[XPath].

How basic XPath syntax looks like? You will see that it is very similar to a disk folder/file addressing, as it’s a tree structure too.
For example, filepath “c:\documents\personal\pictures\1.jpg”  in XML-XPath notation would look like “./documents/personal/pictures/picture[1]“.

What are the differences?
If we can address only one file with a single pathstring, in XML we can address a collection of elements with a single pathstring. If in any folder there could be no duplicated filenames, in XML it’s allowed: elements will be referred by index. 
If we can address an element of an array only by index value, in XML we can address elements by index value or by element value. If with arrays all indexing is absolute, in XML it could be relative.

Examples.
Get a collection of book items in a library XML structure. Xpath = “./library/book”.
Get first book in the collection. Xpath = “./library/book[1]“.
Get a collection of book items written by James Bach. Xpath = “descendant::book[author/@firstname='James' and author/@lastname='Bach']“.

Documentation and references.

W3C XML Path Language

W3Schools XPath Introduction

Using XML Queries and Transformations

MetaMap is my bread and butter. I use it every day, all day, thanks to the wonderful folks at the NLM. You can use MetaMap through the SKR server at the NLM , which I do regularly.

Unfortunately the SKR server does not always work, and the machines that process citations can be slow. That’s why I try to process my own text as much as I can. I use an Ubuntu Linux installation in a VMWare virtual machine that has four CPU cores and 2 GB of RAM allocated on my Mac Pro.

My usual workflow produces long lists of sentences to be passed to MetaMap. I therefore use the single line delimited input with ID NLM Scheduler format a lot. The downloadable version of MetaMap can’t handle that format. I therefore wrote my own mini-scheduler that understands the format and controls a variable number of MetaMap instances to process the records as fast as it can. It’s written in Python 2.6 and is quite simple and easy to modify, so I’m publishing it under the GPL because someone, somewhere, might have a use for it.

Modify the following line in the script to point to your MetaMap installation:

METAMAP_BINARY="/opt/public_mm/bin/metamap08 -iDN"

The metamap_tools package is available from github.

Kortingscode @ Yves-Rocher: Sinterklaas09 voor €5.00 korting! + gratis geschenk.

Verzendkosten zijn €3.50, bestellingen boven €25.00 = gratis verzendkosten.

Geldig t/m 30 november.

Nice.

Found here.

When I first saw this over lifehacker and downloaded it, I was just in awe and it has been my text editor across all my machines.

Forget Notepad++, even the Programmer’s Notepad I used to recommend — Sublime text is the best and sexiest light weight code/text editor out there!

It’s kind of pricey but no doubt you’d like it!

Link

• Sublime Text

While I’ve been focusing on the email dump from CRU, others have started looking at the code. This is completely unbelievable :

function mkp2correlation,indts,depts,remts,t,filter=filter,refperiod=refperiod,$
datathresh=datathresh
;
; THIS WORKS WITH REMTS BEING A 2D ARRAY (nseries,ntime) OF MULTIPLE TIMESERIES
; WHOSE INFLUENCE IS TO BE REMOVED. UNFORTUNATELY THE IDL5.4 p_correlate
; FAILS WITH >1 SERIES TO HOLD CONSTANT, SO I HAVE TO REMOVE THEIR INFLUENCE
; FROM BOTH INDTS AND DEPTS USING MULTIPLE LINEAR REGRESSION AND THEN USE THE
; USUAL correlate FUNCTION ON THE RESIDUALS.
;

pro maps12,yrstart,doinfill=doinfill
;
; Plots 24 yearly maps of calibrated (PCR-infilled or not) MXD reconstructions
; of growing season temperatures. Uses “corrected” MXD – but shouldn’t usually
; plot past 1960 because these will be artificially adjusted to look closer to
; the real temperatures.

;
; Plots (1 at a time) yearly maps of calibrated (PCR-infilled or not) MXD
; reconstructions
; of growing season temperatures. Uses “corrected” MXD – but shouldn’t usually
; plot past 1960 because these will be artificially adjusted to look closer to
; the real temperatures.

Artificially adjusted to look closer to the real temperatures!?!?!?!?!? I cannot vouch for the validity of this code, I will have to direct towards the Air Vent – but presumably it comes from the bundle dumped last Thursday.

Update : Another one, from Wattsupwiththat

================

From documents\harris-tree\recon_esper.pro:

; Computes regressions on full, high and low pass Esper et al. (2002) series,
; anomalies against full NH temperatures and other series.
; CALIBRATES IT AGAINST THE LAND-ONLY TEMPERATURES NORTH OF 20 N
;
; Specify period over which to compute the regressions (stop in 1960 to avoid
; the decline
;

Note the wording here “avoid the decline” versus “hide the decline” in the famous email.

===============

Avoid the decline? Which decline should be avoided and why???

I created my first GUI application about an hour ago. It’s something that can fix a potential human factor problem in the open-source community. If anyone knows how to send tools to the Ubuntu community or SVN (Subversion), comment. I was too excited when it was complete, I wrote a note on Facebook. Check it out.

Application Name: Gold
Purpose: Visualize differences in “difference” files.
Created on: 22/11/09 11:11PM
Works on: MAC OS X and Linux.

Wow, this is one cool canine! The Zircon Puppy is December’s Birthday Pet, available for virtual code purchases in the Ganz eStore. So what’s the deal? The Zircon Puppy can be bought online (Ganz eStore) during December. It’s a very cute one, too! It comes with Zircon Sofa and eats Gemstone Dog Bone. Yum!

Strawberry Pastures page.

I hear Sensei is here I will tell once I find out

One of the things I like less about Silverlight is the visibility of its Threading limitations code that has nothing to do with explicit threading. I think that explicitly handling the threads and everything attached is something that you should only need to do when you want to, otherwise it shoud nicely step aside.

The point where threading jumps into your face is when you receive a callback from an asynchronous method call, and after that, need to drive each modification of a UI element through an explicit call of Dispatcher.BeginInvoke. While this is not the end of the world, I strongly dislike it mostly because it makes the code less readable. In addition, since BeginInvoke does of course not wait until the dispatched instruction completes, leads to unnecessarily complex code when several methods need to chained into one.

When reviewing code that uses the WebClient class to download content from an REST service however, it occurred to me that there were no Dispatcher calls in the code. I first thought that was an error, but it turns out that WebClient (and only WebClient, AFAICS) dispatches back to the main thread by itself, yielding a much clearer programming pattern. And I wanted to have the same kind of magic for everything else too.

In fact, it’s very easy; the Dispatcher needs to be called at some point in time, I just tried to shift that point to its earliest possible: the callback method of the asynchronous method. Then that Dispatcher call is packaged nicely as a single method call, and we’ve got:

myServceClient.BeginGetData(
  AsyncUtility.DispatchCallback( ar => DataContext = myServceClient.EndGetData( ar ) )
  , null );

And here’s the AsyncUtility helper class.

using System;
using System.Diagnostics;

namespace GreenIcicle.Silverlight
{
  public class AsyncUtility
  {
    public static AsyncCallback DispatchCallback( AsyncCallback callback )
    {
      return ( new DispatchedCallback( callback ).Execute );
    }

    private class DispatchedCallback
    {
      private AsyncCallback m_Callback;

      public DispatchedCallback( AsyncCallback callback )
      {
        m_Callback = callback;
      }

      public void Execute( IAsyncResult result )
      {
        System.Windows.Threading.Dispatcher dispatcher = System.Windows.Deployment.Current.Dispatcher;
        dispatcher.BeginInvoke( () => m_Callback( result ) );
      }
    }
  }
}

We use this as a droplet, so we can convert dropped FLA files to PNG in a shot. The original script is much larger, as PNG files are post-processed before using them (need some tweaks in GraphicConverter or a similar apple-scriptable app), but it is a skeleton you can use in many little automation projects involving the wonderful world of AppleScript and Flash Javascript (aka JSFL), the language used to automate and extend the Flash IDE capabilities.

AppleScript --> FLA to PNG (click to enlarge)

The FLA file will be exported as PNG using the last settings you used to export a PNG file.

You can download it here.