¥¼¥ß¥Ê¡¼¥ëȯɽ

Æü»þ: 12·î8Æü¡Ê·î¡Ë3¸Â (13:30-15:00)


²ñ¾ì: L1

»Ê²ñ: °Ë¸¶¡¡¾´µª
ËÌÀî¡¡ØÆ¿Í 1451042: M, 1²óÌÜȯɽ ¥½¥Õ¥È¥¦¥§¥¢¹©³Ø
title: Estimating Developers' Beliefs in OSS Contributions: A Game Theoretical Approach
abstract: In OSS projects, the number of committers, who have permissions to commit code to central repositories, is essential in success.
Although contributors who have worked actively can be good candidates to committers, it can be risk for future maintenance if they will leave
the projects soon after becoming contributors. In this study, we try to estimate contributors' believes (higher/lower continuity) for inviting
them as future committers. We are building a game theoretic framework to estimate contributors' believes using a Bayesian formulation.
language of the presentation: Japanese
 
»Þ¸µ¡¡Àµ´² 1451020: M, 1²óÌÜȯɽ ¥³¥ó¥Ô¥å¡¼¥Æ¥£¥ó¥°¡¦¥¢¡¼¥­¥Æ¥¯¥Á¥ã
title: A Study on Intelligent Memory System for Overcoming Data Moving Bottlenecks
abstract: Important applications, such as a graph processing, have irregular memory access patterns. Due to increasing overheads for data movements to a processor core from a main memory in such applications, the traditional cache based system cannot extract the full computation performance of processor. As the number of transistors increases, energy consumed for data movements will larger than the computation. Therefore reducing the amount of data movements is a very important issue both for performance improvement and power consumption reduction in future computer systems. In this paper, we propose a memory controller for near data processing to overcome these problems. Keywords Graph processing, Memory controller, Data moving bottleneck, Near Data Processing
language of the presentation: Japanese
 
ÉðÅÄ¡¡Í§´õ 1451068: M, 1²óÌÜȯɽ ¥½¥Õ¥È¥¦¥§¥¢´ðÁóØ
title: Paper Introduction "Complexity Classification of Network Information Flow Problems"
abstract: Network coding is an active research field in recent years because of a lot of its advantages. However, the construction of a capacity achieving network code needs a "large" block code length in general, and the practical construction of the code is not obvious because there is a certain limitation on the block length in practical networks. In this paper, the authors consider a lower bound on the block length, and establish taxonomy of network information flow problems from the viewpoint of the computational complexity. They show that even the simplest class of network coding problem is NP-hard, and also show some additional results. In this presentation, I will explain the underlying motivation of choosing this paper, and introduce the main result on this paper.
language of the presentation: Japanese
ȯɽÂêÌÜ: »²¹Íʸ¸¥¾Ò²ð "Complexity Classification of Network Information Flow Problems"
ȯɽ³µÍ×: ¥Í¥Ã¥È¥ï¡¼¥¯Éä¹æ²½¤Ï¡¢¤µ¤Þ¤¶¤Þ¤Ê¥á¥ê¥Ã¥È¤«¤é¡¢¶áǯÃíÌܤò½¸¤á¤ëʬÌî¤Ç¤¢¤ë¡£ ¤·¤«¤·¡¢¥Í¥Ã¥È¥ï¡¼¥¯Éä¹æ¤òÀµ¤·¤¯¹½À®¤Ç¤­¤ë¤Î¤Ï¡¢Á÷¿®¤µ¤ì¤ëÉä¹æ¤Î¥Ö¥í¥Ã¥¯Ä¹¤¬¤¢¤ëÄøÅٰʾå¤ÎÂ礭¤µ¤ò»ý¤Ä¤È¤­¤È¤¤¤¦À©Ì󤬤¢¤ê¡¢¼ÂÍÑŪ¤Ê¥Í¥Ã¥È¥ï¡¼¥¯¥·¥¹¥Æ¥àÅù¡¢¥Ö¥í¥Ã¥¯Ä¹¤ËÀ©Ìó¤¬À¸¤¸¤ë¾ì¹ç¤Î¥Í¥Ã¥È¥ï¡¼¥¯Éä¹æ¤Ïñ½ã¤Ë¹½À®¤Ç¤­¤ë¤È¤Ï¸Â¤é¤Ê¤¤¡£ º£²ó¾Ò²ð¤¹¤ëÏÀʸ¤Ï¡¢¥Í¥Ã¥È¥ï¡¼¥¯Éä¹æ²½¤Î·×»»ÍýÏÀŪ»ëÅÀ¤Ë´ð¤Å¤¤¤¿µÄÏÀ¤ò¹Ô¤Ã¤Æ¤¤¤ë¡£ ɬÍפʥ֥í¥Ã¥¯Ä¹¤Î²¼¸Â¤òÌÀ¤é¤«¤Ë¤¹¤ë¤È¤È¤â¤Ë¡¢¥Í¥Ã¥È¥ï¡¼¥¯Éä¹æ¤Î¼Â¸½²ÄǽÀ­ÌäÂ꤬NPº¤Æñ¤È¤Ê¤ë¤³¤È¤ò¼¨¤·¡¢¥Í¥Ã¥È¥ï¡¼¥¯Information flowÌäÂê¤Î·×»»ÎÌÊÌ¥¯¥é¥¹Ê¬Îà¤ò¹Ô¤Ã¤Æ¤¤¤ë¡£ ËÜȯɽ¤Ç¤Ï¡¢¤³¤ÎÏÀʸ¤ò¼è¤ê¾å¤²¤ë¤Ë»ê¤Ã¤¿Æ°µ¡¤Ë¤Ä¤¤¤Æ½Ò¤Ù¡¢ÏÀʸ¤Î¼ç·ë²Ì¤Ë¤Ä¤¤¤Æ´Êñ¤Ë¾Ò²ð¤¹¤ë¡£
 
