Pub Date : 2021-07-01DOI: 10.1109/iiai-aai53430.2021.00145
Saruda Sunthornpan, Sadayo Hirata
The Coronavirus disease 2019 (COVID-19) has intensified. It not only affects the health and well-being of people worldwide; it also affects almost all sectors of the global and Thai economies. Especially affected have been the restaurant businesses sector. The major victims of the crisis are micro, small, and medium-sized enterprises (MSMEs). We would like to understand which MSMEs in the restaurant business have been affected by COVID-19 in Bangkok, Thailand. We collected data by enumeration over the telephone; the sample size was 100 respondents in the restaurant business. Business data were analyzed using descriptive statistics. Our results showed that most participating businesses have been severely affected and faced many problems during the crisis. Over 70% of participating businesses increase sales via delivery platforms, according to consumer behavior and business take other measures to survive. Nearly half of restaurant businesses expected business to return to normal more than nine months after the crisis because the business has difficulty recovering after a long impact, and many factors are involved.
{"title":"Impact of COVID-19 pandemic on micro, small and medium restaurant businesses in Thailand","authors":"Saruda Sunthornpan, Sadayo Hirata","doi":"10.1109/iiai-aai53430.2021.00145","DOIUrl":"https://doi.org/10.1109/iiai-aai53430.2021.00145","url":null,"abstract":"The Coronavirus disease 2019 (COVID-19) has intensified. It not only affects the health and well-being of people worldwide; it also affects almost all sectors of the global and Thai economies. Especially affected have been the restaurant businesses sector. The major victims of the crisis are micro, small, and medium-sized enterprises (MSMEs). We would like to understand which MSMEs in the restaurant business have been affected by COVID-19 in Bangkok, Thailand. We collected data by enumeration over the telephone; the sample size was 100 respondents in the restaurant business. Business data were analyzed using descriptive statistics. Our results showed that most participating businesses have been severely affected and faced many problems during the crisis. Over 70% of participating businesses increase sales via delivery platforms, according to consumer behavior and business take other measures to survive. Nearly half of restaurant businesses expected business to return to normal more than nine months after the crisis because the business has difficulty recovering after a long impact, and many factors are involved.","PeriodicalId":414070,"journal":{"name":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132369541","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}
The research community needs to respect its members' diversity and discuss how to respond to society's mandate and engage in dialogue with society. To obtain data for discussion and dialogue, we asked members of the Japan Geoscience Union how they perceive the ideals and status of research with a questionnaire. We obtained 292 valid responses shortly before the JpGU-AGU Joint Meeting 2020. Our results showed that the members did not think that the research activities “giving back to society” contributed to the “creation of knowledge” compared to the research activities based on intellectual curiosity. A similar amount of positive, negative, and neutral responses was obtained for the current situation in which the number of citations and journal impact factors are used without any discussion of the ideals of researchers.
{"title":"Scientists prefer research answering humanity's intellectual curiosity: questionnaire results from Members of the Japan Geoscience Union","authors":"Yasuhiro Yamanaka, Michiyo Shimamura, Kiyoshi Suyehiro, Brooks Hanson","doi":"10.1109/iiai-aai53430.2021.00042","DOIUrl":"https://doi.org/10.1109/iiai-aai53430.2021.00042","url":null,"abstract":"The research community needs to respect its members' diversity and discuss how to respond to society's mandate and engage in dialogue with society. To obtain data for discussion and dialogue, we asked members of the Japan Geoscience Union how they perceive the ideals and status of research with a questionnaire. We obtained 292 valid responses shortly before the JpGU-AGU Joint Meeting 2020. Our results showed that the members did not think that the research activities “giving back to society” contributed to the “creation of knowledge” compared to the research activities based on intellectual curiosity. A similar amount of positive, negative, and neutral responses was obtained for the current situation in which the number of citations and journal impact factors are used without any discussion of the ideals of researchers.","PeriodicalId":414070,"journal":{"name":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132408665","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}
Pub Date : 2021-07-01DOI: 10.1109/iiai-aai53430.2021.00106
António Oliveira Nzinga René, K. Okuhara, E. Domoto, Ryo Haruna
This study focuses on a type of perceptual-motor learning called tracing motion, a form of learning to trace a figure's contour and create a tracing motion experiment. First, the Kalman filter is applied to calculate the confidence level of the internal model. To achieve optimal motion, one can control the impedance, which is possible by setting appropriate parameters.
{"title":"Impedance Knowledge and Reliability of Internal Model in Motor Learning","authors":"António Oliveira Nzinga René, K. Okuhara, E. Domoto, Ryo Haruna","doi":"10.1109/iiai-aai53430.2021.00106","DOIUrl":"https://doi.org/10.1109/iiai-aai53430.2021.00106","url":null,"abstract":"This study focuses on a type of perceptual-motor learning called tracing motion, a form of learning to trace a figure's contour and create a tracing motion experiment. First, the Kalman filter is applied to calculate the confidence level of the internal model. To achieve optimal motion, one can control the impedance, which is possible by setting appropriate parameters.","PeriodicalId":414070,"journal":{"name":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133275469","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}
Pub Date : 2021-07-01DOI: 10.1109/iiai-aai53430.2021.00115
Emanuel Hofer, S. G. Grivas, Claudio Giovanoli
Increased consciousness of cloud computing capabilities leads to greater adoption of the cloud. For many businesses, cloud computing represents an attractive cost-saving option for the establishment and maintenance of IT resources. Decision-makers are often confronted with multi-criteria decision issues regarding cloud service and deployment model selection and do not have the required technological and business-related background. This work aimed at developing a conversational decisions advisor in the form of the Cloud Advisor Bot to support complex assessment of cloud needs. The literature review revealed a gap in this domain as there is no pre-existing research in the area of chatbots that support the cloud assessment process. Based on the literature reviews as well as further research, it was investigated which elements needed to be developed in order to implement a prototype of the Cloud Advisor Bot. To achieve this, design science research was applied to iteratively develop the solution. The evaluation has shown that the prototype of the Cloud Advisor Bot can be successfully used in order to conduct an assessment regarding a possible cloud deployment scenario. The paper also proposes further developments in order to improve the solution and make it viable for the future
{"title":"Cloud Advisor Bot: Towards a Chatbot to Enable Efficient Cloud Assessments","authors":"Emanuel Hofer, S. G. Grivas, Claudio Giovanoli","doi":"10.1109/iiai-aai53430.2021.00115","DOIUrl":"https://doi.org/10.1109/iiai-aai53430.2021.00115","url":null,"abstract":"Increased consciousness of cloud computing capabilities leads to greater adoption of the cloud. For many businesses, cloud computing represents an attractive cost-saving option for the establishment and maintenance of IT resources. Decision-makers are often confronted with multi-criteria decision issues regarding cloud service and deployment model selection and do not have the required technological and business-related background. This work aimed at developing a conversational decisions advisor in the form of the Cloud Advisor Bot to support complex assessment of cloud needs. The literature review revealed a gap in this domain as there is no pre-existing research in the area of chatbots that support the cloud assessment process. Based on the literature reviews as well as further research, it was investigated which elements needed to be developed in order to implement a prototype of the Cloud Advisor Bot. To achieve this, design science research was applied to iteratively develop the solution. The evaluation has shown that the prototype of the Cloud Advisor Bot can be successfully used in order to conduct an assessment regarding a possible cloud deployment scenario. The paper also proposes further developments in order to improve the solution and make it viable for the future","PeriodicalId":414070,"journal":{"name":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"238 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114435491","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}
Pub Date : 2021-07-01DOI: 10.1109/iiai-aai53430.2021.00004
Manami Hagihara, Takuya Yoshino, K. Hirata
In this paper, we introduce a leaf-preserving distance between rooted labeled trees (trees, for short) as a distance that a leaf in a tree is corresponding to a leaf in another tree. Then, we show that the leaf-preserving distance is always smaller than or equal to the bottom-up distance and incomparable with the alignment distance, the isolated-subtree distance and the segmental distance, but the problem of computing the leaf-preserving distance between trees is MAX SNP-hard. On the other hand, for a rooted labeled caterpillar (caterpillar, for short) that is a tree transformed to a rooted path after removing all the leaves in it, we design an algorithm to compute the leaf-preserving distance between caterpillars in O(h2λ) time, where h is the maximum height and λ is the maximum number of leaves for given two caterpillars. Finally, we give experimental results for computing the leaf-preserving distance for caterpillars.
{"title":"Leaf-Preserving Distance between Rooted Labeled Caterpillars","authors":"Manami Hagihara, Takuya Yoshino, K. Hirata","doi":"10.1109/iiai-aai53430.2021.00004","DOIUrl":"https://doi.org/10.1109/iiai-aai53430.2021.00004","url":null,"abstract":"In this paper, we introduce a leaf-preserving distance between rooted labeled trees (trees, for short) as a distance that a leaf in a tree is corresponding to a leaf in another tree. Then, we show that the leaf-preserving distance is always smaller than or equal to the bottom-up distance and incomparable with the alignment distance, the isolated-subtree distance and the segmental distance, but the problem of computing the leaf-preserving distance between trees is MAX SNP-hard. On the other hand, for a rooted labeled caterpillar (caterpillar, for short) that is a tree transformed to a rooted path after removing all the leaves in it, we design an algorithm to compute the leaf-preserving distance between caterpillars in O(h2λ) time, where h is the maximum height and λ is the maximum number of leaves for given two caterpillars. Finally, we give experimental results for computing the leaf-preserving distance for caterpillars.","PeriodicalId":414070,"journal":{"name":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128268874","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}
Pub Date : 2021-07-01DOI: 10.1109/iiai-aai53430.2021.00084
Jun Rokui
In this research, I propose a method for predicting future time series using multivariate historical time series. Historical time series refers to information that varies with time, such as stock prices and economic indicators, and is distinguished from physical time series like voice. Historical time series differs from physical time series of origin in that multiple factors are structured as a spider thread-like interactions. It is not possible to link the causal relationship between these factors, and this is a major aspect that makes historical time series prediction difficult. In this research, a framework for statistically solving historical time series prediction was devised using a deep learning method and its usefulness was confirmed experimentally.
{"title":"Historical time series prediction framework based on recurrent neural network using multivariate time series","authors":"Jun Rokui","doi":"10.1109/iiai-aai53430.2021.00084","DOIUrl":"https://doi.org/10.1109/iiai-aai53430.2021.00084","url":null,"abstract":"In this research, I propose a method for predicting future time series using multivariate historical time series. Historical time series refers to information that varies with time, such as stock prices and economic indicators, and is distinguished from physical time series like voice. Historical time series differs from physical time series of origin in that multiple factors are structured as a spider thread-like interactions. It is not possible to link the causal relationship between these factors, and this is a major aspect that makes historical time series prediction difficult. In this research, a framework for statistically solving historical time series prediction was devised using a deep learning method and its usefulness was confirmed experimentally.","PeriodicalId":414070,"journal":{"name":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133335156","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}
Pub Date : 2021-07-01DOI: 10.1109/iiai-aai53430.2021.00092
Tomoki Kawazoe, Naoki Fukuta
In this paper, we propose a method for mitigating the distributed reflective denial-of-service (DRDoS) attacks using cooperative multi-agent learning. We consider how to apply the specific packet filtering mechanisms and locate the mitigating mechanisms. Finally, we present the experiment environment to confirm how the mechanism worked effectively. We conduct a simulation-based analysis of packet flows on DRDoS attacks.
{"title":"A Cooperative Multi-Agent Learning Approach for Avoiding DRDoS Attack","authors":"Tomoki Kawazoe, Naoki Fukuta","doi":"10.1109/iiai-aai53430.2021.00092","DOIUrl":"https://doi.org/10.1109/iiai-aai53430.2021.00092","url":null,"abstract":"In this paper, we propose a method for mitigating the distributed reflective denial-of-service (DRDoS) attacks using cooperative multi-agent learning. We consider how to apply the specific packet filtering mechanisms and locate the mitigating mechanisms. Finally, we present the experiment environment to confirm how the mechanism worked effectively. We conduct a simulation-based analysis of packet flows on DRDoS attacks.","PeriodicalId":414070,"journal":{"name":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116634569","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}
Pub Date : 2021-07-01DOI: 10.1109/iiai-aai53430.2021.00019
Tetsuya Nakatoh, Riho Higuchi, Asuka Yamashita, Madoka Fujiki
We examined a method for registered dietitians to obtain information on food trends from the Internet. The history of search keywords on an Internet cooking recipe site was used as an information source. For annual events related to dietary education, we extracted information on changes in food trends based on differences in the frequency of use of search keywords. Our results demonstrated that useful information can be extracted for certain events.
{"title":"Identifying food trends using the Internet","authors":"Tetsuya Nakatoh, Riho Higuchi, Asuka Yamashita, Madoka Fujiki","doi":"10.1109/iiai-aai53430.2021.00019","DOIUrl":"https://doi.org/10.1109/iiai-aai53430.2021.00019","url":null,"abstract":"We examined a method for registered dietitians to obtain information on food trends from the Internet. The history of search keywords on an Internet cooking recipe site was used as an information source. For annual events related to dietary education, we extracted information on changes in food trends based on differences in the frequency of use of search keywords. Our results demonstrated that useful information can be extracted for certain events.","PeriodicalId":414070,"journal":{"name":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122029324","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}
Pub Date : 2021-07-01DOI: 10.1109/iiai-aai53430.2021.00114
Hikaru Nagatoshi, S. Shirasaka, S. Haruyama
Previous studies pointed out that it is difficult to achieve two objectives simultaneously. In this study, we address this problem from a design perspective. We can categorize a system as either a “designed” system or an “undesigned” system. We address the pattern of integrating a Designed Monolithic System (DMS) with an Undesigned Monolithic System (UMS) to design a monolithic system that achieves two objectives simultaneously: a combination of “Designed and Undesigned”. The objective realizing by DMS is “original objective”, which is the planned objective, and the objective realizing by UMS is “unplanned objective”. The purpose of this study is to propose a framework to derive objective that should be described as the top goal within Goal Structuring Notation (GSN), which will be design methods and assurance methods, in order to simultaneously achieve the original objective and objective that were not planned at the time of design.
{"title":"A Method to Derive the Top Goal of GSN that Describes the Design Process Achieving Two Objectives Simultaneously","authors":"Hikaru Nagatoshi, S. Shirasaka, S. Haruyama","doi":"10.1109/iiai-aai53430.2021.00114","DOIUrl":"https://doi.org/10.1109/iiai-aai53430.2021.00114","url":null,"abstract":"Previous studies pointed out that it is difficult to achieve two objectives simultaneously. In this study, we address this problem from a design perspective. We can categorize a system as either a “designed” system or an “undesigned” system. We address the pattern of integrating a Designed Monolithic System (DMS) with an Undesigned Monolithic System (UMS) to design a monolithic system that achieves two objectives simultaneously: a combination of “Designed and Undesigned”. The objective realizing by DMS is “original objective”, which is the planned objective, and the objective realizing by UMS is “unplanned objective”. The purpose of this study is to propose a framework to derive objective that should be described as the top goal within Goal Structuring Notation (GSN), which will be design methods and assurance methods, in order to simultaneously achieve the original objective and objective that were not planned at the time of design.","PeriodicalId":414070,"journal":{"name":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126087749","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}
Pub Date : 2021-07-01DOI: 10.1109/iiai-aai53430.2021.00006
Kan Yonashiro, K. Hirata
A trim distance between two positions in the set of nucleotide sequences is a tree-based distance between the trimmed phylogenetic trees at two positions, each of which is obtained by applying the label-based closest-neighbor trimming method to the relabeled phylogenetic tree at the position that the index as a label of leaves is relabeled to the nucleotide occurring at the position. In this paper, as a tree-based distance, we adopt a label histogram distance and a depth histogram distance. Then, we introduce new trim distances that a label trim distance and a depth trim distance, respectively. Finally, by using the nucleotide sequences and the reconstructed phylogenetic tree from them provided from NCBI, we investigate the trim distances between the positions in the nucleotide sequences for structural proteins of spike, envelope, membrane and nucleocapsid proteins of SARS-CoV-2.
{"title":"Trim Distance between Positions in Nucleotide Sequences for Structural Proteins of SARS-CoV-2","authors":"Kan Yonashiro, K. Hirata","doi":"10.1109/iiai-aai53430.2021.00006","DOIUrl":"https://doi.org/10.1109/iiai-aai53430.2021.00006","url":null,"abstract":"A trim distance between two positions in the set of nucleotide sequences is a tree-based distance between the trimmed phylogenetic trees at two positions, each of which is obtained by applying the label-based closest-neighbor trimming method to the relabeled phylogenetic tree at the position that the index as a label of leaves is relabeled to the nucleotide occurring at the position. In this paper, as a tree-based distance, we adopt a label histogram distance and a depth histogram distance. Then, we introduce new trim distances that a label trim distance and a depth trim distance, respectively. Finally, by using the nucleotide sequences and the reconstructed phylogenetic tree from them provided from NCBI, we investigate the trim distances between the positions in the nucleotide sequences for structural proteins of spike, envelope, membrane and nucleocapsid proteins of SARS-CoV-2.","PeriodicalId":414070,"journal":{"name":"2021 10th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123626886","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：