全文获取类型
收费全文 | 57篇 |
免费 | 4篇 |
国内免费 | 5篇 |
专业分类
化学 | 3篇 |
综合类 | 3篇 |
数学 | 58篇 |
物理学 | 2篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2021年 | 1篇 |
2020年 | 1篇 |
2019年 | 2篇 |
2018年 | 1篇 |
2016年 | 1篇 |
2015年 | 2篇 |
2014年 | 3篇 |
2013年 | 2篇 |
2012年 | 2篇 |
2011年 | 5篇 |
2010年 | 4篇 |
2009年 | 3篇 |
2008年 | 7篇 |
2006年 | 5篇 |
2005年 | 2篇 |
2004年 | 3篇 |
2003年 | 1篇 |
2001年 | 3篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1996年 | 2篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1990年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1982年 | 1篇 |
1978年 | 1篇 |
1975年 | 1篇 |
排序方式: 共有66条查询结果,搜索用时 31 毫秒
1.
In this paper,we point out that several assertions(Propositions 3.15 and 5.2(v)) in a previous paper by Majumdar and Samanta are not true in general,by counterexamples. 相似文献
2.
The problem of finding dominators in a directed graph has many important applications, notably in global optimization of computer code. Although linear and near-linear-time algorithms exist, they use sophisticated data structures. We develop an algorithm for finding dominators that uses only a “static tree” disjoint set data structure in addition to simple lists and maps. The algorithm runs in near-linear or linear time, depending on the implementation of the disjoint set data structure. We give several versions of the algorithm, including one that computes loop nesting information (needed in many kinds of global code optimization) and that can be made self-certifying, so that the correctness of the computed dominators is very easy to verify. 相似文献
3.
M. A. Lukin 《Russian Mathematics (Iz VUZ)》2008,52(12):65-68
We describe the structure of semirings which are unions of a ring and a half-body. 相似文献
4.
[a,b]-对等图的范-型条件 总被引:1,自引:0,他引:1
既是[a,b]-覆盖又是[a,b]-消去的图称为[a,b]-对等图.设1≤aan+1a+b,则G为[a,b]-对等图.给出了一个图是[a,b]-对等图的关于范-型条件及邻域并的若干充分条件,并指出定理中的条件在一定意义上是最好可能的. 相似文献
5.
《Discrete Mathematics》2022,345(5):112806
A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph G is the minimum difference between the largest and smallest labels in a sum graph consisting of G and the minimum number of additional isolated vertices necessary so that a sum graph labeling exists. We investigate the spum of various families of graphs, namely cycles, paths, and matchings. We introduce the sum-diameter, a modification of the definition of spum that omits the requirement that the number of additional isolated vertices in the sum graph is minimal, which we believe is a more natural quantity to study. We then provide asymptotically tight general bounds on both sides for the sum-diameter, and study its behavior under numerous binary graph operations as well as vertex and edge operations. Finally, we generalize the sum-diameter to hypergraphs. 相似文献
6.
有限群表示的一个结论 总被引:1,自引:0,他引:1
张玉成 《数学的实践与认识》2004,34(3):116-119
利用陪集、重陪集等概念和性质 ,证明了一个利用有限群 G的子集表示 G的结论 . 相似文献
7.
8.
In this paper we present an approach for modelling and analyzing flexible manufacturing systems (FMSs) using Petri nets. In this approach, we first build a Petri net model (PNM) of the given FMS in a bottom-up fashion and then analyze important qualitative aspects of FMS behaviour such as existence/absence of deadlocks and buffer overflows. The basis for our approach is a theorem we state and prove for computing the invariants of the union of a finite number of Petri nets when the invariants of the individual nets are known. We illustrate our approach using two typical manufacturing systems: an automated transfer line and a simple FMS.A shorter version of this paper was presented at the 1st ORSA/TIMS Special Interest Conference on FMSs, University of Michigan, Ann Arbor, August 1984. 相似文献
9.
We define the concept of fuzzy nilpotent algebra, prove that the homomorphic inverse image of a fuzzy nilpotent algebra is also nilpotent and study the intersection and union of fuzzy nilpotent algebras. 相似文献
10.
苏本堂 《数学物理学报(A辑)》1999,(Z1)
设a<b是整数,G=(V(G),E(G))是一个图.G的一个支撑子图F称为G的一个[a,b]-因子,若对任意的υ∈EV(G),有a≤d_F(υ)≤b.本文得到了下列结果:设1≤a≤b是整数,G是一个阶为n的图,最小度δ(G)≥a且>(a+b)(2a+2b-3)如果对于G的任意两个不相邻的顶点u,υ有N_G(u)UN_G(υ)≥an,则G有一个[a,b]-因子. 相似文献