Baked-Potato Routing

This paper presents scheduling of packet transmission schemes, calledbaked-potatoschemes, which are used to avoid simultaneous arrival of packets at a switch. We present scheduling schemes for any capacity of links and switches. The schemes are evaluated by the maximal length of time between two successive schedulings of a processor. For the case of a single-capacity link and switch, our scheme is proved optimal by presenting a matching lower bound. Our baked-potato scheme does not assume any prior knowledge on the source–destination demands and can be used for sending control packets and broadcasting.     

Morphological,Structural, and Compositional Evolution of Pt–Ni Octahedral Electrocatalysts with Pt‐Rich Edges and Ni‐Rich Core: Toward the Rational Design of Electrocatalysts for the Oxygen Reduction Reaction

The progress in colloidal synthesis of Pt–Ni octahedra has been instrumental in rising the oxygen reduction reaction catalytic activity high above the benchmark of Pt catalysts. This impressive catalytic performance is believed to result from the exposure of the most active catalytic sites after an activation process, chemical or electrochemical, which leads to a Pt surface enrichment. A foremost importance is to understand the structure and the elemental distribution of Pt–Ni octahedral, which leads to an optimal catalytic activity and stability. However, the factors governing the synthesis of the Pt–Ni octahedra are not well understood. In this study, unprecedented surface atomic segregation of Pt atoms in a Ni‐rich Pt–Ni octahedral nanoparticle structure is established by advanced electron microscopy. The Pt atoms are almost exclusively located on the edges of the Pt–Ni octahedra. This structure is formed in a pristine form, i.e., prior to any chemical or electrochemical etching. A new growth mechanism is revealed, which involves the transformation from an octahedron with a Pt‐rich core to a Ni‐rich octahedron with Pt‐rich edges. This observation may pave the way for a deeper understanding of this class of Pt–Ni octahedral nanoparticles as an electrocatalyst.     

Proteins: coexistence of stability and flexibility

We introduce an equation for protein native topology based on recent analysis of data from the Protein Data Bank and on a generalization of the Landau-Peierls instability criterion for fractals. The equation relates the protein fractal dimension df, the spectral dimension ds, and the number of amino acids N. Deviations from the equation may render a protein unfolded. The fractal nature of proteins is shown to bridge their seemingly conflicting properties of stability and flexibility. Over 500 proteins have been analyzed (df, ds, and N) and found to obey this equation of state.     

Near-field: a finite-difference time-dependent method for simulation of electrodynamics on small scales

We develop near-field (NF), a very efficient finite-difference time-dependent (FDTD) approach for simulating electromagnetic systems in the near-field regime. NF is essentially a time-dependent version of the quasistatic frequency-dependent Poisson algorithm. We assume that the electric field is longitudinal, and hence propagates only a set of time-dependent polarizations and currents. For near-field scales, the time step (dt) is much larger than in the usual Maxwell FDTD approach, as it is not related to the velocity of light; rather, it is determined by the rate of damping and plasma oscillations in the material, so dt = 2.5 a.u. was well converged in our simulations. The propagation in time is done via a leapfrog algorithm much like Yee's method, and only a single spatial convolution is needed per time step. In conjunction, we also develop a new and very accurate 8 and 9 Drude-oscillators fit to the permittivity of gold and silver, desired here because we use a large time step. We show that NF agrees with Mie-theory in the limit of small spheres and that it also accurately describes the evolution of the spectral shape as a function of the separation between two gold or silver spheres. The NF algorithm is especially efficient for systems with small scale dynamics and makes it very simple to introduce additional effects such as embedding.     

On the complexity of the k-customer vehicle routing problem

We investigate the complexity of the k-CUSTOMER VEHICLE ROUTING PROBLEM: Given an edge weighted graph, the problem requires to compute a minimum weight set of cyclic routes such that each contains a distinguished depot vertex and at most other k customer vertices, and every customer belongs to exactly one route.