Evidence of slow-light effects from rotary drag of structured beams

Self-pumped slow light, typically observed within laser gain media, is created by an intense pump field. By observing the rotation of a structured laser beam upon transmission through a spinning ruby window, we show that the slowing effect applies equally to both the dark and bright regions of the incident beam. This result is incompatible with slow-light models based on simple pulse-reshaping arising from optical bleaching. Instead, the slow-light effect arises from the long upper-state lifetime of the ruby and a saturation of the absorption, from which the Kramers–Kronig relation gives a highly dispersive phase index and a correspondingly high group index

Big Data and the Internet of Things

Advances in sensing and computing capabilities are making it possible to embed increasing computing power in small devices. This has enabled the sensing devices not just to passively capture data at very high resolution but also to take sophisticated actions in response. Combined with advances in communication, this is resulting in an ecosystem of highly interconnected devices referred to as the Internet of Things - IoT. In conjunction, the advances in machine learning have allowed building models on this ever increasing amounts of data. Consequently, devices all the way from heavy assets such as aircraft engines to wearables such as health monitors can all now not only generate massive amounts of data but can draw back on aggregate analytics to "improve" their performance over time. Big data analytics has been identified as a key enabler for the IoT. In this chapter, we discuss various avenues of the IoT where big data analytics either is already making a significant impact or is on the cusp of doing so. We also discuss social implications and areas of concern.Comment: 33 pages. draft of upcoming book chapter in Japkowicz and Stefanowski (eds.) Big Data Analysis: New algorithms for a new society, Springer Series on Studies in Big Data, to appea

Characterisation of the SUMO-like domains of Schizosaccharomyces pombe Rad60

The S. pombe Rad60 protein is required for the repair of DNA double strand breaks, recovery from replication arrest, and is essential for cell viability. It has two SUMO-like domains (SLDs) at its C-terminus, an SXS motif and three sequences that have been proposed to be SUMO-binding motifs (SBMs). SMB1 is located in the middle of the protein, SBM2 is in SLD1 and SBM3 is at the C-terminus of SLD2. We have probed the functions of the two SUMO-like domains, SLD1 and SLD2, and the putative SBMs. SLD1 is essential for viability, while SLD2 is not. rad60-SLD2Δ cells are sensitive to DNA damaging agents and hydroxyurea. Neither ubiquitin nor SUMO can replace SLD1 or SLD2. Cells in which either SBM1 or SBM2 has been mutated are viable and are wild type for response to MMS and HU. In contrast mutation of SBM3 results in significant sensitivity to MMS and HU. These results indicate that the lethality resulting from deletion of SLD1 is not due to loss of SBM2, but that mutation of SBM3 produces a more severe phenotype than does deletion of SLD2. Using chemical denaturation studies, FPLC and dynamic light scattering we show this is likely due to the destabilisation of SLD2. Thus we propose that the region corresponding to the putative SBM3 forms part of the hydrophobic core of SLD2 and is not a SUMO-interacting motif. Over-expression of Hus5, which is the SUMO conjugating enzyme and known to interact with Rad60, does not rescue rad60-SLD2Δ, implying that as well as having a role in the sumoylation process as previously described [1], Rad60 has a Hus5-independent function

The Phenomenology of Inclusive Heavy-to-Light Sum Rules

By calculating the O(\alpha_s) corrections to inclusive heavy-to-light sum rules we find model independent upper and lower bounds on form factors for B to pi and B to rho. We use the bounds to rule out model predictions. Some models violate the bounds only for certain ranges of sum rule input parameters \bar{lambda} \simeq m_B-m_b and lambda_1, or for certain choices of model parameters, while others obey or violate the bounds irrespective of the inputs. We discuss the reliability and convergence of the bounds, point out their utility for extracting V_{ub}, and derive from them a new form factor scaling relation.Comment: 15 pages, 3 figures include

Reducing Electricity Demand Charge for Data Centers with Partial Execution

Data centers consume a large amount of energy and incur substantial electricity cost. In this paper, we study the familiar problem of reducing data center energy cost with two new perspectives. First, we find, through an empirical study of contracts from electric utilities powering Google data centers, that demand charge per kW for the maximum power used is a major component of the total cost. Second, many services such as Web search tolerate partial execution of the requests because the response quality is a concave function of processing time. Data from Microsoft Bing search engine confirms this observation. We propose a simple idea of using partial execution to reduce the peak power demand and energy cost of data centers. We systematically study the problem of scheduling partial execution with stringent SLAs on response quality. For a single data center, we derive an optimal algorithm to solve the workload scheduling problem. In the case of multiple geo-distributed data centers, the demand of each data center is controlled by the request routing algorithm, which makes the problem much more involved. We decouple the two aspects, and develop a distributed optimization algorithm to solve the large-scale request routing problem. Trace-driven simulations show that partial execution reduces cost by $3\%--10.5\%$ for one data center, and by $15.5\%$ for geo-distributed data centers together with request routing.Comment: 12 page

Structured Near-Optimal Channel-Adapted Quantum Error Correction

We present a class of numerical algorithms which adapt a quantum error correction scheme to a channel model. Given an encoding and a channel model, it was previously shown that the quantum operation that maximizes the average entanglement fidelity may be calculated by a semidefinite program (SDP), which is a convex optimization. While optimal, this recovery operation is computationally difficult for long codes. Furthermore, the optimal recovery operation has no structure beyond the completely positive trace preserving (CPTP) constraint. We derive methods to generate structured channel-adapted error recovery operations. Specifically, each recovery operation begins with a projective error syndrome measurement. The algorithms to compute the structured recovery operations are more scalable than the SDP and yield recovery operations with an intuitive physical form. Using Lagrange duality, we derive performance bounds to certify near-optimality.Comment: 18 pages, 13 figures Update: typos corrected in Appendi

The horofunction boundary of the Hilbert geometry

We investigate the horofunction boundary of the Hilbert geometry defined on an arbitrary finite-dimensional bounded convex domain D. We determine its set of Busemann points, which are those points that are the limits of `almost-geodesics'. In addition, we show that any sequence of points converging to a point in the horofunction boundary also converges in the usual sense to a point in the Euclidean boundary of D. We prove that all horofunctions are Busemann points if and only if the set of extreme sets of the polar of D is closed in the Painleve-Kuratowski topology.Comment: 24 pages, 2 figures; minor changes, examples adde