Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 13
Encontrada(s) 1 página(s)

RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

The complete classification of empty lattice 4-simplices

  • Iglesias Valiño, Óscar
  • Santos, Francisco
©2018 Elsevier B.V. All rights reserved. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/bync-nd/4.0/. This version of the article has been accepted for publication in Electronic Notes in Discrete Mathematics. The Version of Record is available online at https://doi.org/10.1016/j.endm.2018.06.027, [Abstract]: In previous work we classified all empty 4-simplices of width at least three. We here classify those of width two. There are 2 two-parameter families that project to the second dilation of a unimodular triangle, 29+23 one-parameter families of them that project to hollow 3-polytopes, and 2282 individual ones that do not., Supported by grants MTM2014-54207-P (both authors) and BES-2015-073128 (O. Iglesias) of the Spanish Ministry of Economy and Competitiveness. F. Santos is also supported by the Einstein Foundation Berlin, Einstein Foundation Berlin; EVF-2015-230
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

The complete classification of empty lattice 4-simplices

  • Iglesias Valiño, Óscar
  • Santos, Francisco
Accepted version for: Óscar Iglesias-Valiño, Francisco Santos, The complete classification of empty lattice 4-simplices. Rev. Mat. Iberoam. 37 (2021), no. 6, pp. 2399–2432. DOI 10.4171/RMI/1268, [Abstract]: An empty simplex is a lattice simplex with only its vertices as lattice points. Their classification in dimension three was completed by G. White in 1964. In 1988, S. Mori, D. R. Morrison, and I. Morrison started the task in dimension four, with their motivation coming from the close relationship between empty simplices and terminal quotient singularities. They conjectured a classification of empty simplices of prime volume, modulo finitely many exceptions. Their conjecture was proved by Sankaran (1990) with a simplified proof by Bober (2009). The same classification was claimed by Barile et al. in 2011 for simplices of non-prime volume, but this statement was proved wrong by Blanco et al. (2016+). In this article, we complete the classification of 4-dimensional empty simplices. In doing so, we correct and complete the classification by Barile et al., and we also compute all the finitely many exceptions, by first proving an upper bound for their volume. The whole classification has: 1) One 3-parameter family, consisting of simplices of width equal to one. 2) Two 2-parameter families (the one in Mori et al., plus a second new one). 3) Forty-six 1-parameter families (the 29 in Mori et al., plus 17 new ones). 4) 2461 individual simplices not belonging to the above families, with (normalized) volumes ranging between 24 and 419. We characterize the infinite families of empty simplices in terms of the lower dimensional point configurations that they project to, with techniques that can potentially be applied to higher dimensions and other classes of lattice polytopes., Supported by grants MTM2014-54207-P and MTM2017-83750-P (both authors) and BES-2015-073128 (O.Iglesias) of the Spanish Ministry of Economy and Competitiveness. F. Santos is also supported by the Einstein Foundation Berlin under grant EVF-2015-230., Einstein Foundation Berlin; EVF-2015-230
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Classification of empty lattice 4-simplices of width larger than two

  • Iglesias Valiño, Óscar
  • Santos, Francisco
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/. This is a preliminary PDF of the author-produced manuscript that has been peer-reviewed and accepted for publication. It has not been copyedited, proofread, or finalized by AMS Production staff. The Version of Record is available online at: https://doi.org/10.1090/tran/7531, [Abstract]: Rd. It is called empty if it contains no lattice point apart of its d + 1 vertices. The classification of empty 3-simplices is known since 1964 (White), based on the fact that they all have width one. But for dimension 4 no complete classification is known. Haase and Ziegler (2000) enumerated all empty 4-simplices up to determinant 1000 and based on their results conjectured that after determinant 179 all empty 4-simplices have width one or two. We prove this conjecture as follows: - We show that no empty 4-simplex of width three or more can have determinant greater than 5058, by combining the recent classification of hollow 3-polytopes (Averkov, Krümpelmann and Weltge, 2017) with general methods from the geometry of numbers. - We continue the computations of Haase and Ziegler up to determinant 7600, and find that no new 4-simplices of width larger than two arise. In particular, we give the whole list of empty 4-simplices of width larger than two, which is as computed by Haase and Ziegler: There is a single empty 4-simplex of width four (of determinant 101), and 178 empty 4-simplices of width three, with determinants ranging from 41 to 179., This work was supported by grants MTM2014-54207-P (both authors) and BES-2015-073128 (first author) of the Spanish Ministry of Economy and Competitiveness. The second author was also supported by an Einstein Visiting Professorship of the Einstein Foundation Berlin.
RUC. Repositorio da Universidade da Coruña
Publication Artículo científico (JournalArticle)

