担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）   出版者・発行元：IOS Press  

In this study, we display preliminary results for harnessing fuzziness of yet-another fuzzy rule-bases. They are based on the pragmatic rule-design (PRD), which has been proposed by the authors. The PRD is novel since a pragmatic rule is not an "IF-THEN" rule nor an artificial neural network, and does not represent a stimulus-response relation. A pragmatic rule is a vector of relative characteristics of effective responses in itself. In the original PRD, the fuzziness in discretizing a system state is too surplus. Restricting such fuzziness may improve the performance of the rule-base, therefore a modification of the original PRD is proposed. Some PRD variants based on that modification are developed and evaluated through their applications to elevator operation problems.

DOI： 10.3233/978-1-61499-828-0-54

Scopus

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）   出版者・発行元：IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

In this paper, the authors propose an integer linear programming (ILP) model for static multi-car elevator operation problems. Here, "static" means that all information which make the behavior of the elevator system indeterministic is known before scheduling. The proposed model is based on the trip-based ILP model for static single-car elevator operation problems. A trip of an elevator is a one-directional movement of that elevator, which is labaled upward or downward. In the trip-based ILP model, an elevator trajectory is scheduled according to decision variables which determine allocations of trips to users of an elevator system. That model has such an advantage that the difficulty in solving ILP formulations resulted by that model does not depend on the length of the planning horizon nor the height of the considered building, thus is effective when elevator trajectories are simple. Moreover, that model has many variables relevant to elevators' positions. The proposed model is resulted by adding 3 constraints which are basically based on those variables and make it possible to prevent elevators in a same shaft from interfering. The first constraint simply imposes the first and last floors of an upper trip to be above those of its lower trip. The second constraint imagines the crossing point between upper and lower trips and imposes it ahead of or behind the lower trip according to their directions. The last constraint estimates future positions of elevators and imposes the upper trip to be above floors of passengers on the lower trip. The basic validity of the proposed model is displayed by solving 90 problem instances and examining elevator trajectories generated from them, then comparing objective function values of elevator trajectories on a multi-car elevator system with those on single-car elevator systems.

DOI： 10.1587/transfun.E100.A.385

Web of Science

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：日本語   掲載種別：研究論文（学術雑誌）  

DOI： 10.1541/ieejeiss.136.299

Scopus

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

researchmap

担当区分：筆頭著者,　責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）   出版者・発行元：WILEY-BLACKWELL  

In this paper, we propose an approach for classifying customers in retail stores into given types according to their shopping paths, each of which is a sequence of sections visited by the corresponding customer and is gathered by an RFID tag. The approach vectorizes a sequence of sections; that is, the approach splits such a sequence into tuples of sections, then sums up the occurrence counts of those tuples. This vectorization is based on the hypothesis that a customer's type has a relation to subsequences of sections in his/her shopping path and the conjecture that customers types can be attributed to co-occurrences of such subsequences. After vectorization, the proposed approach applies a general discrimination method to such vectors of equal length. In computational illustrations, principal component regression is selected as a representative of general discrimination methods and is applied to shopping paths collected in an existing retail store so as to predict whether a customer purchases items more than average or not. Computational results demonstrate the effectiveness of the proposed approach, with higher forecast accuracies than existing methods. (C) 2014 Wiley Periodicals, Inc.

DOI： 10.1002/ecj.11588

Web of Science

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）   出版者・発行元：IJNC Editorial Committee  

In this paper, we propose a basic technique to minimize the computational time in executing the infinite-stage dynamic programming (DP) on a GPU. The infinite-stage DP involves computations to probe whether a value function gets sufficiently close to the optimal one. Such computations for probing convergence become obvious when an infinite-stage DP is executed on a GPU, since those computations are not necessary for finite-stage DPs, and hide behind loops for updating state values when a DP is executed on a CPU. The heart of the proposed technique is to suppress those computations for probing by thinning out them. By the proposed technique, differences between state values before and after being updated are periodically transferred to the main memory, then are checked to probe convergence. This intermittent probing makes contrast to ordinary methods in which computations for probing are processed every time. The technique also proposes a formulation to determine optimal periods for probing based on simple statistics given by preliminary experiments. The effectiveness of the proposed technique is examined on two problems; the one is a kind of the animat problem in which an agent moves around in a maze to collect foods, and the other is the mountain-car problem in which a powerless car on a slope struggles to pass over a higher peak. Computational results display that a method with the proposed technique decreases computational times for both problems compared to methods in which computations for probing convergence are processed every time, and the degree of decreasing seems remarkable when the state space is larger.

