[B! è¨¼æ˜Žç³»] rjjã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

rjj id:rjj

è¨¼æ˜Žç³»ã«é–¢ã™ã‚‹rjjã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (23)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«: ãƒ–ãƒãƒƒã‚¯ãƒã‚§ãƒ¼ãƒ³ã®è¨ˆç®—ãƒ¢ãƒ‡ãƒ«
2. èƒŒæ™¯ â€¢ è¿‘å¹´ãƒ–ãƒãƒƒã‚¯ãƒã‚§ãƒ¼ãƒ³æŠ€è¡“ã«ä»£è¡¨ã•ã‚Œã‚‹åˆ†æ•£å°å¸³æŠ€è¡“ãŒæ³¨ç›®ã‚’æµ´ã³ã¦ã„ã‚‹ â€¢ ä»®æƒ³é€šè²¨ã®ã‚¤ãƒ³ãƒ•ãƒ©ã¨ã—ã¦ â€¢ æ¥å‹™ã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³ã®ãƒ—ãƒ©ãƒƒãƒˆãƒ•ã‚©ãƒ¼ãƒ ã¨ã—ã¦ â€¢ é‡‘èžãƒ»ä¿é™ºãƒ»è²¿æ˜“ãƒ»å¥åº·ç®¡ç†ãƒ»ãƒˆãƒ¬ãƒ¼ã‚µãƒ“ãƒªãƒ†ã‚£ãƒ»é£Ÿã®å®‰å…¨ â€¢ æ³•æ•´å‚™ã‚‚é€²ã‚“ã§ã„ã‚‹ â€¢ æ”¹æ£è³‡é‡‘æ±ºæ¸ˆæ³• (2016):ã€Œä»®æƒ³é€šè²¨ã€ã€Œä»®æƒ³é€šè²¨äº¤æ›æ¥è€…ã€ã®å®šç¾© â€¢ æ”¹æ£çŠ¯ç½ªåŽç›Šç§»è»¢é˜²æ¢æ³• (2017): ã€Œç‰¹å®šäº‹æ¥è€…ã€ã¨ã—ã¦ã€Œä»®æƒ³é€šè²¨äº¤æ›æ¥è€…ã€ã‚’è¿½åŠ 3. å‚è€ƒ: ä»®æƒ³é€šè²¨ã®å®šç¾© â€¢ è³‡é‡‘æ±ºæ¸ˆã«é–¢ã™ã‚‹æ³•å¾‹ (å¹³æˆäºŒåå…«å¹´å…æœˆä¸‰æ—¥å…¬å¸ƒ) æ”¹æ£ â€¢ ç¬¬äºŒæ¡ç¬¬5é … ã“ã®æ³•å¾‹ã«ãŠã„ã¦ã€Œä»®æƒ³é€šè²¨ã€ã¨ã¯ã€æ¬¡ã«æŽ²ã’ã‚‹ã‚‚ã®ã‚’ã„ã†ã€‚ â€¢ ä¸€ ç‰©å“ã‚’è³¼å…¥ã—ã€è‹¥ã—ãã¯å€Ÿã‚Šå—ã‘ã€åˆã¯å½¹å‹™ã®æä¾›ã‚’å—ã‘ã‚‹å ´åˆã«ã€ã“ã‚Œã‚‰ã®ä»£ä¾¡ã®å¼æ¸ˆ ã®ãŸã‚ã«ä¸ç‰¹å®šã®è€…ã«å¯¾ã—ã¦ä½¿ç”¨ã™ã‚‹ã“ã¨ãŒã§ãã€ã‹ã¤ã€ä¸ç‰¹å®šã®è€…ã‚’ç›¸æ‰‹æ–¹ã¨ã—ã¦è³¼å…¥åŠã³ å£²å´ã‚’è¡Œã†ã“ã¨ãŒã§ãã‚‹è²¡ç”£çš„ä¾¡å€¤ï¼ˆé›»åæ©Ÿå™¨
rjj 2018/08/24
Blockchain

Bitcoin

