全文获取类型
收费全文 | 1501篇 |
免费 | 187篇 |
国内免费 | 165篇 |
专业分类
化学 | 92篇 |
晶体学 | 1篇 |
力学 | 155篇 |
综合类 | 47篇 |
数学 | 1320篇 |
物理学 | 238篇 |
出版年
2024年 | 2篇 |
2023年 | 17篇 |
2022年 | 13篇 |
2021年 | 30篇 |
2020年 | 38篇 |
2019年 | 40篇 |
2018年 | 39篇 |
2017年 | 36篇 |
2016年 | 47篇 |
2015年 | 35篇 |
2014年 | 60篇 |
2013年 | 79篇 |
2012年 | 67篇 |
2011年 | 74篇 |
2010年 | 69篇 |
2009年 | 84篇 |
2008年 | 106篇 |
2007年 | 92篇 |
2006年 | 108篇 |
2005年 | 79篇 |
2004年 | 65篇 |
2003年 | 74篇 |
2002年 | 77篇 |
2001年 | 70篇 |
2000年 | 66篇 |
1999年 | 66篇 |
1998年 | 58篇 |
1997年 | 42篇 |
1996年 | 41篇 |
1995年 | 31篇 |
1994年 | 16篇 |
1993年 | 10篇 |
1992年 | 15篇 |
1991年 | 19篇 |
1990年 | 10篇 |
1989年 | 11篇 |
1988年 | 4篇 |
1987年 | 3篇 |
1986年 | 6篇 |
1985年 | 13篇 |
1984年 | 7篇 |
1983年 | 5篇 |
1982年 | 7篇 |
1981年 | 4篇 |
1980年 | 4篇 |
1979年 | 6篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1970年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有1853条查询结果,搜索用时 31 毫秒
21.
研究了条件泛函及其导数的非参数估计,对随机与固定设计的条件泛函,分别利用核估计和非参数加权估计,在核函数及权函数满足一定条件下,证明了估计一致强收敛于待估函数的速度可达到最优。从而进一步推广和发展了Hrdle,etal.(1988)、Severini,etal.(1992)的许多结果。 相似文献
22.
多目标最优化的一种积分型实现算法 总被引:2,自引:1,他引:1
在文[1]中给出了求解多目标最优化的一种积分总极值的概念性算法.本文利用数论中的一致分布佳点集列,较为简便的得出了多目标最优化的积分总极值的实现算法和算法终止准则.并经过有关函数数值计算表明该算法是有效的,可用来求解多目标最优化问题的有效解. 相似文献
23.
得到局部G-凸一致空间上具有S-KKM性质的集值映射的新的几乎不动点定理和不动点定理.我们的结果对已有文献中的相应结论进行了改进和一般化. 相似文献
24.
全变差有界函数列的一致(R)可积性 总被引:4,自引:0,他引:4
给出了一致有界单调函数列一致可积性定理 ,由此得出全变差序列有界的收敛函数列的一致可积性 .说明了该结论可判断一些非一致收敛函数列的逐项积分性质 . 相似文献
25.
Siaw-Lynn Ng 《Designs, Codes and Cryptography》2003,30(1):5-19
Deciding whether a matroid is secret sharing or not is a well-known open problem. In Ng and Walker [6] it was shown that a matroid decomposes into uniform matroids under strong connectivity. The question then becomes as follows: when is a matroid m with N uniform components secret sharing? When N = 1, m corresponds to a uniform matroid and hence is secret sharing. In this paper we show, by constructing a representation using projective geometry, that all connected matroids with two uniform components are secret sharing 相似文献
26.
Vern I. Paulsen Dinesh Singh 《Proceedings of the American Mathematical Society》2004,132(12):3577-3579
We prove a uniform algebra analogue of a classical inequality of Bohr's concerning Fourier coefficients of bounded holomorphic functions. The classical inequality follows trivially.
27.
We first state a uniform convergence theorem for finite-part integrals which are derivatives of weighted Cauchy principal value integrals. We then give a two-stage process to modify approximating splines and optimal nodal splines in such a way that the conditions of this theorem are satisfied. Consequently, these modified splines can be used in the numerical evaluation of these finite-part integrals. 相似文献
28.
SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS (PART I:EQUAL TIMES AND COSTS) 总被引:1,自引:0,他引:1
Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O(n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented. 相似文献
29.
Dong Sheng WU Yi Min XIAO 《数学学报(英文版)》2007,23(4):613-622
Let B^α = {B^α(t),t E R^N} be an (N,d)-fractional Brownian motion with Hurst index α∈ (0, 1). By applying the strong local nondeterminism of B^α, we prove certain forms of uniform Hausdorff dimension results for the images of B^α when N 〉 αd. Our results extend those of Kaufman for one-dimensional Brownian motion. 相似文献
30.
Pierre L'Ecuyer 《Annals of Operations Research》1994,53(1):77-120
In typical stochastic simulations, randomness is produced by generating a sequence of independent uniform variates (usually real-valued between 0 and 1, or integer-valued in some interval) and transforming them in an appropriate way. In this paper, we examine practical ways of generating (deterministic approximations to) such uniform variates on a computer. We compare them in terms of ease of implementation, efficiency, theoretical support, and statistical robustness. We look in particular at several classes of generators, such as linear congruential, multiple recursive, digital multistep, Tausworthe, lagged-Fibonacci, generalized feedback shift register, matrix, linear congruential over fields of formal series, and combined generators, and show how all of them can be analyzed in terms of their lattice structure. We also mention other classes of generators, like non-linear generators, discuss other kinds of theoretical and empirical statistical tests, and give a bibliographic survey of recent papers on the subject. 相似文献