全文获取类型
收费全文 | 19693篇 |
免费 | 1799篇 |
国内免费 | 1550篇 |
专业分类
化学 | 1598篇 |
晶体学 | 42篇 |
力学 | 1762篇 |
综合类 | 367篇 |
数学 | 16230篇 |
物理学 | 3043篇 |
出版年
2024年 | 32篇 |
2023年 | 150篇 |
2022年 | 209篇 |
2021年 | 236篇 |
2020年 | 392篇 |
2019年 | 425篇 |
2018年 | 455篇 |
2017年 | 558篇 |
2016年 | 627篇 |
2015年 | 441篇 |
2014年 | 757篇 |
2013年 | 1624篇 |
2012年 | 904篇 |
2011年 | 1048篇 |
2010年 | 939篇 |
2009年 | 1268篇 |
2008年 | 1348篇 |
2007年 | 1330篇 |
2006年 | 1129篇 |
2005年 | 1023篇 |
2004年 | 911篇 |
2003年 | 869篇 |
2002年 | 774篇 |
2001年 | 610篇 |
2000年 | 636篇 |
1999年 | 557篇 |
1998年 | 552篇 |
1997年 | 489篇 |
1996年 | 378篇 |
1995年 | 304篇 |
1994年 | 276篇 |
1993年 | 231篇 |
1992年 | 200篇 |
1991年 | 143篇 |
1990年 | 147篇 |
1989年 | 106篇 |
1988年 | 92篇 |
1987年 | 87篇 |
1986年 | 82篇 |
1985年 | 91篇 |
1984年 | 80篇 |
1983年 | 50篇 |
1982年 | 76篇 |
1981年 | 63篇 |
1980年 | 67篇 |
1979年 | 64篇 |
1978年 | 59篇 |
1977年 | 50篇 |
1976年 | 43篇 |
1974年 | 15篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
121.
In this paper, we use parametric quintic splines to derive some consistency relations which are then used to develop a numerical method for computing the solution of a system of fourth-order boundary-value problems associated with obstacle, unilateral, and contact problems. It is known that a class of variational inequalities related to contact problems in elastostatics can be characterized by a sequence of variational inequations, which are solved using some numerical method. Numerical evidence is presented to show the applicability and superiority of the new method over other collocation, finite difference, and spline methods. 相似文献
122.
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 相似文献
123.
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. 相似文献
124.
María G. Armentano Ricardo G. Durn 《Numerical Methods for Partial Differential Equations》2003,19(5):653-664
In this article we analyze the effect of mass‐lumping in the linear triangular finite element approximation of second‐order elliptic eigenvalue problems. We prove that the eigenvalue obtained by using mass‐lumping is always below the one obtained with exact integration. For singular eigenfunctions, as those arising in non convex polygons, we prove that the eigenvalue obtained with mass‐lumping is above the exact eigenvalue when the mesh size is small enough. So, we conclude that the use of mass‐lumping is convenient in the singular case. When the eigenfunction is smooth several numerical experiments suggest that the eigenvalue computed with mass‐lumping is below the exact one if the mesh is not too coarse. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 653–664, 2003 相似文献
125.
J. T. Haslinger K. Kunisch G. Peichl 《Computational Optimization and Applications》2003,26(3):231-251
This contribution deals with an efficient method for the numerical realization of the exterior and interior Bernoulli free boundary problems. It is based on a shape optimization approach. The state problems are solved by a fictitious domain solver using boundary Lagrange multipliers. 相似文献
126.
Computability and computational complexity were first considered over the fields of real and complex numbers and generalized to arbitrary algebraic systems. This article approaches the theory of computational complexity over an arbitrary algebraic system by taking computability over the list extension for a computational model of it. We study the resultant polynomial complexity classes and mention some NP-complete problems. 相似文献
127.
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. 相似文献
128.
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. 相似文献
129.
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. 相似文献
130.
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. 相似文献