Dpto. Automática y Computación - Automatika eta Konputazioa Saila

Permanent URI for this community

http://hdl.handle.net/2454/10443

Browse

Now showing 1 - 20 of 145

Open Access
A-priori flow bandwidth estimates for dynamic bandwidth allocation in ISP access links
(2001) Aracil Rico, Javier; Morató Osés, Daniel; Automática y Computación; Automatika eta Konputazioa
In this paper we study a-priori bandwidth estimation algorithms for TCP flows. An RTT-based bandwidth allocator is proposed, which outperforms a broad class of peak-rate and static allocation flow switching solutions. Our findings suggest that a-priori bandwidth estimation (i.e, before the TCP data transfer phase takes place) is indeed feasible and serves to design simple, yet efficient, dynamic bandwidth allocation rules for ISP access links.
Open Access
About the intuitionistic fuzzy set generators
(Institute of Biophysics and Biomedical Engineering, Bulgarian Academy of Sciences, 1997) Bustince Sola, Humberto; Mohedano Salillas, Victoria; Automática y Computación; Automatika eta Konputazioa
In this paper form the definition of intuitionistic fuzzy sets we analyze the intuitionistic fuzzy generators and the complementation in these sets. We start by defining the intuitionistic fuzzy generators in order to then study the particular cases for which this definition coincides with the fuzzy complementation. Afterwards we analyze the existence of equilibrium points, dual points and we present characterization theorems of intuitionistic fuzzy generators. Lastly, we study a manner of constructing intuitionistic fuzzy sets and analyse the structure of the complementary of intuitionistic fuzzy sets built.
Open Access
Adjusting fuzzy automata for string similarity measuring
(EUSFLAT, 2001) Astrain Escola, José Javier; Villadangos Alonso, Jesús; González de Mendívil Moreno, José Ramón; Garitagoitia Padrones, José Ramón; Fariña Figueredo, Federico; Ingeniería Matemática e Informática; Matematika eta Informatika Ingeniaritza; Automática y Computación; Automatika eta Konputazioa
In this paper, we introduce a fuzzy automaton for computing the similarity between pairs of strings and a genetic method for adjusting its parameters. The fuzzy automaton models the edit operations needed to transform any string into another one. The selection of appropriate fuzzy operations and fuzzy membership values for the transitions leads to improve the system performance for a particular application.
Open Access
Aggregation and pre-aggregation functions in fuzzy rule-based classification systems
(2018) Lucca, Giancarlo; Bustince Sola, Humberto; Sanz Delgado, José Antonio; Automática y Computación; Automatika eta Konputazioa
Una manera eficiente de tratar problemas de clasificación, entre otras, es el uso de Sistemas de Clasificación Basados en Reglas Difusas (SCBRDs). Estos sistemas están compuestos por dos componentes principales, la Base de Conocimiento (BC) y el Método de Razonamiento Difuso (MRD). El MRD es el método responsable de clasificar nuevos ejemplos utilizando la información almacenada en la BC. Un punto clave del MRD es la forma en la que se agrega la información proporcionada por las reglas difusas disparadas. Precisamente, la función de agregación es lo que diferencia a los dos MRDs más utilizados de la literatura especializada. El primero, llamado de Regla Ganadora (RG), tiene un comportamiento promedio, es decir, el resultado de la agregación está en el rango delimitado por el mínimo y el máximo de los valores a agregar y utiliza la mayor relación entre el nuevo ejemplo a clasificar y las reglas. El segundo, conocido como Combinación Aditiva (CA), es ampliamente utilizado por los algoritmos difusos más precisos de la actualidad y aplica una suma normalizada para agregar toda la información relacionada con el ejemplo. Sin embargo, este método no presenta un comportamiento promedio. En este trabajo de tesis, proponemos modificar la manera en la que se agrega la información en el MRD, aplicando generalizaciones de la integral Choquet. Para ello, desarrollamos nuevos conceptos teóricos en el campo de los operadores de agregación. En concreto, definiremos generalizaciones de la Choquet integral con y sin comportamientos promedio. Utilizamos estas generalizaciones en el MRD del clasificador FARC-HD, que es un SCBRD del estado del arte. A partir de los resultados obtenidos, demostramos que el nuevo MRD puede ser utilizado, de manera eficiente, para afrontar problemas de clasificación. Además, mostramos que los resultados son estadísticamente equivalentes, o incluso superiores, a los clasificadores difusos considerados como estado del arte.
Open Access
Aggregation functions to combine RGB color channels in stereo matching
(Optical Society of America, 2013) Galar Idoate, Mikel; Jurío Munárriz, Aránzazu; López Molina, Carlos; Sanz Delgado, José Antonio; Paternain Dallo, Daniel; Bustince Sola, Humberto; Automática y Computación; Automatika eta Konputazioa; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
In this paper we present a comparison study between different aggregation functions for the combination of RGB color channels in stereo matching problem. We introduce color information from images to the stereo matching algorithm by aggregating the similarities of the RGB channels which are calculated independently. We compare the accuracy of different stereo matching algorithms and aggregation functions. We show experimentally that the best function depends on the stereo matching algorithm considered, but the dual of the geometric mean excels as the most robust aggregation.
Open Access
An algorithm for group decision making using n -dimensional fuzzy sets, admissible orders and OWA operators
(Elsevier, 2017) Miguel Turullols, Laura de; Sesma Sara, Mikel; Elkano Ilintxeta, Mikel; Asiain Ollo, María José; Bustince Sola, Humberto; Automatika eta Konputazioa; Matematika; Institute of Smart Cities - ISC; Automática y Computación; Matemáticas; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
In this paper we propose an algorithm to solve group decision making problems using n-dimensional fuzzy sets, namely, sets in which the membership degree of each element to the set is given by an in- creasing tuple of n elements. The use of these sets has naturally led us to define admissible orders for n-dimensional fuzzy sets, to present a construction method for those orders and to study OWA operators for aggregating the tuples used to represent the membership degrees of the elements. In these condi- tions, we present an algorithm and apply it to a case study, in which we show that the exploitation phase which appears in many decision making methods can be omitted by just considering linear orders between tuples.
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 Konputazioa
Since 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.
Open Access
Analysis of Internet services in IP over ATM networks
(IEEE, 1999) Aracil Rico, Javier; Morató Osés, Daniel; Izal Azcárate, Mikel; Automática y Computación; Automatika eta Konputazioa
This paper presents a trace-driven analysis of IP over ATM services from a user-perceived quality of service standpoint. QoS parameters such as the sustained throughput for transactional services and other ATM layer parameters such as the burstiness (MBS) per connection are derived. On the other hand, a macroscopic analysis that comprises percentage of flows and bytes per service, TCP transaction duration and mean bytes transferred in both ways is also presented. The traffic trace is obtained with a novel measurement equipment that combines a header extraction hardware and a high end UNIX workstation capable of providing a timestamp accuracy in the order of microseconds. The ATM link under analysis concentrates traffic from a large population of 1,500 hosts from Public University of Navarra campus network, that produce 1,700,000 TCP connections approximately in the measurement period of one week. The results obtained from such a wealth of data suggest that QoS is primarily determined by transport protocols and not by ATM bandwidth. The sustained throughput of TCP connections never grows beyond 80 Kbps with 70% probability in the data transfer phase (i. e., in the ESTABLISHED state) and we observe a strong influence of the connection establishment phase in the user-perceived throughput. On the other hand, the burstiness of individual TCP connections is rather small, namely TCP connections do not produce bursts according to the geometric law given by slow start and commonly assumed in previously published studies.
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 Publikoa
In 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.
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 Publikoa
Based 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 functions
Open Access
Applications of finite interval-valued hesitant fuzzy preference relations in group decision making
(Elsevier, 2016) Pérez Fernández, Raúl; Alonso, Pedro; Bustince Sola, Humberto; Díaz, Irene; Montes Rodríguez, Susana; Automática y Computación; Automatika eta Konputazioa
The main purpose of this paper is to present the twofold group decision making problem, which is a new point of view of the group decision making problem where several experts and criteria can be considered at the same time. This problem is based on the study of finitely generated sets and finite interval-valued hesitant fuzzy preference relations. Furthermore, the Extended Weighted Voting Method, which is used in the exploitation phase of a classical group decision making problem, is generalized to the twofold case.
Open Access
Approximations for end-to-end delay analysis in OBS networks with light load
(IEEE, 2004) Morató Osés, Daniel; Magaña Lizarrondo, Eduardo; Izal Azcárate, Mikel; Automática y Computación; Automatika eta Konputazioa
In this paper we provide an analysis of end-to-end delay in OBS networks and a large deviations approximation. The analysis is based on an exponential approximation of the OBS router blocking time and on the assumption of Poisson arrivals in routers along the path from source to destination. On the other hand, a lightload assumption is performed, namely, waiting time is mainly due to residual life of the output wavelengths and not to buffering.
Open Access
Aproximación al modelado y predicción de tráfico de Internet como múltiplex de conexión de transporte
(2001) Morató Osés, Daniel; Aracil Rico, Javier; Automática y Computación; Automatika eta Konputazioa
El tráfico de datos en la Internet actual presenta un nuevo reto de caracterización y modelado para el correcto dimensionamiento de los equipos y enlaces que conforman la llamada “red de redes”. En este trabajo presentamos una revisión de los modelos propuestos hasta la fecha, lo cual nos lleva desde los límites de la telefonía clásica hasta los conceptos de dependencia a largo plazo y autosimilitud. A partir de estos modelos abordamos la caracterización de una gran población de usuarios de Internet. Para ello nos hemos basado en trazas del tráfico del enlace IP sobre ATM para acceso a Internet en la Universidad Pública de Navarra. Dichas trazas han sido obtenidas mediante una novedosa herramienta de monitorización de enlaces ATM. Con estas trazas presentamos un análisis macroscópico de protocolos y servicios en el enlace que nos muestra a TCP como principal protocolo y al Web como el servicio más utilizado al suponer más de tres cuartas partes del tráfico generado. A la vista de la predominancia de estas conexiones TCP realizamos una caracterización en base a procesos estocásticos para el múltiples de flujos TCP. Dicha caracterización se fundamenta en varias características observadas del tráfico, concretamente que la tasa de las conexiones TCP depende fuertemente del retardo extremo a extremo (RTT) de la conexión y que la intermitencia de las mismas no sigue la progresión exponencial que se esperaría del algoritmo slow-start. Esto nos lleva a un modelo mediante restricciones (σ, ρ) que permite el empleo de tecnologías de conmutación de circuitos para la reserva de ancho de banda por flujo. Con el conocimiento obtenido del funcionamiento de los flujos TCP en la red actual realizamos una revisión del modelo M/G/∞ de flujos. Este es uno de los modelos más empleados tanto para generación de tráfico sintético de datos como en el estudio analítico de las características del mismo. Confirmamos dos de las hipótesis en que se basa (proceso de llegadas de Poisson y duraciones de flujos con varianza infinita), pero vemos que la hipótesis de tasa constante de transferencia dista de lo observado en el tráfico real. Por ello proponemos una alteración del modelo mediante la incorporación de una variable aleatoria de Weibull para la tasa de flujos. Esta modificación permite que el tráfico resultante ajuste mejor la variabilidad de la marginal del mismo. El modelo M/G/∞ clásico subestima la variabilidad del tráfico aunque modele correctamente su dependencia a largo plazo. Mostramos, sin embargo, que en futuras redes de alta velocidad que formarán la próxima generación de internet el efecto de dependencia a largo plazo tenderá a desaparecer a costa de un aumento en la variabilidad del tráfico, que pasará a ser el factor que condicione las prestaciones de la red. Esto último es un fuerte apoyo para aceptar modificaciones del modelo en la línea de la propuesta. Finalmente, empleamos la caracterización de flujos TCP obtenida para proponer un algoritmo de estimación de ancho de banda basado en el RTT de las conexiones. La estimación está orientada a la reserva de ancho de banda en enlaces de proveedores de acceso a Internet. Los resultados muestran que la estimación en base a parámetros conocidos a priori es realizable y mejora los resultados obtenidos con asignadores basados en tasa de pico, asignaciones estáticas o best-effort. Esto abre numerosas posibilidades de estudio de algoritmos de asignación así como de cálculo dinámico de los parámetros de los mismos.
Open Access
Arquitectura de publicación automatizada de contenidos educativos supervisados en Internet
(1999) Arin Irastorza, María Asunción; Magaña Lizarrondo, Eduardo; Astrain Escola, José Javier; Villadangos Alonso, Jesús; González de Mendívil Moreno, José Ramón; Automática y Computación; Automatika eta Konputazioa
This paper presents an automated publishing architecture of educational and supervised contents over the Internet. The system makes easier the job of publishing educational courses over the network using specific tools that automates the access control (CGI -- Common Gateway Interface), encrypts the information that goes through the net for not being accessed by strangers (SSL – Secure Sockets Layer), gives an statistical control of the usage of the system, and tutors the course. This project is multiplatform, i.e. all the components that integrate the system are available for any operating system (Windows 9X, Solaris, Linux,...) and it is based on the Web.
Open Access
Arquitectura y diseño de un modelo de red OBS para simulación
(2009) Espina Antolín, Félix; Armendáriz Silva, Javier; Izal Azcárate, Mikel; Morató Osés, Daniel; Magaña Lizarrondo, Eduardo; Automática y Computación; Automatika eta Konputazioa
Optical Burst Switching (OBS) es una nueva tecnología de conmutación óptica capaz de soportar una gran demanda de ancho de banda en backbones ópticos con Wavelength Division Multiplexing (WDM). Muchos investigadores están interesados en el estudio de esta propuesta emergente y la búsqueda de sus parámetros y entornos de funcionamiento óptimos. Sin embargo se encuentran con el gran handicap de que no existen muchas testbed para su estudio físico, ni tampoco herramientas de software óptimas para su estudio mediante simulaciones. En este trabajo se presenta un modelo de simulación de OBS para el simulador de eventos discretos OMNeT++. Este modelo permite estudiar tanto los nodos frontera, como los nodos del core, así como enlazar la red OBS con otras redes de datos soportadas en OMNeT++, principalmente IP. Además, el diseño presenta una gran modularidad lo que permite modificar fácilmente el modelo OBS para incluir futuras propuestas que se hagan sobre esta tecnología.
Embargo
Binary relations coming from solutions of functional equations: orderings and fuzzy subsets
(World Scientific Publishing Company, 2017) Campión Arrastia, María Jesús; Miguel Turullols, Laura de; García Catalán, Olga Raquel; Induráin Eraso, Esteban; Abrísqueta Usaola, Francisco Javier; Automatika eta Konputazioa; Matematika; Institute of Smart Cities - ISC; Institute for Advanced Research in Business and Economics - INARBE; Institute for Advanced Materials and Mathematics - INAMAT2; Automática y Computación; Matemáticas; Universidad Pública de Navarra / Nafarroako Unibertsitate Publikoa
We analyze the main properties of binary relations, defined on a nonempty set, that arise in a natural way when dealing with real-valued functions that satisfy certain classical functional equations on two variables. We also consider the converse setting, namely, given binary relations that accomplish some typical properties, we study whether or not they come from solutions of some functional equation. Applications to the numerical representability theory of ordered structures are also furnished as a by-product. Further interpretations of this approach as well as possible generalizations to the fuzzy setting are also commented. In particular, we discuss how the values taken for bivariate functions that are bounded solutions of some classical functional equations define, in a natural way, fuzzy binary relations on a set.
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 Konputazioa
Background: 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 LGPL
Open Access
Blocking time analysis of OBS routers with arbitrary burst size distribution
(IEEE, 2003) Morató Osés, Daniel; Izal Azcárate, Mikel; Aracil Rico, Javier; Magaña Lizarrondo, Eduardo; Miqueleiz Alamos, J.; Automática y Computación; Automatika eta Konputazioa
The blocking time distribution for an OBS router is obtained, under the assumption of Poisson-arriving bursts with Pareto, Gaussian and Exponential burst size distributions. Analytical expressions are provided as a function of number of wavelengths per port. Such expressions can be used to dimension Fiber Delay Lines (FDLs) and to perform end-to-end delay estimation. On the other hand, we show that the blocking time distribution becomes exponential as the number of wavelengths increases, regardless of the burst size distribution. Since the burst size distribution is determined by the burst assembly algorithm at the network edges, we conclude that the burst assembly algorithm will have no influence on both burst blocking probability and burst blocking time in future DWDM networks.
Open Access
Characterizing Internet load as a non-regular multiplex of TCP streams
(IEEE, 2000) Aracil Rico, Javier; Morató Osés, Daniel; Automática y Computación; Automatika eta Konputazioa
A commonly accepted traffic model for a large population of Internet users consists of a multiplex of Poisson-arriving heavy-tailed streams with the same constant rate (M/G//spl infin/). We show that even though such a regular model provides an accurate description of long-range dependence, the marginal distribution variance is underestimated, resulting in erroneous calculation of overflow probability in network simulations. On the other hand, we show that the traffic variability due to the marginal distribution variance can be the limiting factor for performance in the gigabit-speed next-generation Internet, rather than the long-range dependence features present in today's traffic.
Open Access
Collecting packet traces at high speed
(2006) Aguirre Cascallana, Gorka; Magaña Lizarrondo, Eduardo; Automática y Computación; Automatika eta Konputazioa
In order to capture packet traces at high speed using a low-cost platform, we have to optimize the networking stack of a general purpose operating system. Different techniques are compared with the final objective of avoiding packet loss. Among those techniques we will study the performance of NAPI [6] and PF-RING [9]. Depending on the final application, we should tune certain parameters accordingly. We also present the advantages of a multiprocessor platform and the problematic of storing full packets directly to hard disk.