Geochemistry and radiogenic isotope ratios of the volcanic sequences from Izu-Bonin Arc, Japan

New radiogenic isotope and trace element data are presented for the volcanic sequences along 600 km of the active Izu-Bonin arc, the Oligocene Izu arc, and their associated rift basins. As with many intra-oceanic island arcs, the Pliocene-Recent Izu-Bonin frontal-arc lavas are highly depleted in Zr, Nb and the rare-earth elements relative to typical mid-ocean ridge basalt (MORB), indicating that the mantle wedge source has undergone a previous episode of melting. Ratios between these elements (such as Nb/Zr and La/Sm), as well as 143Nd/144Nd, do not vary significantly along the length of the frontal-arc. These parameters suggest that each of the arc volcanoes is derived from similar melt fractions of the mantle wedge. However, Ba/Zr, Ba/Rb and 87Sr/86Sr increase along the frontal-arc to the north. This leads us to propose that a variable enrichment in Ba and radiogenic Sr is superimposed on the mantle wedge. Sr-Nd and Pb-Nd isotope variation indicate that both Sr and Pb become more radiogenic after fluid addition. However, Pb isotope ratios do not correlate with increases in Pb concentration or ratios such as Ba/Zr and Nb/Pb. In other words, the Pb isotopic composition of the arc lavas appears to be independent of the amount of Pb introduced by subduction fluids into the mantle source. This buffering of Pb isotopes along the frontal-arc means that the isotopic composition of the lavas is indistinguishable from that of the fluid. Isotopic mixing models presented for the arc are only illustrative of the many plausible combinations of components and quantities. Despite this, we are able to determine that the mantle wedge has isotopic characteristics similar to Indian Ocean MORB, and that the subduction-fluid solute is primarily derived from subducted oceanic basalt with a <2% contribution from subducted sediment. Lavas in the Oligocene Izu arc and fore-arc basin were derived from a mantle wedge of similar composition to the active arc. Despite levels of Pb enrichment comparable to those of the modern arc, the Pb isotopes of the Oligocene volcanics indicate a lower sediment input into the melting region.

Chemistry of Pliocene-Pleistocene pumice from the Izu-Bonin Arc

Thick pumice deposits were found in the cored sequences of forearc, arc, and backarc sites of Leg 126 in the Izu-Bonin Arc. These deposits, composed of fragmental rhyolite pumice with the chemical composition of low-alkali tholeiites, are products of arc volcanism. Pumice deposits constitute more than half of the thickness of the sediment fill of the Sumisu Rift, a backarc rift of the Izu-Bonin Arc. They comprise five thick pumiceous beds separated by thin hemipelagic units; as such, they record four major episodes or pulses of explosive, rhyolitic volcanism during the last 0.15 Ma, separated by quiescent intervals that each lasted about 30-60 k.y. The thick pumiceous beds were deposited in the rift mainly by sediment gravity flows during and immediately after the eruption of arc volcanos, which were probably submarine. Initiation of rifting was also preceded in the Pliocene by submarine rhyolitic volcanism, as seen in samples from the top of the eastern rift flank. Thick pumice beds correlative with those in the backarc also occur in the forearc basin to the east.

Clustering-based Query Routing in Cooperative Semi-structured Peer to Peer Networks

We consider the problem of resource selection in clustered Peer-to-Peer Information Retrieval (P2P IR) networks with cooperative peers. The clustered P2P IR framework presents a significant departure from general P2P IR architectures by employing clustering to ensure content coherence between resources at the resource selection layer, without disturbing document allocation. We propose that such a property could be leveraged in resource selection by adapting well-studied and popular inverted lists for centralized document retrieval. Accordingly, we propose the Inverted PeerCluster Index (IPI), an approach that adapts the inverted lists, in a straightforward manner, for resource selection in clustered P2P IR. IPI also encompasses a strikingly simple peer-specific scoring mechanism that exploits the said index for resource selection. Through an extensive empirical analysis on P2P IR testbeds, we establish that IPI competes well with the sophisticated state-of-the-art methods in virtually every parameter of interest for the resource selection task, in the context of clustered P2P IR.

