全文获取类型
收费全文 | 21957篇 |
免费 | 2732篇 |
国内免费 | 589篇 |
专业分类
化学 | 844篇 |
晶体学 | 13篇 |
力学 | 1061篇 |
综合类 | 352篇 |
数学 | 7693篇 |
物理学 | 2877篇 |
无线电 | 12438篇 |
出版年
2024年 | 62篇 |
2023年 | 220篇 |
2022年 | 413篇 |
2021年 | 502篇 |
2020年 | 519篇 |
2019年 | 412篇 |
2018年 | 450篇 |
2017年 | 669篇 |
2016年 | 892篇 |
2015年 | 915篇 |
2014年 | 1530篇 |
2013年 | 1452篇 |
2012年 | 1511篇 |
2011年 | 1672篇 |
2010年 | 1151篇 |
2009年 | 1387篇 |
2008年 | 1476篇 |
2007年 | 1573篇 |
2006年 | 1321篇 |
2005年 | 1089篇 |
2004年 | 904篇 |
2003年 | 779篇 |
2002年 | 708篇 |
2001年 | 588篇 |
2000年 | 522篇 |
1999年 | 400篇 |
1998年 | 376篇 |
1997年 | 315篇 |
1996年 | 277篇 |
1995年 | 194篇 |
1994年 | 119篇 |
1993年 | 134篇 |
1992年 | 111篇 |
1991年 | 54篇 |
1990年 | 67篇 |
1989年 | 47篇 |
1988年 | 47篇 |
1987年 | 27篇 |
1986年 | 36篇 |
1985年 | 85篇 |
1984年 | 76篇 |
1983年 | 32篇 |
1982年 | 54篇 |
1981年 | 35篇 |
1980年 | 29篇 |
1979年 | 20篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1975年 | 3篇 |
1959年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 843 毫秒
71.
72.
资源有限的加权总完工时间单机排序问题 总被引:1,自引:0,他引:1
本讨论资源有限的加权总工时间单机排序问题,对现在仍为OPEN问题1|pj=bj-ajuj,∑uj≤U|∑wjCj给出了一个有关最优解中最优资源分配的重要性质,并利用该性质分别给出了三种情况bj=b,wj=w,aj=a;bj=b,wj=w,uj=u;aj=a,wj=w,uj=u的最优算法。 相似文献
73.
74.
75.
有限循环群的Fuzzy子群的等价类数 总被引:4,自引:2,他引:2
有限循环群G的F子群可以有无数个.但是.若当两个F子群的水平集构成的集合相等就称其等价的话,那么其等价类数是有限的。通过研究群的合成群列、商群列以及数的因数列和极大因数列找出了有限循环群的极大F子群和F子群的等价类数的求解公式.并给出二者之间的关系式. 相似文献
76.
Naus Joseph I. Wallenstein Sylvan 《Methodology and Computing in Applied Probability》2004,6(4):389-400
Researchers apply scan statistics to test for unusually large clusters of events within a time window of specified length w, or alternatively an unusually small window w that contains a specified number of events. In some cases, the researcher is interested in testing for a range of specified window lengths, or a set of several specified number of events k (cluster sizes). In this paper, we derive accurate approximations for the joint distributions of scan statistics for a range of values of w, or of k, that can be used to set an experiment-wide level of significance that takes into account the multiple comparisons involved. We use these methods to compare different ways of choosing the window sizes for the different cluster sizes. One special case is a multiple comparison procedure based on a generalized likelihood ratio test (GLRT) for a range of window sizes. We compare the power of the GLRT with another method for allocating the window sizes. We find that the GLRT is sensitive for very small window sizes at the expense of moderate and larger window sizes. We illustrate these results on two examples, one involving clustering of translocation breakpoints in DNA, and the other involving disease clusters. 相似文献
77.
We present a practical polynomial-time algorithm for computing the
zeta function of a Kummer curve over a finite field of small
characteristic. Such algorithms have recently been obtained using a
method of Kedlaya based upon Monsky–Washnitzer cohomology, and are of
interest in cryptography. We take a different approach.
The problem is reduced to that of computing the L-function
of a multiplicative character sum. This latter task is achieved via a
cohomological formula based upon the work of Dwork and Reich. We show,
however, that our method and that of Kedlaya are very closely related.Dedicated to the memory of Gian-Carlo Rota 相似文献
78.
In this paper we focus on the problem of identifying the index sets P(x):=i|xi>0, N(x):={i|Fi(x)>0 and C(x):=i|xi=Fi(x)=0} for a solution x of the monotone nonlinear complementarity problem NCP(F). The correct identification of these sets is important from both theoretical and practical points of view. Such an identification enables us to remove complementarity conditions from the NCP and locally reduce the NCP to a system which can be dealt with more easily. We present a new technique that utilizes a sequence generated by the proximal point algorithm (PPA). Using the superlinear convergence property of PPA, we show that the proposed technique can identify the correct index sets without assuming the nondegeneracy and the local uniqueness of the solution.This work was supported in part by a Grant-in-Aid for Scientific Research from the Ministry of Education, Science, Sports and Culture of Japan.Mathematics Subject Classification (2000): 90C33, 65K10 相似文献
79.
Clemens Heuberger 《Periodica Mathematica Hungarica》2004,49(2):65-89
We study digit expansions with arbitrary integer digits in base q (q integer) and the Fibonacci base such that the sum of the absolute values of the digits is minimal. For the Fibonacci case, we describe a unique minimal expansion and give a greedy algorithm to compute it. Additionally, transducers to calculate minimal expansions from other expansions are given. For the case of even integer bases q, similar results are given which complement those given in [6]. 相似文献
80.
Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered... 相似文献