Results 41 to 50 of about 17,195 (263)
FEBS Open Bio, EarlyView.Clinical analysis reveals significant dysregulation of FGFRL1 in esophageal cancer (EC) patients. RNAi‐coupled next‐generation sequencing (NGS) and in vitro study reveal FGFRL1‐mediated EC progression via EMT, PI3K/Akt, and Notch pathways. Functional assays confirm its role in tumor growth, migration, and invasion.
Aprajita Srivastava +3 more
wiley +1 more source
FEBS Open Bio, EarlyView.Mouse pre‐implantation development involves a transition from totipotency to pluripotency. Integrating transcriptomics, epigenetic profiling, low‐input proteomics and functional assays, we show that eight‐cell embryos retain residual totipotency features, whereas cytoskeletal remodeling regulated by the ubiquitin‐proteasome system drives progression ...
Wanqiong Li +8 more
wiley +1 more source
Bistable Mechanisms 3D Printing for Mechanically Programmable Vibration Control
Advanced Engineering Materials, EarlyView.This work introduces a 3D‐printed bistable mechanism integrated into tuned mass dampers (TMDs) for mechanically adaptive passive vibration suppression. Through optimized geometry, the bistable design provides adaptable vibration reduction across a broad range of scenarios, achieving effective vibration mitigation without complex controls or external ...
Ali Zolfagharian +4 more
wiley +1 more source
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints
AlgorithmsIn this paper, we consider the minimal vertex cover and minimal dominating sets with capacity and/or connectivity constraint enumeration problems. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree graphs.
Yasuaki Kobayashi +4 more
doaj +1 more source
Simultaneously dominating all spanning trees of a graph
Electronic Journal of Graph Theory and Applications, 2022 We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover.
Sebastian Johann +2 more
doaj +1 more source
Cubicity, boxicity, and vertex cover
Discrete Mathematics, 2009 12 ...
Chandran, LS, Das, Anita, Shah, CD
openaire +2 more sources
Advanced Engineering Materials, EarlyView.This study investigates thermo‐chemical processes during high‐temperature testing of two commercial MgO‐C brick grades, one containing 47.5 wt.% MgO‐C recyclate. Using ETV, DTA/TG‐MS, XRD, and SEM/EDS/EBSD, mechanisms such as carbothermal reduction of magnesia, impurity incorporation into the secondary MgO surface layer, and calcium‐rich phase ...
Alexander Schramm +6 more
wiley +1 more source
IEEE Access, 2022 The Minimum Weighted Connected Vertex Cover problem (MWCVC) is to find a subset $F\subset V(G)$ with minimum weight in a node-weighted graph $G$ , such that when removing the set $F$ , the inducing graph of remaining vertices holds no edges, and the ...
Qipeng Xie +4 more
doaj +1 more source
Influence of an Oxygen‐Free Atmosphere on Diamond‐Single‐Grain Scratching of Ti–6Al–4V
Advanced Engineering Materials, EarlyView.Single‐grain scratching of Ti–6Al–4V is investigated under controlled, oxygen‐free, and ambient atmospheres using a novel experimental setup with in situ high‐speed imaging. The approach enables direct observation of chip formation and adhesion under suppressed oxidation.
Berend Denkena +2 more
wiley +1 more source
An Exact Algorithm for Minimum Vertex Cover Problem
Mathematics, 2019 In this paper, we propose a branch-and-bound algorithm to solve exactly the minimum vertex cover (MVC) problem. Since a tight lower bound for MVC has a significant influence on the efficiency of a branch-and-bound algorithm, we define two novel lower ...
Luzhi Wang +3 more
doaj +1 more source