全文获取类型
收费全文 | 11399篇 |
免费 | 829篇 |
国内免费 | 822篇 |
专业分类
化学 | 812篇 |
晶体学 | 26篇 |
力学 | 796篇 |
综合类 | 103篇 |
数学 | 4774篇 |
物理学 | 1249篇 |
综合类 | 5290篇 |
出版年
2025年 | 41篇 |
2024年 | 103篇 |
2023年 | 153篇 |
2022年 | 206篇 |
2021年 | 227篇 |
2020年 | 298篇 |
2019年 | 268篇 |
2018年 | 243篇 |
2017年 | 276篇 |
2016年 | 263篇 |
2015年 | 287篇 |
2014年 | 415篇 |
2013年 | 670篇 |
2012年 | 573篇 |
2011年 | 606篇 |
2010年 | 514篇 |
2009年 | 736篇 |
2008年 | 685篇 |
2007年 | 779篇 |
2006年 | 683篇 |
2005年 | 637篇 |
2004年 | 535篇 |
2003年 | 475篇 |
2002年 | 445篇 |
2001年 | 343篇 |
2000年 | 368篇 |
1999年 | 343篇 |
1998年 | 334篇 |
1997年 | 271篇 |
1996年 | 205篇 |
1995年 | 156篇 |
1994年 | 136篇 |
1993年 | 121篇 |
1992年 | 123篇 |
1991年 | 112篇 |
1990年 | 83篇 |
1989年 | 84篇 |
1988年 | 63篇 |
1987年 | 51篇 |
1986年 | 32篇 |
1985年 | 15篇 |
1984年 | 20篇 |
1983年 | 5篇 |
1982年 | 11篇 |
1981年 | 11篇 |
1980年 | 10篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1974年 | 3篇 |
1972年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
161.
Dimitris Karlis Evdokia Xekalaki 《Annals of the Institute of Statistical Mathematics》1999,51(1):149-162
Poisson mixtures are usually used to describe overdispersed data. Finite Poisson mixtures are used in many practical situations where often it is of interest to determine the number of components in the mixture. Identifying how many components comprise a mixture remains a difficult problem. The likelihood ratio test (LRT) is a general statistical procedure to use. Unfortunately, a number of specific problems arise and the classical theory fails to hold. In this paper a new procedure is proposed that is based on testing whether a new component can be added to a finite Poisson mixture which eventually leads to the number of components in the mixture. It is a sequential testing procedure based on the well known LRT that utilises a resampling technique to construct the distribution of the test statistic. The application of the procedure to real data reveals some interesting features of the distribution of the test statistic. 相似文献
162.
163.
1.引言 近年来,一类新的非重叠区域分解方法一非匹配网格区域分解法,日益引起人们的广泛兴趣,并已成为当今区域分解方法研究的热门课题。这类区域分解方法的特点是:相邻子区域在公共边(或面)上的结点可以不重合,从而能解决许多传统区域分解方法不便解决的问题(如变动网格问题).目前主要有两类方法来处理这种区域分解的强非协调性:Mortar无法(见[1-2]和[9-10])和拉格朗日乘子法(见[5],[8],[11]和[12]).拉格朗日乘子法比Mortar无法有明显的优点:(1)界面变量(即拉格朗日乘子)… 相似文献
164.
The crosscap number of a knot in the 3-sphere is defined as the minimal first Betti number of non-orientable surfaces bounded by the knot. In this paper, we determine the crosscap numbers of a large class of pretzel knots. The key ingredient to obtain the result is the algorithm of enumerating all essential surfaces for Montesinos knots developed by Hatcher and Oertel. 相似文献
165.
PENG ChiaKuei 《中国科学 数学(英文版)》2010,(1)
Let M be a closed oriented surface immersed in R4 . Associated it one has the generalized Gauss map from M into the Grassmann manifold G 4,2 . This note will be concerned with the geometry of the generalized Gauss map by using the moving frame theory and the quaternion interpretation of Plcker coordinates. As one of consequences,we get the celebrated theorem of Chern and Spanier,Hoffman and Osserman,who proved it by quite different methods. At last,we give an explicit construction of a series of immersions of S2 in R4 with any given normal Euler number. 相似文献
166.
167.
For every k and r, we construct a finite family of axis-parallel rectangles in the plane such that no matter how we color them with k colors, there exists a point covered by precisely r members of the family, all of which have the same color. For r=2, this answers a question of S. Smorodinsky [S. Smorodinsky, On the chromatic number of some geometric hypergraphs, SIAM J. Discrete Math. 21 (2007) 676-687]. 相似文献
168.
A.S. Bonnet-Ben Dhia J.F. Mercier S. Pernet 《Journal of Computational and Applied Mathematics》2010,234(6):1868-1875
This paper concerns the finite element simulation of the diffraction of a time-harmonic acoustic wave in the presence of an arbitrary mean flow. Considering the equation for the perturbation of displacement (due to Galbrun), we derive a low-Mach number formulation of the problem which is proved to be of Fredholm type and is therefore well suited for discretization by classical Lagrange finite elements. Numerical experiments are done in the case of a potential flow for which an exact approach is available, and a good agreement is observed. 相似文献
169.
It is well known that Universal cycles (U-cycles) of k-letter words on an n-letter alphabet exist for all k and n. In this paper, we prove that Universal cycles exist for several restricted classes of words, including non-bijections, “equitable” words (under suitable restrictions), ranked permutations, and “passwords”. In each case, proving the connectedness of the underlying de Bruijn digraph is a non-trivial step. 相似文献
170.
In Bautista-Ancona and Diaz-Vargas (2006) [B-D] a characterization and complete listing is given of the imaginary quadratic extensions K of k(x), where k is a finite field, in which the ideal class group has exponent two and the infinite prime of k(x) ramifies. The objective of this work is to give a characterization and list of these kind of extensions but now considering the case in which the infinite prime of k(x) is inert in K. Thus, we get all the imaginary quadratic extensions of k(x), in which the ideal class group has exponent two. 相似文献