全文获取类型
收费全文 | 1645篇 |
免费 | 101篇 |
国内免费 | 164篇 |
专业分类
化学 | 86篇 |
力学 | 73篇 |
综合类 | 44篇 |
数学 | 1487篇 |
物理学 | 220篇 |
出版年
2024年 | 3篇 |
2023年 | 17篇 |
2022年 | 25篇 |
2021年 | 17篇 |
2020年 | 42篇 |
2019年 | 37篇 |
2018年 | 33篇 |
2017年 | 46篇 |
2016年 | 48篇 |
2015年 | 23篇 |
2014年 | 71篇 |
2013年 | 136篇 |
2012年 | 58篇 |
2011年 | 91篇 |
2010年 | 69篇 |
2009年 | 98篇 |
2008年 | 104篇 |
2007年 | 129篇 |
2006年 | 109篇 |
2005年 | 91篇 |
2004年 | 71篇 |
2003年 | 68篇 |
2002年 | 78篇 |
2001年 | 67篇 |
2000年 | 60篇 |
1999年 | 57篇 |
1998年 | 50篇 |
1997年 | 27篇 |
1996年 | 22篇 |
1995年 | 19篇 |
1994年 | 15篇 |
1993年 | 15篇 |
1992年 | 15篇 |
1991年 | 12篇 |
1990年 | 7篇 |
1989年 | 4篇 |
1988年 | 5篇 |
1987年 | 8篇 |
1986年 | 1篇 |
1985年 | 7篇 |
1984年 | 9篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 9篇 |
1978年 | 6篇 |
1977年 | 8篇 |
1970年 | 2篇 |
1959年 | 1篇 |
排序方式: 共有1910条查询结果,搜索用时 812 毫秒
191.
One of the main drawbacks of the subgradient method is the tuning process to determine the sequence of steplengths. In this paper, the radar subgradient method, a heuristic method designed to compute a tuning-free subgradient steplength, is geometrically motivated and algebraically deduced. The unit commitment problem, which arises in the electrical engineering field, is used to compare the performance of the subgradient method with the new radar subgradient method.Communicated by M. SimaanThis research was supported by the Spanish Government, CICYT Grant TAP99-1075-C02-01. We acknowledge the technical support from Logilab (HEC, University of Geneva) and especially the valuable remarks and suggestions of the referees. 相似文献
192.
向量值L^p空间上的算子值傅里叶乘子由于L.Weis在2000年的重要工作而成为泛函分析的热点之一,其对R-有界性创造性的应用使这个领域的研究耳目一新,新的结果层出不穷.本文的目的是介绍算子值傅里叶乘子的这些最新进展,以及它们在向量值边值问题最大正则性方面的应用.包括N.J.Kalton和G.Lancien给出的关于L^p-最大正则性的反例.Besov空间和Triebel空间上的算子值傅里叶乘子以及在Besov空问和Triebel空间意义下的最大正则性也是我们要介绍的内容. 相似文献
193.
设(Ω,,P)是概率空间,B是Banach空间.本文引入了一类新的鞅型序列──(B值)拟终鞅型序列,并研究了它们的收敛性与Banach空间的Radon-Nikodym性,一致光滑性和UMD性的依赖关系. 相似文献
194.
P. A. Stubberud E. Awad J. W. Adams C. T. Leondes 《Journal of Optimization Theory and Applications》1993,79(2):253-272
Many digital signal processing applications require linear phase filtering. For applications that require narrow-band linear phase filtering, frequency sampling filters can implement linear phase filters more efficiently than the commonly used direct convolution filter. In this paper, a technique is developed for designing linear phase frequency sampling filters. A frequency sampling filter approximates a desired frequency response by interpolating a frequency response through a set of frequency samples taken from the desired frequency response. Although the frequency response of a frequency sampling filter passes through the frequency samples, the frequency response may not be well behaved between the specific samples. Linear programming is commonly used to control the interpolation errors between frequency samples. The design method developed in this paper controls the interpolation errors between frequency samples by minimizing the mean square error between the desired and actual frequency responses in the stopband and passband. This design method describes the frequency sampling filter design problem as a constrained optimization problem which is solved using the Lagrange multiplier optimization method. This results in a set of linear equations which when solved determine the filter's coefficients.This work was partially funded by The National Supercomputing Center for Energy and the Environment, University of Nevada Las Vegas, Las Vegas, Nevada and by NSF Grant MIP-9200581. 相似文献
195.
E. De Pascale L. De Pascale 《Proceedings of the American Mathematical Society》2002,130(11):3249-3254
The use of K-normed spaces gives us the possibility to prove that a fixed point theorem due to B. Luo is equivalent to the Banach Contraction Principle. This confirms the conspiracy among fixed point theorems. Moreover the theorem of Lou is improved and extended to different contexts. A counterexample about the fixed points of the sum of a contraction and an integral operator is given. The usefulness of K-norm is tested on a Volterra integral equation as well.
196.
对有规范条件或约束的非线性理论,研究了其驻点的Hessian形式.指出了规范场的经典解的稳定性由包含拉格朗日乘子贡献的有效拉氏量的二阶变分决定. 相似文献
197.
利用剖面隐马氏模型获得多序列联配,一般需要经过初始化、训练、联配三个过程.然而,目前广泛采用的Baum—welch训练算法假设各条可观察序列互相独立,这与实际情况有所不符.本文对剖面隐马氏模型,给出可观察序列在互相不独立情况下的改进Baum—wlelch算法,在可观察序列两种特殊情况下(互相独立和一致依赖),得到了改进算法的具体表达式,讨论了一般情况下权重的选取方法.最后通过一个具体的蛋白质家族的多序列联配来说明改进算法的效果. 相似文献
198.
Simon R. Blackburn 《Discrete Mathematics》2006,306(12):1126-1131
We obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequences over arbitrary finite rings. 相似文献
199.
We study the limit behavior of the canonical (i.e., degenerate) von Mises statistics based on samples from a sequence of weakly dependent stationary observations satisfying the ψ-mixing condition. The corresponding limit distributions are defined by the multiple stochastic integrals of nonrandom functions with respect to the nonorthogonal Hilbert noises generated by Gaussian processes with nonorthogonal increments. 相似文献
200.
R. Craigen 《Journal of Combinatorial Theory, Series A》2006,113(6):952-965
In [R. Craigen, C. Koukouvinos, A theory of ternary complementary pairs, J. Combin. Theory Ser. A 96 (2001) 358-375], we proposed a systematic approach to the theory of ternary complementary pairs (TCPs) and showed how all pairs known then could be constructed using a single elementary product, the natural equivalence relations, and a handful of pairs which we called primitive. We also introduced more new primitive pairs than could be inferred previously, concluding with some conjectures reflecting the patterns that were beginning to arise in light of the new approach.In this paper we take what appears to be the natural next step, by investigating these patterns among those lengths and weights that are within easy computational distance from the last length considered therein, length 14. We give complete results up to length 21, and partial results up to length 28. (Ironically, although we proceed analytically by weight first then length, for computational reasons we are bound, in this empirical investigation, to proceed according to length first.)Thus we provide support for the previous conjectures, and shed enough new light to speculate further as to the likely ultimate shape of the theory. Since short term work on TCPs will require massive acquisition of data about small pairs, we also discuss affixes—a computational strategy that arose out of the investigations culminating in this article. 相似文献