全文获取类型
收费全文 | 1980篇 |
免费 | 73篇 |
国内免费 | 116篇 |
专业分类
化学 | 515篇 |
晶体学 | 1篇 |
力学 | 32篇 |
综合类 | 9篇 |
数学 | 1342篇 |
物理学 | 270篇 |
出版年
2024年 | 5篇 |
2023年 | 53篇 |
2022年 | 37篇 |
2021年 | 26篇 |
2020年 | 48篇 |
2019年 | 50篇 |
2018年 | 40篇 |
2017年 | 32篇 |
2016年 | 26篇 |
2015年 | 23篇 |
2014年 | 82篇 |
2013年 | 238篇 |
2012年 | 70篇 |
2011年 | 101篇 |
2010年 | 108篇 |
2009年 | 141篇 |
2008年 | 108篇 |
2007年 | 139篇 |
2006年 | 99篇 |
2005年 | 76篇 |
2004年 | 70篇 |
2003年 | 70篇 |
2002年 | 44篇 |
2001年 | 50篇 |
2000年 | 34篇 |
1999年 | 54篇 |
1998年 | 53篇 |
1997年 | 44篇 |
1996年 | 46篇 |
1995年 | 26篇 |
1994年 | 20篇 |
1993年 | 11篇 |
1992年 | 20篇 |
1991年 | 12篇 |
1990年 | 14篇 |
1989年 | 7篇 |
1988年 | 4篇 |
1987年 | 8篇 |
1986年 | 6篇 |
1985年 | 11篇 |
1984年 | 13篇 |
1983年 | 7篇 |
1982年 | 8篇 |
1981年 | 4篇 |
1980年 | 8篇 |
1979年 | 4篇 |
1978年 | 4篇 |
1976年 | 3篇 |
1975年 | 3篇 |
1974年 | 3篇 |
排序方式: 共有2169条查询结果,搜索用时 15 毫秒
1.
2.
有限循环群的Fuzzy子群的等价类数 总被引:4,自引:2,他引:2
有限循环群G的F子群可以有无数个.但是.若当两个F子群的水平集构成的集合相等就称其等价的话,那么其等价类数是有限的。通过研究群的合成群列、商群列以及数的因数列和极大因数列找出了有限循环群的极大F子群和F子群的等价类数的求解公式.并给出二者之间的关系式. 相似文献
3.
关于具有给定Sylow子群正规化子的有限群Ⅱ 总被引:1,自引:0,他引:1
本文在有限可解群中解决了:任意m-秩≤2的子群闭的局部群系具有性质:“如果群G的非单位Sylow子群的正规化子属于,则群G也属于的一个充分必要条件. 相似文献
4.
Ross Anderson Cunsheng Ding Tor Helleseth Torleiv Klove 《Designs, Codes and Cryptography》1998,15(2):111-124
Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes. 相似文献
5.
In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal
constant composition codes meeting the upper bound given by [13]. 相似文献
6.
本文得到关于全纯扩充的BHW定理的一个全新的证明,同时也对BHW定 理做出了更一般的推广,并且给出了推广后的BHW定理的两种不同的证明方法. 相似文献
7.
Muhammet Yürüsoy 《Applied mathematics and computation》2004,150(3):775-783
Two dimensional unsteady boundary layer equations of a general model of non-Newtonian fluids were investigated in this study. In this model, the shear stress is taken as an arbitrary function of the velocity gradient. Group classification of the equations with respect to shear stress is done using two different approaches: (1) classical theory (2) equivalence transformations. Both approaches yield identical results. It is found that the principle Lie Algebra extends only for cases of Newtonian and Power-Law flows. 相似文献
8.
Adrian Vasiu 《Central European Journal of Mathematics》2005,3(1):14-25
We include short and elementary proofs of two theorems that characterize reductive group schemes over a discrete valuation
ring, in a slightly more general context. 相似文献
9.
A review of the optimal stopping problem with more than a single decision maker (DM) is presented in this paper. We classify
the existing literature according to the arrival of the offers, the utility of the DMs, the length of the sequence of offers,
the nature of the game and the number of offers to be selected. We enumerate various definitions for this problem and describe
some dynamic approaches.
Fouad Ben Abdelaziz is on leave from the Institut Superieur de Gestion, University of Tunis, Tunisia e-mail: foued.benabdelaz@isg.run.tn. 相似文献
10.
We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process in group technology. Three types of economic decisions are considered: subcontracting, machine duplication and intercell moves. The problem is formulated as a minimum weighted node covering problem in a hypergraph, and we show that it can be solved in polynomial time by finding a maximum weighted stable set in a bipartite graph. We extend this result to cellular manufacturing systems in which the sequence of operations of each part is known in advance. 相似文献