全文获取类型
收费全文 | 12295篇 |
免费 | 1242篇 |
国内免费 | 920篇 |
专业分类
化学 | 2285篇 |
晶体学 | 59篇 |
力学 | 999篇 |
综合类 | 387篇 |
数学 | 6180篇 |
物理学 | 4547篇 |
出版年
2023年 | 80篇 |
2022年 | 186篇 |
2021年 | 217篇 |
2020年 | 212篇 |
2019年 | 211篇 |
2018年 | 232篇 |
2017年 | 307篇 |
2016年 | 357篇 |
2015年 | 268篇 |
2014年 | 507篇 |
2013年 | 699篇 |
2012年 | 570篇 |
2011年 | 755篇 |
2010年 | 759篇 |
2009年 | 940篇 |
2008年 | 902篇 |
2007年 | 896篇 |
2006年 | 847篇 |
2005年 | 610篇 |
2004年 | 541篇 |
2003年 | 544篇 |
2002年 | 488篇 |
2001年 | 431篇 |
2000年 | 353篇 |
1999年 | 349篇 |
1998年 | 302篇 |
1997年 | 252篇 |
1996年 | 222篇 |
1995年 | 171篇 |
1994年 | 144篇 |
1993年 | 131篇 |
1992年 | 135篇 |
1991年 | 91篇 |
1990年 | 83篇 |
1989年 | 79篇 |
1988年 | 59篇 |
1987年 | 56篇 |
1986年 | 28篇 |
1985年 | 54篇 |
1984年 | 48篇 |
1983年 | 28篇 |
1982年 | 54篇 |
1981年 | 36篇 |
1980年 | 32篇 |
1979年 | 54篇 |
1978年 | 30篇 |
1977年 | 27篇 |
1976年 | 17篇 |
1974年 | 18篇 |
1973年 | 18篇 |
排序方式: 共有10000条查询结果,搜索用时 62 毫秒
961.
In this paper, we propose a well targeted algorithm (GAS algorithm) for detecting communities in high clustered networks by presenting group action technology on community division. During the processing of this algorithm, the underlying community structure of a clustered network emerges simultaneously as the corresponding partition of orbits by the permutation groups acting on the node set are achieved. As the derivation of the orbit partition, an algebraic structure r-cycle can be considered as the origin of the community. To be a priori estimation for the community structure of the algorithm, the community separability is introduced to indicate whether a network has distinct community structure. By executing the algorithm on several typical networks and the LFR benchmark, it shows that this GAS algorithm can detect communities accurately and effectively in high clustered networks. Furthermore, we compare the GAS algorithm and the clique percolation algorithm on the LFR benchmark. It is shown that the GAS algorithm is more accurate at detecting non-overlapping communities in clustered networks. It is suggested that algebraic techniques can uncover fresh light on detecting communities in complex networks. 相似文献
962.
963.
964.
965.
In this paper, we consider the problem where λ is a spectral parameter; q(x) ∈ L1(0,1) is complex‐valued function; αs, s = 1,2,3, are arbitrary complex constants that satisfy α2 = α1 + α3 and σ = 0,1. The boundary conditions of this problem are regular, but not strongly regular. Asymptotic formulae for eigenvalues and eigenfunctions of the considered boundary value problem are established. It is proved that all the eigenvalues, except for finite number, are simple and the system of root functions of this spectral problem forms a basis in the space Lp(0,1), 1 < p < ∞ , when ; moreover, this basis is unconditional for p = 2. We note that the considered problem was previously investigated in the condition of α2 ≠ α1 + α3. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
966.
An analytic function f in the unit disk
D :={z ∈ ? : |z| < 1}, standardly normalized, is called close-to-convex with respect to the Koebe function
k(z) := z/(1−z)2, z ∈ D if there exists δ∈(-π/2,π/2) such that
Re{eiδ(1−z)2f′(z)} > 0, ∈ D. For the class C(k) of all close-to-convex functions with respect to k, related to the class of functions convex in the positive direction of the imaginary axis, the Fekete-Szegö problem is studied. 相似文献
967.
968.
969.
970.
We present several equivalent conditions for the Karush–Kuhn–Tucker conditions for weak? compact convex sets. Using them, we extend several existing theorems of the alternative in terms of weak? compact convex sets. Such extensions allow us to express the KKT conditions and hence necessary optimality conditions for more general nonsmooth optimization problems with inequality and equality constraints. Furthermore, several new equivalent optimality conditions for optimization problems with inequality constraints are obtained. 相似文献