From Packet to Power Switching: Digital Direct Load Scheduling

At present, the power grid has tight control over its dispatchable generation capacity but a very coarse control on the demand. Energy consumers are shielded from making price-aware decisions, which degrades the efficiency of the market. This state of affairs tends to favor fossil fuel generation over renewable sources. Because of the technological difficulties of storing electric energy, the quest for mechanisms that would make the demand for electricity controllable on a day-to-day basis is gaining prominence. The goal of this paper is to provide one such mechanisms, which we call Digital Direct Load Scheduling (DDLS). DDLS is a direct load control mechanism in which we unbundle individual requests for energy and digitize them so that they can be automatically scheduled in a cellular architecture. Specifically, rather than storing energy or interrupting the job of appliances, we choose to hold requests for energy in queues and optimize the service time of individual appliances belonging to a broad class which we refer to as "deferrable loads". The function of each neighborhood scheduler is to optimize the time at which these appliances start to function. This process is intended to shape the aggregate load profile of the neighborhood so as to optimize an objective function which incorporates the spot price of energy, and also allows distributed energy resources to supply part of the generation dynamically.Comment: Accepted by the IEEE journal of Selected Areas in Communications (JSAC): Smart Grid Communications series, to appea

A semismooth newton method for the nearest Euclidean distance matrix problem

The Nearest Euclidean distance matrix problem (NEDM) is a fundamentalcomputational problem in applications such asmultidimensional scaling and molecularconformation from nuclear magnetic resonance data in computational chemistry.Especially in the latter application, the problem is often large scale with the number ofatoms ranging from a few hundreds to a few thousands.In this paper, we introduce asemismooth Newton method that solves the dual problem of (NEDM). We prove that themethod is quadratically convergent.We then present an application of the Newton method to NEDM with $H$-weights.We demonstrate the superior performance of the Newton method over existing methodsincluding the latest quadratic semi-definite programming solver.This research also opens a new avenue towards efficient solution methods for the molecularembedding problem

Effect of solute content and temperature on the deformation mechanisms and critical resolved shear stress in Mg-Al and Mg-Zn alloys

The influence of solute atoms (Al and Zn) on the deformation mechanisms and the critical resolved shear stress for basal slip in Mg alloys at 298 K and 373 K was ascertained by micropillar compression tests in combination with high-throughput processing techniques based on the diffusion couples. It was found that the presence of solute atoms enhances the size effect at 298 K as well as the localization of deformation in slip bands, which is associated with large strain bursts in the resolved shear stress ($\tau_{RSS}$)-strain ($\epsilon$) curves. Deformation in pure Mg and Mg alloys was more homogeneous at 373 K and the influence of the micropillar size on the critical resolved shear stress was much smaller. In this latter case, it was possible to determine the effect of solute content on the critical resolved shear stress for basal slip in Mg-Al and Mg-Zn alloys

Purification and biochemical characterization of the ATH1 gene product, vacuolar acid trehalase, from Saccharomyces cerevisiae

AbstractThe disaccharide trehalose plays a critical role in yeast cell survival during conditions of environmental stress. The vacuole of the yeast Saccharomyces cerevisiae contains an enzyme, acid trehalose (ATH), that is capable of degrading trehalose. Recently, a gene required for ATH activity, ATH1, was cloned and sequenced [Destruelle et al., (1995) Yeast 11, 1015–1025]. The relationship between ATH1 and ATH, however, was not determined. We have purified ATH and shown that it is the ATH1 gene product; peptide sequences from the purified protein correspond to the deduced amino acid sequence of Ath1p. In addition, antiserum to Ath1p specifically recognizes purified ATH

Different mechanics of snap-trapping in the two closely related carnivorous plants Dionaea muscipula and Aldrovanda vesiculosa

The carnivorous aquatic Waterwheel Plant (Aldrovanda vesiculosa L.) and the closely related terrestrial Venus Flytrap (Dionaea muscipula SOL. EX J. ELLIS) both feature elaborate snap-traps, which shut after reception of an external mechanical stimulus by prey animals. Traditionally, Aldrovanda is considered as a miniature, aquatic Dionaea, an assumption which was already established by Charles Darwin. However, videos of snapping traps from both species suggest completely different closure mechanisms. Indeed, the well-described snapping mechanism in Dionaea comprises abrupt curvature inversion of the two trap lobes, while the closing movement in Aldrovanda involves deformation of the trap midrib but not of the lobes, which do not change curvature. In this paper, we present the first detailed mechanical models for these plants, which are based on the theory of thin solid membranes and explain this difference by showing that the fast snapping of Aldrovanda is due to kinematic amplification of the bending deformation of the midrib, while that of Dionaea unambiguously relies on the buckling instability that affects the two lobes.Comment: accepted in Physical Review

Fastpass: A Centralized “Zero-Queue” Datacenter Network

An ideal datacenter network should provide several properties, including low median and tail latency, high utilization (throughput), fair allocation of network resources between users or applications, deadline-aware scheduling, and congestion (loss) avoidance. Current datacenter networks inherit the principles that went into the design of the Internet, where packet transmission and path selection decisions are distributed among the endpoints and routers. Instead, we propose that each sender should delegate control—to a centralized arbiter—of when each packet should be transmitted and what path it should follow. This paper describes Fastpass, a datacenter network architecture built using this principle. Fastpass incorporates two fast algorithms: the first determines the time at which each packet should be transmitted, while the second determines the path to use for that packet. In addition, Fastpass uses an efficient protocol between the endpoints and the arbiter and an arbiter replication strategy for fault-tolerant failover. We deployed and evaluated Fastpass in a portion of Facebook’s datacenter network. Our results show that Fastpass achieves high throughput comparable to current networks at a 240 reduction is queue lengths (4.35 Mbytes reducing to 18 Kbytes), achieves much fairer and consistent flow throughputs than the baseline TCP (5200 reduction in the standard deviation of per-flow throughput with five concurrent connections), scalability from 1 to 8 cores in the arbiter implementation with the ability to schedule 2.21 Terabits/s of traffic in software on eight cores, and a 2.5 reduction in the number of TCP retransmissions in a latency-sensitive service at Facebook.National Science Foundation (U.S.) (grant IIS-1065219)Irwin Mark Jacobs and Joan Klein Jacobs Presidential FellowshipHertz Foundation (Fellowship