全文获取类型
收费全文 | 272篇 |
免费 | 25篇 |
国内免费 | 28篇 |
专业分类
力学 | 4篇 |
综合类 | 11篇 |
数学 | 302篇 |
物理学 | 8篇 |
出版年
2023年 | 2篇 |
2022年 | 8篇 |
2021年 | 2篇 |
2020年 | 13篇 |
2019年 | 7篇 |
2018年 | 8篇 |
2017年 | 14篇 |
2016年 | 6篇 |
2015年 | 4篇 |
2014年 | 6篇 |
2013年 | 22篇 |
2012年 | 6篇 |
2011年 | 13篇 |
2010年 | 19篇 |
2009年 | 29篇 |
2008年 | 23篇 |
2007年 | 10篇 |
2006年 | 28篇 |
2005年 | 12篇 |
2004年 | 7篇 |
2003年 | 11篇 |
2002年 | 13篇 |
2001年 | 8篇 |
2000年 | 10篇 |
1999年 | 10篇 |
1998年 | 6篇 |
1997年 | 7篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1988年 | 1篇 |
1983年 | 1篇 |
1980年 | 1篇 |
1979年 | 2篇 |
排序方式: 共有325条查询结果,搜索用时 31 毫秒
1.
A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs. 相似文献
2.
本文证明了任意两个n阶复矩阵A和B为对角相似的充要条件是:它们有相同的伴随有向图,并且以此有向图为基础有向图,以A和B的对应非零元素比值为弧权值的赋权有向图满足“无向圈平衡条件”。我们还给出了矩阵对角相似条件在非负矩阵谱理论研究中的一个应用。 相似文献
3.
A new method for constructing infinite families of k-tight optimal double loop networks 总被引:2,自引:0,他引:2
CHEN Xiebin Department of Mathematics Information Science Zhangzhou Teachers College Zhangzhou China 《中国科学A辑(英文版)》2006,49(4)
The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0,1,…,40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number nk(t,a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed. 相似文献
4.
半群K(n,r)中的幂等生成元 总被引:1,自引:0,他引:1
设Singn是由一个n元集上的所有奇异变换所构成的奇异变换半群,I是由Singn中一些亏数为1的幂等元组成的集合,Howie利用有向图证明了:I是Singn的一个生成集当且仅当与其相应的有向图D(I)是强连通的完全图,本文利用多重有向图将这一结果推广到Singn的每个理想K(,r)上。 相似文献
5.
6.
The construction of an expert-like system for machine scheduling called SCHEDULE is presented. Essential parts of SCHEDULE were developed by students in a laboratory course Operations Research on Microcomputers at the University of Karlsruhe, Germany. SCHEDULE consists of the components data base, knowledge base, inference engine, explanation facility, dialog component, and knowledge acquisition component. The knowledge base contains an algorithm base for solving different types of scheduling problems. To establish the rules of the knowledge base the well-known three-field classification of deterministic machine scheduling problems and the concept of the reduction digraph are exploited. Experiences gained during building and demonstrating SCHEDULE are reported. 相似文献
7.
Tamás F. Móri 《Journal of Theoretical Probability》1995,8(1):139-164
Considering an infinite string of i.i.d. random letters drawn from a finite alphabet we define the cover timeW
n
as the number of random letters needed until each pattern of lenghtn appears at least once as a substring. Sharp weak and a.s. limit results onW
n
are known in the symmetric case, i.e., when the random letters are uniformly distributed over the alphabet. In this paper we determine the limit distribution ofW
n
in the nonsymmetric case asn. Generalizations in terms of point processes are also proved.Dedicated to Endre Csáki on his 60th birthday. 相似文献
8.
Neumann‐Lara (1985) and ?krekovski conjectured that every planar digraph with digirth at least three is 2‐colorable, meaning that the vertices can be 2‐colored without creating any monochromatic directed cycles. We prove a relaxed version of this conjecture: every planar digraph of digirth at least five is 2‐colorable. The result also holds in the setting of list colorings. 相似文献
9.
10.