期刊文献+
共找到96篇文章
< 1 2 5 >
每页显示 20 50 100
Partial Groups, Simplicial K(G, 1)’s and Kan Complexes
1
作者 Solomon Jekel 《Advances in Pure Mathematics》 2023年第11期725-731,共7页
In our paper Simplicial K(G, 1)’s we constructed a sub-complex of the nerve of a group G determined by a partial group structure, and we proved, under a generalized associativity condition called regularity, that the... In our paper Simplicial K(G, 1)’s we constructed a sub-complex of the nerve of a group G determined by a partial group structure, and we proved, under a generalized associativity condition called regularity, that the sub-complex realizes as a K(G, 1). This type of sub-complex appears naturally in several topological and algebraic contexts. In this note we prove that regularity of a partial group implies that the Kan extension condition is satisfied on its nerve in dimensions greater than one, and in dimension one a weaker version of the extension condition holds. 展开更多
关键词 Partial Group simplicial Set NERVE Kan Extension
下载PDF
基于SimpliciTI的大棚温湿度无线监测系统设计 被引量:3
2
作者 李建勇 刘雪梅 李洋 《电子设计工程》 2015年第18期173-175,179,共4页
针对目前温室大棚温湿度监测大多采用人工监测或有线监测方式,设计了一种基于Simplici TI的大棚温湿度无线监测系统。该系统以遵循Simplici TI协议的CC2500无线收发器组成星型无线传感器网络,传感器节点采用HTU21D数字温湿度传感器测量... 针对目前温室大棚温湿度监测大多采用人工监测或有线监测方式,设计了一种基于Simplici TI的大棚温湿度无线监测系统。该系统以遵循Simplici TI协议的CC2500无线收发器组成星型无线传感器网络,传感器节点采用HTU21D数字温湿度传感器测量各节点温湿度值,由OLED12832模块现场显示,中央节点把收到的数据经串口上传PC机,并用由VC++6.0制作的监视软件进行显示和记录。测试表明,该系统具有成本低、组网灵活、测量精度高和实用性强等优点。 展开更多
关键词 simplici TI 大棚温湿度监测 CC2500 无线传感器网络 HTU21D
下载PDF
基于Simplici Ti的无线火灾报警系统设计 被引量:3
3
作者 王灵芝 苏文松 翁文陶 《微型机与应用》 2011年第14期24-27,共4页
现有火灾报警主要采用有线方式,耗费材料且难以实现互联报警。采用无线方式能够很好地解决互联报警、降低成本。利用MSP430F227和CC2500搭载Simplici Ti实现节点互联,数据中心节点连接至PC机,PC机实时监控节点信息,在火灾到来时能够及... 现有火灾报警主要采用有线方式,耗费材料且难以实现互联报警。采用无线方式能够很好地解决互联报警、降低成本。利用MSP430F227和CC2500搭载Simplici Ti实现节点互联,数据中心节点连接至PC机,PC机实时监控节点信息,在火灾到来时能够及时准确实现本地报警和远程报警。火灾节点功耗低,休眠时只有不到1μA电流。 展开更多
关键词 simplici TI MSP430 烟雾传感器 GPRS模块
下载PDF
Discrete Differential Calculus on Simplicial Complexes and Constrained Homology
4
作者 Shiquan REN 《Chinese Annals of Mathematics,Series B》 SCIE CSCD 2023年第4期615-640,共26页
Let V be a finite set.Let K be a simplicial complex with its vertices in V.In this paper,the author discusses some differential calculus on V.He constructs some constrained homology groups of K by using the differenti... Let V be a finite set.Let K be a simplicial complex with its vertices in V.In this paper,the author discusses some differential calculus on V.He constructs some constrained homology groups of K by using the differential calculus on V.Moreover,he defines an independence hyper graph to be the complement of a simplicial complex in the complete hypergraph on V.Let L be an independence hypergraph with its vertices in V.He constructs some constrained cohomology groups of L by using the differential calculus on V. 展开更多
关键词 simplicial complexes HYPERGRAPHS Chain complexes HOMOLOGY Differential calculus
原文传递
识别高阶网络传播中最有影响力的节点 被引量:2
5
作者 李江 刘影 +1 位作者 王伟 周涛 《物理学报》 SCIE EI CAS CSCD 北大核心 2024年第4期314-323,共10页
识别网络传播中最有影响力的节点是控制传播速度和范围的重要步骤,有助于加速有益信息扩散,抑制流行病、谣言和虚假信息的传播等.已有研究主要基于描述点对交互的低阶复杂网络.然而,现实中个体间的交互不仅发生在点对之间,也发生在3个... 识别网络传播中最有影响力的节点是控制传播速度和范围的重要步骤,有助于加速有益信息扩散,抑制流行病、谣言和虚假信息的传播等.已有研究主要基于描述点对交互的低阶复杂网络.然而,现实中个体间的交互不仅发生在点对之间,也发生在3个及以上节点形成的群体中.群体交互可利用高阶网络来刻画,如单纯复形与超图.本文研究单纯复形上最有影响力的传播者识别方法.首先,提出单纯复形上易感-感染-恢复(SIR)微观马尔可夫链方程组,定量刻画单纯复形上的疾病传播动力学.接下来利用微观马尔可夫链方程组计算传播动力学中节点被感染的概率.基于网络结构与传播过程,定义节点的传播中心性,用于排序节点传播影响力.在两类合成单纯复形与4个真实单纯复形上的仿真结果表明,相比于现有高阶网络中心性和复杂网络中最优的中心性指标,本文提出的传播中心性能更准确地识别高阶网络中最有影响力的传播者. 展开更多
关键词 高阶网络 单纯复形 节点影响力排序 微观马尔可夫链 复杂网络
下载PDF
FINITE ELEMENT APPROXIMATIONS OF SYMMETRIC TENSORS ON SIMPLICIAL GRIDS IN R^n: THE HIGHER ORDER CASE 被引量:7
6
作者 Jun Hu 《Journal of Computational Mathematics》 SCIE CSCD 2015年第3期283-296,共14页
The design of mixed finite element methods in linear elasticity with symmetric stress approximations has been a longstanding open problem until Arnold and Winther designed the first family of mixed finite elements whe... The design of mixed finite element methods in linear elasticity with symmetric stress approximations has been a longstanding open problem until Arnold and Winther designed the first family of mixed finite elements where the discrete stress space is the space of H(div,Ω;S)-Pk+1 tensors whose divergence is a Pk-1 polynomial on each triangle for k ≥ 2. Such a two dimensional family was extended, by Arnold, Awanou and Winther, to a three dimensional family of mixed elements where the discrete stress space is the space of H(div, Ω; S)-Pk+2 tensors, whose divergence is a Pk-1 polynomial on each tetrahedron for k ≥ 2. In this paper, we are able to construct, in a unified fashion, mixed finite element methods with symmetric stress approximations on an arbitrary simplex in R^n for any space dimension. On the contrary, the discrete stress space here is the space of H(div,Ω; S)-Pk tensors, and the discrete displacement space here is the space of L^2(Ω; R^n)-Pk+1 vectors for k ≥ n+ 1. These finite element spaces are defined with respect to an arbitrary simplicial triangulation of the domain, and can be regarded as extensions to any dimension of those in two and three dimensions by Hu and Zhang. 展开更多
关键词 Mixed finite element Symmetric finite element First order system simplicial grid Inf-sup condition.
原文传递
高阶网络统计指标综述
7
作者 刘波 曾钰洁 +1 位作者 杨荣湄 吕琳媛 《物理学报》 SCIE EI CAS CSCD 北大核心 2024年第12期60-77,共18页
复杂网络是描述和理解现实世界中复杂系统的有力工具.近年来,为了更准确地描述复杂网络中的交互关系,或者从高阶视角分析成对交互作用网络,许多学者开始使用高阶网络进行建模,并在研究其动力学过程中发现了与成对交互作用网络不同的新现... 复杂网络是描述和理解现实世界中复杂系统的有力工具.近年来,为了更准确地描述复杂网络中的交互关系,或者从高阶视角分析成对交互作用网络,许多学者开始使用高阶网络进行建模,并在研究其动力学过程中发现了与成对交互作用网络不同的新现象.然而,与成对交互作用网络相比,高阶网络的研究相对较少;而且,高阶网络结构相对复杂,基于结构的统计指标定义较为分散且形式不统一,这些都给描述高阶网络的拓扑结构特征带来了困难.鉴于此,本文综述了两种最常见的高阶网络——超图和单纯形网络——常用的统计指标及其物理意义.本文有助于加深对高阶网络的理解,促进对高阶网络结构特征的定量化研究,也有助于研究者在此基础上开发更多适用于高阶网络的统计指标. 展开更多
关键词 高阶网络 超图 单纯形网络 统计指标
下载PDF
On the Construction of Well-Conditioned Hierarchical Bases for H(div)-Conforming Rn Simplicial Elements 被引量:1
8
作者 Jianguo Xin Wei Cai Nailong Guo 《Communications in Computational Physics》 SCIE 2013年第8期621-638,共18页
Hierarchical bases of arbitrary order for H(div)-conforming triangular and tetrahedral elements are constructedwith the goal of improving the conditioning of the mass and stiffness matrices.For the basis with the tria... Hierarchical bases of arbitrary order for H(div)-conforming triangular and tetrahedral elements are constructedwith the goal of improving the conditioning of the mass and stiffness matrices.For the basis with the triangular element,it is found numerically that the conditioning is acceptable up to the approximation of order four,and is better than a corresponding basis in the dissertation by Sabine Zaglmayr[High Order Finite Element Methods for Electromagnetic Field Computation,Johannes Kepler Universit¨at,Linz,2006].The sparsity of the mass matrices from the newly constructed basis and from the one by Zaglmayr is similar for approximations up to order four.The stiffness matrix with the new basis is much sparser than that with the basis by Zaglmayr for approximations up to order four.For the tetrahedral element,it is identified numerically that the conditioning is acceptable only up to the approximation of order three.Compared with the newly constructed basis for the triangular element,the sparsity of the massmatrices fromthe basis for the tetrahedral element is relatively sparser. 展开更多
关键词 Hierarchical bases simplicial H(div)-conforming elements matrix conditioning
原文传递
基于分布鲁棒优化的分布式配-微协同日前调度方法
9
作者 巨云涛 康晓帆 +1 位作者 刘文武 张晋奇 《电力系统自动化》 EI CSCD 北大核心 2024年第20期48-58,共11页
微网是消纳新能源和提高配电网可靠性的重要形态,通常有独立的能量管理系统。含多微网的配电网需要协同各个微网,满足安全经济运行的约束。在进行配-微协同调度的过程中,需要采用考虑新能源不确定性、离散调节设备特性的分布式协同方法... 微网是消纳新能源和提高配电网可靠性的重要形态,通常有独立的能量管理系统。含多微网的配电网需要协同各个微网,满足安全经济运行的约束。在进行配-微协同调度的过程中,需要采用考虑新能源不确定性、离散调节设备特性的分布式协同方法。针对以上需求,采用分布鲁棒优化建模的思想对新能源的不确定性进行建模,并基于单纯分解方法-非线性分块高斯-赛德尔方法-增广拉格朗日方法(SDM-GS-ALM)对离散调节设备进行处理。该算法通过凸包对整数变量进行逼近,理论上保证了每次计算问题都是凸问题。在凸问题的基础上,将列与约束生成(C&CG)作为外层算法、SDM-GS-ALM作为内层算法内嵌在C&CG的各阶段,实现配-微协同分布式计算框架的构建。最后,基于北美240节点实际工程系统,采用线路运行状态的聚合等值方法验证所提方法的有效性。 展开更多
关键词 配电网 微网 分布式优化调度 分布鲁棒优化 单纯分解方法 高斯-赛德尔方法 增广拉格朗日方法
下载PDF
A SIMPLICIAL ALGORITHM FOR COMPUTING AN INTEGER ZERO POINT OF A MAPPING WITH THE DIRECTION PRESERVING PROPERTY
10
作者 Chuang-yin Dang 《Journal of Computational Mathematics》 SCIE CSCD 2006年第6期711-718,共8页
A mapping f : Z^n → Rn is said to possess the direction preserving property if fi(x) 〉 0 implies fi(y) ≥ 0 for any integer points x and y with ||x - y||∞≤ 1. In this paper, a simplicial algorithm is deve... A mapping f : Z^n → Rn is said to possess the direction preserving property if fi(x) 〉 0 implies fi(y) ≥ 0 for any integer points x and y with ||x - y||∞≤ 1. In this paper, a simplicial algorithm is developed for computing an integer zero point of a mapping with the direction preserving property. We assume that there is an integer point x^0 with c ≤ x^0≤d satisfying that maxl≤i≤(xi - xi^0)fi(x) 〉 0 for any integer point x with f(x) ≠ 0 on the boundary of H = {x ∈R^n [c-e ≤ x〈d+e},wherecanddaretwo finite integer points with c 〈 d and e = (1, 1,... , 1)^T E R^n. This assumption is implied by one of two conditions for the existence of an integer zero point of a mapping with the preserving property in van der Laan et al. (2004). Under this assumption, starting at x^0, the algorithm follows a finite simplicial path and terminates at an integer zero point of the mapping. This result has applications in general economic equilibrium models with indivisible commodities. 展开更多
关键词 Integer Zero Point Direction Preserving simplicial Algorithm Triangulation Existence.
原文传递
Spanning Simplicial Complex of Wheel Graph Wn
11
作者 A. Zahid M.U. Saleem +3 位作者 A. Kashif M. Khan M.A. Meraj R. Irfan 《Algebra Colloquium》 SCIE CSCD 2019年第2期309-320,共12页
In this paper, we explore the spanning simplicial complex of wheel graph Wn on vertex set [n]. Combinatorial properties of the spanning simplicial complex of wheel graph are discussed, which are then used to compute t... In this paper, we explore the spanning simplicial complex of wheel graph Wn on vertex set [n]. Combinatorial properties of the spanning simplicial complex of wheel graph are discussed, which are then used to compute the f-vector and Hilbert series of face ring k[Δs(Wn)] for the spanning simplicial complex Δs(Wn). Moreover, the associated primes of the facet ideal IF(Δs(Wn)) are also computed. 展开更多
关键词 simplicial COMPLEXES SPANNING trees SPANNING simplicial COMPLEXES f-vectors HILBERT series VERTEX COVERS
原文传递
Relations between Simplicial Groups, 3-Crossed Modules and 2-Quadratic Modules
12
作者 Hasan ATK Erdal ULUALAN 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2014年第6期968-984,共17页
In this paper, we define two-quadratic module and explore the relations among two-quadratic modules, three-crossed modules and simplicial groups.
关键词 simplicial group quadratic module grossed module
原文传递
The Twisted Homology of Simplicial Set
13
作者 Meng Meng ZHANG Jing Yan LI Jie WU 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2022年第10期1781-1802,共22页
In this article,we give a generalization of δ-twisted homology introduced by Jingyan Li,Vladimir Vershinin and Jie Wu,called Δ-twisted homology,which enriches the theory of δ-(co)homology introduced by Alexander Gr... In this article,we give a generalization of δ-twisted homology introduced by Jingyan Li,Vladimir Vershinin and Jie Wu,called Δ-twisted homology,which enriches the theory of δ-(co)homology introduced by Alexander Grigor’yan,Yuri Muranov and Shing-Tung Yau.We show that the Mayer-Vietoris sequence theorem holds for Δ-twisted homology.Applying the Δ-twisted ideas to Cartesian products,we introduce the notion of Δ-twisted Cartesian product on simplicial sets,which generalizes the classical work of Barratt,Gugenheim and Moore on twisted Cartesian products of simplicial sets.Under certain hypothesis,we show that the coordinate projection of Δ-twisted Cartesian product admits a fibre bundle structure. 展开更多
关键词 simplicial set Δ-Twisted homology Homotopy type Fibre bundle
原文传递
A SIMPLICIAL HOMOTOPY ALGORITHM FOR COMPUTING ZERO POINTS ON POLYTOPES
14
作者 陈开周 杨再福 梁正礼 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 1994年第2期186-193,共8页
In this paper a triangulation of continuous and arbitrary refinement of grid sizes is proposed for simplicial homotopy algorithms to compute zero points on a polytope P. The proposed algorithm generates a piecewise li... In this paper a triangulation of continuous and arbitrary refinement of grid sizes is proposed for simplicial homotopy algorithms to compute zero points on a polytope P. The proposed algorithm generates a piecewise linear path in P × [1,∞) from any chosen interior point x0 of P on level {1} to a solution of the underlying problem. The path is followed by making linear programming pivot steps in a linear system and replacement steps in the triangnlation.The starting point x0 is left in a direction to one vertex of P. The direction in which x0 leaves depends on the function value at x0 and the polytope P. Moreover, we also give a new equivalent form of the Brouwer fixed point theorem on polytopes. This form has many important applications in mathematical programming and the theory of differential equations. 展开更多
关键词 Zero point simplicial homotopy algorithm variable dimension algorithm triangulation polytope.
原文传递
Moment-angle manifolds and connected sums of simplicial spheres
15
作者 Feifei Fan Xiangjun Wang 《Science China Mathematics》 SCIE CSCD 2021年第12期2743-2758,共16页
The connected sum is a fundamental operation in geometric topology and combinatorics.In this paper,we study the connection between connected sums of simplicial spheres and the algebraic topology of their corresponding... The connected sum is a fundamental operation in geometric topology and combinatorics.In this paper,we study the connection between connected sums of simplicial spheres and the algebraic topology of their corresponding moment-angle manifolds.The cohomology rings of moment-angle manifolds corresponding to connected sums of simplicial spheres are computed,which leads to a conjecture on the topology of such moment-angle manifolds. 展开更多
关键词 moment-angle manifold simplicial sphere Gorenstein^(*)complex connected sum
原文传递
The NF-Number of a Simplicial Complex
16
作者 Takayuki Hibi Hasan Mahmood 《Algebra Colloquium》 SCIE CSCD 2022年第4期643-650,共8页
Let△bea simplicial complex on[n].TheNF-complex of△is the simplicial complexδ_(NF)(△)on[n]for which the facet ideal of△is equal to the Stanley-Reisner ideal ofδ_(NF)(△).Furthermore,for each k=2,3,....,we introdu... Let△bea simplicial complex on[n].TheNF-complex of△is the simplicial complexδ_(NF)(△)on[n]for which the facet ideal of△is equal to the Stanley-Reisner ideal ofδ_(NF)(△).Furthermore,for each k=2,3,....,we introduce the kth NF-complexδ_(NF)^(k)(△),which is inductively defined asδ_(NF)(k)(△)=δ_(NF)(δ_(NF)^(k-1)(△))by settingδ_(NF)^(1)(△)=δ_(NF)(△).One canδ_(NF)^(0)(△)=△.The NF-number of△is the smallest integer k>0 for whichδ_(NF)^(k)(△)■△.In the present paper we are especilly interested in the NF-number of a finite graph,which can be regraded as a simplicial complex of dimension one.It is shown that the NF-number of the finite graph K_(n)■K_(m)on[n+m],which is the disjoint union of the complete graphs K_(n)on[n]and K_(m)on[m]for n≥2 and m≥2 with(n,m)≠(2,2),is equal to n+m+2.As a corollary,we find that the NF-number of the complete bipartite graph K_(n,m)on[n+m]is also equal to n+m+2. 展开更多
关键词 Stanley-Reisner complex facet ideal simplicial complex vertex cover
原文传递
有限数字单纯复形的数字Lusternik-Schnirelmann范畴
17
作者 何震 杨子康 王玉玉 《廊坊师范学院学报(自然科学版)》 2024年第3期25-29,共5页
给出有限数字单纯映射间的数字连续关系、数字连续类、有限数字单纯复形以及有限数字单纯映射的强数字等价等概念。在此基础上,定义了有限数字单纯复形的数字Lusternik-Schnirelmann范畴和数字几何LusternikSchnirelmann范畴。最后,给... 给出有限数字单纯映射间的数字连续关系、数字连续类、有限数字单纯复形以及有限数字单纯映射的强数字等价等概念。在此基础上,定义了有限数字单纯复形的数字Lusternik-Schnirelmann范畴和数字几何LusternikSchnirelmann范畴。最后,给出了在强数字等价和强数字收缩的情况下,以上两个数字范畴的一些相关结论。 展开更多
关键词 有限数字单纯复形 数字Lusternik-Schnirelmann范畴 数字连续类 强数字等价 强数字收缩
下载PDF
有向图的加权解析挠率
18
作者 任世全 王冲 《Chinese Quarterly Journal of Mathematics》 2023年第1期30-49,共20页
In 2020,Alexander Grigor'yan,Yong Lin and Shing-Tung Yau[6]introduced the Reidemeister torsion and the analytic torsion for digraphs by means of the path complex and the path homology theory.Based on the analytic ... In 2020,Alexander Grigor'yan,Yong Lin and Shing-Tung Yau[6]introduced the Reidemeister torsion and the analytic torsion for digraphs by means of the path complex and the path homology theory.Based on the analytic torsion for digraphs introduced in[6],we consider the notion of weighted analytic torsion for vertex-weighted digraphs.For any non-vanishing real functions f and g on the vertex set,we consider the vertex-weighted digraphs with the weights(f;g).We calculate the(f;g)-weighted analytic torsion by examples and prove that the(f;g)-weighted analytic torsion only depend on the ratio f=g.In particular,if the weight is of the diagonal form(f;f),then the weighted analytic torsion equals to the usual(un-weighted)torsion. 展开更多
关键词 Chain complex Hodge-Laplace operator Analytic torsion HOMOLOGY DIGRAPH Weighted simplicial complex
下载PDF
基于图注意力的高阶网络节点分类方法 被引量:1
19
作者 陈东洋 郭进利 《计算机应用研究》 CSCD 北大核心 2023年第4期1095-1100,1136,共7页
为了更好地学习网络中的高阶信息和异质信息,基于单纯复形提出单纯复形—异质图注意力神经网络方法—SC-HGANN。首先,用单纯复形提取网络高阶结构,将单纯复形转换为单纯复形矩阵;其次,使用注意力机制从特征单纯复形中得到异质节点的特征... 为了更好地学习网络中的高阶信息和异质信息,基于单纯复形提出单纯复形—异质图注意力神经网络方法—SC-HGANN。首先,用单纯复形提取网络高阶结构,将单纯复形转换为单纯复形矩阵;其次,使用注意力机制从特征单纯复形中得到异质节点的特征;再次,对同质和异质单纯复形矩阵进行卷积操作后,得到同质特征与异质特征,通过注意力算子进行特征融合;最后,得到目标节点的特征并将其输入到节点分类模块完成分类。与GCN、HGNN、HAN等基线方法相比,提出的方法在三个数据集上的macro-F1、micro-F1、precision和recall均有所提升。表明该方法能有效地学习网络中的高阶信息和异质信息,并能提升网络节点分类的准确率。 展开更多
关键词 单纯复形 高阶网络 注意力机制 图神经网络 节点分类
下载PDF
基于MSP430和CC2500的USB无线数据采集系统 被引量:6
20
作者 张彭朋 何娜 《电子设计工程》 2010年第2期12-14,18,共4页
设计基于MSP430单片机和CC2500无线收发器的USB无线数据采集系统,通过USB调试端口在IDE或CCE开发环境下编写、下载和调试应用程序,其目标板可作为一个独立的具有或没有外部传感器的系统。介绍基于MSP430和CC2500无线开发工具的系统结构... 设计基于MSP430单片机和CC2500无线收发器的USB无线数据采集系统,通过USB调试端口在IDE或CCE开发环境下编写、下载和调试应用程序,其目标板可作为一个独立的具有或没有外部传感器的系统。介绍基于MSP430和CC2500无线开发工具的系统结构,控制模块的硬件结构,无线收发部分和数据采集传输电路的设计,以及软件开发、SimpliciTI协议的引用。 展开更多
关键词 MSP430 CC2500 USB接口 simplici TI协议
下载PDF
上一页 1 2 5 下一页 到第
使用帮助 返回顶部