Results 111 to 120 of about 783,181 (348)

Wearable Morphology‐Adaptive in‐Ear Device With Active Cleansing Capability for Multimodal Health Monitoring

open access: yesAdvanced Materials, EarlyView.
We present SCIENCE, an in‐ear multimodal physiological monitor featuring two key innovations. Water‐triggered morphological expansion (a 2‐mm cylinder to a 9‐mm spindle) achieves conformal adaptation across complex canal geometries. Simultaneously, active biofouling mitigation disrupts cerumen barriers, reducing sensor‐skin impedance by 20%.
Shuyun Zhuo   +3 more
wiley   +1 more source

Perfect Roman Domination: Aspects of Enumeration and Parameterization

open access: yesAlgorithms
Perfect Roman Dominating Functions and Unique Response Roman Dominating Functions are two ways to translate perfect code into the framework of Roman Dominating Functions.
Kevin Mann, Henning Fernau
doaj   +1 more source

Parameterized Algorithms for (r,l)-Partization

open access: yesJournal of Graph Algorithms and Applications, 2013
We consider the (r,l)-Partization problem of finding a set of at most k vertices whose deletion results in a graph that can be partitioned into r independent sets and l cliques.
R. Krithika, N. Narayanaswamy
doaj   +1 more source

Spin Transport Across Interfaces With the Non‐Collinear Antiferromagnet Mn3Sn

open access: yesAdvanced Materials, EarlyView.
We study spin transport with Mn3Sn|Metal${\rm Mn}_3{\rm Sn}\vert{\rm Metal}$ heterostructures. For Mn3Sn|Pt${\rm Mn}_3{\rm Sn}\vert{\rm Pt}$ heterostructures, ultrafast spin current generation by optical pumping of Mn3Sn${\rm Mn}_3{\rm Sn}$ is explored, while for Mn3Sn|NiFe${\rm Mn}_3{\rm Sn}\vert{\rm NiFe}$ heterostructures, we probe the spin–charge ...
Paul A. Marschall   +8 more
wiley   +1 more source

Perfect graphs

open access: yes, 1995
The main objective of the study is to consolidate the works of Berge, Lovasz and Golumbic on finite perfect graphs. A graph G is perfect if G and each of its induced subgraphs have the property that the chromatic number is equal to the clique number ...
Lim, Yvette F.
core  

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science
The Grundy number of a graph is the maximum number of colours used by the "First-Fit" greedy colouring algorithm over all vertex orderings. Given a vertex ordering $\sigma= v_1,\dots,v_n$, the "First-Fit" greedy colouring algorithm ...
Laurent Beaudou   +6 more
doaj   +1 more source

Inverse Design of Nanoparticulate Materials

open access: yesAdvanced Materials, EarlyView.
Inverse design shifts nanomaterial development from empirical trial‐and‐error to predictive model‐driven strategies. It can rely on knowledge‐based, data‐based, or hybrid process and property functions. This perspective article provides a practical framework for applying inverse design based on instructive examples. It discusses which modeling approach
Nabi Etienne Traoré   +5 more
wiley   +1 more source

Atomistic Insights into Gradient Architecture Driven Strengthening in Additively Manufactured Cu–Ni Stepwise Graded Structures

open access: yesAdvanced Materials Interfaces, EarlyView.
Atomistic simulations reveal the interlayer mechanics of additively manufactured materials, showing how build direction and layer interfaces govern diffusion, defect evolution, and mechanical strength. Distinct anisotropic behavior arises from interface‐controlled deformation and dislocation activity, establishing critical links between microstructural
Rohit Singh, Jinoop Arackal Narayanan
wiley   +1 more source

Robust maximum weighted independent-set problems on interval graphs. [PDF]

open access: yes
We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions.
Leus, Roel, Talla Nobibon, Fabrice
core  

Representation of competitions by generalized fuzzy graphs

open access: yesInternational Journal of Computational Intelligence Systems, 2018
Generalized fuzzy graphs are perfect to represent any system like networks, images, scheduling, etc. compared to fuzzy graphs. This study introduces the concept of a generalized fuzzy neighbourhood of a vertex and generalized fuzzy graphs.
Sovan Samanta, Biswajit Sarkar
doaj   +1 more source

Home - About - Disclaimer - Privacy