全文获取类型
收费全文 | 20016篇 |
免费 | 1842篇 |
国内免费 | 943篇 |
专业分类
化学 | 4536篇 |
晶体学 | 62篇 |
力学 | 2244篇 |
综合类 | 300篇 |
数学 | 11573篇 |
物理学 | 4086篇 |
出版年
2024年 | 38篇 |
2023年 | 208篇 |
2022年 | 559篇 |
2021年 | 540篇 |
2020年 | 469篇 |
2019年 | 468篇 |
2018年 | 484篇 |
2017年 | 664篇 |
2016年 | 634篇 |
2015年 | 511篇 |
2014年 | 898篇 |
2013年 | 1211篇 |
2012年 | 1034篇 |
2011年 | 950篇 |
2010年 | 933篇 |
2009年 | 1077篇 |
2008年 | 1196篇 |
2007年 | 1261篇 |
2006年 | 1077篇 |
2005年 | 926篇 |
2004年 | 727篇 |
2003年 | 739篇 |
2002年 | 786篇 |
2001年 | 629篇 |
2000年 | 567篇 |
1999年 | 475篇 |
1998年 | 502篇 |
1997年 | 407篇 |
1996年 | 368篇 |
1995年 | 354篇 |
1994年 | 283篇 |
1993年 | 255篇 |
1992年 | 224篇 |
1991年 | 179篇 |
1990年 | 139篇 |
1989年 | 112篇 |
1988年 | 100篇 |
1987年 | 82篇 |
1986年 | 88篇 |
1985年 | 118篇 |
1984年 | 88篇 |
1983年 | 42篇 |
1982年 | 61篇 |
1981年 | 66篇 |
1980年 | 44篇 |
1979年 | 59篇 |
1978年 | 42篇 |
1977年 | 45篇 |
1976年 | 33篇 |
1974年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
具有模糊数的模糊多目标群体决策优选模型与方法 总被引:5,自引:0,他引:5
多目标群体决策问题是运筹学的一个重要研究领域,目前已经提出了一些有效的决策方法。但对目标值和权重均为模糊数的模糊多目标群体决策问题却研究不多,本对此类模糊多目标群体决策问题进行了探讨,利用相对正理想方案与相对负理想方案概念定义了相对差异距离,进而建立了模糊多目标群体决策优选模型与方法,并通过战役决心方案的评价说明了该方法是可行、有效的,可作为军事决策与决策支持系统的备选方法。 相似文献
32.
As borders between different entities, lines are an important element of natural images. Indeed, the neurons of the mammalian
visual cortex are tuned to respond best to lines of a given orientation. This preferred orientation varies continuously across
most of the cortex, but also has vortex-like singularities known as pinwheels. In attempting to describe such patterns of
orientation preference, we are led to consider underlying rotation symmetries: Oriented segments in natural images tend to
be collinear; neurons are more likely to be connected if their preferred orientations are aligned to their topographic separation.
These are indications of a reduced symmetry requiring joint rotations of both orientation preference and the underlying topography.
This is verified by direct statistical tests in both natural images and in cortical maps. Using the statistics of natural
scenes we construct filters that are best suited to extracting information from such images, and find qualitative similarities
to mammalian vision.
PACS84.35+i 89.70.+c 87.57.Nk 相似文献
33.
This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.
34.
ON HYPERBOLIC TIME DISCOUNTING IN EXHAUSTIBLE RESOURCE MODELS: AN APPLICATION TO WORLD OIL RESOURCES
JOHN ROWSE 《Natural Resource Modeling》2006,19(2):243-277
ABSTRACT. Recent research on discounting in long term economic models involves hyperbolic discounting, in which the marginal discount rate shrinks as time passes. To investigate hyperbolic discounting and exhaustible resource allocation, this work develops a discrete‐time world oil model and model solution procedure, then uses the model to examine the consequences of adopting conventional (constant annual) discounting when hyperbolic discounting is appropriate, of adopting one hyperbolic discount rate path when a different hyperbolic path is appropriate, and of adopting hyperbolic discounting when conventional discounting is appropriate. Five conventional and two hyperbolic discount rate paths are considered. One hyperbolic path is that used by Nordhaus and Boyer [2000]; the other is that recommended by Weitzman [2001]. The generality of the findings is also assessed. 相似文献
35.
36.
37.
李治明 《新疆大学学报(理工版)》2004,21(2):135-141,146
研究了具有开发的单种群非自治周期系统.利用非自治微分方程理论.以及变分法理论和泛函极值的Euler方程方法,得到了该开发系统的持续生存性.周期解存在性,全局渐近稳定性.研究了在开发情况下的最大收获量问题,以及取得最大经济效益下的收获问题等. 相似文献
38.
Tor Schoenmeyr David Yu Zhang 《Journal of Algorithms in Cognition, Informatics and Logic》2005,57(2):130-139
The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method. 相似文献
39.
40.
TANG Chen ZHANG Fang YAN Hai-Qing CHEN Zhan-Qing LUO Tao 《理论物理通讯》2005,44(3):435-439
We develop the three-step explicit and implicit schemes of exponential fitting methods. We use the three- step explicit exponential fitting scheme to predict an approximation, then use the three-step implicit exponential fitting scheme to correct this prediction. This combination is called the three-step predictor-corrector of exponential fitting method. The three-step predictor-corrector of exponential fitting method is applied to numerically compute the coupled nonlinear Schroedinger equation and the nonlinear Schroedinger equation with varying coefficients. The numerical results show that the scheme is highly accurate. 相似文献