Novel level-identifying circuit for flash multilevel memories

This paper presents a high-speed, small-area circuit specifically designed to identify the levels in the read out operation of a flash multilevel memory. The circuit is based on the analog computation of the Euclidean distance between the current read out from a memory cell and the reference currents that represent the different logic levels. An experimental version of the circuit has been integrated in a standard double-metal 0.7-μm CMOS process with a die area of only 140×100 μm². Operating under a 5-V power supply, this circuit identifies the read-out current of a memory cell, and associates it with the appropriate logic level in 9 ns     

Electrical and optical properties of semi-insulating polycrystalline silicon thin films: the role of microstructure and doping

We have investigated the relationship between microstructure and electrical conductivity in semi-insulating polycrystalline silicon (SIPOS) with oxygen concentrations in the 2–35 at.% range and the effect of doping with boron, phosphorus, arsenic and erbium by ion implantation. SIPOS thin films are mixtures of silicon and silicon oxide phases. The chemical and morphological evolution of these phases upon annealing is emphasized. Electrical conductivity measurements are interpreted in terms of a physical model containing few free parameters related to the material microstructure. A direct extension of this model explains also the conductivity increase in SIPOS doped with elements of the third or the fifth group. In the last part of the paper, data of electroluminescence at 1.54 μm in Er-implanted SIPOS due to intra-4f transitions of the Er³⁺ ion are shown and discussed.     

Stick-slip vibrations of a two degree-of-freedom geophysical fault model

This paper considers the behaviour of a two degree-of-freedom autonomous system with static and dynamic friction consisting of two blocks linked by springs on a moving belt. This system is the simplest model which has been used to simulate the dynamics of seismic faults. The friction force is assumed to be a decreasing function of the relative sliding velocity. The motion of the blocks is composed of a uniform stick motion, during which the divergence of the system is zero, and an accelerated slip motion, during which the divergence is positive. The mathematical model by definition concentrates the dissipation on the point where the slip motion ceases. It is assumed that slip occurs only in one direction. A three-dimensional Poincaré map and a scalar single variable map are discussed which characterize the dynamics of the system in a simple way. The one-dimensional map can be used to diagnose the chaotic behaviour of the full system, and quantities, similar to Lyapunov exponents, can be easily calculated which provide information regarding the system-sensitive dependence on initial conditions. The system dynamics illustrate the idea of studying the earthquake generation mechanism as a chaotic phenomenon.     

Compensable power for electrical systems in nonsinusoidalconditions

Power definitions are extended to electrical circuits where both loads and supply are harmonic generators and where a series source impedance is considered to provide a realistic representation of electrical power systems. A method is proposed whereby distortion is compensated and power-factor corrected by means of reactance one-ports inserted in series and parallel into the electrical circuit. The approach is applied to single-phase circuits     

Optimal-tuning PID control of adaptive materials for structural efficiency

The objective of this paper was solving the optimization problem of lightweight stiffened structures modelled as a two-dimensional domain in an efficient computational way. The underlying premise was that mass should be distributed in an efficient way, so as to use a minimum amount of material to accomplish the mechanical function. This premise was expressed as a global, multi-objective optimization problem in which stiffness and mass were conflicting objectives. Alternative local evolution rules were implemented to update mass density or Young’s modulus at each step of the iterative procedure. The solution of the structural optimization problem was accomplished by a novel automatic procedure consisting of two consecutive stages of control and optimization. In the first stage of Proportional Integral Derivative (PID) control gains were manually selected whereas in the second stage the finding of optimal values of control gains, target, and cost indices was allowed. In this study a bone-like material was adopted and a thin slab was analysed as a sample problem.     

A Semantic Proof of Polytime Soundness of Light Affine Logic

We define realizability semantics for Light Affine Logic ( LAL\mathsf{LAL} ) which has the property that denotations of functions are polynomial time computable by construction of the model. This gives a new proof of polytime-soundness of LAL\mathsf{LAL} which is considerably simpler than the standard proof based on proof nets and is entirely semantical in nature. The model construction uses a new instance of a resource monoid; a general method for interpreting systems based on Linear Logic introduced earlier by the authors.     

Realizability models and implicit complexity

New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs are obtained by instantiating a semantic framework previously introduced by the authors and based on an innovative modification of realizability. The proof is a notable simplification on the original already semantic proof of soundness for the above mentioned logical systems and programming languages. A new result made possible by the semantic framework is the addition of polymorphism and a modality to LFPL, thus allowing for an internal definition of inductive datatypes. The methodology presented proceeds by assigning both abstract resource bounds in the form of elements from a resource monoid and resource-bounded computations to proofs (respectively, programs).     

Modelling Calculi with Name Mobility using Graphs with Equivalences

In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to be quite useful for modelling purposes, but, at the same time, problematic for the development of a satisfactory partial order concurrent semantics for rewrites. Rewriting over graphs with equivalences, i.e., (typed hyper)-graphs equipped with an equivalence over nodes provides a technically convenient replacement of graph rewriting with coalescing rules, for which a truly concurrent semantics can be easily defined. The expressivity of such a formalism is tested in a setting where coalescing rules typically play a basic role: the encoding of calculi with name passing as graph rewriting systems. Specifically, we show how the (monadic fragment) of the solo calculus, one of the dialect of those calculi whose distinctive feature is name fusion, can be encoded as a rewriting system over graph with equivalences.