DOI： 10.15803/ijnc.4.2_321

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

In this paper, we propose a variant of the dynamic programming which is suitable for solving infinite Markov decision processes on GPUs. The primary feature of the proposed method is to not always but intermittently transfer and check values for proving the convergence of the procedure. It is expected for the proposed method to decrease computational times by suppressing surplus transfers and checks of values. This expectation is verified through applications of some dynamic programming programs to a simple animat problem and the mountain-car problem. © 2013 IEEE.

DOI： 10.1109/CANDAR.2013.44

Scopus

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

In this paper, we propose a technique for a trip-based integer programming model for elevator operations to decrease computational times in solving problems for multiple elevators. The technique is inspired by the speculation on ideal trajectories of elevators, where the interval of arriving floors is equal to each elevator. Such trajectories are regarded as oscillating waves. It is expected that limiting movements of elevators to resemble such waves may decrease computational times without degradation on the objective value. This expectation is numerically examined by obtaining optimal trajectories of some problem instances. © 2013 IEEE.

DOI： 10.1109/GCCE.2013.6664807

Scopus

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）  

DOI： 10.1541/ieejeiss.132.2051

Scopus

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

In this paper, we propose an integer programming formalization to optimize elevator operations under such an ideal condition that all information on passengers who arrive during the planning period is known in advance. The basic idea which inspired the formalization is the concept of trip, which represents a uni-directional (upward or downward) movement of an elevator and forms a trajectory of an elevator with other trips. In the formalization, all elevators are alloted to equal number of trips, and a passenger is assigned to one of trips of the same direction to that passenger. The number of necessary trips is unknown without an optimal schedule, whereas an optimal schedule can not be obtained without that number. This complication is straightforwardly solved by the incrementally resolving procedure by which the number of available trips starts with two and is incremented by two until an increment does not yield a more effective schedule. A supposition on the working of that procedure leads to the gradually resolving procedure, which restricts possible trips of passengers within neighborhoods of trips which are optimal under a fewer number of available trips. In computer illustrations, some problems which differ in numbers of elevators, passengers, and traffic patterns are considered. A certain number of embodied problem instances are generated for each problem, and an optimal schedule is obtained for each problem instance. Computational results display that the number of available trips seems to primarily affect computational costs, and a problem with multiple elevators can be easier as expected since such a problem does not require so many trips in usual. Additionally, the effectiveness of the gradually resolving procedure is shown as it yields schedules optimal in most cases within radically shorter computational times. © 2012 IEEE.

DOI： 10.1109/SCIS-ISIS.2012.6505108

Scopus

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

researchmap

記述言語：英語   掲載種別：研究論文（学術雑誌）  

This paper presents the details of a fundamental study of analyzing a customer trajectory by clustering the constituents of the customer trajectory sequence into two types: one, the constituents working as a source of the features of a group of customer trajectory sequences in a given period that we call a time slot and the other, the constituents working as a source of personal features of each of the customers. Removing personal features from a group of customer trajectory sequences provides us new knowledge that is less affected by the difference among sampled data and is expected to be utilized for planning sales strategies that target customers shopping in specific time slots and for evaluating the effectiveness of these strategies. In this paper, we introduce definitions and procedures of the proposed method of clustering the constituents of customer trajectory sequences. © 2010 ICIC International.

Scopus

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）   出版者・発行元：JAPAN SOC MECHANICAL ENGINEERS  

In this paper, an approach to complement legacy rules for the elevator operation is proposed. The approach is derived from the analysis that the elevator operation in the real world often obeys a heuristic rule, and such a rule can be divided into a legacy rule and ad-hoc rules. In the approach, ad-hoc rules are represented as polysemous rules, and a Genetics-Based Machine Learning (GBML) method is applied to acquire such rules. Here, a polysemous rule encodes, not a set of environments' states as the well-known if-then rule does, but a relative attribute vector of an arbitrary elevator. The elevator selection rule based on polysemous rules is simple: if there is a polysemous rule which matches one of attribute vectors of the elevators, select the elevator which corresponds to the matching vector; otherwise select an elevator according to a legacy rule. In computer illustrations, the GBML method is applied to 3 traffic patterns formed by the system's users. It is shown that the resultant polysemous rules seem to complement an existing (legacy) operational rule. Furthermore, polysemous rules, which are selected among those acquired by the GBML method, are successfully applied to harder problems with more elevators than those used in learning.

