Institution
IBM
Company•Armonk, New York, United States•
About: IBM is a company organization based out in Armonk, New York, United States. It is known for research contribution in the topics: Layer (electronics) & Signal. The organization has 134567 authors who have published 253905 publications receiving 7458795 citations. The organization is also known as: International Business Machines Corporation & Big Blue.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: In this article, the optical conductivity tensor of multilayer black phosphorus thin films using the Kubo formula within an effective low-energy Hamiltonian was calculated, and the role of interband coupling and disorder on observed anisotropic absorption spectra was discussed.
Abstract: Black phosphorus thin films might offer attractive alternatives to narrow-gap compound semiconductors for optoelectronics across mid- to near-infrared frequencies. In this work, we calculate the optical conductivity tensor of multilayer black phosphorus thin films using the Kubo formula within an effective low-energy Hamiltonian. The optical absorption spectra of multilayer black phosphorus are shown to vary sensitively with thickness, doping, and light polarization. In conjunction with experimental spectra obtained from infrared absorption spectroscopy, we also discuss the role of interband coupling and disorder on the observed anisotropic absorption spectra.
633 citations
••
TL;DR: A measure on graphs, the minrank, is identified, which exactly characterizes the minimum length of linear and certain types of nonlinear INDEX codes and for natural classes of side information graphs, including directed acyclic graphs, perfect graphs, odd holes, and odd anti-holes, minrank is the optimal length of arbitrary INDex codes.
Abstract: Motivated by a problem of transmitting supplemental data over broadcast channels (Birk and Kol, INFOCOM 1998), we study the following coding problem: a sender communicates with n receivers R1,..., Rn. He holds an input x ∈ {0,01l}n and wishes to broadcast a single message so that each receiver Ri can recover the bit xi. Each Ri has prior side information about x, induced by a directed graph Grain nodes; Ri knows the bits of a; in the positions {j | (i,j) is an edge of G}.G is known to the sender and to the receivers. We call encoding schemes that achieve this goal INDEXcodes for {0,1}n with side information graph G. In this paper we identify a measure on graphs, the minrank, which exactly characterizes the minimum length of linear and certain types of nonlinear INDEX codes. We show that for natural classes of side information graphs, including directed acyclic graphs, perfect graphs, odd holes, and odd anti-holes, minrank is the optimal length of arbitrary INDEX codes. For arbitrary INDEX codes and arbitrary graphs, we obtain a lower bound in terms of the size of the maximum acyclic induced subgraph. This bound holds even for randomized codes, but has been shown not to be tight.
632 citations
••
TL;DR: Jalapeno is a virtual machine for JavaTM servers written in the Java language to be as self-sufficient as possible and to obtain high quality code for methods that are observed to be frequently executed or computationally intensive.
Abstract: Jalapeno is a virtual machine for JavaTM servers written in the Java language. To be able to address the requirements of servers (performance and scalability in particular), Jalapeno was designed "from scratch" to be as self-sufficient as possible. Jalapeno's unique object model and memory layout allows a hardware null-pointer check as well as fast access to array elements, fields, and methods. Run-time services conventionally provided in native code are implemented primarily in Java. Java threads are multiplexed by virtual processors (implemented as operating system threads). A family of concurrent object allocators and parallel type-accurate garbage collectors is supported. Jalapeno's interoperable compilers enable quasi-preemptive thread switching and precise location of object references. Jalapeno's dynamic optimizing compiler is designed to obtain high quality code for methods that are observed to be frequently executed or computationally intensive.
632 citations
••
IBM1
TL;DR: In this article, it was shown that for general antiferromagnetic or ferrimagnetic Hamiltonians, which need not exhibit translational invariance, the lowest energy eigenvalue for each value of S [denoted E(S)] is ordered in a natural way.
Abstract: The total spin S is a good quantum number in problems of interacting spins. We have shown that for rather general antiferromagnetic or ferrimagnetic Hamiltonians, which need not exhibit translational invariance, the lowest energy eigenvalue for each value of S [denoted E(S)] is ordered in a natural way. In antiferromagnetism, E(S + 1) > E(S) for S > O. In ferrimagnetism, E(S + 1) > E(S) for S > S, and in addition the ground state belongs to S < S. S is defined as follows: Let the maximum spin of the A sublattice be S A and of the B sublattice S B; then S ≡ S A − S B. Antiferromagnetism is treated as the special case of S = O. We also briefly discuss the structure of the lowest eigen-functions in an external magnetic field.
632 citations
Authors
Showing all 134658 results
Name | H-index | Papers | Citations |
---|---|---|---|
Zhong Lin Wang | 245 | 2529 | 259003 |
Anil K. Jain | 183 | 1016 | 192151 |
Hyun-Chul Kim | 176 | 4076 | 183227 |
Rodney S. Ruoff | 164 | 666 | 194902 |
Tobin J. Marks | 159 | 1621 | 111604 |
Jean M. J. Fréchet | 154 | 726 | 90295 |
Albert-László Barabási | 152 | 438 | 200119 |
György Buzsáki | 150 | 446 | 96433 |
Stanislas Dehaene | 149 | 456 | 86539 |
Philip S. Yu | 148 | 1914 | 107374 |
James M. Tour | 143 | 859 | 91364 |
Thomas P. Russell | 141 | 1012 | 80055 |
Naomi J. Halas | 140 | 435 | 82040 |
Steven G. Louie | 137 | 777 | 88794 |
Daphne Koller | 135 | 367 | 71073 |