Results 51 to 60 of about 17,195 (263)
A buried‐junction DSPEC design is introduced that leverages cascade charge transfer to enhance efficiency, stability, and versatility. This approach facilitates effective charge transfer and minimizes recombination losses, leading to significant improvements.
Jun‐Hyeok Park +8 more
wiley +1 more source
A STEGENOGRAPHY IN 3D MESH BY REARRANGING THE ORDER OF VERTEX PRESENTATION
This paper proposes a method of data hiding approach on 3D mesh objects in the representation domain by rearranging the order of the vertices based on a secret key string (a list vertex that was previously traversed as highly secret).
Thái Duy Quý
doaj +1 more source
The separation of Helium gas from natural gas is challenging but highly important. MIL‐116(Ga), a “non‐porous” metal–organic framework is used as a molecular sieve to separate He from CH4. Druse‐like MIL‐116(Ga) particles are integrated into polysulfone mixed matrix membranes.
Ayisha Komal +10 more
wiley +1 more source
Minimum Vertex Cover in Rectangle Graphs [PDF]
We consider the Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families $\calR$ where $R_1 \setminus R_2$ is connected for every pair of rectangles $R_1,R_2 \in \calR$.
Bar-Yehuda, R., Hermelin, D., Rawitz, D.
openaire +5 more sources
Intelligent radiative cooling devices, adaptable to various weather conditions, have the potential for year‐round energy savings. This study introduces a sustainable dual‐mode film made from polycaprolactone nanofibers and upcycled chip bags for effective thermal management.
Qimeng Song +4 more
wiley +1 more source
Efficient Processing of k-Hop Reachability Queries on Directed Graphs
Given a directed graph, a k-hop reachability query, u→?kv, is used to check for the existence of a directed path from u to v that has a length of at most k.
Xian Tang +4 more
doaj +1 more source
Distributed Vertex Cover Reconfiguration
Reconfiguration schedules, i.e., sequences that gradually transform one solution of a problem to another while always maintaining feasibility, have been extensively studied. Most research has dealt with the decision problem of whether a reconfiguration schedule exists, and the complexity of finding one.
Censor-Hillel, Keren +3 more
openaire +4 more sources
Edible electronics needs integrated logic circuits for computation and control. This work presents a potentially edible printed chitosan‐gated transistor with a design optimized for integration in circuits. Its implementation in integrated logic gates and circuits operating at low voltage (0.7 V) is demonstrated, as well as the compatibility with an ...
Giulia Coco +8 more
wiley +1 more source
The dielectric properties of clays are studied on the level of individual monolayers and functional double stacks. The material breakdown characteristics and charge storage performance are analyzed. For illustration, a defined charge pattern representing a cuneiform character is produced, written into a microscopic clay tile, referencing the origins of
Sebastian Gödrich +6 more
wiley +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Demange, Marc, Paschos, Vangelis
openaire +2 more sources

