全文获取类型
收费全文 | 11721篇 |
免费 | 1039篇 |
国内免费 | 725篇 |
专业分类
化学 | 1558篇 |
晶体学 | 23篇 |
力学 | 833篇 |
综合类 | 183篇 |
数学 | 8482篇 |
物理学 | 2406篇 |
出版年
2024年 | 21篇 |
2023年 | 82篇 |
2022年 | 166篇 |
2021年 | 198篇 |
2020年 | 195篇 |
2019年 | 225篇 |
2018年 | 226篇 |
2017年 | 291篇 |
2016年 | 355篇 |
2015年 | 248篇 |
2014年 | 479篇 |
2013年 | 798篇 |
2012年 | 570篇 |
2011年 | 548篇 |
2010年 | 547篇 |
2009年 | 668篇 |
2008年 | 742篇 |
2007年 | 794篇 |
2006年 | 693篇 |
2005年 | 617篇 |
2004年 | 536篇 |
2003年 | 471篇 |
2002年 | 504篇 |
2001年 | 447篇 |
2000年 | 390篇 |
1999年 | 391篇 |
1998年 | 328篇 |
1997年 | 274篇 |
1996年 | 248篇 |
1995年 | 197篇 |
1994年 | 164篇 |
1993年 | 139篇 |
1992年 | 126篇 |
1991年 | 107篇 |
1990年 | 79篇 |
1989年 | 69篇 |
1988年 | 63篇 |
1987年 | 57篇 |
1986年 | 55篇 |
1985年 | 66篇 |
1984年 | 71篇 |
1983年 | 20篇 |
1982年 | 46篇 |
1981年 | 26篇 |
1980年 | 28篇 |
1979年 | 30篇 |
1978年 | 19篇 |
1977年 | 22篇 |
1976年 | 17篇 |
1974年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
Heleno Bolfarine 《Annals of the Institute of Statistical Mathematics》1990,42(3):435-444
In this paper, Bayesian linear prediction of the total of a finite population is considered in situations where the observation error variance is parameter dependent. Connections with least squares prediction (Royall (1976, J. Amer. Statist. Assoc., 71, 657–664)) in mixed linear models (Theil (1971, Principles of Econometrics, Wiley, New York)), are established. Extensions to the case of dynamic (state dependent) superpopulation models are also proposed. 相似文献
22.
On the convergence of cross decomposition 总被引:2,自引:0,他引:2
Kaj Holmberg 《Mathematical Programming》1990,47(1-3):269-296
Cross decomposition is a recent method for mixed integer programming problems, exploiting simultaneously both the primal and the dual structure of the problem, thus combining the advantages of Dantzig—Wolfe decomposition and Benders decomposition. Finite convergence of the algorithm equipped with some simple convergence tests has been proved. Stronger convergence tests have been proposed, but not shown to yield finite convergence.In this paper cross decomposition is generalized and applied to linear programming problems, mixed integer programming problems and nonlinear programming problems (with and without linear parts). Using the stronger convergence tests finite exact convergence is shown in the first cases. Unbounded cases are discussed and also included in the convergence tests. The behaviour of the algorithm when parts of the constraint matrix are zero is also discussed. The cross decomposition procedure is generalized (by using generalized Benders decomposition) in order to enable the solution of nonlinear programming problems. 相似文献
23.
Luc Devroye 《Random Structures and Algorithms》1990,1(2):191-203
A random m-ary seach tree is constructed from a random permutation of 1,…, n. A law of large numbers is obtained for the height Hn of these trees by applying the theory of branching random walks. in particular, it is shown that Hn/log n→γ in probability as n→∞ where γ = γ(m) is a constant depending upon m only. Interestingly, as m→∞, γ(m) is asymptotic to 1/log m, the coefficient of log n in the asymptotic expression for the height of the complete m-ary search tree. This proves that for large m, random m-ary search trees behave virtually like complete m-ary trees. 相似文献
24.
Uriel Feige David Peleg Prabhakar Raghavan Eli Upfal 《Random Structures and Algorithms》1990,1(4):447-460
In this paper we study the rate at which a rumor spreads through an undirected graph. This study has two important applications in distributed computation: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases. 相似文献
25.
Mathematical Notes - 相似文献
26.
A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time. 相似文献
27.
The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large. 相似文献
28.
We present a linear rational pseudospectral (collocation) method with preassigned poles for solving boundary value problems. It consists in attaching poles to the trial polynomial so as to make it a rational interpolant. Its convergence is proved by transforming the problem into an associated boundary value problem. Numerical examples demonstrate that the rational pseudospectral method is often more efficient than the polynomial method. 相似文献
29.
In this article a simple form of expressing and studying the order conditions to be satisfied by starting algorithms for Runge–Kutta methods, which use information from the two previous steps is presented. In particular, starting algorithms of highest order for Runge–Kutta–Gauss methods up to seven stages are derived. Some numerical experiments with Hamiltonian systems to compare the behaviour of the new starting algorithms with other existing ones are presented. 相似文献
30.
This study investigates the robust output tracking problem for a class of uncertain linear systems. The uncertainties are assumed to be time invariant and to satisfy the matching conditions. According to the selected nominal parameters, an optimal solution with a prescribed degree of stability is determined. Then, an auxiliary input via the use of an adapting factor, connected to the nominal optimal control, is introduced to guarantee the robustness and prescribed degree of stability for the output tracking control of the uncertain linear systems. This method is very simple and effective and can reject bounded uncertainties imposed on the states. A maglev vehicle model example is given to show its effectiveness. 相似文献