全文获取类型
收费全文 | 23839篇 |
免费 | 2017篇 |
国内免费 | 1726篇 |
专业分类
化学 | 753篇 |
晶体学 | 14篇 |
力学 | 1035篇 |
综合类 | 324篇 |
数学 | 5487篇 |
物理学 | 2808篇 |
综合类 | 17161篇 |
出版年
2024年 | 140篇 |
2023年 | 308篇 |
2022年 | 574篇 |
2021年 | 627篇 |
2020年 | 518篇 |
2019年 | 538篇 |
2018年 | 551篇 |
2017年 | 729篇 |
2016年 | 789篇 |
2015年 | 802篇 |
2014年 | 1262篇 |
2013年 | 1250篇 |
2012年 | 1368篇 |
2011年 | 1519篇 |
2010年 | 1147篇 |
2009年 | 1442篇 |
2008年 | 1479篇 |
2007年 | 1905篇 |
2006年 | 1702篇 |
2005年 | 1375篇 |
2004年 | 1213篇 |
2003年 | 990篇 |
2002年 | 873篇 |
2001年 | 720篇 |
2000年 | 598篇 |
1999年 | 536篇 |
1998年 | 466篇 |
1997年 | 399篇 |
1996年 | 321篇 |
1995年 | 262篇 |
1994年 | 193篇 |
1993年 | 187篇 |
1992年 | 158篇 |
1991年 | 112篇 |
1990年 | 121篇 |
1989年 | 88篇 |
1988年 | 79篇 |
1987年 | 59篇 |
1986年 | 40篇 |
1985年 | 37篇 |
1984年 | 28篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 5篇 |
1955年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
191.
192.
高宏宾 《五邑大学学报(自然科学版)》2003,17(4):8-12
研究了知识库中挖掘它所包含的精确知识的方法,给出知识库的相关概念及精确知识的定义,讨论了一种在所定义的知识库中提取并判定精确知识的算法. 相似文献
193.
本文研究DNA的两两序列比时,提出了基于快速沃尔什变换的新方法。经过计算模拟分析可知,比对的时间复杂度和空间复杂度明显降低. 相似文献
194.
论述了如何用C语言模拟可变分区存储管理方式的过程。形象地展示了操作系统中可变分区存储管理中采用的最佳适应算法的分配与回收过程,达到了理论与实践相联系的目的。 相似文献
195.
本文对某些非线性方程组F(x)=0,导出了一个算法,用它可以迭代建立F(x)=0的解的紧致上、下界。算法基于某些矩阵的多分裂,因此具有自然的并行性。我们证明了趋向于解的界之收敛原则,给出了参数的收敛性区域并考察了方法的收敛速度。 相似文献
196.
Yosihiko Ogata 《Annals of the Institute of Statistical Mathematics》1990,42(3):403-433
This paper describes a method for an objective selection of the optimal prior distribution, or for adjusting its hyper-parameter, among the competing priors for a variety of Bayesian models. In order to implement this method, the integration of very high dimensional functions is required to get the normalizing constants of the posterior and even of the prior distribution. The logarithm of the high dimensional integral is reduced to the one-dimensional integration of a cerain function with respect to the scalar parameter over the range of the unit interval. Having decided the prior, the Bayes estimate or the posterior mean is used mainly here in addition to the posterior mode. All of these are based on the simulation of Gibbs distributions such as Metropolis' Monte Carlo algorithm. The improvement of the integration's accuracy is substantial in comparison with the conventional crude Monte Carlo integration. In the present method, we have essentially no practical restrictions in modeling the prior and the likelihood. Illustrative artificial data of the lattice system are given to show the practicability of the present procedure. 相似文献
197.
In this paper, we adapt the octahedral simplicial algorithm for solving systems of nonlinear equations to solve the linear complementarity problem with upper and lower bounds. The proposed algorithm generates a piecewise linear path from an arbitrarily chosen pointz
0 to a solution point. This path is followed by linear programming pivot steps in a system ofn linear equations, wheren is the size of the problem. The starting pointz
0 is left in the direction of one of the 2
n
vertices of the feasible region. The ray along whichz
0 is left depends on the sign pattern of the function value atz
0. The sign pattern of the linear function and the location of the points in comparison withz
0 completely govern the path of the algorithm.This research is part of the VF-Program Equilibrium and Disequilibrium in Demand and Supply, approved by the Netherlands Ministry of Education, Den Haag, The Netherlands. 相似文献
198.
A recursive method is developed for the solution of coupled algebraic Riccati equations and corresponding linear Nash strategies of weakly interconnected systems. It is shown that the given algorithm converges to the exact solution with the rate of convergence ofO(2), where is a small coupling parameter. In addition, only low-order systems are involved in algebrdic computations; the amount of computations required does not grow per iteration and no analyticity assumption is imposed on the system coefficients.This work was supported by Rutgers University Research Council under Grant No. 2-02188. 相似文献
199.
Hiroshi Konno 《Mathematical Programming》1988,41(1-3):185-193
We will consider a concave minimization problem associated with a series production system in which raw material is processed inm consecutive facilities. The products at some facility are either sent to the next facility or stocked in the warehouse. The amount of demand for the final products during periodi, i = 1,,n, are known in advance. Our problem is to minimize the sum of processing, holding and backlogging cost, all of which are assumed to be concave.The origin of this model is the classical economic lot size problem of Wagner and Whitin and was extensively studied by Zangwill. This model is very important from the theoretical as well as practical point of view and this is one of the very rare instances in which polynomial time algorithm has been constructed for concave minimization problems.The purpose of this paper is to extend the model further to the situation in which time lag is associated with processing at each facility. We will propose an efficient O(n
4
m) algorithm for this class of problems. 相似文献
200.
A. Y. Lee 《Journal of Optimization Theory and Applications》1987,52(1):151-162
Bounded terminal conditions of nonlinear optimization problems are converted to equality terminal conditions via the Valentine's device. In so doing, additional unknown parameters are introduced into the problem. The transformed problems can still be easily solved using the sequential gradient-restoration algorithm (SGRA) via a simple augmentation of the unknown parameter vector . Three example problems with bounded terminal conditions are solved to verify this technique.This research was supported in part by the National Aeronautics and Space Administration under NASA Grant No. NCC 2-106. 相似文献