è¨¼æ˜Žç³»

ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°
ãƒªãƒ³ã‚¯
SMT solver å…¥é–€ - suer ã®ãƒ–ãƒã‚°
SAT solver ãŒå‘¨ã‚Šã§ã»ã®ã‹ã«æµè¡Œã£ã¦ã„ã‚‹(ã„ãŸ?)ã®ã§ï¼Œå€‹äººçš„ã«ã¯ SAT solver ã‚ˆã‚Šã‚‚æ–ç„¶ä¾¿åˆ©ãª SMT solver ã«ã¤ã„ã¦æ›¸ã„ã¦ã¿ã‚ˆã†ã¨æ€ã„ãŸã£ãŸï¼Ž SMT ã£ã¦? SMT ã¯ Satisfiable Modulo Theories ã®ç•¥ã§ï¼ŒSAT ã ã¨å‘½é¡Œå¤‰æ•°ã‚’ä¸¦ã¹ã¦ CNF ã§è¨˜è¿°ã—ãªã‘ã‚Œã°ã„ã‘ãªã„ã¨ã“ã‚ã‚’ï¼Œint ã¨ã‹ï¼Œãƒ—ãƒã‚°ãƒ©ãƒ ã§ä½¿ã†ã‚ˆã†ãªå¤‰æ•°ãŒæ‰±ãˆã‚‹ä¸Šï¼Œè¿°èªžãŒä½¿ãˆã‚‹ï¼Ž ãªã®ã§ä¸€èˆ¬ã«è¨˜è¿°é‡ãŒæ¸›ã‚Šï¼Œäººé–“ã«(SATå•é¡Œã‚ˆã‚Šã¯)èªã¿ã‚„ã™ããªã‚‹å‚¾å‘ã«ã‚ã‚‹ã¨æ€ã†ï¼Ž SMT Solver SMT Solver ã«ã¤ã„ã¦ã¯ http://combination.cs.uiowa.edu/smtlib/ ã§ã„ã‚ã„ã‚è¦‹ã¤ã‹ã‚‹ã‘ã‚Œã©ï¼Œã“ã“ã§ã¯ The Yices SMT Solver ã‚’ä½¿ã£ã¦ã¿ã‚‹ï¼Ž ç’°å¢ƒæº–å‚™ Mac OS X Leopard Yices 4.2.2 ä¾‹é¡Œ S
rjj 2015/05/10
è¨¼æ˜Žç³»
ãƒªãƒ³ã‚¯
http://www.smtcomp.org/
rjj 2015/05/10
è¨¼æ˜Žç³»
ãƒªãƒ³ã‚¯
SMT-LIB The Satisfiability Modulo Theories Library
SMT-LIB is an international initiative aimed at facilitating research and development in Satisfiability Modulo Theories (SMT). Since its inception in 2003, the initiative has pursued these aims by focusing on the following concrete goals. Provide standard rigorous descriptions of background theories used in SMT systems. Develop and promote common input and output languages for SMT solvers. Connect
rjj 2015/05/10
è¨¼æ˜Žç³»
ãƒªãƒ³ã‚¯
System on TPTP
rjj 2014/02/14
è¨¼æ˜Žç³»
ãƒªãƒ³ã‚¯
The E Theorem Prover
E is a theorem prover for full first-order logic with equality. It accepts a probl em specification, typically consisting of a number of first-order clauses or formulas, and a conjecture, again either in clausal or full first-order form. The system will then try to find a formal proof for the conjecture, assuming the axioms. If a proof is found, the system can provide a detailed list of proof steps
rjj 2014/02/12
è¨¼æ˜Žç³»
ãƒªãƒ³ã‚¯
Proof Market
This is a proof market for Coq. The list of all probl ems Create a new probl em Recent answers How to get proofs done for bitcoins Create a new probl em wait for somebody to solve the probl em on recent entries pay bitcoins see the proof How to get bitcoins for proving find a probl em on the list of all probl ems (optional) contact possible payers solve the probl em post your solution with a price and yo
rjj 2014/02/04
è¨¼æ˜Žç³»
ãƒªãƒ³ã‚¯
anarchy proof -
Anarchy Proof This is a proof server. You can enjoy theorem proving here in several languages (one language). The list of all probl ems Create a new probl ems News return top
rjj 2014/02/04
è¨¼æ˜Žç³»
ãƒªãƒ³ã‚¯
Logic Theorist - Wikipedia
Logic Theorist ã¯ã€1955å¹´ã‹ã‚‰1956å¹´ã«ã‹ã‘ã¦ã‚¢ãƒ¬ãƒ³ãƒ»ãƒ‹ãƒ¥ãƒ¼ã‚¦ã‚§ãƒ«ã€ãƒãƒ¼ãƒãƒ¼ãƒˆãƒ»ã‚µã‚¤ãƒ¢ãƒ³ã€Jãƒ»Cãƒ»ã‚·ãƒ§ãƒ¼ãŒé–‹ç™ºã—ãŸã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ãƒ—ãƒã‚°ãƒ©ãƒ ã€‚äººé–“ã®å•é¡Œè§£æ±ºèƒ½åŠ›ã‚’çœŸä¼¼ã™ã‚‹ã‚ˆã†æ„å›³çš„ã«è¨è¨ˆã•ã‚ŒãŸä¸–ç•Œåˆã®ãƒ—ãƒã‚°ãƒ©ãƒ ã§ã‚ã‚Šã€ã€Œä¸–ç•Œåˆã®äººå·¥çŸ¥èƒ½ãƒ—ãƒã‚°ãƒ©ãƒ ã€ã¨ç§°ã•ã‚ŒãŸ[æ³¨ 1]ã€‚ãƒ›ãƒ¯ã‚¤ãƒˆãƒ˜ãƒƒãƒ‰ã¨ãƒ©ãƒƒã‚»ãƒ«ã®ã€Žãƒ—ãƒªãƒ³ã‚ãƒ”ã‚¢ãƒ»ãƒžãƒ†ãƒžãƒ†ã‚£ã‚«ã€ã®å†’é ã®52ã®å®šç†ã®ã†ã¡38ã‚’è¨¼æ˜Žã—ã¦ã¿ã›ã€ä¸€éƒ¨ã«ã¤ã„ã¦ã¯æ–°ãŸãªã‚‚ã£ã¨æ´—ç·´ã•ã‚ŒãŸè¨¼æ˜Žæ–¹æ³•ã‚’ç™ºè¦‹ã—ã¦ã„ã‚‹[2]ã€‚ 1955å¹´ã€ãƒ‹ãƒ¥ãƒ¼ã‚¦ã‚§ãƒ«ã¨ã‚µã‚¤ãƒ¢ãƒ³ãŒ Logic Theorist ã®é–‹ç™ºã‚’å§‹ã‚ãŸã“ã‚ã€äººå·¥çŸ¥èƒ½ã¯ã¾ã å¦å•åˆ†é‡Žã¨ã—ã¦ç¢ºç«‹ã—ã¦ã„ãªã‹ã£ãŸã€‚ã€Œäººå·¥çŸ¥èƒ½ (artificial intelligence)ã€ã¨ã„ã†ç”¨èªžãŒã§ããŸã®ã‚‚ç¿Œå¹´ã®å¤ã®ã“ã¨ã§ã‚ã‚‹[æ³¨ 2]ã€‚ ãƒãƒ¼ãƒãƒ¼ãƒˆãƒ»ã‚µã‚¤ãƒ¢ãƒ³ã¯æ”¿æ²»å¦è€…ã§ã€ã“ã‚Œä»¥å‰ã«å®˜åƒšåˆ¶ã«ã¤ã„ã¦ã®ç ”ç©¶ã‚„é™å®šåˆç†æ€§ã®ç†è«–æ§‹ç¯‰ã§çŸ¥
rjj 2014/02/01
è¨¼æ˜Žç³»
ãƒªãƒ³ã‚¯
ãƒ¬ã‚¤ãƒˆãƒ³æ•™æŽˆã§å§‹ã‚ã‚‹ï¿½Alloy Analyzerå…¥é–€
8/15ã«geekbarã§ä½¿ã£ãŸè³‡æ–™ã§ã™ã€‚ Alloyã®ã‚³ãƒ¼ãƒ‰ã¯ä¸‹è¨˜ã‚¨ãƒ³ãƒˆãƒªãƒ¼ã‚’ã”è¦§ãã ã•ã„ã€‚ http://d.hatena.ne.jp/osiire/20110829Read less
rjj 2014/02/01
è¨¼æ˜Žç³»

