González de Mendívil Moreno, José Ramón
Loading...
Email Address
person.page.identifierURI
Birth Date
Job Title
Last Name
González de Mendívil Moreno
First Name
José Ramón
person.page.departamento
Estadística, Informática y Matemáticas
person.page.instituteName
ISC. Institute of Smart Cities
ORCID
person.page.observainves
person.page.upna
Name
- Publications
- item.page.relationships.isAdvisorOfPublication
- item.page.relationships.isAdvisorTFEOfPublication
- item.page.relationships.isAuthorMDOfPublication
4 results
Search Results
Now showing 1 - 4 of 4
Publication 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 KonputazioaThis 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.Publication 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 KonputazioaIn 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.Publication Open Access Eventual consistency: origin and support(Slovak Academy of Sciences, Institute of Informatics, 2018) Muñoz Escoí, Francesc D.; García Escrivá, José Ramón; Sendra Roig, Juan Salvador; Bernabéu Aubán, José M.; González de Mendívil Moreno, José Ramón; Ingeniería Matemática e Informática; Matematika eta Informatika IngeniaritzaEventual consistency is demanded nowadays in geo-replicated services that need to be highly scalable and available. According to the CAP constraints, when network partitions may arise, a distributed service should choose between being strongly consistent or being highly available. Since scalable services should be available, a relaxed consistency (while the network is partitioned) is the preferred choice. Eventual consistency is not a common data-centric consistency model, but only a state convergence condition to be added to a relaxed consistency model. There are still several aspects of eventual consistency that have not been analysed in depth in previous works: 1. which are the oldest replication proposals providing eventual consistency, 2. which replica consistency models provide the best basis for building eventually consistent services, 3. which mechanisms should be considered for implementing an eventually consistent service, and 4. which are the best combinations of those mechanisms for achieving different concrete goals. This paper provides some notes on these important topics.Publication Open Access CAP theorem: revision of its related consistency models(Oxford University Press, 2019) Muñoz Escoí, Francesc D.; Juan Marín, Rubén de; García Escrivá, José Ramón; González de Mendívil Moreno, José Ramón; Bernabéu Aubán, José M.; Estadística, Informática y Matemáticas; Estatistika, Informatika eta MatematikaThe CAP theorem states that only two of these properties can be simultaneously guaranteed in a distributed service: (i) consistency, (ii) availability, and (iii) network partition tolerance. This theorem was stated and proved assuming that “consistency” refers to atomic consistency. However, multiple consistency models exist and atomic consistency is located at the strongest edge of that spectrum. Many distributed services deployed in cloud platforms should be highly available and scalable. Network partitions may arise in those deployments and should be tolerated. One way of dealing with CAP constraints consists in relaxing consistency. Therefore, it is interesting to explore the set of consistency models not supported in an available and partition-tolerant service (CAP-constrained models). Other weaker consistency models could be maintained when scalable services are deployed in partitionable systems (CAP-free models). Three contributions arise: (1) multiple other CAPconstrained models are identified, (2) a borderline between CAP-constrained and CAP-free models is set, and (3) a hierarchy of consistency models depending on their strength and convergence is built.