Mexican International Conference on Artificial Intelligence | |
---|---|
Abbreviation | MICAI |
Discipline | Artificial Intelligence |
Publication details | |
Publisher | Springer LNAI, IEEE CPS, journals. |
History | 2000– |
Frequency | annual |
The Mexican International Conference on Artificial Intelligence (MICAI) is the name of an annual conference covering all areas of Artificial Intelligence (AI), held in Mexico. The first MICAI conference was held in 2000. The conference is attended every year by about two hundred of AI researchers and PhD students and 500−1000 local graduate students.
MICAI is a high-level peer-reviewed international conference covering all areas of Artificial Intelligence. All editions of MICAI have been published in Springer Springer LNAI (N 1793, 2313, 2972, 3789, 4293, 4827, 5317, 5845, 6437–6438). Recent MICAI events (2006, 2007, 2008, 2009, and 2010) received over 300 submissions from over 40 countries each. The conference's scientific program includes keynote lectures, paper presentations, tutorials, panels, posters, and workshops. MICAI is organized by the Mexican Society for Artificial Intelligence (SMIA) in cooperation with various national institutions.[ citation needed ]
Their topics of interest focus on artificial intelligence, its potential applications, and related topics.[ citation needed ]
In the table below, the figures for the number of accepted papers and acceptance rate refer to the main proceedings volume and do not include supplemental proceedings volumes. The number of countries corresponds to submissions, not to accepted papers.
Year | City | Website | Proceedings | Submissions | Countries | Accepted | Acceptance rate |
---|---|---|---|---|---|---|---|
2000 | Acapulco | [ permanent dead link ] | [1] | 163 | 17 | 60 | 37% |
2002 | Mérida | [ permanent dead link ] | [2] | 85 | 17 | 56 | 66% |
2004 | Mexico | [ permanent dead link ] | [3] | 254 | 19 | 94 | 38.2% |
2005 | Monterrey | [4] | 423 | 43 | 120 | 28% | |
2006 | Apizaco | [5] [6] | 447 | 42 | 123 | 26% | |
2007 | Aguascalientes | [7] [8] | 485 | 31 | 115 | 23.9% | |
2008 | Atizapán de Zaragoza | [9] [10] | 363 | 43 | 94 | 25.9% | |
2009 | Guanajuato | [11] [12] | 215 | 21 | 63 | 29.3% | |
2010 | Pachuca | [13] [14] [15] | 301 | 34 | 126 | 42% | |
2011 | Puebla | [16] [17] [18] | 348 | 40 | 96 | 27.7% | |
2012 | San Luis Potosí | [19] [20] [21] | 224 | 28 | 77 | 34.3% | |
2013 | Mexico City | [22] [23] [24] | 284 | 45 | 85 | 29.9% | |
2014 | Tuxtla Gutiérrez, Chiapas | 350 | 46 | 87 | 24.8% |
The following persons were honored by being selected by the organizers as keynote speakers or program chairs:
The authors of the following papers received the Best Paper Award:
Year | Place | Authors | Country | Paper |
---|---|---|---|---|
2000 | - | Joby Varghese and Snehasis Mukhopadhyay | India | Multi-agent Adaptive Dynamic Programming |
- | Mauricio Osorio | Mexico | ||
- | G. E. A. P. A. Batista, A. Carvalho, and M. C. Monard | Applying One-sided Selection to Unbalanced Datasets | ||
- | Alexander Gelbukh, Grigori Sidorov, and Igor A. Bolshakov | Mexico | Coherence Maintenance in Man-Machine Dialogue with Ellipsis (in the section of local papers) | |
- | Alexander Gelbukh | Mexico | A Data Structure for Prefix Search under Access Locality Requirements and Its Application to Spelling Correction (in the section of local papers) | |
- | Homero V. Rios, Emilio Aguirre et al. | Facial Expression Recognition and Modeling for Virtual Intelligent Tutoring Systems | ||
- | Armando García-Rodríguez, Ramón Martín Rodríguez-Dagnino, and Christos Douligeris | Extending the prediction horizon in dynamic bandwidth allocation for VBR video transport | ||
- | ||||
- | ||||
2002 | 1 | |||
2 | ||||
3 | ||||
2003 | 1 | Nestor Velasco Bermeo, Miguel González Mendoza, Alexander García Castro and Irais Heras Dueñas. | Mexico | Towards the creation of Semantic Models based on Computer-Aided Designs |
2004 | 1 | |||
2 | ||||
3 | ||||
2005 [4] | 1 | Rafael Murrieta Cid, Alejandro Sarmiento, Teja Muppirala, Seth Hutchinson, Raul Monroy, Moises Alencastre Miranda, Lourdes Muñoz Gómez, and Ricardo Swain | A framework for Reactive Motion and Sensing Planning: a Crititcal Events-Based Approach | |
2 | Patrice Delmas, Georgy Gimel'farb, Jiang Liu, and John Morris | A Noise-Driven Paradigm for Solving the Stereo Correspondence Problem | ||
3 | Jinghui Xiao, Bingquan Liu, Xiaolong Wang, and Bing Li | A Similarity-Based Approach to Data Sparseness Problem of the Chinese Language Modeling | ||
2006 [5] | 1 | Luz Abril Torres-Méndez and Gregory Dudek | Statistics of Visual and Partial Depth Data for Mobile Robot Environment Modeling | |
2 | Antonio Camarena-Ibarrola and Edgar Chávez | On Musical Performances Identification, Entropy and String Matching | ||
3 | Eduardo Rodriguez-Tello, Jin-Kao Hao, and Jose Torres-Jimenez | A Refined Evaluation Function for the MinLA Problem | ||
2007 [7] | 1 | Mu Xiangyang, Zhang Taiyi and Zhou Yaatong | China | Scaling Kernels: A New Least Squares Support Vector Machine Kernel for Approximation |
2 | Jean Bernard Hayet and Justus Piater | Mexico / Belgium | On-line Rectification of Sport Sequences with Moving Cameras | |
3 | Marcin Radlak and Ryszard Klempous | UK / Poland | SELDI-TOF-MS Pattern Analysis for Cancer Detection as a Base for Diagnostic Software | |
2008 [9] | 1 | Philippe Fournier-Viger, Roger Nkambou, and Engelbert Mephu Nguifo | Canada / France | A Knowledge Discovery Framework for Learning Task Models from User Interactions in Intelligent Tutoring Systems |
2 | Yulia Ledeneva | Mexico | Effect of Preprocessing on Extractive Summarization with Maximal Frequent Sequences | |
3 | Giovanni Lizárraga, Arturo Hernández and Salvador Botello | Mexico | A Set of Test Cases for Performance Measures in Multiobjective Optimization | |
2009 | 1 | |||
2 | ||||
3 | ||||
2010 | 1 | Olga Kolesnikova and Alexander Gelbukh | Mexico | Supervised Machine Learning for Predicting the Meaning of Verb-Noun Combinations in Spanish |
2 | Omar Montano-Rivas, Roy McCasland, Lucas Dixon and Alan Bundy | UK | Scheme-based Synthesis of Inductive Theories | |
3 | ||||
2011 [16] | 1 | Sergio Jimenez Vargas and Alexander Gelbukh | Colombia / Mexico | SC Spectra: A New Soft Cardinality Approximation for Text Comparison |
2 | Dmitrijs Rutko | Latvia | Fuzzified Tree Search in Teal Domain Games | |
3 | Francisco Madrigal, Jean-Bernard Hayet, and Mariano Rivera | Mexico | Multiple Target Tracking with Motion Priors | |
2012 [19] | 1 | Nestor Velasco Bermeo, Miguel González Mendoza, Alexander García Castro, Irais Heras Dueñas | Mexico / USA | Toward the Creation of Semantic Models Based on Computer-Aided Designs |
2 | Hillel Romero-Monsivais, Eduardo Rodriguez-Tello, Gabriel Ramírez | Mexico | A New Branch and Bound Algorithm for the Cyclic Bandwidth Problem | |
3 | Gonzalo Nápoles, Isel Grau, Maikel León, Ricardo Grau | Cuba | Modelling, Aggregation, and Simulation of a Dynamic Biological System Through Fuzzy Cognitive Maps | |
2013 [22] | 1 | Sergio Rogelio Tinoco-Martínez, Felix Calderon, Carlos Lara-Alvarez, Jaime Carranza-Madrigal | Mexico | A Bayesian and Minimum Variance Technique for Arterial Lumen Segmentation in Ultrasound Imaging |
2 | Angel Kuri-Morales, Edwin Aldana-Bobadilla | Mexico | The Best Genetic Algorithm I. A Comparative Study of Structurally Different Genetic Algorithms | |
Angel Kuri-Morales, Edwin Aldana Bobadilla, Ignacio López-Peña | Mexico | The Best Genetic Algorithm II. A Comparative Study of Structurally Different Genetic Algorithms | ||
3 | Melanie Neunerdt, Michael Reyer, Rudolf Mathar | Germany | A POS Tagger for Social Media Texts Trained on Web Comments |
Inductive logic programming (ILP) is a subfield of symbolic artificial intelligence which uses logic programming as a uniform representation for examples, background knowledge and hypotheses. The term "inductive" here refers to philosophical rather than mathematical induction. Given an encoding of the known background knowledge and a set of examples represented as a logical database of facts, an ILP system will derive a hypothesised logic program which entails all the positive and none of the negative examples.
In computational intelligence (CI), an evolutionary algorithm (EA) is a subset of evolutionary computation, a generic population-based metaheuristic optimization algorithm. An EA uses mechanisms inspired by biological evolution, such as reproduction, mutation, recombination, and selection. Candidate solutions to the optimization problem play the role of individuals in a population, and the fitness function determines the quality of the solutions. Evolution of the population then takes place after the repeated application of the above operators.
In cryptography, the Tiny Encryption Algorithm (TEA) is a block cipher notable for its simplicity of description and implementation, typically a few lines of code. It was designed by David Wheeler and Roger Needham of the Cambridge Computer Laboratory; it was first presented at the Fast Software Encryption workshop in Leuven in 1994, and first published in the proceedings of that workshop.
Yacas is a general-purpose computer algebra system. The name is an acronym for Yet Another Computer Algebra System.
In social sciences and other domains, representative sequences are whole sequences that best characterize or summarize a set of sequences. In bioinformatics, representative sequences also designate substrings of a sequence that characterize the sequence.
Provable security refers to any type or level of computer security that can be proved. It is used in different ways by different fields.
Secure two-party computation (2PC) a.k.a. Secure function evaluation is sub-problem of secure multi-party computation (MPC) that has received special attention by researchers because of its close relation to many cryptographic tasks. The goal of 2PC is to create a generic protocol that allows two parties to jointly compute an arbitrary function on their inputs without sharing the value of their inputs with the opposing party. One of the most well known examples of 2PC is Yao's Millionaires' problem, in which two parties, Alice and Bob, are millionaires who wish to determine who is wealthier without revealing their wealth. Formally, Alice has wealth , Bob has wealth , and they wish to compute without revealing the values or .
Rigi is an interactive graph editor tool for software reverse engineering using the white box method, i.e. necessitating source code, thus it is mainly aimed at program comprehension. Rigi is distributed by its main author, Hausi A. Müller and the Rigi research group at the University of Victoria.
Hypercube-based NEAT, or HyperNEAT, is a generative encoding that evolves artificial neural networks (ANNs) with the principles of the widely used NeuroEvolution of Augmented Topologies (NEAT) algorithm developed by Kenneth Stanley. It is a novel technique for evolving large-scale neural networks using the geometric regularities of the task domain. It uses Compositional Pattern Producing Networks (CPPNs), which are used to generate the images for Picbreeder.orgArchived 2011-07-25 at the Wayback Machine and shapes for EndlessForms.comArchived 2018-11-14 at the Wayback Machine. HyperNEAT has recently been extended to also evolve plastic ANNs and to evolve the location of every neuron in the network.
ProVerif is a software tool for automated reasoning about the security properties of cryptographic protocols. The tool has been developed by Bruno Blanchet and others.
CICLing is an annual conference on computational linguistics (CL) and natural language processing (NLP). The first CICLing conference was held in 2000 in Mexico City. The conference is attended by one to two hundred of NLP and CL researchers and students every year. As of 2017, it is ranked within the top 20 sources on computational linguistics by Google Scholar. Past CICLing conferences have been held in Mexico, Korea, Israel, Romania, Japan, India, Greece, Nepal, Egypt, Turkey, Hungary, and Vietnam; the 2019 event was held in France.
In cryptography, the white-box model refers to an extreme attack scenario, in which an adversary has full unrestricted access to a cryptographic implementation, most commonly of a block cipher such as the Advanced Encryption Standard (AES). A variety of security goals may be posed, the most fundamental being "unbreakability", requiring that any (bounded) attacker should not be able to extract the secret key hardcoded in the implementation, while at the same time the implementation must be fully functional. In contrast, the black-box model only provides an oracle access to the analyzed cryptographic primitive. There is also a model in-between, the so-called gray-box model, which corresponds to additional information leakage from the implementation, more commonly referred to as side-channel leakage.
Inductive programming (IP) is a special area of automatic programming, covering research from artificial intelligence and programming, which addresses learning of typically declarative and often recursive programs from incomplete specifications, such as input/output examples or constraints.
Dmitry Khovratovich is a Russian cryptographer, currently a Lead Cryptographer for the Dusk Network, researcher for the Ethereum Foundation, and member of the International Association for Cryptologic Research.
Brent R. Waters is an American computer scientist, specializing in cryptography and computer security. He is currently a professor of Computer Science at the University of Texas at Austin.
This is a chronological table of metaheuristic algorithms that only contains fundamental computational intelligence algorithms. Hybrid algorithms and multi-objective algorithms are not listed in the table below.
Orr Dunkelman is an Israeli cryptographer and cryptanalyst, currently a professor at the University of Haifa Computer Science department. Dunkelman is a co-director of the Center for Cyber Law & Privacy at the University of Haifa and a co-founder of Privacy Israel, an Israeli NGO for promoting privacy in Israel.
Hartmut Ehrig was a German computer scientist and professor of theoretical computer science and formal specification. He was a pioneer in algebraic specification of abstract data types, and in graph grammars.
The Lincoln Adaptable Real-time Information Assurance Testbed (LARIAT) is a physical computing platform developed by the MIT Lincoln Laboratory as a testbed for network security applications. Use of the platform is restricted to the United States military, though some academic organizations can also use the platform under certain conditions.
Nathalie Japkowicz is a Canadian computer scientist specializing in machine learning. She is a professor and department chair of computer science at the American University College of Arts and Sciences.