Now showing items 204-223 of 258

    • Repairing an aggregation-based smart metering system 

      Garra Oronich, Ricard; Leibenger, Dominik; Miret, Josep M. (Josep Maria); Sebé Feixas, Francesc (Springer Berlin Heidelberg, 2019)
      Smart meters inform the electricity suppliers about the consumption of their clients in short intervals. Fine-grained electricity consumption information is highly sensitive as it has been proven to permit to infer people's ...
    • Reply to the comment by D.E. Rupp and G.M. Smart on "Flow resistance equations without explicit estimation of the resistance coefficient for coarse-grained rivers" 

      López Alonso, Raúl; Barragán Fernández, Javier; Colomer, M. Àngels (Maria Àngels) (Elsevier, 2007)
    • Reversible nilpotent centers with cubic homogeneous nonlinearities 

      Dukaric, Masa; Giné, Jaume; Llibre, Jaume (Elsevier, 2016)
      We provide 13 non--topological equivalent classes of global phase portraits in the Poincaré disk of reversible cubic homogeneous systems with a nilpotent center at origin, which complete the classification of the phase ...
    • Review of mathematical models for sow herd management 

      Pla Aragonés, Lluís Miquel (Elsevier, 2007)
      This paper is a survey of the different sow models described in literature, which made use of different mathematical methodologies, and were intended for sow herd management. Models were discussed under a wide classification, ...
    • Searching for large multi-loop networks 

      Feria Purón, Ramiro; Pérez Rosés, Hebert; Ryan, Joe (Elsevier, 2014)
      We describe and implement a computer-based method to find large multi-loop graphs with given degree and diameter. For some values of degree and diame- ter, our algorithm produces the largest known circulant graphs. We ...
    • Secure many-to-one communications in wireless sensor networks 

      Viejo Galicia, Alexandre; Domingo i Ferrer, Josep; Sebé Feixas, Francesc; Castellà Roca, Jordi (Molecular Diversity Preservation International (MDPI), 2009)
      Wireless Sensor Networks (WSN) are formed by nodes with limited computational and power resources. WSNs are finding an increasing number of applications, both civilian and military, most of which require security for the ...
    • Securing Databases by using Diagonal-based Order Preserving Symmetric Encryption 

      Martínez Rodríguez, Santi; Miret, Josep M. (Josep Maria); Valls Marsal, Magda; Tomàs, Rosana (Natural Sciences Publishing, 2014)
      The amount of information stored in databases is constantly increasing. Databases contain multiple records, each of them divided in several data fields. And some of these fields may contain sensitive information, so there ...
    • Sequence Mixed Graphs 

      Dalfó, Cristina; Fiol, Miguel Angel; López Lorenzo, Ignacio (Elsevier, 2017)
      A mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and iterated line ...
    • Sex-related differences in body condition and serum biochemical parameters in red deer (Cervus elaphus) naturally infected with Mycobacterium bovis 

      López Olvera, J. R.; Fernández de Mera, I. G.; Vidal, D.; Vicente, J.; Fierro, Y.; Gortázar, C.; Serrano Ferrón, Emmanuel (Elsevier, 2013)
      Although Mycobacterium bovis infection is commonly reported in red deer (Cervus elaphus), potential differences in the effects of infection on male and female animals in terms of body condition and clinical biochemistry ...
    • Small cutsets in arc-transitive digraphs of prime degree 

      López Masip, Susana-Clara (Elsevier, 2013)
      We give an upper bound for the size of non-trivial sets that have small boundary in a family of arc-transitive digraphs. We state the exact size for these sets in case of prime degree. We also give a lower bound for the ...
    • Space–time trends in Spanish bird electrocution rates from alternative information sources 

      Guil, Francisco; Colomer, M. Àngels (Maria Àngels); Moreno-Opo, Rubén; Margalida, Antoni (Elsevier, 2015)
      Interaction with man-made infrastructures is one of the main sources of non-natural bird mortality. Here, we use a long-term study (1980–2010) to analyse spatial and temporal patterns in avian electrocution in Spain, using ...
    • Spatio-temporal configurations of human-caused fires in Spain through point patterns 

      Costafreda Aumedes, Sergi; Comas Rodríguez, Carles; Vega García, Cristina (MDPI, 2016)
      Human-caused wildfires are often regarded as unpredictable, but usually occur in patterns aggregated over space and time. We analysed the spatio-temporal configuration of 7790 anthropogenic wildfires (2007–2013) in nine ...
    • Spectra and eigenspaces from regular partitions of Cayley (di)graphs of permutation groups 

      Dalfó, Cristina; Fiol, Miguel Angel (Elsevier, 2020)
      In this paper, we present a method to obtain regular (or equitable) partitions of Cayley (di)graphs (that is, graphs, digraphs, or mixed graphs) of permutation groups on n letters. We prove that every partition of the ...
    • Spectra and eigenspaces of arbitrary lifts of graphs 

      Dalfó, Cristina; Fiol, Miguel Angel; Pavlíková, Sona; Sirán, Josef (Faculty of Mathematics, Physics and Informatics, Comenius University, 2019)
      We describe, in a very explicit way, a method for determining the spec-tra and bases of all the corresponding eigenspaces of arbitrary lifts of graphs (regularor not).
    • Strongly formal Weierstrass non-integrability for polynomial differential systems in C2 

      Giné, Jaume; Llibre, Jaume (Bolyai Institute, University of SzegedHungarian Academy of Sciences, 2020)
      Recently a criterion has been given for determining the weakly formal Weierstrass non-integrability of polynomial differential systems in C2 . Here we extend this criterion for determining the strongly formal Weierstrass ...
    • Sufficient conditions for a digraph to admit a (1,≤ℓ)-identifying code 

      Balbuena Martínez, Camino; Dalfó, Cristina; Martínez Barona, Berenice (University of Zielona Góra, 2019)
      A (1, ≤ `)-identifying code in a digraph D is a subset C of vertices of D such that all distinct subsets of vertices of cardinality at most ` have distinct closed in-neighbourhoods within C. In this paper, we give some ...
    • Super edge-magic models 

      López Masip, Susana-Clara; Muntaner Batle, F. A.; Rius Font, Miquel (Springer, 2011)
      In this paper, we generalize the concept of super edge-magic graph by introducing the new concept of super edge-magic models.
    • Synthetic generation of social network data with endorsements 

      Pérez Rosés, Hebert; Sebé Feixas, Francesc (Palgrave Macmillan, 2014)
      In many simulation studies involving networks there is the need to rely on a sample network to perform the simulation experiments. In many cases, real network data is not available due to privacy concerns. In that case we ...
    • The (∆,D) and (∆,N) problems in double-step digraphs with unilateral distance 

      Dalfó, Cristina; Fiol, Miguel Angel (Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia, 2014)
      We study the (Delta,D) and (Delta,N) problems for double-step digraphs considering the unilateral distance, which is the minimum between the distance in the digraph and the distance in its converse digraph, obtained by ...
    • The 2-adic valuation of the cardinality of Jacobians of genus 2 curves over quadratic towers of finite fields 

      Garra Oronich, Ricard; Miret, Josep M. (Josep Maria); Pujolàs Boix, Jordi; Thériault, Nicolas (World Scientific Publishing, 2018)
      Given a genus 2 curve C defined over a finite field Fq of odd characteristic such that 2|#Jac(C)(Fq), we study the growth of the 2-adic valuation of the cardinality of the Jacobian over a tower of quadratic extensions of ...