¾¾ËÜ¡¡À¿µÁ 1451100: M, 1²óÌÜȯɽ ¥æ¥Ó¥­¥¿¥¹¥³¥ó¥Ô¥å¡¼¥Æ¥£¥ó¥°¥·¥¹¥Æ¥à
title: Proposal and Imprementation of self copy mechanism for distributing applications without the Internet.
abstract: Recently, smartphone-based disaster communication systems are widely studied. Most of these existing systems tend to assume that the required application is installed into a smartphone of all the participants in ahead of the disaster. However, it is not realistic assumption in an actual disaster situation. Especially, if the Internet is disconnected, it becomes hard to get the application necessary for the communication, because most of applications are provided through the cloud and the Internet, such as Google Play. In this paper, we propose a mechanism for distributing applications and implement it. Finally, we confirmed that our proposed method can distribute applications without the Internet.
language of the presentation: Japanese
ȯɽÂêÌÜ: ¼«¸ÊÊ£À½¤Ë¤è¤ë¥¤¥ó¥¿¡¼¥Í¥Ã¥È¥ì¥¹¥¢¥×¥ê¥±¡¼¥·¥ç¥ó³È»¶¼êË¡¤ÎÄó°Æ¤È¼ÂÁõ
ȯɽ³µÍ×: ¸½ºß¤Ë»ê¤ë¤Þ¤Æ,¥¹¥Þ¡¼¥È¥Õ¥©¥ó¤òÍѤ¤¤¿ºÒ³²»þÄÌ¿®¥·¥¹¥Æ¥à¤Î¸¦µæ¤«À¹¤ó¤Ë¹Ô¤ï¤ì¤Æ¤­¤¿.¤³¤ì¤é¤Î¥· ¥¹¥Æ¥à¤Ï,Á´ÍøÍѼԤÎüËö¤ËÂФ·¤ÆɬÍפʥ¢¥Õ¥ê¥±¡¼¥·¥ç¥ó(°Ê¹ß,¥¢¥Õ¥ê)¤«¤¹¤Æ¤Ë¥¤¥ó¥¹¥È¡¼¥ë¤µ¤ì¤Æ¤¤¤ë¤³¤È ¤òÁ°Äó¤È¤·¤Æ¤¤¤ë.¤·¤«¤·,¼ÂºÝ¤Ë¤ÏºÒ³²Á°¤Ë¤½¤Î¤è¤¦¤Ê¥¢¥Õ¥ê¤ò¥¤¥ó¥¹¥È¡¼¥ë¤·¤Æ¤¤¤ë¾õ¶·¤ÏÈ󸽼ÂŪ¤Æ¤¢¤ë.¤½ ¤·¤Æ,¤½¤Î¥¢¥Õ¥ê¤Ï,°ìÈÌŪ¤Ë Google Play ¤Ê¤È¤ÆÇÛÉÛ¤µ¤ì¤Æ¤¤¤ë¤¿¤á,ºÒ³²¤Ë¤è¤Ã¤Æ¥¤¥ó¥¿¡¼¥Í¥Ã¥È¤«ÃÇÀ䤷¤¿´Ä ¶­¤Æ¤Ï,¥¢¥Õ¥ê¤òÇÛÉÛ¤¹¤ë¤³¤È¤«½ÐÍè¤Ê¤¤.¤½¤³¤Æ,¥¤¥ó¥¿¡¼¥Í¥Ã¥ÈÃÇÀä¾õ¶·¤Ë¤ª¤±¤ë¥¢¥Õ¥ê¤Î³È»¶¼êË¡¤ò¹Í°Æ¡¦¼Â Áõ¤·,¼ÂºÝ¤ËÇÛÉÛ¤«¹Ô¤¨¤ë¤³¤È¤ò³Îǧ¤·¤¿.
 
