2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)最新文献

筛选
英文 中文
Toward further innovation in human-machine systems 迈向人机系统的进一步创新
Yoshiyuki Tanaka
{"title":"Toward further innovation in human-machine systems","authors":"Yoshiyuki Tanaka","doi":"10.1109/IWCIA.2016.7805739","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805739","url":null,"abstract":"A human-machine system (HMS) is an intelligent system in which a human operator cooperates and/or shares the functions of the system with a partially- or fully-automated machine through an operational interface with the goal of completing a target task. Examples of an HMS include an automobile, an airplane, and a wearable power-assist robot. The most important point related to the development of such an operational HMS is how the machine could move and cooperate with a human operator while executing a target task without adversely affecting not only the performance of the task but also the human operator's comfort. Despite the fact that the hardware systems of recent machines are well-developed, there remain many issues affecting the realization of an ideal HMS that could fully harmonize its behavior with a human because of the difficulty in treating uncertain human properties and individuals. Therefore, recent studies on HMS have addressed many related aspects, including control theory, robotics, biomechanics, human factors/ergonomics, and neuroscience as the need arises. Recent trends in the field of HMS research include a human-centric methodology and a shared control methodology, for which better computational models for task-related human motor function and/or perceptual functions are formulated based on experimental data and embodied into the control systems of automated machines. This talk provides an outline of an HMS, describes some state-of-the-art research, and invites open questions with the aim of identifying what we should/could do to achieve further innovation in the HMS field.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129842488","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}
引用次数: 1
Fine tuning method by using knowledge acquisition from Deep Belief Network 基于深度信念网络知识获取的微调方法
Shin Kamada, T. Ichimura
{"title":"Fine tuning method by using knowledge acquisition from Deep Belief Network","authors":"Shin Kamada, T. Ichimura","doi":"10.1109/IWCIA.2016.7805759","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805759","url":null,"abstract":"We developed an adaptive structure learning method of Restricted Boltzmann Machine (RBM) which can generate/annihilate neurons by self-organizing learning method according to input patterns. Moreover, the adaptive Deep Belief Network (DBN) in the assemble process of pre-trained RBM layer was developed. The proposed method presents to score a great success to the training data set for big data benchmark test such as CIFAR-10. However, the classification capability of the test data set, which are included unknown patterns, is high, but does not lead perfect correct solution. We investigated the wrong specified data and then some characteristic patterns were found. In this paper, the knowledge related to the patterns is embedded into the classification algorithm of trained DBN. As a result, the classification capability can achieve a great success (97.1% to unknown data set).","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128224139","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}
引用次数: 7
Using canonical representations of block tree patterns in acquisition of characteristic block preserving outerplanar graph patterns 利用块树模式的规范表示获取保留特征块的外平面图模式
Fumiya Tokuhara, T. Miyahara, Yusuke Suzuki, Tomoyuki Uchida, T. Kuboyama
{"title":"Using canonical representations of block tree patterns in acquisition of characteristic block preserving outerplanar graph patterns","authors":"Fumiya Tokuhara, T. Miyahara, Yusuke Suzuki, Tomoyuki Uchida, T. Kuboyama","doi":"10.1109/IWCIA.2016.7805755","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805755","url":null,"abstract":"We consider evolutionary learning, based on Genetic Programming, for acquiring characteristic graph structures from positive and negative outerplanar graph data. We use block preserving outerplanar graph patterns as representations of graph structures. Block tree patterns are tree representations of block preserving outerplanar patterns, and have the structure of unrooted trees some of whose vertices have ordered adjacent vertices. In this paper we propose canonical representations, which are representations having the structure of rooted and ordered trees, of block tree patterns in acquiring characteristic block preserving outerplanar graph patterns. Then we give an algorithm for calculating canonical representations of block tree patterns. Preliminary experimental results show the algorithm is effective in reducing the run time of our evolutionary learning method.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122813253","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}
引用次数: 3
Contact map overlap maximization using adaptive distributed modified extremal optimization 基于自适应分布式修正极值优化的接触图重叠最大化
Keiichi Tamura, H. Kitakami, Tatsuhiro Sakai
{"title":"Contact map overlap maximization using adaptive distributed modified extremal optimization","authors":"Keiichi Tamura, H. Kitakami, Tatsuhiro Sakai","doi":"10.1109/IWCIA.2016.7805754","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805754","url":null,"abstract":"The detection of similar structures in proteins has received considerable attention in the post-genome era. Protein structure alignment, which is similar to sequence alignment, can detect the structural homology between two proteins according to their three-dimensional structures. One of the simplest yet most robust techniques for finding optimal protein structure alignment is to maximize the contact map overlap (CMO). This optimization is known as the CMO problem. We have been developing bio-inspired heuristic models using distributed modified extremal optimization (DMEO) for the CMO problem. DMEO is inspired by distributed genetic algorithms, which are known as island models. DMEO is a hybrid of population-based modified extremal optimization (PMEO) and the island model. In our previous work, we proposed a novel bio-inspired heuristic model, i.e., DMEO with different evolutionary strategies (DMEODES) to maintain population diversity. DMEODES is based on the island model; however, some of the islands, called hot-spot islands, have a different evolutionary strategy. In this paper, we propose a state-of-art heuristic model to improve the DMEO's ability to prevent evolution stagnation. The new model integrates an adaptive generation alternation mechanism in DMEO called ADMEO. To evaluate ADMEO, we used actual protein structures. Experimental results show that ADMEO outperforms DMEODES.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117252854","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
Solving facility layout problems using evolutionary strategy based on levy flight 基于levy飞行的进化策略求解设施布局问题
Dongqing Zhao, C. Aranha, H. Kanoh
{"title":"Solving facility layout problems using evolutionary strategy based on levy flight","authors":"Dongqing Zhao, C. Aranha, H. Kanoh","doi":"10.1109/IWCIA.2016.7805746","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805746","url":null,"abstract":"This paper introduces a new way to solve the Facility Layout Problem (FLP). The FLP consists of choosing positions of a set of departments in the facility so that the material handling cost is minimized. We employed an Evolutionary Strategy (ES) using Levy Flight as basis for an improved mutation operator. We compared this algorithm with GA, ACO, Chaos Theory and standard ES in a set of FLP benchmarks. Our results show that the proposed method obtains better solutions with less evaluations for large scale problems.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134461746","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}
引用次数: 3
Evolutionary algorithm-based composition of hybrid-genre melodies using selected feature sets 基于进化算法的混合流派旋律组合使用选定的特征集
Aran V. Samson, A. Coronel
{"title":"Evolutionary algorithm-based composition of hybrid-genre melodies using selected feature sets","authors":"Aran V. Samson, A. Coronel","doi":"10.1109/IWCIA.2016.7805748","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805748","url":null,"abstract":"Algorithmically generating music using specialized algorithms is a growing focus in computer science. The success of these specialized algorithms in generating music, however, depends heavily on the fitness function that is used to score the generated music and equally as important is how the fitness function is designed. Artificial intelligence in the computational composition can use certain feature set values derived from melodic analysis to serve as criteria for these fitness functions. This study explores two methods in defining the key features to be used as fitness criteria for algorithmic music generation of music that can be considered under a mix of two musical genres or hybrid-genre music. The jSymbolic tool was used to extract 101 features from musical pieces that fall under two genres. This was then reduced to a smaller feature set for use as fitness criteria. Two methods for feature reduction was explored; a decision-tree-based technique and a high-correlation-filtering technique. The study was able to confirm that each technique can be used to compose hybrid-genre music with 86% success-rate as confirmed by SVM when validated under the same dataset used in the study. This study does not claim to consistently result in a high success rate for all existing datasets.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122183358","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}
引用次数: 3
The recommendation system to SNS community for tourists by using altruistic behaviors 利用利他行为向SNS社区推荐游客
T. Ichimura, Takuya Uemoto, Shin Kamada
{"title":"The recommendation system to SNS community for tourists by using altruistic behaviors","authors":"T. Ichimura, Takuya Uemoto, Shin Kamada","doi":"10.1109/IWCIA.2016.7805747","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805747","url":null,"abstract":"We have already developed the recommendation system of sightseeing information on SNS by using smartphone based user participatory sensing system. The system can post the attractive information for tourists to the specified Facebook page by our developed smartphone application. The users in Facebook, who are interested in sightseeing, can come flocking through information space from far and near. However, the activities in the community on SNS are only supported by the specified people called a hub. We propose the method of vitalization of tourist behaviors to give a stimulus to the people. We develop the simulation system for multi agent system with altruistic behaviors inspired by the Army Ants. The army ant takes feeding action with altruistic behaviors to suppress selfish behavior to a common object used by a plurality of users in common. In this paper, we introduce the altruism behavior determined by some simulation to vitalize the SNS community. The efficiency of the revitalization process of the community was investigated by some experimental simulation results.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129630610","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
Applying portfolio theory to prediction correction of train arrival times 应用组合理论进行列车到站时间预测校正
Takaaki Yamada, Tatsuhiro Sato
{"title":"Applying portfolio theory to prediction correction of train arrival times","authors":"Takaaki Yamada, Tatsuhiro Sato","doi":"10.1109/IWCIA.2016.7805740","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805740","url":null,"abstract":"The application of portfolio theory to the prediction of train arrival times is shown to improve prediction accuracy. The \"portfolio\" comprises two correction methods based on a Wiener process: one uses history data for the current day and the other uses data for previous days. The error between the predicted and actual time is assumed to have a normal distribution. Portfolio theory is used to determine the optimal application of the two methods to the correction process. Simulation using actual data showed that the average error in the predicted arrival time was reduced to 4 s from 12 s when the timetable was dense. This error reduction will, for example, improve the efficiency of regenerative braking systems, in which the kinetic energy of an arriving (braking) train is electrically transmitted to a departing (accelerating) train.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126752529","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}
引用次数: 1
Single frame super-resolution using multiple graph structured program 单帧超分辨率采用多图结构化程序
Y. Natsui, T. Nagao
{"title":"Single frame super-resolution using multiple graph structured program","authors":"Y. Natsui, T. Nagao","doi":"10.1109/IWCIA.2016.7805752","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805752","url":null,"abstract":"Single frame Super-Resolution (SR) is a technique to generate a high-resolution (HR) image from one low-resolution (LR) image. Generally, single frame SR has trade-off between image quality and computational cost. In this paper, we propose a single frame SR method using multiple graph structured programs based on Cartesian Genetic Programming (CGP). In order to improve the trade-off, we use low computational cost graphs which are constructed from HR and LR images. We constructed each graph structured program simultaneously. Experimental result shows the effectiveness of combining multiple graph structured programs. We present a fast and good quality SR method using multiple programs.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114342878","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}
引用次数: 1
A recommendation system of grants to acquire external funds 获得外部资金的赠款推荐制度
Shin Kamada, T. Ichimura, Takanobu Watanabe
{"title":"A recommendation system of grants to acquire external funds","authors":"Shin Kamada, T. Ichimura, Takanobu Watanabe","doi":"10.1109/IWCIA.2016.7805760","DOIUrl":"https://doi.org/10.1109/IWCIA.2016.7805760","url":null,"abstract":"The recommendation system of the competitive grants to university researchers by using the Grants-in-Aid for Scientific Research (KAKEN) keywords has been developed. The system can determine the recommendation order of researchers to each grant by the using the association rules between KAKEN application and various information from the web site of the corresponding grant. However, our developed previous system has some fatal errors in the retrieval algorithm. We modify the algorithm and extend the retrieval data for web mining. If the grant information is not enough to determine the relation, the system investigates the past KAKEN records in the database for the researcher who acquired the past grant. Moreover, the system retrieves the papers of the researchers to search their interests. As a result, the agreement degree of the researcher's interest to the grant increases. This paper discusses some simulation results.","PeriodicalId":262942,"journal":{"name":"2016 IEEE 9th International Workshop on Computational Intelligence and Applications (IWCIA)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133986550","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信