首页 > 最新文献

Transactions of The Japanese Society for Artificial Intelligence最新文献

英文 中文
Emergent Communication in Agents Generating Messages Using Different Pretrained Deep Generative Models 使用不同预训练深度生成模型生成信息的代理中的新兴通信
Pub Date : 2024-03-01 DOI: 10.1527/tjsai.39-2_d-n71
Shota Imai, Yusuke Iwasawa, Masahiro Suzuki, Yutaka Matsuo
{"title":"Emergent Communication in Agents Generating Messages Using Different Pretrained Deep Generative Models","authors":"Shota Imai, Yusuke Iwasawa, Masahiro Suzuki, Yutaka Matsuo","doi":"10.1527/tjsai.39-2_d-n71","DOIUrl":"https://doi.org/10.1527/tjsai.39-2_d-n71","url":null,"abstract":"","PeriodicalId":23256,"journal":{"name":"Transactions of The Japanese Society for Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140086566","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Composer Classification Using Maximum Probability Partitioning Based on Compression Principles 基于压缩原理的最大概率分区法进行作曲家分类
Pub Date : 2024-03-01 DOI: 10.1527/tjsai.39-2_f-na1
Ayaka Takamoto, Shiori Hironaka, Kyoji Umemura
{"title":"Composer Classification Using Maximum Probability Partitioning Based on Compression Principles","authors":"Ayaka Takamoto, Shiori Hironaka, Kyoji Umemura","doi":"10.1527/tjsai.39-2_f-na1","DOIUrl":"https://doi.org/10.1527/tjsai.39-2_f-na1","url":null,"abstract":"","PeriodicalId":23256,"journal":{"name":"Transactions of The Japanese Society for Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140091483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
交通理論に基づいた深層学習による渋滞長予測 基于交通理论的交通拥堵长度预测深度学习。
Pub Date : 2024-03-01 DOI: 10.1527/tjsai.39-2_c-n92
Ryu Shirakami, Toshiya Kitahara, Koh Takeuchi, Hisashi Kashima
{"title":"交通理論に基づいた深層学習による渋滞長予測","authors":"Ryu Shirakami, Toshiya Kitahara, Koh Takeuchi, Hisashi Kashima","doi":"10.1527/tjsai.39-2_c-n92","DOIUrl":"https://doi.org/10.1527/tjsai.39-2_c-n92","url":null,"abstract":"","PeriodicalId":23256,"journal":{"name":"Transactions of The Japanese Society for Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140086000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
垂直搬送機のスケジューリング問題に対するMaxSAT の適用 将 MaxSAT 应用于垂直输送机的调度问题。
Pub Date : 2024-03-01 DOI: 10.1527/tjsai.39-2_b-n64
Kazuya Okamoto, Yuki Koide, M. Koshimura, Itsuki Noda
{"title":"垂直搬送機のスケジューリング問題に対するMaxSAT の適用","authors":"Kazuya Okamoto, Yuki Koide, M. Koshimura, Itsuki Noda","doi":"10.1527/tjsai.39-2_b-n64","DOIUrl":"https://doi.org/10.1527/tjsai.39-2_b-n64","url":null,"abstract":"","PeriodicalId":23256,"journal":{"name":"Transactions of The Japanese Society for Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140084308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
表現空間における分類複雑性の評価に基づく継続学習分析手法の提案 基于表征空间分类复杂性评估的持续学习分析方法。
Pub Date : 2024-03-01 DOI: 10.1527/tjsai.39-2_a-n41
Kengo Murata, Seiya Ito, Kouzou Ohara
{"title":"表現空間における分類複雑性の評価に基づく継続学習分析手法の提案","authors":"Kengo Murata, Seiya Ito, Kouzou Ohara","doi":"10.1527/tjsai.39-2_a-n41","DOIUrl":"https://doi.org/10.1527/tjsai.39-2_a-n41","url":null,"abstract":"","PeriodicalId":23256,"journal":{"name":"Transactions of The Japanese Society for Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140086726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
マンガ書籍中の不適切な画像検出システム 检测漫画书中不当图像的系统。
Pub Date : 2024-01-01 DOI: 10.1527/tjsai.39-1_a-n76
S. Murakami, Tomoharu Nagao
{"title":"マンガ書籍中の不適切な画像検出システム","authors":"S. Murakami, Tomoharu Nagao","doi":"10.1527/tjsai.39-1_a-n76","DOIUrl":"https://doi.org/10.1527/tjsai.39-1_a-n76","url":null,"abstract":"","PeriodicalId":23256,"journal":{"name":"Transactions of The Japanese Society for Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139126856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
事前交渉により交渉順序を調整する自動交渉プロトコル 自动协商协议,通过预协商调整协商顺序。
Pub Date : 2024-01-01 DOI: 10.1527/tjsai.39-1_b-m24
S. Okuhara, Takayuki Ito
{"title":"事前交渉により交渉順序を調整する自動交渉プロトコル","authors":"S. Okuhara, Takayuki Ito","doi":"10.1527/tjsai.39-1_b-m24","DOIUrl":"https://doi.org/10.1527/tjsai.39-1_b-m24","url":null,"abstract":"","PeriodicalId":23256,"journal":{"name":"Transactions of The Japanese Society for Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139125733","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Summarization Method of Argumentation Based on Argumentation Framework 基于论证框架的论证总结方法
Pub Date : 2024-01-01 DOI: 10.1527/tjsai.39-1_c-n12
Kei Nishina, Katsumi Nitta
{"title":"Summarization Method of Argumentation Based on Argumentation Framework","authors":"Kei Nishina, Katsumi Nitta","doi":"10.1527/tjsai.39-1_c-n12","DOIUrl":"https://doi.org/10.1527/tjsai.39-1_c-n12","url":null,"abstract":"","PeriodicalId":23256,"journal":{"name":"Transactions of The Japanese Society for Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139129408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Erratum: Value 行列を手掛かりとしたTransformerの分析 [人工知能学会論文誌38巻2号C-MB7_1-7] 勘误:以值矩阵为线索分析变压器[《人工智能学报》,第 38 卷第 2 期,C-MB7_1-7]。
Pub Date : 2024-01-01 DOI: 10.1527/tjsai.39-1_err-mb7
Minoru Yoshida, Kazuyuki Matsumoto, Kenji Kita
{"title":"Erratum: Value 行列を手掛かりとしたTransformerの分析 [人工知能学会論文誌38巻2号C-MB7_1-7]","authors":"Minoru Yoshida, Kazuyuki Matsumoto, Kenji Kita","doi":"10.1527/tjsai.39-1_err-mb7","DOIUrl":"https://doi.org/10.1527/tjsai.39-1_err-mb7","url":null,"abstract":"","PeriodicalId":23256,"journal":{"name":"Transactions of The Japanese Society for Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139126542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
U12 Basketball League Scheduling Problem Based on Minimizing the Total Traveling Distance and the Number of Breaks 基于总行程和休息次数最小化的U12篮球联赛调度问题
Pub Date : 2023-11-01 DOI: 10.1527/tjsai.38-6_a-n31
Tenda Okimoto, Katsutoshi Hirayama
Sports scheduling is one of the widely investigated application problems in artificial intelligence and operations research. This problem can be represented as a combinatorial optimization problem, in which the date and the venue of each game must be determined, subject to a given set of constraints. In 2018, Japan Basketball Association (JBA) has started to implement the league games in the prefectures, and regarding U12 (under 12 years old), league games are currently being held in most prefectures. In this paper, the main focus is laid on the U12 Basketball League Scheduling Problem. First, a formal framework for the U12 Basketball League Scheduling based on minimizing the total traveling distance (U12-BLSdist) is defined. A novel solution criterion called an egalitarian solution for U12-BLSdist is also provided. Next, a formal framework for the U12 Basketball league scheduling problem based on minimizing the number of breaks (U12-BLSbreak) is defined. Furthermore, the frameworks U12-BLSdist and U12-BLSbreak are formalized as 0-1 integer programming problems. In the experiments, we use the real data of U12 basketball league games played in Hyogo prefecture in 2018 and solve the U12-BLSdist and U12-BLSbreak problems. An optimal league scheduling and an egalitarian league scheduling for the U12-BLSdist, and the minimal number of breaks for the U12-BLSbreak are reported by comparing with the league scheduling actually used in 2018.
体育调度是人工智能和运筹学中研究较多的应用问题之一。这个问题可以表示为一个组合优化问题,在这个问题中,每一场比赛的日期和地点必须在给定的一组约束条件下确定。2018年,日本篮球协会(JBA)开始在郡县实施联赛,U12(12岁以下)联赛目前在大多数郡县举行。本文主要研究U12篮球联赛调度问题。首先,定义了基于总行程最小的U12篮球联赛调度的形式化框架(U12- blsdist)。给出了U12-BLSdist的一种新的解准则,称为平均解。其次,定义了基于最小休息次数的U12篮球联赛调度问题的形式化框架(U12- blsbreak)。并将框架U12-BLSdist和U12-BLSbreak形式化为0-1整数规划问题。在实验中,我们使用了2018年兵库县U12篮球联赛的真实数据,解决了U12- blsdist和U12- blsbreak问题。通过与2018年实际使用的联赛调度进行比较,得出了U12-BLSdist的最优联赛调度和平等化的联赛调度,以及U12-BLSdist的最小休息次数。
{"title":"U12 Basketball League Scheduling Problem Based on Minimizing the Total Traveling Distance and the Number of Breaks","authors":"Tenda Okimoto, Katsutoshi Hirayama","doi":"10.1527/tjsai.38-6_a-n31","DOIUrl":"https://doi.org/10.1527/tjsai.38-6_a-n31","url":null,"abstract":"Sports scheduling is one of the widely investigated application problems in artificial intelligence and operations research. This problem can be represented as a combinatorial optimization problem, in which the date and the venue of each game must be determined, subject to a given set of constraints. In 2018, Japan Basketball Association (JBA) has started to implement the league games in the prefectures, and regarding U12 (under 12 years old), league games are currently being held in most prefectures. In this paper, the main focus is laid on the U12 Basketball League Scheduling Problem. First, a formal framework for the U12 Basketball League Scheduling based on minimizing the total traveling distance (U12-BLSdist) is defined. A novel solution criterion called an egalitarian solution for U12-BLSdist is also provided. Next, a formal framework for the U12 Basketball league scheduling problem based on minimizing the number of breaks (U12-BLSbreak) is defined. Furthermore, the frameworks U12-BLSdist and U12-BLSbreak are formalized as 0-1 integer programming problems. In the experiments, we use the real data of U12 basketball league games played in Hyogo prefecture in 2018 and solve the U12-BLSdist and U12-BLSbreak problems. An optimal league scheduling and an egalitarian league scheduling for the U12-BLSdist, and the minimal number of breaks for the U12-BLSbreak are reported by comparing with the league scheduling actually used in 2018.","PeriodicalId":23256,"journal":{"name":"Transactions of The Japanese Society for Artificial Intelligence","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135161384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Transactions of The Japanese Society for Artificial Intelligence
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1