ÅÄÀî¡¡¿¿¼ù 1451066: M, 1²óÌÜȯɽ ¥¤¥ó¥¿¡¼¥Í¥Ã¥È¹©³Ø
title: Network capacity expansion methods based on efficient channel utilization for multi-channel wireless backbone network
abstract: This study implements an architecture of traffic management on multi-channel wireless backbone network (WBN). To the best of our knowledge, there has been no study on simultaneous use of multiple channels (wireless links) between neighboring APs in a WBN. Moreover, the majority of existing studies on multi-channel WBN focus on routing and channel assignment with a limited number of WLAN interfaces in each AP due to hardware specification. On the other hand, from a preliminary measurement, we have observed that there are many vacant channels in the 5 GHz band, which means that wireless resources are not used effectively. Therefore, the aggregation method of all available channels and the traffic management method that fully utilizes the channels are essential. In this Paper, we propose techniques to build OpenFlow-based multi-channel wireless backbone network and then implement three channel utilization methods. Also, we present the architecture increasing the transmission capacity of Wireless Backbone Network.
language of the presentation: Japanese
 

²ñ¾ì: L2

»Ê²ñ: Sakriani Sakti
ÀîÀ¾¡¡À¿»Ê 1451040: M, 1²óÌÜȯɽ ÃÎǽ¥³¥ß¥å¥Ë¥±¡¼¥·¥ç¥ó
title: Voice Activity Detection in Web speech for Automatic Speech
abstract: The speech recognition is one of the most important technology of speech processing and used in various applications. To improve its accuracy, the training with large amount of speech and text data. Web crawling system is one kind of collecting text data but there is not so much precedent in speech data field. In this research, we propose how to extract voice section of speech data collected by Web crawling system.
language of the presentation: Japanese
ȯɽÂêÌÜ: ²»À¼Ç§¼±¤Î¤¿¤á¤ÎWeb¾å¤ÎÀ¼¥Ç¡¼¥¿¤òÍѤ¤¤¿²»À¼¶è´Ö¸¡½Ð
ȯɽ³µÍ×: ²»À¼Ç§¼±¤ÏÍÍ¡¹¤Ê¥¢¥×¥ê¥±¡¼¥·¥ç¥ó¤ËÁȤ߹þ¤Þ¤ì¤Æ¤¤¤ë½ÅÍפʲ»À¼½èÍýµ»½Ñ¤Ç¤¢¤ê¡¢ÀºÅ٤θþ¾å¤Ë¤ÏÂçÎ̤Υƥ­¥¹¥È¥Ç¡¼¥¿¤È²»À¼¥Ç¡¼¥¿¤òÍѤ¤¤Æ¤Î³Ø½¬¤¬É¬ÍפǤ¢¤ë¡£¤½¤Î¥Ç¡¼¥¿¤Î¼ý½¸ÊýË¡¤Î1¤Ä¤È¤·¤ÆWeb¥¯¥í¡¼¥ê¥ó¥°¤¬µó¤²¤é¤ì¤ë¤¬¡¢²»À¼¥Ç¡¼¥¿¤Ë¤ª¤±¤ëWeb¥¯¥í¡¼¥ê¥ó¥°¤Î¼êË¡¤Ë¤Ä¤¤¤ÆÄó°Æ¤µ¤ì¤Æ¤¤¤ë¤â¤Î¤Ï¾¯¤Ê¤¤¡£ËÜȯɽ¤Ç¤ÏWeb¥¯¥í¡¼¥ê¥ó¥°¤Ë¤è¤Ã¤Æ½¸¤á¤é¤ì¤¿²»À¼¥Ç¡¼¥¿¤«¤é¡¢½ê˾¤Î²»À¼¶è´Ö¤Î¤ß¤ò¼ý½¸¤¹¤ë¼êË¡¤Ë¤Ä¤¤¤ÆÄó°Æ¤¹¤ë¡£
 
