全文获取类型
收费全文 | 9476篇 |
免费 | 786篇 |
国内免费 | 717篇 |
专业分类
化学 | 646篇 |
晶体学 | 8篇 |
力学 | 448篇 |
综合类 | 116篇 |
数学 | 3280篇 |
物理学 | 1345篇 |
综合类 | 5136篇 |
出版年
2024年 | 40篇 |
2023年 | 126篇 |
2022年 | 165篇 |
2021年 | 175篇 |
2020年 | 222篇 |
2019年 | 236篇 |
2018年 | 219篇 |
2017年 | 300篇 |
2016年 | 264篇 |
2015年 | 253篇 |
2014年 | 453篇 |
2013年 | 702篇 |
2012年 | 505篇 |
2011年 | 516篇 |
2010年 | 416篇 |
2009年 | 493篇 |
2008年 | 494篇 |
2007年 | 620篇 |
2006年 | 610篇 |
2005年 | 517篇 |
2004年 | 460篇 |
2003年 | 394篇 |
2002年 | 417篇 |
2001年 | 316篇 |
2000年 | 299篇 |
1999年 | 250篇 |
1998年 | 209篇 |
1997年 | 204篇 |
1996年 | 166篇 |
1995年 | 136篇 |
1994年 | 121篇 |
1993年 | 117篇 |
1992年 | 104篇 |
1991年 | 84篇 |
1990年 | 77篇 |
1989年 | 76篇 |
1988年 | 46篇 |
1987年 | 35篇 |
1986年 | 33篇 |
1985年 | 25篇 |
1984年 | 11篇 |
1983年 | 4篇 |
1982年 | 11篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 8篇 |
1978年 | 8篇 |
1977年 | 10篇 |
1976年 | 5篇 |
1973年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
21.
1引言设A是n阶非负方阵.设矩阵方程(1)AXA=A,(2)XAX=X,(3)(AX)~T= AX,(4)(XA)~T=XA,(5)AX=XA.A具有非负广义逆是指存在非负方阵X满足方程(1)~(4),并记为A~(?).A具有非负群逆是指存在非负方阵X满足方程(1),(2),(5),并记为A~#.在A~(?)存在的前提下,两者相同的充分必要条件有(a)AA~(?)=A~(?)A;(b)A~(?)=p(A),其 相似文献
22.
本文主要解决奇异非光滑方程组的解法。应用一种新的次微分的外逆,我们提出了牛顿法和不精确牛顿法,它们的收敛性同时也得到了证明。这种方法能更容易在一引起实际应用中实现。这种方法可以看作是已存在的解非光滑方程组的方法的延伸。 相似文献
23.
24.
We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures. 相似文献
25.
We discuss the problem of transmitting polarized pulses along optical fibers with variable dispersion. The dissipation and mean dispersion are assumed to be zero, which allows using the model of the vector nonlinear Schrödinger equation. We consider an optical fiber consisting of arms of equal length, which is assumed to be large. We propose an asymptotic recursive procedure for calculating the amplitude and the phase of an optical pulse propagating along the optical cable with variable dispersion. 相似文献
26.
Investigation of the mean free path of projectile fragments produced in 16O-Em collision at 60 A GeV
下载免费PDF全文
![点击此处可从《中国物理》网站下载免费的PDF全文](/ch/ext_images/free.gif)
Results are presented for an investigation of the mean free path of projectile fragments with charge 3≤Z≤8, produced by 60 A GeV {}^{16}O in nuclear emulsion. No dependence of mean free path on the distance from the point of the fragment emission is observed and our result is consistent with the nonexistence of anomalons. 相似文献
27.
Miklós Csörgő 《Periodica Mathematica Hungarica》2005,50(1-2):1-27
Summary This article provides a glimpse of some of the highlights of the joint work of Endre Csáki and Pál Révész since 1979. The topics of this short exploration of the rich stochastic milieu of this inspiring collaboration revolve around Brownian motion, random walks and their long excursions, local times and additive functionals, iterated processes, almost sure local and global central limit theorems, integral functionals of geometric stochastic processes, favourite sites--favourite values and jump sizes for random walk and Brownian motion, random walking in a random scenery, and large void zones and occupation times for coalescing random walks. 相似文献
28.
29.
For a topological space X we denote by CL(X) the collection of all nonempty closed subsets of X. Suppose we have a map T which assigns in some coherent way to every topological space X some topology T(X) on CL(X). In this paper we study continuity and inverse continuity of the map iA,X :(CL(A),T{A)) → (CL(X),T(X)) defined by iA,x(F) = F whenever F ∈CL(A), for various assignment T; in particular, for locally finite topology, upper Kuratowski topology, and Attouch-Wets topology, etc. 相似文献
30.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献