Age and nature of 560–520 Ma calc-alkaline granitoids of Biarjmand, northeast Iran: insights into Cadomian arc magmatism in northern Gondwana

The Biarjmand granitoids and granitic gneisses in northeast Iran are part of the Torud–Biarjmand metamorphic complex, where previous zircon U–Pb geochronology show ages of ca. 554–530 Ma for orthogneissic rocks. Our new U–Pb zircon ages confirm a Cadomian age and show that the granitic gneiss is ~30 million years older (561.3 ± 4.7 Ma) than intruding granitoids(522.3 ± 4.2 Ma; 537.7 ± 4.7 Ma). Cadomian magmatism in Iran was part of an approximately 100-million-year-long episode of subduction-related arc and back-arc magmatism, which dominated the whole northern Gondwana margin, from Iberia to Turkey and Iran. Major REE and trace element data show that these granitoids have calc-alkaline signatures. Their zircon O (δ18O = 6.2–8.9‰) and Hf (–7.9 to +5.5; one point with εHf ~ –17.4) as well as bulk rock Nd isotopes (εNd(t)= –3 to –6.2) show that these magmas were generated via mixing of juvenile magmas with an older crust and/or melting of middle continental crust. Whole-rock Nd and zircon Hf model ages (1.3–1.6 Ga) suggest that this older continental crust was likely to have been Mesoproterozoic or even older. Our results, including variable zircon εHf(t) values, inheritance of old zircons and lack of evidence for juvenile Cadomian igneous rocks anywhere in Iran, suggest that the geotectonic setting during late Ediacaran and early Cambrian time was a continental magmatic arc rather than back-arc for the evolution of northeast Iran Cadomian igneous rocks.

Impact of node mobility in user-centric routing

Recent paradigms in wireless communication architectures describe environments where nodes present a highly dynamic behavior (e.g., User Centric Networks). In such environments, routing is still performed based on the regular packet-switched behavior of store-and-forward. Albeit sufficient to compute at least an adequate path between a source and a destination, such routing behavior cannot adequately sustain the highly nomadic lifestyle that Internet users are today experiencing. This thesis aims to analyse the impact of the nodes’ mobility on routing scenarios. It also aims at the development of forwarding concepts that help in message forwarding across graphs where nodes exhibit human mobility patterns, as is the case of most of the user-centric wireless networks today. The first part of the work involved the analysis of the mobility impact on routing, and we found that node mobility significance can affect routing performance, and it depends on the link length, distance, and mobility patterns of nodes. The study of current mobility parameters showed that they capture mobility partially. The routing protocol robustness to node mobility depends on the routing metric sensitivity to node mobility. As such, mobility-aware routing metrics were devised to increase routing robustness to node mobility. Two categories of routing metrics proposed are the time-based and spatial correlation-based. For the validation of the metrics, several mobility models were used, which include the ones that mimic human mobility patterns. The metrics were implemented using the Network Simulator tool using two widely used multi-hop routing protocols of Optimized Link State Routing (OLSR) and Ad hoc On Demand Distance Vector (AODV). Using the proposed metrics, we reduced the path re-computation frequency compared to the benchmark metric. This means that more stable nodes were used to route data. The time-based routing metrics generally performed well across the different node mobility scenarios used. We also noted a variation on the performance of the metrics, including the benchmark metric, under different mobility models, due to the differences in the node mobility governing rules of the models.

A distributed, compact routing protocol for the Internet

