全文获取类型
收费全文 | 10821篇 |
免费 | 1272篇 |
国内免费 | 604篇 |
专业分类
化学 | 2730篇 |
晶体学 | 37篇 |
力学 | 718篇 |
综合类 | 245篇 |
数学 | 5229篇 |
物理学 | 3738篇 |
出版年
2024年 | 22篇 |
2023年 | 165篇 |
2022年 | 421篇 |
2021年 | 419篇 |
2020年 | 286篇 |
2019年 | 258篇 |
2018年 | 208篇 |
2017年 | 349篇 |
2016年 | 398篇 |
2015年 | 334篇 |
2014年 | 588篇 |
2013年 | 883篇 |
2012年 | 644篇 |
2011年 | 633篇 |
2010年 | 598篇 |
2009年 | 734篇 |
2008年 | 717篇 |
2007年 | 729篇 |
2006年 | 542篇 |
2005年 | 407篇 |
2004年 | 377篇 |
2003年 | 353篇 |
2002年 | 337篇 |
2001年 | 244篇 |
2000年 | 247篇 |
1999年 | 199篇 |
1998年 | 201篇 |
1997年 | 176篇 |
1996年 | 197篇 |
1995年 | 123篇 |
1994年 | 153篇 |
1993年 | 124篇 |
1992年 | 86篇 |
1991年 | 58篇 |
1990年 | 62篇 |
1989年 | 40篇 |
1988年 | 35篇 |
1987年 | 25篇 |
1986年 | 47篇 |
1985年 | 49篇 |
1984年 | 41篇 |
1983年 | 12篇 |
1982年 | 47篇 |
1981年 | 25篇 |
1980年 | 22篇 |
1979年 | 29篇 |
1978年 | 16篇 |
1977年 | 16篇 |
1976年 | 8篇 |
1959年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 171 毫秒
41.
In this paper, we present a unified treatment and analysis of a dynamic traffic network model with elastic demands formulated and studied as a projected dynamical system. We propose a travel route choice adjustment process that satisfies the projected dynamical system. Under certain conditions, stability and asymptotical stability of the equilibrium patterns are then derived. Finally, two discrete-time algorithms, the Euler method and the Heun method, are proposed for the computation of the solutions, and convergence results established. The convergence results depend crucially on stability analysis. The performance of the algorithms is then illustrated on several transportation networks. 相似文献
42.
Kurt M. Anstreicher 《Mathematical Programming》1997,76(1):245-263
We consider the construction of small step path following algorithms using volumetric, and mixed volumetric-logarithmic, barriers.
We establish quadratic convergence of a volumetric centering measure using pure Newton steps, enabling us to use relatively
standard proof techniques for several subsequently needed results. Using a mixed volumetric-logarithmic barrier we obtain
an O(n
1/4
m
1/4
L) iteration algorithm for linear programs withn variables andm inequality constraints, providing an alternative derivation for results first obtained by Vaidya and Atkinson. In addition,
we show that the same iteration complexity can be attained while holding the work per iteration to O(n
2
m), as opposed to O(nm
2), operations, by avoiding use of the true Hessian of the volumetric barrier. Our analysis also provides a simplified proof
of self-concordancy of the volumetric and mixed volumetric-logarithmic barriers, originally due to Nesterov and Nemirovskii.
This paper was first presented at the 1994 Faculty Research Seminar “Optimization in Theory and Practice”, at the University
of Iowa Center for Advanced Studies. 相似文献
43.
An analytic and numerical study of the behavior of the linear nonhomogeneous wave equation of the form ε2utt = Δu + tf with high wave speed (ε 1) is carried out. This study was initially motivated by meteorological observations which have indicated the presence of large spatial scale gravity waves in the neighborhood of a number of summer and winter storms, mainly from visible images of ripples in clouds in satellite photos. There is a question as to whether the presence of these waves is caused by the nearby storms. Since the linear wave equation is an approximation to the full system describing pressure waves in the atmosphere, yet is considerably more tractable, we have chosen to analyze the behavior of the linear nonhomogeneous wave equation with high wave speed. The analysis is shown to be valid in one, two, and three space dimensions. Partly because of the high wave speed, the solution is known to consist of behavior which changes on two different time scales, one rapid and one slow. Additionally, because of the presence of the nonhomogeneous forcing term tf, we show that there is a component of the solution which will vary only on a very large spatial scale. Since even the linearized wave equation can give rise to persistent large spatial scale waves under the right conditions, the implication is that certain storms could be responsible for the generation of large-scale waves. Numerical simulations in one and two dimensions confirm analytic results. 相似文献
44.
本文在A.Blanco等人的算法的基础上,提出了max-min神经网络的一种改进了的反馈学习算法,严格证明了该算法的迭代收敛性,理论分析及实例计算结果均表明,本文算法具有算法简单,收敛速度快,输出误差小等显著特点。 相似文献
45.
46.
无偏的岭回归迭代算法 总被引:1,自引:0,他引:1
本文探讨线性模型的无偏的岭回归迭代算法,这种算法保持最小二乘法的性质,当存在较为严重的共线性时,它能给出较为精确的参数及其协差阵的估计值;当存在严格的共线性时,给出参数及其协差阵的无穷多解中的一个,这个解由初值决定。文章还给出了算法的收敛性及一些其它性质的证明。 相似文献
47.
郭飞 《应用数学与计算数学学报》1997,11(1):19-26
Wilson,Han和Powell提出的序列二次规划方法(简称SQP方法)是求解非线性规划问题的一个著名方法,这种方法每次迭代的搜索方向是通过求解一个二次规划子问题得到的,本文受[1]启发,得到二次规划子问题的一个近似解,进而给出了一类求解线性约束非线性规划问题的可行方向法,在约束集合满足正则性的条件下,证明了该算法对五种常用线性搜索方法具有全局收敛性。 相似文献
48.
We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help. 相似文献
49.
Finitely generated linear semigroups over a field K that have intermediate growth are considered. New classes of such semigroups are found and a conjecture on the equivalence of the subexponential growth of a finitely generated linear semigroup S and the nonexistence of free noncommutative subsemigroups in S, or equivalently the existence of a nontrivial identity satisfied in S, is stated. This ‘growth alternative’ conjecture is proved for linear semigroups of degree 2, 3 or 4. Certain results supporting the general conjecture are obtained. As the main tool, a new combinatorial property of groups is introduced and studied. 相似文献
50.
运输网络中最小饱和流的求解 总被引:4,自引:0,他引:4
运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用. 相似文献