Results 101 to 110 of about 42,493 (274)

A Triple of Heavy Subgraphs Ensuring Pancyclicity of 2-Connected Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2017
A graph G on n vertices is said to be pancyclic if it contains cycles of all lengths k for k ∈ {3, . . . , n}. A vertex v ∈ V (G) is called super-heavy if the number of its neighbours in G is at least (n+1)/2.
Wide Wojciech
doaj   +1 more source

Lattice Structures for Bone Replacement: The Intersection of Bone Biomechanics, Lattice Design, and Additive Manufacturing

open access: yesAdvanced Materials Technologies, EarlyView.
This review outlines how understanding bone's biology, hierarchical architecture, and mechanical anisotropy informs the design of lattice structures that replicate bone morphology and mechanical behavior. Additive manufacturing enables the fabrication of orthopedic implants that incorporate such structures using a range of engineering materials ...
Stylianos Kechagias   +4 more
wiley   +1 more source

Metalens Array for Complex‐Valued Optical Discrete Fourier Transform

open access: yesAdvanced Optical Materials, EarlyView.
A single‐layer metalens‐array device performs complex‐to‐complex discrete Fourier transforms (DFTs) optically with O(N) digital time complexity. Integrated interferometric phase retrieval and error mitigation scheme enables accurate, compact, and low‐power optical computing. The approach provides a versatile framework for implementing arbitrary complex‐
Randy Stefan Tanuwijaya   +6 more
wiley   +1 more source

A Fan-Type Heavy Pair Of Subgraphs For Pancyclicity Of 2-Connected Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
Let G be a graph on n vertices and let H be a given graph. We say that G is pancyclic, if it contains cycles of all lengths from 3 up to n, and that it is H-f1-heavy, if for every induced subgraph K of G isomorphic to H and every two vertices u, v ∈ V (K)
Wideł Wojciech
doaj   +1 more source

Accelerating Luminescence in Nanostructures: Exploring the Physical Limits and Impact of Ultrafast Emission in Nanoscale Materials

open access: yesAdvanced Photonics Research, EarlyView.
This review highlights recent advances in accelerating luminescence in nanostructures through cooperative emission, resonator coupling, and nonlocal light–matter interactions. By unifying concepts such as excitonic superradiance, superfluorescence, and the plasmonic Purcell effect, it reveals physical limits of ultrafast emission and their potential ...
Masaaki Ashida   +3 more
wiley   +1 more source

Application of Discrete Mathematics for Programming Discrete Mathematics Calculations

open access: yes, 2023
In the discrete mathematics courses, topics, such as the calculation of the element in any position of a sequence of numbers generated by some recurrence relation, calculation of multiplicative inverses in algebraic ring structures modulo a number n, obtaining the complete list of combinations without repetition, for which you can take advantage of the
openaire   +2 more sources

Enhanced Trapping with an Optimized Graphene‐Based Bowtie Plasmonic Nanotweezer: Design, Analysis, and Bioanalytical Applications

open access: yesAdvanced Photonics Research, EarlyView.
A graphene‐based bowtie plasmonic nanotweezer is designed and optimized using particle swarm optimization and transfer matrix analysis. The structure achieves strong field confinement, delivering trapping forces up to 6 nN W−1 for 10 nm bioparticles with sixfold lower power requirements than conventional designs.
Saba Ebrahimpanah   +2 more
wiley   +1 more source

Energy Consumption Optimization in Trajectory Planning for Fuel Cell Hybrid Uavs Based On HMPC

open access: yesAdvanced Robotics Research, EarlyView.
The endurance limitation of multirotor drones is a critical challenge. This study adopts a hybrid power system of fuel cells and lithium‐ion batteries. Using Nondominated Sorting Genetic Algorithm II, it integrates trajectory planning with energy management optimization.
Xindi Wang   +7 more
wiley   +1 more source

Home - About - Disclaimer - Privacy