Ponencias (Ciencias de la Computación e Inteligencia Artificial)

URI permanente para esta colecciónhttps://hdl.handle.net/11441/11304

Examinar

Mostrando 1 - 20 de 449

Prototyping Logic-Based AI Services with LogicUS
(AAAI-23, 2023) Ramos González, Víctor; Borrego Díaz, Joaquín; Sancho Caparrini, Fernando; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
for AI and Computer Science. The availability of software tools to support the realization of such studies (both as powerful and versatile prototyping tools and as teaching tools) has become a necessity. Intending to contribute to this field, we present a tool that allows the unification of different logic tasks, focused on Computer Logic but adaptable to the treatment in several subfields, contexts, and abstraction levels (LogicUS-LIB, LogicUS-NB, LogicUS-GUI). The tool provides a sound framework for two activity fields. On the one hand, in the topic of logic-based systems research, prototyping is facilitated in a relatively fast, simple, and highly adaptable way. On the other hand, in Education, by allowing the student abstract from low-level execution of algorithms whilst preserving the conceptual structures and procedural methodologies underlying the logical foundations.
Modeling lexicon emergence as concept emergence in networks
(Springer Nature, 2016) Galán Páez, Juan; Borrego Díaz, Joaquín; Aranda-Corral, Gonzalo A.; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Junta de Andalucía; Ministerio de Economía y Competitividad (MINECO). España
Amodel for lexicon emergence in social networks is presented. The model is based on a modified version of classic Naming Games, where agents’ knowledge is represented by means of formal contexts. That way it is possible to represent the effect interactions have on individual knowledge as well as the dynamics of global knowledge in the network.
Estimating re-identification risk by means of formal conceptualization
(Springer Nature, 2022) Aranda-Corral, G. A.; Borrego Díaz, Joaquín; Galán Páez, Juan; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Risk-based methodologies for de-identification provide solutions to ensure privacy. These are based on the availability of sound metrics to estimate the risk of re-identification. Two issues associated with classical risk estimation are, on the one hand, the adequacy of the metric and, on the other hand, its static nature -that is, any change in the database to reduce the risk could imply recomputing the metrics, for example, by removing compromised data (data with a high probability of re-identification). This paper presents a semantic-based risk estimation -by means of Formal Concept Analysis- that allows to estimate a priori the risk of compromised data deletion.
Dynamic risk assessment in complex projects
(Asociación española de dirección e ingeniería de proyectos (AEIPRO), 2024-07) Álvarez Espada, Juan Manuel; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
The risk study, conducted by a project manager, especially in predictive approaches and depending on their experience, involves a thorough examination of risks in the tasks outlined in the Work Breakdown Structure (WBS). Risk assessment is based on correlating the likelihood of the risk occurring with the severity of its damage or benefit. However, in complex projects, project managers face broad, diverse, and often unknown risks. Technical aspects under development, involvement of different technologies, some of them innovative, multiple cultures, numerous stakeholders, etc., may fall outside the scope of a conventional risk assessment by the project manager. Probabilistic analysis has traditionally formed the basis for risk evaluation in conventional or complicated projects, which were the prevalent approaches until recently. Nevertheless, new approaches for managing complex projects require a different risk assessment: Bayesian networks or fuzzy cognitive maps are two ways to evaluate risks, but not the only ones.
Recovering of 24 May Avenue in the Historical Center of Quito
(Fidetia, 2016) Medina, Iván; Almagro Blanco, Pedro; Regalado Bolaños, Elizabeth; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
increased until now. At the beggining this investements were oriented to religious centers and in 1987 were focused on recovering the historical center from a hard earthquake. The architechtonical interventions were performed mostly in the nuclear part of the historical center (Plaza de la Independencia and religious buildings), promoting the tourism mostly to this nuclear zone. One of the big problems that Quito is facing now is the recovering of historical zones that, although are not in the nuclear zone of the historical center are considered cultural heritage. Emblematic zones under this situation are San Roque, La Libertad, La Marin and 24 May Avenue. 24 May Avenue is the most representative zone of this group because is next to the nuclear historical center and there were architectonical investments to prepare this zone for the tourism. Despite efforts done by local and central goverments tourists are not visiting the 24 May Avenue. The main problem that avoid tourism to visit this zone is prostitution, this zone is a traditional place for the prostitutes to work, this fact is connected with the proliferation of "negative commerces" that host prostitution services. In the area under study, many people has created hotels oriented to host tourism, but after a while they realized that there is no enough tourism in the area to mantain the service and they decide to become their hotels "negative commerces" in order to host prostitution services, this behaviour generates a vicious circle that avoids tourists to visit the 24 May Avenue.
An evolutionary algorithm for optimizing the target ordering in Ensemble of Regressor Chains
(IEEE, 2017) Moyano Murillo, José María; Gibaja, E.L.; Ventura, S.; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Ministerio de Economía y Competitividad (MINECO). España; Ministerio de Educación. España
In this article we present an evolutionary algorithm for the optimization of sequences of targets for the multitarget regression algorithm Ensemble of Regressor Chains. This algorithm selects several random sequences or chains of targets where to predict each target, the values of previous targets in the chain are included as features, considering in this way the relationship among them. Under the assumption that a target may be better predicted if it is highly correlated with the targets which were included as feature, our proposal, called CCOERC, looks for chains where each target is highly correlated with previous targets in the chain. Several methods for the combination of predictions in the ensemble and for the selection of the chains which forms the ensemble are also proposed. CCOERC is compared to other state-of-the-art algorithms in multitarget regression, presenting statistically better performance than them.
Lipschitz determinacy and Arithmetic Transfinite Recursion
(Springer, 2024-07-02) Cordón Franco, Andrés; Lara Martín, Francisco Félix; Loureiro, J.S.; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC137: Logica, Computacion e Ingenieria del Conocimiento
We investigate the logical strength of Lipschitz determinacy, and the tightly related Semi-Linear Ordering principle, for the first levels of the Borel hierarchy in the Baire space. As a result, we obtain characterizations of ATR0 in terms of these determinacy principles.
P Systems with Membrane Creation and Rule Input
(Fénix Editora, 2005) Gutiérrez Naranjo, Miguel Ángel; Pérez Jiménez, Mario de Jesús; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
When a uniform family of recognizer P systems is designed to solve a problem, the data of a concrete instance of the problem is usually provided via a multiset which is placed in the so-called input membrane. In this paper we present a new definition for recognizer P systems, called with rule input, where the data of the instance is provided via a set of rules which are introduced in the system at the beginning of the computation. We also discuss a new semantic for P systems with membrane creation and, as an example, a uniform family of recognizer P systems with rule input which solves the Subset Sum problem is provided.
Converting Integer Numbers from Binary to Unary Notation with P Systems
(Fénix Editora, 2005) Gutiérrez Naranjo, Miguel Ángel; Leporati, Alberto; Zandron, Claudio; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Current P systems which solve NP–complete numerical problems represent instances in unary notation. In classical complexity theory, based upon Turing machines, switching from binary to unary encoded instances gen erally corresponds to simplify the problem. In this paper we show that this does not occur when working with P systems. Namely, we propose a simple method to encode binary numbers using multisets, and a family of P systems which transforms such multisets into the usual unary notation
Multidimensional Sevilla carpets Associated with P Systems
(Fénix Editora, 2005) Gutiérrez Naranjo, Miguel Ángel; Pérez Jiménez, Mario de Jesús; Riscos Núñez, Agustín; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
In this paper we address the problem of describing the complexity of the evolution of a P system. This is especially difficult in the case of P systems where the number of membranes in creases along the computation, via division or creation of membranes. In these cases the number of steps of a computation is not sufficient to evaluate the complexity. Sevilla Carpets were introduced in [1℄, and they describe the space-time complexity of P systems. Based on them, we de ne a four-dimensional manifold whih can be used to compare evolutions of P systems.
Multidimensional descriptional complexity of P systems
(Univ. degli Studi di Milano, 2005) Gutiérrez Naranjo, Miguel Ángel; Pérez Jiménez, Mario de Jesús; Riscos Núñez, Agustín; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Membrane Computing is a branch of Natural Computing which starts from the assumption that the processes taking place in the compartmental structure of a living cell can be interpreted as computations. The description of the complexity of the computations of the membrane devices (P systems) is a hard task which goes beyond the usual parameters of time and space. This is especially hard in the case of P systems where the number of membranes increases along the computation, via division or creation of membranes. In this paper we show that a four-dimensional carpet can be a useful tool to describe and compare evolutions of P systems, even in such cases.
A new way to obtain homology groups in Binary 2D images using membrane computing
(Universidad de Santiago de Compostela, 2010) Díaz Pernil, Daniel; Gutiérrez Naranjo, Miguel Ángel; Real Jurado, Pedro; Sánchez Canales, Vanesa; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Membrane Computing is a computational model inspired in the structure and function of living cells and tissues. In this paper we use Membrane Computing techniques to solve the Homology Groups of Binary 2D Image (HGB2I) Problem. This is a classical problem in Homology Theory which tries to calculate the number of connected components and the representative curves of the holes of these components of a given binary 2D image. To this aim, we use a family of P systems whih solves all the instances of the problem in the framework of Tissue-like P systems with catalysts.
Studying the Chlorophyll Fluorescence in Cyanobacteria with Membrane Computing Techniques
(Research Group of Natural Computing, 2013) Ardelean, Ioan I.; Díaz Pernil, Daniel; Gutiérrez Naranjo, Miguel Ángel; Peña Cantillana, Francisco; Sarchizian, Iris; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
In this paper, we report a pioneer study of the decrease in chlorophyll fluorescence produced by the reduction of MTT (a dimethyl thiazolyl diphenyl tetrazolium salt) monitored using an epifluorescence microscope coupled to automate image analysis in the framework of P systems. Such analysis has been performed by a family of tissue P systems working on the images as data input.
The metric-aware kernel-width choice for LIME
(CEUR-WS, 2023) Barrera Vicent, Aurelio; Paluzo Hidalgo, Eduardo; Gutiérrez Naranjo, Miguel Ángel; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Local Interpretable Model-Agnostic Explanations (LIME) are a well-known approach to provide local interpretability to Machine Learning models. LIME uses an exponential smoothing kernel based on the kernel width value, which defines the width of the local neighbourhood. In this paper, we study the influence of the distances for these local explanations, and we explore the choice of kernel width to guarantee a fair performance comparison between the distances.
A stacked deep convolutional neural network to predict the remaining useful life of a turbofan engine
(PHM Society, 2021) Solís Martín, David; Galán Páez, Juan; Borrego Díaz, Joaquín; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Agencia Estatal de Investigación. España; Universidad de Sevilla. TIC-137: Lógica, Computación e Ingeniería del Conocimiento
his paper presents the data-driven techniques and method ologies used to predict the remaining useful life (RUL) of a fleet of aircraft engines that can suffer failures of diverse nature. The solution presented is based on two Deep Con volutional Neural Networks (DCNN) stacked in two levels. The first DCNN is used to extract a low-dimensional feature vector using the normalized raw data as input. The second DCNN ingests a list of vectors taken from the former DCNN and estimates the RUL. Model selection was carried out by means of Bayesian optimization using a repeated random subsampling validation approach. The proposed methodol ogy was ranked in the third place of the 2021 PHM Confer ence Data Challenge.
Building knowledge layers and networks from urban digital information
(Universitat Politécnica de Catalunya, 2013) Borrego Díaz, Joaquín; Galán Páez, Juan; Miguel Rodríguez, Jaime de; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
The understanding and management of complex digital information on cities need the use of tools providing experts with new insights about the knowledge hidden within this great amount of data. In this paper a methodology to provide such a kind of knowledge is presented. This methodology is based on Formal Concept Analysis and allows visualizing abstract concepts that can be interpreted (and hence discovered) by city researchers.
Atlas de terapias urbanas basado en casos reales
(AMPS. Universidad de Sevilla, 2015) Rodríguez Estévez, Sergio; Mendoza Muro, Salas; Fernández-Valderrama, Luz; Ureta Muñoz, Carolina; Rovira Caballero, Ignacio; Duarte Sastre, José Antonio; Aranda Corral, Gonzalo A.; Pazos-García, Francisco; Fernández Perea, Macarena; López Casado, David; Martín-Mariscal, Amanda; Universidad de Sevilla. Departamento de Proyectos Arquitectónicos; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. Departamento de Geografía Humana; Universidad de Sevilla. Departamento de Ingeniería del Diseño; Universidad de Sevilla. HUM958: In-Gentes [investigación en Generación de Territorios]; Universidad de Sevilla. TIC137: Lógica, Computación e Ingeniería del Conocimiento; Universidad de Sevilla. HUM177: Geografía y Desarrollo Regional y Urbano
El “Atlas de terapias urbanas1 ” se propone como una herramienta encaminada a facilitar la identificación y evaluación de mejoras urbanas adaptadas a las vocaciones de los diferentes entornos. El objeto de su creación está encaminado a servir en la toma de decisiones inteligentes a las instituciones y actores involucrados en la revitalización de los barrios andaluces. Proponemos una herramienta de mediación, que no solo se base en deficiencias barriales sino también en potencialidades; no solo en los deseos de la ciudadanía, sino también en las vocaciones de los entornos. El presente artículo trata de compendiar, de forma resumida, los avances y documentos internos desarrollados hasta la fecha por los autores que conforman esta investigación. En él se explican los conceptos y procesos fundamentales sobre los que se asienta el diseño de la herramienta buscada.
P Systems as a Modeling Framework for Molecular Systems Biology
(Huazhong University of Science and Technology, 2012) Romero Campero, Francisco José; Pérez Jiménez, Mario de Jesús; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193 : Computación Natural
The P versus NP problem: Unconventional insights from Membrane Computing
(IMCS: International Membrane Computing Society, 2013) Pérez Jiménez, Mario de Jesús; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193 : Computación Natural
: The P ?=NP question is one of the outstanding open problems in theoretical computer science. The relevance of this question is not only the inherent pleasure of solving a mathematical problem, since an answer to it would provide information of high economical interest. On the one hand, a negative answer to this question would confirm that the majority of current cryptographic systems are secure from a practical point of view. On the other hand, a positive answer would not only show the uncertainty about the secureness of these systems, but also this kind of answer is expected to come together with a general procedure such that it will provide a deterministic algorithm solving any NP-complete problem in polynomial time. In this talk, new approaches/tools to attack the previous problem are given by using Membrane Computing, a branch of Natural Computing aiming to abstract computing models from the structure and functioning of the living cell as well as from the organization of cells in tissues, organs, and other higher order structures. The devices of this paradigm constitute models for distributed, parallel and non-deterministic computing. Specifically, different borderlines between efficiency and non-efficiency are shown in terms of syntactical ingredients of cell-like and tissue like membrane systems. Each of them provide appealing characterizations of the P̸=NP conjecture within the framework of this bioinspired and unconventional computing model.
Editorial. Foreword. Special Issue: A selection of papers from the 10th Brainstorming Week on Membrane Computing
(Taylor and Francis, 2013) Paun, Gheorghe; Pérez Jiménez, Mario de Jesús; Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial; Universidad de Sevilla. TIC193 : Computación Natural

Examinar

Envíos recientes