A Parallel Hamiltonian Eigensolver for Passivity Characterization and Enforcement of Large Interconnect Macromodels

Best Paper Award Nominatio

Witness (Delaunay) Graphs

Proximity graphs are used in several areas in which a neighborliness relationship for input data sets is a useful tool in their analysis, and have also received substantial attention from the graph drawing community, as they are a natural way of implicitly representing graphs. However, as a tool for graph representation, proximity graphs have some limitations that may be overcome with suitable generalizations. We introduce a generalization, witness graphs, that encompasses both the goal of more power and flexibility for graph drawing issues and a wider spectrum for neighborhood analysis. We study in detail two concrete examples, both related to Delaunay graphs, and consider as well some problems on stabbing geometric objects and point set discrimination, that can be naturally described in terms of witness graphs.Comment: 27 pages. JCCGG 200

Influence of wettability on liquid water transport in gas diffusion layer of proton exchange membrane fuel cells (PEMFC)

Water management is a key factor that limits PEFC's performance. We show how insights into this problem can be gained from pore-scale simulations of water invasion in a model fibrous medium. We explore the influence of contact angle on the water invasion pattern and water saturation at breakthrough and show that a dramatic change in the invasion pattern, from fractal to compact, occurs as the system changes from hydrophobic to hydrophilic. Then, we explore the case of a system of mixed wettability, i.e. containing both hydrophilic and hydrophobic pores. The saturation at breakthrough is studied as a function of the fraction of hydrophilic pores. The results are discussed in relation with the water management problem, the optimal design of a GDL and the fuel cell performance degradation mechanisms. We outline how the study could be extended to 3D systems, notably from binarised images of GDLs obtained by X ray microtomography

Triangulating the Real Projective Plane

We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general position, i.e., no three of them are collinear. We also design an algorithm for triangulating P2 if this necessary condition holds. As far as we know, this is the first computational result on the real projective plane

Critical Casimir Interactions and Percolation: the quantitative description of critical fluctuations

Casimir forces in a critical media are produced by spatial suppression of order parameter fluctuations. In this paper we address the question how fluctuations of a critical media relates the magnitude of critical Casimir interactions. Namely, for the Ising model we express the potential of critical Casimir interactions in terms of Fortuin-Kasteleyn site-bond correlated percolation clusters. These clusters are quantitative representation of fluctuations in the media. New Monte Carlo method for the computation of the Casimir force potential which is based on this relation is proposed. We verify this method by computation of Casimir interactions between two disks for 2D Ising model. The new method is also applied to the investigation of non-additivity of the critical Casimir potential. The non-additive contribution to three-particles interaction is computed as a function of the temperature.Comment: 13 pages, 4 figure

Atomic Scale Memory at a Silicon Surface

The limits of pushing storage density to the atomic scale are explored with a memory that stores a bit by the presence or absence of one silicon atom. These atoms are positioned at lattice sites along self-assembled tracks with a pitch of 5 atom rows. The writing process involves removal of Si atoms with the tip of a scanning tunneling microscope. The memory can be reformatted by controlled deposition of silicon. The constraints on speed and reliability are compared with data storage in magnetic hard disks and DNA.Comment: 13 pages, 5 figures, accepted by Nanotechnolog

QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs

A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for Maximum Clique on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics '90]. Since then, it has been an intriguing open question whether or not tractability can be extended to general disk graphs. We show the rather surprising structural result that a disjoint union of cycles is the complement of a disk graph if and only if at most one of those cycles is of odd length. From that, we derive the first QPTAS and subexponential algorithm running in time 2^{O~(n^{2/3})} for Maximum Clique on disk graphs. In stark contrast, Maximum Clique on intersection graphs of filled ellipses or filled triangles is unlikely to have such algorithms, even when the ellipses are close to unit disks. Indeed, we show that there is a constant ratio of approximation which cannot be attained even in time 2^{n^{1-epsilon}}, unless the Exponential Time Hypothesis fails

Manipulating infrared photons using plasmons in transparent graphene superlattices

Superlattices are artificial periodic nanostructures which can control the flow of electrons. Their operation typically relies on the periodic modulation of the electric potential in the direction of electron wave propagation. Here we demonstrate transparent graphene superlattices which can manipulate infrared photons utilizing the collective oscillations of carriers, i.e., plasmons of the ensemble of multiple graphene layers. The superlattice is formed by depositing alternating wafer-scale graphene sheets and thin insulating layers, followed by patterning them all together into 3-dimensional photonic-crystal-like structures. We demonstrate experimentally that the collective oscillation of Dirac fermions in such graphene superlattices is unambiguously nonclassical: compared to doping single layer graphene, distributing carriers into multiple graphene layers strongly enhances the plasmonic resonance frequency and magnitude, which is fundamentally different from that in a conventional semiconductor superlattice. This property allows us to construct widely tunable far-infrared notch filters with 8.2 dB rejection ratio and terahertz linear polarizers with 9.5 dB extinction ratio, using a superlattice with merely five graphene atomic layers. Moreover, an unpatterned superlattice shields up to 97.5% of the electromagnetic radiations below 1.2 terahertz. This demonstration also opens an avenue for the realization of other transparent mid- and far-infrared photonic devices such as detectors, modulators, and 3-dimensional meta-material systems.Comment: under revie