IBM

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.

The web as a graph: measurements, models, and methods

Abstract: The pages and hyperlinks of the World-Wide Web may be viewed as nodes and edges in a directed graph. This graph is a fascinating object of study: it has several hundred million nodes today, over a billion links, and appears to grow exponentially with time. There are many reasons -- mathematical, sociological, and commercial -- for studying the evolution of this graph. In this paper we begin by describing two algorithms that operate on the Web graph, addressing problems from Web search and automatic community discovery. We then report a number of measurements and properties of this graph that manifested themselves as we ran these algorithms on the Web. Finally, we observe that traditional random graph models do not explain these observations, and we propose a new family of random graph models. These models point to a rich new sub-field of the study of random graphs, and raise questions about the analysis of graph algorithms on the Web.

Design and implementation of a TCG-based integrity measurement architecture

Abstract: We present the design and implementation of a secure integrity measurement system for Linux. All executable content that is loaded onto the Linux system is measured before execution and these measurements are protected by the Trusted Platform Module (TPM) that is part of the Trusted Computing Group (TCG) standards. Our system is the first to extend the TCG trust measurement concepts to dynamic executable content from the BIOS all the way up into the application layer. In effect, we show that many of the Microsoft NGSCB guarantees can be obtained on today's hardware and today's software and that these guarantees do not require a new CPU mode or operating system but merely depend on the availability of an independent trusted entity, a TPM for example. We apply our trust measurement architecture to a web server application where we show how our system can detect undesirable invocations, such as rootkit programs, and that our measurement architecture is practical in terms of the number of measurements taken and the performance impact of making them.

Chiral spin torque at magnetic domain walls

Abstract: Spin-polarized currents provide a powerful means of manipulating the magnetization of nanodevices, and give rise to spin transfer torques that can drive magnetic domain walls along nanowires. In ultrathin magnetic wires, domain walls are found to move in the opposite direction to that expected from bulk spin transfer torques, and also at much higher speeds. Here we show that this is due to two intertwined phenomena, both derived from spin–orbit interactions. By measuring the influence of magnetic fields on current-driven domain-wall motion in perpendicularly magnetized Co/Ni/Co trilayers, we find an internal effective magnetic field acting on each domain wall, the direction of which alternates between successive domain walls. This chiral effective field arises from a Dzyaloshinskii–Moriya interaction at the Co/Pt interfaces and, in concert with spin Hall currents, drives the domain walls in lock-step along the nanowire. Elucidating the mechanism for the manipulation of domain walls in ultrathin magnetic films will enable the development of new families of spintronic devices. The influence of magnetic fields on the current-driven motion of domain walls in nanowires with perpendicular anisotropy shows that two spin–orbit-derived mechanisms are responsible for their motion.

Extending and formalizing the framework for information systems architecture

Abstract: John Zachman introduced a framework for information systems architecture (ISA) that has been widely adopted by systems analysts and database designers. It provides a taxonomy for relating the concepts that describe the real work to the concepts that describe an information system and its implementation. The ISA framework has a simple elegance that makes it easy to remember, yet it draws attention to fundamental distinctions that are often overlooked in systems design. This paper presents the framework and its recent extensions and shows how it can be formalized in the notation of conceptual graphs.

An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits

Abstract: The D-algorithm (DALG) is shown to be ineffective for the class of combinational logic circuits that is used to implement error correction and translation (ECAT) functions. PODEM (path-oriented decision making) is a new test generation algorithm for combinational logic circuits. PODEM uses an implicit enumeration approach analogous to that used for solving 0-1 integer programming problems. It is shown that PODEM is very efficient for ECAT circuits and is significantly more efficient than DALG over the general spectrum of combinational logic circuits. A distinctive feature of PODEM is its simplicity when compared to the D-algorithm. PODEM is a complete algorithm in that it will generate a test if one exists. Heuristics are used to achieve an efficient implicit search of the space of all possible primary input patterns until either a test is found or the space is exhausted.