全文获取类型
收费全文 | 784155篇 |
免费 | 17574篇 |
国内免费 | 9049篇 |
专业分类
化学 | 416290篇 |
晶体学 | 10540篇 |
力学 | 38365篇 |
综合类 | 531篇 |
数学 | 115699篇 |
物理学 | 229353篇 |
出版年
2022年 | 5932篇 |
2021年 | 7377篇 |
2020年 | 8005篇 |
2019年 | 8253篇 |
2018年 | 18255篇 |
2017年 | 17724篇 |
2016年 | 19542篇 |
2015年 | 11461篇 |
2014年 | 15311篇 |
2013年 | 34962篇 |
2012年 | 31416篇 |
2011年 | 42501篇 |
2010年 | 27606篇 |
2009年 | 27552篇 |
2008年 | 35055篇 |
2007年 | 36627篇 |
2006年 | 27678篇 |
2005年 | 25822篇 |
2004年 | 23699篇 |
2003年 | 21307篇 |
2002年 | 19860篇 |
2001年 | 20906篇 |
2000年 | 16315篇 |
1999年 | 13352篇 |
1998年 | 11122篇 |
1997年 | 10597篇 |
1996年 | 10649篇 |
1995年 | 9516篇 |
1994年 | 9193篇 |
1993年 | 8784篇 |
1992年 | 9618篇 |
1991年 | 9444篇 |
1990年 | 8930篇 |
1989年 | 8624篇 |
1988年 | 8641篇 |
1987年 | 8362篇 |
1986年 | 7977篇 |
1985年 | 10610篇 |
1984年 | 10712篇 |
1983年 | 8670篇 |
1982年 | 9030篇 |
1981年 | 8993篇 |
1980年 | 8487篇 |
1979年 | 8913篇 |
1978年 | 9046篇 |
1977年 | 8993篇 |
1976年 | 8837篇 |
1975年 | 8392篇 |
1974年 | 8233篇 |
1973年 | 8410篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
141.
A stochastic approximation algorithm for estimating multichannel coefficients is proposed, and the estimate is proved to converge to the true parameters a.s. up-to a constant scaling factor. The estimate is updated after receiving each new observation, so the output data need not be collected in advance. The input signal is allowed to be dependent and the observation is allowed to be corrupted by noise, but no noise statistics are used in the estimation algorithm. 相似文献
142.
J.J. Pan Xiangdong Qiu Kejian Guan Liang Dong FengQing Zhou Wei Wang Mingjie Zhang James Guo Jun Yang Chunmeng Wu 《光学学报》2003,23(Z1)
A low cost, coolerless 980nm diode pumped, gain flattened L band EDFA with fast transient control, high pump efficiency and gain clamping effect was realized by using FBGs as C band seed generators. 相似文献
143.
C Guéret N Jussien O Lhomme C Pavageau C Prins 《The Journal of the Operational Research Society》2003,54(5):458-465
In this paper, we describe an aircraft loading problem submitted by the French military agency (DGA) as part of a more general military airlift planning problem. It can be viewed as a kind of bi-dimensional bin-packing problem, with heterogeneous bins and several additional constraints. We introduce two-phase methods for solving this NP-hard problem. The first phase consists in building good initial solutions, thanks to two fast algorithms: a list-based heuristic and a loading pattern generation method. Both algorithms call a constraint-based subroutine, able to determine quickly if the items already loaded can be reshuffled to accommodate a new object. The second phase improves these preliminary solutions using local search techniques. Results obtained on real data sets are presented. 相似文献
144.
YaoKui ChenZhixiang 《分析论及其应用》2003,19(2):115-120
This paper gives the weighted Lp convergence rate estimations of the Gruenwald interpolatory polynomials based on the zeros of Chebyshev polymomials of the first kind,and proves that the order of the estimations is optimal for p≥1. 相似文献
145.
You‐Liang Zhao Chuan‐Fu Chen Fu Xi 《Journal of polymer science. Part A, Polymer chemistry》2003,41(14):2156-2165
The atom transfer radical copolymerization of N‐substituted maleimides such as N‐phenylmaleimide (PhMI), N‐cyclohexylmaleimide (ChMI), and N‐butylmaleimide (NBMI) with styrene initiated with dendritic polyarylether 2‐bromoisobutyrates in an ionic liquid, 1‐butyl‐3‐methylimidazolium hexafluorophosphate ([bmim][PF6]), at room temperature and anisole at 110 °C was investigated. The dendritic‐linear block copolymers obtained in ionic liquid possessed well‐defined molecular weight and low polydispersity (1.05 < Mw/Mn < 1.32) and could be used as a macroinitiator for chain‐extension polymerization, suggesting the living nature of the reaction system. The ionic liquids containing catalyst could be recycled in the atom transfer radical polymerization systems without further treatment. Compared with polymerization conducted in anisole, the polymerization in ionic liquid had a stronger tendency for alternation. The tendency for alternation decreased in the order PhMI > NBMI > ChMI in [bmim][PF6] and PhMI > ChMI > NBMI in anisole. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 2156–2165, 2003 相似文献
146.
Howard Robinson 《Acta Analytica》2005,20(3):7-10
Nicholas Nathan tries to resist the current version of the causal argument for sense-data in two ways. First he suggests that,
on what he considers to be the correct re-construction of the argument, it equivocates on the sense of proximate cause. Second
he defends a form of disjunctivism, by claiming that there might be an extra mechanism involved in producing veridical hallucination,
that is not present in perception. I argue that Nathan’s reconstruction of the argument is not the appropriate one, and that,
properly interpreted, the argument does not equivocate on proximate cause. Furthermore, I claim that his postulation of a
modified mechanism for hallucinations is implausibly ad hoc. 相似文献
147.
148.
J. Berkemeier T. Dirksmeyer G. Klempt H. G. Purwins 《Zeitschrift für Physik B Condensed Matter》1986,65(2):255-258
It is observed experimentally that a periodic array of resistively coupled LC-oscillators with ans-shaped nonlinearity exhibits stable non-uniform voltage and current distributions. The dependence of the resulting structure on the coupling resistance and the boundary conditions is investigated. The structure is rather insensitive to variations of the boundary values. The experiments are well described by a two-variable reaction-diffusion equation. 相似文献
149.
Shirin J. Handjani 《Journal of Theoretical Probability》2003,16(2):325-338
We establish conditions for survival and extinction of types of one-dimensional voter models, and show that increasing the flip rates at a finite number of sites typically does not affect survival, unless the flipping mechanism is altered. We provide an example of a modified voter model that does not survive but can be made to survive simply by altering the flip mechanism at one site. We also show that a rather general class of such models have clustering behavior. 相似文献
150.
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. 相似文献