全文获取类型
收费全文 | 432篇 |
免费 | 38篇 |
国内免费 | 24篇 |
专业分类
化学 | 31篇 |
晶体学 | 2篇 |
力学 | 8篇 |
综合类 | 12篇 |
数学 | 327篇 |
物理学 | 114篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 5篇 |
2021年 | 8篇 |
2020年 | 11篇 |
2019年 | 21篇 |
2018年 | 17篇 |
2017年 | 13篇 |
2016年 | 11篇 |
2015年 | 11篇 |
2014年 | 15篇 |
2013年 | 35篇 |
2012年 | 18篇 |
2011年 | 33篇 |
2010年 | 26篇 |
2009年 | 20篇 |
2008年 | 25篇 |
2007年 | 35篇 |
2006年 | 24篇 |
2005年 | 15篇 |
2004年 | 11篇 |
2003年 | 10篇 |
2002年 | 15篇 |
2001年 | 16篇 |
2000年 | 14篇 |
1999年 | 11篇 |
1998年 | 11篇 |
1997年 | 5篇 |
1996年 | 11篇 |
1995年 | 4篇 |
1994年 | 6篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1989年 | 2篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 3篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 4篇 |
1976年 | 2篇 |
1972年 | 2篇 |
排序方式: 共有494条查询结果,搜索用时 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.
3.
应用七级目测法对浙江中部地区27个夏熟作物田样点的杂草进行了优势等级调查,将所得数据转换成重要值,以杂草在27个样点中的重要值为运算指标,应用主成分分析法和图论聚类中的最小生成树法,对24种杂草的生态学相似性进行了比较,指出了长期使用单一的除草剂导致农田杂草种群迅速更迭的原因:杂草对除草剂的敏感性差异及不同杂草间的生态学特性的差异。 相似文献
4.
Paul Howard 《Mathematical Logic Quarterly》2007,53(3):247-254
Two theorems are proved: First that the statement “there exists a field F such that for every vector space over F, every generating set contains a basis” implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assertion that every vector space over ?2 has a basis implies that every well‐ordered collection of two‐element sets has a choice function. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
5.
6.
本在无向网络中,建立了带有边集限制的最均匀支撑树问题的网络模型.中首先解决最均匀支撑树问题,并给出求无向网络中最均匀支撑树的多项式时间算法;然后,给出了求无向网络中带有边集限制的最小树多项式时间算法;最后,在已解决的两个问题的基础上解决了带有边集限制的最均匀支撑树问题. 相似文献
7.
本在Glover—Klingman算法及最小费用支撑树对策的基础上,讨论了最小费用k度限制树对策问题.利用威胁、旁支付理论制订了两种规则,并利用优超、策略等价理论分别给出了在这两种规则下最小费用k度限制树对策核心中的解,从而证明了在这两种规则下其核心非空. 相似文献
8.
Most adhesives and binders, including bitumen for asphalt mixture production, are presently produced from petrochemicals after
the refining of crude oil. The fact that crude oil reserves are a finite resource means that in the future, it may become
necessary to produce these materials from alternative and probably renewable sources. Suitable resources of this kind may
include polysaccharides, plant oils and proteins. This paper deals with the synthesis of polymer binders from monomers that
could, in future, be derived from renewable resources. These binders consist of polyethyl acrylate (PEA) of different molecular
weight, polymethyl acrylate (PMA) and polybutyl acrylate (PBA), which were synthesised from ethyl acrylate, methyl acrylate
and butyl acrylate, respectively, by atom transfer radical polymerisation. The rheological properties of these binders were
determined by means of oscillatory testing using a dynamic shear rheometer and combinations of stress/strain, temperature
and frequency sweeps. The results indicate that PEA can be produced to have rheological properties similar to that of ‘soft’
100/150 penetration grade bitumen, PMA with similar rheological properties to that of ‘hard’ 10/20 penetration grade bitumen,
while PBA, due to its highly viscous nature and low dynamic moduli, cannot be used on its own as a binder. The synthetic polymers
were found to be thermo-rheologically simple, and the shift factors, used to produce the dynamic moduli master curves, were
found to fit an Arrhenius function. 相似文献
9.
We are given a complete and loop-free digraphG=(V, A), whereV={1,...,n} is the vertex set,A={(i, j) :i, j V} the arc set, andr V is a distinguishedroot vertex. For each arc (i, j) A, letc
ij
be the associatedcost, and for each vertexi, letq
i
0 be the associateddemand (withq
r
=0). Moreover, a nonnegativebranch capacity, Q, is defined.A Capacitated Shortest Spanning Arborescence rooted at r (CSSA
r
) is a minimum cost partial digraph such that: (i) each vertexj r has exactly one entering arc; (ii) for each vertexj r, a path fromr toj exists; (iii) for each branch leaving vertexr, the total demand of the vertices does not exceed the branch capacity,Q. A variant of theCSSA
r
problem (calledD-CSSA
r
) arises when the out-degree of the root vertex is constrained to be equal to a given valueD. These problems are strongly NP-hard, and find practical applications in routing and network design. We describe a new Lagrangian lower bound forCSSA
r
andD-CSSA
r
problems, strengthened in a cutting plane fashion by iteratively adding violated constraints to the Lagrangian problem. We also present a new lower bound based on projection leading to the solution of min-cost flow problems. The two lower bounds are then combined so as to obtain an overall additive lower bounding procedure. The additive procedure is then imbedded in a branch-and-bound algorithm whose performance is enhanced by means of reduction procedures, dominance criteria, feasibility checks and upper bounding. Computational tests on asymmetric and symmetric instances from the literature, involving up to 200 vertices, are given, showing the effectiveness of the proposed approach. 相似文献
10.
Akira Onuki 《Journal of statistical physics》1978,18(5):475-499
A master equation is derived microscopically to describe the fluctuating motion of the particle density in . space. This equation accounts for the drift motion of particles and is valid for any inhomogeneous gas. The Boltzmann equation is obtained from the first moment of this equation by neglecting the second cumulant (the pair correlation function). The successive moments form coarse-grained BBGKY-like hierarchy equations, in which small spatial regions with rij < the force range are smeared out. These hierarchy equations are convenient for investigating the nonequilibrium long-range pair correlation function, which arises mainly from sequences of isolated binary collisions and gives rise to the much-discussed long-time tail and the logarithmic term in the density expansion of transport coefficients. It is shown to have a spatial long tail, like the Coulombic potential, in a steady laminar flow. The stochastic nature of the nonlinear Boltzmann-Langevin equation is also investigated; the random source term is found to be expressed as a linear superposition of Poisson random variables and to become Gaussian in special cases. 相似文献