Planar CMOS to multi-gate layout conversion for maximal fin utilization

Multi-gate transistors enable the pace of Moore's Law for another decade. In its 22 nm technology node Intel switched to multi-gate transistors called TriGate, whereas IBM, TSMC, Samsung and others will do so in their 20 nm and 14 nm nodes with multi-gate transistors called FinFET. Several recent publications studied the drawing of multi-gate transistors layout. Designing new VLSI cell libraries and blocks requires massive re-drawing of layout. Hard-IP reuse is an alternative method taking advantage of existing source layout by automatically mapping it into new target technology, which was used in Intel's Tick-Tock marketing strategy for several product generations. This paper presents a cell-level hard-IP reuse algorithm, converting planar transistors to multi-gate ones. We show an automatic, robust transformation of bulk diffusion polygons into fins, while addressing the key requirements of cell libraries, as maximizing performance and interface compatibility across a variety of driving strength. We present a layout conversion flow comprising time-efficient geometric manipulations and discrete optimization algorithms, while generating manually drawn layout quality. Those can easily be used in composing larger functional blocks.     

A Mechanized Proof Environment for the Convenient Computations Proof Method

A mechanized verification environment made up of theories over the deductive mechanized theorem prover PVS is presented, which allows taking advantage of the convenient computations method. This method reduces the conceptual difficulty of proving a given property for all the possible computations of a system by separating two different concerns: (1) proving that special convenient computations satisfy the property, and (2) proving that every computation is related to a convenient one by a relation which preserves the property. The approach is especially appropriate for applications in which the first concern is trivial once the second has been shown, e.g., where the specification itself is that every computation reduces to a convenient one. Two examples are the serializability of transactions in distributed databases, and sequential consistency of distributed shared memories. To reduce the repetition of effort, a clear separation is made between infrastructural theories to be supplied as a proof environment PVS library to users, and the specification and proof of particular examples. The provided infrastructure formally defines the method in its most general way. It also defines a computation model and a reduction relation—the equivalence of computations that differ only in the order of finitely many independent operations. One way to prove that this relation holds between every computation and some convenient one involves the definition of a measure function from computations into a well-founded set. Two possible default measures, which can be applied in many cases, are also defined in the infrastructure, along with useful lemmas that assist in their usage. We show how the proof environment can be used, by a step-by-step explanation of an application example.     

Somatization: social control and illness production in a religious cult

The aim of this ethnographic work is twofold: first, to document the specifics of the illness experience within the highly controlling milieu of a religious cult; second, to explore the connection between somatization and social control in this particular context. Anthropologists have long realized that in order to comprehend disease etiology, one must examine both biological and sociocultural processes, as both are implicated in the production of illness. Illness experiences of those members of the cult described here appeared to be direct responses to extreme intrapsychic and social control: that is, members were required to be celibate, unmarried, and detached from their pre-cult identity and the emotional support structure of family and friends. Additionally, members were subjected to constant surveillance by peers and were often punished for expressing views that were in conflict with the ideology of the leader, thereby encouraging the somatization of distress. This research is based upon two years of participant observation within the milieu, during which time more than 100 participants were interviewed; however, this paper specifically discusses in-depth interviews with eight individuals whose health problems exemplify those experienced by other members of the cult.     

Computing occluding and transparent motions

Computing the motions of several moving objects in image sequences involves simultaneous motion analysis and segmentation. This task can become complicated when image motion changes significantly between frames, as with camera vibrations. Such vibrations make tracking in longer sequences harder, as temporal motion constancy cannot be assumed. The problem becomes even more difficult in the case of transparent motions.A method is presented for detecting and tracking occluding and transparent moving objects, which uses temporal integration without assuming motion constancy. Each new frame in the sequence is compared to a dynamic internal representation image of the tracked object. The internal representation image is constructed by temporally integrating frames after registration based on the motion computation. The temporal integration maintains sharpness of the tracked object, while blurring objects that have other motions. Comparing new frames to the internal representation image causes the motion analysis algorithm to continue tracking the same object in subsequent frames, and to improve the segmentation.     

Two-dimensional elastoplasticity: Approximation by mixed finite elements

Two-dimensional elastoplastic problems are used to assess the performance of a family of mixed finite elements in the non-linear regime. In particular, four-node bilinear quadrilateral elements that exhibit high accuracy in coarse meshes are used to simulate plane stress, plane strain, axisymmetric and (shear-deformable) plate bending problems. The excellent performance of these elements is demonstrated with a number of discriminating examples selected from the literature. In addition, agreement is observed in the limit load predicted by the axisymmetric solid and plate bending elements.     

Mass transfer and reaction kinetics in the ozone/tap water system

The mass transfer and the reaction kinetics of ozone in tap water were examined. The contacting system was a well-mixed reactor with perpendicular jets. The ozone residual range was the lowest detectable range. A simple mathematical model was proposed to describe the mechanism of the ozone in the reactor and was checked over the range of water flow rates from 2.170 to 3.080 l min⁻¹, gas flow rates from 0.667 to 1.333 l min⁻¹ and different temperature conditions. The proposed model describes quite accurately the mass-transfer behavior in the reactor and determines the operational parameters which control the reactor operation. There is a linear relationship between the ozone feed rate and ozone residual. Zero order kinetics best describe the autodecomposition of ozone in plain tap water. The mass transfer coefficient is about 1.14 min⁻¹. Without use of agitation, there is a large decrease in the value of the mass transfer coefficient, to about 0.250 min⁻¹. The magnitude of the reactor rate constant is between 0.05 and 0.13 mg min⁻¹ l.     

Self-stabilizing extensions for meassage-passing systems

Summary A self-stabilizing program eventually resumes normal behavior even if excution begins in, an abnormal initial state. In this paper, we explore the possibility of extending an arbitrary program into a self-stabilizing one. Our contributions are: (1) a formal definition of the concept of one program being aself-stabilizing extension of another; (2) a characterization of what properties may hold in such extensions; (3) a demonstration of the possibility of mechanically creating such extensions. The computtional model used is that of an asynchronous distributed message-passing system whose communication topology is an arbitrary graph. We contrast the difficulties of self-stabilization in thismodel with those of themore common shared-memory models. Shmuel Katz received his B.A. in Mathematics and Englisch Literature from U.C.L.A., and his M.Sc. and Ph.D. in Computer Science (1976) from the Weizmann Institute in Rechovot, Israel. From 1976 to 1981 he was a research at the IBM Israel Scientific Center. Presently, he is an Associate Professor in the Computer Science Department at the Technion in Haifa, Israel. In 1977–78 he visited for a year at the University of California, Berkeley, and in 1984–85 was at the University of Texas at Austin. He has been a consultant and vistor at the MCC Software Technology Program, and in 1988–89 was a visiting scientist at the IBM Watson Research Center. His research interests include the methodology of programming, specification methods, program verification and semantics, distributed programming, data structure, and programming languages. Kenneth J. Pery has performed research in the area of distributed computing since obtaining Masters and Doctorate degrees in Computer Science from Cornell Univesity. His current interest is in studying problems of a partical nature in a formal context. He was graduated from Princeton University in 1979 with a B.S.E. degree in Electrical Engineering and Computer Science.The Research of this author was partially supported by Research Grant 120-749 and the Argentinian Research Fund at the Technion