Eficiència energètica aplicada a les instal·lacions de la Universitat de Vic

En termes generals, es pot definir l’Eficiència Energètica com la reducció del consum d’energia mantenint els mateixos serveis energètics, sense disminuir el nostre confort i qualitat de vida, protegint el medi ambient, assegurant el proveïment i fomentant un comportament Sostenible al seu ús. L’objectiu principal d’aquest treball, és reduir el consum d’energia i terme de potència contractat a la Universitat de Vic, aplicant un programa d’estalvi amb mesures correctores en el funcionament de les seves instal·lacions o espais. Per tal de poder arribar a aquest objectiu marcat, prèviament s’ha realitzat un estudi acurat, obtenint tota la informació necessària per poder aplicar les mesures correctores a la bossa més important de consum. Un cop trobada, dur a terme l’estudi de la viabilitat de la inversió de les mesures correctores més eficients, optimitzant els recursos destinats. L’espai on s’ha dut a terme l’estudi, ha estat a l’edifici F del Campus Miramarges, seguint les indicacions d’Arnau Bardolet (Cap de Manteniment de la UVIC). Aquest edifici consta d’un entresol, baixos i quatre plantes. L’equip de mesura que s’ha fet servir per realitzar l’estudi, és de la marca Circutor sèrie AR5-L, aquests equips són programables que mesuren, calculen i emmagatzemen en memòria els principals paràmetres elèctrics en xarxes trifàsiques. Els projectes futurs complementaris que es podrien realitzar a part d’aquest són: instal·lar sensors, instal·lar mòduls convertidors TCP/IP, aprofitar la xarxa intranet i crear un escada amb un sinòptic de control i gestió des d’un punt de treball. Aquest aplicatiu permet visualitzar en una pantalla d’un PC tots els estats dels elements controlats mitjançant un sinòptic (encendre/parar manualment l’enllumenat i endolls de les aules, estat d’enllumenat i endolls de les aules, consums instantanis/acumulats energètics, estat dels passadissos entre altres) i explotar les dades recollides a la base de dades. Cada espai tindria la seva lògica de funcionament automàtic específic. Entre les conclusions més rellevants obtingudes en aquest treball s’observa: · Que és pot reduir la potència contractada a la factura a l’estar per sota de la realment consumida. · Que no hi ha penalitzacions a la factura per consum de reactiva, ja que el compensador funciona correctament. · Que es pot reduir l’horari de l’inici del consum d’energia, ja que no correspon a l’activitat docent. · Els valors de la tensió i freqüència estan dintre de la normalitat. · Els harmònics estan al llindar màxim. Analitzant aquestes conclusions, voldria destacar les mesures correctores més importants que es poden dur a terme: canvi tecnològic a LED, temporitzar automàticament l’encesa i apagada dels fluorescents i equips informàtics de les aules “seguint calendari docent”, instal·lar sensors de moviment amb detecció lumínica als passadissos. Totes les conclusions extretes d’aquest treball, es poden aplicar a tots els edificis de la facultat, prèviament realitzant l’estudi individual de cadascuna, seguint els mateixos criteris per tal d’optimitzar la inversió.

Control d'il·luminació i ventilació d'un pàrquing

El treball presentat ve motivat per la necessitat d’instal•lació d’un pàrquing públic i privat de nova construcció a nivell d’il•luminació i ventilació. Per poder satisfer les necessitats del nostre client d’estalvi energètic i confort en l’edifici es decideix d’implementar una instal•lació immòtica que és l’aplicació de tècniques de gestió i control automatitzat a un edifici terciari amb bus de comunicació KNX/EIB. Per a la il•luminació s’han utilitzat fluorescents amb balasts DALI, que permeten la seva regulació i control, per així poder adequar en tot moment l’encesa i intensitat de llum d’aquests. En quant a la ventilació s’han utilitzat variadors de freqüència per també poder optimitzar el funcionament dels ventiladors podent posar-los en marxa quan realment sigui necessari i a la potència que calgui. Per enllaçar tots els elements de la instal•lació, detectors i actuadors, sorgeig la necessitat d’implementar xarxes de comunicació com el KNX/EIB, DALI, Modbus i Ethernet. Per gestionar variables, comunicacions i controlar elements, s´hi han implementen dos autòmats programables a més d’un PC integrat per la visualització i el control del pàrquing. S’ha aconseguit de realitzar un pàrquing totalment automàtic on no és necessaria l’actuació dels operaris i amb les principals càrregues elèctriques totalment regulables en potència. S’ha comprovat que la instal•lació funciona per sota de la potència nominal de les càrregues amb l’estalvi energètic que això suposa.

Reversible ferromagnetic switching in ZnO:(Co,Mn) powders

We report here on the magnetic properties of ZnO:Mn- and ZnO:Co-doped nanoparticles. We have found that the ferromagnetism of ZnO:Mn can be switched on and off by consecutive low-temperature annealings in O2 and N2, respectively, while the opposite phenomenology was observed for ZnO:Co. These results suggest that different defects (presumably n-type for ZnO:Co and p-type for ZnO:Mn) are required to induce a ferromagnetic coupling in each case. We will argue that ferromagnetism is likely to be restricted to a very thin, nanometric layer at the grain surface. These findings reveal and give insight into the dramatic relevance of surface effects to the occurrence of ferromagnetism in ZnO-doped oxides.

Networks of people in specialty production: family firms in the iron and steel Wire industries in Spain (1870-2000)

