EuDML | Browse

The search session has expired. Please query the service again.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 20 of 20

A numerically efficient approach to the modelling of double-Qdot channels

A. Shamloo, A.P. Sowa (2013)

Nanoscale Systems: Mathematical Modeling, Theory and Applications

We consider the electronic properties of a system consisting of two quantum dots in physical proximity, which we will refer to as the double-Qdot. Double-Qdots are attractive in light of their potential application to spin-based quantum computing and other electronic applications, e.g. as specialized sensors. Our main goal is to derive the essential properties of the double-Qdot from a model that is rigorous yet numerically tractable, and largely circumvents the complexities of an ab initio simulation....

A Test for the Stability of Networks

Agnieszka Rowinska-Schwarzweller, Christoph Schwarzweller (2013)

Formalized Mathematics

A complex polynomial is called a Hurwitz polynomial, if all its roots have a real part smaller than zero. This kind of polynomial plays an all-dominant role in stability checks of electrical (analog or digital) networks. In this article we prove that a polynomial p can be shown to be Hurwitz by checking whether the rational function e(p)/o(p) can be realized as a reactance of one port, that is as an electrical impedance or admittance consisting of inductors and capacitors. Here e(p) and o(p) denote...

Computing with the Square Root of NOT

De Vos, Alexis, De Beule, Jan, Storme, Leo (2009)

Serdica Journal of Computing

To the two classical reversible 1-bit logic gates, i.e. the identity gate (a.k.a. the follower) and the NOT gate (a.k.a. the inverter), we add an extra gate, the square root of NOT. Similarly, we add to the 24 classical reversible 2-bit circuits, both the square root of NOT and the controlled square root of NOT. This leads to a new kind of calculus, situated between classical reversible computing and quantum computing.

Costruzione di un universo di dispositivi non lineari su una coppia di gruppi abeliani

F. Parodi (1977)

Rendiconti del Seminario Matematico della Università di Padova

Determining the transfer functions from the signal flow graphs

Ludvík Prouza (1968)

Kybernetika

Evolutionary Design of Digital Circuits Using Improved Multi Expression Programming (IMEP).

F. Z. Hadjam, C. Moraga, M. K. Rahmouni (2007)

Mathware and Soft Computing

Finding the conductors in circular networks from boundary measurements

E. Curtis, E. Mooers, J. Morrow (1994)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Hierarchical residue number systems with small moduli and simple converters

Tadeusz Tomczak (2011)

International Journal of Applied Mathematics and Computer Science

In this paper, a new class of Hierarchical Residue Number Systems (HRNSs) is proposed, where the numbers are represented as a set of residues modulo factors of 2k ± 1 and modulo 2k . The converters between the proposed HRNS and the positional binary number system can be built as 2-level structures using efficient circuits designed for the RNS (2k-1, 2k, 2k+1). This approach allows using many small moduli in arithmetic channels without large conversion overhead. The advantages resulting from the...

Intermittent behavior and synchronization of two coupled noisy driven oscillators.

dos Santos, Ângela Maria, Lopes, Sérgio Roberto, Viana, Ricardo Luiz (2009)

Mathematical Problems in Engineering

Kritérium dominantnosti kořenů

Jaromír Štěpán (1967)

Kybernetika

Neuron circuits with transverse connections

Petr Hiršl (1967)

Kybernetika

Neuron model with electronic treshold circuit

Petr Hiršl (1966)

Kybernetika

On quadratic Hurwitz forms. I

Jiří Gregor (1981)

Aplikace matematiky

Homogeneous quadratic polynomials $f$ in $n$ complex variables are investigated and various necessary and sufficient conditions are given for $f$ to be nonzero in the set $Γ^{(n)} = \{z \in C^{(n)} : R e z > 0\}$ . Conclusions for the theory of multivariable positive real functions are formulated with applications in multivariable electrical network theory.

On $R$ -fuzzy Petri nets.

Peña P., Alirio J. (1999)

Divulgaciones Matemáticas

On the application of parallel architectures to a class of operations research problems

Amitava Dutta, Howard J. Siegel, Andrew B. Whinston (1983)

RAIRO - Operations Research - Recherche Opérationnelle

Rank-three matroids are Rayleigh.

Wagner, David G. (2005)

The Electronic Journal of Combinatorics [electronic only]

Schur's Theorem on the Stability of Networks

Christoph Schwarzweller, Agnieszka Rowińska-Schwarzweller (2006)

Formalized Mathematics

A complex polynomial is called a Hurwitz polynomial if all its roots have a real part smaller than zero. This kind of polynomial plays an all-dominant role in stability checks of electrical networks.In this article we prove Schur's criterion [17] that allows to decide whether a polynomial p(x) is Hurwitz without explicitly computing its roots: Schur's recursive algorithm successively constructs polynomials pi(x) of lesser degree by division with x - c, ℜ {c} < 0, such that pi(x) is Hurwitz if...

Signals generated in memristive circuits

Artur Sowa (2012)

Nanoscale Systems: Mathematical Modeling, Theory and Applications

Signals generated in circuits that include nano-structured elements typically have strongly distinct characteristics, particularly the hysteretic distortion. This is due to memristance, which is one of the key electronic properties of nanostructured materials. In this article, we consider signals generated from a memrsitive circuit model. We demonstrate numerically that such signals can be efficiently represented in certain custom-designed nonorthogonal bases. The proposed method ensures that the...

Stanovení podmínek stability při návrzích metodou geometrického místa kořenů

Miroslav Rosenbaum (1968)

Kybernetika

The transistor model of neuron and neuron net

Marek Decowski (1966)

Kybernetika

Currently displaying 1 – 20 of 20

Page 1