Artículos de revista DAC - AKS Aldizkari artikuluak
Permanent URI for this collection
Browse
Browsing Artículos de revista DAC - AKS Aldizkari artikuluak by Author "Automática y Computación"
Now showing 1 - 20 of 48
Results Per Page
Sort Options
Publication Open Access Analysis and stochastic characterization of TCP flows(Springer, 2000) Aracil Rico, Javier; Morató Osés, Daniel; Izal Azcárate, Mikel; Automática y Computación; Automatika eta KonputazioaSince the most Internet services use TCP as a transport protocol there is a growing interest in the characterization of TCP flows. However, the flow characteristics depend on a large number of factors, due to the complexity of the TCP. As a result, the TCS characteristics are normally studies by means of simulations or controlled network setups. In this paper we propose a TCP characterization based on a generic model based of stochastic flow with burstiness and throughput (((σ, ρ)-constraints), which is useful in order to characterize flows in ATM and other flow-switched networks. The model is obtained through extensive analysis of a real traffic trace, comprising an approximate number of 1,500 hosts and 1,700,000 TCP connections. The results suggests that TCP connections in the wide area Internet have low throughput while the packet bursts do not suffer an exponential increase, as indicated by the slow-start behavior. On the other hand, the impact of the connection establishment phase is striking. We note that the throughput of the TCP flow is approximately half the throughput which is obtained in the data transfer phase, namely after the connection has been established.Publication Open Access Application of the L-fuzzy concept analysis in the morphological image and signal processing(Springer International Publishing, 2014) Alcalde, Cristina; Burusco Juandeaburre, Ana; Fuentes González, Ramón; Automática y Computación; Automatika eta Konputazioa; Universidad Pública de Navarra / Nafarroako Unibertsitate PublikoaIn this work we are going to set up a new relationship between the L-fuzzy Concept Analysis and the Fuzzy Mathematical Morphology. Specifically we prove that the problem of finding fuzzy images or signals that remain invariant under a fuzzy morphological opening or under a fuzzy morphological closing, is equal to the problem of finding the L-fuzzy concepts of some L-fuzzy context. Moreover, since the Formal Concept Analysis and the Mathematical Morphology are the particular cases of the fuzzy ones, the showed result has also an interpretation for binary images or signals.Publication Open Access Application of two different methods for extending lattice-valued restricted equivalence functions used for constructing similarity measures on L-fuzzy sets(Elsevier, 2018) Palmeira, Eduardo S.; Bedregal, Benjamin; Bustince Sola, Humberto; Paternain Dallo, Daniel; Miguel Turullols, Laura de; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación; Universidad Pública de Navarra / Nafarroako Unibertsitate PublikoaBased on previous investigations, we have proposed two different methods to extend lattice-valued fuzzy connectives (t-norms, t-conorms, negations and implications) and other related operators, considering a generalized notion of sublattices. Taking into account the results obtained and seeking to analyze the behavior of both extension methods in face of fuzzy operators related to image processing, we have applied these methods so as to extend restricted equivalence functions, restricted dissimilarity functions and Ee,N-normal functions. We also generalize the concepts of similarity measure, distance measure and entropy measure for L-fuzzy sets constructing them via restricted equivalence functions, restricted dissimilarity functions and Ee,N-normal functionsPublication Open Access BioBuilder as a database development and functional annotation platform for proteins(BioMed Central, 2004) Navarro, J. Daniel; Talreja, Naveen; Peri, Suraj; Vrushabendra, B. M.; Rashmi, B. P.; Padma, N.; Surendranath, Vineeth; Jonnalagadda, Chandra Kiran; Kousthub, P. S.; Deshpande, Nandan; Shanker, K.; Pandey, Akhilesh; Automática y Computación; Automatika eta KonputazioaBackground: The explosion in biological information creates the need for databases that are easy to develop, easy to maintain and can be easily manipulated by annotators who are most likely to be biologists. However, deployment of scalable and extensible databases is not an easy task and generally requires substantial expertise in database development. Results: BioBuilder is a Zope-based software tool that was developed to facilitate intuitive creation of protein databases. Protein data can be entered and annotated through web forms along with the flexibility to add customized annotation features to protein entries. A built-in review system permits a global team of scientists to coordinate their annotation efforts. We have already used BioBuilder to develop Human Protein Reference Database http://www.hprd.org, a comprehensive annotated repository of the human proteome. The data can be exported in the extensible markup language (XML) format, which is rapidly becoming as the standard format for data exchange. Conclusions: As the proteomic data for several organisms begins to accumulate, BioBuilder will prove to be an invaluable platform for functional annotation and development of customizable protein centric databases. BioBuilder is open source and is available under the terms of LGPLPublication Open Access Consensus image method for unknown noise removal(Elsevier, 2014) González Jaime, Luis; Kerre, Etienne E.; Nachtegael, Mike; Bustince Sola, Humberto; Automática y Computación; Automatika eta KonputazioaNoise removal has been, and it is nowadays, an important task in computer vision. Usually, it is a previous task preceding other tasks, as segmentation or reconstruction. However, for most existing denoising algorithms the noise model has to be known in advance. In this paper, we introduce a new approach based on consensus to deal with unknown noise models. To do this, different filtered images are obtained, then combined using multifuzzy sets and averaging aggregation functions. The final decision is made by using a penalty function to deliver the compromised image. Results show that this approach is consistent and provides a good compromise between filters.Publication Open Access Construction of admissible linear orders for interval-valued Atanassov intuitionistic fuzzy sets with an application to decision making(Elsevier, 2015) Miguel Turullols, Laura de; Bustince Sola, Humberto; Fernández Fernández, Francisco Javier; Induráin Eraso, Esteban; Kolesárová, Anna; Mesiar, Radko; Matemáticas; Matematika; Automática y Computación; Automatika eta Konputazioa; Universidad Pública de Navarra / Nafarroako Unibertsitate PublikoaIn this work we introduce a method for constructing linear orders between pairs of intervals by using aggregation functions. We adapt this method to the case of interval-valued Atanassov intuitionistic fuzzy sets and we apply these sets and the considered orders to a decision making problem.Publication Open Access Convolution lattices(Elsevier, 2018) Miguel Turullols, Laura de; Bustince Sola, Humberto; Baets, Bernard de; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y ComputaciónWe propose two convolution operations on the set of functions between two bounded lattices and investigate the algebraic structure they constitute, in particular the lattice laws they satisfy. Each of these laws requires the restriction to a specific subset of functions, such as normal, idempotent or convex functions. Combining all individual results, we identify the maximal subsets of functions resulting in a bounded lattice, and show this result to be equivalent to the distributivity of the lattice acting as domain of the functions. Furthermore, these lattices turn out to be distributive as well. Additionally, we show that for the larger subset of idempotent functions, although not satisfying the absorption laws, the convolution operations satisfy the Birkhoff equation.Publication Open Access d-XC integrals: on the generalization of the expanded form of the Choquet integral by restricted dissimilarity functions and their applications(IEEE, 2022) Wieczynski, Jonata; Fumanal Idocin, Javier; Lucca, Giancarlo; Borges, Eduardo N.; Da Cruz Asmus, Tiago; Emmendorfer, Leonardo R.; Bustince Sola, Humberto; Pereira Dimuro, Graçaliz; Automática y Computación; Automatika eta Konputazioa; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaRestricted dissimilarity functions (RDFs) were introduced to overcome problems resulting from the adoption of the standard difference. Based on those RDFs, Bustince et al. introduced a generalization of the Choquet integral (CI), called d-Choquet integral, where the authors replaced standard differences with RDFs, providing interesting theoretical results. Motivated by such worthy properties, joint with the excellent performance in applications of other generalizations of the CI (using its expanded form, mainly), this paper introduces a generalization of the expanded form of the standard Choquet integral (X-CI) based on RDFs, which we named d-XC integrals. We present not only relevant theoretical results but also two examples of applications. We apply d-XC integrals in two problems in decision making, namely a supplier selection problem (which is a multi-criteria decision making problem) and a classification problem in signal processing, based on motor-imagery brain-computer interface (MI-BCI). We found that two d-XC integrals provided better results when compared to the original CI in the supplier selection problem. Besides that, one of the d-XC integrals performed better than any previous MI-BCI results obtained with this framework in the considered signal processing problem.Publication Open Access A decision tree based approach with sampling techniques to predict the survival status of poly-trauma patients(Atlantis Press, 2017) Sanz Delgado, José Antonio; Fernández Fernández, Francisco Javier; Bustince Sola, Humberto; Gradín Purroy, Carlos; Belzunegui Otano, Tomás; Automatika eta Konputazioa; Osasun Zientziak; Institute of Smart Cities - ISC; Automática y Computación; Ciencias de la Salud; Gobierno de Navarra / Nafarroako Gobernua, PI-019/11Survival prediction of poly-trauma patients measure the quality of emergency services by comparing their predictions with the real outcomes. The aim of this paper is to tackle this problem applying C4.5 since it achieves accurate results and it provides interpretable models. Furthermore, we use sampling techniques because, among the 378 patients treated at the Hospital of Navarre, the number of survivals excels that of deaths. Logistic regressions are used in the comparison, since they are an standard in this domain.Publication Open Access Delay-throughput curves for timer-based OBS burstifiers with light load(IEEE, 2006) Izal Azcárate, Mikel; Aracil Rico, Javier; Morató Osés, Daniel; Magaña Lizarrondo, Eduardo; Automática y Computación; Automatika eta KonputazioaThe OBS burstifier delay-throughput curves are analyzed in this paper. The burstifier incorporates a timer-based scheme with minimum burst size, i. e., bursts are subject to padding in light-load scenarios. Precisely, due to this padding effect, the burstifier normalized throughput may not be equal to unity. Conversely, in a high-load scenario, padding will seldom occur. For the interesting light-load scenario, the throughput delay curves are derived and the obtained results are assessed against those obtained by trace-driven simulation. The influence of long-range dependence and instantaneous variability is analyzed to conclude that there is a threshold timeout value that makes the throughput curves flatten out to unity. This result motivates the introduction of adaptive burstification algorithms, that provide a timeout value that minimizes delay, yet keeping the throughput very close to unity. The dependence of such optimum timeout value with traffic long-range dependence and instantaneous burstiness is discussed. Finally, three different adaptive timeout algorithms are proposed, that tradeoff complexity versus accuracy.Publication Open Access Descubrimiento de conocimiento en bases de datos utilizando técnicas de morfología matemática borrosa(Centro de Información Tecnológica, 2007) Frago Paños, Noé Natalio; Fuentes González, Ramón; Automática y Computación; Automatika eta KonputazioaEn este artículo se analiza el efecto, la utilidad y la interpretación de los filtros asociados a la Morfología Matemática Borrosa en procesos de Descubrimiento de Conocimiento en Bases de Datos. En particular se estudian los operadores morfológicos erosión, dilatación, apertura, cierre, Top-Hat y Hit-or-Miss. Usando información de las bases de datos y relaciones binarias ordinarias como elementos estructurales, se implementan algunos de estos filtros. Con esta implementación se justifica que, con estos filtros morfológicos, pueden analizarse datos estructurados como tabla de registros, obteniéndose información útil no evidente. Finalmente se analizan diversas características de los operadores definidos, ilustrando los resultados con un ejemplo.Publication Open Access Evolution in time of L-fuzzy context sequences(Elsevier, 2016) Alcalde, Cristina; Burusco Juandeaburre, Ana; Bustince Sola, Humberto; Jurío Munárriz, Aránzazu; Sanz Delgado, José Antonio; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación; Universidad Pública de Navarra / Nafarroako Unibertsitate PublikoaIn this work, we consider a complete lattice L and we study L-fuzzy context sequences which represent the evolution in time of an L-fuzzy context. To carry out this study, in the first part of the paper, we consider n-ary OWA operators in complete lattices, which enable us to make a general analysis and a temporal analysis at any moment in time of L-fuzzy context sequences. After that, evolution in time of the relationship between the objects and the attributes is considered. In particular, we analyze the concepts of Trend and Persistent formal contexts. Finally, we illustrate our results with an example where we consider the particular lattice L = J ([0, 1]).Publication Open Access Extensions of fuzzy sets in image processing: an overview(EUSFLAT, 2011) Pagola Barrio, Miguel; Barrenechea Tartas, Edurne; Bustince Sola, Humberto; Fernández Fernández, Francisco Javier; Galar Idoate, Mikel; Jurío Munárriz, Aránzazu; López Molina, Carlos; Paternain Dallo, Daniel; Sanz Delgado, José Antonio; Couto, Pedro; Melo-Pinto, Pedro; Automática y Computación; Automatika eta KonputazioaThis work presents a valuable review for the interested reader of the recent Works using extensions of fuzzy sets in image processing. The chapter is divided as follows: first we recall the basics of the extensions of fuzzy sets, i.e. Type 2 fuzzy sets, interval-valued fuzzy sets and Atanassov’s intuitionistic fuzzy sets. In sequent sections we review the methods proposed for noise removal (sections 3), image enhancement (section 4), edge detection (section 5) and segmentation (section 6). There exist other image segmentation tasks such as video de-interlacing, stereo matching or object representation that are not described in this work.Publication Open Access A framework for radial data comparison and its application to fingerprint analysis(Elsevier, 2016) Marco Detchart, Cedric; Cerrón González, Juan; Miguel Turullols, Laura de; López Molina, Carlos; Bustince Sola, Humberto; Galar Idoate, Mikel; Automatika eta Konputazioa; Institute of Smart Cities - ISC; Automática y Computación; Universidad Pública de Navarra / Nafarroako Unibertsitate PublikoaThis work tackles the comparison of radial data, and proposes comparison measures that are further applied to fingerprint analysis. First, we study the similarity of scalar and non-scalar radial data, elaborated on previous works in fuzzy set theory. This study leads to the concepts of restricted radial equivalence function and Radial Similarity Measure, which model the perceived similarity between scalar and vectorial pieces of radial data, respectively. Second, the utility of these functions is tested in the context of fingerprint analysis, and more specifically, in the singular point detection. With this aim, a novel Template-based Singular Point Detection method is proposed, which takes advantage of these functions. Finally, their suitability is tested in different fingerprint databases. Different Similarity Measures are considered to show the flexibility offered by these measures and the behaviour of the new method is compared with well-known singular point detection methods.Publication Open Access Fuzzy morphological operators in image processing(Universitat Politècnica de Catalunya, 2003) Burillo López, Pedro; Frago Paños, Noé Natalio; Fuentes González, Ramón; Automática y Computación; Automatika eta KonputazioaFirst of all, in this paper we propose a family of fuzzy implication operators, which the generalised Luckasiewicz´s one, and to analyse the impacts of Smets and Magrez properties on these operators. The result of this approach will be a characterisation of a proposed family of inclusion grade operators (in Bandler and Kohout´s manner) that satisfies the axioms of Divyendu and Dogherty. Second, we propose a method to define fuzzy morphological operators (erosions and dilations). A family of fuzzy implication operators and the inclusion grade are the basis for this method.Publication Open Access Handling multicriteria fuzzy decision-making problems based on intuitionistic fuzzy sets(Institute of Biophysics and Biomedical Engineering, Bulgarian Academy of Sciences, 1995) Bustince Sola, Humberto; Automática y Computación; Automatika eta KonputazioaIn this paper we present a new technique for handling multicriteria decision making problems based on intuitionistic fuzzy sets. In this new technique we use the degree of reliability and of non-reliability of each criterion in relation to a set of alternatives. We also present a new score function in order to evaluate the degree of suitability of the choice of a certain alternative.Publication Open Access Image reduction using means on discrete product lattices(IEEE, 2012) Beliakov, Gleb; Bustince Sola, Humberto; Paternain Dallo, Daniel; Automática y Computación; Automatika eta KonputazioaWe investigate the problem of averaging values on lattices, and in particular on discrete product lattices. This problem arises in image processing when several color values given in RGB, HSL, or another coding scheme, need to be combined. We show how the arithmetic mean and the median can be constructed by minimizing appropriate penalties, and we discuss which of them coincide with the Cartesian product of the standard mean and median. We apply these functions in image processing. We present three algorithms for color image reduction based on minimizing penalty functions on discrete product lattices.Publication Open Access Improving the performance of fuzzy rule-based classification systems with interval-valued fuzzy sets and genetic amplitude tuning(Elsevier, 2010) Sanz Delgado, José Antonio; Fernández, Alberto; Bustince Sola, Humberto; Herrera, Francisco; Automática y Computación; Automatika eta KonputazioaAmong the computational intelligence techniques employed to solve classification problems, Fuzzy Rule-Based Classification Systems (FRBCSs) are a popular tool because of their interpretable models based on linguistic variables, which are easier to understand for the experts or end-users. The aim of this paper is to enhance the performance of FRBCSs by extending the Knowledge Base with the application of the concept of Interval-Valued Fuzzy Sets (IVFSs). We consider a post-processing genetic tuning step that adjusts the amplitude of the upper bound of the IVFS to contextualize the fuzzy partitions and to obtain a most accurate solution to the problem. We analyze the goodness of this approach using two basic and well-known fuzzy rule learning algorithms, the Chi et al.’s method and the fuzzy hybrid genetics-based machine learning algorithm. We show the improvement achieved by this model through an extensive empirical study with a large collection of data-sets.Publication Open Access Internet traffic shaping for IP over WDM links with source output buffering or multiple parallel wavelengths(Kluwer Academic Publishers, 2001) Aracil Rico, Javier; Izal Azcárate, Mikel; Morató Osés, Daniel; Automática y Computación; Automatika eta KonputazioaSince the number of wavelengths per fiber is growing in an exponential fashion the over- flow traffic can be routed through overflow lightpaths, thus providing an ideal network with near-infinite capacity and almost no-buffering. Such unprecedented bandwidth growth in the network backbone is only limited by the processing speed of the electronic elements. Even though multiple parallel high-speed channels (lightpaths) are provided between IP routers the switching speed of the latter is an order of magnitude below the lightpath transmission speed. As a result, minimizing transfer delay is not only a matter of forwarding traffic as fast as possible but to shape traffic so that the input queues of the destination routers do not over-flow. Even though it is desirable to exploit the WDM capabilities to forward traffic in parallel channels in order to nearly eliminate the router output buffering, it turns out that the extreme burstiness of Internet traffic is even increased by routing part of the traffic through a backup channel. Instead, the use of source output buffering for traffic shaping purposes proves more beneficial. In this paper, we examine the typical scenario of a static WDM network with several wavelengths between IP routers. In a simple configuration of a primary and over flow lightpath the results show that if 3% of the traffic is routed through the over flow lightpath then the packet forwarding speed in the destination router should be increased in 20% in order to obtain the same transfer delay as with the single lightpath configuration with source output buffering.Publication Open Access Interval type-2 fuzzy sets are generalization of interval-valued fuzzy sets: towards a wider view on their relationship(IEEE, 2015) Bustince Sola, Humberto; Fernández Fernández, Francisco Javier; Hagras, Hani; Herrera, Francisco; Pagola Barrio, Miguel; Barrenechea Tartas, Edurne; Automática y Computación; Automatika eta KonputazioaIn this paper, we will present a wider view on the relationship between interval-valued fuzzy sets and interval type- 2 fuzzy sets where we will show that interval-valued fuzzy sets are a particular case of the interval type-2 fuzzy sets. For this reason, both concepts should be treated in a different way. In addition, the view presented in this paper will allow a more general perspective of interval type-2 fuzzy sets which will allow representing concepts which could not be presented by intervalvalued fuzzy sets.
- «
- 1 (current)
- 2
- 3
- »