Tomoaki Takemura, Kazuhiko Iwase, Jie Zhang, Shoko Abe, T. Ohkubo, Hisashi Hayashi
{"title":"A Public Transportation Reservation System for Congestion Relief with E-tickets","authors":"Tomoaki Takemura, Kazuhiko Iwase, Jie Zhang, Shoko Abe, T. Ohkubo, Hisashi Hayashi","doi":"10.1109/IIAIAAI55812.2022.00085","DOIUrl":"https://doi.org/10.1109/IIAIAAI55812.2022.00085","url":null,"abstract":"Existing public transportation reservation systems operate on a first-come-first-served basis, and do not consider mobility priorities. During the COVID-19 pandemic, overcrowding in transportation facilities must be mitigated. However, a limited number of high-priority users such as healthcare workers should be able to commute safely. Moreover, high-priority transportation is also required even for regular passengers in some cases when they really need to move for important reasons. In this study, we propose a new e-ticket reservation system that performs maximum weight matching based on the user priority category, desired time, and virtual-point bidding. Matching is performed separately for each line at each station to reduce computational complexity. This virtual point system allows users to prioritize their travel schedules and easily book necessary transportation. To guarantee fairness, only a limited number of virtual points are distributed to each user, and additional purchases are not allowed. Our system aims to maximize the number of tickets distributed to high-priority users and travelers who spent virtual points while reducing the degree of congestion.","PeriodicalId":156230,"journal":{"name":"2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133652915","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}
Reiko Yamagishi, T. Katayama, N. Kawaguchi, Tomohiro Shigemoto
{"title":"HOUND: Log Analysis Support for Threat Hunting by Log Visualization","authors":"Reiko Yamagishi, T. Katayama, N. Kawaguchi, Tomohiro Shigemoto","doi":"10.1109/IIAIAAI55812.2022.00130","DOIUrl":"https://doi.org/10.1109/IIAIAAI55812.2022.00130","url":null,"abstract":"Threat hunting is a methodology to discover threats that have already penetrated organizations without relying on existing security devices. Threat hunting has been attracting attention because the traditional cyberattack process cannot catch advanced threats. In threat hunting, an operator analyzes multiple types of logs and collects traces of attacks in terms of tactics, techniques, and procedures (TTP). While existing log visualization technology can understand the log overview and discover suspicious points, it does not upport detailed analysis in a tabular format. Therefore, analysts must read each log entry carefully during a detailed analysis. In this paper, we propose a detailed analysis support system for threat hunting using three key ideas: (i) making TTP icons to help translate events, (ii) similarity value visualization, and (iii) relevance visualization between log entries to help an operator decide which entries should be analyzed next. We propose a \" Hunting Operation Utilities for Need Decision \" (HOUND) system that implements the three key ideas.","PeriodicalId":156230,"journal":{"name":"2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129413203","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}
{"title":"Data Augmentation for Question Answering Using Transformer-based VAE with Negative Sampling","authors":"Wataru Kano, Koichi Takeuchi","doi":"10.1109/IIAIAAI55812.2022.00097","DOIUrl":"https://doi.org/10.1109/IIAIAAI55812.2022.00097","url":null,"abstract":"In this paper, we propose a method to improve the accuracy of extracting appropriate question-answer pairs using generated questions with negative sampling. The base question-answering system that extracts similar questions for input queries is constructed on a Sentence-BERT model to carry out pairwised-ranking between questions of question-answer data and the input queries. The key issue of improving the question answering system is how we can prepare the enough size and variety of training examples. The Sentence-BERT model is trained on positive and negative pairs of extended questions generated by a Transformer-based Variational Autoencoder as well as human. Experimental results show that performance of retrieving appropriate questions for input queries is improved when the Sentence-BERT model is trained with the negative samples that are most similar to the positive examples.","PeriodicalId":156230,"journal":{"name":"2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132300036","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}
{"title":"Statistical Learning Models for Japanese Essay Scoring Toward One-shot Learning","authors":"Chihiro Ejima, Koichi Takeuchi","doi":"10.1109/IIAIAAI55812.2022.00070","DOIUrl":"https://doi.org/10.1109/IIAIAAI55812.2022.00070","url":null,"abstract":"A lot of studies of automatic essay scoring are conducted using machine learning models. The previous studies show high performance for scoring large scale essays with machine learning models, however, more than hundreds of scored answers are required to train the neural network models. In this paper we discuss the possibility of one-shot learning, that is, using only one model essay as a training sample of a highest score. For this purpose, we apply regression models to estimate essay scores with different embedding models, that are, BERT and bag-of-words based encoding models. In preliminary experiments, feature analyses of one-shot learning with UMAP for the two embedding models reveal that the bag-of-words based model has more potential to score the test essays comparing to the BERT encoding model. Thus, to clarify the performance of the bag-of-words based encoding model, we conduct two experiments: firstly, we evaluate the performance of models to estimate the scores of test essays using 80% of score essays are used as training data; secondly, one-shot learning is applied to the models. The experimental results show that the proposed bag-of-words based encoding model is promising.","PeriodicalId":156230,"journal":{"name":"2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133068751","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}
{"title":"Predicting CTR of Regional Flyer Images Using CNN","authors":"Daichi Inoue, S. Matsumoto","doi":"10.1109/IIAIAAI55812.2022.00107","DOIUrl":"https://doi.org/10.1109/IIAIAAI55812.2022.00107","url":null,"abstract":"In recent years, a variety of social media have been launched for regional revitalization. A Japanese social media service \"Tame-map\" is the one of them. Tame-map is a Web application for sharing local information, allowing users to easily post and view information about local events in their daily lives. Since many images are posted on Tame-map every day, creating a well-designed flyer which can attract many users is important. The more users view the site, the more participation in events can be expected. Therefore, increasing the number of views is an important issue from the perspective of revitalizing the local community. The more users view the site, the more participation in events can be expected. On the other hand, the methodology for creating a design that attracts many visitors has not been established. The design process completely depends on organizer’s experience and intuition. In this regard, if the number of views can be predicted to some extent in advance when posting information, the predicted views would be helpful to reconsider the design of the flyer. As a result, we can expect an increase in the number of advertising images that can be viewed by many users, which will lead to the revitalization of the local community. Then, in this study, we predict CTR (Click Through Rate) of local even flyers for the data of Tame-map. We construct a CTR prediction model using CNN, and show that the constructed model is useful for predicting the CTR","PeriodicalId":156230,"journal":{"name":"2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"81 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132760786","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}
{"title":"Detection of Flaming Participants Using Account Information and Stylistic Features of Posts","authors":"Taisei Aoyama, Linshuo Yang, Daisuke Ikeda","doi":"10.1109/IIAIAAI55812.2022.00020","DOIUrl":"https://doi.org/10.1109/IIAIAAI55812.2022.00020","url":null,"abstract":"With the rapid development of SNS in recent years, the number of SNS users has increased rapidly, and people can easily communicate interactively with an unspecified large number of people. With these changes in the information society, a phenomenon known as \"flaming\", in which critical comments flood SNS, has become a frequent occurrence. In recent years, various studies on flaming have been conducted, but most of them are concerned with those who receive a large number of critical comments, not on those who write critical comments, called \"flaming participants\". In this study, we examine the characteristics of flaming participants on Twitter by using machine learning to classify them into two groups: flaming participants and normal users. For the classification features, we use account information, i.e., statistical data for each account, and stylistic features of the postings, i.e., (1, n)-grams of the part-of-speech tags of the postings. The experimental results show that these features are effective in detecting Twitter flaming participants. Furthermore, we found that flaming participants use more quote tweets than the normal user, and that there are word patterns that are characteristic of flaming participants.","PeriodicalId":156230,"journal":{"name":"2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133037366","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}
{"title":"Meaning of the Clusters on Dimensionality Reduction by Word Clustering","authors":"Toshinori Deguchi, Sin-Yeong Seo, Naohiro Ishii","doi":"10.1109/IIAIAAI55812.2022.00072","DOIUrl":"https://doi.org/10.1109/IIAIAAI55812.2022.00072","url":null,"abstract":"In text mining, Latent Semantic Analysis (LSA) is the popular method to reduce the dimension of document vectors. Since LSA produces a set of topics by statistical information, the meaning of each topic is not clear.We proposed a method to reduce the dimension by clustering the words in the documents. This method produces a set of clusters of words instead of topics. Using Word2vec to vectorize the words, the mean vector of the cluster is calculated, which shows the meaning of the cluster.In this paper, we show the dimensionality reduction and the meaning of the generated clusters by word cloud, on document classification problem with a subset of BBC Dataset.","PeriodicalId":156230,"journal":{"name":"2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132448358","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}
{"title":"A high performance approach with MATSim for traffic road simulation","authors":"Sara Moukir, N. Emad, Stéphane Baudelocq","doi":"10.1109/IIAIAAI55812.2022.00140","DOIUrl":"https://doi.org/10.1109/IIAIAAI55812.2022.00140","url":null,"abstract":"Road traffic simulation becomes more and more accurate over time. From macroscopic simulations based on fluid equations, for example, to microscopic simulations based on the multi-agent paradigm, innovations have continued to emerge in recent years. Multi-agent models such as MATSim [1], POLARIS [2] or SimMobility [3] have been highlighted lately in response to complex and microscopic simulation requirements. However, this microscopic and large-scale approach requires much higher computing power than that delivered by a home computer. High-performance computing approach can be a relevant response to this kind of problem. MATsim due to its module structure was selected as the basis of our study. We introduce a new concept for the design of parallel algorithm of MATSim. The parallel architectures used as support for the experiments presented are provided by GRID’5000 (or G5K) [4].","PeriodicalId":156230,"journal":{"name":"2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127022881","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}
{"title":"Optimization of EV bus charging schedule by stochastic programming","authors":"Tetsuya Sato, T. Shiina, Ryunosuke Hamada","doi":"10.1109/IIAIAAI55812.2022.00124","DOIUrl":"https://doi.org/10.1109/IIAIAAI55812.2022.00124","url":null,"abstract":"In recent years, introducing electric vehicle (EV) buses, their charging equipment and infrastructures has become an urgent issue. The purpose of this study is to propose a scheduling model that minimizes the total charging time of EV buses as a makespan using multiple EV buses and chargers, considering fluctuations in the charging time of each EV bus. Generally, directly solving a problem with probabilistic constraints is difficult, thus it often convert into a deterministic equivalent of stochastic program. Therefore, first, this study solved the relaxed problem of deterministic equivalent and assigned each EV bus to each charger using branch and bound (BB) method. Then, it introduced the probabilistic constraints for calculating the exact value of the makespan. The results of numerical experiments demonstrated the effectiveness of this solution.","PeriodicalId":156230,"journal":{"name":"2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116092244","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}
{"title":"Hyperheuristic Method Based on Deep Reinforcement Learning","authors":"H. Iima, Yoshiyuki Nakamura","doi":"10.1109/iiaiaai55812.2022.00068","DOIUrl":"https://doi.org/10.1109/iiaiaai55812.2022.00068","url":null,"abstract":"For solving combinatorial optimization problems, methods in which a candidate solution is iteratively updated are often used. One of the problems in the iterative methods is how to update the candidate solution, and it is not easy to design an appropriate update method. To solve the problem, hyperheuristics have been proposed. They can find a near-optimal solution by using multiple update methods and automatically selecting an appropriate update method, often combined with an existing optimization algorithm such as evolutionary computation. On the other hand, deep reinforcement learning has recently attracted attention due to its ability to solve large-scale and complicated problems. This paper proposes a hyperheuristic method introducing deep reinforcement learning to automatically find the appropriate update method. As a case study, we apply the proposed method to a drone delivery problem and evaluate its performance.","PeriodicalId":156230,"journal":{"name":"2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121771558","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}