Inteligencia Artif.Pub Date : 2018-09-07DOI: 10.4114/INTARTIF.VOL21ISS62PP40-52
Filip Dvorak, Maxwell Micali, Mathias Mathieug
{"title":"Planning and Scheduling in Additive Manufacturing","authors":"Filip Dvorak, Maxwell Micali, Mathias Mathieug","doi":"10.4114/INTARTIF.VOL21ISS62PP40-52","DOIUrl":"https://doi.org/10.4114/INTARTIF.VOL21ISS62PP40-52","url":null,"abstract":"Recent advances in additive manufacturing (AM) and 3D printing technologies have led to significant growth in the use of additive manufacturing in industry, which allows for the physical realization of previously difficult to manufacture designs. However, in certain cases AM can also involve higher production costs and unique in-process physical complications, motivating the need to solve new optimization challenges. Optimization for additive manufacturing is relevant for and involves multiple fields including mechanical engineering, materials science, operations research, and production engineering, and interdisciplinary interactions must be accounted for in the optimization framework. \u0000In this paper we investigate a problem in which a set of parts with unique configurations and deadlines must be printed by a set of machines while minimizing time and satisfying deadlines, bringing together bin packing, nesting (two-dimensional bin packing), job shop scheduling, and constraints satisfaction. We first describe the real-world industrial motivation for solving the problem. Subsequently, we encapsulate the problem within constraints and graph theory, create a formal model of the problem, discuss nesting as a subproblem, and describe the search algorithm. Finally, we present the datasets, the experimental approach, and the preliminary results.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"274 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120849234","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}
Inteligencia Artif.Pub Date : 2018-09-07DOI: 10.4114/intartif.vol21iss62pp13-24
F. C. Martínez, A. Treviño, M. A. Alcorta-Garcia, A. E. Fraire, José Armando Sáenz Esqueda, Julio Gerardo Lozoya Velez
{"title":"Reglas para predecir el cumplimiento de la calidad del agua residual en una planta tratadora con minería de datos","authors":"F. C. Martínez, A. Treviño, M. A. Alcorta-Garcia, A. E. Fraire, José Armando Sáenz Esqueda, Julio Gerardo Lozoya Velez","doi":"10.4114/intartif.vol21iss62pp13-24","DOIUrl":"https://doi.org/10.4114/intartif.vol21iss62pp13-24","url":null,"abstract":"Un problema que enfrentan los organismos operadores de agua, es el cumplimiento de la normatividaden la calidad del agua residual tratada. Por lo que es recomendable implementar estrategias que favorezcan elcumplimiento de las regulaciones. La mineria de datos es una herramienta que permite predecir la calidad del aguaen el efluente de los sistemas de tratamiento. En el presente estudio se propone un criterio para el pre procesado dedatos donde se consideraron variables nominales. Luego se aplico el sistema de mineria de datos (clasificacion)para definir la prediccion de la calidad del agua. Se aplicaron los siguientes clasificadores: OneR; decision tables,J48, arbol de decision de un solo nivel; PART y LMT. Los resultados muestran que el mejor algoritmo fue el J48:87.35 % de instancias correctamente clasificadas. El arbol de decision determino dos reglas para el cumplimientocon la normatividad. Es importante indicar que a la fecha existen procedimientos con mineria de datos parapredecir la calidad del efluente de un sistema de tratamiento, pero utilizan estrictamente variables numericas;mientras que en el presente trabajo se utilizaron variables nominales, finalmente se discuten los resultados y seindican los procesos industriales que generan materia organica y otros contaminantes.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134261989","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}
Inteligencia Artif.Pub Date : 2018-09-01DOI: 10.4114/intartif.vol22iss63pp135-149
D. Kröhling, O. Chiotti, E. Martínez
{"title":"The importance of context-dependent learning in negotiation agents","authors":"D. Kröhling, O. Chiotti, E. Martínez","doi":"10.4114/intartif.vol22iss63pp135-149","DOIUrl":"https://doi.org/10.4114/intartif.vol22iss63pp135-149","url":null,"abstract":"Automated negotiation between artificial agents is essential to deploy Cognitive Computing and Internet of Things. The behavior of a negotiation agent depends significantly on the influence of environmental conditions or contextual variables, since they affect not only a given agent preferences and strategies, but also those of other agents. Despite this, the existing literature on automated negotiation is scarce about how to properly account for the effect of context-relevant variables in learning and evolving strategies. In this paper, a novel context-driven representation for automated negotiation is introduced. Also, a simple negotiation agent that queries available information from its environment, internally models contextual variables, and learns how to take advantage of this knowledge by playing against himself using reinforcement learning is proposed. Through a set of episodes against other negotiation agents in the existing literature, it is shown using our context-aware agent that it makes no sense to negotiate without taking context-relevant variables into account. Our context-aware negotiation agent has been implemented in the GENIUS environment, and results obtained are significant and quite revealing.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117230788","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}
Inteligencia Artif.Pub Date : 2018-09-01DOI: 10.4114/intartif.vol22iss63pp16-38
Gabriel D. Caffaratti, M. Marchetta, R. Forradellas
{"title":"Stereo Matching through Squeeze Deep Neural Networks","authors":"Gabriel D. Caffaratti, M. Marchetta, R. Forradellas","doi":"10.4114/intartif.vol22iss63pp16-38","DOIUrl":"https://doi.org/10.4114/intartif.vol22iss63pp16-38","url":null,"abstract":"Visual depth recognition through Stereo Matching is an active field of research due to the numerous applications in robotics, autonomous driving, user interfaces, etc. Multiple techniques have been developed in the last two decades to achieve accurate disparity maps in short time. With the arrival of Deep Leaning architectures, different fields of Artificial Vision, but mainly on image recognition, have achieved a great progress due to their easier training capabilities and reduction of parameters. This type of networks brought the attention of the Stereo Matching researchers who successfully applied the same concept to generate disparity maps. Even though multiple approaches have been taken towards the minimization of the execution time and errors in the results, most of the time the number of parameters of the networks is neither taken into consideration nor optimized. Inspired on the Squeeze-Nets developed for image recognition, we developed a Stereo Matching Squeeze neural network architecture capable of providing disparity maps with a highly reduced network size without a significant impact on quality and execution time compared with state of the art architectures. In addition, with the purpose of improving the quality of the solution and get solutions closer to real time, an extra refinement module is proposed and several tests are performed using different input size reductions.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122638988","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}
Inteligencia Artif.Pub Date : 2018-05-28DOI: 10.4114/INTARTIF.VOL21ISS61PP111-123
H. Jazayeriy, Sahar Bakhtar, M. Valinataj
{"title":"aPaRT: A Fast Meta-Heuristic Algorithm using Path-Relinking and Tabu Search for Allocating Machines to Operations in FJSP Problem","authors":"H. Jazayeriy, Sahar Bakhtar, M. Valinataj","doi":"10.4114/INTARTIF.VOL21ISS61PP111-123","DOIUrl":"https://doi.org/10.4114/INTARTIF.VOL21ISS61PP111-123","url":null,"abstract":"This paper proposes a multi-start local search algorithm that solves the flexible job-shop scheduling (FJSP) problem to minimize makespan. The proposed algorithm uses a path-relinking method to generate near optimal solutions. A heuristic parameter, $alpha$, is used to assign machines to operations.Also, a tabu list is applied to avoid getting stuck at local optimums.The proposed algorithm is tested on two sets of benchmark problems (BRdata and Kacem) to make a comparison with the variable neighborhood search.The experimental results show that the proposed algorithm can produce promising solution in a shorter amount of time.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116438137","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}
Inteligencia Artif.Pub Date : 2018-05-09DOI: 10.4114/INTARTIF.VOL21ISS61PP95-110
F. Dařena, Jonás Petrovský, J. Zizka, J. Prichystal
{"title":"Machine Learning-Based Analysis of the Association Between Online Texts and Stock Price Movements","authors":"F. Dařena, Jonás Petrovský, J. Zizka, J. Prichystal","doi":"10.4114/INTARTIF.VOL21ISS61PP95-110","DOIUrl":"https://doi.org/10.4114/INTARTIF.VOL21ISS61PP95-110","url":null,"abstract":"The paper presents the result of experiments that were designed with the goal of revealing the association between texts published in online environments (Yahoo! Finance, Facebook, and Twitter) and changes in stock prices of the corresponding companies at a micro level. The association between lexicon detected sentiment and stock price movements was not confirmed. It was, however, possible to reveal and quantify such association with the application of machine learning-based classification. From the experiments it was obvious that the data preparation procedure had a substantial impact on the results. Thus, different stock price smoothing, lags between the release of documents and related stock price changes, five levels of a minimal stock price change, three different weighting schemes for structured document representation, and six classifiers were studied. It has been shown that at least part of the movement of stock prices is associated with the textual content if a proper combination of processing parameters is selected.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132198935","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}
Inteligencia Artif.Pub Date : 2018-03-21DOI: 10.4114/INTARTIF.VOL21ISS61PP1-13
Carlos Silva, D. Welfer, Cláudia Dornelles
{"title":"The Pattern Recognition in Cattle Brand using Bag of Visual Words and Support Vector Machines Multi-Class","authors":"Carlos Silva, D. Welfer, Cláudia Dornelles","doi":"10.4114/INTARTIF.VOL21ISS61PP1-13","DOIUrl":"https://doi.org/10.4114/INTARTIF.VOL21ISS61PP1-13","url":null,"abstract":"The recognition images of cattle brand in an automatic way is a necessity to governmental organs responsible for this activity. To help this process, this work presents a method that consists in using Bag of Visual Words for extracting of characteristics from images of cattle brand and Support Vector Machines Multi-Class for classification. This method consists of six stages: a) select database of images; b) extract points of interest (SURF); c) create vocabulary (K-means); d) create vector of image characteristics (visual words); e) train and sort images (SVM); f) evaluate the classification results. The accuracy of the method was tested on database of municipal city hall, where it achieved satisfactory results, reporting 86.02% of accuracy and 56.705 seconds of processing time, respectively.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130301719","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}
Inteligencia Artif.Pub Date : 2018-03-21DOI: 10.4114/INTARTIF.VOL21ISS61PP67-81
Cristian Cardellino, L. A. Alemany
{"title":"Exploring the impact of word embeddings for disjoint semisupervised Spanish verb sense disambiguation","authors":"Cristian Cardellino, L. A. Alemany","doi":"10.4114/INTARTIF.VOL21ISS61PP67-81","DOIUrl":"https://doi.org/10.4114/INTARTIF.VOL21ISS61PP67-81","url":null,"abstract":"This work explores the use of word embeddings as features for Spanish verb sense disambiguation (VSD). This type of learning technique is named disjoint semisupervised learning: an unsupervised algorithm (i.e. the word embeddings) is trained on unlabeled data separately as a first step, and then its results are used by a supervised classifier. In this work we primarily focus on two aspects of VSD trained with unsupervised word representations. First, we show how the domain where the word embeddings are trained affects the performance of the supervised task. A specific domain can improve the results if this domain is shared with the domain of the supervised task, even if the word embeddings are trained with smaller corpora. Second, we show that the use of word embeddings can help the model generalize when compared to not using word embeddings. This means embeddings help by decreasing the model tendency to overfit.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122080067","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}
Inteligencia Artif.Pub Date : 2018-03-01DOI: 10.4114/INTARTIF.VOL21ISS61PP47-66
Sebastián Vallejos, Brian Caimmi, D. Alonso, Luis Berdún, Á. Soria
{"title":"Comparing detection and disclosure of traffic incidents in social networks: an intelligent approach based on Twitter vs. Waze","authors":"Sebastián Vallejos, Brian Caimmi, D. Alonso, Luis Berdún, Á. Soria","doi":"10.4114/INTARTIF.VOL21ISS61PP47-66","DOIUrl":"https://doi.org/10.4114/INTARTIF.VOL21ISS61PP47-66","url":null,"abstract":"Nowadays, social networks have become in a communication medium widely used to disseminate any type of information. In particular, the shared information in social networks usually includes a considerable number of traffic incidents reports of specific cities. In light of this, specialized social networks have emerged for detecting and disseminating traffic incidents, differentiating from generic social networks in which a wide variety of topics are communicated. In this context, Twitter is a case in point of a generic social network in which its users often share information about traffic incidents, while Waze is a social network specialized in traffic. In this paper we present a comparative study between Waze and an intelligent approach that detects traffic incidents by analyzing publications shared in Twitter. The comparative study was carried out considering Ciudad Autonoma de Buenos Aires (CABA), Argentina, as the region of interest. The results of this work suggest that both social networks should be considered as complementary sources of information. This conclusion is based on the fact that the proportion of mutual detections, i.e. traffic incidents detected by both approaches, was considerably low since it did not exceed 6% of the cases. Moreover, the results do not show that any of the approaches tend to anticipate in time to the other one in the detection of traffic incidents.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"9 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129623282","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}
Inteligencia Artif.Pub Date : 2017-10-17DOI: 10.4114/INTARTIF.VOL20ISS60PP51-71
L. Benchikhi, M. Sadgal, A. E. Fazziki, Fatimaezzahra Mansouri
{"title":"A Novel adaptative Discrete Cuckoo Search Algorithm for parameter optimization in computer vision","authors":"L. Benchikhi, M. Sadgal, A. E. Fazziki, Fatimaezzahra Mansouri","doi":"10.4114/INTARTIF.VOL20ISS60PP51-71","DOIUrl":"https://doi.org/10.4114/INTARTIF.VOL20ISS60PP51-71","url":null,"abstract":"Computer vision applications require choosing operators and their parameters, in order to provide the best outcomes. Often, the users quarry on expert knowledge and must experiment many combinations to find manually the best one. As performance, time and accuracy are important, it is necessary to automate parameter optimization at least for crucial operators. In this paper, a novel approach based on an adaptive discrete cuckoo search algorithm (ADCS) is proposed. It automates the process of algorithms’ setting and provides optimal parameters for vision applications. This work reconsiders a discretization problem to adapt the cuckoo search algorithm and presents the procedure of parameter optimization. Some experiments on real examples and comparisons to other metaheuristic-based approaches: particle swarm optimization (PSO), reinforcement learning (RL) and ant colony optimization (ACO) show the efficiency of this novel method.","PeriodicalId":176050,"journal":{"name":"Inteligencia Artif.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132307737","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}