Search
Now showing items 671-678 of 678
Article
Modular Schur numbers
(Electronic Journal of Combinatorics, 2013)
For any positive integers l and m, a set of integers is said to be (weakly) l-sum free modulo m if it contains no (pairwise distinct) elements x1, x2, . . . , xl , y satisfying the congruence x1 + . . . + xl ≡ y mod m. ...
Article
Trainable and explainable simplicial map neural networks
(ELSEVIER SCIENCE INC, 2024)
Simplicial map neural networks (SMNNs) are topology-based neural networks with interesting properties such as universal approximation ability and robustness to adversarial examples under appropriate conditions. However, ...
Article
A new topological entropy-based approach for measuring similarities among piecewise linear functions
(Elsevier, 2017)
In this paper we present a novel methodology based on a topological entropy, the so-called persistent entropy, for addressing the comparison between discrete piecewise linear functions. The comparison is certi ed by the ...
Article
Parametric energy optimization of a ventilated facade with windows in Mediterranean climates
(Elsevier, 2024-06)
Ventilated facades are an effective passive measure to improve the energy performance of buildings in warm and temperate climates such as the Mediterranean. However, although in the Mediterranean sociocultural context the ...
Article
Optimizing a courtyard microclimate with adaptable shading and evaporative cooling in a hot mediterranean climate
(Elsevier, 2024-07-01)
While in recent years significant improvements have been made in the thermal adaptation of indoor building environments, less progress has been made in improving thermal comfort in transitional spaces next to buildings. ...
Article
Continuous mean distance of a weighted graph
(Cornell University, 2021)
We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be de ned as the arithmetic mean of the distances between all pairs of vertices. This ...
Article
Computing optimal shortcuts for networks
(ELSEVIER SCIENCE BV; ELSEVIER, 2019)
We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Problems of this type have received ...
Presentation
Hypergraph logic program representation versus stratified programs
(2024-05)
Multi-adjoint normal logic programming is a general non-monotonic logic programming framework, which makes it ideal for modeling complex scenarios. Hypergraph representation has been proved to be an appropriate tool in the ...