Results 191 to 200 of about 2,490 (239)

Survival Outcomes of Gemcitabine–Cisplatin–S‐1 Versus Gemcitabine–Cisplatin in Unresectable Biliary Tract Cancer: A Multicenter Retrospective Study With a Focus on Conversion Surgery

Annals of Gastroenterological Surgery, EarlyView.
In this multicenter retrospective study conducted by the Biliary Tract Club, we compared survival outcomes between gemcitabine–cisplatin–S‐1 (GCS) and gemcitabine–cisplatin (GC) in patients with unresectable biliary tract cancer, with a particular focus on conversion surgery. GCS was associated with longer overall and progression‐free survival compared
Hisashi Kosaka, Masahiko Kinoshita, Satoshi Yasuda, Satoru Kakizaki, Rie Sugimoto, Jun Sakata, Kiyonori Yamai, Takeshi Hatanaka, Yusuke Yamamoto, Toshifumi Sato, Toru Ishikawa, Takanori Morikawa, Jun Hanaoka, Haruki Mori, Hidenori Toyoda, Tsuyoshi Sanuki, Misaki Yokoi, Hiroyuki Shibata, Koji Fukuda, Kazuhito Kawata, Koji Amaya, Takashi Ito, Masaaki Hidaka, Atsushi Naganuma, Keishi Sugimachi, Satoshi Toshiyama, Makoto Yamasaki, Masaki Kaibori   +27 more
wiley   +1 more source

Rethinking Perioperative Corticosteroids in Esophageal Cancer Surgery: Evidence From an Integrative Meta‐Analysis

Annals of Gastroenterological Surgery, EarlyView.
ABSTRACT Background Esophagectomy remains a highly invasive procedure associated with substantial postoperative morbidity. Pulmonary complications, anastomotic leakage, and in‐hospital mortality are of particular concern. Perioperative corticosteroids are often administered to attenuate excessive inflammatory responses; however, the clinical impact in ...
Tomohiko Yasuda, Akihisa Matsuda, Nobutoshi Hagiwara, Yoshiharu Nakamura, Hiroshi Yoshida   +4 more
wiley   +1 more source

Real‐time fault detection in multicomponent nuclear‐waste slurries through data fusion of spectroscopic sensors

AIChE Journal, EarlyView.
Abstract Three instruments–Raman spectroscopy, attenuated total reflectance–Fourier transform infrared spectroscopy, and focused beam reflectance measurement–were used to detect sensor faults, mixing faults, and unanticipated chemistry in a system of multicomponent slurries.
Steven H. Crouse, Ronald W. Rousseau, Martha A. Grover   +2 more
wiley   +1 more source

Structure and sequence at an RNA template 5' end influence insertion of transgenes by an R2 retrotransposon protein. [PDF]

RNA
Palm SM, Horton CA, Zhang X, Collins K.
europepmc   +1 more source

Deep Learning‐Assisted Coherent Raman Scattering Microscopy

Advanced Intelligent Discovery, EarlyView.
The analytical capabilities of coherent Raman scattering microscopy are augmented through deep learning integration. This synergistic paradigm improves fundamental performance via denoising, deconvolution, and hyperspectral unmixing. Concurrently, it enhances downstream image analysis including subcellular localization, virtual staining, and clinical ...
Jianlin Liu, Rujia Liu, Xinyan Zhang, Xun Chen, Shuhua Yue   +4 more
wiley   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Fractional Strong Matching Preclusion for DHcube

Parallel Processing Letters, 2021
Let [Formula: see text] be a set edges and [Formula: see text] be a set of edges and/or vertices of a graph [Formula: see text], then [Formula: see text] (resp. [Formula: see text]) is a fractional matching preclusion set (resp. fractional strong matching preclusion set) if [Formula: see text] (resp. [Formula: see text]) contains no fractional perfect
He Zhang, Jinyu Zou, Shuangshuang Zhang, Chengfu Ye   +3 more
openaire   +2 more sources

MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES

Parallel Processing Letters, 2012
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to
Cheng, Eddie, Padmanabhan, Sachin
openaire   +2 more sources

MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES

Journal of Interconnection Networks, 2010
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. For many interconnection networks, the optimal sets are precisely those incident to a single vertex.
EDDIE CHENG, RANDY JIA, DAVID LU
openaire   +1 more source

Integer k-matching preclusion of some interconnection networks

Theoretical Computer Science, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hailun Wu, Lina Ba, Heping Zhang
openaire   +2 more sources

Conditional matching preclusion sets

Information Sciences, 2009
The matching preclusion concept was introduced as a measure of robustness in interconnection networks. A desired property is that the only minimum way to preclude a perfect (respectively, almost-perfect) matching is to delete all edges incident to a single vertex (respectively, all edges incident to two vertices).
Cheng, Eddie, Lesniak, Linda, Lipman, Marc J., Lipták, László   +3 more
openaire   +1 more source