全文获取类型
收费全文 | 44276篇 |
免费 | 4286篇 |
国内免费 | 4700篇 |
专业分类
化学 | 14257篇 |
晶体学 | 178篇 |
力学 | 3446篇 |
综合类 | 461篇 |
数学 | 20460篇 |
物理学 | 14460篇 |
出版年
2024年 | 122篇 |
2023年 | 504篇 |
2022年 | 968篇 |
2021年 | 1060篇 |
2020年 | 1350篇 |
2019年 | 1262篇 |
2018年 | 1260篇 |
2017年 | 1481篇 |
2016年 | 1592篇 |
2015年 | 1374篇 |
2014年 | 2181篇 |
2013年 | 3993篇 |
2012年 | 2333篇 |
2011年 | 2671篇 |
2010年 | 2203篇 |
2009年 | 2960篇 |
2008年 | 2987篇 |
2007年 | 2932篇 |
2006年 | 2421篇 |
2005年 | 2132篇 |
2004年 | 1769篇 |
2003年 | 1675篇 |
2002年 | 1522篇 |
2001年 | 1159篇 |
2000年 | 1182篇 |
1999年 | 1083篇 |
1998年 | 956篇 |
1997年 | 794篇 |
1996年 | 608篇 |
1995年 | 489篇 |
1994年 | 443篇 |
1993年 | 380篇 |
1992年 | 354篇 |
1991年 | 279篇 |
1990年 | 278篇 |
1989年 | 252篇 |
1988年 | 211篇 |
1987年 | 214篇 |
1986年 | 175篇 |
1985年 | 223篇 |
1984年 | 210篇 |
1983年 | 121篇 |
1982年 | 159篇 |
1981年 | 159篇 |
1980年 | 120篇 |
1979年 | 128篇 |
1978年 | 106篇 |
1977年 | 93篇 |
1976年 | 81篇 |
1973年 | 71篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
101.
Ledzewicz U. Nowakowski A. Schättler H. 《Journal of Optimization Theory and Applications》2004,122(2):345-370
It is shown that, if a parametrized fämily of extremals F can be stratified in a way compatible with the flow map generated by F, then those trajectories of the family which realize the minimal values of the cost in F are indeed optimal in comparison with all trajectories which lie in the region R covered by the trajectories of F. It is not assumed that F is a field covering the state space injectively. As illustration, an optimal synthesis is constructed for a system where the flow of extremals exhibits a simple cusp singularity. 相似文献
102.
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 相似文献
103.
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. 相似文献
104.
We consider some types of packet discretization for continuous spectra in quantum scattering problems. As we previously showed, this discretization leads to a convenient finite-dimensional (i.e., matrix) approximation for integral operators in the scattering theory and allows reducing the solution of singular integral equations connected with the scattering theory to some suitable purely algebraic equations on an analytic basis. All singularities are explicitly singled out. Our primary emphasis is on realizing the method practically. 相似文献
105.
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. 相似文献
106.
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. 相似文献
107.
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. 相似文献
108.
This paper develops a theory for the global solution of nonconvex optimization problems with parameter-embedded linear dynamic systems. A quite general problem formulation is introduced and a solution is shown to exists. A convexity theory for integrals is then developed to construct convex relaxations for utilization in a branch-and-bound framework to calculate a global minimum. Interval analysis is employed to generate bounds on the state variables implied by the bounds on the embedded parameters. These bounds, along with basic integration theory, are used to prove convergence of the branch-and-bound algorithm to the global minimum of the optimization problem. The implementation of the algorithm is then considered and several numerical case studies are examined thoroughly 相似文献
109.
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. 相似文献
110.
We study the elastic responses of double-(ds) and single-stranded (ss) DNA at external force fields. A double-strand-polymer
elastic model is constructed and solved by path integral methods and Monte Carlo simulations to understand the entropic elasticity,
cooperative extensibility, and supercoiling property of dsDNA. The good agreement with experiments indicates that short-ranged
base-pair stacking interaction is crucial for the stability and the high deformability of dsDNA. Hairpin-coil transition in
ssDNA is studied with generating function method. A threshold force is needed to pull the ssDNA hairpin patterns, stabilized
by base pairing and base-pair stacking, into random coils. This phase transition is predicted to be of first order for stacking
potential higher than some critical level, in accordance with experimental observations. 相似文献