全文获取类型
收费全文 | 3879篇 |
免费 | 663篇 |
国内免费 | 180篇 |
专业分类
化学 | 1136篇 |
晶体学 | 4篇 |
力学 | 509篇 |
综合类 | 65篇 |
数学 | 1598篇 |
物理学 | 1410篇 |
出版年
2024年 | 4篇 |
2023年 | 44篇 |
2022年 | 78篇 |
2021年 | 124篇 |
2020年 | 135篇 |
2019年 | 104篇 |
2018年 | 85篇 |
2017年 | 172篇 |
2016年 | 186篇 |
2015年 | 138篇 |
2014年 | 173篇 |
2013年 | 371篇 |
2012年 | 266篇 |
2011年 | 244篇 |
2010年 | 208篇 |
2009年 | 224篇 |
2008年 | 213篇 |
2007年 | 243篇 |
2006年 | 190篇 |
2005年 | 167篇 |
2004年 | 174篇 |
2003年 | 143篇 |
2002年 | 134篇 |
2001年 | 124篇 |
2000年 | 109篇 |
1999年 | 112篇 |
1998年 | 88篇 |
1997年 | 83篇 |
1996年 | 68篇 |
1995年 | 67篇 |
1994年 | 42篇 |
1993年 | 35篇 |
1992年 | 23篇 |
1991年 | 26篇 |
1990年 | 11篇 |
1989年 | 14篇 |
1988年 | 14篇 |
1987年 | 16篇 |
1986年 | 9篇 |
1985年 | 15篇 |
1984年 | 7篇 |
1983年 | 6篇 |
1982年 | 3篇 |
1981年 | 4篇 |
1980年 | 4篇 |
1979年 | 11篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1969年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有4722条查询结果,搜索用时 31 毫秒
31.
32.
We give a competitive algorithm to identify all d defective edges in a hypergraph with d unknown. Damaschke did the d=1 case for 2-graphs, Triesch extended the d=1 case to r-graphs, and Johann did the general d case for 2-graphs. So ours is the first attempt to solve the searching for defective edges problem in its full generality. Further, all the above three papers assumed d known. We give a competitive algorithm where d is unknown. 相似文献
33.
S. Juneja 《Queueing Systems》2007,57(2-3):115-127
Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems
in Monte-Carlo simulation. In the last few years, applied probabilists have achieved considerable success in developing efficient
algorithms for some such simple but fundamental tail probabilities. Usually, unbiased importance sampling estimators of such
tail probabilities are developed and it is proved that these estimators are asymptotically efficient or even possess the desirable
bounded relative error property. In this paper, as an illustration, we consider a simple tail probability involving geometric
sums of heavy tailed random variables. This is useful in estimating the probability of large delays in M/G/1 queues. In this setting we develop an unbiased estimator whose relative error decreases to zero asymptotically. The key
idea is to decompose the probability of interest into a known dominant component and an unknown small component. Simulation
then focuses on estimating the latter ‘residual’ probability. Here we show that the existing conditioning methods or importance
sampling methods are not effective in estimating the residual probability while an appropriate combination of the two estimates
it with bounded relative error. As a further illustration of the proposed ideas, we apply them to develop an estimator for
the probability of large delays in stochastic activity networks that has an asymptotically zero relative error.
相似文献
34.
The aim of this article is to derive stable generalized sampling in a shift-invariant space by using some special dual frames in L2(0,1). These sampling formulas involve samples of filtered versions of the functions in the shift-invariant space. The involved samples are expressed as the frame coefficients of an appropriate function in L2(0,1) with respect to some particular frame in L2(0,1). Since any shift-invariant space with stable generator is the image of L2(0,1) by means of a bounded invertible operator, our generalized sampling is derived from some dual frame expansions in L2(0,1). 相似文献
35.
It is proposed that continuous time is in effect discretized in the brain by dynamic pattern recognition mechanisms in neurons. Time discretization is required to support formal computations in continuous time systems consisting of a large number of components. The ability to perform formal computations is necessary if the system is to execute high level algorithms of the type used in present day artificial intelligence. The weakness of such algorithms is that they work efficiently only when the forms of patterns and objects presented to them are highly constrained. The dynamic mechanisms which discretize the brain's time line also serve to code patterns into constrained forms suitable for high level processing. 相似文献
36.
提出了一种应用于自适应PID控制器的神经网络与模糊控制相结合的算法,该算法可以有效地解决普通PID控制器依赖于对象的数学模型的缺点,可实现控制系统的在线自适应调整,可满足实时控制的要求。仿真结果表明,基于模糊神经网络整定的PID控制器具有较好的自学习和自适应性,具有较快的响应速度。 相似文献
37.
In this paper, we discuss the classical ill-posed problem of numerical differentiation, assuming that the smoothness of the function to be differentiated is unknown. Using recent results on adaptive regularization of general ill-posed problems, we propose new rules for the choice of the stepsize in the finite-difference methods, and for the regularization parameter choice in numerical differentiation regularized by the iterated Tikhonov method. These methods are shown to be effective for the differentiation of noisy functions, and the order-optimal convergence results for them are proved.
38.
利用傅里叶光学理论,证明了一种新型波面传感器——旋转软刀口波面传感器的概念.在经典刀口法的刀口区,以渐变透过率代替突变透过率函数,在光瞳象面上可获得反映光瞳面位置待测波面位相梯度及位相梯度方向的调制信号.文中给出了实验结果和讨论. 相似文献
39.
40.
针对不确定非线性生物系统—W illis环状脑动脉瘤系统,利用高斯型模糊逻辑系统的逼近能力及新构造的Lyapunov函数,基于模糊建模提出了一种自适应模糊控制器设计的新方案.该方案把逼近误差引入到控制器设计条件中用以改善系统的动态性能.不但设计简单还保证了控制方法的鲁棒性与稳定性.通过反向传播算法调整模糊基函数参数及递归最小二乘法调整参数向量,θ更新控制律,实现了理想跟踪.从理论上研究了脑动脉瘤内血流速度的非线性行为及控制,具有实际意义.仿真结果表明该控制方法的有效性. 相似文献