全文获取类型
收费全文 | 10904篇 |
免费 | 774篇 |
国内免费 | 343篇 |
专业分类
化学 | 1339篇 |
晶体学 | 31篇 |
力学 | 1112篇 |
综合类 | 152篇 |
数学 | 7796篇 |
物理学 | 1591篇 |
出版年
2024年 | 25篇 |
2023年 | 109篇 |
2022年 | 347篇 |
2021年 | 344篇 |
2020年 | 224篇 |
2019年 | 247篇 |
2018年 | 262篇 |
2017年 | 347篇 |
2016年 | 330篇 |
2015年 | 247篇 |
2014年 | 496篇 |
2013年 | 647篇 |
2012年 | 637篇 |
2011年 | 502篇 |
2010年 | 481篇 |
2009年 | 603篇 |
2008年 | 625篇 |
2007年 | 666篇 |
2006年 | 543篇 |
2005年 | 481篇 |
2004年 | 376篇 |
2003年 | 348篇 |
2002年 | 330篇 |
2001年 | 300篇 |
2000年 | 296篇 |
1999年 | 219篇 |
1998年 | 246篇 |
1997年 | 216篇 |
1996年 | 150篇 |
1995年 | 169篇 |
1994年 | 149篇 |
1993年 | 122篇 |
1992年 | 107篇 |
1991年 | 94篇 |
1990年 | 91篇 |
1989年 | 70篇 |
1988年 | 51篇 |
1987年 | 52篇 |
1986年 | 42篇 |
1985年 | 64篇 |
1984年 | 60篇 |
1983年 | 23篇 |
1982年 | 40篇 |
1981年 | 30篇 |
1980年 | 33篇 |
1979年 | 47篇 |
1978年 | 30篇 |
1977年 | 42篇 |
1976年 | 31篇 |
1974年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
961.
N. Chakraborti B. Siva Kumar V. Satish Babu S. Moitra A. Mukhopadhyay 《Applied Mathematical Modelling》2008
A new genetic algorithms based multi-objective optimization algorithm (NMGA) has been developed during study. It works on a neighborhood concept in the functional space, utilizes the ideas on weak dominance and ranking and uses its own procedures for population sizing. The algorithm was successfully tested with some standard test functions, and when applied to a real-life data of the hot-rolling campaign of an integrated steel plant, it outperformed another recently developed multi-objective evolutionary algorithm. 相似文献
962.
In this paper we propose a reduced vertex result for the robust solution of uncertain semidefinite optimization problems subject
to interval uncertainty. If the number of decision variables is m and the size of the coefficient matrices in the linear matrix inequality constraints is n×n, a direct vertex approach would require satisfaction of 2
n(m+1)(n+1)/2 vertex constraints: a huge number, even for small values of n and m. The conditions derived here are instead based on the introduction of m slack variables and a subset of vertex coefficient matrices of cardinality 2
n−1, thus reducing the problem to a practically manageable size, at least for small n. A similar size reduction is also obtained for a class of problems with affinely dependent interval uncertainty.
This work is supported by MIUR under the FIRB project “Learning, Randomization and Guaranteed Predictive Inference for Complex
Uncertain Systems,” and by CNR RSTL funds. 相似文献
963.
Dennis Kretschmann Dirk Schlingemann Reinhard F. Werner 《Journal of Functional Analysis》2008,255(8):1889-1904
We show a continuity theorem for Stinespring's dilation: two completely positive maps between arbitrary C∗-algebras are close in cb-norm if and only if we can find corresponding dilations that are close in operator norm. The proof establishes the equivalence of the cb-norm distance and the Bures distance for completely positive maps. We briefly discuss applications to quantum information theory. 相似文献
964.
965.
本文给出了一种求解波动方程反演问题的“多目标函数法”.这种方法简单、有效,并具有明确的物理意义.对于三维问题的程序化它有很强的优越性. 相似文献
966.
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint described by a separable convex function. Applications are abundant, and vary from equilibrium problems in the engineering and economic sciences, through resource allocation and balancing problems in manufacturing, statistics, military operations research and production and financial economics, to subproblems in algorithms for a variety of more complex optimization models. This paper surveys the history and applications of the problem, as well as algorithmic approaches to its solution. The most common techniques are based on finding the optimal value of the Lagrange multiplier for the explicit constraint, most often through the use of a type of line search procedure. We analyze the most relevant references, especially regarding their originality and numerical findings, summarizing with remarks on possible extensions and future research. 相似文献
967.
We study a CUSUM–type monitoring scheme designed to sequentially detect changes in the regression parameter of an underlying
linear model. The test statistic used is based on recursive residuals. Main aim of this paper is to derive the limiting extreme
value distribution under the null hypothesis of structural stability. The model assumptions are flexible enough to include
rather general classes of error sequences such as augmented GARCH(1,1) processes. The result is underlined by an illustrative
simulation study.
Research partially supported by NSF grants DMS–0604670 and DMS–065242. 相似文献
968.
This paper introduces a novel niching scheme called the q-nearest neighbors replacement (q-NNR) method in the framework of the steady-state GAs (SSGAs) for solving binary multimodal optimization problems. A detailed
comparison of the main niching approaches are presented first. The niching paradigm and difference of the selection-recombination
genetic algorithms (GAs) and the recombination-replacement SSGAs are discussed. Then the q-NNR is developed by adopting special replacement policies based on the SSGAs; a Boltzmann scheme for dynamically sizing the
nearest neighbors set is designed to achieve a speed-up and control the proportion of individuals adapted to different niches.
Finally, experiments are carried out on a set of test functions characterized by deception, epistasis, symmetry and multimodality.
The results are satisfactory and illustrate the effectivity and efficiency of the proposed niching method. 相似文献
969.
This paper describes recent experience in tackling large nonlinear integer programming problems using the MINOS large-scale optimization software. A technique is presented for extending the constrained search approach used in MINOS to exploring integer-feasible solutions once a continuous optimal solution is obtained. Computational experience with this approach is described for two classes of problems: quadratic assignment problems and pipeline network design problems. 相似文献
970.
Queues of tow/barges form when a river lock is rendered inoperable due to lock malfunction, a tow/barge accident or adverse lock operating conditions. In this paper, we develop model formulations that allow the queue to be cleared using a number of differing objectives. Of particular interest is the presence of different setup times between successive passages of tow/barges through the lock. Dependent on the objective chosen, we are able to show that certain ordering protocols may be used to markedly reduce the sequencing search space for N tow/barges from the order of N! to 2N. We present accompanying linear and nonlinear integer programming formulations and carry out computational experiments on a representative set of problems. 相似文献