全文获取类型
收费全文 | 16421篇 |
免费 | 2158篇 |
国内免费 | 2318篇 |
专业分类
化学 | 3777篇 |
晶体学 | 168篇 |
力学 | 976篇 |
综合类 | 280篇 |
数学 | 8126篇 |
物理学 | 7570篇 |
出版年
2024年 | 34篇 |
2023年 | 126篇 |
2022年 | 291篇 |
2021年 | 318篇 |
2020年 | 308篇 |
2019年 | 381篇 |
2018年 | 368篇 |
2017年 | 541篇 |
2016年 | 588篇 |
2015年 | 508篇 |
2014年 | 815篇 |
2013年 | 1316篇 |
2012年 | 933篇 |
2011年 | 949篇 |
2010年 | 902篇 |
2009年 | 1157篇 |
2008年 | 1222篇 |
2007年 | 1238篇 |
2006年 | 1082篇 |
2005年 | 980篇 |
2004年 | 842篇 |
2003年 | 828篇 |
2002年 | 681篇 |
2001年 | 554篇 |
2000年 | 572篇 |
1999年 | 517篇 |
1998年 | 445篇 |
1997年 | 442篇 |
1996年 | 352篇 |
1995年 | 254篇 |
1994年 | 222篇 |
1993年 | 179篇 |
1992年 | 171篇 |
1991年 | 120篇 |
1990年 | 105篇 |
1989年 | 100篇 |
1988年 | 76篇 |
1987年 | 52篇 |
1986年 | 31篇 |
1985年 | 46篇 |
1984年 | 32篇 |
1983年 | 23篇 |
1982年 | 41篇 |
1981年 | 37篇 |
1980年 | 21篇 |
1979年 | 24篇 |
1978年 | 20篇 |
1977年 | 15篇 |
1976年 | 7篇 |
1973年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
T. Domínguez Benavides 《Journal of Mathematical Analysis and Applications》2004,291(1):100-108
Let X be a Banach space whose characteristic of noncompact convexity is less than 1 and satisfies the nonstrict Opial condition. Let C be a bounded closed convex subset of X, KC(X) the family of all compact convex subsets of X and T a nonexpansive mapping from C into KC(X) with bounded range. We prove that T has a fixed point. The nonstrict Opial condition can be removed if, in addition, T is an 1-χ-contractive mapping. 相似文献
92.
We study the asymptotic distribution of the fill‐up level in a binary trie built over n independent strings generated by a biased memoryless source. The fill‐up level is the number of full levels in a tree. A level is full if it contains the maximum allowable number of nodes (e.g., in a binary tree level k can have up to 2k nodes). The fill‐up level finds many interesting applications, e.g., in the internet IP lookup problem and in the analysis of level compressed tries (LC tries). In this paper, we present a complete asymptotic characterization of the fill‐up distribution. In particular, we prove that this distribution concentrates on one or two points around the most probably value k = ?log1/qn ? log log log n + 1 + log log(p/q)?, where p > q = 1 ? p is the probability of generating the more likely symbol (while q = 1 ? p is the probability of the less likely symbol). We derive our results by analytic methods such as generating functions, Mellin transform, the saddle point method, and analytic depoissonization. We also present some numerical verification of our results. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
93.
We propose a new approach towards proving that the fixed point property for ordered sets is preserved by products. This approach uses a characterization of fixed points in products via isotone relations. First explorations of classes of isotone relations are presented. These first explorations give us hope that this approach could lead to advances on the Product Problem. 相似文献
94.
Bing-sheng He Zhen-hua Yang Xiao-ming Yuan 《Journal of Mathematical Analysis and Applications》2004,300(2):139-374
Proximal point algorithms (PPA) are attractive methods for monotone variational inequalities. The approximate versions of PPA are more applicable in practice. A modified approximate proximal point algorithm (APPA) presented by Solodov and Svaiter [Math. Programming, Ser. B 88 (2000) 371–389] relaxes the inexactness criterion significantly. This paper presents an extended version of Solodov–Svaiter's APPA. Building the direction from current iterate to the new iterate obtained by Solodov–Svaiter's APPA, the proposed method improves the profit at each iteration by choosing the optimal step length along this direction. In addition, the inexactness restriction is relaxed further. Numerical example indicates the improvement of the proposed method. 相似文献
95.
In this paper, by the use of a fixed point theorem, many new necessary and sufficient conditions for the existence of positive solutions in C[0,1]∩C1[0,1]∩C2(0,1) or C[0,1]∩C2(0,1) are presented for singular superlinear and sublinear second-order boundary value problems. Singularities at t=0, t=1 will be discussed. 相似文献
96.
Zhimin He 《Journal of Mathematical Analysis and Applications》2004,296(1):97-109
In this paper, by means of a new twin fixed-point theorem in a cone, the existence of at least two positive solutions of m-point boundary value problem for second order dynamic equations on time scales is considered. 相似文献
97.
We employ an agent‐based model to show that memory and the absence of an a priori best strategy are sufficient for self‐segregation and clustering to emerge in a complex adaptive system with discrete agents that do not compete over a limited resource nor contend in a winner‐take‐all scenario. An agent starts from a corner of a two‐dimensional lattice and aims to reach a randomly selected site in the opposite side within the shortest possible time. The agent is isolated during the course of its journey and does not interact with other agents. Time‐bound obstacles appear at random lattice locations and the agent must decide whether to challenge or evade any obstacle blocking its path. The agent is capable of adapting a strategy in dealing with an obstacle. We analyze the dependence of strategy‐retention time with strategy for both memory‐based and memory‐less agents. We derive the equality spectrum to establish the environmental conditions that favor the existence of an a priori best strategy. We found that memory‐less agents do not polarize into two opposite strategy‐retention time distributions nor cluster toward a center distribution. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–46, 2004 相似文献
98.
In this paper, an interior point cutting plane method (IPCPM)is applied to solve optimal power flow (OPF) problems. Comparedwith the simplex cutting plane method (SCPM), the IPCPM is simpler,and efficient because of its polynomial-time characteristic.Issues in implementing IPCPM for OPF problems are addressed,including (1) how to generate cutting planes without using thesimplex tableau, (2) how to identify the basis variables inIPCPM, and (3) how to generate mixed integer cutting planes.The calculation speed of the proposed algorithm is further enhancedby utilizing the sparsity features of the OPF formulation. Numericalsimulations on IEEE 14-300-bus test systems have shown thatthe proposed method is effective. 相似文献
99.
Intermolecular Interactions in 8-Aza-D-Homogonane Crystals and their Manifestation in the IR Spectra
A. A. Akhrem A. A. Govorova O. V. Gulyakevich A. S. Lyakhov A. L. Mikhal'chuk I. V. Skornyakov G. B. Tolstorozhev 《Journal of Applied Spectroscopy》2004,71(2):156-163
Crystalline modifications of 8-aza-D-homogon-1,3,5(10),13-tetraen-12,17a-dione have been investigated by IR spectroscopy and x-ray structural analysis. It is shown that this compound crystallizes from solutions of chloroform with hexane in the form of a solvate comprised of chelate hydrogen bonds between the hydrogen atom of the chloroform molecule and the oxygen atoms of the carbonyl groups of the 8-azasteroid molecule. A relation between the changes in the characteristic absorption bands of the CH2-, C=O-, and I=C groups and the structure of the crystalline modifications has been established. 相似文献
100.
§ 1. IntroductionRecently ,thedifferentialequationswithdeviatingargumentswereusuallydiscussed(see[1 ],[4],[5 ]) .In [1 ],AGARWALRPandO’REGANDconsideredequationy″(t) =f(t,y(t) ,y(σ(t) ) ) , a.e .t∈ [0 ,1 ]y(t) =ψ(t) , t∈ [-r ,0 ]y( 1 ) =a ,( )andtheydiscussedtheexistenceofatleastonesolutionforequation ( ) .Inthispaper ,weconsideramoregeneralequation-x″(t) =f(t ,xt) , t∈ [0 ,1 ]x(t) =ψ(t) , t∈ ( -∞ ,0 ]x( 0 ) =x( 1 ) =0 ,( 1 .1 )andsomeexistencetheor… 相似文献