Classification of empty lattice 4-simplices of width larger than 2

  • Iglesias Valiño, Óscar
  • Santos, Francisco
©2017 Elsevier B.V. All rights reserved. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/bync-nd/4.0/. This version of the article has been accepted for publication in Electronic Notes in Discrete Mathematics. The Version of Record is available online at https://doi.org/10.1016/j.endm.2017.07.019, [Abstract]: Combining an upper bound on the volume of empty lattice 4-simplices of large width with a computer enumeration we prove the following conjecture of Haase and Ziegler (2000): Except for 179 classes, of determinant at most 179, all empty 4-simplices have width one or two with respect to some integer functional., Supported by grants MTM2014-54207-P (both authors) and BES-2015-073128 (O. Iglesias) of the Spanish Ministry of Economy and Competitiveness. F. Santos is also supported by the Einstein Foundation Berlin.
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Testing SensoGraph, a geometric approach for fast sensory evaluation

  • Orden Martín, David|||0000-0001-5403-8467
  • Fernández Fernández, Encarnación
  • Rodríguez Nogales, José M.
  • Vila Crespo, Josefina
This paper introduces SensoGraph, a novel approach for fast sensory evaluation using two-dimensional geometric techniques. In the tasting sessions, the assessors follow their own criteria to place samples on a tablecloth, according to the similarity between samples. In order to analyse the data collected, first a geometric clustering is performed to each tablecloth, extracting connections between the samples. Then, these connections are used to construct a global similarity matrix. Finally, a graph drawing algorithm is used to obtain a 2D consensus graphic, which reflects the global opinion of the panel by (1) positioning closer those samples that have been globally perceived as similar and (2) showing the strength of the connections between samples. The proposal is validated by performing four tasting sessions, with three types of panels tasting different wines, and by developing a new software to implement the proposed techniques. The results obtained show that the graphics provide similar positionings of the samples as the consensus maps obtained by multiple factor analysis (MFA), further providing extra information about connections between samples, not present in any previous method. The main conclusion is that the use of geometric techniques provides information complementary to MFA, and of a different type. Finally, the method proposed is computationally able to manage a significantly larger number of assessors than MFA, which can be useful for the comparison of pictures by a huge number of consumers, via the Internet., Ministerio de Economía, Comercio y Empresa, Universidad de Alcalá, European Commision
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction

  • Orden Martín, David|||0000-0001-5403-8467
  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Hoz de la Hoz, Enrique de la|||0000-0003-4837-3837
  • Álvarez Suárez, Ana
