Results 101 to 110 of about 2,896,689 (257)

A novel approach to Fuzzy mixed graph structure with application towards trade relations between countries

Complex & Intelligent Systems
Many of the phenomena around us are a combination of directed and undirected relationships between different subjects, which will be more complex despite the existence of multiple relationships between objects.
Xiaolong Shi, Yongjun Dai, Ali Asghar Talebi, Hossein Rashmanlou, Seyed Hossein Sadati   +4 more
doaj   +1 more source

Nonlinear and oblique boundary value problems for the Stokes equations

Electronic Journal of Qualitative Theory of Differential Equations, 2011
In this paper we consider the nonlinear boundary value problem governed by a stationary perturbed Stokes system with mixed boundary conditions (Dirichlet- maximal monotone graph), in a smooth domain.
Hamid Benseridi, Mourad Dilmi
doaj   +1 more source

USP7 inhibits FOXO1 activity in chronic lymphocytic leukaemia cells enhancing cell survival

Molecular Oncology, EarlyView.
CLL cells rely on BCR‐mediated signalling for survival and proliferation in part through suppression of FOXO1. FOXO1 activity is regulated by a plethora of post‐translational modifications including phosphorylation and ubiquitination. We demonstrated that dual inhibition of BCR signalling and the deubiquitinase USP7 activates FOXO1, modulating its ...
Hassan N.B. Almuhanna, Jodie Hay, Michael W. Moles, Lucy Clarke, Jennifer Cassels, Alison Sefcick, Alison M. McCaig, Heather G. Jørgensen, Alison M. Michie   +8 more
wiley   +1 more source

Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates

Algorithms
We investigate relationships between scheduling problems with the bottleneck objective functions (minimising makespan or maximal lateness) and problems of optimal colourings of the mixed graphs. The investigated scheduling problems have integer durations
Evangelina I. Mihova, Yuri N. Sotskov
doaj   +1 more source

Capturing Topology in Graph Pattern Matching [PDF]

, 2011
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng, Cao, Yang; id_orcid, Wo, Tianyu, Ma, Shuai, Yang Cao, Fan, Wenfei; id_orcid, Tianyu Wo, Shuai Ma, Jinpeng Huai, Wenfei Fan   +9 more
core   +1 more source

Tumour‐proximal deep serum proteomics identifies biomarkers associated with ovarian cancer

Molecular Oncology, EarlyView.
New biomarkers are needed for early ovarian cancer detection. Ovarian (tumour‐proximal) and peripheral vein serum from healthy women and patients with benign or malignant tumours underwent nanoparticle‐enriched deep proteomics. Ovarian serum yielded more protein identifications and revealed tumour‐reflective signatures.
Darren Lau, Daniel Pincher, Clifford Young, Nicholas Chappell, Noor A. Lokman, Parul Mittal, Leigh Donnellan, Martin K. Oehler, Doug A. Brooks, Peter Hoffmann   +9 more
wiley   +1 more source

Computation of mixed resolvability for a circular ladder and its unbounded nature.

PLoS ONE
Let Γ = Γ(V ,E) be a simple, planar, connected, and undirected graph. The article primarily concentrates on a category of planar graphs, detailing the explicit identification of each member within this graph family. Within the domain of graph theory, the
Sunny Kumar Sharma, Vijay Kumar Bhat, Muhammad Azeem, Muhammad Azeem, Manikonda Gayathri, Bandar Almohsen   +5 more
doaj   +1 more source

A Cooperative Merging Method for Mixed Traffic Based on Enhanced Graph Reinforcement Learning with Vehicle Collaboration Graphs

Sensors
Achieving cooperative perception and decision-making among connected and autonomous vehicles (CAVs) in mixed-traffic ramp merge scenarios is crucial for building a swarm intelligence-based traffic control system.
Haifeng Guo, Hongda Fu, Dongwei Xu, Tongcheng Gu, Enwen Qiao, Baiyang Ji   +5 more
doaj   +1 more source

Graph Homomorphism Revisited for Graph Matching [PDF]

, 2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong, Ma, Shuai, Fan, Wenfei; id_orcid, Wu, Yinghui, Wang, Hongzhi   +4 more
core  

Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies

FEBS Open Bio, EarlyView.
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli, Mohammad Nour Alsamsam, Ugnė Bagdonaitė, Van Truc Vu, Chun‐Jen Huang, Polina Kuzhir, Mindaugas Zaremba, Aurimas Kopūstas, Marijonas Tutkus   +8 more
wiley   +1 more source