Results 41 to 50 of about 361,091 (296)
Memristive‐Gated RC‐Delay Synaptic Transistors for Time‐Encoded Analog in‐Memory Computing
A Memristive‐Gated Transistor for Time‐Encoded Analog In‐Memory Computing — By exploiting the RC delay of a self‐rectifying interface‐type memristor, nonlinear I–V distortion is structurally bypassed, enabling 3‐bit nonvolatile memory, spike‐timing‐based analog encoding, and hardware‐calibrated reservoir‐computing validation within a unified device ...
Yun‐Seo Shin +7 more
wiley +1 more source
The differential box-counting (DBC) method is useful for determining the fractal dimension of grayscale images. It is simple to learn and implement and has been extensively utilized.
Wenxuan Jiang +5 more
doaj +1 more source
On the poset of partitions of an integer
The partially ordered sets \(P_ n\) of partitions of a positive integer n, ordered by refinement are studied. In particular, the author disproves the conjecture that the partially ordered sets are Cohen-Macaulay [for a definition see \textit{A. Björner, A. M. Garsia} and \textit{R. P.
openaire +3 more sources
Controlling Radiative Phonons in the van der Waals Ferroelectric NbOI2
Using a simple mirror geometry, this work demonstrates local‐density‐of‐optical‐states control of THz phonon emission in van der Waals ferroelectric NbOI2. By engineering the photonic environment, the phonon Q‐factor, linewidth, peak frequency, and emission intensity are reversibly tuned by over an order of magnitude, revealing radiative phonons as ...
Baolong Zhang +5 more
wiley +1 more source
Tailoring Symmetry Breaking in Engineered van der Waals Superlattices
We pioneer a scheme to tailor superpotentials in graphene based on intrinsic substrate electronic orders rather than twist angle. The resulting superpotential folds graphene's Dirac cones to either Γ$\Gamma$ or K‐points, leading to distinct symmetry behaviors.
Keda Jin +7 more
wiley +1 more source
THE PARTITION DIMENSION OF CYCLE BOOKS GRAPH B_(m,n) WITH A COMMON PATH P_2
Suppose is a connected graph with elements of a set of vertices denoted by and a subset of . The distance between and is the shortest distance to every vertex in . Let be a partition of , where each subset belongs to .
Jaya Santoso, Darmaji Darmaji
doaj +1 more source
Microstructures fabricated by two‐beam DLIP combining spatial‐period and roughness gradients are fabricated to enhance directional transport of water droplets. The coupled gradients increase transport distance by 160% and strongly suppress motion against the gradient, demonstrating an effective strategy for controlled droplet manipulation.
Tianhao Wu +3 more
wiley +1 more source
COMPUTING VERTICES OF INTEGER PARTITION POLYTOPES
The paper describes a method of generating vertices of the polytopes of integer partitions that was used by the authors to calculate all vertices and support vertices of the partition polytopes for all n ≤ 105 and all knapsack partitions of n ≤ 165.
A. S. Vroublevski, V. A. Shlyk
doaj
Dimensi Partisi pada Graf Hasil Operasi Korona Tingkat-k
Graph theory is one of the subjects in Discrete Mathematics that have long been known and are widely applied in various fields. The topics that are often discussed in graph theory include labeling, coloring, chromatic numbers, metric dimensions, and ...
Rica Amalia +4 more
doaj +1 more source
Laser‐Induced Local De‐Doping in Organic Semiconductors
The polymer PBTTT‐C14 doped with the small molecule acceptor F4TCNQ is considered as a benchmark material system. Mask‐free, microscale patterning of the doping level via laser‐induced heating and sublimation of dopant molecules is shown. Controlling laser irradiance and swath spacing allows dopant level control with laser‐limited resolution, opening ...
Christian Rainer +5 more
wiley +1 more source