¶æÍå¡¡¿¿Ìé 1451043: M, 1²óÌÜȯɽ ÃÎǽ¥³¥ß¥å¥Ë¥±¡¼¥·¥ç¥ó
title: Duration Correction for Non-Native speech Based on the Beat Tracking
abstract: English communication skills are necessary due to the economic globalization. However, English uttered by Japanese, which is affected by the Japanese pronunciation, deteriorates the naturalness of the communication. For the utilization in the business and the educational situation, this study proposes the naturalness improvement method based on the duration modification of English uttered by Japanese. Although the conventional supervised method performs the correction based on the DP matching using the parallel native English speech, the phonetic mismatch between the parallel speech deteriorates the naturalness of the modified speech. The proposed method unsupervisedly modifies based on the beat tracking which is used for detecting the musical tempo. This talk presents the result of the duration detection of the native English speech.
language of the presentation: Japanese
ȯɽÂêÌÜ: ¥Ó¡¼¥È¥È¥é¥Ã¥­¥ó¥°¤Ë´ð¤Å¤¤¤¿ÈóÊì¸ìÏüԤβ»À¼¤ËÂФ¹¤ë·Ñ³ĹÊäÀµ
ȯɽ³µÍ×: ·ÐºÑŪ¥°¥í¡¼¥Ð¥ë²½¤Ëȼ¤¤¡¢±Ñ¸ì¥³¥ß¥å¥Ë¥±¡¼¥·¥ç¥óǽÎϤθþ¾å¤¬É¬ÍפǤ¢¤ë¡£¤·¤«¤·¤Ê¤¬¤é¡¢ÆüËܸìÊì¸ìÏüԤϡ¢ÆüËܸì¤Îȯ²»·Á¼°¤Î±Æ¶Á¤ò¼õ¤±¡¢¼«Á³À­¤ÎÄ㤤±Ñ¸ì²»À¼¤òȯÏ乤뷹¸þ¤Ë¤¢¤ë¡£¤½¤³¤ÇËܸ¦µæ¤Ç¤Ï¡¢¥Ó¥¸¥Í¥¹¤ä¶µ°é¸½¾ì¤Ç¤Î³èÍѤò¸«¿ø¤¨¡¢¼«Á³À­Îô²½¤ÎÍ×°ø¤Ç¤¢¤ëȯÏåꥺ¥à¤ÎÊäÀµ¤Ë¤è¤ê¡¢ÆüËܿͱѸì¤Î¼«Á³À­¤ò²þÁ±¤¹¤ë¼êË¡¤òÄó°Æ¤¹¤ë¡£½¾ÍèË¡¤È¤·¤Æ¡¢±Ñ¸ìÊì¸ìÏüԤˤè¤ëƱ°ìȯÏò»À¼¤òÍøÍѤ·¤¿¡¢DP¥Þ¥Ã¥Á¥ó¥°¤Ë¤è¤ë¶µ»ÕÍ­¤ê»þ´Ö¿­½ÌË¡¤¬¹Í¤¨¤é¤ì¤ë¡£¤·¤«¤·¤Ê¤¬¤é¡¢ÆüËܿͱѸì¤ÎȯÏò»ÁǤΰ㤤Åù¤Ëµ¯°ø¤·¤Æ¡¢¿­½Ì¸å¤Î²»¼Á¤¬Â礭¤¯Îô²½¤¹¤ë¡£¤½¤³¤Ç¡¢³Ú²»¤Î¥Æ¥ó¥Ý¿äÄê¤ËÍѤ¤¤é¤ì¤ë¥Ó¡¼¥È¥È¥é¥Ã¥­¥ó¥°Ë¡¤Ë´ð¤Å¤­¡¢ÆüËܿͱѸì¤Î»þ´Ö·Ñ³Ĺ¤ò¥Í¥¤¥Æ¥£¥Ö±Ñ¸ì¤Î·Ñ³Ĺ¤Ë¶µ»Õ¤Ê¤·ÊÑ´¹¤¹¤ë¼êË¡¤òÄó°Æ¤¹¤ë¡£ËÜÊó¹ð¤Ç¤Ï¡¢¥Í¥¤¥Æ¥£¥Ö±Ñ¸ì¤Î·Ñ³Ĺ¸¡½Ð¤Ë¤Ä¤¤¤Æ¸¡¾Ú¤·¤¿·ë²Ì¤òÊó¹ð¤¹¤ë¡£
 
