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.

Neuromorphic computing using non-volatile memory

Abstract: Dense crossbar arrays of non-volatile memory (NVM) devices represent one possible path for implementing massively-parallel and highly energy-efficient neuromorphic computing systems. We first revie...

The "millipede" - nanotechnology entering data storage

Abstract: Present a new scanning-probe-based data-storage concept called the "millipede" that combines ultrahigh density, terabit capacity, small form factor, and high data rate. Ultrahigh storage density has been demonstrated by a new thermomechanical local-probe technique to store, read back, and erase data in very thin polymer films. With this new technique, nanometer-sized bit indentations and pitch sizes have been made by a single cantilever/tip into thin polymer layers, resulting in a data storage densities of up to 1 Tb/in/sup 2/. High data rates are achieved by parallel operation of large two-dimensional (2-D) atomic force microscope (AFM) arrays that have been batch-fabricated by silicon surface-micromachining techniques. The very large-scale integration (VLSI) of micro/nanomechanical devices (cantilevers/tips) on a single chip leads to the largest and densest 2-D array of 32/spl times/32 (1024) AFM cantilevers with integrated write/read/erase storage functionality ever built. Time-multiplexed electronics control the functional storage cycles for parallel operation of the millipede array chip. Initial areal densities of 100-200 Gb/in/sup 2/ have been achieved with the 32/spl times/32 array chip.

Control flow analysis

Abstract: Any static, global analysis of the expression and data relationships in a program requires a knowledge of the control flow of the program. Since one of the primary reasons for doing such a global analysis in a compiler is to produce optimized programs, control flow analysis has been embedded in many compilers and has been described in several papers. An early paper by Prosser [5] described the use of Boolean matrices (or, more particularly, connectivity matrices) in flow analysis. The use of “dominance” relationships in flow analysis was first introduced by Prosser and much expanded by Lowry and Medlock [6]. References [6,8,9] describe compilers which use various forms of control flow analysis for optimization. Some recent developments in the area are reported in [4] and in [7]. The underlying motivation in all the different types of control flow analysis is the need to codify the flow relationships in the program. The codification may be in connectivity matrices, in predecessor-successor tables, in dominance lists, etc. Whatever the form, the purpose is to facilitate determining what the flow relationships are; in other words to facilitate answering such questions as: is this an inner loop?, if an expression is removed from the loop where can it be correctly and profitably placed?, which variable definitions can affect this use? In this paper the basic control flow relationships are expressed in a directed graph. Various graph constructs are then found and shown to codify interesting global relationships.

Quantitative design and evaluation of enhancement/thresholding edge detectors

Abstract: Quantitative design and performance evaluation techniques are developed for the enhancement/thresholding class of image edge detectors. The design techniques are based on statistical detection theory and deterministic pattern-recognition classification procedures. The performance evaluation methods developed include: a)deterministic measurement of the edge gradient amplitude; b)comparison of the probabilities of correct and false edge detection; and c) figure of merit computation. The design techniques developed are used to optimally design a variety of small and large mask edge detectors. Theoretical and experimental comparisons of edge detectors are presented.