é¢é£ã¹ã¬ 大éªã»æ¢ ç°ã®å°ä¸è¡ã£ã¦ãã¤æ¡å¼µå®äºãã¦æ»ç¥ãããããªããã ã http://dubai.2ch.net/test/read.cgi/news/1226452422/
Posted by nene2001 at 00:36 / Tag(Edit): work / 0 Comments: Post / View / 0 TrackBack / Google Maps ã¸ãªã¡ãã£ã¢ãµãããé¢è¥¿ãFOSS4G 2008 OSAKAã«åå ãã¦ãä»ã®äººéã®è©±ã¨ãèãã¦ã¦ãæ£ç´ä¸çªãããã¾ããã®ã¯ã人æãç¹ã«æè¡è ãã¯ã©ã¹ã¿ããã¦ãããã¨ã Yahooã®LatLong Labã®äººå¡ããæè¡è 4-5人ä½å¶ã®ç·å¢10人以ä¸ã®ä½å¢ã ã£ãããæ²é»æ°ããã®ã©ããæè¡è 3-4人ã®ä½å¢ã ã£ãã éç¨ãç£è¦ä»¥å¤ãæè¡é¨åã¯å ¨é¨1人ã§ãã£ã¦ããç§ããããã°ããããã¾ããéãã ã ãã¡ãããLatLong Labãªããã¯æ£å¼æ¥åã§ã¯ãªããå°±æ¥å¾ã«æå¿ãéã¾ã£ã¦ããçµç¹ã ã¨èãã®ã§ã人æ°ã¯ãã¦ãå®åã人æã¨ãã§æ°ããã¨ãå¥ã«ãã¡ã¨å¤ãããªãã ããã æè¡è ã4人ãã¦ã
ã±ã¼ã¿ã¤åãã«ç»åãå¤æãã¦ãããç¡åã®Apacheã¢ã¸ã¥ã¼ã«ãmod_ktai_imageãããªãªã¼ã¹ããã¾ãã Tweet 2008/10/31 éææ¥ matsui Posted in ãµã¼ã, ãã¥ã¼ã¹ | No Comments » ä»å¹´ã®å¤ã«ãªãªã¼ã¹ãããmod_ktai第ä¸æ®µå ¬é ãmod_ktai_infoãmod_ktai_emojiãã«ç¶ããæ°ãã«ç»åå¤æã¢ã¸ã¥ã¼ã«ã®ãmod_ktai_imageãããªãªã¼ã¹ãããã¨ã®ãã¨ã§ãã âãããã¿ããã¥ã¼ã¹ãªãªã¼ã¹ãããã¿ãApacï½eã¢ã¸ã¥ã¼ã«ãmod_ktai(ã¢ããã»ã±ã¼ã¿ã¤)ãã·ãªã¼ãºï¼ã¤ãã®ãmod_ktai_imageããå ¬é [yumemi.co.jp] âãITmedia +D mobileãããã¿ãApacheã¢ã¸ã¥ã¼ã«ãmod_ktaiãã·ãªã¼ãºã«ç»åå¤æã¢ã¸ã¥ã¼ã«ã追å [itmedia.co.jp] â
ãã©ã¤ãã·ã¼ããªã·ã¼ |ããµã¤ãããªã·ã¼ |ãåæ¨ |ããã£ã¼ã |ããµã¤ãããã Copyright© 2000-2007 Community Engine Inc. All rights reserved.
2008/11/14 ãªã¼ãã³ã½ã¼ã¹ã½ããã¦ã§ã¢ã®éçºãµã¤ããSourceForge.JPããéå¶ããOSDNã¯11æ14æ¥ãåãµã¤ãã§åæ£ã¬ãã¸ããªåã®ãã¼ã¸ã§ã³ç®¡çã·ã¹ãã ãGitãã®ãµãã¼ããéå§ãããSourceForge.JPã®ãã¹ã¦ã®ç»é²ããã¸ã§ã¯ãã§Gitã®å©ç¨ãå¯è½ã«ãªã£ãã ããã¾ã§SourceForge.JPã§ã¯ãã½ã¼ã¹ã³ã¼ã管çã®ããã®ãã¼ã¸ã§ã³ç®¡çã·ã¹ãã ã¨ãã¦åä¸ã¬ãã¸ããªåã®CVSããã³Subversionãæ¡ç¨ãã¦ãããããããåæ£ãªãã¸ããªåã®ã·ã¹ãã ãæ®åããä¸ã§ãLinuxã«ã¼ãã«ãSambaãX.orgãRuby on Railsãªã©ã®èåãªãªã¼ãã³ã½ã¼ã¹ã»ããã¸ã§ã¯ãã§Gitãæ¡ç¨ããããã¨ãããä»åã®å¯¾å¿ã«ããã£ãã¨ããã ä»åã®SourceForge.JPã§ã®Gitãµãã¼ãéå§ã«ãããLinuxã«ã¼ãã«ãªã©ã®å¤§è¦æ¨¡ãªãªã¼ãã³ã½ã¼ã¹ã»ããã¸ã§ã¯ãã«
åãã¦ã®å¢ç°ã«ãã¦ããããªãæç´æ··ããã®é·æã«ãªãã§ããããã¨ããã¾ãã¯ãè©«ã³ãã¦ããããã ããåãå¢ç°ã¯åãã¦ãï¼åæãããã¨æµãè¦ã¦ããã ãããªã幸ãã§ããã æ°å ¥ãç¾ãå æãã¦ãã®é¨ç½²ã«æ°å ¥ããããæ¥ãã åã¾ã§å¤ãã¦ããä¼ç¤¾ã¯åã®ç¥ããæä¼æ¥ã®ä¸ã«ããã·ã¹ãã éçºç³»ãããã ãã½ã³ã³ãã¬ã³ã¬ã³ä½¿ãé¨ç½²ã¨ãã¦ã¯ãå°ãªãã¨ãããã½ã³ã³ã使ããã¨ã«æµæã¯ç¡ãããã§ããããããã ãã¼ãã¨æå¾ ãã¦ããã ç§ã®å¤åå ã¯èªç¤¾ãµã¼ãã主軸ã¨ããçµ±åçãªãµã¼ãã¹æä¾ï¼ã¤ã¾ãã¯ASPæ¥åï¼ã主ã¨ãã¦ããã ç§ã¯ãã®ãµã¼ãéç¨ã»ã¨ã©ã¼ç£è¦ã®é¨ç½²ã«æå±ãã¦ããã æ§è³ªä¸ãå¤åä½å¶ã¯1æ¥3交代ã®ã·ããå¶ã¨ãªããæãå¤ãé¢ä¿ã®ç¡ãçæ´»ãªãºã ã«ãªãã ãã®æ°å ¥ãããã¨ãã¦ã¯é¢æ¥ã®æã«ã ãåã¾ã§ã®çµé¨ãæ´»ããã¦ããµã¼ãã¹ã»ã·ã¹ãã éçºã®é¨ç½²ã«å°±ãããã ã¨ããææã示ãã¦ããããã ã ãã ããããªãéçºé¨ç½²ã«
ãããããåä¾ãçã¾ãããç·ã®åã æã 夫婦ã¯ã妻ã®å®å®¶ã«è¿ãæã«æ®ãã¦ãã¦ãç§ã®å®å®¶ããã¯è»ã§1æéä½ãç§ã¯ãã¾ã«å®å®¶ã«é¡ãåºãã¦ãããã妻ãç§ã®å®å®¶ã®ä¸¡è¦ªã¨ä¼ãã®ã¯ãå¹´2??3åãç§ã¯é·ç·ã ãã家ãåºã¦ã¡ãã£ã¨ããé½ä¼ã§ããã°ã©ãçãªä»äºããã¦ããããããªä¸ãç§ã®å®å®¶ã®ä¸¡è¦ªããæã ã®æ§åãè¦ã«æ¥ããã¨è¨ããåä¾ãçã¾ããåã«ãç¥ãã渡ããããããããã®äºã妻ã«è©±ãããã 妻ããã ï¼ãã¬ãã·ã£ã¼ã«ãªãï¼ãç§ãã§ããä½ãã訳ã§ããªããããã æ§åè¦ã«æ¥ãã ãã ããã妻ãå¦å¨ ãã¦ãããªã«å¤§å¤ãªæããã¦ãã®ã«ãããªãã¯ç§ã®æ°æã¡ãå°ããåãã£ã¦ãããªãï¼æ°é£ã£ã¦ããããªãï¼ã ãããªãããªã§ããã¡ã®ä¸¡è¦ªã«ã¯ãæ§åãè¦ã«æ¥ãã®ããæããã¾ããã妻ããç§ãæå¦ãããªãã¦ã¶ã£ã¡ãããæãæ¹ãããããã¬ã£ããããçãªäºãè¨ãã®ã§ããã®æ¥ã¯ç é¢ã«è¡ãã¨ãé©å½ãªçç±ä»ãã¦ã ããã¦æ¬æ¥ãç§ã®ä¸¡è¦ªããåã³ãæ
A gift or hard graft? | Guardian.co.uk 人ããæµã¾ãã天æçãªæè½ãçºæ®ãã人ã«ã¨ã£ã¦ã¯ãåªåãªãã¦å¿ è¦ã®ãªããã¨ãªã®ã§ããããï¼ ãããã¯ãåªåã«ãã£ã¦ä½äºãã«ãã¼ã§ãããã®ãªã®ã§ããããï¼ ãã®çåã¸ã®çãã¯ã10000 æéãããããã¾ããã ããã£ããã³ã°ã»ãã¤ã³ãã ãããã®å»ä¾¡çãæ¥ã«å£²ãå§ããã«ã¯ã¯ã±ãããã ã第1æ ãæåã®2ç§ãã®ããªãã¨ãªãããæ£ãã ã¨ãã£ãæ¬ã§èåãªããã«ã³ã ã»ã°ã©ããã¦ã§ã«ã®æ°ããæ¬ãOutliers: The Story of Success ããã®æç²è¨äºã Guardian ç´ã«æ²è¼ããã¦ãã¾ãã¦ããã®èå³æ·±ãåé¡ã«ã¤ãã¦è§¦ãã¦ãã¾ãã å½¼ã«ããã¨ãä¼èª¬çãªããã°ã©ãã¼ã®ãã«ã»ã¸ã§ã¤ã®ãããªäººãããã«ã»ã²ã¤ããããã¼ãã«ãºã®ãããªãã³ãã®æåããã10000æéã®åªåãã¨ãããã¤ãã®ã¿ã¤ãã³ã°ãæ¯é ãã¦
ç¹ç°ä¿¡é· ã¼ã¡ã¼ã¡ãå æ°ã«ãã£ã¦ãã¾ããå°ãè¬ã«ãæ £ãã...ãããªããç¸å¤ãããé£ã¹ãããªããã©ãæãæãããã°ã£ã¦æåãªãã¦å ¥åã§ããªãã£ããã©ãããã¯ã»ã¼ãªããªã£ããé¢ç¯ãã©ããçããªããè¬å¹ãã¦ããããããªã ã§ãããã°ãæ¸ããã¨è¨ãæ°ãã¾ãèµ·ãã¦ããã â¦
å§ç¸®å ¨æç´¢å¼ã®å®è£ ãªã©ã§ãã°ãã°å©ç¨ããã Rank/Select è¾æ¸ã¨å¼ã°ãããã¼ã¿æ§é ãããã¾ãã詳ããã¯åèæç®ãåç §ãã¦ããã ãã¨ãã¦ãä»åã¯ä¸è¬ã®æååã«å¯¾ãã¦å¹ççã« Rank/Select ãå¯è½ã¨ãããã¼ã¿æ§é ã§ãã Wavelet Tree (ã¦ã§ã¼ãã¬ããæ¨) ã®ã©ã¤ãã©ãªãä½ãã¾ããã http://github.com/naoya/perl-algorithm-wavelettree/tree/master my $wt = Algorithm::WaveletTree->new("abccbbabca"); is $wt->rank(6, 'a'), 2; is $wt->rank(6, 'b'), 3; is $wt->rank(9, 'b'), 4; is $wt->select(0, 'a'), 0; is $wt->select(1, 'a'), 6;
ã©ã³ãã³ã°
ã©ã³ãã³ã°
ã©ã³ãã³ã°
ãªãªã¼ã¹ãé害æ å ±ãªã©ã®ãµã¼ãã¹ã®ãç¥ãã
ææ°ã®äººæ°ã¨ã³ããªã¼ã®é ä¿¡
j次ã®ããã¯ãã¼ã¯
kåã®ããã¯ãã¼ã¯
lãã¨ã§èªã
eã³ã¡ã³ãä¸è¦§ãéã
oãã¼ã¸ãéã
{{#tags}}- {{label}}
{{/tags}}