ÂçÅè¡¡¹¸Ê¿ 1451023: M, 1²óÌÜȯɽ ¥¤¥ó¥¿¥é¥¯¥Æ¥£¥Ö¥á¥Ç¥£¥¢À߷׳Ø
title: Sharpen View: Improved Legibility of Defocused Content on Optical See-Through HMDs
abstract: Research objective is to improve legibility of defocused content on Optical See-Through HMDs. Specifically we reduce focus blur effect on the display resulting from the difference in the depth of the gaze point and the display. Firstly, we consider human eyes as simple lens model. And we sharpen the image on the display according to lens blur characteristic, which provides higher legibility than the original image.
language of the presentation: English
ȯɽÂêÌÜ: Æ©²á·¿HMD¤Ë¤ª¤±¤ëAR¥³¥ó¥Æ¥ó¥Ä¤Î¾ÇÅÀ¥Ü¥±·Ú¸º
ȯɽ³µÍ×: ¸¦µæÌÜŪ¤ÏÆ©²á·¿HMD(Head Mounted Display)¤Ë¤ª¤±¤ë»ëǧÀ­¤Î¸þ¾å¤Ç¤¢¤ë¡£ ¶ñÂÎŪ¤Ë¤Ï¥æ¡¼¥¶¤ÎÃí»ëÅÀ¤È¥Ç¥£¥¹¥×¥ì¥¤¤Î±ü¹Ô¤­¤Îº¹¤«¤éÀ¸¤¸¤ë¥Ç¥£¥¹¥×¥ì¥¤¾å¤Î¾ÇÅÀ¥Ü¥±¤ò·Ú¸º¤¹¤ë¡£ ¥¢¥×¥í¡¼¥Á¤È¤·¤Æ¤Ï¿Í´Ö¤ÎÌܤòñ½ã¤Ê¥ì¥ó¥º¥â¥Ç¥ë¤È¤·¤Æ¹Í¤¨¡¢¥ì¥ó¥º¤Î¥Ü¥±ÆÃÀ­¤Ë±þ¤¸¤Æ¥Ç¥£¥¹¥×¥ì¥¤¾å¤Î±ÇÁü¤òͽ¤áÁ¯±Ô²½¤¹¤ë¤³¤È¤Ç¡¢¸µ±ÇÁü¤è¤ê»ëǧÀ­¤Î¹â¤¤±ÇÁü¤òÄ󶡤¹¤ë¡£
 
¾®Åè¡¡æÆÂÀ 1451044: M, 1²óÌÜȯɽ ´Ä¶­ÃÎǽ³Ø
title: Estimation of Interesting Objects from Crowd's Gaze Behavior and Group Formation
abstract: The information "what do people pay attention to?" is used for a variety of purposes, such as human-robot interaction and commercial use, so various studies are conducted for estimating what people are interested in. We want to estimate interesting targets by using cameras installed in environments like surveillance cameras, however, it is difficult to do gaze tracking by reason of camera resolution. In this study, we integrate multiple people's head poses to estimate gaze concurrences or interesting targets. At this time, we try to group a crowd to make estimation more accurate by using people group formation. In this presentation, we will introduce several existing researches, and then show our research plan.
language of the presentation: Japanese
ȯɽÂêÌÜ: ·²½¸¤ÎÃí»ë¤È¥°¥ë¡¼¥×¹½À®¤«¤é¤Î¶½Ì£ÂоݿäÄê
ȯɽ³µÍ×: ¿Í¤¬´Ä¶­Ãæ¤Î²¿¤ËÃíÌܤ·¤Æ¤¤¤ë¤«¤È¤¤¤¦¾ðÊó¤Ï¡¤¿Í¡¦¥í¥Ü¥Ã¥È¥¤¥ó¥¿¥é¥¯¥·¥ç¥ó¤ä¥³¥Þ¡¼¥·¥ã¥ëÍøÍѤʤɤÎÉý¹­¤¤ÍÑÅÓ¤¬¤¢¤ê¡¤ ¶áǯ¡¤¤µ¤Þ¤¶¤Þ¤Ê¸¦µæ¤¬¹Ô¤ï¤ì¤Æ¤¤¤ë¡¥ ´Æ»ë¥«¥á¥éÅù¤Î´Ä¶­Ãæ¤Î¥«¥á¥é¤òÍѤ¤¤Æ¶½Ì£ÂоݿäÄê¤ò¹Ô¤¦¾ì¹ç¡¤»ëÀþ¤Î·×¬¤Ï¥«¥á¥é²òÁüÅÙ¤ÎÌäÂ꤫¤éº¤Æñ¤Ç¤¢¤ë¡¥ ¤½¤³¤Ç¡¤Ëܸ¦µæ¤Ç¤Ï¡¤Ê£¿ô¿Í¤ÎƬÉô»ÑÀª¤òÅý¹ç¤·¤Æ¡¤»ëÀþ¤Î½¸Ã桤¤¹¤Ê¤ï¤Á¶½Ì£Âоݤò¿äÄꤹ¤ë¡¥ ¤³¤Î¤È¤­¡¤·²½¸¤Î¥°¥ë¡¼¥×¹½À®¤òÍøÍѤ·¡¤¶½Ì£ÂоݿäÄê¤ÎÀºÅÙ¸þ¾å¤ò¿Þ¤ë¡¥ ËÜȯɽ¤Ç¤Ï¡¤Ëܸ¦µæ¤Î´ð´´¤È¤Ê¤ë¸¦µæ¤Ë¤Ä¤¤¤Æ¾Ò²ð¤·¡¤º£¸å¤Î¸¦µæ·×²è¤Ë¤Ä¤¤¤Æ¼¨¤¹¡¥
 
