全文获取类型
收费全文 | 4528篇 |
免费 | 503篇 |
国内免费 | 236篇 |
专业分类
化学 | 24篇 |
晶体学 | 1篇 |
力学 | 50篇 |
综合类 | 48篇 |
数学 | 2182篇 |
物理学 | 375篇 |
无线电 | 2587篇 |
出版年
2024年 | 15篇 |
2023年 | 70篇 |
2022年 | 71篇 |
2021年 | 91篇 |
2020年 | 115篇 |
2019年 | 103篇 |
2018年 | 95篇 |
2017年 | 124篇 |
2016年 | 156篇 |
2015年 | 176篇 |
2014年 | 269篇 |
2013年 | 326篇 |
2012年 | 256篇 |
2011年 | 281篇 |
2010年 | 230篇 |
2009年 | 301篇 |
2008年 | 325篇 |
2007年 | 344篇 |
2006年 | 286篇 |
2005年 | 247篇 |
2004年 | 223篇 |
2003年 | 223篇 |
2002年 | 180篇 |
2001年 | 147篇 |
2000年 | 122篇 |
1999年 | 81篇 |
1998年 | 75篇 |
1997年 | 66篇 |
1996年 | 58篇 |
1995年 | 32篇 |
1994年 | 32篇 |
1993年 | 28篇 |
1992年 | 21篇 |
1991年 | 10篇 |
1990年 | 7篇 |
1989年 | 8篇 |
1988年 | 8篇 |
1987年 | 5篇 |
1986年 | 3篇 |
1985年 | 17篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 6篇 |
1981年 | 4篇 |
1980年 | 9篇 |
1979年 | 2篇 |
1978年 | 4篇 |
1977年 | 4篇 |
1976年 | 1篇 |
1936年 | 3篇 |
排序方式: 共有5267条查询结果,搜索用时 0 毫秒
1.
一种支持QoS的拓扑自适应动态组播路由算法 总被引:3,自引:0,他引:3
YAM、QoSMIC、DSDMR等一类支持QoS的动态组播路由算法允许组播成员动态地加入和离开,同时为接收方提供多个可选择的组播接入路径,以满足不同应用的QoS需求。但这些算法普遍存在控制信令开销大和结点加入时延长,可扩展性不好等问题。本文在分析这些算法的基础上,提出改进的支持QoS的动态组播路由算法,即拓扑自适应动态组播路由(Topology Adaptive Dynamic Multicast Routing,TADMR)算法。该算法避免了以往算法中大部分盲目的路径搜索,并使结点加入时延不再受限于固定的等待时钟,而与网络拓扑相自适应。性能分析和仿真结果表明,该算法具有较低的控制信令开销和结点加入时延,适用于各种网络规模和群组规模,具有良好的可扩展性。 相似文献
2.
设函数f(w)为凸区域D内的单叶解析函数,对于2≤n≤8和所有w∈D,本文得到估计式|f(n)(w)/f'(w)|的精确上界.这个结果推广了一些已知的结论. 相似文献
3.
令Ω1与Ω2与C^n中的两个有界齐性域,假设φ:1Ω→Ω2是一个全纯映射。在本中,我们研究相应的复合算子Cφ:β(Ω2)→β(Ω1)的有界性和紧性,特别地,我们讨论取B^n和U^n的情形。 相似文献
4.
Khalid KOUFANY 《数学学报(英文版)》2006,22(5):1467-1472
Let Ω be a symmetric cone. In this note, we introduce Hilbert's projective metric on Ω in terms of Jordan algebras and we apply it to prove that, given a linear invertible transformation g such that g(Ω) = Ω and a real number p, |p| 〉 1, there exists a unique element x ∈ Ω satisfying g(x) = x^p. 相似文献
5.
G. S. Asanov 《Foundations of Physics Letters》2002,15(2):199-207
Granted the post-Lorentzian relativistic kinematic transformations are described in the Finslerian framework, the uniformity between the actual light-velocity anisotropy change and the anisotropic deformation of measuring rods can be the reason proper for the null results of the Michelson-Morley-type experiments at the first-order level. 相似文献
6.
Keye Martin 《Applied Categorical Structures》2003,11(1):27-40
We introduce the triangle inequality for measurement. This is a property that when satisfied by a measurement enables one to construct a metric on the set of elements with measure zero that yields the relative Scott topology. The naturality of this construction permits a categorical solution to the model problem in domain theory for locally compact metric spaces. The first time such a solution has been achieved. 相似文献
7.
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. 相似文献
8.
A. J. Zaslavski 《Journal of Optimization Theory and Applications》2004,123(3):695-712
In our previous work, a generic well-posedness result (with respect to variations of the integrand of the integral functional) without the convexity condition was established for a class of optimal control problems satisfying the Cesari growth condition. In this paper, we extend this generic well-posedness result to classes of constrained variational problems in which the values at the endpoints and constraint maps are also subject to variations. 相似文献
9.
Rie Natsui 《Acta Mathematica Hungarica》2005,108(4):299-318
Summary Let Fq be a finite field with q elements. We consider formal Laurent series of Fq -coefficients with their continued fraction expansions by Fq -polynomials. We prove some arithmetic properties for almost every formal Laurent series with respect to the Haar measure. We construct a group extension of the non-archimedean continued fraction transformation and show its ergodicity. Then we get some results as an application of the individual ergodic theorem. We also discuss the convergence rate for limit behaviors. 相似文献
10.
该文利用算子半群的方法给出了取值于具有左不变度量的完备可分群的齐次Levy过程是复合Poisson过程的弱极限这一结论. 相似文献