全文获取类型
收费全文 | 8987篇 |
免费 | 1131篇 |
国内免费 | 346篇 |
专业分类
化学 | 760篇 |
晶体学 | 14篇 |
力学 | 1033篇 |
综合类 | 324篇 |
数学 | 5510篇 |
物理学 | 2823篇 |
出版年
2024年 | 22篇 |
2023年 | 90篇 |
2022年 | 296篇 |
2021年 | 269篇 |
2020年 | 190篇 |
2019年 | 207篇 |
2018年 | 230篇 |
2017年 | 341篇 |
2016年 | 445篇 |
2015年 | 295篇 |
2014年 | 546篇 |
2013年 | 609篇 |
2012年 | 489篇 |
2011年 | 544篇 |
2010年 | 432篇 |
2009年 | 572篇 |
2008年 | 587篇 |
2007年 | 595篇 |
2006年 | 481篇 |
2005年 | 433篇 |
2004年 | 376篇 |
2003年 | 317篇 |
2002年 | 298篇 |
2001年 | 252篇 |
2000年 | 229篇 |
1999年 | 195篇 |
1998年 | 184篇 |
1997年 | 159篇 |
1996年 | 135篇 |
1995年 | 105篇 |
1994年 | 72篇 |
1993年 | 82篇 |
1992年 | 71篇 |
1991年 | 38篇 |
1990年 | 45篇 |
1989年 | 28篇 |
1988年 | 30篇 |
1987年 | 23篇 |
1986年 | 30篇 |
1985年 | 29篇 |
1984年 | 28篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
P‖Cmin随机算法研究 总被引:2,自引:0,他引:2
本文研究了P‖Cmin的随机算法及其最坏情况界,我们给出了Pm‖Cmin在线排序问题新的随机上界,并给出了P2‖Cmin的最好随机算法,其最坏情况界为2/3。对P2‖Cmin已知工件加工时间递减半在线模型,我们给出了一最坏情况界为6/7的随机算法并证明了它为最好的。 相似文献
992.
A. Di Nola
W. Pedrycz
S. Sessa
E. Sanchez
《Fuzzy Sets and Systems》1991,40(3):415-429We give a wide overview on the applications of fuzzy relation equations theory to decision-making processes, to the construction of preference relations and to Knowledge Engineering, mainly fuzzy control and fuzzy pattern recognition. General theoretical results and methodological aspects are pointed out. 相似文献
993.
Clovis C. Gonzaga 《Mathematical Programming》1991,52(1-3):209-225
Interior methods for linear programming were designed mainly for problems formulated with equality constraints and non-negative variables. The formulation with inequality constraints has shown to be very convenient for practical implementations, and the translation of methods designed for one formulation into the other is not trivial. This paper relates the geometric features of both representations, shows how to transport data and procedures between them and shows how cones and conical projections can be associated with inequality constraints. 相似文献
994.
ARemarkontheInverseofPrincipalMatricesbyImplicitLUFactorizationHuangKaibinWuHebin(Dept.ofMath.,NanjingNormalUniversity,Nanji... 相似文献
995.
It is shown that a Gaussian measure in a given infinite-dimensional Banach space always admits an essentially unique Gaussian disintegration with respect to a given continuous linear operator. This covers a similar statement made earlier in [Lee and Wasilkowski, Approximation of linear functionals on a Banach space with a Gaussian measure, J. Complexity 2(1) (1986) 12–43.] for the case of finite-rank operators. 相似文献
996.
We consider several applications of two state, finite action, infinite horizon, discrete-time Markov decision processes with partial observations, for two special cases of observation quality, and show that in each of these cases the optimal cost function is piecewise linear. This in turn allows us to obtain either explicit formulas or simplified algorithms to compute the optimal cost function and the associated optimal control policy. Several examples are presented.Research supported in part by the Air Force Office of Scientific Research under Grant AFOSR-86-0029, in part by the National Science Foundation under Grant ECS-8617860, in part by the Advanced Technology Program of the State of Texas, and in part by the DoD Joint Services Electronics Program through the Air Force Office of Scientific Research (AFSC) Contract F49620-86-C-0045. 相似文献
997.
In this paper, an additive Schwarz algorithm is considered for solving the finite-dimensional nonlinear complementarity problem with M-function. The monotone convergence of the algorithm is obtained with special choices of initial values. Moreover, the weighted max-norm bound is obtained for the iterative errors. 相似文献
998.
Motivated by a simple optimal control problem with state constraints, we consider an inexact implementation of the primal-dual interior point algorithm of Zhang, Tapia, and Dennis. We show how the control problem can be formulated as a linear program in an infinite dimensional space in two different ways and prove convergence results.The research of this author was supported by an Overseas Research Scholarship of the Ministry of Education, Science and Culture of Japan.The research of this author was supported by National Science Foundation grants #DMS-9024622 and #DMS-9321938, North Atlantic Treaty Organization grant #CRG 920067, and an allocation of computing resources from the North Carolina Supercomputing Program.The research of this author was supported by North Atlantic Treaty Organization grant #CRG 920067. 相似文献
999.
Space-Time Point-Process Models for Earthquake Occurrences 总被引:5,自引:0,他引:5
Yosihiko Ogata 《Annals of the Institute of Statistical Mathematics》1998,50(2):379-402
Several space-time statistical models are constructed based on both classical empirical studies of clustering and some more speculative hypotheses. Then we discuss the discrimination between models incorporating contrasting assumptions concerning the form of the space-time clusters. We also examine further practical extensions of the model to situations where the background seismicity is spatially non-homogeneous, and the clusters are non-isotropic. The goodness-of-fit of the models, as measured by AIC values, is discussed for two high quality data sets, in different tectonic regions. AIC also allows the details of the clustering structure in space to be clarified. A simulation algorithm for the models is provided, and used to confirm the numerical accuracy of the likelihood calculations. The simulated data sets show the similar spatial distributions to the real ones, but differ from them in some features of space-time clustering. These differences may provide useful indicators of directions for further study. 相似文献
1000.
In this paper, we present an efficient implementation of theO(mn + n
2 logn) time algorithm originally proposed by Nagamochi and Ibaraki (1992) for computing the minimum capacity cut of an undirected network. To enhance computation, various ideas are added so that it can contract as many edges as possible in each iteration. To evaluate the performance of the resulting implementation, we conducted extensive computational experiments, and compared the results with that of Padberg and Rinaldi's algorithm (1990), which is currently known as one of the practically fastest programs for this problem. The results indicate that our program is considerably faster than Padberg and Rinaldi's program, and its running time is not significantly affected by the types of the networks being solved.Corresponding author. 相似文献