Results 51 to 60 of about 6,056 (148)
A General Approach to Dropout in Quantum Neural Networks
Advanced Quantum Technologies, EarlyView., 2023 Randomly dropping artificial neurons and all their connections in the training phase reduces overfitting issues in classical neural networks, thus improving performances on previously unseen data. The authors introduce different dropout strategies applied to quantum neural networks, learning models based on parametrized quantum circuits.
Francesco Scala +3 more
wiley +1 more source
Advanced Intelligent Systems, EarlyView.This study introduces polyethylene glycol‐functionalized carbon nanotubes (CNTs) to enhance dispersion, interfacial bonding, and 4D printability in polyvinyl chloride‐PCL nanocomposites. The optimized 4D composite (0.5 wt% CNT) achieves a 25% increase in tensile strength, 95.78% shape fixity, and 5‐s recovery time.
Davood Rahmatabadi +6 more
wiley +1 more source
The t-stability number of a random graph
, 2010 Given a graph G = (V,E), a vertex subset S is called t-stable (or t-dependent) if the subgraph G[S] induced on S has maximum degree at most t. The t-stability number of G is the maximum order of a t-stable set in G. We investigate the typical values that
Fountoulakis, Nikolaos +2 more
core +1 more source
Advanced Intelligent Systems, EarlyView.A mobile robot equipped with a 3D‐printed, noninvasive electrophysiological sensor for real‐time monitoring of tomato plant health based on irrigation levels is presented. The sensor provides high electrical reliability, sensitive electrophysiological signal detection (0.0122 mV), and 86.91% classification accuracy using scalogram images, thereby ...
Yiting Chen +4 more
wiley +1 more source
Exploring Process‐Structure–Property Relationships of PEKK and PEEK in Fused Filament Fabrication
Journal of Applied Polymer Science, EarlyView.Exploring the process‐structure‐property relationships of PEKK and PEEK in FFF. ABSTRACT High‐performance polymers (HPP) have gained significant attention in recent years because of their potential for metal replacement in industries with demanding environments, such as aerospace, where high‐strength lightweight parts are essential.
Aaron Maloney +3 more
wiley +1 more source
Improper colouring of unit disk graphs
, 2007 Motivated by a satellite communications problem, we consider a generalised colouring problem on unit disk graphs. A colouring is k -improper if no vertex receives the same colour as k +1 of its neighbours. The k -improper chromatic number chi_k (G) is the least number of colours needed in a k -improper colouring of a graph G.
Havet, Frédéric +2 more
openaire +1 more source
The history of anatomical engagement
Anatomical Sciences Education, EarlyView.Abstract The public's fascination with anatomy has evolved over time and progressed from avoidance of the tainted yet saintly corpse, to their fascination with cabinets of curiosities. The current narrative review explores public engagement (PE), from its potential origins as cave paintings, to the rise of the disciplinarity of anatomy.
Quenton Wessels, Adam M. Taylor
wiley +1 more source
About a Brooks-type theorem for improper colouring
, 2009 A graph is k-improperly -colourable if its vertices can be partitioned into parts such that each part induces a subgraph of maximum degree at most k. A result of Lovasz a states that for any graph G, such a partition exists if l is at least (Δ(G)+1)/(k+1) .
Correa, Ricardo +2 more
openaire +1 more source
Anatomical Sciences Education, EarlyView.Abstract Qualitative research is increasingly engaged in anatomical sciences education research. However, many in the discipline are not formally trained in qualitative methodology and—like other research methods—qualitative methods are continually developed and enhanced.
Angelique N. Dueñas +2 more
wiley +1 more source
Minimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs
, 2007 For digraphs $G$ and $H$, a homomorphism of $G$ to $H$ is a mapping $f:\ V(G)\dom V(H)$ such that $uv\in A(G)$ implies $f(u)f(v)\in A(H)$. If, moreover, each vertex $u \in V(G)$ is associated with costs $c_i(u), i \in V(H)$, then the cost of a ...
Gupta, A. +4 more
core +2 more sources