全文获取类型
收费全文 | 4441篇 |
免费 | 339篇 |
国内免费 | 181篇 |
专业分类
化学 | 364篇 |
晶体学 | 1篇 |
力学 | 132篇 |
综合类 | 96篇 |
数学 | 3706篇 |
物理学 | 662篇 |
出版年
2024年 | 6篇 |
2023年 | 43篇 |
2022年 | 123篇 |
2021年 | 118篇 |
2020年 | 116篇 |
2019年 | 115篇 |
2018年 | 114篇 |
2017年 | 133篇 |
2016年 | 148篇 |
2015年 | 108篇 |
2014年 | 179篇 |
2013年 | 291篇 |
2012年 | 177篇 |
2011年 | 204篇 |
2010年 | 208篇 |
2009年 | 256篇 |
2008年 | 287篇 |
2007年 | 256篇 |
2006年 | 232篇 |
2005年 | 180篇 |
2004年 | 175篇 |
2003年 | 166篇 |
2002年 | 139篇 |
2001年 | 141篇 |
2000年 | 122篇 |
1999年 | 107篇 |
1998年 | 106篇 |
1997年 | 76篇 |
1996年 | 72篇 |
1995年 | 55篇 |
1994年 | 52篇 |
1993年 | 32篇 |
1992年 | 44篇 |
1991年 | 35篇 |
1990年 | 34篇 |
1989年 | 26篇 |
1988年 | 20篇 |
1987年 | 24篇 |
1986年 | 26篇 |
1985年 | 33篇 |
1984年 | 28篇 |
1982年 | 29篇 |
1981年 | 22篇 |
1980年 | 25篇 |
1979年 | 23篇 |
1978年 | 11篇 |
1977年 | 8篇 |
1976年 | 18篇 |
1974年 | 5篇 |
1973年 | 5篇 |
排序方式: 共有4961条查询结果,搜索用时 15 毫秒
1.
A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs. 相似文献
2.
《Physics letters. A》2020,384(35):126904
Exploring the evolution of cooperation has been one of the most challenging topics and attracted increasing attention in various realms. Hereby, we institute an analytic model where the relationship between the common benefits and contributions is the typical saturation nonlinearity. We investigate the evolutionary dynamics of cooperation with and without consensual incentives respectively. The population always evolves to full defection when the incentives are absent. Cooperation, however, can be promoted by consensual incentives when the degree of cooperators' preferences for incentives is great. There exists an intermediate amount of resources at which the positive effect of consensual incentives on cooperation is minimized. Furthermore, there is a U-shape relationship between the degree of cooperators' preference for an incentive and the evolution of cooperation. A greater basin of full cooperation can be induced when the cooperators' preference for reward is more pronounced than that for punishment. 相似文献
3.
In this paper, we study the existence of the uniformly minimum risk equivariant (UMRE) estimators of parameters in a class
of normal linear models, which include the normal variance components model, the growth curve model, the extended growth curve
model, and the seemingly unrelated regression equations model, and so on. The necessary and sufficient conditions are given
for the existence of UMRE estimators of the estimable linear functions of regression coefficients, the covariance matrixV and (trV)α, where α > 0 is known, in the models under an affine group of transformations for quadratic losses and matrix losses, respectively.
Under the (extended) growth curve model and the seemingly unrelated regression equations model, the conclusions given in literature
for estimating regression coefficients can be derived by applying the general results in this paper, and the sufficient conditions
for non-existence of UMRE estimators ofV and tr(V) are expanded to be necessary and sufficient conditions. In addition, the necessary and sufficient conditions that there
exist UMRE estimators of parameters in the variance components model are obtained for the first time. 相似文献
4.
Dean A. Carlson 《Journal of Mathematical Analysis and Applications》2002,276(2):561-588
The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results. 相似文献
5.
Mathematical economics has a long history and covers many interdisciplinary areas between mathematics and economics. At its center lies the theory of market equilibrium. The purpose of this expository article is to introduce mathematicians to price decentralization in general equilibrium theory. In particular, it concentrates on the role of positivity in the theory of convex economic analysis and the role of normal cones in the theory of non-convex economies. 相似文献
6.
关于AOR迭代法的研究 总被引:5,自引:0,他引:5
陈恒新 《应用数学与计算数学学报》2002,16(1):40-46
本文论证了严格对角占优矩阵之AOR法的误差估计式中的误差估计常数hγ,ω(0≤γ≤ω0)的最小值是h1,1. 相似文献
7.
A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph
Kazuhiro Suzuki 《Graphs and Combinatorics》2006,22(2):261-269
We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors. 相似文献
8.
Dalila B. M. M. Fontes Eleni Hadjiconstantinou Nicos Christofides 《Journal of Global Optimization》2006,34(1):97-125
In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations
of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on
the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving
transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation
of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial
solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as
a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively
improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications.
Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to
improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can
be obtained for concave cost network flow problems, particularly for fixed-charge problems. 相似文献
9.
图G称为K1,n-free图,如果它不含K1,n作为其导出子图.对K1,n-free图具有给定性质的[a,b]-因子涉及到最小度条件进行了研究,得到一个充分条件. 相似文献
10.
Given a tree
with leaf set X, there are certain ways of arranging the elements of X in a circular order so that
can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X. 相似文献