Í­»³¡¡Í´Ê¿ 1451006: M, 1²óÌÜȯɽ ¼«Á³¸À¸ì½èÍý³Ø
title: Disambiguation of Named Entities in Text
abstract: Disambiguation named entities in natural language text maps mentions of ambiguous names onto entities registered in a knowlege base such as DBpedia or BabelNet.
When this technology is developed improvement of meaning understanding of sentence can be expected.
In this presentation, I will introduce conventional approach, and then show my research plan.
language of the presentation: Japanese
 
º£°æ¡¡Í¥ºî 1451013: M, 1²óÌÜȯɽ ¼«Á³¸À¸ì½èÍý³Ø
title: Introduce Topic Model for Twitter and Suggest the Improved Model
abstract: The studies of various topic model for Microblogs such as Twitter which have prevailed rapidly in our society, have been reported. In this presentation, I will introduce some preceding studies and suggest improved model.
language of the presentation: Japanese
ȯɽÂêÌÜ: Twitter¤Ë¤ª¤±¤ë¥È¥Ô¥Ã¥¯¥â¥Ç¥ë¤Î¾Ò²ð¤È²þÎÉ¥â¥Ç¥ë¤ÎÄó°Æ
ȯɽ³µÍ×: ¶áǯµÞ®¤ËÉáµÚ¤·¤Æ¤¤¤ëTwitter¤òÂåɽ¤È¤·¤¿¥Þ¥¤¥¯¥í¥Ö¥í¥°¤Ë¤ª¤±¤ëÍÍ¡¹¤Ê¥È¥Ô¥Ã¥¯¥â¥Ç¥ë¤Î¸¦µæ¤¬Êó¹ð¤µ¤ì¤Æ¤¤¤ë¡¥ ËÜȯɽ¤Ç¤Ï¤¤¤¯¤Ä¤«¤ÎÀè¹Ô¸¦µæ¤Ë¤Ä¤¤¤Æ¾Ò²ð¤·¡¤²þÎÉ¥â¥Ç¥ë¤òÄó°Æ¤¹¤ë¡¥
 

²ñ¾ì: L3

»Ê²ñ: ર桡ÃÒÌé
Àî¾å¡¡ÍÛ»Ò 1451036: M, 1²óÌÜȯɽ ·×»»¥·¥¹¥Æ¥à¥ºÀ¸Êª³Ø

title: Construction of an age estimation model using hippocampal metabolite concentrations and cognitive and memory function scores

abstract: The incidence rate of epilepsy is 1%. An epileptic seizure is caused by the abnormal electrical activity of neurons. Biomarker metabolites for neuron activity can be measured non-invasively using 1H-MRS (proton magnetic resonance spectroscopy). Such neurobiological information and cognitive and memory function may useful for a diagnosis and a treatment of epilepsy. As a first step, in this study, we evaluated the effect of aging on neuronal and cognitive activity using MRS-measurements and scores of memory function test for healthy people, and modeled their relationship to estimate the subject¡Çs ¡Èneuropsycological age¡É.