The Internet has grown in size at rapid rates since BGP records began, and continues to do so. This has raised concerns about the scalability of the current BGP routing system, as the routing state at each router in a shortest-path routing protocol will grow at a supra-linearly rate as the network grows. The concerns are that the memory capacity of routers will not be able to keep up with demands, and that the growth of the Internet will become ever more cramped as more and more of the world seeks the benefits of being connected. Compact routing schemes, where the routing state grows only sub-linearly relative to the growth of the network, could solve this problem and ensure that router memory would not be a bottleneck to Internet growth. These schemes trade away shortest-path routing for scalable memory state, by allowing some paths to have a certain amount of bounded “stretch”. The most promising such scheme is Cowen Routing, which can provide scalable, compact routing state for Internet routing, while still providing shortest-path routing to nearly all other nodes, with only slightly stretched paths to a very small subset of the network. Currently, there is no fully distributed form of Cowen Routing that would be practical for the Internet. This dissertation describes a fully distributed and compact protocol for Cowen routing, using the k-core graph decomposition. Previous compact routing work showed the k-core graph decomposition is useful for Cowen Routing on the Internet, but no distributed form existed. This dissertation gives a distributed k-core algorithm optimised to be efficient on dynamic graphs, along with with proofs of its correctness. The performance and efficiency of this distributed k-core algorithm is evaluated on large, Internet AS graphs, with excellent results. This dissertation then goes on to describe a fully distributed and compact Cowen Routing protocol. This protocol being comprised of a landmark selection process for Cowen Routing using the k-core algorithm, with mechanisms to ensure compact state at all times, including at bootstrap; a local cluster routing process, with mechanisms for policy application and control of cluster sizes, ensuring again that state can remain compact at all times; and a landmark routing process is described with a prioritisation mechanism for announcements that ensures compact state at all times.

Equilibrium Assignments in Competitive and Cooperative Traffic Flow Routing

Part 18: Optimization in Collaborative Networks

Vehicle Routing Problems that Minimize the Completion Time: Heuristics, Worst-Case Analyses, and Computational Results

In the standard Vehicle Routing Problem (VRP), we route a fleet of vehicles to deliver the demands of all customers such that the total distance traveled by the fleet is minimized. In this dissertation, we study variants of the VRP that minimize the completion time, i.e., we minimize the distance of the longest route. We call it the min-max objective function. In applications such as disaster relief efforts and military operations, the objective is often to finish the delivery or the task as soon as possible, not to plan routes with the minimum total distance. Even in commercial package delivery nowadays, companies are investing in new technologies to speed up delivery instead of focusing merely on the min-sum objective. In this dissertation, we compare the min-max and the standard (min-sum) objective functions in a worst-case analysis to show that the optimal solution with respect to one objective function can be very poor with respect to the other. The results motivate the design of algorithms specifically for the min-max objective. We study variants of min-max VRPs including one problem from the literature (the min-max Multi-Depot VRP) and two new problems (the min-max Split Delivery Multi-Depot VRP with Minimum Service Requirement and the min-max Close-Enough VRP). We develop heuristics to solve these three problems. We compare the results produced by our heuristics to the best-known solutions in the literature and find that our algorithms are effective. In the case where benchmark instances are not available, we generate instances whose near-optimal solutions can be estimated based on geometry. We formulate the Vehicle Routing Problem with Drones and carry out a theoretical analysis to show the maximum benefit from using drones in addition to trucks to reduce delivery time. The speed-up ratio depends on the number of drones loaded onto one truck and the speed of the drone relative to the speed of the truck.

Efficient algorithms for beacon routing in polygons

In a paper by Biro et al. [7], a novel twist on guarding in art galleries is introduced. A beacon is a fixed point with an attraction pull that can move points within the polygon. Points move greedily to monotonically decrease their Euclidean distance to the beacon by moving straight towards the beacon or sliding on the edges of the polygon. The beacon attracts a point if the point eventually reaches the beacon. Unlike most variations of the art gallery problem, the beacon attraction has the intriguing property of being asymmetric, leading to separate definitions of attraction region and inverse attraction region. The attraction region of a beacon is the set of points that it attracts. For a given point in the polygon, the inverse attraction region is the set of beacon locations that can attract the point. We first study the characteristics of beacon attraction. We consider the quality of a "successful" beacon attraction and provide an upper bound of $\sqrt{2}$ on the ratio between the length of the beacon trajectory and the length of the geodesic distance in a simple polygon. In addition, we provide an example of a polygon with holes in which this ratio is unbounded. Next we consider the problem of computing the shortest beacon watchtower in a polygonal terrain and present an $O(n \log n)$ time algorithm to solve this problem. In doing this, we introduce $O(n \log n)$ time algorithms to compute the beacon kernel and the inverse beacon kernel in a monotone polygon. We also prove that $\Omega(n \log n)$ time is a lower bound for computing the beacon kernel of a monotone polygon. Finally, we study the inverse attraction region of a point in a simple polygon. We present algorithms to efficiently compute the inverse attraction region of a point for simple, monotone, and terrain polygons with respective time complexities $O(n^2)$, $O(n \log n)$ and $O(n)$. We show that the inverse attraction region of a point in a simple polygon has linear complexity and the problem of computing the inverse attraction region has a lower bound of $\Omega(n \log n)$ in monotone polygons and consequently in simple polygons.

