Results 91 to 100 of about 322,300 (286)

Universal Conductance Fluctuations in Quantum Anomalous Hall Insulators

open access: yesAdvanced Materials, EarlyView.
Universal conductance fluctuations are observed in mesoscopic quantum anomalous Hall insulators. Two distinct fluctuation patterns are identified, arising from different interference processes of bulk and chiral edge states, respectively. These findings unveil rich quantum interference phenomena in quantum anomalous Hall insulators and provide insights
Peng Deng   +11 more
wiley   +1 more source

A Self‐Healing Magnetoelectric Sensor with Pain Sensing for Underwater Soft Electronics

open access: yesAdvanced Materials, EarlyView.
This study introduces a self‐healing magnetoelectric sensory system designed for amphibious soft electronics. By utilizing liquid‐metal conductors and self‐healing elastomers, the system enables autonomous recovery from mechanical damage. Its multilayered architecture features dual self‐powered proximity and tactile sensing alongside pain sensing in ...
Xuan Zhang   +6 more
wiley   +1 more source

Resistance to Overdoping Allows Over 2000 S cm−1 Conductivity in P(g3BTTT) With Anion‐Exchange Doping

open access: yesAdvanced Materials, EarlyView.
Anion‐exchange doping of conjugated polymers is an effective way to achieve high conductivities. Here, we report over 2000 S cm−1 electrical conductivity for doped P(g3BTTT). In addition, we show that P(g3BTTT) sustains exceptionally high doping levels without any drop in the charge mobility.
Basil Hunger   +14 more
wiley   +1 more source

Alternative SDP and SOCP approximations for polynomial optimization

open access: yesEURO Journal on Computational Optimization, 2019
In theory, hierarchies of semidefinite programming (SDP) relaxations based on sum of squares (SOS) polynomials have been shown to provide arbitrarily close approximations for a general polynomial optimization problem (POP).
Xiaolong Kuang   +3 more
doaj   +1 more source

Worst-case examples for Lasserre's measure--based hierarchy for polynomial optimization on the hypercube [PDF]

open access: yes, 2018
We study the convergence rate of a hierarchy of upper bounds for polynomial optimization problems, proposed by Lasserre [SIAM J. Optim. 21(3) (2011), pp. 864-885], and a related hierarchy by De Klerk, Hess and Laurent [SIAM J. Optim.
de Klerk, Etienne, Laurent, Monique
core   +2 more sources

Bernstein Polynomial Relaxations for Polynomial Optimization Problems

open access: yes, 2015
In this paper, we examine linear programming (LP) relaxations based on Bernstein polynomials for polynomial optimization problems (POPs). We present a progression of increasingly more precise LP relaxations based on expressing the given polynomial in its Bernstein form, as a linear combination of Bernstein polynomials.
Sassi, Mohamed Amin Ben   +1 more
openaire   +2 more sources

AI–Guided 4D Printing of Carnivorous Plants–Inspired Microneedles for Accelerated Wound Healing

open access: yesAdvanced Materials, EarlyView.
This work presents an artificial intelligence (AI)‐guided 4D‐printed microneedle platform inspired by carnivorous plants for wound healing. A thermo‐responsive shape memory polymer enables body temperature–triggered self‐coiling for autonomous wound closure.
Hyun Lee   +21 more
wiley   +1 more source

Learning parameterized quantum circuits with quantum gradient

open access: yesnpj Quantum Information
Parameterized quantum circuits (PQCs) are crucial for quantum machine learning and circuit synthesis, enabling the practical implementation of complex quantum tasks. However, PQC learning has been largely confined to classical optimization methods, which
Keren Li   +3 more
doaj   +1 more source

A bounded degree SOS hierarchy for polynomial optimization

open access: yesEURO Journal on Computational Optimization, 2017
We consider a new hierarchy of semidefinite relaxations for the general polynomial optimization problem (P):f∗=min{f(x):x∈K} on a compact basic semi-algebraic set K⊂Rn.
JeanB. Lasserre   +2 more
doaj   +1 more source

A New Reduction from Search SVP to Optimization SVP [PDF]

open access: yes, 2012
It is well known that search SVP is equivalent to optimization SVP. However, the former reduction from search SVP to optimization SVP by Kannan needs polynomial times calls to the oracle that solves the optimization SVP.
Hu, Gengran, Pan, Yanbin
core  

Home - About - Disclaimer - Privacy