(2) 2. Bell 6) (2) N {,, N} L {,, L} (o, d) o d K k K C k ( ) min. k K C k 3) 5) C k C k δ,k c. () L δ,k k, 0 Kronecker () c c (e.g.
|
|
- さみ うえや
- 7 years ago
- Views:
Transcription
1 2 ( ) ( ) 2 ( ) ( ) maximin logit Key Words :. () ( ) ( ) ),2) (e.g. ) ( ) 3) 4) HazTrans 4) PC*HazRoute 5) ( (2) ) LPHC (Low Probability with High Conseuence: ) ( ) ),6) Bell 6) LPHC ( ) maximin Bell 6) 2 i) ii) heuristic LPHC Bell 6) logit
2 (2) 2. Bell 6) (2) N {,, N} L {,, L} (o, d) o d K k K C k ( ) min. k K C k 3) 5) C k C k δ,k c. () L δ,k k, 0 Kronecker () c c (e.g. ) (potential exposure) 3),5) ),6) Abkowitz 4) ( Erkut and Ingolfsson ) ) 3) Asakura 4) (incident probability) { } ( Erkut and Verter 0) ) 2 { } ( ) 2 C k LPHC (low-probability with high-conseuence: ) Bell 6) LPHC Bell 6) LPHC 2 ( ) 2
3 2 2 ( ) LPHC (catastrophe averse) ) , 000 ambiguity ( Knight 7) ) 8),9),20),2) 22) Bell 6) k K h k ( ) C k k K h k C k ( ) 2 {h k } { } ( ) maximin (MM) Bell 6) maximin (MSA: Method of Successive Averages) MM 3 MM (i.e. ) 2 Bell heuristics 2 Bell 6) 3 Bell MM 2 (o, d ) (o, d 2 ) (o, d ) (o, d 2 ) Bell 6) Bell 6) MM ( ) 2 MM 2 2. maximin (MM) () (2) Bell 6) MM (3) 2 () ( ) G N {,, N} L {,, L} o D D (o, d) K d, d D L 3
4 ( ) c G ( ) { L} =. (2) L 0, L (3) (o, d) k K d k ( ) C d k () c δ d,k, k Kd, d D. (4) L δ d,k Kronecker (o, d) k n n k 0 d D f d (o, d) d k K d h d k h {h d k k Kd, d D} h k K d h d k = f d, d D. (5) h d k 0, k Kd, d D. (6) h π (h) c, L. (7) h d k δd,k k K d (exposure) δ d,k (4) Kronecker h ( ) Z 0 (h, ) h d k c δ d,k k K d L = h d k Cd k () k K d = π (h) L Z 0 (h, ) (h ) (2) LPHC (LPHC: Low Probability with High Conseuence) (i.e. ) h maximin [P0] max. min. Z 0 (h, ), h s.t. (h, ) Ω h Ω. Ω h h (5) (6) Ω (2) (3) [P0] ( ) maximin (MM) MM 2 6) 2 (i.e. ) (i.e. ) MM [P0] Nash ( ) (3) Bell 6) MM 2 (LP: Linear Programming) MM [P0] 4
5 [P0] [P0 -Dual] max. Z 0 (), s.t. Ω. Z 0 () h [LP0 ()] Z 0 () min. Z 0 (h, ), s.t. h Ω h. h [LP0 ()] [LP0 -()-Dual] Z 0 () = max. f d S d 0, S 0 s.t. S d 0 Cd k (), k Kd, d D. (8) S 0 {S d 0 d D} (5) Lagrange (8) S d 0 (o, d) ( ) [LP0 ()-Dual] Z 0 () [P0 -Dual] maximin [P0] S 0 [LP0-Dual] max. f d S d 0,,S 0 s.t. S d 0 Cd k (), k Kd, d D, Ω. (o, d) S d 0 S d 0 () min. C d k K d k (), d D. (9) [LP0-Dual] [CP0-Dual] max. f d S d 0 (), s.t. Ω. [LP0-Dual] h (2) Lagrange Q 0 [LP0-Primal] min. h,q 0 Q 0, s.t. Q 0 π (h), L, (0) h Ω h. π (h) (7) [LP0-Primal] Q 0 (0) h h Q 0 (h) max. L π (h)c () [LP0-Primal] h [CP0-Primal] (4) min. Q 0 (h), s.t. h Ω h. h MM [P0] 2 [LP0-Dual] [LP0-Primal] LP 2 [LP0-Dual] [LP0-Primal] h 2 [LP0-Dual] [LP0-Primal] {h d k } {Cd k ()} (o, d) K d Bell 6) MM [P0] (MSA: Method of Successive Averages) Bell heuristic 6) 3. MM [P0] [P0] ( ) (variation) 2 5
6 4. () [P0] [P] max. min. Z (h, ) h s.t. (h, ) Ω h Ω. Z 0 (h, ) f d HK d θ (h), Ω h Ω h (5) (6) (2) (3) [P] (RM) RM [P0] 2 H d K (h) (o, d) d D H d K (h) k K d h d k f d ln hd k f d. (2) HK d (h) H K d (h) (o, d) (i.e. h d = hd 2 = ) ln K d (i.e. k K d h d k = f d, h d k = 0, k k) 0 HK d (h) (o, d) HK d (h) HK d (h) RM [P] h θ (i.e. ) θ 0 Z 0 (h, ) θ RM [P] MM [P0] (2) RM [P] 2 h RM [P] [P -Dual] max. Z (), s.t. Ω. Z () h [CP ()] Z () min. Z 0 (h, ) f d HK d h θ (h), s.t. h Ω h. [CP ()] {C k ()} logit 23) d D h d k () f exp [ θc d d k [ ()] exp k θc d Kd. (3) k ()], k K d Z () Z () f d S d (). (4) S d () (o, d) d D S d () θ ln [ θc d k ()]. (5) k K d exp (4) (5) RM [P] [CP-Dual] Z () max. f d S d (), s.t. Ω. Ω (2) (3) h 6
7 [CP-Primal] min. Q (h) h θ s.t. h Ω h f d HK d (h), [CP-Primal-Link] min. Q (x) x θ s.t. x Ω x f { d HL d (x) Hd N (x)}, Ω h h (5) (6) Q (h) Q (h) max. L π (h) (6) [CP-Primal] RM [P] (3) [CP-Primal] logit (4) (3) logit Markov HK d (h) 24) HK d (h) = Hd L [x(h)] Hd N [x(h)], d D. (7) x(h) xi d j (h), L, d D. (8) k K d h d k δd,k HL d(x) Hd N (x) d D HL d (x) xi d j f ln xd d f, d L HN d (x) x d i N f d ln j O(i) x d = f d ln j N i I( j) xi d j f d j O(i) xi d j f d i I( j),. O(i) { j L} I( j) {i L} i j [P-Primal] x {xi d j L, d D} Q (x) (6) x Ω x x p d ni xim d + bd i = 0, i N, d D. (9) n I(i) m O(i) x d 0, L, d D. (20) b d i i f d i f d 0 (4) [CP-Dual] [CP-Primal] [CP-Primal-Link] [CP-Primal] h 2 HK d (h) h h h [CP-Primal-Link] x 2 3 HL d(x) Hd N (x) x 24) x x [CP-Dual] (o, d) S d () ( C d {C d k k Kd } ) {C d } S [P] 7
8 7. 4. RM [P] [CP-Dual] logit (Bell 6) all-or-nothing heuristic ) 3 a) Z b) d c) α () logit (2) (SUE: Stochastic User Euilibrium) Maher 25) () Z () Z () logit d Z () [ Z () ] f d S d () = π (), L. (2) π () L π () c xi d j (), (22) xi d j () L d D x d () k K d h d k ()δd,k, (23) h d k () (3) (2) (23) Z () d D k K d ( ) C k () logit x() {xi d j () L, d D} (23) logit ( ) Dial 26) Bell 27) Akamatsu 28) Bell-Akamatsu 27),28) x() S () {S d () d D} 2 i, j N exp [ ] θc if L, W () (24) 0 otherwise. d D S d () S d () = θ ln V od(). (25) xi d j () d D L xi d j () = f d V oi()w ()V jd (). (26) V od () V () i j V() [ I W() ] I. (27) W() N N i j (24) I N N V() (27) II 8
9 Z () [CP-Dual] Z () 0 α + α Z () (2) (3) Ω n Z ( (n) ) α (n) max d (n) (n) z (n) Z ( (n) ) r(n) arg. max. L z (n) n ˆL(n) L\r(n) ˆL(n) [d (n) z (n) z (n) r(n) if (n) > 0, ] 0 if (n) = 0. (28) [d (n) ] r(n) d (n). (29) ˆL(n) L d (n) = 0 α (n) + αd (n) (2) r(n) d (n) 0 d (n) < 0 n α (n) α (n) max min. ˆL max { } (n) /d(n). (30) α [0, α (n) max] (n) + αd (n) (3) (2) n α (n) [0, α (n) max] Z () logit (i.e. (27) V() ) Z ( (n) + αd (n) ) α (n) ( ) 2 SUE Maher 25) (uadratic interpolation) n (n) d (n) α Ẑ (n) (α) Z ( (n) + αd (n) ) Maher 25) α [0, α (n) max] Ẑ (n) ( ) α = 0, α (n) max Ẑ (n) (α) dẑ (0) dα dẑ (α (n) max) dα Z ( (n) ) d (n) g (n) 0, (3) Z ( (n) + α (n) maxd (n) ) d (n) g (n) max. (32) α (n) α (n) := g (n) 0 α (n) max. (33) g (n) max g (n) 0 (3) (33) I [Algorithm ] Step 0 ( ) () Ω n := Step ( ) (n) (n) [CP-Dual] Step 2 () (2) (30) d (n) α (n) max Step 3 ( ) (2) (27) Z ( (n) + α (n) maxd (n) ) (3) (33) α (n) Step 4 ( ) (n+) := (n) + α (n) d (n) n := n + Step (e.g. ) 9 9
10 K 2 6 f 9 = θ = 0.00, 0.0, 0.,, 0 RM [P] {h k } {C k C k( )} (i.e. ) Z S θ ln k e θc k () = /2 θ h S 2 2 θ MM [P0] {C k } S 0 k C k h k θ {h k } 2 θ {C k } θ (i.e. ) θ θ S (RM [P] ) 2 θ = n (n) [CP-Dual] Z (n) S ( (n) ) [ [ 6,9, 8,9 ] = c 6,9 c 6,9 +c 8,9, c 8,9 c 6,9 +c 8,9 ] [0.452, 0.548] S 0 = c 6,9 6,9 = c 8,9 8,9 = (h k ) ID θ =.0 θ =.05 θ =. θ = θ = (Ck ) ID θ =.0 θ =.05 θ =. θ = θ = 0 θ Z (n) (S ) Z ( ) # of iterations 2 Z = ( 2 ) Bell 6) heuristics 00 ( ) 6. 0
11 () (i.e. ) (i.e. ) d D (i.e. ) f { f d d D} f (strategic level) h (operational level) f h d D (e.g. ) Ψ d f Z D ( f) f d Ψ d. (34) f d = E. (35) f d 0, d D. (36) E E = [P2] max. min. Z 2 (h,, f) h, f Z 0 (h, ) + Z D () f d HK d θ (h) ξ H D( f), s.t. (, h, f) Ω Ω h Ω f. H D H D ( f) f d ln f d. (37) ξ ( ) f Ω f (35) (36) [P2] - 29) [P2] RM [P] [P2] h f d D nested-logit f d () exp [ ξ { S d () + Ψd}] exp [ ξ { (38) S od () + Ψd}], d D h d k () f exp [ θc d d k () [ ()] exp k θc d Kd. (39) k ()], k K d S d () (o, d) (5) [P2] [CP2-Dual] min. Z 2 () ξ ln exp [ ξ { S d () + Ψd}], s.t. Ω. [P2] [CP2-Dual] Z 2 () [ Z 2 ()] = Z 2() Z 2 S d = () S d = c xi d j (), (40) xi d j () L d D x () h d k ()δd,k. (4) k K d h d k () (39) [CP2-Dual] [Algorithm-] Step 2 z() Z 2 () Z 2 () (25) (27) S () V() 2 S () (38)
12 f() 3 f() V() xi d j () = f d () V oi()w ()V jd (). V od () (2) LPHC (catastrophic averse) (i.e. ) (e.g. ) (i.e. ) (RM [P] ) [P] (i.e. ) p {p } p =, and p > 0, L. (42) L p ( ) ( ) p R(; p) ln (43) p L R(; p) > 0 R(; p) 0 p = p R(; p) = 0 RM [P] [P3] min. h max. Z 3 (h, ) Z (h, ) R(; p), η s.t. (h, ) Ω h Ω. /η(> 0) p (i.e. p ) [P3] [P3] RM [P] /η 0 [P3] [CP3-Dual] max. Z 3 () f d S d () R(; p), η s.t. Ω. 2 [P3] RM [P] ( h [P] ) [CP3-Dual] RM [CP2-Dual] [Algorithm-] Step 2 [CP3-Dual] [ Z3 () ] = Z 3 = = π () η f d S d () { ln p + R(; p), η }, (44) π () (22) [CP3-Dual] [Algorithm-] Step 2 z() Z 3 () 7. Bell 6) maximin 2 2
13 I 25) n (n) d (n) α [0, α (n) max] Ẑ (n) (α) Z ( (n) + αd (n) ) Maher 25) α [0, α (n) max] Ẑ (n) (α) Q (n) (α) β(n) 2 ( ) α β (n) β (n) 3. (I.) α n β (n), β(n) 2 β (n) 3 (i.e. α = 0, α (n) max) Ẑ (n) (α) = Q(α), dẑ (α) = dq(α) dα dα. (I.2) α = 0, α (n) max Ẑ (n) (α) Ẑ (n) (0) Z ( (n) ) d (n) g (n) α 0, Ẑ (n) (α(n) max) Z ( (n) + αd (n) ) d (n) g (n) α max. Q (n) (α) II α (n) = β (n) 2 = g (n) 0 g (n) max g (n) 0 α (n) max. (I.3) Logit x i N (i.e. 2 ) O {,, β} T {β +,, γ} D {γ +,, N} O O = β, T T = γ β D D = N γ β 2 G(N, L) 0 oo W ot 0 od W 0 to W tt W td, 0 do 0 dt 0 dd W ot {W oi i = β +,, γ, o =,, β}, W tt {W i = β +,, γ, j = β +,, γ}, W td {W id i = β +,, γ, d = γ +,, N}. (II.) O T T T T D 0 oo, 0 od, 0 to, 0 do, 0 dt 0 dd 0 O O, O D, T O, D O, D T D D (27) N N V 0 oo V ot V od V [I W] I = 0 to V tt V td, 0 do 0 dt 0 dd (II.2) V ot W ot [I W tt ], V od W ot [I W tt ] W td, V tt [I W tt ] I, V td [I W tt ] W td. (II.3) O T, O D, T T, T D V W (o, d) x d {xi d j L} i j x d f d V owv d V od, (o, d) OD. (II.4) V o V d N N i V o,i V i,d (II.4) x d (II.3) V V ot, V td V od (II.4) [I W] [I W tt ] V ot = W ot, o O, (II.5) [I W tt ]V td = W td, d D. (II.6) V ot V td V ot W td V od = V ot W td. (II.7) ( V od = W ot V td ) (II.5) (II.6) 3
14 W tt L SOR (Successive Over relaxation) JOR (Jacobi Over Relaxation) ) U.S. Department of Commerce, Bureau of the Census, Washington, DC.: Truck Inventory and User Survey, ) Itoh, T., Hayano, M., Naito, T., Asakura, Y., Hato, E. and Wada, T.: Empirical analysis on hazardous material transportation using road traffic census and accident data, in E., T. and G., T. R. eds., City Logistics III, pp , Institute for City Logistics, ) List, G., Mirchandi, P., Turnuist, M. and Zofrafos, K.: A modelling and analysis for hazardous materials transportation: Risk analysis, routing-scheduling and facility location, Transportation Science, Vol. 25, No. 2, pp. 00 4, 99. 4) Abkowitz, M., Lepofsky, M. and Cheng, P.: Selecting criteria for designating hazardous materials highway routes, Transportation Research Record, Vol. 333, pp , ) Sivakumar, R. and Batta, M., R. Karwan: A network based model for transporting extremely hazardous materials, Operations Research Letters, Vol. 3, No. 2, pp , ) Sivakumar, R. and Batta, M., R. Karwan: A multiple route conditional risk model for transporting hazardous materials, INFOR, Vol. 33, pp , ) Erkut, E.: On the credibility of the conditional risk model for routing hazardous materials, Operations Research Letters, Vol. 8, pp , ) Jin, H., Batta, R. and Karwan, M. H.: On the analysis of two new models for transporting hazardous materials, Operations Research, Vol. 44, No. 5, pp , ) Sherali, H. D., Brizendine, L. D., Glickman, T. S. and Subramanian, S.: Low probability-high conseuence considerations in routing hazardous material shipments, Transportation Science, Vol. 3, No. 3, pp , ) Erkut, E. and Verter, V.: Modeling of transport risk for hazardous materials, Operations Research, Vol. 46, No. 5, pp , 998. ) Erkut, E. and Ingolfsson, A.: Catastrophe avoidance models for hazardous materials route planning, Transportation Science, Vol. 34, No. 2, pp , ) Kara, B., Erkut, E. and Verter, V.: Accurate calculation of hazardous materials transport risks, Operations Research Letters, Vol. 3, pp , ),,,, Vol. 30, pp. CD ROM, ) Asakura, Y.: Risk assessment for hazardous materials transportation in a road network, in Proceedings of 2nd International Symposium on Transport Network Reliability, pp. 5 9, ) ALK Associates, Princeton, New Jersey: ALK s PC*HazRoute (Version 2.0), ) Bell, M. G. H.: Mixed route strategies for the risk-averse shipment of hazardous materials, Networks and Spatial Economics, Vol. 6, pp , ) Knight, F. H.: Risk, Uncertainty and Profit, Houghton, Mifflin, Boston, 92. 8) Ellsberg, D.: Risk, ambiguity, and the Savage axioms, Quarterly Journal of Economics, Vol. 75, pp , 96. 9) Gilboa, I.: Expected utility with purely subjective nonadditive probabilities, Journal of Mathematical Economics, Vol. 6, pp , ) Schmeidler, D.: Subjective probability and expected utility without additivity, Econometrica, Vol. 57, pp , ) Gilboa, I. and Schmeidler, D.: Maxmin expected utility with non-uniue prior, Journal of Mathematical Economics, Vol. 8, pp. 4 53, ),,, ) Fisk, C. S.: Some developments in euilibrium traffic assignment, Transportation Research B, Vol. 4, pp , ) Akamatsu, T.: Decomposition of path choice entropy in general transport networks, Transportation Science, Vol. 3, No. 4, pp , ) Maher, M.: Algorithms for logit-based stochastic user euilibrium assignment, Transportation Research B, Vol. 32, No. 8, pp , ) Dial, R. B.: A probabilistic multipath traffic assignment algorithm which obviates path enumeration, Transportation Research, Vol. 5, pp. 83, ) Bell, M. G. H.: Alternative to Dial s logit assignment algorithm, Transportation Research B, Vol. 29B, No. 4, pp , ) Akamatsu, T.: Cyclic flows, Markov process and stochastic traffic assignment, Transportation Research B, Vol. 30, No. 5, pp , ),, Vol. 40/IV, pp. 09 8, 989. ( ) Catastrophe Averse Strategies for Routing and Siting in the Disposal of Hazardous Materials Takeshi NAGAE and Takashi AKAMATSU This study provides a method for uantitative analysis of a shipment planning of hazardous materials (hazmats). We first formulate a hazmat routing problem as a maximin problem: the assignment of hazmat vehicles is determined so as to minimize the expected conseuence; the incident probabilities on each link are chosen so as to maximize the expected conseuence, reflecting catastrophe avoidance of the dispatcher. Our analysis then reveals that the maximin problem reduces to a single-level convex programming problem, which shares a common mathematical structure with a logit-type stochastic user euilibrium problem that is well known in the field of transportation science. This enables us to develop a globally convergent algorithm for obtaining the optimal mixed route strategy, which can be effectively applied to real world large-scale networks. 4
04-04 第 57 回土木計画学研究発表会 講演集 vs
04-04 vs. 1 2 1 980-8579 6-6-06 E-mail: shuhei.yamaguchi.p7@dc.tohoku.ac.jp 2 980-8579 6-6-06 E-mail: akamatsu@plan.civil.tohoku.ac.jp Fujita and Ogawa(1982) Fujita and Ogawa Key Words: agglomeration economy,
More information12) NP 2 MCI MCI 1 START Simple Triage And Rapid Treatment 3) START MCI c 2010 Information Processing Society of Japan
1 1, 2 1, 2 1 A Proposal of Ambulance Scheduling System Based on Electronic Triage Tag Teruhiro Mizumoto, 1 Weihua Sun, 1, 2 Keiichi Yasumoto 1, 2 and Minoru Ito 1 For effective life-saving in MCI (Mass
More informationHansen 1 2, Skinner 5, Augustinus 6, Harvey 7 Windle 8 Pels 9 1 Skinner 5 Augustinus 6 Pels 9 NL Harvey ML 11 NL
HANAOKA, Shinya 1 3 Hansen1, 2 1 2 3 Hansen 2 3 4 5 2 2.1 002 Vol.5 No.4 2003 Winter 3 4 2.2 Hansen 1 2, Skinner 5, Augustinus 6, Harvey 7 Windle 8 Pels 9 1 Skinner 5 Augustinus 6 Pels 9 NL Harvey 10 2.3
More information149 (Newell [5]) Newell [5], [1], [1], [11] Li,Ryu, and Song [2], [11] Li,Ryu, and Song [2], [1] 1) 2) ( ) ( ) 3) T : 2 a : 3 a 1 :
Transactions of the Operations Research Society of Japan Vol. 58, 215, pp. 148 165 c ( 215 1 2 ; 215 9 3 ) 1) 2) :,,,,, 1. [9] 3 12 Darroch,Newell, and Morris [1] Mcneil [3] Miller [4] Newell [5, 6], [1]
More information0.,,., m Euclid m m. 2.., M., M R 2 ψ. ψ,, R 2 M.,, (x 1 (),, x m ()) R m. 2 M, R f. M (x 1,, x m ), f (x 1,, x m ) f(x 1,, x m ). f ( ). x i : M R.,,
2012 10 13 1,,,.,,.,.,,. 2?.,,. 1,, 1. (θ, φ), θ, φ (0, π),, (0, 2π). 1 0.,,., m Euclid m m. 2.., M., M R 2 ψ. ψ,, R 2 M.,, (x 1 (),, x m ()) R m. 2 M, R f. M (x 1,, x m ), f (x 1,, x m ) f(x 1,, x m ).
More information第3章.DOC
000 Ben-Akiva and Lerman, 1985 1996 1996 4 1997 Banister, 1978; Verplanken et al., 1998 1 5 1996 3 () (I n ) 1 18 I n n P n (1) P n ( 1) = exp exp ( Vn 1 ) I n 1 ( V ) + exp µ ln exp ( V ) n1 + i= ni (3.1)
More information<4D F736F F D20D2E5E7E8F1FB E3EEE45FE8F1EFF0>
13 1 71 71 71 71 7 1 7 1 7 1 7 1 71 71 71 71 71 71 7 (1 71 71 71 7 1 71 7) 1 7 1 71 71 71 71 71 71 7 1 71 7 1 7 1 71 71 71 71 7 1 71 71 71 71 71 71 71 7 1 71 71 71 71 7, 1 71 71 71 71 71 71 7 1 7 1 71
More informationGrund.dvi
24 24 23 411M133 i 1 1 1.1........................................ 1 2 4 2.1...................................... 4 2.2.................................. 6 2.2.1........................... 6 2.2.2 viterbi...........................
More information1,000km 1.7% 0.0% 0.8% 100% 80% 60% 40% 20% 94.4% 0.1% 3.0% 0.3% 0.5% 0.0% 96.2% 1 0.2% 2.8% 0% km ft 40f
96 SHIBASAKI, Ryuichi WATANABE, Tomihiro KADONO, Takashi 1 6 95 1 ISO 96 23 45 6 7 8 1994 9 OD 2 2.1 2.1.1 1998 1 11 95 2 Vol.7 No.4 2005 Winter 015 1,000km 1.7% 0.0% 0.8% 100% 80% 60% 40% 20% 94.4% 0.1%
More information,,,,., C Java,,.,,.,., ,,.,, i
24 Development of the programming s learning tool for children be derived from maze 1130353 2013 3 1 ,,,,., C Java,,.,,.,., 1 6 1 2.,,.,, i Abstract Development of the programming s learning tool for children
More informationKey Words: probabilisic scenario earthquake, active fault data, Great Hanshin earthquake, low frequency-high impact earthquake motion, seismic hazard map 3) Cornell, C. A.: Engineering Seismic
More information2 ( ) i
25 Study on Rating System in Multi-player Games with Imperfect Information 1165069 2014 2 28 2 ( ) i ii Abstract Study on Rating System in Multi-player Games with Imperfect Information Shigehiko MORITA
More informationThe Japanese Journal of Health Psychology, 29(S): (2017)
Journal of Health Psychology Research 2017, Vol. 29, Special issue, 139 149Journal of Health Psychology Research 2016, J-STAGE Vol. Advance 29, Special publication issue, 139 149 date : 5 December, 2016
More informationDGE DGE 2 2 1 1990 1 1 3 (1) ( 1
早 稲 田 大 学 現 代 政 治 経 済 研 究 所 ゼロ 金 利 下 で 量 的 緩 和 政 策 は 有 効 か? -ニューケインジアンDGEモデルによる 信 用 創 造 の 罠 の 分 析 - 井 上 智 洋 品 川 俊 介 都 築 栄 司 上 浦 基 No.J1403 Working Paper Series Institute for Research in Contemporary Political
More information2) TA Hercules CAA 5 [6], [7] CAA BOSS [8] 2. C II C. ( 1 ) C. ( 2 ). ( 3 ) 100. ( 4 ) () HTML NFS Hercules ( )
1,a) 2 4 WC C WC C Grading Student programs for visualizing progress in classroom Naito Hiroshi 1,a) Saito Takashi 2 Abstract: To grade student programs in Computer-Aided Assessment system, we propose
More informationLCC LCC INOUE, Gaku TANSEI, Kiyoteru KIDO, Motohiro IMAMURA, Takahiro LCC 7 LCC Ryanair 1 Ryanair Number of Passengers 2,000,000 1,800,000 1,
LCC LCC INOUE, Gaku TANSEI, Kiyoteru KIDO, Motohiro IMAMURA, Takahiro 1 23 LCC 7 LCC Ryanair 1 Ryanair Number of Passengers 2,, 1,8, 1,6, 1,4, 1,2, 1,, 8, 6, 4, 2, 1985 1987 199 1993 1996 1998 Barrett
More information1 n 1 1 2 2 3 3 3.1............................ 3 3.2............................. 6 3.2.1.............. 6 3.2.2................. 7 3.2.3........................... 10 4 11 4.1..........................
More information14 2 5
14 2 5 i ii Surface Reconstruction from Point Cloud of Human Body in Arbitrary Postures Isao MORO Abstract We propose a method for surface reconstruction from point cloud of human body in arbitrary postures.
More informationJ.M. p.81 CSR Corporate Social Responsibility
Title Author(s) Citation Kobe University Repository : Kernel なぜ 地 域 金 融 機 関 は 地 域 貢 献 活 動 を 行 うのか(What is Regional Bank? What are the Goals of Regional Bank?) 滝 川, 好 夫 Issue date 2004 Resource Type Resource
More information…p…^†[…fiflF”¯ Pattern Recognition
Pattern Recognition Shin ichi Satoh National Institute of Informatics June 11, 2019 (Support Vector Machines) (Support Vector Machines: SVM) SVM Vladimir N. Vapnik and Alexey Ya. Chervonenkis 1963 SVM
More informationRTM RTM Risk terrain terrain RTM RTM 48
Risk Terrain Model I Risk Terrain Model RTM,,, 47 RTM RTM Risk terrain terrain RTM RTM 48 II, RTM CSV,,, RTM Caplan and Kennedy RTM Risk Terrain Modeling Diagnostics RTMDx RTMDx RTMDx III 49 - SNS 50 0
More informationわが国企業による資金調達方法の選択問題
* takeshi.shimatani@boj.or.jp ** kawai@ml.me.titech.ac.jp *** naohiko.baba@boj.or.jp No.05-J-3 2005 3 103-8660 30 No.05-J-3 2005 3 1990 * E-mailtakeshi.shimatani@boj.or.jp ** E-mailkawai@ml.me.titech.ac.jp
More informationú r(ú) t n [;t] [;t=n]; (t=n; 2t=n]; (2t=n; 3t=n];:::; ((nä 1)t=n;t] n t 1 (nä1)t=n e Är(t)=n (nä 2)t=n e Är(t)=n e Är((nÄ1)t=n)=n t e Är(t)=n e Är((n
1 1.1 ( ) ö t 1 (1 +ö) Ä1 2 (1 +ö=2) Ä2 ö=2 n (1 +ö=n) Än n t (1 +ö=n) Änt t nt n t lim (1 n!1 +ö=n)änt = n!1 lim 2 4 1 + 1 n=ö! n=ö 3 5 Äöt = î lim s!1 í 1 + 1 ì s ï Äöt =e Äöt s e eëlim s!1 (1 + 1=s)
More informationn 2 n (Dynamic Programming : DP) (Genetic Algorithm : GA) 2 i
15 Comparison and Evaluation of Dynamic Programming and Genetic Algorithm for a Knapsack Problem 1040277 2004 2 25 n 2 n (Dynamic Programming : DP) (Genetic Algorithm : GA) 2 i Abstract Comparison and
More informationHohenegger & Schär, a cm b Kitoh et. al., Gigerenzer et. al. Susan et. al.
Study on characteristics of inhabitants acceptance of weather information with a probability Motohiro HONMA *, Kyoko ARAI **, Kento MATSUMOTO *** and Yasushi SUZUKI *** Abstract In this study, we performed
More informationWeb Basic Web SAS-2 Web SAS-2 i
19 Development of moving image delivery system for elementary school 1080337 2008 3 10 Web Basic Web SAS-2 Web SAS-2 i Abstract Development of moving image delivery system for elementary school Ayuko INOUE
More informationSUMMARY There might be no other business that has high uncertainty like Live Entertainment Business. This is because the success and failure of this business depend a great deal on the unscientific element
More informationSERPWatcher SERPWatcher SERP Watcher SERP Watcher,
SERPWatcher 112-8610 2-1-1 112-8610 2-1-1 229-8558 5-10-1 E-mail: nakabe@db.is.ocha.ac.jp, chiemi@is.ocha.ac.jp SERPWatcher SERP Watcher SERP Watcher, SERP Analysis of transition of ranking in SERP Watcher
More informationkut-paper-template.dvi
26 Discrimination of abnormal breath sound by using the features of breath sound 1150313 ,,,,,,,,,,,,, i Abstract Discrimination of abnormal breath sound by using the features of breath sound SATO Ryo
More information28 Horizontal angle correction using straight line detection in an equirectangular image
28 Horizontal angle correction using straight line detection in an equirectangular image 1170283 2017 3 1 2 i Abstract Horizontal angle correction using straight line detection in an equirectangular image
More informationIPSJ SIG Technical Report Vol.2009-BIO-17 No /5/26 DNA 1 1 DNA DNA DNA DNA Correcting read errors on DNA sequences determined by Pyrosequencing
DNA 1 1 DNA DNA DNA DNA Correcting read errors on DNA sequences determined by Pyrosequencing Youhei Namiki 1 and Yutaka Akiyama 1 Pyrosequencing, one of the DNA sequencing technologies, allows us to determine
More information130 Oct Radial Basis Function RBF Efficient Market Hypothesis Fama ) 4) 1 Fig. 1 Utility function. 2 Fig. 2 Value function. (1) (2)
Vol. 47 No. SIG 14(TOM 15) Oct. 2006 RBF 2 Effect of Stock Investor Agent According to Framing Effect to Stock Exchange in Artificial Stock Market Zhai Fei, Shen Kan, Yusuke Namikawa and Eisuke Kita Several
More information三石貴志.indd
流通科学大学論集 - 経済 情報 政策編 - 第 21 巻第 1 号,23-33(2012) SIRMs SIRMs Fuzzy fuzzyapproximate approximatereasoning reasoningusing using Lukasiewicz Łukasiewicz logical Logical operations Operations Takashi Mitsuishi
More informationTF-IDF TDF-IDF TDF-IDF Extracting Impression of Sightseeing Spots from Blogs for Supporting Selection of Spots to Visit in Travel Sat
1 1 2 1. TF-IDF TDF-IDF TDF-IDF. 3 18 6 Extracting Impression of Sightseeing Spots from Blogs for Supporting Selection of Spots to Visit in Travel Satoshi Date, 1 Teruaki Kitasuka, 1 Tsuyoshi Itokawa 2
More information1 [1, 2, 3, 4, 5, 8, 9, 10, 12, 15] The Boston Public Schools system, BPS (Deferred Acceptance system, DA) (Top Trading Cycles system, TTC) cf. [13] [
Vol.2, No.x, April 2015, pp.xx-xx ISSN xxxx-xxxx 2015 4 30 2015 5 25 253-8550 1100 Tel 0467-53-2111( ) Fax 0467-54-3734 http://www.bunkyo.ac.jp/faculty/business/ 1 [1, 2, 3, 4, 5, 8, 9, 10, 12, 15] The
More information形状変形による古文書画像のシームレス合成
Use of Shape Deformation to Seamlessly Stitch Historical Document Images Wei Liu Wei Fan Li Chen Sun Jun あらまし 1 2 Abstract In China, efforts are being made to preserve historical documents in the form
More information1 Fig. 1 Extraction of motion,.,,, 4,,, 3., 1, 2. 2.,. CHLAC,. 2.1,. (256 ).,., CHLAC. CHLAC, HLAC. 2.3 (HLAC ) r,.,. HLAC. N. 2 HLAC Fig. 2
CHLAC 1 2 3 3,. (CHLAC), 1).,.,, CHLAC,.,. Suspicious Behavior Detection based on CHLAC Method Hideaki Imanishi, 1 Toyohiro Hayashi, 2 Shuichi Enokida 3 and Toshiaki Ejima 3 We have proposed a method for
More informationsoturon.dvi
12 Exploration Method of Various Routes with Genetic Algorithm 1010369 2001 2 5 ( Genetic Algorithm: GA ) GA 2 3 Dijkstra Dijkstra i Abstract Exploration Method of Various Routes with Genetic Algorithm
More informationA Study on Throw Simulation for Baseball Pitching Machine with Rollers and Its Optimization Shinobu SAKAI*5, Yuichiro KITAGAWA, Ryo KANAI and Juhachi
A Study on Throw Simulation for Baseball Pitching Machine with Rollers and Its Optimization Shinobu SAKAI*5, Yuichiro KITAGAWA, Ryo KANAI and Juhachi ODA Department of Human and Mechanical Systems Engineering,
More informationuntitled
c 645 2 1. GM 1959 Lindsey [1] 1960 Howard [2] Howard 1 25 (Markov Decision Process) 3 3 2 3 +1=25 9 Bellman [3] 1 Bellman 1 k 980 8576 27 1 015 0055 84 4 1977 D Esopo and Lefkowitz [4] 1 (SI) Cover and
More information第 55 回自動制御連合講演会 2012 年 11 月 17 日,18 日京都大学 1K403 ( ) Interpolation for the Gas Source Detection using the Parameter Estimation in a Sensor Network S. T
第 55 回自動制御連合講演会 212 年 11 月 日, 日京都大学 1K43 () Interpolation for the Gas Source Detection using the Parameter Estimation in a Sensor Network S. Tokumoto, T. Namerikawa (Keio Univ. ) Abstract The purpose of
More information<95DB8C9288E397C389C88A E696E6462>
2011 Vol.60 No.2 p.138 147 Performance of the Japanese long-term care benefit: An International comparison based on OECD health data Mie MORIKAWA[1] Takako TSUTSUI[2] [1]National Institute of Public Health,
More informationIPSJ SIG Technical Report Vol.2014-ICS-175 No /3/14 Modified Stochastic Cell Transmission Model 1,a) 1,b) 1,c) Cell Transmission Model CTM Stoc
Modified Stochastic Cell Transmission Model 1,a) 1,b) 1,c) Cell Transmission Model CTM Stochastic Cell Transmission Model SCTM CTM SCTM Modified Stochastic Cell Transmission Model MSCTM MSCTM CTM 1. Cell
More informationパーソナリティ研究 2005 第13巻 第2号 170–182
2005 13 2 170 182 2005 1) I 23 567 8 3 6 1701 59 13 II 5 3 6 224 8.93.46.85 814 IRT III 3 38 3 35 3 2002 1) 2004 (1999) Buss & Perry (1992) 29 16 45 1125 7 38.40.40 3 6 (BAQ) BAQ (physical aggression)
More information4. C i k = 2 k-means C 1 i, C 2 i 5. C i x i p [ f(θ i ; x) = (2π) p 2 Vi 1 2 exp (x µ ] i) t V 1 i (x µ i ) 2 BIC BIC = 2 log L( ˆθ i ; x i C i ) + q
x-means 1 2 2 x-means, x-means k-means Bayesian Information Criterion BIC Watershed x-means Moving Object Extraction Using the Number of Clusters Determined by X-means Clustering Naoki Kubo, 1 Kousuke
More information自然言語処理16_2_45
FileMaker Pro E-learning GUI Phrase Reading Cloze. E-learning Language Processing Technology and Educational Material Development Generating English Educational Material using a Database Software Kenichi
More information02[021-046]小山・池田(責)岩.indd
Developing a Japanese Enryo-Sasshi Communication Scale: Revising a Trial Version of a Scale Based on Results of a Pilot Survey KOYAMA Shinji and IKEDA Yutaka Toward exploring Japanese Enryo-Sasshi communication
More informationVisit Japan Campaign OD OD 18 UNWTO 19 OD JNTO ODUNWTO 1 1
UNWTO OD 2 FURUYA, Hideki 1 LCC 1 2 OD 1 2 OD 3 4 5 6 7 8 9 10 11 /1 GDP M. H. Mohd Hanafiah and M. F. Mohd Harun 12 GDP 1 13 Vol.15 No.4 2013 Winter 041 3 3.1 6222011 Visit Japan Campaign2003521 10119
More information29 jjencode JavaScript
Kochi University of Technology Aca Title jjencode で難読化された JavaScript の検知 Author(s) 中村, 弘亮 Citation Date of 2018-03 issue URL http://hdl.handle.net/10173/1975 Rights Text version author Kochi, JAPAN http://kutarr.lib.kochi-tech.ac.jp/dspa
More information29 Short-time prediction of time series data for binary option trade
29 Short-time prediction of time series data for binary option trade 1180365 2018 2 28 RSI(Relative Strength Index) 3 USD/JPY 1 2001 1 2 4 10 2017 12 29 17 00 1 high low i Abstract Short-time prediction
More informationJOURNAL OF THE JAPANESE ASSOCIATION FOR PETROLEUM TECHNOLOGY VOL. 66, NO. 6 (Nov., 2001) (Received August 10, 2001; accepted November 9, 2001) Alterna
JOURNAL OF THE JAPANESE ASSOCIATION FOR PETROLEUM TECHNOLOGY VOL. 66, NO. 6 (Nov., 2001) (Received August 10, 2001; accepted November 9, 2001) Alternative approach using the Monte Carlo simulation to evaluate
More information5 36 5................................................... 36 5................................................... 36 5.3..............................
9 8 3............................................. 3.......................................... 4.3............................................ 4 5 3 6 3..................................................
More informationkut-paper-template2.dvi
19 A Proposal of Text Classification using Formal Concept Analysis 1080418 2008 3 7 ( ) Hasse Web Reuters 21578 Concept Explorer 2 4 said i Abstract A Proposal of Text Classification using Formal Concept
More information新製品開発プロジェクトの評価手法
CIRJE-J-60 2001 8 A note on new product project selection model: Empirical analysis in chemical industry Kenichi KuwashimaUniversity of Tokyo Junichi TomitaUniversity of Tokyo August, 2001 Abstract By
More informationi
21 Fault-Toleranted Authentication Data Distribution Protocol for Autonomous Distributed Networks 1125153 2010 3 2 i Abstract Fault-Toleranted Authentication Data Distribution Protocol for Autonomous Distributed
More informationï\éÜA4*
Feature Article Imaging of minuscule amounts of chemicals, Scannimg Chemical Microscope --- Increasing analysis information through imaging --- Abstract We have developed a Scanning Chemical Microscope
More informationmain.dvi
FDTD S A Study on FDTD Analysis based on S-Parameter 18 2 7 04GD168 FDTD FDTD S S FDTD S S S S FDTD FDTD i 1 1 1.1 FDTD.................................... 1 1.2 FDTD..................... 3 2 S 5 2.1 FDTD
More informationMicrosoft Word - Šv”|“Å‘I.DOC
90 ª ª * E-mailshinobu.nakagawa@boj.or.jp i ii iii iv SNA 1 70 80 2 80 90 80 80 90 1 80 90 98 6 1 1 SNA 2 1 SNA 80 1SNA 1 19931998 1 2-190 1,2 2 2-2 2-3,4 3 2-5 4 2030 2-3 3 2-15 97 20 90 2-15 9198 1.
More informationIPSJ SIG Technical Report Pitman-Yor 1 1 Pitman-Yor n-gram A proposal of the melody generation method using hierarchical pitman-yor language model Aki
Pitman-Yor Pitman-Yor n-gram A proposal of the melody generation method using hierarchical pitman-yor language model Akira Shirai and Tadahiro Taniguchi Although a lot of melody generation method has been
More information第62巻 第1号 平成24年4月/石こうを用いた木材ペレット
Bulletin of Japan Association for Fire Science and Engineering Vol. 62. No. 1 (2012) Development of Two-Dimensional Simple Simulation Model and Evaluation of Discharge Ability for Water Discharge of Firefighting
More informationAbstract Gale-Shapley 2 (1) 2 (2) (1)
( ) 2011 3 Abstract Gale-Shapley 2 (1) 2 (2) (1) 1 1 1.1........................................... 1 1.2......................................... 2 2 4 2.1................................... 4 2.1.1 Gale-Shapley..........................
More informationBB 報告書完成版_修正版)040415.doc
3 4 5 8 KW Q = AK α W β q = a + α k + βw q = log Q, k = log K, w = logw i P ij v ij P ij = exp( vij ), J exp( v ) k= 1 ik v i j = X β αp + γnu j j j j X j j p j j NU j j NU j (
More information人文学部研究年報12号.indb
制御理論を用いた在庫管理モデルの一解析 * リードタイムが変動する場合 西平直史 1 [1, 2, 3, 4] [1] [2, 3, 4] 1 1 3 2 [2] = +w(k) d(k) (1) 2014 12 1 1 制御理論を用いた在庫管理モデルの一解析 西平 k w(k) d(k) L k u(k) (2) (1) 2 w(k) =u(k L) (2) = +u(k L) d(k) (3)
More information,,.,.,,.,.,.,.,,.,..,,,, i
22 A person recognition using color information 1110372 2011 2 13 ,,.,.,,.,.,.,.,,.,..,,,, i Abstract A person recognition using color information Tatsumo HOJI Recently, for the purpose of collection of
More informationMemetic 26 2 (125T208T)
Memetic 26 2 (125T208T) Abstract The Facility Dispersion Problem(FDP) is compinatorial optimization problem which is selecting facilities to maximize each distance as far as possible in case of selecting
More information,,, 2 ( ), $[2, 4]$, $[21, 25]$, $V$,, 31, 2, $V$, $V$ $V$, 2, (b) $-$,,, (1) : (2) : (3) : $r$ $R$ $r/r$, (4) : 3
1084 1999 124-134 124 3 1 (SUGIHARA Kokichi),,,,, 1, [5, 11, 12, 13], (2, 3 ), -,,,, 2 [5], 3,, 3, 2 2, -, 3,, 1,, 3 2,,, 3 $R$ ( ), $R$ $R$ $V$, $V$ $R$,,,, 3 2 125 1 3,,, 2 ( ), $[2, 4]$, $[21, 25]$,
More informationDEIM Forum 2009 C8-4 QA NTT QA QA QA 2 QA Abstract Questions Recomme
DEIM Forum 2009 C8-4 QA NTT 239 0847 1 1 E-mail: {kabutoya.yutaka,kawashima.harumi,fujimura.ko}@lab.ntt.co.jp QA QA QA 2 QA Abstract Questions Recommendation Based on Evolution Patterns of a QA Community
More information26 No.62 Contents 1 2 3 4 2 No.62
Institute for Traffic Accident Research and Data Analysis INFORMATION 26 No.62 Institute for Traffic Accident Research and Data Analysis 26 No.62 Contents 1 2 3 4 2 No.62 ITARDA INFORMATION Section 1 9
More informationAtCoder Regular Contest 073 Editorial Kohei Morita(yosupo) A: Shiritori if python3 a, b, c = input().split() if a[len(a)-1] == b[0] and b[len(
AtCoder Regular Contest 073 Editorial Kohei Morita(yosupo) 29 4 29 A: Shiritori if python3 a, b, c = input().split() if a[len(a)-1] == b[0] and b[len(b)-1] == c[0]: print( YES ) else: print( NO ) 1 B:
More information橡表紙参照.PDF
CIRJE-J-58 X-12-ARIMA 2000 : 2001 6 How to use X-12-ARIMA2000 when you must: A Case Study of Hojinkigyo-Tokei Naoto Kunitomo Faculty of Economics, The University of Tokyo Abstract: We illustrate how to
More information表紙参照.PDF
CIRJE-J-94 2003 5 CIRJE http://www.e.u-tokyo.ac.jp/cirje/research/03research02dp_j.html The Erosion and Sustainability of Norms and Morale KANDORI, Michihiro The initially high performance of a socioeconomic
More information..,,...,..,...,,.,....,,,.,.,,.,.,,,.,.,.,.,,.,,,.,,,,.,,, Becker., Becker,,,,,, Becker,.,,,,.,,.,.,,
J. of Population Problems. pp.,,,.,.,,. Becker,,.,,.,,.,,.,,,,.,,,.....,,. ..,,...,..,...,,.,....,,,.,.,,.,.,,,.,.,.,.,,.,,,.,,,,.,,, Becker., Becker,,,,,, Becker,.,,,,.,,.,.,, ,,, Becker,,., Becker,
More information46 Y 5.1.1 Y Y Y 3.1 R Y Figures 5-1 5-3 3.2mm Nylon Glass Y (X > X ) X Y X Figure 5-1 X min Y Y d Figure 5-3 X =X min Y X =10 Y Y Y 5.1.2 Y Figure 5-
45 5 5.1 Y 3.2 Eq. (3) 1 R [s -1 ] ideal [s -1 ] Y [-] Y [-] ideal * [-] S [-] 3 R * ( ω S ) = ω Y = ω 3-1a ideal ideal X X R X R (X > X ) ideal * X S Eq. (3-1a) ( X X ) = Y ( X ) R > > θ ω ideal X θ =
More informationIT,, i
22 Retrieval support system using bookmarks that are shared in an organization 1110250 2011 3 17 IT,, i Abstract Retrieval support system using bookmarks that are shared in an organization Yoshihiko Komaki
More informationパナソニック技報
Panasonic Technical Journal Vol. 64 No. 2 Nov. 2018 Optical Disc Archiving System with 100 Years Lifespan of Digital Data Takuto Yamazaki Yasushi Kobayashi Blu-ray Disc 1 Archival Disc 2 3300 GB 10012
More information<4D F736F F D DB82CC88F892A38BAD937893C190AB76355F8D5A897B8CE3325F2E646F63>
Asymmetry of Seismic Displacement Response of Highway Bridge Supported by Spread Foundation Takeshi SHIMABUKURO* Rei FUJITA** and Norihiko YAMASHITA*** The objective of this paper is to discuss the causes
More information23 Study on Generation of Sudoku Problems with Fewer Clues
23 Study on Generation of Sudoku Problems with Fewer Clues 1120254 2012 3 1 9 9 21 18 i Abstract Study on Generation of Sudoku Problems with Fewer Clues Norimasa NASU Sudoku is puzzle a kind of pencil
More informationGDP GDP 1 98% 2
2016 2016 4 6 [ ] 1 1.1 1.1.1 1. 2. 3. 2 1 4. 1 700-800 1 GDP GDP 1 98% 2 1.1.2 BOD Biochemical Oxygen Demand BOD COD Chemical Oxygen Demand COD DO DO PM2.5 eg.1 GDP CO 2 eg.2 Life Cycle Assessment 3 eg.
More information浜松医科大学紀要
On the Statistical Bias Found in the Horse Racing Data (1) Akio NODA Mathematics Abstract: The purpose of the present paper is to report what type of statistical bias the author has found in the horse
More information2 (S, C, R, p, q, S, C, ML ) S = {s 1, s 2,..., s n } C = {c 1, c 2,..., c m } n = S m = C R = {r 1, r 2,...} r r 2 C \ p = (p r ) r R q = (q r ) r R
RF-004 Hashimoto Naoyuki Suguru Ueda Atsushi Iwasaki Yosuke Yasuda Makoto Yokoo 1 [10] ( ). ( ) 1 ( ) 3 4 3 4 = 12 deferred acceptance (DA) [3, 7] [5] ( ) NP serial dictatorship with regional quotas (SDRQ)
More informationpaper.dvi
23 Study on character extraction from a picture using a gradient-based feature 1120227 2012 3 1 Google Street View Google Street View SIFT 3 SIFT 3 y -80 80-50 30 SIFT i Abstract Study on character extraction
More information258 5) GPS 1 GPS 6) GPS DP 7) 8) 10) GPS GPS 2 3 4 5 2. 2.1 3 1) GPS Global Positioning System
Vol. 52 No. 1 257 268 (Jan. 2011) 1 2, 1 1 measurement. In this paper, a dynamic road map making system is proposed. The proposition system uses probe-cars which has an in-vehicle camera and a GPS receiver.
More informationAttendance Demand for J-League õ Shinsuke KAWAI* and Takeo HIRATA* Abstract The purpose of this study was to clarify the variables determining the attendance in J-league matches, using the 2,699 J-league
More information2. Eades 1) Kamada-Kawai 7) Fruchterman 2) 6) ACE 8) HDE 9) Kruskal MDS 13) 11) Kruskal AGI Active Graph Interface 3) Kruskal 5) Kruskal 4) 3. Kruskal
1 2 3 A projection-based method for interactive 3D visualization of complex graphs Masanori Takami, 1 Hiroshi Hosobe 2 and Ken Wakita 3 Proposed is a new interaction technique to manipulate graph layouts
More informationii
I05-010 : 19 1 ii k + 1 2 DS 198 20 32 1 1 iii ii iv v vi 1 1 2 2 3 3 3.1.................................... 3 3.2............................. 4 3.3.............................. 6 3.4.......................................
More information09056175-03.indd
: 15 1 I. Hermann Hesse 1877-1962 1 Jugendgedenken 1911 Das Nachtpfauenauge 2 1931 Jugendgedenken Würzburger- General - Anzeiger 8 1 Jugendgedenken 3 1940 1947 4 2 6 5 1911 1911 34 20 1931 54 16 11 2010
More informationA Study on Traffic Characteristics in Multi-hop Wireless Networks 2010 3 Yoichi Yamasaki ( ) 21 Local Area Network (LAN) LAN LAN LAN (AP, Access Point) LAN AP LAN AP AP AP (MWN, Multi-hop Wireless Network)
More informationudc-2.dvi
13 0.5 2 0.5 2 1 15 2001 16 2009 12 18 14 No.39, 2010 8 2009b 2009a Web Web Q&A 2006 2007a20082009 2007b200720082009 20072008 2009 2009 15 1 2 2 2.1 18 21 1 4 2 3 1(a) 1(b) 1(c) 1(d) 1) 18 16 17 21 10
More informationuntitled
K-Means 1 5 2 K-Means 7 2.1 K-Means.............................. 7 2.2 K-Means.......................... 8 2.3................... 9 3 K-Means 11 3.1.................................. 11 3.2..................................
More informationgengo.dvi
4 97.52% tri-gram 92.76% 98.49% : Japanese word segmentation by Adaboost using the decision list as the weak learner Hiroyuki Shinnou In this paper, we propose the new method of Japanese word segmentation
More informationSobel Canny i
21 Edge Feature for Monochrome Image Retrieval 1100311 2010 3 1 3 3 2 2 7 200 Sobel Canny i Abstract Edge Feature for Monochrome Image Retrieval Naoto Suzue Content based image retrieval (CBIR) has been
More information日本糖尿病学会誌第58巻第2号
β γ Δ Δ β β β l l l l μ l l μ l l l l α l l l ω l Δ l l Δ Δ l l l l l l l l l l l l l l α α α α l l l l l l l l l l l μ l l μ l μ l l μ l l μ l l l μ l l l l l l l μ l β l l μ l l l l α l l μ l l
More information1 Department of Legal Medicine, Toyama University School of Medicine 2 3 4 5 6 7 8 Department of Ophthalmology, Graduate School of Medicine and Pharmaceutical Sciences, University of Toyama VEGF Key words
More informationB HNS 7)8) HNS ( ( ) 7)8) (SOA) HNS HNS 4) HNS ( ) ( ) 1 TV power, channel, volume power true( ON) false( OFF) boolean channel volume int
SOA 1 1 1 1 (HNS) HNS SOA SOA 3 3 A Service-Oriented Platform for Feature Interaction Detection and Resolution in Home Network System Yuhei Yoshimura, 1 Takuya Inada Hiroshi Igaki 1, 1 and Masahide Nakamura
More informationBull. of Nippon Sport Sci. Univ. 47 (1) Devising musical expression in teaching methods for elementary music An attempt at shared teaching
Bull. of Nippon Sport Sci. Univ. 47 (1) 45 70 2017 Devising musical expression in teaching methods for elementary music An attempt at shared teaching materials for singing and arrangements for piano accompaniment
More information116,/ / - /-, /1 /2 0 / ,, / 3 ing / , 2, 3, , 3,,. ISO. /.. 0 -,. ISO., 0-
115, -, 320 3, -,0, 0, 222,/3- Conjoint 3.., 1,/-0... 0 - Analysis 1, 1/3./. 3 / /-, - 0-,.- ha, /. 1 116,/ / - /-, /1 /2 0 / 0- - 0 2,, / 3 ing - 0. - / - - 0 -. 1 -, 2, 3, - - 3 3 31, 3,,. ISO. /.. 0
More information