The 'Arc of prosperity' revisited: Homelessness policy change in north western Europe

This paper compares continuity and change in homelessness policy in Ireland, Scotland and Norway with a particular focus on the period of post-crisis austerity measures (2008-2016). The analytical approach draws on institutional theory and the notion of path dependency, which has rarely been applied to comparative homelessness research. The paper compares welfare and housing systems in the three countries prior to presenting a detailed analysis of the conceptualisation and measurement of homelessness; the institutions which address homelessness; and the evidence of change in the post-2008 period. The analysis demonstrates that challenges remain in comparing the nature of homelessness and policy responses across nation states, even where they have a number of similar characteristics, and despite some EU influence towards homelessness policy convergence. Similarly, national-level homelessness policy change could not be interpreted as entirely a result of the external shock of the 2008 general financial crisis, as existing national policy goals and programmes were also influential. Overall, embedded national frameworks and institutions were resilient, but sufficiently flexible to deliver longer term policy shifts in response to the changing nature of the homelessness problem and national policy goals. Institutionalism and path dependency were found to be useful in developing the comparative analysis of homelessness policy change and could be fruitfully applied in future longitudinal, empirical research across a wider range of countries.

A comparative study of the structural, mechanical and tribological characteristics of TiSiC-Cr coatings prepared in CH4 and C2H2 reactive atmosphere by cathodic vacuum arc

TiSiC-Cr coatings, with Cr and Si as additional elements, were deposited on Si, C 45 and 316 L steel substrates via cathodic arc evaporation. Two series of coatings with thicknesses in the range of 3.6–3.9 μm were produced, using either CH4 or C2H2 as carbon containing gas. For each series, different coatings were prepared by varying the carbon rich gas flow rate between 90 and 130 sccm, while maintaining constant cathode currents (110 and 100 A at TiSi and Cr cathodes, respectively), substrate bias (–200 V) and substrate temperature (∼320 °C). The coatings were analyzed for their mechanical characteristics (hardness, adhesion) and tribological performance (friction, wear), along with their elemental and phase composition, chemical bonds, crystalline structure and cross-sectional morphology. The coatings were found to be formed with nano-scale composite structures consisting of carbide crystallites (grain size of 3.1–8.2 nm) and amorphous hydrogenated carbon. The experimental results showed significant differences between the two coating series, where the films formed from C2H2 exhibited markedly superior characteristics in terms of microstructure, morphology, hardness, friction behaviour and wear resistance. For the coatings prepared using CH4, the measured values of crystallite size, hardness, friction coefficient and wear rate were in the ranges of 7.2–8.2 nm, 26–30 GPa, 0.3–0.4 and 2.1–4.8 × 10−6 mm3 N−1 m−1, respectively, while for the coatings grown in C2H2, the values of these characteristics were found to be in the ranges of 3.1–3.7 nm, 41–45 GPa, 0.1–0.2 and 1.4–3.0 × 10−6 mm3 N−1 m−1, respectively. Among the investigated coatings, the one produced using C2H2 at the highest flow rate (130 sccm) exhibited the highest hardness (45.1 GPa), the lowest friction coefficient (0.10) and the best wear resistance (wear rate of 1.4 × 10−6 mm3 N−1 m−1).

Query routing in cooperative semi-structured peer-to-peer information retrieval networks