DOI： 10.1299/jamdsm.4.651

Web of Science

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）   出版者・発行元：公益社団法人 計測自動制御学会  

In this paper, we present a modified dynamic programming (DP) method. The method is basically the same as the value iteration method (VI), a representative DP method, except the preprocess of a system's state transition model for reducing its complexity, and is called the dynamic programming on reduced models (DPRM). That reduction is achieved by imaginarily considering causes of the probabilistic behavior of a system, and then cutting off some causes with low occurring probabilities. In computational illustrations, VI, DPRM, and the real-time Q-learning method (RTQ) are applied to elevator operation problems, which can be modeled by using Markov decision processes. The results show that DPRM can compute quasi-optimal value functions which bring more effective allocations of elevators than value functions by RTQ in less computational times than VI. This characteristic is notable when the traffic pattern is complicated.

DOI： 10.9746/jcmsi.2.213

CiNii Books

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）   出版者・発行元：日本機械学会  

In this paper, an approach using a Genetic-Based Machine Learning (GBML) method to acquire rule sets which complement legacy rules for the elevator operation is shown. A rule set is designed to be comprised of unit-rules, each of which encodes an elevator's augmented attribute vector and matches an arbitrary elevator which has such attributes. The GBML method is built in the Pittsburgh-style and tailored for acquiring such rules sets. In computer illustrations, the effectiveness of acquired rule sets is displayed as for three traffic patterns.

CiNii Books

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）  

DOI： 10.1541/ieejeiss.129.1237

Scopus

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：日本語   掲載種別：研究論文（学術雑誌）   出版者・発行元：The Society of Instrument and Control Engineers  

In the present paper, a dynamic programming (DP) approach for elevator operation problems is reported, in which two kinds of the design of DP algorithms are introduced. One (Value Iteration; VI) is rather naive imple-mentation of DP concept to the problems, and the other (Dynamic Programming on Reduced Models; DPRM) isan improved version in computational efficiency by reducing the accuracy of the utilized state transition model. The basic idea of this reduction is as follows: it is expected that dropping some situational-inputs, which rep-resent the possible causes for each state transition, with low occurring probabilities may reduce the size of the state transition model without losing the essence of a system's behavior.<BR>In computational illustrations, the VI and the DPRM are applied to two types of the problems of small sized, and it is observed that the computational time required in applying the DPRM is much less than that in applying the VI for each problem, while the results obtained by both methods are almost equal with respect to not only averaged but also maximum waiting time over passengers. Furthermore, the optimal and quasi-optimal plicies obtained by the VI and DPRM are compared with an existing elevator allocation rule (Call Dispatching; CD), and the results show both policies are statistically better than the CD.

DOI： 10.9746/ve.sicetr1965.44.174

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：日本語   掲載種別：学位論文（博士）  

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

In this paper, a discrete model of an elevator system and a design of dynamic programming (DP) method based on that model are shown. The method is followed by a modified DP method on approximated state transition models. The discrete model theoretically considers the causes of a system's probabilistic behavior, and leads such approximation by the reduction of the insignificant constituent of them. In computational illustrations, the two DP methods are applied to two problems of small scale. The results show that the policies obtained by DP methods are both statistically better than an existing elevator allocation rule, and the modified method requires less computational time than the another. © 2007 SICE.

DOI： 10.1109/SICE.2007.4421439

Scopus

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：日本語   掲載種別：研究論文（学術雑誌）   出版者・発行元：一般社団法人 電気学会  

In this paper, we show an approach to acquire a rule which is capable of achieving effective elevator services. The allocation of elevators to hall calls is taken as the decision variable and the Pitt approach of a Genetics-Based Machine Learning (GBML) method is designed according to the representation and the characteristics of the problem. We use a rule architecture in which a combination of some measures is directly encoded as a unit-rule and an elevator allocation procedure is represented as a rule set composed of some unit-rules. Five measures are developed based on the results of the preliminary experiment and it is shown that the rule as the weighted summation of the measures (called WS) is more effective than a conventional elevator allocation rule. In computational experiments, the up-peak, down-peak and two-way traffic patterns are considered and three rule sets are acquired by applying the GBML method. Based on the results, we can confirm that the GBML method can acquire some unit-rules appropriate for the targeting traffic patterns, and we can mention that, for some presumed traffic patterns, the possibility of constructing an effective rule set by combining some specific rule sets.

