全文获取类型
收费全文 | 20366篇 |
免费 | 493篇 |
国内免费 | 291篇 |
专业分类
化学 | 1375篇 |
晶体学 | 81篇 |
力学 | 242篇 |
综合类 | 31篇 |
数学 | 17925篇 |
物理学 | 1496篇 |
出版年
2023年 | 38篇 |
2022年 | 48篇 |
2021年 | 74篇 |
2020年 | 111篇 |
2019年 | 575篇 |
2018年 | 634篇 |
2017年 | 349篇 |
2016年 | 259篇 |
2015年 | 258篇 |
2014年 | 581篇 |
2013年 | 1216篇 |
2012年 | 659篇 |
2011年 | 1186篇 |
2010年 | 1029篇 |
2009年 | 1420篇 |
2008年 | 1584篇 |
2007年 | 1575篇 |
2006年 | 1238篇 |
2005年 | 803篇 |
2004年 | 749篇 |
2003年 | 640篇 |
2002年 | 490篇 |
2001年 | 407篇 |
2000年 | 390篇 |
1999年 | 467篇 |
1998年 | 440篇 |
1997年 | 326篇 |
1996年 | 473篇 |
1995年 | 461篇 |
1994年 | 430篇 |
1993年 | 331篇 |
1992年 | 244篇 |
1991年 | 170篇 |
1990年 | 127篇 |
1989年 | 150篇 |
1988年 | 92篇 |
1987年 | 94篇 |
1986年 | 91篇 |
1985年 | 142篇 |
1984年 | 106篇 |
1983年 | 85篇 |
1982年 | 114篇 |
1981年 | 101篇 |
1980年 | 82篇 |
1979年 | 58篇 |
1978年 | 69篇 |
1977年 | 60篇 |
1976年 | 58篇 |
1975年 | 22篇 |
1974年 | 20篇 |
排序方式: 共有10000条查询结果,搜索用时 234 毫秒
91.
Christos Kravvaritis Marilena Mitrouli Jennifer Seberry 《Linear and Multilinear Algebra》2007,55(5):471-490
In the present article we concentrate our study on the growth problem for the weighing matrix W(12,11) and show that the unique W(12,11) has three pivot structures. An improved algorithm for extending a k × k (0,+,-) matrix to a W(n,n-1), if possible, has been developed to simplify the proof. For the implementation of the algorithm special emphasis is given to the notions of data structures and parallel processing. 相似文献
92.
We consider the Dirichlet problem for a class of anisotropic degenerate elliptic equations. New a priori estimates for solutions and for the gradient of solutions are established. Based on these estimates sufficient conditions guaranteeing the solvability of the problem are formulated. The results are new even in the semilinear case when the principal part is the Laplace operator. 相似文献
93.
We study the domain of existence of a solution to a Riemann problem for the pressure gradient equation in two space dimensions. The Riemann problem is the expansion of a quadrant of gas of constant state into the other three vacuum quadrants. The global existence of a smooth solution was established in Dai and Zhang [Z. Dai, T. Zhang, Existence of a global smooth solution for a degenerate Goursat problem of gas dynamics, Arch. Ration. Mech. Anal. 155 (2000) 277-298] up to the free boundary of vacuum. We prove that the vacuum boundary is the coordinate axes. 相似文献
94.
Piotr Borodulin-Nadzieja 《Topology and its Applications》2007,154(18):3107-3124
We investigate properties of minimally generated Boolean algebras. It is shown that all measures defined on such algebras are separable but not necessarily weakly uniformly regular. On the other hand, there exist Boolean algebras small in terms of measures which are not minimally generated. We prove that under CH a measure on a retractive Boolean algebra can be nonseparable. Some relevant examples are indicated. Also, we give two examples of spaces satisfying some kind of Efimov property. 相似文献
95.
Despite the large cost of bodily injury (BI) claims in motor insurance, relatively little research has been done in this area. Many companies estimate (and therefore reserve) bodily injury compensation directly from initial medical reports. This practice may underestimate the final cost, because the severity is often assessed during the recovery period. Since the evaluation of this severity is often only qualitative, in this paper we apply an ordered multiple choice model at different moments in the life of a claim reported to an insurance company. We assume that the information available to the insurer does not flow continuously, because it is obtained at different stages. Using a real data set, we show that the application of sequential ordered logit models leads to a significant improvement in the prediction of the BI severity level, compared to the subjective classification that is used in practice. We also show that these results could improve the insurer’s reserves notably. 相似文献
96.
The object of the present investigation is to introduce a new trigonometric method of summation which is both regular and
Fourier effective and determine its status with reference to other methods of summation (see §2-§4) and also give an application
of this method to determine the degree of approximation in a new Banach space of functions conceived as a generalized Holder
metric (see §5). 相似文献
97.
关于PFI-代数与剩余格 总被引:10,自引:0,他引:10
本文提出了一种强FI代数-PFI代数,并且深入研究了它的性质,借此进一步揭示了FI-代数和剩余格之间更加密切的联系,进而以FI-代数为基本框架建立了R0-代数、正则剩余格等逻辑系统的结构特征(包括对隅结构)及其相互关系.这种以FI-代数为基础来统一处理剩余格和R0-代数的方法,同样适合于格蕴涵代数和MV代数等代数结构,而且从中更能清楚地看出它们之间的密切联系,也将有助于对相应形式逻辑系统与模糊推理的研究. 相似文献
98.
We study the multiplicity of critical points for functionals which are only differentiable along some directions. We extend to this class of functionals the three critical point theorem of Pucci and Serrin and we apply it to a one-parameter family of functionals Jλ, λ∈I⊂R. Under suitable assumptions, we locate an open subinterval of values λ in I for which Jλ possesses at least three critical points. Applications to quasilinear boundary value problems are also given. 相似文献
99.
Hans L. Bodlaender 《Discrete Applied Mathematics》2007,155(11):1348-1372
The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all k∈N. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications. 相似文献
100.
A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum,
the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and semimagic squares (the same, but without
the diagonals). A magilatin labelling is like a magic labelling but the values need be distinct only within each set. We show that the number of n × n magic or magilatin labellings is a quasipolynomial function of the magic sum, and also of an upper bound on the entries in
the square. Our results differ from previous ones because we require that the entries in the square all be different from
each other, and because we derive our results not by ad hoc reasoning but from a general theory of counting lattice points in rational inside-out polytopes. We also generalize from
set systems to rational linear forms.
Dedicated to the memory of Claudia Zaslavsky, 1917–2006
Received August 10, 2005 相似文献