Conventional web search engines are centralised in that a single entity crawls and indexes the documents selected for future retrieval, and the relevance models used to determine which documents are relevant to a given user query. As a result, these search engines suffer from several technical drawbacks such as handling scale, timeliness and reliability, in addition to ethical concerns such as commercial manipulation and information censorship. Alleviating the need to rely entirely on a single entity, Peer-to-Peer (P2P) Information Retrieval (IR) has been proposed as a solution, as it distributes the functional components of a web search engine – from crawling and indexing documents, to query processing – across the network of users (or, peers) who use the search engine. This strategy for constructing an IR system poses several efficiency and effectiveness challenges which have been identified in past work. Accordingly, this thesis makes several contributions towards advancing the state of the art in P2P-IR effectiveness by improving the query processing and relevance scoring aspects of a P2P web search. Federated search systems are a form of distributed information retrieval model that route the user’s information need, formulated as a query, to distributed resources and merge the retrieved result lists into a final list. P2P-IR networks are one form of federated search in routing queries and merging result among participating peers. The query is propagated through disseminated nodes to hit the peers that are most likely to contain relevant documents, then the retrieved result lists are merged at different points along the path from the relevant peers to the query initializer (or namely, customer). However, query routing in P2P-IR networks is considered as one of the major challenges and critical part in P2P-IR networks; as the relevant peers might be lost in low-quality peer selection while executing the query routing, and inevitably lead to less effective retrieval results. This motivates this thesis to study and propose query routing techniques to improve retrieval quality in such networks. Cluster-based semi-structured P2P-IR networks exploit the cluster hypothesis to organise the peers into similar semantic clusters where each such semantic cluster is managed by super-peers. In this thesis, I construct three semi-structured P2P-IR models and examine their retrieval effectiveness. I also leverage the cluster centroids at the super-peer level as content representations gathered from cooperative peers to propose a query routing approach called Inverted PeerCluster Index (IPI) that simulates the conventional inverted index of the centralised corpus to organise the statistics of peers’ terms. The results show a competitive retrieval quality in comparison to baseline approaches. Furthermore, I study the applicability of using the conventional Information Retrieval models as peer selection approaches where each peer can be considered as a big document of documents. The experimental evaluation shows comparative and significant results and explains that document retrieval methods are very effective for peer selection that brings back the analogy between documents and peers. Additionally, Learning to Rank (LtR) algorithms are exploited to build a learned classifier for peer ranking at the super-peer level. The experiments show significant results with state-of-the-art resource selection methods and competitive results to corresponding classification-based approaches. Finally, I propose reputation-based query routing approaches that exploit the idea of providing feedback on a specific item in the social community networks and manage it for future decision-making. The system monitors users’ behaviours when they click or download documents from the final ranked list as implicit feedback and mines the given information to build a reputation-based data structure. The data structure is used to score peers and then rank them for query routing. I conduct a set of experiments to cover various scenarios including noisy feedback information (i.e, providing positive feedback on non-relevant documents) to examine the robustness of reputation-based approaches. The empirical evaluation shows significant results in almost all measurement metrics with approximate improvement more than 56% compared to baseline approaches. Thus, based on the results, if one were to choose one technique, reputation-based approaches are clearly the natural choices which also can be deployed on any P2P network.

Vehicle routing and location routing problems with minimum latency: algorithms and models

Latency can be defined as the sum of the arrival times at the customers. Minimum latency problems are specially relevant in applications related to humanitarian logistics. This thesis presents algorithms for solving a family of vehicle routing problems with minimum latency. First the latency location routing problem (LLRP) is considered. It consists of determining the subset of depots to be opened, and the routes that a set of homogeneous capacitated vehicles must perform in order to visit a set of customers such that the sum of the demands of the customers assigned to each vehicle does not exceed the capacity of the vehicle. For solving this problem three metaheuristic algorithms combining simulated annealing and variable neighborhood descent, and an iterated local search (ILS) algorithm, are proposed. Furthermore, the multi-depot cumulative capacitated vehicle routing problem (MDCCVRP) and the multi-depot k-traveling repairman problem (MDk-TRP) are solved with the proposed ILS algorithm. The MDCCVRP is a special case of the LLRP in which all the depots can be opened, and the MDk-TRP is a special case of the MDCCVRP in which the capacity constraints are relaxed. Finally, a LLRP with stochastic travel times is studied. A two-stage stochastic programming model and a variable neighborhood search algorithm are proposed for solving the problem. Furthermore a sampling method is developed for tackling instances with an infinite number of scenarios. Extensive computational experiments show that the proposed methods are effective for solving the problems under study.