全文获取类型
收费全文 | 15201篇 |
免费 | 2458篇 |
国内免费 | 783篇 |
专业分类
化学 | 1498篇 |
晶体学 | 164篇 |
力学 | 2328篇 |
综合类 | 172篇 |
数学 | 5137篇 |
物理学 | 9143篇 |
出版年
2024年 | 25篇 |
2023年 | 99篇 |
2022年 | 193篇 |
2021年 | 231篇 |
2020年 | 329篇 |
2019年 | 256篇 |
2018年 | 258篇 |
2017年 | 456篇 |
2016年 | 505篇 |
2015年 | 360篇 |
2014年 | 756篇 |
2013年 | 913篇 |
2012年 | 889篇 |
2011年 | 896篇 |
2010年 | 726篇 |
2009年 | 871篇 |
2008年 | 1058篇 |
2007年 | 1161篇 |
2006年 | 1063篇 |
2005年 | 957篇 |
2004年 | 809篇 |
2003年 | 833篇 |
2002年 | 613篇 |
2001年 | 573篇 |
2000年 | 507篇 |
1999年 | 477篇 |
1998年 | 381篇 |
1997年 | 347篇 |
1996年 | 244篇 |
1995年 | 215篇 |
1994年 | 183篇 |
1993年 | 178篇 |
1992年 | 144篇 |
1991年 | 114篇 |
1990年 | 108篇 |
1989年 | 64篇 |
1988年 | 68篇 |
1987年 | 65篇 |
1986年 | 58篇 |
1985年 | 75篇 |
1984年 | 61篇 |
1983年 | 35篇 |
1982年 | 43篇 |
1981年 | 47篇 |
1980年 | 27篇 |
1979年 | 34篇 |
1978年 | 42篇 |
1977年 | 32篇 |
1976年 | 21篇 |
1971年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
121.
LiNbO3∶Cr∶Cu晶体吸收特性及非挥发全息存储研究 总被引:1,自引:1,他引:0
研究了LiNbO3∶Cr∶Cu晶体的吸收特性,发现LiNbO3∶Cr∶Cu(含0.14 wt.% Cr2O3 和 0.011 wt.% CuO)晶体存在两个明显的吸收峰,中心波长分别位于480 nm和660 nm; 随着Cr的含量逐渐减小,Cu的含量逐渐增大,短波段不存在明显吸收峰,掺Cr的含量越大,中心波长在660 nm处的吸收越大;633 nm红光虽然位于中心波长为660 nm的吸收峰内,但它无助于光折变过程.分别采用390 nm紫外光和488 nm蓝光作为敏化光,514 nm绿光作为记录光的记录方案,实现了非挥发全息记录,掺入适量的Cr( 比如NCr=2.795×1025 m-3,NCr/ NCu=1)有助于全息记录性能的提高. 相似文献
122.
A family of skew Hadamard difference sets 总被引:1,自引:0,他引:1
Cunsheng Ding 《Journal of Combinatorial Theory, Series A》2006,113(7):1526-1535
In 1933 a family of skew Hadamard difference sets was described by Paley using matrix language and was called the Paley-Hadamard difference sets in the literature. During the last 70 years, no new skew Hadamard difference sets were found. It was conjectured that there are no further examples of skew Hadamard difference sets. This conjecture was proved to be true for the cyclic case in 1954, and further progress in favor of this conjecture was made in the past 50 years. However, the conjecture remains open until today. In this paper, we present a family of new perfect nonlinear (also called planar) functions, and construct a family of skew Hadamard difference sets using these perfect nonlinear functions. We show that some of the skew Hadamard difference sets presented in this paper are inequivalent to the Paley-Hadamard difference sets. These new examples of skew Hadamard difference sets discovered 70 years after the Paley construction disprove the longstanding conjecture on skew Hadamard difference sets. The class of new perfect nonlinear functions has applications in cryptography, coding theory, and combinatorics. 相似文献
123.
非对称三态叠加多模泛函叠加态光场的高次压缩——广义电场分量的不等幂次和压缩效应研究 总被引:2,自引:0,他引:2
多模真空态|{0j}〉q与两个空间强度分布特征不同的多模复共轭泛函相干态|{f(j a)*(x,y,z)}〉q和|{f(j b)*(x,y,z)}〉q的线性叠加组成的三态叠加多模泛函叠加态光场|ψ(f3)〉q,利用多模压缩态理论,研究了态|ψ(f3)〉q中广义电场分量的不等幂次高次和(H)压缩特性.结果表明:在一定的条件下,态|ψ(f3)〉q的广义电场分量可呈现出周期性变化的任意奇数次和任意偶数次的不等幂次高次H压缩效应;光场的经典振幅和经典初始相位的任意非对称空间分布特征对其压缩程度和压缩深度等压缩特性将产生直接的影响. 相似文献
124.
自由曲面光学产品设计、制造与检测的工艺流程,通常采取试凑法逐次逼近。由于加工 检测 再加工,循环往复,既费时,成本又高,产生了瓶颈问题。为了解决此弊端,本文运用虚拟制造技术,提出光学虚拟制造的基本构想,即虚拟制造系统结构模型,给出光学系统虚拟原型的构成和光学系统成像质量虚拟检测系统的构成,讨论光学成像质量的仿真检测以及敏度分析方法。研究结果表明:运用虚拟制造与检测技术,可缩短研发周期,降低成本,优化工艺并提高产品质量。 相似文献
125.
本文我们给出一个修正的非线性扩散方程模型,与Cotte Lions和Morel的模型相比该模型有许多实质上的优点。主要的想法是把原来去噪声部分:卷积Gauss过程替代为解一个有界区域上的线性抛物方程问题,因此避开了对初始数值如何全平面延拓的问题。我们从数学上的证明该问题解的存在性和适定性,同时给出对矩形域情况的解的级数形式。最后我们给基于本模型的数值计算差分模型,并且给出几个具体图像在该模型下处理结果。 相似文献
126.
在backstepping程序中,把非线性自适应控制和鲁棒控制连接起来,为参数化的严格反馈系统在不确定性存在的情况下,建立了一种鲁棒自适应控制方案.非线性自适应控制被用来处理系统的线性参数化部分,而鲁棒控制通过引进非线性阻尼项被用来处理不确定性部分.与现有的方案不同,作者给出了非线性阻尼项的无限种选择,而不是仅仅一种选择.通过使用一种合适的选择,能够设计一个鲁棒自适应控制器.它不仅能够保证对不确定性的鲁棒性,而且能够使输出误差任意小,以及用较小的控制努力取得较好的性能. 相似文献
127.
128.
Jinyan Fan 《Computational Optimization and Applications》2006,34(2):215-227
In this paper, we present the new trust region method for nonlinear equations with the trust region converging to zero. The
new method preserves the global convergence of the traditional trust region methods in which the trust region radius will
be larger than a positive constant. We study the convergence rate of the new method under the local error bound condition
which is weaker than the nonsingularity. An example given by Y.X. Yuan shows that the convergence rate can not be quadratic.
Finally, some numerical results are given.
This work is supported by Chinese NSFC grants 10401023 and 10371076, Research Grants for Young Teachers of Shanghai Jiao Tong
University, and E-Institute of Computational Sciences of Shanghai Universities.
An erratum to this article is available at . 相似文献
129.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献
130.