The present work deals with the problem of efficiently assigning Wi-Fi channels in a real-world scenario, the Polytechnic School of the University of Alcala. We first use proximity graphs to model the whole problem as an instance of spectrum graph coloring, we further obtain a simplified model using edge contraction, and we finally use simulated annealing to look for a coloring which optimizes the network throughput. As the main result, we show that the solutions we obtain outperform the de facto standard for Wi-Fi channel assignment, both in terms of network throughput and of computation time., Ministerio de Economía, Comercio y Empresa, Ministerio de Ciencia, European Union
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks

  • Hoz de la Hoz, Enrique de la|||0000-0003-4837-3837
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Orden Martín, David|||0000-0001-5403-8467
Due to the low cost of CMOS IP-based cameras, wireless surveillance sensor networks have emerged as a new application of sensor networks able to monitor public or private areas or even country borders. Since these networks are bandwidth intensive and the radioelectric spectrum is limited, especially in unlicensed bands, it is mandatory to assign frequency channels in a smart manner. In this work, we propose the application of automated negotiation techniques for frequency assignment. Results show that these techniques are very suitable for the problem, being able to obtain the best solutions among the techniques with which we have compared them., Ministerio de Economía y Competitividad, Comunidad de Madrid, Agencia Española de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Contribución de congreso (ConferenceOutput)

Uso de técnicas de negociación automática para la asignación de canales en IEEE 802.11

  • Hoz de la Hoz, Enrique de la|||0000-0003-4837-3837
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Orden Martín, David|||0000-0001-5403-8467
XII Jornadas de Ingeniería Telemática (JITEL 2015), 14/10/2015-16/10/2015, Palma de Mallorca, España, Las redes inalámbricas actuales deben dar soporte a cada vez más servicios telemáticos que demandan mayores prestaciones. Puesto que el espectro radioeléctrico en el que estas redes se basan es limitado, aumentar su eficiencia es ya una exigencia. En este trabajo se aborda el problema de la asignación de canales a puntos de acceso IEEE 802.11n con el objetivo de que los clientes de la red vean mejorada su experiencia de utilización. Las técnicas que se emplean con tal objetivo se basan en la negociación automática, comparándose con otras alternativas. Los resultados muestran que las técnicas de negociación son muy adecuadas para resolver el problema en cuestión, siendo capaces de obtener prestaciones superiores al resto de métodos con los que se han comparado., Comunidad de Madrid, Ministerio de Economía y Competitividad, Agencia Estatal de Invetigación, Junta de Castilla y León
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Bounds on spectrum graph coloring

  • Orden Martín, David|||0000-0001-5403-8467
  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Hoz de la Hoz, Enrique de la|||0000-0003-4837-3837
We propose two vertex-coloring problems for graphs, endorsing the spectrum of colors with a matrix of interferences between pairs of colors. In the Threshold Spectrum Coloring problem, the number of colors is fixed and the aim is to minimize the maximum interference at a vertex (interference threshold). In the Chromatic Spectrum Coloring problem, a threshold is settled and the aim is to minimize the number of colors (among the available ones) for which respecting that threshold is possible. We prove general upper bounds for the solutions to each problem, valid for any graph and any matrix of interferences. We also show that both problems are NP-hard and perform experimental results, proposing a DSATUR-based heuristic for each problem, in order to study the gap between the theoretical upper bounds and the values obtained., Ministerio de Economía y Competitividad, Comunidad de Madrid
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Contribución de congreso (ConferenceOutput)

A Distributed, Multi-Agent approach to Reactive Network Resilience

  • Hoz de la Hoz, Enrique de la|||0000-0003-4837-3837
  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Cruz Piris, Luis de la|||0000-0002-9570-2851
  • Orden Martín, David|||0000-0001-5403-8467
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
AAMAS 2017 - Sixteenth International Conference on Autonomous Agents and Multiagent Systems, , 08/05/2017-12/05/2017, Sao Paulo, Brasil, Critical network infrastructures are communication networks whose disruption can create a severe impact on other systems. Multi-agent systems have been successfully used to protect critical network infrastructures, with approaches ranging from reasoning about secure design and policies to multi-agent intrusion detection systems (IDS). However, there is little research on the possibilities for multi-agent systems to react to known intrusions. In this paper we propose a multi-agent framework for \emph{reactive network resilience}, that is, to allow a network to reconfigure itself in the event of a security incident so that the risk of further damage is mitigated. The proposed framework takes advantage of a risk model based on multilayer networks and of distributed belief propagation techniques to agree on a new, more resilient configuration of the network in the event of an attack. We compare our proposal with a number of centralized optimization and multi-agent negotiation techniques. Experiments show that our proposal outperforms the reference approaches both in terms of risk mitigation and performance, Ministerio de Economía y Competitividad, Universidad de Alcalá
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Contribución de congreso (ConferenceOutput)

