Label Space Reduction in All-Optical Label Switchiing Networks

Report for the scientific sojourn at the Department of Information Technology (INTEC) at the Ghent University, Belgium, from january to june 2007. All-Optical Label Swapping (AOLS) forms a key technology towards the implementation of All-Optical Packet Switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the wayin which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This project studies and proposes All-Optical Label Stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this project, an Integer Lineal Program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more.

BCN­Routing : càlcul web de rutes amb pgRouting, OpenStreetMap i OpenLayers

En aquest projecte s'ha desenvolupat una interfície web per calcular rutes a la ciutat de Barcelona. Les rutes calculades són a peu, entre un punt d'origen qualsevol i un punt d'interès turístic de la ciutat com a destí. Per això s'han extret les dades dels carrers de Barcelona d'OpenStreetMap i s'han insertat a una base de dades postgreSQL/postGIS, juntament amb una capa vectorial de punts d'interès turístic que s'ha creat amb el SIG d'escriptori qGIS. El càlcul de les rutes amb les dades de la base de dades s'ha realitzat amb l'extensió pgRouting, i la interfície web per seleccionar els punts d'origen i destí, mostrar els mapes, i mostrar les rutes resultat, s'ha desenvolupat utilitzant la llibreria OpenLayers.

An improved method for discovering link criticality in transport networks

Quantitatively assessing the importance or criticality of each link in a network is of practical value to operators, as that can help them to increase the network's resilience, provide more efficient services, or improve some other aspect of the service. Betweenness is a graph-theoretical measure of centrality that can be applied to communication networks to evaluate link importance. However, as we illustrate in this paper, the basic definition of betweenness centrality produces inaccurate estimations as it does not take into account some aspects relevant to networking, such as the heterogeneity in link capacity or the difference between node-pairs in their contribution to the total traffic. A new algorithm for discovering link centrality in transport networks is proposed in this paper. It requires only static or semi-static network and topology attributes, and yet produces estimations of good accuracy, as verified through extensive simulations. Its potential value is demonstrated by an example application. In the example, the simple shortest-path routing algorithm is improved in such a way that it outperforms other more advanced algorithms in terms of blocking ratio

All-Optical Label Stacking: Easing the Trade-offs Between Routing and Architecture Cost in All-Optical Packet Switching

All-optical label swapping (AOLS) forms a key technology towards the implementation of all-optical packet switching nodes (AOPS) for the future optical Internet. The capital expenditures of the deployment of AOLS increases with the size of the label spaces (i.e. the number of used labels), since a special optical device is needed for each recognized label on every node. Label space sizes are affected by the way in which demands are routed. For instance, while shortest-path routing leads to the usage of fewer labels but high link utilization, minimum interference routing leads to the opposite. This paper studies all-optical label stacking (AOLStack), which is an extension of the AOLS architecture. AOLStack aims at reducing label spaces while easing the compromise with link utilization. In this paper, an integer lineal program is proposed with the objective of analyzing the softening of the aforementioned trade-off due to AOLStack. Furthermore, a heuristic aiming at finding good solutions in polynomial-time is proposed as well. Simulation results show that AOLStack either a) reduces the label spaces with a low increase in the link utilization or, similarly, b) uses better the residual bandwidth to decrease the number of labels even more

One kind of lawlessness: estimating the welfare cost of Somali piracy

This paper estimates the effect of piracy attacks on shipping costs using a unique data set on shipping contracts in the dry bulk market. We look at shipping routes whose shortest path exposes them to piracy attacks and find that the increase in attacks in 2008 lead to around a ten percent increase in shipping costs. We use this estimate to get a sense of the welfare loss imposed by piracy. Our intermediate estimate suggests that the creation of $120 million of revenue for pirates in the Somalia area led to a welfare loss of over $1.5 billion.

The first SEPServer event catalogue 68-MeV solar proton events observed at 1 AU in 1996-2010

