in this study an ultra-broad band, low-power, and high-gain cmos distributed amplifier (cmos-da) utilizing a new gain-cell based on the inductively peaking cascaded structure is presented. it is created bycascading of inductively coupled common-source (cs) stage and regulated cascode configuration (rgc).the proposed three-stage da is simulated in 0.13 μm cmos process. it achieves flat and high ...

In English the NP1 V NP2 construction typically involves arguments that are construed as Agent and Patient, or Subject Object. It is associated with notion of transitivity analyzed accordingly, even when it exhibits only syntactic properties but not its semantic characteristics. This phenomenon well-known has been accounted for by linguists (Lakoff 1977; Hopper Thompson 1980, among others) a re...

The Ising machine is an unconventional computing architecture that can be used to solve NP-hard combinatorial optimization problems more efficiently than traditional von Neumann architectures. Fast, compact oscillator networks provide programmable connectivities among arbitrary pairs of nodes are highly desirable for the development practical oscillator-based machines. Here we propose using ele...

It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic (1 ;). Monadic NP is the class of problems expressible in monadic Z;, i.e., 1: with the restriction that the second-order quantifiers range only over sets (as opposed to ranging over, say, binary relations). We prove that connectivity of finite graph...

I assume that most students have encountered Turing machines before. (Students who have not may want to look at Sipser’s book [3].) A Turing machine is defined by an integer k ≥ 1, a finite set of states Q, an alphabet Γ, and a transition function δ : Q×Γk → Q×Γk−1×{L, S,R}k where: • k is the number of (infinite, one-dimensional) tapes used by the machine. In the general case we have k ≥ 3 and ...