全文获取类型
收费全文 | 2276篇 |
免费 | 177篇 |
国内免费 | 111篇 |
专业分类
化学 | 270篇 |
晶体学 | 3篇 |
力学 | 149篇 |
综合类 | 18篇 |
数学 | 1213篇 |
物理学 | 911篇 |
出版年
2023年 | 16篇 |
2022年 | 31篇 |
2021年 | 36篇 |
2020年 | 36篇 |
2019年 | 40篇 |
2018年 | 44篇 |
2017年 | 48篇 |
2016年 | 45篇 |
2015年 | 42篇 |
2014年 | 86篇 |
2013年 | 232篇 |
2012年 | 87篇 |
2011年 | 114篇 |
2010年 | 95篇 |
2009年 | 166篇 |
2008年 | 152篇 |
2007年 | 136篇 |
2006年 | 117篇 |
2005年 | 105篇 |
2004年 | 82篇 |
2003年 | 87篇 |
2002年 | 76篇 |
2001年 | 68篇 |
2000年 | 68篇 |
1999年 | 61篇 |
1998年 | 51篇 |
1997年 | 62篇 |
1996年 | 55篇 |
1995年 | 40篇 |
1994年 | 24篇 |
1993年 | 32篇 |
1992年 | 27篇 |
1991年 | 27篇 |
1990年 | 32篇 |
1989年 | 16篇 |
1988年 | 15篇 |
1987年 | 25篇 |
1986年 | 9篇 |
1985年 | 12篇 |
1984年 | 13篇 |
1983年 | 6篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 7篇 |
1979年 | 8篇 |
1978年 | 6篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1973年 | 2篇 |
1971年 | 3篇 |
排序方式: 共有2564条查询结果,搜索用时 15 毫秒
11.
S. Moss de Oliveira P. M. C. de Oliveira F. C. de Sá Barreto 《Journal of statistical physics》1995,78(5-6):1619-1627
Using the finite-size scaling renormalization group, we obtain the two-dimensional flow diagram of the Blume-Capel model forS=1 andS=3/2. In the first case our results are similar to those of mean-field theory, which predicts the existence of first- and second-order transitions with a tricritical point. In the second case, however, our results are different. While we obtain in theS=1 case a phase diagram presenting a multicritical point, the mean-field approach predicts only a second-order transition and a critical endpoint. 相似文献
12.
13.
Yuanqiu Huang 《Discrete Applied Mathematics》2007,155(3):405-409
A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree. 相似文献
14.
M.Z. Arslanov 《Operations Research Letters》2007,35(5):636-644
We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem. 相似文献
15.
On Polynomial Functions over Finite Commutative Rings 总被引:1,自引:0,他引:1
Jian Jun JIANG Guo Hua PENG Qi SUN Qi Fan ZHANG 《数学学报(英文版)》2006,22(4):1047-1050
Let R be an arbitrary finite commutative local ring. In this paper, we obtain a necessary and sufficient condition for a function over R to be a polynomial function. Before this paper, necessary and sufficient conditions for a function to be a polynomial function over some special finite commutative local rings were obtained. 相似文献
16.
In the present paper, Daubechies' wavelets and the computation of their scaling coefficients are briefly reviewed. Then a new method of computation is proposed. This method is based on the work [7] concerning a new orthonormality condition and relations among scaling moments, respectively. For filter lengths up to 16, the arising system can be explicitly solved with algebraic methods like Gröbner bases. Its simple structure allows one to find quickly all possible solutions. 相似文献
17.
Douglas R. White Jason Owen-Smith James Moody Walter W. Powell 《Computational & Mathematical Organization Theory》2004,10(1):95-117
Social action is situated in fields that are simultaneously composed of interpersonal ties and relations among organizations, which are both usefully characterized as social networks. We introduce a novel approach to distinguishing different network macro-structures in terms of cohesive subsets and their overlaps. We develop a vocabulary that relates different forms of network cohesion to field properties as opposed to organizational constraints on ties and structures. We illustrate differences in probabilistic attachment processes in network evolution that link on the one hand to organizational constraints versus field properties and to cohesive network topologies on the other. This allows us to identify a set of important new micro-macro linkages between local behavior in networks and global network properties. The analytic strategy thus puts in place a methodology for Predictive Social Cohesion theory to be developed and tested in the context of informal and formal organizations and organizational fields. We also show how organizations and fields combine at different scales of cohesive depth and cohesive breadth. Operational measures and results are illustrated for three organizational examples, and analysis of these cases suggests that different structures of cohesive subsets and overlaps may be predictive in organizational contexts and similarly for the larger fields in which they are embedded. Useful predictions may also be based on feedback from level of cohesion in the larger field back to organizations, conditioned on the level of multiconnectivity to the field. 相似文献
18.
Let E\subset \Bbb R
s
be compact and let d
n
E
denote the dimension of the space of polynomials of degree at most n in s variables restricted to E . We introduce the notion of an asymptotic interpolation measure (AIM). Such a measure, if it exists , describes the asymptotic behavior of any scheme τ
n
={ \bf x
k,n
}
k=1
dnE
, n=1,2,\ldots , of nodes for multivariate polynomial interpolation for which the norms of the corresponding interpolation operators do
not grow geometrically large with n . We demonstrate the existence of AIMs for the finite union of compact subsets of certain algebraic curves in R
2
. It turns out that the theory of logarithmic potentials with external fields plays a useful role in the investigation. Furthermore,
for the sets mentioned above, we give a computationally simple construction for ``good' interpolation schemes.
November 9, 2000. Date revised: August 4, 2001. Date accepted: September 14, 2001. 相似文献
19.
The theory of nonequilibrium potentials or quasipotentials is a physically motivated approach to small random perturbations of dynamical systems, leading to exponential estimates of invariant probabilities and mean first exit times. In the present article we develop the mathematical foundation of this theory for discrete-time systems, following and extending the work of Freidlin and Wentzell, and Kifer. We discuss strategies for calculating and estimating quasipotentials and show their application to one-dimensionalS-unimodal maps. The method proves to be especially suited for describing the noise scaling behavior of invariant probabilities, e.g., for the map occurring as the limit of the Feigenbaum period-doubling sequence. We show that the method allows statements about the scaling behavior in the case of localized noise, too, which does not originally lie within the scope of the quasipotential formalism. 相似文献
20.
Popularized by Zassenhaus in the seventies, several algorithms for factoring polynomials use a so-called lifting and recombination scheme. Concerning bivariate polynomials, we present a new algorithm for the recombination stage that requires a lifting up to precision twice the total degree of the polynomial to be factored. Its cost is dominated by the computation of reduced echelon solution bases of linear systems. We show that our bound on precision is asymptotically optimal.