Nara Institute of Science and Technology

naistar NAIST Academic Repository
Not a member yet
    13197 research outputs found

    ミチ ガイラン センサノイズ モデルカ ゴサ ニ ガンケンナ スイチュウ ドローン ノ ツイジュウ セイギョ

    Get PDF
    奈良先端科学技術大学院大学修士(工学)master thesi

    ガゾウ シゲキ ニ タイスル ジョウドウ ハンノウ モデル ト シテ ノ EDA スイテイ モデル ノ タンサク

    Get PDF
    奈良先端科学技術大学院大学修士(工学)master thesi

    Engineering a Data Processing Pipeline for an Ultra-Lightweight Lensless Fluorescence Imaging Device with Neuronal-Cluster Resolution

    Get PDF
    奈良先端科学技術大学院大学修士(工学)master thesi

    Shaping the future of 3D interaction with virtual worlds

    No full text
    video/mp4Virtual reality (VR) spontaneously evokes a set of high-endtechnologies designed to "immerse" itsusers in synthetic 3Denvironments simulated in real time by a computer. Thanks to dedicatedinterfaces such as head-mounted displays, VR applications allow usersto have powerful experiences such as being in a different place orinteracting with characters that are not physically present forreal.The first VR systems date back to the 1950s or 1960s, but a media andeconomic craze hasrecently developed, especially with the buzz around"metaverses" these massively shared virtualworlds often presented asthe "Internet of the future", in which we may one day be able toperform many human activities such as working, training, visiting,meeting, shopping, etc. Such anextraordinary promise has motivatedcolossal investments of the tech giants over the last 10 years.We aretherefore living in a pivotal and historic moment for this field,which is progressively moving towards mass applications. In this talk,we will question the next steps for VR technologies. We willfirstargue that VR is progressively bringing more physical engagement in 3Dhuman-computer interactions, for example through "haptic" technologies(tactile or force feedback) or virtual embodiment in "self-avatars"(anthropomorphic representation of oneself in a virtualenvironment).We will also focus on the current hybridization of VRtechnologies with physiological and neural interfaces, suggestingfuture interactive systems directly exploiting users' cognitivestates, and pavingthe way for even more compelling and holisticexperiences. We will illustrate our talk with some ofour latestscientific results, showing a glimpse of what could be “the future ofour 3D interactions with virtual worlds”.講演日: 2023年4月7日 4限講演場所: 情報科学棟 エーアイ大講義室(L1)vide

    Practical Development of a Robot to Assist Cognitive Reconstruction in Psychiatric Day Care

    Get PDF
    One of the important roles of social robots is to support mental health through conversations with people. In this study, we focused on the column method to support cognitive restructuring, which is also used as one of the programs in psychiatric day care, and to help patients think flexibly and understand their own characteristics. To develop a robot that assists psychiatric day care patients in organizing their thoughts about their worries and goals through conversation, we designed the robot's conversation content based on the column method and implemented its autonomous conversation function. This paper reports on the preliminary experiments conducted to evaluate and improve the effectiveness of this prototype system in an actual psychiatric day care setting, and on the comments from participants in the experiments and day care staff.conference pape

    ユウキ タイヨウ デンチ ノ サラナル コウリツ コウジョウ ト ショウライ テンボウ

    No full text
    video/mp4有機太陽電池は、21世紀に入ってから、効率が着実に向上し20%に達している。本講義では、まず、エネルギー問題について説明し、有機太陽電池の基礎原理と最近の発展について紹介したい。講演日: 2023年12月8日講演場所: Rethink物質創成科学大講義室vide

    A 1 アストロサイト ブンカ ニオケル TRPV4 ノ キノウ カイセキ

    Get PDF
    奈良先端科学技術大学院大学修士(バイオサイエンス)master thesi

    タイショウ オ コウリョ シ タ グチ ノ データセット コウチク オヨビ ジドウ ブンルイ モデル ニヨル ケース スタディ

    Get PDF
    奈良先端科学技術大学院大学修士(工学)master thesi

    Water splitting and CO2 reduction over an AgSr2Ta5O15 photocatalyst developed by a valence band control strategy

    No full text
    Ag+ substitution was applied to a tungsten-bronze-type metal oxide. An AgSr2Ta5O15 photocatalyst has emerged for water splitting and CO2 reduction. DFT calculation and diffuse reflection spectra revealed that the Ag d-orbital formed a new valence band, leading to a narrow band gap (3.91 eV) compared to that of NaSr2Ta5O15 (4.11 eV).journal articl

    Partial Gathering of Mobile Agents in Dynamic Tori

    No full text
    In this paper, we consider the partial gathering problem of mobile agents in synchronous dynamic tori. The partial gathering problem is a generalization of the (well-investigated) total gathering problem, which requires that all k agents distributed in the network terminate at a non-predetermined single node. The partial gathering problem requires, for a given positive integer g (< k), that agents terminate in a configuration such that either at least g agents or no agent exists at each node. So far, in almost cases, the partial gathering problem has been considered in static graphs. As only one exception, it is considered in a kind of dynamic rings called 1-interval connected rings, that is, one of the links in the ring may be missing at each time step. In this paper, we consider partial gathering in another dynamic topology. Concretely, we consider it in n× n dynamic tori such that each of row rings and column rings is represented as a 1-interval connected ring. In such networks, when k = O(gn), focusing on the relationship between the values of k, n, and g, we aim to characterize the solvability of the partial gathering problem and analyze the move complexity of the proposed algorithms when the problem can be solved. First, we show that agents cannot solve the problem when k = o(gn), which means that Ω (gn) agents are necessary to solve the problem. Second, we show that the problem can be solved with the total number of O(gn00B3)moveswhen2gn+2n100B3) moves when 2gn+2n-1 2264 k 22642gn+6n+16g12.Finally,weshowthattheproblemcanbesolvedwiththetotalnumberofO(gn2264 2gn + 6n +16g -12. Finally, we show that the problem can be solved with the total number of O(gn00B2) moves when k 22652gn+6n+16g11.Fromtheseresults,weshowthatouralgorithmscansolvethepartialgatheringproblemindynamictoriwiththeasymptoticallyoptimalnumberΘ(gn)ofagents.Inaddition,weshowthatagentsrequireatotalnumberofΩ(gn2265 2gn + 6n +16g -11. From these results, we show that our algorithms can solve the partial gathering problem in dynamic tori with the asymptotically optimal number Θ (gn) of agents. In addition, we show that agents require a total number of Ω(gn00B2) moves to solve the partial gathering problem in dynamic tori when k = Θ(gn). Thus, when k 22652gn+6n+16g11,ouralgorithmcansolvetheproblemwithasymptoticallyoptimalnumberO(gn2265 2gn+6n+16g -11, our algorithm can solve the problem with asymptotically optimal number O(gn00B2) of agent moves.conference pape

    11,774

    full texts

    13,197

    metadata records
    Updated in last 30 days.
    naistar NAIST Academic Repository
    Access Repository Dashboard
    Do you manage Open Research Online? Become a CORE Member to access insider analytics, issue reports and manage access to outputs from your repository in the CORE Repository Dashboard! 👇