全文获取类型
收费全文 | 7164篇 |
免费 | 431篇 |
国内免费 | 502篇 |
专业分类
化学 | 295篇 |
晶体学 | 2篇 |
力学 | 362篇 |
综合类 | 80篇 |
数学 | 3730篇 |
物理学 | 672篇 |
综合类 | 2956篇 |
出版年
2024年 | 11篇 |
2023年 | 57篇 |
2022年 | 90篇 |
2021年 | 89篇 |
2020年 | 109篇 |
2019年 | 105篇 |
2018年 | 104篇 |
2017年 | 103篇 |
2016年 | 141篇 |
2015年 | 152篇 |
2014年 | 265篇 |
2013年 | 360篇 |
2012年 | 320篇 |
2011年 | 350篇 |
2010年 | 326篇 |
2009年 | 470篇 |
2008年 | 484篇 |
2007年 | 592篇 |
2006年 | 478篇 |
2005年 | 417篇 |
2004年 | 371篇 |
2003年 | 345篇 |
2002年 | 353篇 |
2001年 | 260篇 |
2000年 | 242篇 |
1999年 | 203篇 |
1998年 | 197篇 |
1997年 | 158篇 |
1996年 | 160篇 |
1995年 | 130篇 |
1994年 | 97篇 |
1993年 | 85篇 |
1992年 | 73篇 |
1991年 | 53篇 |
1990年 | 52篇 |
1989年 | 39篇 |
1988年 | 50篇 |
1987年 | 31篇 |
1986年 | 31篇 |
1985年 | 23篇 |
1984年 | 29篇 |
1983年 | 7篇 |
1982年 | 18篇 |
1981年 | 10篇 |
1980年 | 12篇 |
1979年 | 10篇 |
1978年 | 14篇 |
1977年 | 9篇 |
1976年 | 7篇 |
1975年 | 2篇 |
排序方式: 共有8097条查询结果,搜索用时 244 毫秒
11.
12.
曾六川 《数学物理学报(A辑)》2002,22(1):99-106
该文研究Banach空间中一类强增生型变分包含解的存在性及其具误差的Ishikawa迭代程序的收敛性问题.该文结果是几位作者早期与最近的相应结果的改进和推广. 相似文献
13.
Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability. 相似文献
14.
The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed. 相似文献
15.
Johan Helsing 《BIT Numerical Mathematics》2006,46(2):307-323
A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come
from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating
distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar
to, or better than, those of a standard least squares approximate inverse preconditioner while its setup cost is only that
of a diagonal block approximate inverse preconditioner. Numerical experiments on iterative solutions of linear systems with
up to four million unknowns illustrate how the new preconditioner drastically outperforms standard approximate inverse preconditioners
of otherwise similar construction, and especially so when the preconditioners are very sparse.
AMS subject classification (2000) 65F10, 65R20, 65F35, 78A30 相似文献
16.
Tor Schoenmeyr David Yu Zhang 《Journal of Algorithms in Cognition, Informatics and Logic》2005,57(2):130-139
The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method. 相似文献
17.
The semi‐iterative method (SIM) is applied to the hyper‐power (HP) iteration, and necessary and sufficient conditions are given for the convergence of the semi‐iterative–hyper‐power (SIM–HP) iteration. The root convergence rate is computed for both the HP and SIM–HP methods, and the quotient convergence rate is given for the HP iteration. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
18.
We consider the problem of minimizing an SC1 function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm. 相似文献
19.
曾六川 《高等学校计算数学学报(英文版)》2003,12(1)
The purpose of this paper is to investigate the problem of approximating fixed points of non-Lipschitizian asymptotically pseudocontractive mappings in an arbitrary real Banach space by the modified Ishikawa iterative sequences with errors. 相似文献
20.
On the Application of the Auxiliary Problem Principle 总被引:6,自引:0,他引:6
The auxiliary problem principle (APP) derives from a general theory on decomposition-coordination methods establishing a comprehensive framework for both one-level and two-level methods. In this paper, the results of the two-level methods of APP are specialized for an efficient application to some engineering problems. 相似文献