å½¢å¼æ‰‹æ³•
ãƒªãƒ³ã‚¯
è‡ªå‹•å®šç†è¨¼æ˜Žã®ç´¹ä»‹
2. â¾ƒâ¼°ç´¹ä»‹ é…’äº• æ”¿è£• â€¢ Blog: ãƒ’ãƒ“ãƒ«ãƒ† â€¢ Twitter: @masahiro_sakai â€¢ Haskeller â€¢ Agda: Agda1ã®ã“ã‚éŠã‚“ã§ãŸ â€¢ Coq: æœ€è¿‘â¼Šâ¾¨ â€¢ æœ€è¿‘ã€Alloyã®æœ¬ã‚’ç¿»è¨³
rjj 2013/12/23
è¨¼æ˜Žç³»
ãƒªãƒ³ã‚¯
Toyota Case: Single Bit Flip That Killed - EE Times
News, techno logies, and trends in the electronics industry eetimes.eu
rjj 2013/10/28
"some critical variables are not protected from corruption, and sources of memory corruption are present. ... failed to mirror several key critical variables, and they made no hardware protection available against bit flips. Stack overflow and software bugs led to memory corruption"

è¨¼æ˜Žç³»

ä¿¡é ¼æ€§
ãƒªãƒ³ã‚¯
LARA â€“ Lab for Automated Reasoning and Analysis -
Leon is an automated system for verifying, repairing, and synthesizing functional Scala programs. The system can be tried out online, with no installation required, at the following link: http://leon.epfl.ch Leon source code is publ icly available on github: https://github.com/epfl-lara/leon The github repository contains the documentation that can be built in various formats, including in particul
rjj 2013/10/15
è¨¼æ˜Žç³»

