Results 51 to 60 of about 4,527 (205)

基于FQn和圈的细胞分裂生长网络FQCC(n,k)及其性质 Based on FQn and Cycles Cell-Breeding Network FQCC(n,k) and Its Properties

open access: yes, 2017
折叠立方体连通圈网络FQCC(n) (n > 1)是一类典型的互连网络,它是3正则的。师海忠根据折叠立方体连通圈网络i>FQCC(n) (n > 1)和细胞分裂生长图模型设计出了一种新的互连网络——FQCC(n,k) (n > 1,k是非负整数):用三长的圈代替FQCC(n)的每个顶点且圈中每个顶点恰位于折叠立方体连通圈网络FQCC(n) (n > 1)中与该顶点关联的一条边上,得到新的网络FQCC(n,1);再类似的用三长的圈代替FQCC(n,1)的每个顶点得FQCC(n,2 ...
赵媛, 师海忠
semanticscholar   +1 more source

Crouching Tiger, Hidden Dragon: An Offensive Realist Reconsideration of Philippine Grand Strategy

open access: yesAsian Politics &Policy, Volume 17, Issue 3, July 2025.
ABSTRACT In regions riddled with heightened security tensions from great power competition like Southeast Asia, why do states like the Philippines defy conventional rationality and hedge against their treaty ally? This paper seeks to answer this gap in the literature by arguing for a new definition of hedging that covers contemporary cases.
Jomari Jesus G. Tan
wiley   +1 more source

Toward an ASEAN Strategic Narrative: Community, Agency, Inclusivity

open access: yesAsian Politics &Policy, Volume 17, Issue 3, July 2025.
ABSTRACT At the present time there is a growing interest in strategic narratives. The United States and China, not surprisingly, receive most attention. In an increasingly multi‐polar world, however, it is critical to consider the strategic narratives of India, Japan, and Southeast Asia. Significant work has already been focused on individual Southeast
Anthony Milner
wiley   +1 more source

Non-equimolar (Hf,Zr,Ta,W)B_2 high-entropy diborides enable superior oxidation resistance

open access: yesScience China Materials, 2023
Zihao Wen   +5 more
semanticscholar   +1 more source

图中具有指定性质的不交子图 Disjoint Subgraphs with Specified Properties in Graphs

open access: yes, 2017
令G是一个顶点数为n的简单图,满足n≥4k,k是任意正整数。假设,则图G可划分成k-1个点不交的4-团和一个弦圈,使得弦圈上点的度大于等于3或4。 Let G be a graph of order n with n≥4k, where k is a positive integer. Suppose that , then the partition of G can be k-1 vertex disjoint 4-cliques and a chordal cycle, where the ...
王怡华, 李硕, 衣晓宁
semanticscholar   +1 more source

The Primate Name Yòu (狖) and Its Referents: Implications for the Future Conservation of François' Langurs in China 灵长类动物名称“狖”及其指代对象再钩沉: 对中国黑叶猴 (Trachypithecus francoisi) 未来保护的启迪

open access: yesIntegrative Conservation, Volume 4, Issue 2, Page 246-253, June 2025.
After the great Chinese poet Qu Yuan (屈原) was exiled to Xupu (溆浦) county in Hu' nan province, he described the forest there as follows: “mysterious is the deep forest, the place where Yuán yòu dwell (深林杳以冥冥兮,乃猿狖之所居).” What is the referent of the name Yuán yòu in this sentence?
Kefeng Niu
wiley   +1 more source

Sanitary survey rapport 3: Venø Bugt, Kås og Salling

open access: yes, 2017
Denne sanitary survey vurderer de potentielle mikrobiologiske forureningskilder, der kan have betydning for muslingeproduktionen i Venø Bugt, Venø Sund, Kås Bredning, Salling Sund, Lysen Bredning, Dråby Vig og Fur Sund (produktionsområderne 5-9 og 12-15).
Larsen, Martin Mørk   +6 more
openaire   +2 more sources

Self-powered sensitive pressure sensor matrix based on patterned arrays of flexible (K,Na)NbO_3 piezoelectric nanorods

open access: yesScience China Materials, 2023
Lei Jiang   +8 more
semanticscholar   +1 more source

Identification of Priority Areas for Conservation of Threatened Agamid Lizards of Sri Lanka Using Species Distribution Modeling 斯里兰卡濒危蜥蜴 (鬣蜥科) 保护优先区域的识别:基于物种分布模型的研究

open access: yesIntegrative Conservation, Volume 4, Issue 2, Page 188-204, June 2025.
We assessed the distribution of 14 threatened agamid lizard species using Species Distribution Modeling to identify hotspots for these species' conservation. Based on the results, high‐priority areas of threatened agamids were projected to occur specially in the wet zone.
Iresha Wijerathne   +10 more
wiley   +1 more source

几类笛卡尔乘积图的k路顶点覆盖数问题 The k-Path Vertex Cover in Several Cartesian Product Graphs

open access: yes, 2017
对于任意图G和正整数k,如果图G中所有长度为k的路都至少含有其顶点子集S中的点,那么我们称顶点子集S为k路顶点覆盖集。我们定义最小的集合S的基数为φk(G),并且称它为图G的k路顶点覆盖数.本文我们主要研究了笛卡尔乘积图的k路顶点覆盖数问题,并给出了φk(Cm□PN2)的估计值。 For a graph G and a positive integer k, a subset S of vertices of G is called a k-path vertex cover if S ...
李钊, 左连翠
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy