发布求助
文献互助 智能选刊 最新文献

2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI)最新文献

筛选
英文 中文
Modular Neural Networks in Time Series Modelling 时间序列建模中的模块化神经网络
2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI) Pub Date : 2016-10-01 DOI: 10.1109/MICAI-2016.2016.00018
S. Yarushev, A. Averkin
{"title":"Modular Neural Networks in Time Series Modelling","authors":"S. Yarushev, A. Averkin","doi":"10.1109/MICAI-2016.2016.00018","DOIUrl":"https://doi.org/10.1109/MICAI-2016.2016.00018","url":null,"abstract":"In this paper, we consider a modular neural networks, their key features and benefits. Also in this paper we describe a number of neural networks, which are based on self-organizing Kohonen maps, and that can be successfully applied to the identification of dynamic objects, and describes the new, developed and successfully applied to the identification of dynamic objects modular neural networks, their architecture, learning algorithms, and work, the article reviewed examples of neural networks, and conducted a comparative analysis with several other neural network algorithms of identification of dynamic objects.","PeriodicalId":405503,"journal":{"name":"2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115135666","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
A Statistical Comparison of Objective Functions for the Vehicle Routing Problem with Route Balancing 具有路径平衡的车辆路径问题目标函数的统计比较
2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI) Pub Date : 2016-10-01 DOI: 10.1109/MICAI-2016.2016.00028
J. Lozano, Luis Carlos González-Gurrola, E. Rodriguez-Tello, P. Lacomme
{"title":"A Statistical Comparison of Objective Functions for the Vehicle Routing Problem with Route Balancing","authors":"J. Lozano, Luis Carlos González-Gurrola, E. Rodriguez-Tello, P. Lacomme","doi":"10.1109/MICAI-2016.2016.00028","DOIUrl":"https://doi.org/10.1109/MICAI-2016.2016.00028","url":null,"abstract":"The Vehicle Routing Problem with Route Balancing (VRPRB) is a bi-objective version of the original Vehicle Routing Problem (VRP) in which, besides minimizing the total distance traveled by the vehicles involved, the balance among route loads is also pursued. Different objective functions (OFs) to achieve balanced route configurations have been proposed in the literature, however to the best of the authors' knowledge there is still no consensus on which OF is the most suitable one for addressing, through metaheuristics, this challenging multi-objective optimization problem. This paper inquires into the effectiveness of seven different OFs for the VRPRB. Their influence on the performance of a basic single-solution-based evolutionary algorithm is analyzed by comparing the quality of the Pareto-approximations produced for a set of well-known benchmark instances. The obtained results indicate that studying alternative evaluation schemes for the VRPRB represents a highly valuable direction for future research which merits more attention.","PeriodicalId":405503,"journal":{"name":"2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117178386","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}
引用次数: 8
A Comparative Study of the Use of a Robust Color Image Segmentation Method 一种鲁棒彩色图像分割方法的比较研究
2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI) Pub Date : 2016-10-01 DOI: 10.1109/MICAI-2016.2016.00015
Rodolfo Alvarado-Cervantes, E. Riverón, Vladislav Khartchenko, O. Pogrebnyak
{"title":"A Comparative Study of the Use of a Robust Color Image Segmentation Method","authors":"Rodolfo Alvarado-Cervantes, E. Riverón, Vladislav Khartchenko, O. Pogrebnyak","doi":"10.1109/MICAI-2016.2016.00015","DOIUrl":"https://doi.org/10.1109/MICAI-2016.2016.00015","url":null,"abstract":"In this paper, a comparative study of some basic close related color image segmentation methods is presented. It is focused in the evaluation of two segmentation methods based on a recently published adaptive color similarity function making use of: 1) pixel samples of both figure and background and classifying by maximum similarity, and 2) pixel samples of only figure and classifying by automatic thresholding thus employing only half of input information. It is also presented for comparison, the results of classification using the Euclidean metric of a* and b* channels rejecting L* in the L*a*b* color space and with the Euclidian metric of the R, G, and B channels in the RGB color space. From the results it was obtained that the segmentation technique using the adaptive color similarity function and classifying by automatic thresholding (employing only half of the information supplied to the other methods) had better performance than those implemented in the L*a*b* and RGB color spaces in all cases of study. The performance is equivalent to that using pixel sample of both figure and background and classifying by maximum similarity. The improvement in quality of the segmentation techniques using the color similarity function is substantially significant.","PeriodicalId":405503,"journal":{"name":"2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI)","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122424225","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 the Manufacturing Cell Design Problem Using the Cuckoo Search 利用布谷鸟搜索解决制造单元设计问题
2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI) Pub Date : 2016-10-01 DOI: 10.1109/MICAI-2016.2016.00027
Ricardo Soto, Broderick Crawford, A. Jaime, Maykol Ramírez, B. Almonacid, Leandro Vásquez, Roberto Zulantay
{"title":"Solving the Manufacturing Cell Design Problem Using the Cuckoo Search","authors":"Ricardo Soto, Broderick Crawford, A. Jaime, Maykol Ramírez, B. Almonacid, Leandro Vásquez, Roberto Zulantay","doi":"10.1109/MICAI-2016.2016.00027","DOIUrl":"https://doi.org/10.1109/MICAI-2016.2016.00027","url":null,"abstract":"The Manufacturing Cell Design Problem consists in the division of a manufacturing plant into cells, each one of them containing machines processing a group of parts. The goal is to increase the productivity by minimizing the exchange of material between cells. In this paper, we solve this problem by using Cuckoo Search, which is an easy-to-implement and fast-convergence metaheuristic inspired on the interesting reproduction strategy of cuckoo birds. We perform different experiments on a set of 90 well-known problem instances where our approach is able to reach the global optimum for all of them.","PeriodicalId":405503,"journal":{"name":"2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116390550","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
A Modified-ABC: An Explicit-Memory Based Approach with a New Memory Updating and Retrieval in Dynamic Environments 改进的abc:一种基于显式记忆的动态环境下新的记忆更新和检索方法
2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI) Pub Date : 2016-10-01 DOI: 10.1109/MICAI-2016.2016.00022
M. Shakeri, M. Dadvar
{"title":"A Modified-ABC: An Explicit-Memory Based Approach with a New Memory Updating and Retrieval in Dynamic Environments","authors":"M. Shakeri, M. Dadvar","doi":"10.1109/MICAI-2016.2016.00022","DOIUrl":"https://doi.org/10.1109/MICAI-2016.2016.00022","url":null,"abstract":"The Artificial Bee Colony (ABC) algorithm is considered as one of the swarm intelligence optimization algorithms. It has been extensively used for the applications of static type. Many practical and real-world applications, nevertheless, are of dynamic type. Thus, it is needed to employ some optimization algorithms that could solve this group of the problems that are of dynamic type. Dynamic optimization problems in which change(s) may occur through the time are tougher to face than static optimization problems. In this paper, an approach based on the ABC algorithm enriched with explicit memory and population clustering scheme, for solving dynamic optimization problems is proposed.","PeriodicalId":405503,"journal":{"name":"2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122164990","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 Logic Programming Language Designed for the Modeling of Abductive Reasoning in an Educational Context 为教育环境中溯因推理建模而设计的逻辑程序设计语言
2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI) Pub Date : 2016-10-01 DOI: 10.1109/MICAI-2016.2016.00023
Osvaldo Luiz De Oliveira, C. E. A. Oliveira, R. Martins, M. Matsumoto
{"title":"A Logic Programming Language Designed for the Modeling of Abductive Reasoning in an Educational Context","authors":"Osvaldo Luiz De Oliveira, C. E. A. Oliveira, R. Martins, M. Matsumoto","doi":"10.1109/MICAI-2016.2016.00023","DOIUrl":"https://doi.org/10.1109/MICAI-2016.2016.00023","url":null,"abstract":"The programming of simulations of real or abstract phenomena is referred to as computational modeling. In the educational sphere, computational modeling is useful for students in learning about a phenomenon via programming activities. Abductive logic programming is a computer modeling activity with considerable educational potential due to the universal nature of logic as formalism for modeling; however, existing languages and frameworks of abductive logic programming require students to have a broad knowledge of logic programming, which prevents the use of these solutions in a general educational context. This work proposes a language referred to as Abd1, which has been designed to facilitate abductive logic programming in school environments. This paper describes the Abd1 language and how it can be used for computational modeling in an educational context.","PeriodicalId":405503,"journal":{"name":"2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122399219","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
Feature Selection Methods Evaluation for CTR Estimation CTR估计的特征选择方法评价
2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI) Pub Date : 2016-10-01 DOI: 10.1109/MICAI-2016.2016.00017
Luis Miralles Pechuán, Hiram Ponce, María de Lourdes Martínez-Villaseñor
{"title":"Feature Selection Methods Evaluation for CTR Estimation","authors":"Luis Miralles Pechuán, Hiram Ponce, María de Lourdes Martínez-Villaseñor","doi":"10.1109/MICAI-2016.2016.00017","DOIUrl":"https://doi.org/10.1109/MICAI-2016.2016.00017","url":null,"abstract":"The most widespread payment model in online advertising is Cost-per-click (CPC). In this model the advertisers pay each time that a user generates a click. In order to enhance the income of CPC Advertising Networks, it is necessary to give priority to the most profitable adverts. The most important factor in the profitability of an advert is Click-through-rate (CTR), which is the probability that a user generates a click in a given advert. In this paper we find which feature selection method between PCA, RFE, Gain ratio and NSGA-II is better suited, or if otherwise, the machine learning classification methods work best without any feature selection method.","PeriodicalId":405503,"journal":{"name":"2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133308598","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
Intelligent Sensor for Fault Detection in Glucose Measuring System 葡萄糖测量系统故障检测的智能传感器
2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI) Pub Date : 2016-10-01 DOI: 10.1109/MICAI-2016.2016.00032
Jazmin Martinez-Alvarado, L. Torres-Treviño, G. Quiroz
{"title":"Intelligent Sensor for Fault Detection in Glucose Measuring System","authors":"Jazmin Martinez-Alvarado, L. Torres-Treviño, G. Quiroz","doi":"10.1109/MICAI-2016.2016.00032","DOIUrl":"https://doi.org/10.1109/MICAI-2016.2016.00032","url":null,"abstract":"Technological advances have allowed us to have increasingly portable and efficient glucose measuring systems in the blood, but it has been shown that problems of loss of information are present in the measuring sensors, these failures usually are associated with activities performed by the patient such as exercise, climbing stairs, among others. These failures where the sensor position is affected may cause wrong measurement and in this case the loss of information may occur, as described above we propose a work in which we use the patient sensor to take continuous time samples of the glucose level in the blood of the patient, Those samples are the inputs for the neural network (this neural network will emulate the intelligent sensor) which takes those values and relate them with the past values of glucose and with the insulin dosing. Once the failure of the sensor is detected the prediction mode of the neural network is activated in order to minimize or reduce the loss of information because the neural network will take the place of the sensor temporally.","PeriodicalId":405503,"journal":{"name":"2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115767473","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 Polynomial Time Algorithm for Counting the Number of Independent Sets of Cactus Graphs 仙人掌图独立集数的多项式时间算法
2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI) Pub Date : 2016-10-01 DOI: 10.1109/MICAI-2016.2016.00024
J. R. Marcial-Romero, G. D. I. Luna, A. López-López, R. M. Valdovinos
{"title":"A Polynomial Time Algorithm for Counting the Number of Independent Sets of Cactus Graphs","authors":"J. R. Marcial-Romero, G. D. I. Luna, A. López-López, R. M. Valdovinos","doi":"10.1109/MICAI-2016.2016.00024","DOIUrl":"https://doi.org/10.1109/MICAI-2016.2016.00024","url":null,"abstract":"Counting the number of independent sets of a graph G (denoted as NI(G)) is a classical #P-complete problem for graphs of degree greater or equal than 3. However, there are classes of graphs which according to its topology can be computed in polynomial time. In this paper, we present a polynomial time algorithm for counting the number of independent sets on a special class of graphs called cactus graphs. Our algorithm is based on previous results for counting the number of independent sets on unicyclic graphs.","PeriodicalId":405503,"journal":{"name":"2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128714426","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
Modeling and Simulation of a Novel Exoskeleton Hand for Rehabilitation 新型外骨骼康复手的建模与仿真
2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI) Pub Date : 2016-10-01 DOI: 10.1109/MICAI-2016.2016.00025
Daniel Andrés Córdova, A. Fernández-Ramírez, Fermín C. Aragón, Y. Davizón, Alejandro Said
{"title":"Modeling and Simulation of a Novel Exoskeleton Hand for Rehabilitation","authors":"Daniel Andrés Córdova, A. Fernández-Ramírez, Fermín C. Aragón, Y. Davizón, Alejandro Said","doi":"10.1109/MICAI-2016.2016.00025","DOIUrl":"https://doi.org/10.1109/MICAI-2016.2016.00025","url":null,"abstract":"This paper presents a new architecture of an exoskeleton for the index finger rehabilitation. The design proposed is focused in the rehabilitation of people with diseases that affect the physical functions of the human hand that allows the movement of the metacarpophalangeal joint (MCP) and proximal interphalangeal joint (PIP) of the index finger. This paper shows a new architecture of a new exoskeleton of 3 DOF to the movement of each finger of the hand, the structure of the proposed exoskeleton presented in this work has been based on human hand capabilities as the ranks of motion and physical length as important criteria. The paper presents the static analysis to know all the forces that actuate in the links of the exoskeleton. The geometrical approach has been used in this paper for position analysis in order to find joint angles for the different configurations. The paper contains numerical examples to prove the analytical results.","PeriodicalId":405503,"journal":{"name":"2016 Fifteenth Mexican International Conference on Artificial Intelligence (MICAI)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121408737","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
下一页 尾页
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学术官方微信