Results 251 to 260 of about 41,214 (311)
MIMO-enhanced talkative power conversion: a perspective. [PDF]
Commun EngHoeher PA, Leng Y, Zhu R.
europepmc +1 more source
Smart Energy Management for Residential PV Microgrids: ESP32-Based Indirect Control of Commercial Inverters for Enhanced Flexibility. [PDF]
Sensors (Basel)Tradacete-Ágreda M +5 more
europepmc +1 more source
Reversible Thickness Engineering in Amorphous In<sub>2</sub>O<sub>3</sub> Transistors. [PDF]
Nano LettPan YY +8 more
europepmc +1 more source
Digital OTAs: Conventional Designs Versus Emerging Concept
Akbari M, Covi E, Gibertini P.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Applied Categorical Structures, 2009
The review partly uses the authors' abstract. As the authors notice, monoidal objects (pseudomonoids) in monoidal bicategories share many properties with monoidal categories. The existence of (left or right) duals in monoidal categories permits to define dualization operations; a related definition was suggested for monoidal objects by \textit{B.
Ignacio López Franco +2 more
openaire +1 more source
The review partly uses the authors' abstract. As the authors notice, monoidal objects (pseudomonoids) in monoidal bicategories share many properties with monoidal categories. The existence of (left or right) duals in monoidal categories permits to define dualization operations; a related definition was suggested for monoidal objects by \textit{B.
Ignacio López Franco +2 more
openaire +1 more source
INVERTED DISTANCE AND INVERTED WIENER INDEX
Advances and Applications in Discrete Mathematics, 2016The Wiener index is the sum of distances between all pairs of vertices of a (connected) graph. In this paper, we define two novel graph invariants: the inverted distance and the inverted Wiener index. The inverted distance between any two different vertices u and v of a simple connected graph G is defined as: i(u, v) = D - d(u, v) + 1, where D denotes ...
Cancan, Murat, Ediz, Süleyman
openaire +4 more sources
The Bulletin of Symbolic Logic, 2014
AbstractLeonid Levin showed that every algorithm computing a function has an optimal inverter. Recently, we applied his result in various contexts: existence of optimal acceptors, existence of hard sequences for algorithms and proof systems, proofs of Gödel’s incompleteness theorems, analysis of the complexity of the clique problem assuming the ...
Yijia Chen 0001, Jörg Flum
openaire +2 more sources
AbstractLeonid Levin showed that every algorithm computing a function has an optimal inverter. Recently, we applied his result in various contexts: existence of optimal acceptors, existence of hard sequences for algorithms and proof systems, proofs of Gödel’s incompleteness theorems, analysis of the complexity of the clique problem assuming the ...
Yijia Chen 0001, Jörg Flum
openaire +2 more sources
The Arithmetic Teacher, 1963
The teaching of the division of fractions has been and continucs to he a conccm of Leachcrs and wri ters in Lhc field of teaching arit hmctic. Should children merely be told to in vert nnd multiply, or should Lhey divide by the common-denominator method, or would some other method better promote learning?
openaire +1 more source
The teaching of the division of fractions has been and continucs to he a conccm of Leachcrs and wri ters in Lhc field of teaching arit hmctic. Should children merely be told to in vert nnd multiply, or should Lhey divide by the common-denominator method, or would some other method better promote learning?
openaire +1 more source