scispace - formally typeset
Search or ask a question
Institution

IBM

CompanyArmonk, 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
More filters
Journal ArticleDOI
Masamitsu Hayashi1, Luc Thomas1, Rai Moriya1, Charles T. Rettner1, Stuart S. P. Parkin1 
11 Apr 2008-Science
TL;DR: Using permalloy nanowires, the successive creation, motion, and detection of domain walls are achieved by using sequences of properly timed, nanosecond-long, spin-polarized current pulses.
Abstract: The controlled motion of a series of domain walls along magnetic nanowires using spin-polarized current pulses is the essential ingredient of the proposed magnetic racetrack memory, a new class of potential non-volatile storage-class memories. Using permalloy nanowires, we achieved the successive creation, motion, and detection of domain walls by using sequences of properly timed, nanosecond-long, spin-polarized current pulses. The cycle time for the writing and shifting of the domain walls was a few tens of nanoseconds. Our results illustrate the basic concept of a magnetic shift register that relies on the phenomenon of spin-momentum transfer to move series of closely spaced domain walls.

665 citations

Patent
20 Jan 2000
TL;DR: In this article, a method for securely receiving data on a user's system from a web broadcast infrastructure with a plurality of channels is presented, which includes receiving promotional metadata from a first web broadcast channel, the promotional metadata related to data available for reception; assembling at least part of the promotional offering into a promotional offering for review by a user; selecting by the user, data to be received related to the metadata; and receiving data from a second web broadcast channels, the data selected from the promoted metadata, and wherein the data has been previously encrypted using a first encrypting key;
Abstract: A method of securely receiving data on a user's system from a web broadcast infrastructure with a plurality of channels. The method comprising receiving promotional metadata from a first web broadcast channel, the promotional metadata related to data available for reception; assembling at least part of the promotional metadata into a promotional offering for review by a user; selecting by a user, data to be received related to the promotional metadata; receiving data from a second web broadcast channel, the data selected from the promotional metadata, and wherein the data has been previously encrypted using a first encrypting key; and receiving the first decrypting key via a computer readable medium, the first decrypting key for decrypting at least some of the data received via the second web broadcast channel. In another embodiment, a method and system to transmit data securely from a web broadcast center is disclosed.

665 citations

Journal ArticleDOI
TL;DR: A virtual machine can support individual processes or a complete system depending on the abstraction level where virtualization occurs, and replication by virtualization enables more flexible and efficient and efficient use of hardware resources.
Abstract: A virtual machine can support individual processes or a complete system depending on the abstraction level where virtualization occurs. Some VMs support flexible hardware usage and software isolation, while others translate from one instruction set to another. Virtualizing a system or component -such as a processor, memory, or an I/O device - at a given abstraction level maps its interface and visible resources onto the interface and resources of an underlying, possibly different, real system. Consequently, the real system appears as a different virtual system or even as multiple virtual systems. Interjecting virtualizing software between abstraction layers near the HW/SW interface forms a virtual machine that allows otherwise incompatible subsystems to work together. Further, replication by virtualization enables more flexible and efficient and efficient use of hardware resources.

665 citations

Journal ArticleDOI
David R. Clarke1
TL;DR: In this paper, it was shown that there will exist a stable thickness for the intergranular film and that it will be of the order of 1 nm, a value commensurate with that observed experimentally in a wide range of materials.
Abstract: The fundamental question as to whether thin intergranular films can adopt an equilibrium thickness in polycrystalline ceramics is addressed. Two continuum approaches are presented, one based on interfacial energies and the other on the force balance normal to the boundary. These indicate that there will exist a stable thickness for the intergranular film and that it will be of the order of 1 nm. The origin of an equilibrium thickness is shown to be the result of two competing interactions, an attractive van der Waals-disperson interaction between the grains on either side of the boundary acting to thin the film and a repulsive term, due to the structure of the intergranular liquid, opposing this attraction. As both of these interactions are of short range (

664 citations

Proceedings ArticleDOI
28 Jun 2009
TL;DR: This work is the first work to consider the TEAM FORMATION problem in the presence of a social network of individuals and measures effectiveness using the communication cost incurred by the subgraph in G that only involves X'.
Abstract: Given a task T, a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X, a subset of X, to perform the task. We call this the TEAM FORMATION problem. We require that members of X' not only meet the skill requirements of the task, but can also work effectively together as a team. We measure effectiveness using the communication cost incurred by the subgraph in G that only involves X'. We study two variants of the problem for two different communication-cost functions, and show that both variants are NP-hard. We explore their connections with existing combinatorial problems and give novel algorithms for their solution. To the best of our knowledge, this is the first work to consider the TEAM FORMATION problem in the presence of a social network of individuals. Experiments on the DBLP dataset show that our framework works well in practice and gives useful and intuitive results.

662 citations


Authors

Showing all 134658 results

NameH-indexPapersCitations
Zhong Lin Wang2452529259003
Anil K. Jain1831016192151
Hyun-Chul Kim1764076183227
Rodney S. Ruoff164666194902
Tobin J. Marks1591621111604
Jean M. J. Fréchet15472690295
Albert-László Barabási152438200119
György Buzsáki15044696433
Stanislas Dehaene14945686539
Philip S. Yu1481914107374
James M. Tour14385991364
Thomas P. Russell141101280055
Naomi J. Halas14043582040
Steven G. Louie13777788794
Daphne Koller13536771073
Network Information
Related Institutions (5)
Carnegie Mellon University
104.3K papers, 5.9M citations

93% related

Georgia Institute of Technology
119K papers, 4.6M citations

92% related

Bell Labs
59.8K papers, 3.1M citations

90% related

Microsoft
86.9K papers, 4.1M citations

89% related

Massachusetts Institute of Technology
268K papers, 18.2M citations

88% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202330
2022137
20213,163
20206,336
20196,427
20186,278