检索结果-南通市图书馆

Establishing prognostic models for intrahepatic cholangiocarcinoma based on immune cells

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

World Journal of Gastrointestinal Oncology 2024年第10期16卷 4092-4103页

作者： Zhuo-Ran Wang Cun-Zhen Zhang Zhan Ding Yi-Zhuo Li jian-hua yin Nan Li Department of Hepatic Surgery I(Ward I)Shanghai Eastern Hepatobiliary Surgery Hospital Navy Medical UniversityShanghai 200433China Key Laboratory of Biological Defense Ministry of EducationNavy Medical UniversityShanghai 200433China Shanghai Key Laboratory of Medical Bioprotection Navy Medical UniversityShanghai 200433China Department of Epidemiology Faculty of Navy MedicineNavy Medical UniversityShanghai 200433China Department of Oncology 905 Hospital of People’s Liberation Army NavyShanghai 200050China Department of Hepatobiliary Surgery The Second Affiliated HospitalWenzhou Medical UniversityWenzhou 325000Zhejiang ProvinceChina

BACKGROUND Intrahepatic cholangiocarcinoma(ICC)is a malignant liver tumor that is challenging to treat and manage and current prognostic models for the disease are inefficient or ***-associated immune cells are critical for tumor development and *** main goal of this study was to establish models based on tumor-associated immune cells for predicting the overall survival of patients undergoing surgery for *** To establish 1-year and 3-year prognostic models for ICC after surgical *** Immunohistochemical staining was performed for CD4,CD8,CD20,pan-cytokeratin(CK),and CD68 in tumors and paired adjacent tissues from 141 patients with ICC who underwent curative *** of variables was based on regression diagnostic procedures and goodness-of-fit tests(PH assumption).Clinical parameters and pathological diagnoses,combined with the distribution of immune cells in tumors and paired adjacent tissues,were utilized to establish 1-and 3-year prognostic *** This is an important application of immune cells in the tumor ***4,CD8,CD20,and CK were included in the establishment of our prognostic model by stepwise selection,whereas CD68 was not significantly associated with the prognosis of *** integrating clinical data associated with ICC,distinct prognostic models were derived for 1-and 3-year survival outcomes using variable *** 1-year prediction model yielded a C-index of 0.7695%confidence interval(95%CI):0.65-0.87 and the 3-year prediction model produced a C-index of 0.69(95%CI:0.65-0.73).Internal validation yielded a C-index of 0.761(95%CI:0.669-0.853)for the 1-year model and 0.693(95%CI:0.642-0.744)for the 3-year *** We developed Cox regression models for 1-year and 3-year survival predictions of patients with ICC who underwent resection,which has positive implications for establishing a more comprehensive prognostic model for ICC based on tumor immune microenvironment an

关键词： Intrahepatic cholangiocarcinoma Tumor immune cells Biomarkers Prognosis Prediction models

On a Problem of Potentially Pancyclic-graphic Sequences Due to S.B. Rao

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2019年第2期35卷 465-474页

作者： jian-hua yin Department of Mathematics College of Information Science and TechnologyHainan University

A non-increasing sequenceπ=(d_1,d_2,···,d_n)of nonnegative integers is said to be potentially hamiltonian-graphic(*** pancyclic-graphic)if it is realizable by a simple graph on n vertices containing a hamiltonian cycle(*** cycles of every length from 3 to n).*** and ***(*** Ser.B,13(1972),185–191)and Kundu(Discrete Math.,6(1973),367–376)presented a characterization ofπ=(d_1,d_2,···,d_n)that is potentially ***(Lecture Notes in Math.,No.855,Springer Verlag,1981,417–440,Unsolved Problem 2)further posed the following problem:present a characterization ofπ=(d_1,d_2,···,d_n)that is potentially *** this paper,we first give solution to this problem for the case of 4≤n≤***,we also show that a near regular graphic sequenceπ=(d_1,d_2,···,d_n)with dn≥3 is potentially pancyclic-graphic.

关键词： graphic sequence potentially hamiltonian-graphic sequence potentially pancyclic-graphic sequence

A Rao-type Characterization for a Sequence to Have a Realization Containing an Arbitrary Subgraph H

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2014年第3期30卷 389-394页

作者： jian hua yin Department of Mathematics College of Information Science and TechnologyHainan University

Let G be an arbitrary spanning subgraph of the complete graph Kr＋1 on r＋1 vertices and Kr＋1-E（G） be the graph obtained from Kr＋1 by deleting all edges of G.A non-increasing sequence π=（d1,d2,...,dn） of nonnegative integers is said to be potentially Kr＋1-E（G）-graphic if there is a graph on n vertices that has π as its degree sequence and contains Kr＋1-E（G） as a *** this paper,a characterization of π that is potentially Kr＋1-E（G）-graphic is given,which is analogous to the Erdo s–Gallai characterization of graphic sequences using a system of *** is a solution to an open problem due to Lai and *** a corollary,a characterization of π that is potentially Ks,tgraphic can also be obtained,where Ks,t is the complete bipartite graph with partite sets of size s and *** is a solution to an open problem due to Li and yin.

关键词： Degree sequence potentially Kr+1--E(G)-graphic sequence potentially Ks,t-graphicsequence

A Characterization for a Sequence to be Potentially K_(r+1) — e-graphic

在线全文

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2013年第4期29卷 787-792页

作者： jian-hua yin Ye WANG Department of Mathematics College of Information Science and TechnologyHainan University

Let n 〉 r, let lr --- （dl,d2,-,dn） be a non-increasing sequence of nonnegative integers and let Kr＋l - e be the graph obtained from Kr＋l by deleting one edge. If zr has a realization G containing Kr＋l - e as a subgraph, then r is said to be potentially Kr＋l - e-graphic. In this paper, we give a characterization for a sequence π to be potentially Kr＋l - e-graphic.