SEPServer is a three-year collaborative project funded by the seventh framework programme (FP7-SPACE) of the European Union. The objective of the project is to provide access to state-of-the-art observations and analysis tools for the scientific community on solar energetic particle (SEP) events and related electromagnetic (EM) emissions. The project will eventually lead to better understanding of the particle acceleration and transport processes at the Sun and in the inner heliosphere. These processes lead to SEP events that form one of the key elements of space weather. In this paper we present the first results from the systematic analysis work performed on the following datasets: SOHO/ERNE, SOHO/EPHIN, ACE/EPAM, Wind/WAVES and GOES X-rays. A catalogue of SEP events at 1 AU, with complete coverage over solar cycle 23, based on high-energy (~68-MeV) protons from SOHO/ERNE and electron recordings of the events by SOHO/EPHIN and ACE/EPAM are presented. A total of 115 energetic particle events have been identified and analysed using velocity dispersion analysis (VDA) for protons and time-shifting analysis (TSA) for electrons and protons in order to infer the SEP release times at the Sun. EM observations during the times of the SEP event onset have been gathered and compared to the release time estimates of particles. Data from those events that occurred during the European day-time, i.e., those that also have observations from ground-based observatories included in SEPServer, are listed and a preliminary analysis of their associations is presented. We find that VDA results for protons can be a useful tool for the analysis of proton release times, but if the derived proton path length is out of a range of 1 AU < s[3 AU, the result of the analysis may be compromised, as indicated by the anti-correlation of the derived path length and release time delay from the asso ciated X-ray flare. The average path length derived from VDA is about 1.9 times the nominal length of the spiral magnetic field line. This implies that the path length of first-arriving MeV to deka-MeV protons is affected by interplanetary scattering. TSA of near-relativistic electrons results in a release time that shows significant scatter with respect to the EM emissions but with a trend of being delayed more with increasing distance between the flare and the nominal footpoint of the Earth-connected field line.

Random walk radiosity with generalized absorption probabilities

The author studies random walk estimators for radiosity with generalized absorption probabilities. That is, a path will either die or survive on a patch according to an arbitrary probability. The estimators studied so far, the infinite path length estimator and finite path length one, can be considered as particular cases. Practical applications of the random walks with generalized probabilities are given. A necessary and sufficient condition for the existence of the variance is given, together with heuristics to be used in practical cases. The optimal probabilities are also found for the case when one is interested in the whole scene, and are equal to the reflectivities

Tracing the Origin and Spread of Agriculture in Europe

The origins of early farming and its spread to Europe have been the subject of major interest for some time. The main controversy today is over the nature of the Neolithic transition in Europe: the extent to which the spread was, for the most part, indigenous and animated by imitatio (cultural diffusion) or else was driven by an influx of dispersing populations (demic diffusion). We analyze the spatiotemporal dynamics of the transition using radiocarbon dates from 735 early Neolithic sites in Europe, the Near East, and Anatolia. We compute great-circle and shortest-path distances from each site to 35 possible agricultural centers of origin—ten are based on early sites in the Middle East and 25 arehypothetical locations set at 58 latitude/longitude intervals. We perform a linear fit of distance versus age (and viceversa) for each center. For certain centers, high correlation coefficients (R . 0.8) are obtained. This implies that a steady rate or speed is a good overall approximation for this historical development. The average rate of the Neolithic spread over Europe is 0.6–1.3 km/y (95% confidence interval). This is consistent with the prediction of demic diffusion(0.6–1.1 km/y). An interpolative map of correlation coefficients, obtained by using shortest-path distances, shows thatthe origins of agriculture were most likely to have occurred in the northern Levantine/Mesopotamian area

Free and fragmenting filling length

The filling length of an edge-circuit η in the Cayley 2-complex of a finite presentation of a group is the minimal integer length L such that there is a combinatorial null-homotopy of η down to a base point through loops of length at most L. We introduce similar notions in which the full-homotopy is not required to fix a base point, and in which the contracting loop is allowed to bifurcate. We exhibit a group in which the resulting filling invariants exhibit dramatically different behaviour to the standard notion of filling length. We also define the corresponding filling invariants for Riemannian manifolds and translate our results to this setting.

Stable rank of leavitt path algebra

We characterize the values of the stable rank for Leavitt path algebras, by giving concrete criteria in terms of properties of the underlying graph.

Turkey's accession to the EU: interests, ideas and path dependence

The paper is divided into four sections. The first offers a critical assessment of explanations of both rationalist and constructivist approaches currently dominating European studies and assesses the notion of path dependence. The second and third sections analyse the role of both material interests and polity ideas in EU enlargement to Turkey, and conclude that explanations exclusively based on either strategic calculations or values and identities have significant shortcomings. The fourth section examines the institutional path of Turkey's candidacy to show how the course of action begun at Helsinki restricted the range of possible and legitimate options three years later in Copenhagen.

Chain conditions for Leavitt path algebras

In this paper, results known about the artinian and noetherian conditions for the Leavitt path algebras of graphs with finitely many vertices are extended to all row-finite graphs. In our first main result, necessary and sufficient conditions on a row-finite graph E are given so that the corresponding (not necessarily unital) Leavitt path K-algebra L(E) is semisimple. These are precisely the algebras L(E)for which every corner is left (equivalently, right)artinian. They are also precisely the algebras L(E) for which every finitely generated left (equivalently, right) L(E)-module is artinian. In our second main result, we give necessary and sufficient conditions for every corner of L(E) to be left (equivalently, right) noetherian. They also turn out to be precisely those algebras L(E) for which every finitely generated left(equivalently, right) L(E)-module is noetherian. In both situations, isomorphisms between these algebras and appropriate direct sums of matrix rings over K or K[x, x−1] are provided. Likewise, in both situations, equivalent graph theoretic conditions on E are presented.

The Difficult and tortuous path of agricultural cooperative networks in spain, 1890-1935

The rural associationism developed from the last decades of the XIX century could be consider as an answer of the agriculturists to the increasing integration of agriculture in the market, and to the effects of the Great Depression. In the case of Spain, the initiatives in this sense arose with certain delay in relation to the countries of Western Europe. The beginning of the Spanish cooperativism is closely bound to the Law of 1906. It granted the agrarian cooperatives with fiscal exemptions and other types of supports to the associates, although the process did not really accelerate until the promulgation of the law regulation in 1908.

A classification, up to hyperbolicity, of groups given by 2 generators and one relator of length 8

"Vegeu el resum a l'inici del document del fitxer adjunt."

Survival, development and growth of larvae of the blue swimmer crab, Portunus pelagicus, cultured under different photoperiod conditions

The blue swimmer crab is a commercially important species of the tropical Indo-Pacific regions that shows substantial potential as a candidate species for aquaculture. Optimization of larval rearing conditions, including photoperiod, is therefore important to establish a method for the intensive hatchery culture of this species. Newly hatched larvae of Portunuspelagicus in first zoeal stage (ZI) were reared under five photoperiod regimes 0L: 24D, 6L: 18D, 12L: 12D, 18L: 6D, and 24L: 0D (5 replicates per treatment) till they metamorphosed to megalopae (ranged from 8.5 ± 0.3 days (18L: 6D) to 10.8 ± 1.8 days (0L: 24D) at 29 ± 1 °C). Daily, larvae of each treatment were fed an identical diet of mixed rotifer and Artemia nauplii, and the survival and molt to successive stages was monitored. Newly hatched ZI larvae of P. pelagicus could successfully develop to the megalopal stage under all tested photoperiod conditions, but we detected significant differences in survival among treatments (p & 0.05). The constant darkness treatment (0L: 24D) had the lowest (19.2 ± 7.2%, mean ± S.E.) cumulative survival from ZI to the megalopal stage, while the 18L: 6D treatment achieved the highest survival (51.2 ± 23.6%). Similarly, the photoperiod significantly affected zoeal development. Constant darkness led to the longest cumulative zoeal duration (10.8 ± 1.8 days), whereas the 18L: 6D treatment rendered the shortest larval development (8.5 ± 0.3 days). In addition, larvae reared under constant darkness resulted in the smallest megalopae (carapace length = 1.44 ± 0.09 mm) and the lowest dry weight (0.536 ± 0.188 mg). In conclusion, photoperiod significantly affected the survival, development, and growth of P. pelagicus zoeal larvae. Constant darkness led to the lowest larval survival and developmental rate, while a photoperiod regime of 18L: 6D appeared to be the most suitable condition for the rearing of zoeal larvae of P. pelagicus.