ã‚³ãƒ³ãƒ‘ã‚¤ãƒ©

ãƒ—ãƒã‚°ãƒ©ãƒ åˆæˆ
ãƒªãƒ³ã‚¯
æœæ—¥æ–°èžãƒ‡ã‚¸ã‚¿ãƒ«ï¼šæ—¥ç«‹ãªã©ã€é«˜ä¿¡é ¼ã®è»Šåˆ¶å¾¡ã‚½ãƒ•ãƒˆæ¤œæŸ»æŠ€è¡“ã‚’é–‹ç™ºâˆ’ãƒ—ãƒã‚°ãƒ©ãƒ ï¼“ï¼•ä¸‡è¡Œé©ç”¨ - æ—¥åˆŠå·¥æ¥æ–°èžãƒ‹ãƒ¥ãƒ¼ã‚¹ - ãƒ†ãƒƒã‚¯ï¼†ã‚µã‚¤ã‚¨ãƒ³ã‚¹
æ—¥ç«‹è£½ä½œæ‰€ã¯æ—¥ç«‹ã‚ªãƒ¼ãƒˆãƒ¢ãƒ†ã‚£ãƒ–ã‚·ã‚¹ãƒ†ãƒ ã‚ºï¼ˆæ±äº¬éƒ½åƒä»£ç”°åŒºã€å¤§æ²¼é‚¦å½¦ä¼šé•·å…¼ï¼£ï¼¥ï¼¯ã€ï¼ï¼“ãƒ»ï¼”ï¼’ï¼“ï¼’ãƒ»ï¼•ï¼“ï¼ï¼ï¼‰ã¨å…±åŒã§ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°æ‰‹æ³•ã®å½¢å¼æ‰‹æ³•ã‚’ç”¨ã„ã¦ä¿¡é ¼æ€§ã®é«˜ã„è‡ªå‹•è»Šåˆ¶å¾¡ã‚½ãƒ•ãƒˆã®æ¤œæŸ»æŠ€è¡“ã‚’é–‹ç™ºã—ãŸã€‚ã“ã‚Œã¾ã§ã«è«–æ–‡ãªã©ã§å ±å‘Šã•ã‚ŒãŸå½¢å¼æ‰‹æ³•ã®ç¯„å›²ã«æ¯”ã¹ç´„ï¼‘ï¼å€ã¨ãªã‚‹ï¼“ï¼•ä¸‡è¡Œã®ãƒ—ãƒã‚°ãƒ©ãƒ è¡Œæ•°ã«é©ç”¨ã§ãã‚‹ã“ã¨ã‚’å®Ÿè¨¼ã—ãŸã€‚æ—¥ç«‹ã‚ªãƒ¼ãƒˆãƒ¢ãƒ†ã‚£ãƒ–ã¯ï¼’ï¼ï¼‘ï¼“å¹´åº¦ã‹ã‚‰ã€ä»Šå›žã®æ–°æŠ€è¡“ã‚’è£½å“é–‹ç™ºã«åˆ©ç”¨ã—ã€ã•ã‚‰ã«é«˜ä¿¡é ¼æ€§ã®è‡ªå‹•è»Šåˆ¶å¾¡ã‚½ãƒ•ãƒˆã‚’é–‹ç™ºã—ã¦ã„ãè¨ˆç”»ã ã€‚ ã€€å½¢å¼æ‰‹æ³•ã¨ã¯ã€è¦æ±‚ã•ã‚ŒãŸä»•æ§˜ã¨è¨è¨ˆã‚’ãã‚Œãžã‚Œæ•°å¦çš„ã«è¨˜è¿°ã—ã€ã“ã‚Œã‚‰ã®é•ã„ã‚’æ¯”ã¹ã¦è¨è¨ˆãŒè¦æ±‚ä»•æ§˜ã‚’æº€ãŸã™ã‹ã©ã†ã‹ã‚’åŽ³å¯†ã«æ¤œæŸ»ã™ã‚‹æŠ€è¡“ã€‚ä¸¡ç¤¾ã¯ï¼£è¨€èªžã§æ›¸ã‹ã‚ŒãŸãƒ—ãƒã‚°ãƒ©ãƒ ï¼ˆã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ï¼‰ã‹ã‚‰æ¤œæŸ»ãƒ¢ãƒ‡ãƒ«ã‚’è‡ªå‹•ç”Ÿæˆã™ã‚‹æŠ€è¡“ã‚’é–‹ç™ºã—ã€æ¤œæŸ»æ”¯æ´ãƒ„ãƒ¼ãƒ«ã‚’è©¦ä½œã—ãŸã€‚ ã€€å…·ä½“çš„ã«ã¯ã€è¨è¨ˆè€…ãŒæ¤œæŸ»ã—ãŸã„ç‚¹ã«é–¢ä¿‚ã™ã‚‹éƒ¨åˆ†ã ã‘ã‚’æŠ½å‡ºã—ã€è¨ˆç®—æ©Ÿã§èª¿ã¹ã‚‹å¿…è¦ã®ã‚ã‚‹æ¤œæŸ»ãƒ¢ãƒ‡ãƒ«ã®å‹•ä½œã—
rjj 2013/04/17
è¨¼æ˜Žç³»
ãƒªãƒ³ã‚¯
CSPSAT2
rjj 2013/03/06
è¨¼æ˜Žç³»
ãƒªãƒ³ã‚¯
Man-Computer Symbiosis
Man-Computer Symbiosis J. C. R. Licklider IRE Transactions on Human Factors in Electronics, volume HFE-1, pages 4-11, March 1960 Summary Man-computer symbiosis is an expected development in cooperative interaction between men and electronic computers. It will involve very close coupling between the human and the electronic members of the partnership. The main aims are 1) to let computers facilitat
rjj 2013/03/05
æ©Ÿæ¢°å¦ç¿’

