全文获取类型
收费全文 | 13261篇 |
免费 | 1204篇 |
国内免费 | 532篇 |
专业分类
化学 | 3323篇 |
晶体学 | 88篇 |
力学 | 1646篇 |
综合类 | 262篇 |
数学 | 7160篇 |
物理学 | 2518篇 |
出版年
2024年 | 29篇 |
2023年 | 135篇 |
2022年 | 303篇 |
2021年 | 491篇 |
2020年 | 359篇 |
2019年 | 336篇 |
2018年 | 338篇 |
2017年 | 475篇 |
2016年 | 506篇 |
2015年 | 362篇 |
2014年 | 627篇 |
2013年 | 937篇 |
2012年 | 777篇 |
2011年 | 618篇 |
2010年 | 593篇 |
2009年 | 712篇 |
2008年 | 702篇 |
2007年 | 797篇 |
2006年 | 642篇 |
2005年 | 586篇 |
2004年 | 476篇 |
2003年 | 475篇 |
2002年 | 407篇 |
2001年 | 358篇 |
2000年 | 359篇 |
1999年 | 275篇 |
1998年 | 281篇 |
1997年 | 280篇 |
1996年 | 225篇 |
1995年 | 245篇 |
1994年 | 202篇 |
1993年 | 171篇 |
1992年 | 139篇 |
1991年 | 111篇 |
1990年 | 95篇 |
1989年 | 79篇 |
1988年 | 57篇 |
1987年 | 46篇 |
1986年 | 45篇 |
1985年 | 64篇 |
1984年 | 54篇 |
1983年 | 15篇 |
1982年 | 30篇 |
1981年 | 21篇 |
1980年 | 23篇 |
1979年 | 35篇 |
1978年 | 25篇 |
1977年 | 33篇 |
1976年 | 21篇 |
1957年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 171 毫秒
101.
在利用Harris两参数公式研究Bohr-Mottelson转动谱公式参数之间的关系的基础上,改用Harris三参数公式,并由此提出了Bohr-Mottelson转动谱公式参数之间的新关系式,进而用I(I+1)四参数展开式计算了A~60,80,130,140,150,190区超形变偶偶核的基带和锕系和稀土区正常形变核基带,讨论了参数之间的关系,发现新关系式与实验较好地符合. 相似文献
102.
In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques. 相似文献
103.
A. Vukics H. Ritsch 《The European Physical Journal D - Atomic, Molecular, Optical and Plasma Physics》2007,44(3):585-599
We present a framework for efficiently performing Monte Carlo
wave-function simulations in cavity QED with moving particles. It
relies heavily on the object-oriented programming paradigm as realised
in C++, and is extensible and applicable for simulating open
interacting qua
ntum dynamics in general. The user is provided with a
number of “elements”, e.g. pumped moving particles, pumped lossy
cavity modes, and various interactions to compose complex interacting
systems, which contain several particles moving in electromagnetic
fields of various configurations, and perform wave-function
simulations on such systems. A number of tools are provided to
facilitate the implementation of new elements. 相似文献
104.
C. Bogani M. G. Gasparo A. Papini 《Journal of Optimization Theory and Applications》2007,134(1):47-59
We propose a pattern search method to solve a classical nonsmooth optimization problem. In a deep analogy with pattern search
methods for linear constrained optimization, the set of search directions at each iteration is defined in such a way that
it conforms to the local geometry of the set of points of nondifferentiability near the current iterate. This is crucial to
ensure convergence. The approach presented here can be extended to wider classes of nonsmooth optimization problems. Numerical
experiments seem to be encouraging.
This work was supported by M.U.R.S.T., Rome, Italy. 相似文献
105.
Adam B. Levy 《Mathematical Programming》2007,110(3):615-639
Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies
essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex
enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies
a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations)
cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods,
barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework
relies on addition and chain rules for constraint incorporation which we develop here. 相似文献
106.
Protein Conformation of a Lattice Model Using Tabu Search 总被引:1,自引:0,他引:1
We apply tabu search techniques to the problem of determining the optimal configuration of a chain of protein sequences on a cubic lattice. The problem under study is difficult to solve because of the large number of possible conformations and enormous amount of computations required. Tabu search is an iterative heuristic procedure which has been shown to be a remarkably effective method for solving combinatorial optimization problems. In this paper, an algorithm is designed for the cubic lattice model using tabu search. The algorithm has been tested on a chain of 27 monomers. Computational results show that our method outperforms previously reported approaches for the same model. 相似文献
107.
聚醚醚酮链结构与反应的模型化合物的量子化学研究 总被引:1,自引:1,他引:0
利用AM1方法对聚醚醚酮模型化合物全优化,结果为:芳环平均相互扭转角为33.0度,桥键角117.0-118.0度,其分子结构拓扑图形表明:所有苯环(核)为平面构型,但其内角扭曲;其氢原子对苯环构型无实质性贡献,在更长链的计算中,冻结苯核与氢原子也得出满意结果,根据Mulliken键序与电荷讨论了醚交换与磺化反应。 相似文献
108.
Youssef Saab 《Journal of Heuristics》1997,3(3):207-224
A heuristic optimization methodology, Dynamic Contraction (DC), is introduced as an approach for solving a wide variety of hard combinatorial problems. Contraction is an operation that maps an instance of a problem to a smaller instance of the same problem. DC is an iterative improvement strategy that relies on contraction as a mechanism for escaping local minima. As a byproduct of contraction, efficiency is improved due to a reduction of problem size. Effectiveness of DC is shown through simple applications to two classical combinatorial problems: The graph bisection problem and the traveling salesman problem. 相似文献
109.
Marco Marletta 《Advances in Computational Mathematics》1994,2(2):155-184
This paper discusses the numerical solution of eigenvalue problems for Hamiltonian systems of ordinary differential equations.
Two new codes are presented which incorporate the algorithms described here; to the best of the author’s knowledge, these
are the first codes capable of solving numerically such general eigenvalue problems. One of these implements a new new method
of solving a differential equation whose solution is a unitary matrix. Both codes are fully documented and are written inPfort-verifiedFortran 77, and will be available in netlib/aicm/sl11f and netlib/aicm/sl12f. 相似文献
110.
We consider the least squares approximation of gridded 2D data by tensor product splines with free knots. The smoothing functional to be minimized—a generalization of the univariate Schoenberg functional—is chosen in such a way that the solution of the bivariate problem separates into the solution of a sequence of univariate problems in case of fixed knots. The resulting optimization problem is a constrained separable least squares problem with tensor product structure. Based on some ideas developed by the authors for the univariate case, an efficient method for solving the specially structured 2D problem is proposed, analyzed and tested on hand of some examples from the literature. 相似文献