I Í Ÿ æ\aãõ Ì \ƒg vo Ž Ÿª u ½ Ç ÙS p ß ÿì uì Park Soo-Hyun. Pusan National University shpark@pearl.cs.pusan.ac.kr May, 2008 Å c / 3òÙ \Çì ƒg vo Žù Second Life, World of Warcraft # "& 3òÙ 3ú ¾3 î± L. tüßù à ³\üL y Ï 3òÙ \ ƒgõ xãš PÌ 3 À [î ú L 6 Gš Š ^ Ï Ÿ ú CW 6 >> Ì Œµ L. vo Ž éù Š;& 2ò Ù xy ;Ì ý6ûú PÌ L. ŸU \Çì ƒg vo Ž èßð PÌ L ý6 é ù Complete Talk õ Ì, I Í $ý# è> # Ÿ æ\aãõ L² ML \ A ¾ Ÿ xú vç t %ý Fq PŠ ÂÜ 4Ìê «PŠ ÂÜ? Ç ½ ú < I EÍ %ý Fq PŠY «PŠ x vš q, u ÂÜ 4Ì :³ Ÿ q². èßðù [Cõ @ L \Çì ƒg Çì ú mÿ æ Š  ÂÜ # Ý ÂÜ # W: ý6 Ÿªú :Ì # Š;& vç G. Æ ÃLt t ìc fß t ÂÜõ : \ Y $ý# ÃL ³ 0 ÂÜ é Aê µ,ú ŸÆ ] Partial Talk õ Ì vo Ž Ÿªú f. scq: Communication, 3D-Word Balloon, Visibility, Chatting, Virtual World 1 tá / 3òÙ 3ú j j \Çì ƒg vo Ž èßð À [îú L 6, Massively Multiplayer Online Game (MMOG) è$ù 1SÙú JqtL. "& World of Warcraft and Second Life [11] # 3ù ÌÎ ³\ý ŸÁY ýäl y Ï t üßõ xãš À s@ú L 6 Gš Š ^ Ï Ÿ ú CW 6 ÌÎ Œ; L. \ƒg èßðù 3òÙ ½u mù \ Wú CW L # vo Ž éù Š; & 2òÙ x# ;Ì ý6ûú PÌ L. 0 èßðù ý Ï vo Ž éú CW Ÿ æ Š  ÂÜ # Ý ÂÜ # W: ý6 Ÿªú CW # ì C fß t ÂÜ éy ¾3 ò q Çì ú FqrýL. \Çì ƒg Gý N² èßð World of Warcraft Second Life [11], IMVU [9]. 1 t Ç ½ " èßðù PÌ q ³ t à ù ¾Ÿ xú Ê s6, %ý Fq ý6 ê IX Ÿ : C ú ML ÂÜ 4Ìú AÝ 3 Ç ½. é 0 %ý Fq PŠY «PŠ x vš PÌ q, u ÂÜ 4Ì :³ Ÿ q². Íý ÂÜõ Complete Talk. Complete Talk õ Ì é ý6 ª ¾ ìc fß t ÂÜ éy ò L Ç ½. ìc fß t PŠù ôè Š ÂÜõ AÝ 3 ú ½ { 6, "& %ý $# P $Y] PŠ ÂÜ 4Ìú <Ý 3 ;& G L Å # = = ³q é. ìc fß t ÂÜ éú Íý Partial Talk. Æ ÃLt t CK vo Ž Ÿªù ìc fß t Øq ÂÜ t Ç ½ Partial Talk õ ŸÆ I%q. Dept. of Computer Science 1 Pusan National University
(a) Second Life. (b) IMVU. (c) World of Warcraft. (d) CK vo Ž Ÿª. 1: (a)(b)(c)3òù \Çì ƒg vo Ž. èßðù PÌ q ³ t à ù ¾Ÿ xú Ês6, %ý Fq ý6 ê IX Ÿ : C ú M L ÂÜ 4Ìú AÝ 3 Ç ½. é 0 %ý Fq PŠY «PŠ x vš PÌ q, u ÂÜ 4Ì :³ Ÿ q². 1 (d) Æ ÃLt t f L vo Ž Ÿªú Êu. 1 (d) Ç& 8< ÂÜ ÂÜõ L 6 ¾3 Ý #Œq [ Ý ý6ú L. XÅ Ý ù XÅ Ý š ÂÜ ú AÝ 3 Ç ½ 6, %ý Fq Ý t ý6ú L Pì ú NIòýŸ < AÝ& qe ÂÜõ N ½ {. ; ô èßðù ý6 Ÿªú Ý ý6 Ûê Š ý # CK vo Ž èßð t ìc ƒg Ÿ : C ú \Çì ƒg ; ß 3 Ý ÂÜ Øq êà. Æ ÃLt t f vo Ž ª ¾ ¾3 üy ù Ÿªú PÌ. 1. è GS: Partial Talk õ èqªž Ÿ æ t x è Aêõ GS Š õ P Ì. 2. x X: x è Aêõ /ÂÜ æxõ üit xú X. 3. ÂÜ S: ŸU èßð t ÂÜ Š Aú I Í Cß# va vç Ï, ÂÜ ÛæŸõ xú Š ³& vç. 4. ÂÜ 9$: ŸU èßð ³ íß! ÂÜ 4Ìú 9$ Ï,ú 9$ Š ÂÜ [/»º [G ÂÜ öú Ú êóú u. 2 3òÙ x vç Ÿª CK vo Ž Ÿªù Partial Talk õ :Ì Š I Í $ý# è> 0 è A ê ô xú Êu. PÌ ÂÜõ ³ 8 ¾ x I Í æå f ü6, xù I Í Ã ³ â \ ù ªx âõ L ç;. 0 t PÌù v Dept. of Computer Science 2 Pusan National University
yú s ÃL I Í ÂÜ ú ¹ 3 Ç ½ 6 t s ÃL Mù I Í Â Ü ÙÛ: Ç ½. xú îy: #Í4Ÿ æ t x è Aê õ GS Š îy: vç Ÿ æ = Ÿª Å. 2.1 è GS Partial Talk I Í x è Aê ¾3 ³ú t õ GS L îñ: Ì, Å. I Í x è Aê(V CB : V irtualchattingbandwidth) I Í A a, A b vo Ž Aêõ #Í6. 2 I Í A a, A b vo Ž š èõ Êu. 2: W a W b I Í A a A b xú #Í6. l a,b x W a W b î>ú @ x6 θ a θ b l a,b W a, W b Øq êõ #Í6. 2 t A a, A b ÂÜõ L I Íõ #Í46 N a A a ³ â, N b A b ³ âõ #Í6. Z W a W b A a A b xú #Í46, xù A a A b ³ â ô N a N b õ ªx â. l a,b x W a W b î>ú @ x6 θ a θ b l a,b W a, W b Øq êõ #Í6. I Í A a A b V CB I u. V CB(A a, A b ) = C 1 (sin θ a sin θ b ) k 1 dist(a a, A b ) k 2 + C2 C 1, C 2, k 1, k 2 Cq \½6, k 1 ê 0ô V CB ú, k 2 $ý 0ô V CB ú :¾ 3 SA ½. V CB v ½À PÌ ÂÜ 4Ìú Ì AÝ 3 Ç ½. V CB(A a, A b ) θ a, θ b = π/2 : / ü6, θ a, θ b > π : 0 ý. 3ù I Í ³Y $ý 0ô V CB 0 ò3 #Í# x šõ Ê u. I š t C 1 = 100, C 2 = 1, k 1 = 0.5, k 2 = 2 ú PÌ. 3 t Ã,Y PÌ «Ï $ý ú : ÌÎ ÂÜõ AÝ 3 Ç ½ 6 I Í ³ â ò v L $ý %q ½À ÂÜ 4Ìú AÝ 3 NIß *. 2.2 x X ŸU èßðù vo Žú æ 3òÙ \ Wú CW vo Ž 2ò Ù xú PÌ t ŸU 2òÙ e8 t xú X,ù üp: ³ [C. 3òÙ Ÿ æ\aãõ PÌ 3òÙ xú îy: X [C à Ä!. õ @ Ÿ æ Š x X Greedy NLý ú PÌ. NLý 1ù 3òÙ W t xú îy: X Ÿ æ NLý ú Êu. I Í Ç& V CB * Gõ u L xú ü æx & X ú EÍ V CB Ÿ $ ¾3 þ xú u Š ¾ xú & X èç. NLý 1ù Greedy ª Dept. of Computer Science 3 Pusan National University
(a) $ý l a,{b,c} = 0.04. (b) $ý l a,{b,c} = 0.38. 3: I Í ³Y $ý 0ô V CB 0 ò3 #Í# x š. s ÃL Mù I Í ÂÜ ÙÛ: xú t Ç ½ 6, I Í $ý %q ½À ÂÜ 4Ìú AÝ 3 ß *. Algorithm 1 V CB GS NLý For each a i AGENT S, CurrentV CB = w j W B V CB(a i, w j ) for each w k W B do W B Replace(W B(w k )) NewV CB = w l W B V CB(a i, w l ) calculate V CB = NewV CB CurrentV CB replace W B to MaxW B( V CB) ú Š ¾ I Í V CB / ú ½ êà s6 A è < ½±ý. x ü æxõ xa,ù \¾& Ä! [Ct y-9ú 0 æ A < Â Ó æx A Š xa. 4 x X @Yõ Êu. èßðù NLý 1 0 4 xú X. 4-(a) t {ô_ x d ˆ_ x ²K à M. 4-(b) t {ô_ x æ Ì \ dˆ _ x ý M,ú Ç ½. 3òÙ W t xú îy: X ªù \¾ & Ä! [Ct õ æ Ç& Greedy NLý ú PÌ L 6 x Ó Z \ ³ A L. ÌÎ /:Üý Xõ æ t \ ³ ½ j æx xa Å,. 2.3 ÂÜ S ; èßðù PÌ Aú I Í Cß# vy va ºÜ vç. CK v o Ž èßð t ÂÜõ #Í4 x Z x#?j, ¾Ÿ, _ #ú Š ÂÜ 4Ì ÛæŸõ ³& vç. xú f Ÿ æ Š LCT (Loudness of Chatting Text)õ A. LCT (Loudness of Chatting Text) ÂÜ(dialog d i ) Sü Aêõ GS Ÿ æ, ÂÜ [Ž 08 LCT (d i ) = 0 6 Mú EÍ I u. LCT (d i ) = ExclamationMark(d i) + CapitalW ord(d i ) T otalw ord(d i ) LCT ÂÜ [Ž j ý v ½ Â[ ½ ³ú. èßð t GSý LCTõ x ¾Ÿ SA º½ :Ì Š LCT À x EÍ ÌÎ ¾3 vç. Z ÂÜ Dept. of Computer Science 4 Pusan National University
(a) (b) 4: 3òÙ x X. (a) #Ÿ X Ü8. (b) x & X ó Ü8. èßðù NLý 1 0 V CB / ú ½ êà xú & X. (a) t dˆ_ x ² {ô_ x (b) t æ,ú Ç ½. [Ž v j ý xù {ô_ vç L, ÂÜ [Ž ]üv j ý,ù Þ ù_ vç Š %ýt Ç : [ ù ÂÜ ÏP ù ÂÜ 4Ì :³ ½ ê À. 5 ô LCT 0 x qn3 ò3 vçü õ Êu. (a) (b) 5: 6< ÂÜ ÂÜõ L. (a) Eö[ %ý Fq < g ÂÜ õ L,ú ÃL. %ý Fq Ý ÂÜ Pì ú NIò <, $ ý \ %ý FqK t Ÿ : C 0 AÝ ÂÜ N ½ {. (b) %ý Fq Ý ÂÜ À ý ÂÜõ. LCT v 0 Sý À x I Í "ýæ r,ú Ç ½ 6, (a) t Ý ÂÜõ AÝ 3 Ç ½ {}Ï E ö[ê Sý x ÂÜ 4Ìú <Ý 3 Ç ½ 3 ý. 3 ÂÜ t f ÂÙÛ PÌ ý6ú 8t ù ú ôè Ÿ :[ ÂÜõ 9$,ù ý6 èßð t CW b Å ÙÛ. Comic Chat [10] t ÂÜ 4Ìú Ü 9$,ú C½ 8  ÙÛ ŸU ý6 èßðù ³ è t 0 ÂÜõ ³ íß! 9$. ÂÜ 9$ éù \ ƒg t PÌ ô 6 ÂÜ EÍ ÂÜ öú 7J Ÿ q. ÂÜ t (CF G : ChattingF lowgraph) 3òÙ \ W t ÂÜ t [G õ #Í6. d T alk(a i, t i ) vçü6, ÂÜõ PŠ a i ÂÜõ ³ è t j, ³ [Ž u ý. T alk(a i, t j ) = MESSAGE Dept. of Computer Science 5 Pusan National University
NLý 2 T alk(a i, tj) 0 CF Gõ u NLý ú Êu. Algorithm 2 CF G(ChattingF lowgraph) f NLý procedure CF G from T alk(a i, t i ) V i a i N i N i, normal vector of T alk(a i, t i ) T i t i E {(v i, v j ) v i, v j V, i j} for each edge E do if V CB(v i, v j )/ t ij > δ then E(v i, v j ) = T RUE CF G RemoveT ransitivity(g(v, E)) return CF G end procedure Chatting Flow Graph (CFG) è < t ij VCB ýl º½ δ @Aý. RemoveTransitivity() ½ \ Transitivityõ f ú QC Ú, # \ q d t Ì\ Transitivity Œf Mú :«è < 0 õ C $. I v 1 1ù \ ÂÜ @Àú f š. \ ÂÜ (A, B,..., F ) ¾3 Ýú Øq ÂÜõ L 6, G1 A Bõ, G2 D, E, F, Gõ j L, A. Ý ÂÜ Š Ý 4 ÂÜ 4Ìù Ç ½ { ô Ý ÂÜ 4Ìù Ÿ : C Š Ç ½ {. ôè ³ ÂÜ { L A. 6ù v 1 T alk @Àú Chatting Flow Graph (CFG) u,. v 1: T alk(a i, t i ) @À f. Time t i Agent a i Message 1 D Did you finish your technical report? 3 F Not yet... 4 E Wow! It s already TR time!! 5 G You also prepare the international conference s paper, right? 6 A Did you finish your homework? 7 D Yeah.. It s very hard.. 8 B No... I m really worried about this situation. 9 F Come on, You can do it! 10 A Cheer up! Let s have a break. Chatting Flow Graph (CFG) ³ & è t 0ô ÂÜ 4Ì 9$ < I ÂÜ [/»º [G öú directed acyclic graph 9$. ; ý6 èßð t ³ & ÂÜ 4Ì [Žú 9$ Ÿ Ï,à ýc îñ: Ç ½ 6 ÂÜ öú Ú Ì ù êóú V ½ ú,. 4 8ó u CK vo Ž èßðù Š;& @ b == G [C>ú L. Problem 1: Dynamic Effects ÌÎ ì # 3òÙ vo Žú vç Ÿ æ t jþâ Y -Ž Cß Â Ü x Z S Y -Žú ô: vçþ Å. Dept. of Computer Science 6 Pusan National University
6: v 1 T alk  CFG(Chatting Flow Graph). Þù >x vçý Remove- Transitivity() ½ C$ý. Problem 2: Speaker ý Ù èb P Mù ý, Œ t Ùò ý# ß v t вN ý # [ u Å. Problem 3: Optimal Algorithm for Placing Word Balloons Ç& 3òÙ xú X Ÿ æ greedy NLý ú PÌ L # õ /:Ü Ÿ æ u Å. References [1] êô, ËE,, and SÞ. Ü \ t x ô f ª. v {Œâ ß ç 8G ÁÂç f[š, 71-72, 2006. [2] áù, ËE, êô, and SÞ. Ü Ü f ú æ x ô X Ÿª. {Œâ ß ç f[, 12(1), 2006. [3] êô, ËE,, and SÞ. Ü \ t x ô f ª. v{œâ ß çf[, 13(1), 2007. [4] Microsoft Chat(Comic Chat). http://research.microsoft.com/vwg/projectsheets/comicchat.htm. [5] Worlds Chat. http://www.worlds.net/products/wchat/readme.html. [6] Bong-Kyung Chun, Dong-Sung Ryu, Won-Il Hwang, and Hwan-Gue Cho. An automated procedure forword balloon placement in cinema comics. LNCS(Lecture Notes in Computer Science) 2006, 576-583, 2006. [7] Microsoft Corp. Microsoft introduces v-chat communications for msn. Microsoft Press Release. Redmond, WA 98052, 1995. [8] Francisco Grimaldo, Miguel Lozano, Fernando Barber, and Guillermo Vigueras. Animating groups of socially intelligent agents. 2007 International Conference on Cyberworlds, pages 136 143, 2007. Dept. of Computer Science 7 Pusan National University
[9] IMVU. http://imvu.com/. [10] David Kurlander, Tim Skelly, and David Salesin. Comic chat. Proceedings of SIGGRAPH 1996, 225-236, 1996. [11] Second Life. http://www.serakorea.com. [12] Teresa Monahan, Gavin McArdle, and Michela Bertolotto. Virtual reality for collaborative e- learning. Computers & Education, 50:1339 1353, 2008. [13] C. Morningstar and F. R Farmer. The lessons of lucasfilm s habitat. Cyberspace First Steps, pages 273 301, 1991. [14] Samuli Pekkola. Critical approach to 3d virtual realities for group work. Proceedings of the second Nordic conference on Human-computer interaction, pages 19 23, 2002. [15] Chat Room. http://en.wikipedia.org/wiki/chat room/. [16] Freelancin Roundtable. http://en.wikipedia.org/wiki/freelancin roundtable/. [17] Bor shen Lin, Berlin Chen, Hsin min Wang, and Lin shan Lee. A hierarchical tag-graph search scheme with layered grammar rules for spontaneous speech understanding. Pattern Recognition Letters, 23:819 831, 2002. [18] Evangelos Kotsovinos Tansu Alpcan, Christian Bauckhage. Towards 3d internet: Why, what, and how? 2007 International Conference on Cyberworlds, pages 95 99, 2007. Dept. of Computer Science 8 Pusan National University