è¨¼æ˜Žç³»

ç§‘å¦
ãƒªãƒ³ã‚¯
Program-Transformation.Org
Program transf ormation techniques are used in a many areas of software engineering ranging from program synthesis, via program optimization and program refactoring, to reverse engineering and documentation generation. Many theories, tools and applications have been developed over the last 30 years. Often the results of these efforts are used only in the community that developed them. Program-trans
rjj 2013/02/12
ã‚³ãƒ³ãƒ‘ã‚¤ãƒ©

è¨¼æ˜Žç³»
ãƒªãƒ³ã‚¯
Natural Language Processing With Prolog in the IBM Watson System â€“ Association for Logic Programming
Abstract On February 14-16, 2011, the IBM Watson question answering system won the JeopardyMan vs. Machine Challenge by defeating two former grand champions, Ken Jennings and Brad Rutter. To compete successfully at Jeopardy!, Watson had to answer complex natural language questions over an extremely broad domain of knowledge. Moreover, it had to compute an accurate confidence in its answers and to
rjj 2012/10/05
è‡ªç„¶è¨€èªž

è¨¼æ˜Žç³»
ãƒªãƒ³ã‚¯
Dept. of Computing, Imperial College, London: Robert Kowalski Home Page
rjj 2012/10/05
Logic for Problem Solving

