全文获取类型
收费全文 | 7747篇 |
免费 | 369篇 |
国内免费 | 305篇 |
专业分类
化学 | 312篇 |
晶体学 | 9篇 |
力学 | 419篇 |
综合类 | 73篇 |
数学 | 5817篇 |
物理学 | 1791篇 |
出版年
2024年 | 21篇 |
2023年 | 76篇 |
2022年 | 169篇 |
2021年 | 226篇 |
2020年 | 317篇 |
2019年 | 176篇 |
2018年 | 243篇 |
2017年 | 304篇 |
2016年 | 366篇 |
2015年 | 377篇 |
2014年 | 539篇 |
2013年 | 520篇 |
2012年 | 544篇 |
2011年 | 528篇 |
2010年 | 511篇 |
2009年 | 555篇 |
2008年 | 343篇 |
2007年 | 380篇 |
2006年 | 405篇 |
2005年 | 249篇 |
2004年 | 131篇 |
2003年 | 126篇 |
2002年 | 124篇 |
2001年 | 179篇 |
2000年 | 80篇 |
1999年 | 168篇 |
1998年 | 111篇 |
1997年 | 88篇 |
1996年 | 60篇 |
1995年 | 44篇 |
1994年 | 19篇 |
1993年 | 16篇 |
1992年 | 15篇 |
1991年 | 7篇 |
1990年 | 8篇 |
1989年 | 7篇 |
1988年 | 87篇 |
1987年 | 136篇 |
1986年 | 107篇 |
1985年 | 13篇 |
1984年 | 8篇 |
1983年 | 3篇 |
1982年 | 7篇 |
1981年 | 6篇 |
1980年 | 2篇 |
1979年 | 4篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 6篇 |
1936年 | 2篇 |
排序方式: 共有8421条查询结果,搜索用时 15 毫秒
11.
Kenneth Weber Vilmar Trevisan Luiz Felipe Martins 《Journal of Algorithms in Cognition, Informatics and Logic》2005,54(2):152-167
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors. 相似文献
12.
Hidetoshi Shimodaira 《Annals of the Institute of Statistical Mathematics》1997,49(3):395-410
The asymptotic error probability of Linhart's model selection test isevaluated, and compared with the nominal significance level. We examine thecase where the expected discrepancies of the candidate models from the truemodel are asymptotically equal. The local alternatives method is employed inthe limiting operation of the asymptotic evaluation. Although the errorprobability under the null hypothesis is actually shown to be equal to orless than the level for most situations, intolerable violations of the errorcontrol are observed for nested models: It is often erroneously concludedthat the smaller model is significantly better than the larger model. Toprevent this violation, a modification of Linhart's test statistic isproposed. The effectiveness of the proposed test is confirmed throughtheoretical analysis and numerical simulations. 相似文献
13.
A family of infinite measure preserving odometers is presented which exhibit examples ofp-recurrent but notp+1-recurrent ergodic transformations for everyp>1. 相似文献
14.
Existence of positive solution is established for boundary value problems of non-singular for a class quasi-linear ordinary differential equation on the semi-infinite interval. The results are obtained by using the nonlinear alternative of Leray-Schauder method. 相似文献
15.
The classical perturbation theory is extended to the weighted Kronecker product linear systems W(A? B)Wx =h. Upper bounds are derived for the normwise condition number. 相似文献
16.
For given a graph H, a graphic sequence π = (d
1, d
2,..., d
n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K
5 − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to
be potentially K
5-graphic, where K
r is a complete graph on r vertices and K
r-e is a graph obtained from K
r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence
π to be potentially K
6-graphic.
Project supported by National Natural Science Foundation of China (No. 10401010). 相似文献
17.
《Chaos, solitons, and fractals》2005,23(4):1319-1325
This paper investigates the synchronization of two linearly coupled unified chaotic systems. A new stability criterion for asymptotic synchronization is attained using the Lyapunov stability theory and linear matrix inequality (LMI) approach. A numerical example is given to illuminate the design procedure and advantage of the result derived. 相似文献
18.
三种群食物链交错扩散模型的整体 总被引:1,自引:0,他引:1
本文应用能量估计方法和Gagliardo-Nirenberg型不等式证明了一类强耦合反应扩散系统整体解的存在性和一致有界性,该系统是带自扩散和交错扩散项的三种群Lotka-Volterra食物链模型.通过构造Lyapunov函数给出了该模型正平衡点全局渐近稳定的充分条件. 相似文献
19.
《European Journal of Operational Research》2006,172(2):560-573
This paper describes a parametric family of utility functions for decision analysis. The parameterization embeds the HARA class in a four-parameter representation for the risk aversion function. The resulting utility functions can have only four shapes: concave, convex, S-shaped, and reverse S-shaped. This makes the family suited for both expected utility and prospect theory. The paper also describes an alternative technique to estimate the four parameters from elicited utilities, which is simpler than standard fitting by minimization of the mean quadratic error. 相似文献
20.
《European Journal of Operational Research》2006,174(2):1140-1161
In this paper, a method for optimizing a linear function over the integer Pareto-optimal set without having to determine all integer efficient solutions is presented. The proposed algorithm is based on a simple selection technique that improves the linear objective value at each iteration. Two types of cuts are performed successively until the optimal value is obtained and the current truncated region contains no integer feasible solution. 相似文献