Pub Date : 2016-07-01DOI: 10.1109/IIAI-AAI.2016.224
Noriko Uosaki, Mahiro Kiyota, Kousuke Mouri, H. Ogata
This paper describes our continuous study in which we have aimed to support international students' job hunting in Japan with our developed career support system. Our previous evaluation revealed three agendas in our system. Reflecting its result, we have improved it by implementing epub-based eBook called AETEL. Evaluation of our new system is scheduled to be conducted in 2016 spring. It is expected to support international students' job hunting process more powerfully than the previous one.
{"title":"Career Support for International Students in Japan Using Learning Log System with eBook","authors":"Noriko Uosaki, Mahiro Kiyota, Kousuke Mouri, H. Ogata","doi":"10.1109/IIAI-AAI.2016.224","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2016.224","url":null,"abstract":"This paper describes our continuous study in which we have aimed to support international students' job hunting in Japan with our developed career support system. Our previous evaluation revealed three agendas in our system. Reflecting its result, we have improved it by implementing epub-based eBook called AETEL. Evaluation of our new system is scheduled to be conducted in 2016 spring. It is expected to support international students' job hunting process more powerfully than the previous one.","PeriodicalId":272739,"journal":{"name":"2016 5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116897662","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 : 2016-07-01DOI: 10.1109/IIAI-AAI.2016.122
T. Sakumura, H. Hirose
To evaluate the ability of examinees, the item response theory (IRT) gives us useful information. The IRT evaluates the examinee's ability and provides the item characteristics. Recently, we have configured the adaptive online testing using the IRT as one of the CBT (Computer Based Testing) methods, and we have been able to obtain the examinee's ability rating in short testing time. However, when the number of items is too small, we observed the bias of estimates for the ability parameter. In this study, we have performed simulation studies under various conditions, and have known such biases. To circumvent the biases due to the Bayes procedure, we have proposes a simple method to reduce the biases.
项目反应理论(IRT)为评价考生的能力提供了有用的信息。IRT评估考生的能力并提供项目特征。最近，我们将IRT作为CBT (Computer Based testing)方法之一，配置了自适应在线测试，并在较短的测试时间内获得了考生的能力等级。然而，当项目数量过少时，我们观察到能力参数估计的偏差。在本研究中，我们在各种条件下进行了模拟研究，并了解了这种偏差。为了避免贝叶斯过程带来的偏差，我们提出了一种简单的方法来减小偏差。
{"title":"Bias Reduction of Abilities for Adaptive Online IRT Testing Systems","authors":"T. Sakumura, H. Hirose","doi":"10.1109/IIAI-AAI.2016.122","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2016.122","url":null,"abstract":"To evaluate the ability of examinees, the item response theory (IRT) gives us useful information. The IRT evaluates the examinee's ability and provides the item characteristics. Recently, we have configured the adaptive online testing using the IRT as one of the CBT (Computer Based Testing) methods, and we have been able to obtain the examinee's ability rating in short testing time. However, when the number of items is too small, we observed the bias of estimates for the ability parameter. In this study, we have performed simulation studies under various conditions, and have known such biases. To circumvent the biases due to the Bayes procedure, we have proposes a simple method to reduce the biases.","PeriodicalId":272739,"journal":{"name":"2016 5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117043867","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 : 2016-07-01DOI: 10.1109/IIAI-AAI.2016.91
R. Arumugam, Wujuan Lin, S. Yi
High performance computing (HPC) applications demand high I/O throughput from file systems to match their fast processing requirements. These HPC applications create large amounts of file meta-data that can overwhelm current single meta-data server file systems leading to performance bottlenecks. We address this problem with a multiple meta-data server (M-MDS) design using standard parallel NFS (pNFS). We utilize NFS directory referrals mechanism with hashing to efficiently distribute meta-data across a cluster of metadata servers. We show through a large scale setup in Amazon EC2 that our pNFS M-MDS can scale almost linearly and outperform Lustre CMD (Clustered Metadata) by up to 3 times in some of the file system meta-data operation benchmarks.
{"title":"Scalable Distributed Meta-Data Management in Parallel NFS","authors":"R. Arumugam, Wujuan Lin, S. Yi","doi":"10.1109/IIAI-AAI.2016.91","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2016.91","url":null,"abstract":"High performance computing (HPC) applications demand high I/O throughput from file systems to match their fast processing requirements. These HPC applications create large amounts of file meta-data that can overwhelm current single meta-data server file systems leading to performance bottlenecks. We address this problem with a multiple meta-data server (M-MDS) design using standard parallel NFS (pNFS). We utilize NFS directory referrals mechanism with hashing to efficiently distribute meta-data across a cluster of metadata servers. We show through a large scale setup in Amazon EC2 that our pNFS M-MDS can scale almost linearly and outperform Lustre CMD (Clustered Metadata) by up to 3 times in some of the file system meta-data operation benchmarks.","PeriodicalId":272739,"journal":{"name":"2016 5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117330419","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 : 2016-07-01DOI: 10.1109/IIAI-AAI.2016.184
S. Izumi, Asato Edo, Toru Abe, T. Suganuma
We propose a smart routing scheme for disaster-resistant storage systems. This scheme uses multipath routes and dynamically controls data routes according to the network status to achieve efficient data transmission while avoiding network bottlenecks and disconnected links in the post-disaster period. In this paper, we develop this scheme by using OpenFlow as the one of the implementation technologies of Software Defined Network (SDN). We apply this scheme to actual OpenFlow Switches and evaluate its performance considering various situations.
{"title":"Performance Evaluation of SDN Based Smart Routing for Disaster-Resistant Storage Systems","authors":"S. Izumi, Asato Edo, Toru Abe, T. Suganuma","doi":"10.1109/IIAI-AAI.2016.184","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2016.184","url":null,"abstract":"We propose a smart routing scheme for disaster-resistant storage systems. This scheme uses multipath routes and dynamically controls data routes according to the network status to achieve efficient data transmission while avoiding network bottlenecks and disconnected links in the post-disaster period. In this paper, we develop this scheme by using OpenFlow as the one of the implementation technologies of Software Defined Network (SDN). We apply this scheme to actual OpenFlow Switches and evaluate its performance considering various situations.","PeriodicalId":272739,"journal":{"name":"2016 5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"28 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123459326","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 : 2016-07-01DOI: 10.1109/IIAI-AAI.2016.93
Takaaki Yamada, Tatsuhiro Sato, T. Tomiyama, Nobutaka Ueki
A previously developed interactive system with an explanation function generates crew schedules automatically by using a rule base in an 'if-then-because' format. Delivering 'because' information to the user is helpful for decision making because it visualizes the computing process. We evaluated the effectiveness of the explanation function by think-aloud testing in which the verbal comments of each participant were recorded while the participant was solving a pre-specified problem of crew rescheduling in our system. A cognitive model for using the system was obtained in a user state transition form by protocol analysis of the comments. The results revealed that users spent 28% of their time for interpreting 'because' information and this information played an important role in the decision making. Interactive processing with the help of the explanation function is practical for real-time railway crew rescheduling.
{"title":"Evaluating Explanation Function in Railway Crew Rescheduling System by Think-Aloud Test","authors":"Takaaki Yamada, Tatsuhiro Sato, T. Tomiyama, Nobutaka Ueki","doi":"10.1109/IIAI-AAI.2016.93","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2016.93","url":null,"abstract":"A previously developed interactive system with an explanation function generates crew schedules automatically by using a rule base in an 'if-then-because' format. Delivering 'because' information to the user is helpful for decision making because it visualizes the computing process. We evaluated the effectiveness of the explanation function by think-aloud testing in which the verbal comments of each participant were recorded while the participant was solving a pre-specified problem of crew rescheduling in our system. A cognitive model for using the system was obtained in a user state transition form by protocol analysis of the comments. The results revealed that users spent 28% of their time for interpreting 'because' information and this information played an important role in the decision making. Interactive processing with the help of the explanation function is practical for real-time railway crew rescheduling.","PeriodicalId":272739,"journal":{"name":"2016 5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124702641","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 : 2016-07-01DOI: 10.1109/IIAI-AAI.2016.22
S. Ishida, Yoko Takashima, S. Tagashira, Akira Fukuda
BLE (Bluetooth Low Energy) based localization is a next candidate for indoor localization. In this paper, we propose a new BLE-based fingerprinting localization scheme that improves localization accuracy. BLE is a narrow band communication that is highly affected by frequency selective fading and channel gains. We employ channel-specific features to location fingerprint to improve localization accuracy. Current BLE standards provide no API to retrieve an advertising channel number. We therefore developed a separate channel advertising scheme to measure RSS (Received Signal Strength) on each advertising channel. To demonstrate the feasibility of the separate channel fingerprinting, we conducted initial evaluations. Experimental evaluations showed that the separate channel fingerprinting improves accuracy by approximately 12%.
{"title":"Proposal of Separate Channel Fingerprinting Using Bluetooth Low Energy","authors":"S. Ishida, Yoko Takashima, S. Tagashira, Akira Fukuda","doi":"10.1109/IIAI-AAI.2016.22","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2016.22","url":null,"abstract":"BLE (Bluetooth Low Energy) based localization is a next candidate for indoor localization. In this paper, we propose a new BLE-based fingerprinting localization scheme that improves localization accuracy. BLE is a narrow band communication that is highly affected by frequency selective fading and channel gains. We employ channel-specific features to location fingerprint to improve localization accuracy. Current BLE standards provide no API to retrieve an advertising channel number. We therefore developed a separate channel advertising scheme to measure RSS (Received Signal Strength) on each advertising channel. To demonstrate the feasibility of the separate channel fingerprinting, we conducted initial evaluations. Experimental evaluations showed that the separate channel fingerprinting improves accuracy by approximately 12%.","PeriodicalId":272739,"journal":{"name":"2016 5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128592284","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 : 2016-07-01DOI: 10.1109/IIAI-AAI.2016.175
Ryohei Kubota, Xinlong Hu, M. Shobu, U. Sumita
VOCs (Voice of Customers) coming through call centers involve a variety of contents such as complaints about products and services, requests for product information and questions about maintenance services, among others. By now, it has been widely recognized that VOCs constitute a valuable source of information for enhancing customer services. Since receiving more than 100,000 VOCs per month is not rare, however, it is virtually impossible to read all of them. Accordingly, it is important to mechanize a procedure for distinguishing VOCs of potential business importance from others, so that valuable information can be extracted from the selected VOCs with speed and cost efficiency. For this purpose, this paper develops a segmentation algorithm for identifying VOCs with Sales Potential and those with Negative Attitude based on a neural network approach combined with text mining.
{"title":"Development of Segmentation Algorithm for Identifying VOCs (Voice of Customers) with Sales Potential and Those with Negative Attitude at Call Centers","authors":"Ryohei Kubota, Xinlong Hu, M. Shobu, U. Sumita","doi":"10.1109/IIAI-AAI.2016.175","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2016.175","url":null,"abstract":"VOCs (Voice of Customers) coming through call centers involve a variety of contents such as complaints about products and services, requests for product information and questions about maintenance services, among others. By now, it has been widely recognized that VOCs constitute a valuable source of information for enhancing customer services. Since receiving more than 100,000 VOCs per month is not rare, however, it is virtually impossible to read all of them. Accordingly, it is important to mechanize a procedure for distinguishing VOCs of potential business importance from others, so that valuable information can be extracted from the selected VOCs with speed and cost efficiency. For this purpose, this paper develops a segmentation algorithm for identifying VOCs with Sales Potential and those with Negative Attitude based on a neural network approach combined with text mining.","PeriodicalId":272739,"journal":{"name":"2016 5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130660872","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 : 2016-07-01DOI: 10.1109/IIAI-AAI.2016.187
Naoki Shino, Ryosuke Yamanishi, Jun-ichi Fukumoto
Many people often cook a dish with a cooking recipe on Websites and magazines. The listed ingredients in the recipe sometimes can not be prepared. This paper proposes a recommendation system for alternative ingredients. The recommendation ingredients based on co-occurrence frequency of ingredients on recipe database and ingredient category stored in a cooking ontology. The result of the subjective evaluation experiments showed 88% appropriateness for alternative-ingredients recommendation.
{"title":"Recommendation System for Alternative-Ingredients Based on Co-occurrence Relation on Recipe Database and the Ingredient Category","authors":"Naoki Shino, Ryosuke Yamanishi, Jun-ichi Fukumoto","doi":"10.1109/IIAI-AAI.2016.187","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2016.187","url":null,"abstract":"Many people often cook a dish with a cooking recipe on Websites and magazines. The listed ingredients in the recipe sometimes can not be prepared. This paper proposes a recommendation system for alternative ingredients. The recommendation ingredients based on co-occurrence frequency of ingredients on recipe database and ingredient category stored in a cooking ontology. The result of the subjective evaluation experiments showed 88% appropriateness for alternative-ingredients recommendation.","PeriodicalId":272739,"journal":{"name":"2016 5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132473218","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 : 2016-07-01DOI: 10.1109/IIAI-AAI.2016.102
Qun Song, S. Fong, R. Tang
Swarm optimization algorithms are some of the most efficient ways to solve complexity optimization problems, especially the NP-hard problems. Wolf Search Algorithm (WSA) is a new addition to the family of swarm optimization algorithms. However there are some inherent shortcomings of these algorithms, which is the performance depends heavily on the manually chosen parameters values. One possible approach to solve this limitation is using self-adaptive methods in parameter selection. In this paper we propose some self-adaptive method for WSA to facilitate automatic selection of parameter values. Differential evolution crossover function to iteratively fine-tune the parameters values. Both random and core-guided methods are attempted to choose the evolution agents. In this paper the self-adaptive methods are implemented, certain improvement is shown from the experimental results.
{"title":"Self-Adaptive Wolf Search Algorithm","authors":"Qun Song, S. Fong, R. Tang","doi":"10.1109/IIAI-AAI.2016.102","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2016.102","url":null,"abstract":"Swarm optimization algorithms are some of the most efficient ways to solve complexity optimization problems, especially the NP-hard problems. Wolf Search Algorithm (WSA) is a new addition to the family of swarm optimization algorithms. However there are some inherent shortcomings of these algorithms, which is the performance depends heavily on the manually chosen parameters values. One possible approach to solve this limitation is using self-adaptive methods in parameter selection. In this paper we propose some self-adaptive method for WSA to facilitate automatic selection of parameter values. Differential evolution crossover function to iteratively fine-tune the parameters values. Both random and core-guided methods are attempted to choose the evolution agents. In this paper the self-adaptive methods are implemented, certain improvement is shown from the experimental results.","PeriodicalId":272739,"journal":{"name":"2016 5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130960556","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 : 2016-07-01DOI: 10.1109/IIAI-AAI.2016.120
T. Inamoto, Y. Higami, Shin-ya Kobayashi
In this paper, we propose a road-map to bridge theoretical and practical approaches in the discipline of the elevator operation problem (EOP). The theoretical approach is to obtain optimal solutions for static EOPs, here “static” means all information on users of the elevator system is known before scheduling. The practical approach is to construct rule-bases for realistic situations. The proposed road-map is comprised of 5 stages: (1) to obtain a formally-optimal solution for a problem instance of a static EOP, (2) to construct a statically-peculiar optimal rule-base from the optimal solution, (3) to construct a dynamically-peculiar optimal rule-base which is effective for the problem instance and functions on a continuous elevator system, (4) to construct a dynamically-narrow rule-base which is effective for a set of problem instances, and (5) to construct a dynamically-wide rule-base which is effective for various sets of problem instances. In computer illustrations, preliminary verification on earlier stages are displayed.
{"title":"Road-Map to Bridge Theoretical and Practical Approaches for Elevator Operations","authors":"T. Inamoto, Y. Higami, Shin-ya Kobayashi","doi":"10.1109/IIAI-AAI.2016.120","DOIUrl":"https://doi.org/10.1109/IIAI-AAI.2016.120","url":null,"abstract":"In this paper, we propose a road-map to bridge theoretical and practical approaches in the discipline of the elevator operation problem (EOP). The theoretical approach is to obtain optimal solutions for static EOPs, here “static” means all information on users of the elevator system is known before scheduling. The practical approach is to construct rule-bases for realistic situations. The proposed road-map is comprised of 5 stages: (1) to obtain a formally-optimal solution for a problem instance of a static EOP, (2) to construct a statically-peculiar optimal rule-base from the optimal solution, (3) to construct a dynamically-peculiar optimal rule-base which is effective for the problem instance and functions on a continuous elevator system, (4) to construct a dynamically-narrow rule-base which is effective for a set of problem instances, and (5) to construct a dynamically-wide rule-base which is effective for various sets of problem instances. In computer illustrations, preliminary verification on earlier stages are displayed.","PeriodicalId":272739,"journal":{"name":"2016 5th IIAI International Congress on Advanced Applied Informatics (IIAI-AAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129254608","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
扫码关注我们
求助内容：
应助结果提醒方式：