关键词： graph degree sequence potentially Kr+1 - e-graphic sequence

A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected

在线全文

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2022年第1期38卷 223-228页

作者： jian-hua yin Ji-yun GUO School of Science Hainan UniversityHaikou 570228China

A graphic sequence π =(d1, d2,..., dn) is said to be forcibly k-edge-connected if every realization of π is k-edge-connected. In this paper, we obtain a new sufficient degree condition for π to be forcibly k-edgeconnected. We also show that this new sufficient degree condition implies a strongest monotone degree condition for π to be forcibly 2-edge-connected and a conjecture about a strongest monotone degree condition for π to be forcibly 3-edge-connected due to Bauer et al.(Networks, 54(2)(2009) 95-98), and also implies a strongest monotone degree condition for π to be forcibly 4-edge-connected.

关键词： graphic sequence forcibly k-edge-connected graphic sequence a strongest monotone degree condition

A New Lower Bound on the Potential-Ramsey Number of Two Graphs

在线全文

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2021年第1期37卷 176-182页

作者： Jin-zhi DU jian-hua yin School of Science Hainan UniversityHaikou 570228China

A nonincreasing sequenceπ=(d1,…,dn)of nonnegative integers is a graphic sequence if it is realizable by a simple graph G on n *** this case,G is referred to as a realization ofπ.Given a graph H,a graphic sequenceπis potentially H-graphic ifπhas a realization containing H as a *** graphs G1 and G2,the potential-Ramsey number rpot(G1,G2)is the smallest integer k such that for every k-term graphic sequenceπ,eitherπis potentially G1-graphic or the complementary sequenceπ=(k-1-dk,…,k-1-d1)is potentially *** 0≤k≤[t/2],denote Kt-k to be the graph obtained from Kt by deleting k independent *** k=0,Busch et al.(Graphs Combin.,30(2014)847-859)present a lower bound on rpot(G,Kt)by using the 1-dependence number of *** this paper,we utilize i-dependence number of G for i≥1 to give a new lower bound on rpot(G,Kt-k)for any k with 0≤k≤[T/2].Moreover,we also determine the exact values of rpot(Kn,Kt-k)for 1≤k≤2.

关键词： graphic sequence potential-Ramsey number

Graphic Sequences and Split Graphs

在线全文

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2016年第4期32卷 1005-1014页

作者： jian-hua yin Lei MENG Meng-Xiao yin College of Information Science and Technology Hainan University School of Computer Electronics and InformationGuangxi University

The split graph Kr∨Ks on r＋s vertices is denoted by Sr,s A graphic sequence π = （d1, d2, …, dn） is said to be potentially Sr,s-graphic if there is a realization of π containing Sr,s as a subgraph. In this paper, a simple sufficient condition for π to be potentially Sr,s-graphic is obtained, which extends an analogous condition for π to be potentially Kr＋1-graphic due to yin and Li （Discrete Math. 301 （2005） 218-227）. As an application of this condition, we further determine the values of δ（Sr,s, n） for n _≥3＋ 3s - 1.

关键词： graphic sequence potentially Kr+1-graphic sequence potentially St.,s-graphic sequence

Solution to an Extremal Problem on Bigraphic Pairs with a Z3-connected Realization

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2017年第8期33卷 1131-1153页

作者： jian hua yin Xiang Yu DAI Department of Mathematics College of Information Science and TechnologyHainan UniversityHaikou 570228P.R.China

Let S = （a1,...,am;b1,...,bn）, where a1,...,am and b1,...,bn are two nonincreasing sequences of nonnegative integers. The pair S= （a1,..., am; b1,..., bn） is said to be a bigraphic pair if there is a simple bipartite graph G = （X ∪ Y, E） such that a1,…, am and b1,..., bn are the degrees of the vertices in X and Y, respectively. Let Z3 be the cyclic group of order 3. Define σ（Z3, m, n） to be the minimum integer k such that every bigraphic pair S = （a1,..., am; b1,..., bn） with am, b ≥ 2 and σ（S） = a1 ＋ ... ＋ am ≥ k has a Z3-connected realization. For n = m, yin [Discrete Math., 339, 2018-2026 （2016）] recently determined the values of σ（Z3,m,m） for m ≥ 4. In this paper, we completely determine the values of σ（Z3, m, n） for m ≥ n ≥4.

关键词： Bigraphic pair Z3-connected realization group connectivity

The 2-pebbling Property for Dense Graphs

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2013年第3期29卷 557-570页

作者： Ze Tu GAO jian hua yin Department of Mathematics College of Information Science and Technology

Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move on G consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The pebbling number f（G） is the smallest number m such that for every distribution of m pebbles and every vertex v, a pebble can be moved to v. A graph G is said to have the 2-pebbling property if for any distribution with more than 2f（G） - q pebbles, where q is the number of vertices with at least one pebble, it is possible, using pebbling moves, to get two pebbles to any vertex. Snevily conjectured that G（s, t） has the 2- pebbling property, where G（s, t） is a bipartite graph with partite sets of size s and t （s 〉 t）. Similarly, the ~,pebbling number fl（G） is the smallest number m such that for every distribution of m pebbles and every vertex v, ~ pebbles can be moved to v. Herscovici et al. conjectured that fl（G） ≤ 1.5n ＋ 8l -- 6 for the graph G with diameter 3, where n = IV（G）I. In this paper, we prove that if s ≥ 15 and G（s,t）

关键词： Pebbling number 2-pebbling property bipartite graph