全文获取类型
收费全文 | 1391篇 |
免费 | 71篇 |
国内免费 | 109篇 |
专业分类
化学 | 341篇 |
晶体学 | 5篇 |
力学 | 155篇 |
综合类 | 29篇 |
数学 | 439篇 |
物理学 | 602篇 |
出版年
2024年 | 2篇 |
2023年 | 16篇 |
2022年 | 22篇 |
2021年 | 25篇 |
2020年 | 34篇 |
2019年 | 29篇 |
2018年 | 37篇 |
2017年 | 35篇 |
2016年 | 44篇 |
2015年 | 39篇 |
2014年 | 81篇 |
2013年 | 121篇 |
2012年 | 69篇 |
2011年 | 110篇 |
2010年 | 66篇 |
2009年 | 110篇 |
2008年 | 121篇 |
2007年 | 76篇 |
2006年 | 55篇 |
2005年 | 57篇 |
2004年 | 61篇 |
2003年 | 48篇 |
2002年 | 40篇 |
2001年 | 37篇 |
2000年 | 31篇 |
1999年 | 32篇 |
1998年 | 27篇 |
1997年 | 20篇 |
1996年 | 23篇 |
1995年 | 13篇 |
1994年 | 9篇 |
1993年 | 13篇 |
1992年 | 12篇 |
1991年 | 4篇 |
1990年 | 9篇 |
1989年 | 5篇 |
1988年 | 7篇 |
1987年 | 8篇 |
1986年 | 4篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 1篇 |
排序方式: 共有1571条查询结果,搜索用时 125 毫秒
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.
O. Fülöp 《Discrete Mathematics》2005,294(3):285-290
We give a short proof for the Mixed Connectivity Certificate Theorem of Even, Itkis and Rajsbaum and provide an upper bound on the edge number of a certificate of local T-mixed connectivity up to k. 相似文献
3.
For an arbitrary bounded closed set E in the complex plane with complement Ω of finite connectivity, we study the degree of convergence of the lemniscates in Ω. 相似文献
4.
V.I. Kushch I. Sevostianov L. Mishnaevsky Jr 《International Journal of Solids and Structures》2008,45(18-19):5103-5117
The paper addresses the problem of calculation of the local stress field and effective elastic properties of a unidirectional fiber reinforced composite with anisotropic constituents. For this aim, the representative unit cell approach has been utilized. The micro geometry of the composite is modeled by a periodic structure with a unit cell containing multiple circular fibers. The number of fibers is sufficient to account for the micro structure statistics of composite. A new method based on the multipole expansion technique is developed to obtain the exact series solution for the micro stress field. The method combines the principle of superposition, technique of complex potentials and some new results in the theory of special functions. A proper choice of potentials and new results for their series expansions allow one to reduce the boundary-value problem for the multiple-connected domain to an ordinary, well-posed set of linear algebraic equations. This reduction provides high numerical efficiency of the developed method. Exact expressions for the components of the effective stiffness tensor have been obtained by analytical averaging of the strain and stress fields. 相似文献
5.
CONG Fuzhong & LI YongSchool of Mathematics Information Science Shandong Institute of Business Technology Yantai China Office of Mathematics Changchun Flight Academy of the Air Force Changchun China Department of Mathematics Jilin University Changchun China 《中国科学A辑(英文版)》2004,47(5):675-686
An effective stability result for generalized Hamiltonian systems is obtained by applying the simultaneous approximation technique due to Lochak. Among these systems, dimensions of action variables and angle variables might be distinct. 相似文献
6.
Let G=(V,E) be a undirected k-edge connected graph with weights ce on edges and wv on nodes. The minimum 2-edge connected subgraph problem, 2ECSP for short, is to find a 2-edge connected subgraph of G, of minimum total weight. The 2ECSP generalizes the well-known Steiner 2-edge connected subgraph problem. In this paper we study the convex hull of the incidence vectors corresponding to feasible solutions of 2ECSP. First, a natural integer programming formulation is given and it is shown that its linear relaxation is not sufficient to describe the polytope associated with 2ECSP even when G is series-parallel. Then, we introduce two families of new valid inequalities and we give sufficient conditions for them to be facet-defining. Later, we concentrate on the separation problem. We find polynomial time algorithms to solve the separation of important subclasses of the introduced inequalities, concluding that the separation of the new inequalities, when G is series-parallel, is polynomially solvable. 相似文献
7.
Numerical schemes for systems with multiple spatio-temporal scales are investigated. The multiscale schemes use asymptotic results for this type of systems which guarantee the existence of an effective dynamics for some suitably defined modes varying slowly on the largest scales. The multiscale schemes are analyzed in general, then illustrated on a specific example of a moderately large deterministic system displaying chaotic behavior due to Lorenz. Issues like consistency, accuracy, and efficiency are discussed in detail. The role of possible hidden slow variables as well as additional effects arising on the diffusive time-scale are also investigated. As a byproduct we obtain a rather complete characterization of the effective dynamics in Lorenz model. 相似文献
8.
The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s1,…,sk,t1,…,tk, the graph contains k vertex disjoint paths joining sr to tr for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007 相似文献
9.
TAN Xiaojiang 《数学年刊B辑(英文版)》2002,23(4):531-538
Lei X be an arbitrary smooth irreducible complex projective curve, E (?) X a rank two vector bundle generated by its sections. The author first represents E as a triple {D1,D2,f}, where D1 , D2 are two effective divisors with d = deg(D1) + deg(D2), and f ∈ H0(X, [D1] |D2) is a collection of polynomials. E is the extension of [D2] by [D1] which is determined by f. By using f and the Brill-Noether matrix of D1 + D2, the author constructs a 2g X d matrix WE whose zero space gives Im{H0(X,[D1]) (?) H0(X, [D1] |D1)}(?)Im{H0(X, E) (?) H0(X,[D2]) (?) H0(X,[D2] |D2)}. From this and H0(X,E) = H0(X, [D1]) (?) Im{H0(X, E) (?) H0(X, [D2])}, it is got in particular that dimH0(X, E) = deg(E) - rank(WE) + 2. 相似文献
10.
Let G = (V,E) be a graph or digraph and r : V → Z+. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν1,…,νr(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003 相似文献