è¨¼æ˜Žç³»
ãƒªãƒ³ã‚¯
è‡ªå‹•æ”¹æœæ©Ÿã®é‹è³ƒè¨ˆç®—ãƒ—ãƒã‚°ãƒ©ãƒ ã¯ã„ã‹ã«ãƒ‡ãƒãƒƒã‚°ã•ã‚Œã¦ã„ã‚‹ã®ã‹ï¼Ÿ 10ã®40ä¹—ã¨ã„ã†é‹è³ƒãƒ‘ã‚¿ãƒ¼ãƒ³ã®ãƒ†ã‚¹ãƒˆæ–¹æ³•ã‚’é–‹ç™ºè€…ãŒè§£èª¬ï¼ˆå¾Œç·¨ï¼‰
è‡ªå‹•æ”¹æœæ©Ÿã®é‹è³ƒè¨ˆç®—ãƒ—ãƒã‚°ãƒ©ãƒ ã¯ã„ã‹ã«ãƒ‡ãƒãƒƒã‚°ã•ã‚Œã¦ã„ã‚‹ã®ã‹ï¼Ÿ 10ã®40ä¹—ã¨ã„ã†é‹è³ƒãƒ‘ã‚¿ãƒ¼ãƒ³ã®ãƒ†ã‚¹ãƒˆæ–¹æ³•ã‚’é–‹ç™ºè€…ãŒè§£èª¬ï¼ˆå¾Œç·¨ï¼‰ 9æœˆ12æ—¥ã‹ã‚‰14æ—¥ã®ã‚ã„ã ã€æ±æ´‹å¤§å¦ ç™½å±±ã‚ãƒ£ãƒ³ãƒ‘ã‚¹ã§é–‹å‚¬ã•ã‚ŒãŸæ—¥æœ¬ç§‘å¦æŠ€è¡“é€£ç›Ÿä¸»å‚¬ã®ã€Œã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢å“è³ªã‚·ãƒ³ãƒã‚¸ã‚¦ãƒ 2012ã€ã€‚ã‚ªãƒ ãƒãƒ³ã‚½ãƒ¼ã‚·ã‚¢ãƒ«ã‚½ãƒªãƒ¥ãƒ¼ã‚·ãƒ§ãƒ³ã‚º å¹¡å±±äº”éƒŽæ°ã®è¬›æ¼”ã€Œè‡ªå‹•æ”¹æœæ©Ÿã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã®å“è³ªå‘ä¸Šã®å–ã‚Šçµ„ã¿ã€€åŽ³å¯†ãªä»•æ§˜ã€ã‚‚ã‚‰ã•ãªã„ãƒ†ã‚¹ãƒˆã‚’ç›®æŒ‡ã—ã¦ã€ã€‚ã“ã®è¨˜äº‹ã§ã¯ã€ãã®ãƒ€ã‚¤ã‚¸ã‚§ã‚¹ãƒˆã‚’ç´¹ä»‹ã—ã¦ã„ã¾ã™ã€‚ æœ¬è¨˜äº‹ã¯ã€å‰ç·¨ã€ä¸ç·¨ã€å¾Œç·¨ã®3éƒ¨æ§‹æˆã§ã™ã€‚ãŠèªã¿ã®ãƒšãƒ¼ã‚¸ã¯å¾Œç·¨ã§ã™ã€‚ å¤§è¦æ¨¡ãªãƒ†ã‚¹ãƒˆã‚’ã©ã†ã‚„ã£ã¦å®Ÿè¡Œã—ã¦ã„ã‚‹ã‹ ç¶šã„ã¦ã€å¤§è¦æ¨¡ãªãƒ†ã‚¹ãƒˆã«ã¤ã„ã¦ã€‚ 1000ä¸‡ä»¶ã®ãƒ†ã‚¹ãƒˆãƒ‘ã‚¿ãƒ¼ãƒ³ã‚’ä½œã£ã¦ã‚‚ã€ãã‚Œãžã‚Œã®ãƒ†ã‚¹ãƒˆçµæžœã®æ£è§£ã‚’äººæ‰‹ã§ä½œã£ã¦ã„ãŸã‚‰è¿½ã„ã¤ãã¾ã›ã‚“ã€‚ãªã®ã§ã€åˆ¥ã€…ã«é‹è³ƒè¨ˆç®—ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã‚’ä½œã£ã¦ã€ãã®ç”ãˆã‚’çªãåˆã‚ã›ã¦ãƒã‚§ãƒƒã‚¯ã—ã‚ˆã†ã€ã¨ã„ã†è©±ã§ã™ã€‚ ä¾‹
rjj 2012/09/24
è¨¼æ˜Žç³»
ãƒªãƒ³ã‚¯
1 2 æ¬¡ã®ãƒšãƒ¼ã‚¸