全文获取类型
收费全文 | 3459篇 |
免费 | 139篇 |
国内免费 | 184篇 |
专业分类
化学 | 653篇 |
晶体学 | 30篇 |
力学 | 179篇 |
综合类 | 11篇 |
数学 | 1982篇 |
物理学 | 927篇 |
出版年
2024年 | 6篇 |
2023年 | 26篇 |
2022年 | 71篇 |
2021年 | 46篇 |
2020年 | 89篇 |
2019年 | 92篇 |
2018年 | 97篇 |
2017年 | 81篇 |
2016年 | 78篇 |
2015年 | 53篇 |
2014年 | 172篇 |
2013年 | 292篇 |
2012年 | 128篇 |
2011年 | 188篇 |
2010年 | 169篇 |
2009年 | 237篇 |
2008年 | 263篇 |
2007年 | 237篇 |
2006年 | 163篇 |
2005年 | 120篇 |
2004年 | 115篇 |
2003年 | 110篇 |
2002年 | 96篇 |
2001年 | 68篇 |
2000年 | 75篇 |
1999年 | 58篇 |
1998年 | 76篇 |
1997年 | 66篇 |
1996年 | 62篇 |
1995年 | 48篇 |
1994年 | 40篇 |
1993年 | 32篇 |
1992年 | 40篇 |
1991年 | 29篇 |
1990年 | 17篇 |
1989年 | 38篇 |
1988年 | 27篇 |
1987年 | 20篇 |
1986年 | 16篇 |
1985年 | 15篇 |
1984年 | 27篇 |
1983年 | 16篇 |
1982年 | 16篇 |
1981年 | 14篇 |
1980年 | 8篇 |
1979年 | 11篇 |
1978年 | 9篇 |
1977年 | 8篇 |
1976年 | 9篇 |
1974年 | 3篇 |
排序方式: 共有3782条查询结果,搜索用时 15 毫秒
1.
2.
Lu Chuanrong 《数学年刊B辑(英文版)》1997,18(1):71-78
Let $\{\xi_{\bold t}, {\bold t}
\in {\bold Z}^d\}$ be a nonuniform $\varphi$-mixing strictly stationary
real random field with
$E\xi_{\bold 0}=0, E|\xi_{\bold 0}|^{2+\delta}<\infty$ for some
$0<\delta<1$. A sufficient
condition is given for the sequence of partial sum set-indexed process
$\{Z_n(A),\ A\in \Cal A\}$ to converge to Brownian motion. By a direct
calculation, the author shows
that the result holds for a more general class of set index ${\Cal A}$, where
${\Cal A}$ is assumed only to have the metric entropy exponent $r, 0相似文献
3.
超尺寸物品装箱问题及其算法 总被引:3,自引:0,他引:3
本文探讨一类新装箱问题-超尺寸物品装箱问题。针对实际解决该问题的两涉法,我们提出了一个评价效率更高的目标函数,证明了在此目标函数下两步法的渐近最坏比不小于2,并给出了渐近量坏比与拆分次数的关系。最后本文提出了一种不同于两步法的新在线算法MA,证明了在新目标函数下其渐近最坏比不超过7/4。 相似文献
4.
5.
On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes 总被引:1,自引:0,他引:1
It is well known that the complexity, i.e. the number of vertices, edges and faces, of the 3-dimensional Voronoi diagram of n points can be as bad as Θ(n2). It is also known that if the points are chosen Independently Identically Distributed uniformly from a 3-dimensional region such as a cube or sphere, then the expected complexity falls to O(n). In this paper we introduce the problem of analyzing what occurs if the points are chosen from a 2-dimensional region in 3-dimensional space. As an example, we examine the situation when the points are drawn from a Poisson distribution with rate n on the surface of a convex polytope. We prove that, in this case, the expected complexity of the resulting Voronoi diagram is O(n). 相似文献
6.
Random copolymers of poly{(methacrylamide)-co-(vinyl trimethoxysilane)} and poly{(methacrylic acid)-co-(vinyl trimethoxysilane)} were synthesized via a free radical polymerization reaction. Acid catalyzed sol-gel process of tetraethylorthosilicate (TEOS) with aforementioned polymers in the presence of methyl xanthine class of alkaloid like caffeine resulted in the formation of highly transparent monoliths. Solvent extraction of the template leaves behind the recognition sites intact with high selectivity towards the print molecule. The ionic and non-specific adsorptions, which are considered to be the main disadvantages of the molecularly imprinted polymers (MIP), are prevented to a considerable extent by the end capping of surface silanol groups. The template binding efficiencies of MIP were determined by HPLC analysis. 相似文献
7.
Alvim Adriana C.F. Ribeiro Celso C. Glover Fred Aloise Dario J. 《Journal of Heuristics》2004,10(2):205-229
We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms. 相似文献
8.
YIN JIANXING 《高校应用数学学报(英文版)》1994,(4)
PACKINGPAIRSBYQUINTUPLES:THECASEOFZEROCONGRUENCEMOD4YINJIANXINGAbstract:LetD(v)denotethemaximumnumberofquintuplesofav-setofpo... 相似文献
9.
Poisson回归模型广泛应用于分析计数型数据 ,Dean&Lawless(1989)和Dean(1992 )讨论了非重复测量得到的计数型数据的偏大离差存在性的检验问题 .本文分别利用随机系数模型和对数非线性模型讨论了基于重复测量得到的计数型数据的偏大离差的检验问题 ,得到了检验的score统计量 . 相似文献
10.
Dmitry I. Belov Ronald D. Armstrong 《Computational Optimization and Applications》2006,33(2-3):319-332
This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection
of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems
(MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate
lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including
combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented.
An erratum to this article is available at . 相似文献