DOI： 10.1541/ieejeiss.126.761

CiNii Books

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：日本語   掲載種別：研究論文（大学，研究機関等紀要）   出版者・発行元：神戸大学  

CiNii Books

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：日本語   掲載種別：研究論文（学術雑誌）  

DOI： 10.1541/ieejeiss.123.1334

Scopus

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

researchmap

担当区分：筆頭著者,　最終著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）  

researchmap

開催年月日： 2021年9月

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

開催年月日： 2021年9月

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

開催年月日： 2021年5月

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

開催年月日： 2021年5月

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

開催年月日： 2020年11月

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

開催年月日： 2020年11月

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

開催年月日： 2020年9月

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

開催年月日： 2017年5月

記述言語：日本語  

researchmap

開催年月日： 2014年7月

記述言語：日本語  

researchmap

開催年月日： 2013年7月

記述言語：日本語  

researchmap

開催年月日： 2006年

本研究では，強化学習の適用によるエレベータ運行計画問題の解決を目指し，状態空間の設計を考慮した強化学習法をかご運行順序計画問題へ適用する． 利用者へのかごの割当てと，かごの階床移動順序の2種類の事項を決定変数として強化学習を適用した場合，有効な結果はもちろん解析的な結果も得ることは困難である． そこでまずはかごの階床移動順序のみを決定変数とし，状態空間の設計についての示唆を与え得る強化学習法を適用する．

researchmap

開催年月日： 2005年

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

開催年月日： 2001年9月

記述言語：日本語  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：秋田  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：京都  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：英語   会議種別：ポスター発表  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：ポスター発表  

researchmap

記述言語：日本語   会議種別：ポスター発表  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：兵庫 (中止)  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：大阪  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：滋賀  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：京都  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：大阪  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：兵庫  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：東京  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：茨城  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：北海道  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：兵庫  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：京都  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：北海道  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

本稿は，インターネット上の必ずしも信頼できない計算機を用いて行う分散処理のための処理多重化において，意図的に不正を行う計算機の共謀が処理結果へ与える影響の数値的調査を目的とする． ここで，処理多重化とは，ある同一の処理内容を複数の計算機に分配し，その結果を集約することで計算結果の信頼性向上を企図する手法である． 処理多重化により，少数派であることとして，不正な処理結果を正しい処理結果と区別することが可能となる． しかしこの際，不正な処理結果を返す計算機が共謀すると，不正な結果が多数派となり，処理結果の正・不正を誤って判定してしまう恐れがある． 本稿では，このような誤りの生じる確率を，いくつかのパラメータ設定のもと数値的に算出・調査する．

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：大阪  

本稿では，筆者らが提案しているルール設計によりエレベータ運行のための有効なルールベースを機械的に獲得できたことの原因の分析を目指して，既知のルール設計の性質を分類・整理して九つのルール設計を示し，その中に提案しているルール設計および既存の典型的ルール設計を位置づける． また，いくつかのルール設計による2進10進変換規則の符号化例を通して，多義性や多数決制度をもたせることで組み合わせ的規則を小さなルールベースとして表現しうる可能性を示唆する．

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

本稿では，エレベータ運行計画問題を対象として筆者がとっている，最適性を目指すアプローチと実用性を目指すアプローチによる研究の成果をそれぞれ紹介する．前者として，確率的離散事象システムのモデリング手法を紹介する．これを用いることで，エレベータシステムの状態遷移確率の定式化が可能となり，動的計画法を適用することで小規模問題のための最適なエレベータ割り当てルールを求めうることを示す．続いて，後者として，if-thenルール設計と特徴量の加重和最小化ルール設計の中間に位置付けられるルール設計を紹介する．これを用いることで，大規模システムに対して有効なルールベースを遺伝的機械学習により獲得しうることを示す．

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：京都  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：京都  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：大阪  

researchmap

記述言語：英語   会議種別：口頭発表（一般）  

開催地：京都  

researchmap

記述言語：日本語   会議種別：口頭発表（一般）  

開催地：青森  

researchmap