language of the presentation: Japanese

 
ÅÄÃ桡ͺ´õ 1451071: M, 1²óÌÜȯɽ ·×»»¥·¥¹¥Æ¥à¥ºÀ¸Êª³Ø
title: Prediction of efficacy from herbal medicine recipe using Baysian filter
abstract:The many countries use harbal medicine which utilizes medical plant. For example Japan (kampo) and Indonesia (Jamu). Estimation of efficacy from their recipe is important for standardzation of these medecine. Moreover, Knapsack is metabollite database including herbal medicines and compounds in their plant.By combing information of such prediction models and metabolite database will allow us to find compounds which have not discovered in plant of the present recipes.In this presentation , I will introduce the result of prediction and analysis from plants and compounds in Jamu recipe by using Bayesian filter.
language of the presentation: Japanese
 
ÅÏÉô¡¡²íÇ· 1451121: M, 1²óÌÜȯɽ ¥í¥Ü¥Æ¥£¥¯¥¹
title: Cloth-folding system by a humanoid robot
abstract: In recent years, more and more people do not have enough time caused by increasing care work in population aging and working hours under the depression. Thus, I focus on housework robots and aim at achieving cloth-folding tasks. In this presentation, we first consider feasibility and issues of the folding tasks. Next, we propose the method to solve the issues.
language of the presentation: Japanese
ȯɽÂêÌÜ: ¥Ò¥å¡¼¥Þ¥Î¥¤¥É¥í¥Ü¥Ã¥È¤Ë¤è¤ë°áÎàÀޤꤿ¤¿¤ß¥·¥¹¥Æ¥à
ȯɽ³µÍ×: ¶áǯ¡¢¹âÎ𲽤ˤè¤ë²ð¸î¤äÉԷʵ¤¤Ë¤è¤ëĹ»þ´ÖϫƯ¤Ë¤è¤ê¡¢²È»ö¤ËÈñ¤ä¤»¤ë»þ´Ö¤Ï¸º¾¯·¹¸þ¤Ë¤¢¤ë¡£¤½¤³¤ÇËܸ¦µæ¤Ç¤Ï²È»ö»Ù±ç¥í¥Ü¥Ã¥È¤ËÃåÌܤ·¡¢¤½¤Î¥¿¥¹¥¯¤Î°ì¤Ä¤Ç¤¢¤ë°áÎà¤ÎÀޤꤿ¤¿¤ß¤Î¼Â¸½¤òÌܻؤ¹¡£ËÜȯɽ¤Ç¤Ï¡¢¤Þ¤ºÀè¹Ô¸¦µæ¤ò¾Ò²ð¤·¡¢¥¿¥¹¥¯¤Î¼Â¸½²ÄǽÀ­¤äÌäÂêÅÀ¤Ë¤Ä¤¤¤Æ¹Í»¡¤¹¤ë¡£¼¡¤Ë¡¢¤½¤ì¤ò²ò¾Ã¤¹¤ë¤¿¤á¤Î¼êË¡¤Ë¤Ä¤¤¤ÆÄó°Æ¤¹¤ë¡£
 
»å°æ¡¡½ãÚö 1451009: M, 1²óÌÜȯɽ Â絬ÌÏ¥·¥¹¥Æ¥à´ÉÍý
title: Implementation and evaluation of evacuation guiding application using trajectories of mobile terminals: On trajectory gathering, evacuation route presentation, and information sharing
abstract: Our laboratory aims to achieve an automatic evacuation guiding system using mobile terminals of evacuees. In this system, mobile terminals obtain their trajectories by measuring their locations periodically, estimate road hazard using their information, and present appropriate evacuation routes to evacuees. In this presentation, I introduce an existing Android application that can periodically measure its locations and send them to a server via a Wi-Fi connection. I also report the progress about the development of above-mentioned functions.
ȯɽÂêÌÜ: ¥â¥Ð¥¤¥ëüËö¤Ë¤ª¤±¤ë°ÜÆ°µ°À×¾ðÊó¤òÍѤ¤¤¿ÈòÆñͶƳ¥¢¥×¥ê¥±¡¼¥·¥ç¥ó¤Î¼ÂÁõɾ²Á:µ°À×¾ðÊó¼ý½¸, ÈòÆñ·ÐÏ©Äó¼¨, ¾ðÊó¶¦Í­¤Ë´Ø¤¹¤ë°ì¸¡Æ¤
ȯɽ³µÍ×: ȯɽ¼Ô¤Î¸¦µæ¼¼¤Ç¤Ï¡¤ºÒ³²È¯À¸¸å¡¤ÈòÆñ¼Ô¤Î½êÍ­¤¹¤ë¥â¥Ð¥¤¥ëüËö¤òÍѤ¤¤ë¤³¤È¤Ç¡¤¼«Æ°Åª¤«¤Ä¿×®¤ÊÈòÆñͶƳ¤Î¼Â¸½¤òÌܻؤ·¤Æ¤¤¤ë¡¥¤³¤Î¤È¤­¡¤Ã¼Ëö¤¬Äê´üŪ¤Ë°ÌÃÖ¾ðÊó¤ò·×¬¤¹¤ë¤³¤È¤ÇÈòÆñ¼Ô¤Î¹ÔÆ°¤ò°ÜÆ°µ°ÀפȤ·¤ÆÇÄ°®¤¹¤ë¤È¤È¤â¤Ë¡¤Ä̹ÔÉÔǽ²Õ½ê¤ò¿äÄꤷ¡¤ÈòÆñ¼Ô¤ËŬÀÚ¤ÊÈòÆñ·ÐÏ©¡Ê¿äÁ¦·ÐÏ©¡Ë¤òÄ󼨤¹¤ëµ¡Ç½¤¬µá¤á¤é¤ì¤ë¡¥ËÜȯɽ¤Ç¤Ï¡¤AndroidüËö¤òÂоݤ˳«È¯¤µ¤ì¤¿¡¤°ÌÃÖ¾ðÊó¤Î¼ý½¸¡¤ÌµÀþLAN·Ðͳ¤Ç¥µ¡¼¥Ð¤Ë°ÌÃÖ¾ðÊó¤òÁ÷¿®¤¹¤ë¤³¤È¤Î¤Ç¤­¤ë´û¸¤Î¥¢¥×¥ê¥±¡¼¥·¥ç¥ó¤ò¾Ò²ð¤¹¤ë¡¥¤µ¤é¤Ë¡¤¸½ºß³«È¯Ãæ¤ÎÃÏ¿Þ¡¤µ°Àס¤·Ðϩɽ¼¨µ¡Ç½¤Î³µÍפò¾Ò²ð¤¹¤ë¡¥
 
