组蛋白甲基化转移酶SET和MYND结构域蛋白3(SET and MYND domain-containing protein 3,SMYD3)是催化组蛋白和非组蛋白底物甲基化的酶,在许多生物学环境中发挥关键作用,如肌肉发育和部分癌症的进展。本综述对SMYD3进行相关的基本介绍,并...组蛋白甲基化转移酶SET和MYND结构域蛋白3(SET and MYND domain-containing protein 3,SMYD3)是催化组蛋白和非组蛋白底物甲基化的酶,在许多生物学环境中发挥关键作用,如肌肉发育和部分癌症的进展。本综述对SMYD3进行相关的基本介绍,并探讨SMYD3在肺癌中的研究,旨在为SMYD3在肺癌中的进一步研究提供依据。展开更多
A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removed the vertex subset from the graph. A polynomial algorithm for finding a minimum feedback vert...A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removed the vertex subset from the graph. A polynomial algorithm for finding a minimum feedback vertex set of a 3-regular simple graph is provided.展开更多
This paper investigates the fine structure of the Gabor frame generated by the B-spline B<sub>3</sub>. In other words, one extends the known part of the Gabor frame set for the 3-spline with the constructi...This paper investigates the fine structure of the Gabor frame generated by the B-spline B<sub>3</sub>. In other words, one extends the known part of the Gabor frame set for the 3-spline with the construction of the compactly supported dual windows. The frame set of the function B<sub>3</sub> is the subset of all parameters (a,b) ∈R<sup>2</sup>+ </sub>for which the time-frequency shifts of B<sub>3</sub> along aZ × bZ form a Gabor frame for L<sup>2</sup>(R).展开更多
Abstract. Let D （U, V, W） be an oriented 3-partite graph with ｜ U ｜ = p, ｜V｜ = q and ｜W ｜ = r. For any vertex x in D（U,V,W）, let dx^＋ and dui^- be the outdegree and indegree ofx respectively. Define aui （o...Abstract. Let D （U, V, W） be an oriented 3-partite graph with ｜ U ｜ = p, ｜V｜ = q and ｜W ｜ = r. For any vertex x in D（U,V,W）, let dx^＋ and dui^- be the outdegree and indegree ofx respectively. Define aui （or simply ai） = q ＋ r ＋ dui^＋ - dui^-, bvj （or simply b j） = p ＋ r ＋ d^＋vj - d^-vj and cwk （or simply ck） =p ＋ q ＋ dwk^＋ -dwk^- as the scores of ui in U,vj in V and wk in W respectively. The set A of distinct scores of the vertices of D（U, V, W） is called its score set. In this paper, we prove that if a1 is a non-negative integer, ai（2 ≤ i ≤ n - 1） are even positive integers and an is any positive integer, then for n 〉 3, there exists an oriented 3-partite graph with the score set A ={a1,Σ2i=1 ai,…,Σni=1 ai}, except when A = {0, 2, 3}. Some more results for score sets in oriented 3-partite graphs are obtained.展开更多
This paper presents a method which uses multiple types of expert knowledge together in 3D medical image segmentation based on rough set theory. The focus of this paper is how to approximate a ROI(region of interest) w...This paper presents a method which uses multiple types of expert knowledge together in 3D medical image segmentation based on rough set theory. The focus of this paper is how to approximate a ROI(region of interest) when there are multiple types of expert knowledge. Based on rough set theory, the image can be split into three regions: positive regions; negative regions; boundary regions. With multiple knowledge we refine ROI as an intersection of all of the expected shapes with single knowledge. At last we show the results of implementing a rough 3D image segmentation and visualization system.展开更多
文摘组蛋白甲基化转移酶SET和MYND结构域蛋白3(SET and MYND domain-containing protein 3,SMYD3)是催化组蛋白和非组蛋白底物甲基化的酶,在许多生物学环境中发挥关键作用,如肌肉发育和部分癌症的进展。本综述对SMYD3进行相关的基本介绍,并探讨SMYD3在肺癌中的研究,旨在为SMYD3在肺癌中的进一步研究提供依据。
文摘A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removed the vertex subset from the graph. A polynomial algorithm for finding a minimum feedback vertex set of a 3-regular simple graph is provided.
文摘This paper investigates the fine structure of the Gabor frame generated by the B-spline B<sub>3</sub>. In other words, one extends the known part of the Gabor frame set for the 3-spline with the construction of the compactly supported dual windows. The frame set of the function B<sub>3</sub> is the subset of all parameters (a,b) ∈R<sup>2</sup>+ </sub>for which the time-frequency shifts of B<sub>3</sub> along aZ × bZ form a Gabor frame for L<sup>2</sup>(R).
文摘Abstract. Let D （U, V, W） be an oriented 3-partite graph with ｜ U ｜ = p, ｜V｜ = q and ｜W ｜ = r. For any vertex x in D（U,V,W）, let dx^＋ and dui^- be the outdegree and indegree ofx respectively. Define aui （or simply ai） = q ＋ r ＋ dui^＋ - dui^-, bvj （or simply b j） = p ＋ r ＋ d^＋vj - d^-vj and cwk （or simply ck） =p ＋ q ＋ dwk^＋ -dwk^- as the scores of ui in U,vj in V and wk in W respectively. The set A of distinct scores of the vertices of D（U, V, W） is called its score set. In this paper, we prove that if a1 is a non-negative integer, ai（2 ≤ i ≤ n - 1） are even positive integers and an is any positive integer, then for n 〉 3, there exists an oriented 3-partite graph with the score set A ={a1,Σ2i=1 ai,…,Σni=1 ai}, except when A = {0, 2, 3}. Some more results for score sets in oriented 3-partite graphs are obtained.
基金PHD Site from Chinese Educational Department,Grant number:20040699015
文摘This paper presents a method which uses multiple types of expert knowledge together in 3D medical image segmentation based on rough set theory. The focus of this paper is how to approximate a ROI(region of interest) when there are multiple types of expert knowledge. Based on rough set theory, the image can be split into three regions: positive regions; negative regions; boundary regions. With multiple knowledge we refine ROI as an intersection of all of the expected shapes with single knowledge. At last we show the results of implementing a rough 3D image segmentation and visualization system.
