A new two-terminal circuit element-called the memristorcharacterized by a relationship between the charge q(t)\equiv \int_{-\infty}^{t} i(\tau) d \tau and the flux-linkage \varphi(t)\equiv \int_{- \infty}^{t} v(\tau) d \tau is introduced as the fourth basic circuit element. An electromagnetic field interpretation of this relationship in terms of a quasi-static expansion of Maxwell's equations is presented. Many circuit-theoretic properties of memistors are derived. It is shown that this element exhibits some peculiar behavior different from that exhibited by resistors, inductors, or capacitors. These properties lead to a number of unique applications which cannot be realized with RLC networks alone. Although a physical memristor device without internal power supply has not yet been discovered, operational laboratory models have been built with the help of active circuits. Experimental results are presented to demonstrate the properties and potential applications of memristors.

Memristor-The missing circuit element

Asymptotic waveform evaluation (AWE) provides a generalized approach to linear RLC circuit response approximations. The RLC interconnect model may contain floating capacitors, grounded resistors, inductors, and even linear controlled sources. The transient portion of the response is approximated by matching the initial boundary conditions and the first 2q-1 moments of the exact response to a lower-order q-pole model. For the case of an RC tree model, a first-order AWE approximation reduces to the RC tree methods. >

Asymptotic waveform evaluation for timing analysis

Part I. The Haskell 98 Language: 1 Introduction 2 Lexical structure 3 Expressions 4 Declarations and bindings 5 Modules 6 Predefined types and classes 7 Basic input/output 8 Standard prelude 9 Syntax reference 10 Specification of derived instances 11 Compiler pragmas Part II The Haskell 98 Libraries: 12 Rational numbers 13 Complex numbers 14 Numeric functions 15 Indexing operations 16 Arrays 17 List utilities 18 Maybe utilities 19 Character utilities 20 Monad utilities 21 Input/output 22 Directory functions 23 System functions 24 Dates and times 25 Locales 26 CPU time 27 Random numbers Bibliography.

Haskell 98 language and libraries : the revised report

We characterize high-performance streaming applications as a new and distinct domain of programs that is becoming increasingly important. The StreamIt language provides novel high-level representations to improve programmer productivity and program robustness within the streaming domain. At the same time, the StreamIt compiler aims to improve the performance of streaming applications via stream-specific analyses and optimizations. In this paper, we motivate, describe and justify the language features of StreamIt, which include: a structured model of streams, a messaging system for control, a re-initialization mechanism, and a natural textual syntax.

/pdf/streamit-a-language-for-streaming-applications-il2k3rjwwy.pdf

StreamIt: A Language for Streaming Applications

A geometric program (GP) is a type of mathematical optimization problem characterized by objective and constraint functions that have a special form. Recently developed solution methods can solve even large-scale GPs extremely efficiently and reliably; at the same time a number of practical problems, particularly in circuit design, have been found to be equivalent to (or well approximated by) GPs. Putting these two together, we get effective solutions for the practical problems. The basic approach in GP modeling is to attempt to express a practical problem, such as an engineering analysis or design problem, in GP format. In the best case, this formulation is exact; when this is not possible, we settle for an approximate formulation. This tutorial paper collects together in one place the basic background material needed to do GP modeling. We start with the basic definitions and facts, and some methods used to transform problems into GP format. We show how to recognize functions and problems compatible with GP, and how to approximate functions or data in a form compatible with GP (when this is possible). We give some simple and representative examples, and also describe some common extensions of GP, along with methods for solving (or approximately solving) them.

/pdf/a-tutorial-on-geometric-programming-47sdznbzxw.pdf

A tutorial on geometric programming

Penfield has noted that circuit theory paradoxically suggests that a series motor connected to a "noise resistor" should run as a perpetual motion machine of the second kind It is shown that the paradox results because of the incorrect assumption that the noise current at the resistor terminals accounts for the total motor torque

http://ieeexplore.ieee.org/iel5/5/31103/01448037.pdf

A thermodynamic treatment of Penfield's paradox in circuit theory

An APL interpreter has been written in APL. It includes a set of interacting APL functions that accept quote-quad input and act on it in the same way as APL itself would. The interpreter will be used to test some proposed APL language extensions. Extensions already implemented on it include complex number arithmetic, and reduction and scan operators acting on defined as well as primitive scalar functions.

An APL interpreter written in APL

The theoretical possibility of using the thermal noise from a resistor to drive a motor with armature and field in series is discussed. It is shown that the armature produces thermal noise, thereby establishing a mechanism for thermal equilibrium between the motor and the resistor.

https://ieeexplore.ieee.org/iel5/5/31106/01448210.pdf

A resolution of Penfield's paradox

High efficiency oscillator using avalanche square wave diode, considering case of silicon p-i-n diode

Paul Penfield

Papers

A thermodynamic treatment of Penfield's paradox in circuit theory

An APL interpreter written in APL

A resolution of Penfield's paradox

Proposed high-efficiency diode oscillator

Recent results in VLSI CAD at MIT