¾®Àî¡¡²Æµ± 1451030: M, 1²óÌÜȯɽ Â絬ÌÏ¥·¥¹¥Æ¥à´ÉÍý
title: On Server's Piece Sending Strategy fo Optimal Tit-for-Tat-Based P2P File Distribution
abstract: Tit-for-Tat (TFT) based Peer-to-Peer (P2P) file distribution systems, such as BitTorrent, can efficiently disseminate massive contents, e.g., disk images of operating systems, from a server to many peers, by coping with selfish behavior of each peer. Centralized optimal scheduling for TFT-based P2P file distribution has been already revealed. Our research group tries to develop a distributed algorithm to achieve such optimal scheduling. In this presentation, I introduce the existing work on the centralized optimal scheduling and report the progress about the analysis of optimal server's piece sending strategy.
language of the presentation: Japanese
ȯɽÂêÌÜ: ºÇŬ¤ÊTit-for-Tat·¿P2P¥Õ¥¡¥¤¥ëÇÛ¿®¤Î¤¿¤á¤Î¥µ¡¼¥Ð¤Î¥Ô¡¼¥¹Á÷¿®Àïά¤Ë´Ø¤¹¤ë°ì¸¡Æ¤
ȯɽ³µÍ×: Linux OS¤Î¥Ç¥£¥¹¥¯¥¤¥á¡¼¥¸¤Ê¤É¤ÎÂçÍÆÎÌ¥Õ¥¡¥¤¥ë¤¬, BitTorrent¥×¥í¥È¥³¥ë¤Ê¤É¤ÎP2Pµ»½Ñ¤òÍѤ¤¤ÆÇÛ¿®¤µ¤ì¤Æ¤¤¤ë. BitTorrent¤Ç¤ÏTit-for-Tat(TFT)¤È¸Æ¤Ð¤ì¤ëÀïά¤¬Æ¯¤¤¤Æ¤ª¤ê, ¥Õ¥¡¥¤¥ë¤ò¥À¥¦¥ó¥í¡¼¥É¤¹¤ëüËöƱ»Î¤Î´Ö¤ËÀ©Ì󤬳ݤ«¤Ã¤Æ¤¤¤ë. ËÜȯɽ¤Ç¤Ï, Tit-for-Tat·¿P2P¥Õ¥¡¥¤¥ëÇÛ¿®¤Ë¤ª¤±¤ë ºÇŬ¤Ê¥¹¥±¥¸¥å¡¼¥ê¥ó¥°¤ò¸µ¤Ë, ÇÛ¿®¥µ¡¼¥Ð¤Î¥Ô¡¼¥¹Á÷¿®Àïά¤Ë¤Ä¤¤¤Æ¤Î¸¡Æ¤¤ò¹Ô¤¦.