One of my websites had begun to use Amazon ELB for load balancing. After that, I have experienced the issue that I can't do +1 at the site.

As long as I see the webmaster tools, the +1 audience has stopped its increase since that time. In addition, the site has issues too on several Google's services such as Google Wireless Transcoder, Google Translation and so on. They report that it can't access to the site.

In my observation, some of Google servers have incorrect DNS caching, so thus the services couldn't access to the site, because the IP address is no longer pointing the original server.

The DNS of Amazon ELB has TLS of 60 seconds. Google's DNS caching should expire within that period.

See Also

• +1 button not working anymore, goes red

Update

It's turned out that Google+ itself too causes this problem.

I was struggling to build collada-dom on Linux machine for a while. But the task turned out simple after I found the right solution.

The solution is here;

   1  $ make os=linux

That's too simple compared with my time spent for it :'-(

cmakeをbuildするときはbootstrapファイルを実行しますが、prefixを指定する場合は以下の部分を書き換えます。

   1      cmake_default_prefix="c:/Program Files/CMake"
   2    fi
   3  else
   4    cmake_default_prefix="/usr/local" # <= ここ
   5  fi

あとは make install すればok.

原子と電磁波の相互作用

• トムソン散乱
• コンプトン散乱
• ラマン散乱

分子レベルの相互作用

• レイリー散乱
• ミー散乱

See Also

• 【物理】ハートリーフォック法で電子軌道計算

gluLookAtでMultiplyされる行列を自前で作る場合、以下のようにすればokです。

If you want to get the matrix that is generated by gluLookAt, here is the way to do it.

   1    //gluLookAt(
   2    //  eye[0], eye[1], eye[2],
   3    //  at[0], at[1], at[2],
   4    //  0.0, 1.0, 0.0);
   5    // equivalent pseudo code
   6    float lookat[16];
   7    midentity(lookat);
   8    vec3 *s = (vec3*)&lookat[0];
   9    vec3 *u = (vec3*)&lookat[4];
  10    vec3 *f = (vec3*)&lookat[8];
  11    vec3 *t = (vec3*)&lookat[12];
  12    vcpy(t, &eye);
  13    vneg(t);
  14    vsub(f, &at, &eye);
  15    vnormalize(f);    
  16    vec3 up = {0, 1, 0};
  17    vcross(s, f, &up);
  18    vcross(u, s, f);  
  19    vneg(f);      
  20    glMultMatrixf(lookat);

I've preferred FLTK for easy development of GUI tool. It has function to treat OpenGL easily, but it doesn't provide box but only window as "Fl_Gl_Window". If you need OpenGL in the box, since it is not supplied as its package, so thus you must use the "Fl_Gl_Box".

簡単なGUI toolを作るときには、ながらくFLTKを愛用してきました。 特にOpenGLを簡単に利用できるので、ちょっとした実験には最適です。 しかし、FLTKのパッケージには、OpenGL用にWindowを作るものはあるのですが、Box (Windowの中に配置される子Windowのようなもの)はありませんでした。そのような状況では、Fl_Gl_Boxを使う必要があります。

Unfortunately, it had been lost in the internet space (the original author of the library had used GeoCities and the site had been vanished), but I found it here.

残念ながら、Fl_Gl_Boxの配布サイトは消えてしまったようです。 しかし、幸運にも Fl_Gl_Boxのソースを以下に発見しました。

http://www.gnu-science.org/phpBB3/viewtopic.php?f=7&t=45#p1268

I'm feeling lucky :-)

ラッキーですね。

CMakeList.txt file tends to have piles of options and seems very complicated. For such situations, you can display configurable options by typing this command.

   1  % cmake -L

You will get very clear result. It's a preferable feature of CMake.

At first, you download files of Collada from here

http://sourceforge.net/projects/collada-dom/

It includes collada-dom, but you must build it before using.

To build the package, you must unpack the zip and move to dom/ directory. And

   1  % make
   2  % make install

That's all.

Fredholm型積分方程式（第二種）

Volterra型積分方程式（第二種）

Through my investigation for writing about the parallel computing, I found there are many "incoherences" and "inconsistencies" all over various terminologies regarding parallel computing. I guess surrounding environment is so fastly changing, the center of excellence of this research field has been moved very frequently.

Most of significant works had been done in the era of sequential computing. But for very near future, we will be going into the era of parallel computing. The terms that had been spawned in the hypothetic world would get real body and require coherent and consistent definition of themselves.