Capital intensive industries in specialized niches of production have constituted solid ground for family firms in Spain , as evidenced by the experience of the iron and steel wire industries between 1870 and 2000. The embeddedness of these firms in their local and regional environments have allowed the creation of networks that, together with favourable institutional conditions, significantly explain the dominance of family entrepreneurship in iron and steel wire manufacturing in Spain, until the end of the 20 th century. Dominance of family firms at the regional level has not been not an obstacle for innovation in wire manufacturing in Spain, which has taken place even when institutional conditions blocked innovation and traditional networking. Therefore, economic theories about the difficulties dynastic family firms may have to perform appropriately in science-based industries must be questioned

Communication in networks with hierarchical branching

We present a simple model of communication in networks with hierarchical branching. We analyze the behavior of the model from the viewpoint of critical systems under different situations. For certain values of the parameters, a continuous phase transition between a sparse and a congested regime is observed and accurately described by an order parameter and the power spectra. At the critical point the behavior of the model is totally independent of the number of hierarchical levels. Also scaling properties are observed when the size of the system varies. The presence of noise in the communication is shown to break the transition. The analytical results are a useful guide to forecasting the main features of real networks.

Absence of epidemic threshold in scale free networks with degree correlations

Random scale-free networks have the peculiar property of being prone to the spreading of infections. Here we provide for the susceptible-infected-susceptible model an exact result showing that a scale-free degree distribution with diverging second moment is a sufficient condition to have null epidemic threshold in unstructured networks with either assortative or disassortative mixing. Degree correlations result therefore irrelevant for the epidemic spreading picture in these scale-free networks. The present result is related to the divergence of the average nearest neighbors degree, enforced by the degree detailed balance condition.

Synchronization reveals topological scales in complex networks

We study the relationship between topological scales and dynamic time scales in complex networks. The analysis is based on the full dynamics towards synchronization of a system of coupled oscillators. In the synchronization process, modular structures corresponding to well-defined communities of nodes emerge in different time scales, ordered in a hierarchical way. The analysis also provides a useful connection between synchronization dynamics, complex networks topology, and spectral graph analysis.

Self-similarity of complex networks and hidden metric spaces

We demonstrate that the self-similarity of some scale-free networks with respect to a simple degree-thresholding renormalization scheme finds a natural interpretation in the assumption that network nodes exist in hidden metric spaces. Clustering, i.e., cycles of length three, plays a crucial role in this framework as a topological reflection of the triangle inequality in the hidden geometry. We prove that a class of hidden variable models with underlying metric spaces are able to accurately reproduce the self-similarity properties that we measured in the real networks. Our findings indicate that hidden geometries underlying these real networks are a plausible explanation for their observed topologies and, in particular, for their self-similarity with respect to the degree-based renormalization.

Percolation and epidemic thresholds in clustered networks

We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant connected component, it cannot restore a finite percolation threshold. In turn, this implies the absence of an epidemic threshold in this class of networks, thus extending this result to a wide variety of real scale-free networks which shows a high level of transitivity. Our findings are in good agreement with numerical simulations.

Clustering in complex networks. I. General formalism

We develop a full theoretical approach to clustering in complex networks. A key concept is introduced, the edge multiplicity, that measures the number of triangles passing through an edge. This quantity extends the clustering coefficient in that it involves the properties of two¿and not just one¿vertices. The formalism is completed with the definition of a three-vertex correlation function, which is the fundamental quantity describing the properties of clustered networks. The formalism suggests different metrics that are able to thoroughly characterize transitive relations. A rigorous analysis of several real networks, which makes use of this formalism and the metrics, is also provided. It is also found that clustered networks can be classified into two main groups: the weak and the strong transitivity classes. In the first class, edge multiplicity is small, with triangles being disjoint. In the second class, edge multiplicity is high and so triangles share many edges. As we shall see in the following paper, the class a network belongs to has strong implications in its percolation properties.

Generalized percolation in random directed networks

We develop a general theory for percolation in directed random networks with arbitrary two-point correlations and bidirectional edgesthat is, edges pointing in both directions simultaneously. These two ingredients alter the previously known scenario and open new views and perspectives on percolation phenomena. Equations for the percolation threshold and the sizes of the giant components are derived in the most general case. We also present simulation results for a particular example of uncorrelated network with bidirectional edges confirming the theoretical predictions.

Clustering in complex networks. II. Percolation properties

The percolation properties of clustered networks are analyzed in detail. In the case of weak clustering, we present an analytical approach that allows us to find the critical threshold and the size of the giant component. Numerical simulations confirm the accuracy of our results. In more general terms, we show that weak clustering hinders the onset of the giant component whereas strong clustering favors its appearance. This is a direct consequence of the differences in the k-core structure of the networks, which are found to be totally different depending on the level of clustering. An empirical analysis of a real social network confirms our predictions.

Tuning clustering in random networks with arbitrary degree distributions

We present a generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable. Following the same philosophy as in the configuration model, the degree distribution and the clustering coefficient for each class of nodes of degree k are fixed ad hoc and a priori. The algorithm generates corresponding topologies by applying first a closure of triangles and second the classical closure of remaining free stubs. The procedure unveils an universal relation among clustering and degree-degree correlations for all networks, where the level of assortativity establishes an upper limit to the level of clustering. Maximum assortativity ensures no restriction on the decay of the clustering coefficient whereas disassortativity sets a stronger constraint on its behavior. Correlation measures in real networks are seen to observe this structural bound.