Results 121 to 130 of about 2,510,319 (291)
D2D data collaboration forwarding mechanism based on contract theory
Dianxin kexue, 2018 A contract theory-based D2D data forwarding mechanism was proposed for device-to-device (D2D) communications under cellular networks.Firstly,considering the selfishness of users,a model of principal-agent was constructed,which regarded the transmitter ...
Jin ZHOU, Luyang ZHANG, Peng YANG
doaj
The Stable Matching Problem in TBEV Enzootic Circulation: How Important Is the Perfect Tick-Virus Match? [PDF]
Microorganisms, 2021 Liebig K +8 more
europepmc +1 more source
Characterization of Dynamics of Stable Matchings: Attractors Mapped from Stable Matchings
Procedia Computer Science, 2013 AbstractThis note characterizes the dynamic structure of stable matchings of the stable marriage problem (SMP). The characterization focuses on the dynamic process of how the stable matching will be attained. To this end, the discrete problem of the SMP will be mapped to nonlinear dynamical models whose attractors include the counterparts of the stable
Yoshiteru Ishida, Takumi Satou
openaire +2 more sources
Molecular Oncology, EarlyView.Cytarabine is a key therapy for acute myeloid leukaemia (AML), but its efficacy is limited by the dNTPase SAMHD1, which hydrolyses its active metabolite. Screening nucleotide biosynthesis inhibitors revealed that IMPDH inhibitors selectively sensitise SAMHD1‐proficient AML cells to cytarabine.
Miriam Yagüe‐Capilla +9 more
wiley +1 more source
Group Stable Matching Problem in Freight Pooling Service of Vehicle–Cargo Matching Platform
SystemsWith the continuous advancement of the Internet and information technologies, the capacity for development and integration of vehicle and cargo resources has been significantly enhanced, driving the rapid emergence of vehicle–cargo matching platforms ...
Linlin Kong, Min Huang
doaj +1 more source
Many allocation and matching problems (e.g., student-school assignments, job allocation, organ donation) involve coupling agents based on mutual preferences. A central requirement in matching problems is that of stability, that is classically defined as follows: a matching is stable if no blocking pair exists, where a blocking pair is a pair of agents ...
Fanelli, Angelo, Moscardelli, Luca
openaire +2 more sources
Molecular Oncology, EarlyView.RNA profiling of circulating extracellular vesicles (EVs) from blood samples of men undergoing prostate biopsy identifies transcripts associated with clinically significant prostate cancer. Integrative analysis with public tumor datasets links EV‐derived gene signatures to tumor stage and progression‐free survival, highlighting CASP3, XRCC2, and RIT1 ...
Stefan Werner +14 more
wiley +1 more source
Credible Group Stability in Many-to-Many Matching Problems [PDF]
It is known that in two-sided many-to-many matching problems, pairwise stable matchings may not be immune to group deviations, unlike in many- to-one matching problems (Blair 1988). In this paper, we show that pairwise stability is equivalent to credible
Hideo Konishi, M. Utku Ünver
core
Improving Man-Optimal Stable Matchings by Minimum Change of Preference Lists
Algorithms, 2013 In the stable marriage problem, any instance admits the so-called man-optimal stable matching, in which every man is assigned the best possible partner.
Shuichi Miyazaki +4 more
doaj +1 more source
Molecular Oncology, EarlyView.This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska +13 more
wiley +1 more source