Sublinear bounds for randomized leader election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O(√ √nlog^3/2n) messages to elect a unique leader (with high probability). When considering the "explicit" variant of leader election where eventually every node knows the identity of the leader, our algorithm yields the asymptotically optimal bounds of O(1) rounds and O(. n) messages. This algorithm is then extended to one solving leader election on any connected non-bipartite n-node graph G in O(τ(. G)) time and O(τ(G)n√log^3/2n) messages, where τ(. G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficient deterministic leader election algorithms. Finally, we present an almost matching lower bound for randomized leader election, showing that Ω(n) messages are needed for any leader election algorithm that succeeds with probability at least 1/. e+. ε, for any small constant ε. >. 0. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.

Variance-Constrained Capacity of the Molecular Timing Channel with Synchronization Error

Molecular communication is set to play an important role in the design of complex biological and chemical systems. An important class of molecular communication systems is based on the timing channel, where information is encoded in the delay of the transmitted molecule - a synchronous approach. At present, a widely used modeling assumption is the perfect synchronization between the transmitter and the receiver. Unfortunately, this assumption is unlikely to hold in most practical molecular systems. To remedy this, we introduce a clock into the model - leading to the molecular timing channel with synchronization error. To quantify the behavior of this new system, we derive upper and lower bounds on the variance-constrained capacity, which we view as the step between the mean-delay and the peak-delay constrained capacity. By numerically evaluating our bounds, we obtain a key practical insight: the drift velocity of the clock links does not need to be significantly larger than the drift velocity of the information link, in order to achieve the variance-constrained capacity with perfect synchronization.

Neolithic settlement at the woodland’s edge: palynological data and timber architecture in Orkney, Scotland

It has often been assumed that the islands of Orkney were essentially treeless throughout much of the Holocene, with any ‘scrub’ woodland having been destroyed by Neolithic farming communities by around 3500 cal. BC. This apparently open, hyper-oceanic environment would presumably have provided quite marginal conditions for human settlement, yet Neolithic communities flourished and the islands contain some of the most spectacular remains of this period in north-west Europe. The study of new Orcadian pollen sequences, in conjunction with the synthesis of existing data, indicates that the timing of woodland decline was not synchronous across the archipelago, beginning in the Mesolithic, and that in some areas woodland persisted into the Bronze Age. There is also evidence to suggest that woodland communities in Orkney were more diverse, and therefore that a wider range of resources was available to Neolithic people, than has previously been assumed. Recent archaeological investigations have revealed evidence for timber buildings at early Neolithic settlement sites, suggesting that the predominance of stone architecture in Neolithic Orkney may not have been due to a lack of timber as has been supposed. Rather than simply reflecting adaptation to resource constraints, the reasons behind the shift from timber to stone construction are more complex and encompass social, cultural and environmental factors.

Transatlantic distribution of the Alaskan White River Ash

Volcanic ash layers preserved within the geologic record represent precise time markers that correlate disparate depositional environments and enable the investigation of synchronous and/or asynchronous behaviors in Earth system and archaeological sciences. However, it is generally assumed that only exceptionally powerful events, such as supereruptions (≥450 km3 of ejecta as dense-rock equivalent; recurrence interval of ∼105 yr), distribute ash broadly enough to have an impact on human society, or allow us to address geologic, climatic, and cultural questions on an intercontinental scale. Here we use geochemical, age, and morphological evidence to show that the Alaskan White River Ash (eastern lobe; A.D. 833–850) correlates to the “AD860B” ash (A.D. 846–848) found in Greenland and northern Europe. These occurrences represent the distribution of an ash over 7000 km, linking marine, terrestrial, and ice-core records. Our results indicate that tephra from more moderate-size eruptions, with recurrence intervals of ∼100 yr, can have substantially greater distributions than previously thought, with direct implications for volcanic dispersal studies, correlation of widely distributed proxy records, and volcanic hazard assessment.

The latest LGM culmination of the Garda Glacier (Italian Alps) and the onset of glacial termination. Age of glacial collapse and vegetation chronosequence

In the deglacial sequence of the largest end moraine system of the Italian Alps, we focused on the latest culmination of the Last Glacial Maximum, before a sudden downwasting of the piedmontane lobe occupying the modern lake basin. We obtained a robust chronology for this culmination and for the subsequent deglacial history by cross-radiocarbon dating of a proximal fluvioglacial plain and of a deglacial continuous lake sedimentation. We used reworked dinocysts to locate sources of glacial abrasion and to mark the input of glacial meltwater until depletion. The palynological record from postglacial lake sediments provided the first vegetation chronosequence directly reacting to the early Lateglacial withdrawal so far documented in the Alps.

Glacier collapse occurred soon after 17.46 +/- 0.2 ka cal BP, which is, the Manerba advance culmination. Basin deglaciation of several overdeepened foreland piedmont lakes on southern and northern sides of the Alps appears to be synchronous at millennial scale and near-synchronous with large-scale glacial retreat at global scale. The pioneering succession shows a first afforestation step at a median modeled age of 64 years after deglaciation, while rapid tree growth lagged 7 centuries. Between 16.4 +/- 0.16 and 15.5 +/- 0.16 ka cal BP, a regressive phase interrupted forest growth marking a Lateglacial phase of continental-dry climate predating GI-1. This event, spanning the most advanced phases of North-Atlantic H1, is consistently radiocarbon-framed at three deglacial lake records so far investigated on the Italian side of the Alps. Relationships with the Gschnitz stadial from the Alpine record of Lateglacial advances are discussed

Small Signal Stability Performance of Power System during High Penetration of Wind Generation

The small signal stability of interconnected power systems is one of the important aspects that need to be investigated since the oscillations caused by this kind of instability have caused many incidents. With the increasing penetration of wind power in the power system, particularly doubly fed induction generator (DFIG), the impact on the power system small signal stability performance should be fully investigated. Because the DFIG wind turbine integration is through a fast action converter and associated control, it does not inherently participate in the electromechanical small signal oscillation. However, it influences the small signal stability by impacting active power flow paths in the network and replacing synchronous generators that have power system stabilizer (PSS). In this paper, the IEEE 39 bus test system has been used in the analysis. Furthermore, four study cases and several operation scenarios have been conducted and analysed. The selective eigenvalue Arnoldi/lanczos's method is used to obtain the system eigenvalue in the range of frequency from 0.2 Hz to 2 Hz which is related to electromechanical oscillations. Results show that the integration of DFIG wind turbines in a system during several study cases and operation scenarios give different influence on small signal stability performance.

Algorithms for Hidden Markov Models With Imprecisely Specified Parameters

Hidden Markov models (HMMs) are widely used models for sequential data. As with other probabilistic graphical models, they require the specification of precise probability values, which can be too restrictive for some domains, especially when data are scarce or costly to acquire. We present a generalized version of HMMs, whose quantification can be done by sets of, instead of single, probability distributions. Our models have the ability to suspend judgment when there is not enough statistical evidence, and can serve as a sensitivity analysis tool for standard non-stationary HMMs. Efficient inference algorithms are developed to address standard HMM usage such as the computation of likelihoods and most probable explanations. Experiments with real data show that the use of imprecise probabilities leads to more reliable inferences without compromising efficiency.

Biological control of the fish louse in a rainbow trout fishery

Novel egg-laying boards were found to be effective in the biological control of the freshwater fish louse Argulus foliaceus in a 12.9 ha rainbow trout Oncorhynchus mykiss fishery which had a high prevalence and intensity of infection of juvenile parasites in the early spring of 1999. Approximately 228 000d during an extensive 14 week period of egg laying which peaked in June 1999. In contrast, only 1566 clutches were harvested in 2000, when egg laying activity showed a bi-modal distribution, peaking in May and again in July and August. iaceus on rainbow trout in consecutive years was 2.9 : 1 and 2.1 : 1. Estimates of the size of the female A. foliaceus population based on egg-laying activity in 1999 exceeded that derived from measurements of prevalence and intensity of infection, whereas in 2000, this was more in balance. A minimum temperature of 10 degree C was identified for egg laying, which occurred continuously from May to October in a broadly synchronous manner.. Copyright 2002 The Fisheries Society of the British Isles

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This article focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. In particular, the seemingly obvious lower bounds of Ω(m) messages, where m is the number of edges in the network, and Ω(D) time, where D is the network diameter, are nontrivial to show for randomized (Monte Carlo) algorithms. (Recent results, showing that even Ω(n), where n is the number of nodes in the network, is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms, except for the restricted case of comparison algorithms, where it was also required that nodes may not wake up spontaneously and that D and n were not known. We establish these fundamental lower bounds in this article for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (namely, algorithms that work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make any use of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time leader election algorithm is known. A slight adaptation of our lower bound technique gives rise to an Ω(m) message lower bound for randomized broadcast algorithms. 

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. The answer is known to be negative in the deterministic setting. We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that tradeoff messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

Distal tephrochronology in volcanic regions: Challenges and insights from Kamchatkan lake sediments

Kamchatka is one of the world’s most active volcanic regions and has hosted many explosive eruptions during the Holocene. These eruptions had the potential to disperse tephra over wide areas, forming time-synchronous markers wherever those tephras are found. Recent research in Kamchatka has begun to focus on the geochemical analysis of individual glass shards in order to characterise tephra layers. We have applied this approach to the study of visible tephras from three lakes – one in central and two in northern Kamchatka – with the aim of identifying key tephras and potential issues in the application of distal (>100 km from an active volcano) tephra in volcanically complex regions. In total, 23 tephras from 22 tephra beds have been geochemically analysed, representing products from at least four volcanic systems in Kamchatka. We demonstrate that distal lake sediments in the region can yield reliable tephrostratigraphies, capturing tephra from eruptions that have the greatest potential to disperse volcanic ash beyond the region. We draw attention to issues relating to correlating and distinguishing key marker horizons from the highly active Shiveluch Volcano, namely the need to ensure inter-lab comparability of geochemical data and good chronological control of the proximal and distal tephras. Importantly, we have also extended the known distribution of two key tephra isochrons from the Ksudach volcano. Our work contributes valuable glass geochemical on data several key marker beds that will facilitate future tephra and palaeoenvironmental research within and beyond Kamchatka.

Progress towards improving chronologies for marine sediment records.

The North Atlantic has played a key role in abrupt climate changes due to the sensitivity of the Atlantic Meridional Overturning Circulation (AMOC) to the location and strength of deep water formation. It is crucial for modelling future climate change to understand the role of the AMOC in the rapid warming and gradual cooling cycles known as Dansgaard-Oescher (DO) events which are recorded in the Greenland ice cores. However, palaeoceanographic research into DO events has been hampered by the uncertainty in timing due largely to the lack of a precise chronological time frame for marine records. While tephrochronology provides links to the Greenland ice core records at a few points, radiocarbon remains the primary dating method for most marine cores. Due to variations in the atmospheric and oceanic 14C concentration, radiocarbon ages must be calibrated to provide calendric ages. The IntCal Working Group provides a global estimate of ocean 14C ages for calibration of marine radiocarbon dates, but the variability of the surface marine reservoir age in the North Atlantic particularly during Heinrich or DO events, makes calibration uncertain. In addition, the current Marine09 radiocarbon calibration beyond around 15 ka BP is largely based on 'tuning' to the Hulu Cave isotope record, so that the timing of events may not be entirely synchronous with the Greenland ice cores. The use of event-stratigraphy and independent chronological markers such as tephra provide the scope to improve marine radiocarbon reservoir age estimates particularly in the North Atlantic where a number of tephra horizons have been identified in both marine sediments and the Greenland ice cores. Quantification of timescale uncertainties is critical but statistical techniques which can take into account the differential dating between events can improve the precision. Such techniques should make it possible to develop specific marine calibration curves for selected regions.

The significance of interconnector counter-trading in a security constrained electricity market

Throughout the European Union there is an increasing amount of wind generation being dispatched-down due to the binding of power system operating constraints from high levels of wind generation. This paper examines the impact a system non-synchronous penetration limit has on the dispatch-down of wind and quantifies the significance of interconnector counter-trading to the priority dispatching of wind power. A fully coupled economic dispatch and security constrained unit commitment model of the Single Electricity Market of the Republic of Ireland and Northern Ireland and the British Electricity Trading and Transmission Arrangement was used in this study. The key finding was interconnector counter-trading reduces the impact the system non-synchronous penetration limit has on the dispatch-down of wind. The capability to counter-trade on the interconnectors and an increase in system non-synchronous penetration limit from 50% to 55% reduces the dispatch-down of wind by 311 GW h and decreases total electricity payments to the consumer by €1.72/MW h. In terms of the European Union electricity market integration, the results show the importance of developing individual electricity markets that allow system operators to counter-trade on interconnectors to ensure the priority dispatch of the increasing levels of wind generation.

Exploiting dynamic timing margins in microprocessors for frequency-over-scaling with instruction-based clock adjustment

Static timing analysis provides the basis for setting the clock period of a microprocessor core, based on its worst-case critical path. However, depending on the design, this critical path is not always excited and therefore dynamic timing margins exist that can theoretically be exploited for the benefit of better speed or lower power consumption (through voltage scaling). This paper introduces predictive instruction-based dynamic clock adjustment as a technique to trim dynamic timing margins in pipelined microprocessors. To this end, we exploit the different timing requirements for individual instructions during the dynamically varying program execution flow without the need for complex circuit-level measures to detect and correct timing violations. We provide a design flow to extract the dynamic timing information for the design using post-layout dynamic timing analysis and we integrate the results into a custom cycle-accurate simulator. This simulator allows annotation of individual instructions with their impact on timing (in each pipeline stage) and rapidly derives the overall code execution time for complex benchmarks. The design methodology is illustrated at the microarchitecture level, demonstrating the performance and power gains possible on a 6-stage OpenRISC in-order general purpose processor core in a 28nm CMOS technology. We show that employing instruction-dependent dynamic clock adjustment leads on average to an increase in operating speed by 38% or to a reduction in power consumption by 24%, compared to traditional synchronous clocking, which at all times has to respect the worst-case timing identified through static timing analysis.

Hidden Markov Models With Set-Valued Parameters

Hidden Markov models (HMMs) are widely used probabilistic models of sequential data. As with other probabilistic models, they require the specification of local conditional probability distributions, whose assessment can be too difficult and error-prone, especially when data are scarce or costly to acquire. The imprecise HMM (iHMM) generalizes HMMs by allowing the quantification to be done by sets of, instead of single, probability distributions. iHMMs have the ability to suspend judgment when there is not enough statistical evidence, and can serve as a sensitivity analysis tool for standard non-stationary HMMs. In this paper, we consider iHMMs under the strong independence interpretation, for which we develop efficient inference algorithms to address standard HMM usage such as the computation of likelihoods and most probable explanations, as well as performing filtering and predictive inference. Experiments with real data show that iHMMs produce more reliable inferences without compromising the computational efficiency.

Wide-Area Phase-Angle Measurements for Islanding Detection—An Adaptive Nonlinear Approach

The integration of an ever growing proportion of large scale distributed renewable generation has increased the probability of maloperation of the traditional RoCoF and vector shift relays. With reduced inertia due to non-synchronous penetration in a power grid, system wide disturbances have forced the utility industry to design advanced protection schemes to prevent system degradation and avoid cascading outages leading to widespread blackouts. This paper explores a novel adaptive nonlinear approach applied to islanding detection, based on wide area phase angle measurements. This is challenging, since the voltage phase angles from different locations exhibit not only strong nonlinear but also time-varying characteristics. The adaptive nonlinear technique, called moving window kernel principal component analysis is proposed to model the time-varying and nonlinear trends in the voltage phase angle data. The effectiveness of the technique is exemplified using both DigSilent simulated cases and real test cases recorded from the Great Britain and Ireland power systems by the OpenPMU project.