Origami Project
Origami is a code name for a small project with big plans. Our team wants to make Ultra-Mobile PCs a device you won't leave home without, but we need your help. Own a UMPC? Tell us what you like and dislike about it. Don't own a UMPC, but have ideas about the perfect go-everywhere device? Let us know what you think. The Origami Project team wants to share our knowledge about UMPCs and the Microsof
KDDIç ”ç©¶æ‰€ã¨ä¹å·žå¤§ã€æºå¸¯å‘ã‘æš—å·æ–¹å¼ã€ŒK2ã€ã‚’開発
KDDIç ”ç©¶æ‰€ã¯ã€ä¹å·žå¤§å¦å¤§å¦é™¢ã‚·ã‚¹ãƒ†ãƒ æƒ…å ±ç§‘å¦ç ”究院ã®æ«»äº•å¹¸ä¸€æ•™æŽˆã¨å…±åŒã§ã€æºå¸¯é›»è©±ä¸Šã§å‹•ä½œã—ã€ç±³å›½æ¨™æº–ã®æ–¹å¼ã¨åŒãƒ¬ãƒ™ãƒ«ä»¥ä¸Šã®å®‰å…¨æ€§ã‚’ã‚‚ã¤æš—å·ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 「K2ã€ã‚’開発ã—ãŸã€‚ 今回開発ã•ã‚ŒãŸã€ŒK2ã€ã¯ã€ãƒ‘ソコンãªã©ã¨æ¯”ã¹ã‚‹ã¨å‡¦ç†èƒ½åŠ›ãŒä½Žã„æºå¸¯é›»è©±ã§ã‚‚高速ãªæš—å·åŒ–・復å·åŒ–ãŒå®Ÿç¾ã§ãã‚‹ã¨ã„ã†æš—å·ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 。カラコルム型ã¨ã„ã†ç‹¬è‡ªæ§‹é€ ãŒæŽ¡ç”¨ã•ã‚ŒãŸå…±é€šéµæš—å·æ–¹å¼ã§ã€BREW上ã§ã®å‹•ä½œãŒç¢ºèªã•ã‚Œã¦ã„る。BREW上ã§å¾©å·å‡¦ç†ã‚’è¡Œãªã£ãŸå ´åˆã€100KBã®ç”»åƒ70æžšã‚’ç´„1秒ã§å‡¦ç†ã™ã‚‹ã€‚パソコン上ã§4.7GBã®æ˜ åƒãƒ‡ãƒ¼ã‚¿ã‚’復å·å‡¦ç†ã™ã‚‹å ´åˆã€ç±³å›½æ¨™æº–æš—å·æ–¹å¼ã®AESã§ã¯1分åŠã‹ã‹ã‚‹ãŒã€K2ã§ã¯ç´„12秒ã§å‡¦ç†ã§ãる。ã¾ãŸã€æºå¸¯é›»è©±ä¸Šã§ã€ãƒ¯ãƒ³ã‚»ã‚°ã¨åŒç‰ã®å‹•ç”»åƒã‚’復å·ã™ã‚‹å ´åˆã€CPUã®ä½¿ç”¨çŽ‡ã¯0.5％以下ã¨ã®ã“ã¨ã§ã€æš—å·åŒ–ã•ã‚Œã¦é€ã‚‰ã‚Œã¦ãるデータをリアルタイムã«å¾©å·å‡¦ç†ã§ãる。KDDIç ”ç©¶æ‰€ã«ã‚ˆã‚Œã°ã€æš—å·åŒ–処ç†
A garbage collector for C and C++
Where to get the collector Platforms Scalable multiprocessor versions Some collector details Further reading Current users Local links for this collector Local background Links Contacts, Updates, and Reporting Issues Translations of this page [ This is an updated version of the page formerly at http://www.hpl.hp.com/personal/Hans_Boehm/gc, and before that at http://reality.sgi.com/boehm/gc.html an
A collection of implementations of the FlashSort Algorithm in various languages.
Classification Accumulation run the loops: - find cycle leader - in situ permutation short range sorting The FlashSort Algorithm FlashSort sorts n elements in O(n) time. Flash-Sort uses a vector L(k) of length m in a first step for the classification of the elements of array A. Then, in a second step, the resulting counts are accumulated and the L(k) point to the class boundaries. Then the element
ランã‚ング
ランã‚ング
ãŠçŸ¥ã‚‰ã›
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
TurboPower Orpheus
http://libvp62.sourceforge.net/
{{#tags}}- {{label}}
{{/tags}}