Multi-agent nonlinear negotiation for Wi-Fi channel assignment

  • Hoz de la Hoz, Enrique de la|||0000-0003-4837-3837
  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Orden Martín, David|||0000-0001-5403-8467
  • Klein, Mark
AAMAS 2017 - Sixteenth International Conference on Autonomous Agents and Multiagent Systems, 08/05/2017-12/05/2017, Sao Paulo, Brasil., Optimizing resource use in complex networks with self-interested participants (e.g. transportation networks, electric grids, Internet systems) is a challenging and increasingly critical real-world problem. We propose an approach for solving this problem based on multi-agent nonlinear negotiation, and demonstrate it in the context of Wi-Fi channel assignment. We compare the performance of our proposed approaches with a complete information optimizer based on particle swarms, together with the \emph{de facto} heuristic technique based on using the least congested channel. We have evaluated all these techniques in a wide range of settings, including randomly generated scenarios and real-world ones. Our experiments show that our approach outperforms the rest of techniques in terms of social welfare. The particle swarm optimizer is the only technique whose performance is close to ours, but its computation cost is much higher. Finally, we also study the effect of some graphs metrics on the gain that our approach can achieve., Ministerio de Economía y Competitividad
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Libro o Monografía (Book)

Nonlinear negotiation approaches for complex-network optimization: a study inspired by Wi-Fi channel assignment

  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Hoz de la Hoz, Enrique de la|||0000-0003-4837-3837
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Orden Martín, David|||0000-0001-5403-8467
  • Klein, Mark
Conflict Resolution in Decision Making: Second International Workshop, COREDEMA 2016, In this paper, we study a problem family inspired by a prominent network optimization problem (graph coloring), enriched and extended towards a real-world application (Wi-Fi channel assignment). We propose a utility model based on this scenario, and we generate an extensive set of test cases, against which we run both a complete information optimizer and two nonlinear negotiation approaches {a hill-climber and an approach based on simulated annealing (SA). We show that, for the larger-scale scenarios, the SA negotiation approach significantly outperforms the optimizer while running in roughly one tenth of the computation time. Also, we point out interesting patterns regarding the relative performance of the two approaches depending on the properties of the underlying graphs., Ministerio de Economía y Competitividad, Universidad de Alcalá
e_Buah Biblioteca Digital Universidad de Alcalá
Publication Artículo científico (JournalArticle)

Estimation of the spatio-temporal wave grouping properties by using multidimensional discrete and spline methods

  • Nieto Borge, José Carlos|||0000-0002-3158-3822
  • Alcázar Arribas, Juan Gerardo|||0000-0002-1665-9710
  • Orden Martín, David|||0000-0001-5403-8467
  • Marazuela Reca, Sara
  • Rodríguez, Gerardo
Wave groups can be detected and studied by using the wave envelope. So far, the method used to compute the wave envelope employs the Riesz transform. However, such a technique always produces symmetric envelopes, which is only realistic in the case of linear waves. In this paper we present a new method to compute the wave envelope providing more realistic results. In particular, the method allows to detect non-symmetry in the wave envelope, something useful, for instance, when detecting groups of high waves. The method computes first the local maxima and minima of the sea surface, and then determines the wave envelope by combining discrete methods, namely the use of the Delaunay triangulation, and tensor-product splines. The proposed method has been applied to simulated wave fields, and also to wave elevations data measured by an X-band radar. The obtained results correctly reproduce the behavior of the simulated waves., Ministerio de Economía y Competitividad, Agencia Estatal de Investigación, European Commission