We present a novel incremental algorithm for non-slicing floorplans based on the corner block list representation. The horizontal and vertical adjacency graphs are derived from the packing of the initial floorplanning...We present a novel incremental algorithm for non-slicing floorplans based on the corner block list representation. The horizontal and vertical adjacency graphs are derived from the packing of the initial floorplanning results. Based on the critical path and the accumulated slack distances we define,we choose the best position for insertion and do a series of operations incrementally, such as deleting modules, adding modules, and resizing modules quickly. This incremental floorplanning algorithm has a very high speed less than 1μm,which is one of the most important measures in this research. The algorithm preserves the original good performances on area and wire length. It can also supply other tools with good physical estimates for area, wire length, and other performance guidelines.展开更多
There have been a great many of studies on the pointed representations of fi- nite-dimensional sanple Lie algebras.cf.[1][2]etc.In this paper we give a new proof of an impottant Lemma,and from this we derive our main ...There have been a great many of studies on the pointed representations of fi- nite-dimensional sanple Lie algebras.cf.[1][2]etc.In this paper we give a new proof of an impottant Lemma,and from this we derive our main result:Irreducible pointed modules of finite -dimesional simple Lie algebras are all Harish-Chandra modules.展开更多
Objective To construct symptom-formula-herb heterogeneous graphs structured Treatise on Febrile Diseases(Shang Han Lun,《伤寒论》)dataset and explore an optimal learning method represented with node attributes based o...Objective To construct symptom-formula-herb heterogeneous graphs structured Treatise on Febrile Diseases(Shang Han Lun,《伤寒论》)dataset and explore an optimal learning method represented with node attributes based on graph convolutional network(GCN).Methods Clauses that contain symptoms,formulas,and herbs were abstracted from Treatise on Febrile Diseases to construct symptom-formula-herb heterogeneous graphs,which were used to propose a node representation learning method based on GCN−the Traditional Chinese Medicine Graph Convolution Network(TCM-GCN).The symptom-formula,symptom-herb,and formula-herb heterogeneous graphs were processed with the TCM-GCN to realize high-order propagating message passing and neighbor aggregation to obtain new node representation attributes,and thus acquiring the nodes’sum-aggregations of symptoms,formulas,and herbs to lay a foundation for the downstream tasks of the prediction models.Results Comparisons among the node representations with multi-hot encoding,non-fusion encoding,and fusion encoding showed that the Precision@10,Recall@10,and F1-score@10 of the fusion encoding were 9.77%,6.65%,and 8.30%,respectively,higher than those of the non-fusion encoding in the prediction studies of the model.Conclusion Node representations by fusion encoding achieved comparatively ideal results,indicating the TCM-GCN is effective in realizing node-level representations of heterogeneous graph structured Treatise on Febrile Diseases dataset and is able to elevate the performance of the downstream tasks of the diagnosis model.展开更多
A contravaried bilinear pairing X on every M(ρ) × M(ρθ) is determined and it is provedthat M(ρ)is irreducible if and only if K is left nondegellerate. It is also proved that every cyclicpointed module is a qu...A contravaried bilinear pairing X on every M(ρ) × M(ρθ) is determined and it is provedthat M(ρ)is irreducible if and only if K is left nondegellerate. It is also proved that every cyclicpointed module is a quotient of some Verma-like poillted module; moreover if it is irreduciblethen it is a quotieDt of the Vermarlike poiDted module by the left kernel of some bilinearpairing K. In case the mass fUnction is symmetric, there exists a bilinear form on M(ρ). It isproved that unitals pointed modules are integrable. In addition, a characterization of the massfunctions of Kac-Moody algebras is given, which is a generalization of the finite dimensionalLie algebras case.展开更多
A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G, such that every vertex of G is dominated by at least two vertices of D. The do...A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G, such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G = （V, E）, a subset D C V（G） is a 2-dominating set if every vertex of V（G） ／ D has at least two neighbors in D, while it is a 2-outer-independent dominating set of G if additionally the set V（G）／D is independent. The 2-outer-independent domination number of G is the minimum cardinality of a 2-outer-independent dominating set of G. This paper characterizes all trees with the double domination number equal to the 2-outer-independent domination number plus one.展开更多
This paper has two aims. The first is to give a description of irreducible tempered representations of classical p-adic groups which follows naturMly the classification of irreducible square integrable representations...This paper has two aims. The first is to give a description of irreducible tempered representations of classical p-adic groups which follows naturMly the classification of irreducible square integrable representations modulo cuspidal data obtained by Mceglin and the author of this article （2002）. The second aim of the paper is to give a description of an invariant （partially defined function） of irreducible square integrable representation of a classical p-adic group （defined by Mceglin using embeddings） in terms of subquotients of Jacquet modules. As an application, we describe behavior of partially defined function in one construction of square integrable representations of a bigger group from such representations of a smaller group （which is related to deformation of Jordan blocks of representations）.展开更多
文摘We present a novel incremental algorithm for non-slicing floorplans based on the corner block list representation. The horizontal and vertical adjacency graphs are derived from the packing of the initial floorplanning results. Based on the critical path and the accumulated slack distances we define,we choose the best position for insertion and do a series of operations incrementally, such as deleting modules, adding modules, and resizing modules quickly. This incremental floorplanning algorithm has a very high speed less than 1μm,which is one of the most important measures in this research. The algorithm preserves the original good performances on area and wire length. It can also supply other tools with good physical estimates for area, wire length, and other performance guidelines.
文摘There have been a great many of studies on the pointed representations of fi- nite-dimensional sanple Lie algebras.cf.[1][2]etc.In this paper we give a new proof of an impottant Lemma,and from this we derive our main result:Irreducible pointed modules of finite -dimesional simple Lie algebras are all Harish-Chandra modules.
基金New-Generation Artificial Intelligence-Major Program in the Sci-Tech Innovation 2030 Agenda from the Ministry of Science and Technology of China(2018AAA0102100)Hunan Provincial Department of Education key project(21A0250)The First Class Discipline Open Fund of Hunan University of Traditional Chinese Medicine(2022ZYX08)。
文摘Objective To construct symptom-formula-herb heterogeneous graphs structured Treatise on Febrile Diseases(Shang Han Lun,《伤寒论》)dataset and explore an optimal learning method represented with node attributes based on graph convolutional network(GCN).Methods Clauses that contain symptoms,formulas,and herbs were abstracted from Treatise on Febrile Diseases to construct symptom-formula-herb heterogeneous graphs,which were used to propose a node representation learning method based on GCN−the Traditional Chinese Medicine Graph Convolution Network(TCM-GCN).The symptom-formula,symptom-herb,and formula-herb heterogeneous graphs were processed with the TCM-GCN to realize high-order propagating message passing and neighbor aggregation to obtain new node representation attributes,and thus acquiring the nodes’sum-aggregations of symptoms,formulas,and herbs to lay a foundation for the downstream tasks of the prediction models.Results Comparisons among the node representations with multi-hot encoding,non-fusion encoding,and fusion encoding showed that the Precision@10,Recall@10,and F1-score@10 of the fusion encoding were 9.77%,6.65%,and 8.30%,respectively,higher than those of the non-fusion encoding in the prediction studies of the model.Conclusion Node representations by fusion encoding achieved comparatively ideal results,indicating the TCM-GCN is effective in realizing node-level representations of heterogeneous graph structured Treatise on Febrile Diseases dataset and is able to elevate the performance of the downstream tasks of the diagnosis model.
基金Supported in part by National Natural Science Foundation of China under Grant No. 10971071the Outstanding Youth Fund of Henan Province under Grant No. 0512000100Innovation Fund of Colleges and Universities in Henan Province
文摘In this paper, we construct a new algebra structure 7-twisted atone Lie algebra sl（3,C）[θ] and study its vertex operator representations.
文摘A contravaried bilinear pairing X on every M(ρ) × M(ρθ) is determined and it is provedthat M(ρ)is irreducible if and only if K is left nondegellerate. It is also proved that every cyclicpointed module is a quotient of some Verma-like poillted module; moreover if it is irreduciblethen it is a quotieDt of the Vermarlike poiDted module by the left kernel of some bilinearpairing K. In case the mass fUnction is symmetric, there exists a bilinear form on M(ρ). It isproved that unitals pointed modules are integrable. In addition, a characterization of the massfunctions of Kac-Moody algebras is given, which is a generalization of the finite dimensionalLie algebras case.
文摘A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G, such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G = （V, E）, a subset D C V（G） is a 2-dominating set if every vertex of V（G） ／ D has at least two neighbors in D, while it is a 2-outer-independent dominating set of G if additionally the set V（G）／D is independent. The 2-outer-independent domination number of G is the minimum cardinality of a 2-outer-independent dominating set of G. This paper characterizes all trees with the double domination number equal to the 2-outer-independent domination number plus one.
基金supported by Croatian Ministry of Science,Education and Sports(Grant No.#037-0372794-2804)
文摘This paper has two aims. The first is to give a description of irreducible tempered representations of classical p-adic groups which follows naturMly the classification of irreducible square integrable representations modulo cuspidal data obtained by Mceglin and the author of this article （2002）. The second aim of the paper is to give a description of an invariant （partially defined function） of irreducible square integrable representation of a classical p-adic group （defined by Mceglin using embeddings） in terms of subquotients of Jacquet modules. As an application, we describe behavior of partially defined function in one construction of square integrable representations of a bigger group from such representations of a smaller group （which is related to deformation of Jordan blocks of representations）.
