全文获取类型
收费全文 | 15744篇 |
免费 | 1594篇 |
国内免费 | 452篇 |
专业分类
化学 | 1490篇 |
晶体学 | 98篇 |
力学 | 3654篇 |
综合类 | 223篇 |
数学 | 8360篇 |
物理学 | 3965篇 |
出版年
2024年 | 19篇 |
2023年 | 140篇 |
2022年 | 285篇 |
2021年 | 466篇 |
2020年 | 357篇 |
2019年 | 333篇 |
2018年 | 359篇 |
2017年 | 495篇 |
2016年 | 465篇 |
2015年 | 373篇 |
2014年 | 665篇 |
2013年 | 917篇 |
2012年 | 927篇 |
2011年 | 843篇 |
2010年 | 716篇 |
2009年 | 891篇 |
2008年 | 915篇 |
2007年 | 1007篇 |
2006年 | 925篇 |
2005年 | 799篇 |
2004年 | 629篇 |
2003年 | 620篇 |
2002年 | 561篇 |
2001年 | 518篇 |
2000年 | 476篇 |
1999年 | 388篇 |
1998年 | 368篇 |
1997年 | 335篇 |
1996年 | 245篇 |
1995年 | 261篇 |
1994年 | 216篇 |
1993年 | 176篇 |
1992年 | 160篇 |
1991年 | 131篇 |
1990年 | 121篇 |
1989年 | 80篇 |
1988年 | 63篇 |
1987年 | 67篇 |
1986年 | 62篇 |
1985年 | 76篇 |
1984年 | 65篇 |
1983年 | 23篇 |
1982年 | 34篇 |
1981年 | 25篇 |
1980年 | 24篇 |
1979年 | 37篇 |
1978年 | 32篇 |
1977年 | 37篇 |
1976年 | 29篇 |
1957年 | 8篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
91.
Dmitry I. Belov Ronald D. Armstrong 《Computational Optimization and Applications》2006,33(2-3):319-332
This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection
of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems
(MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate
lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including
combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented.
An erratum to this article is available at . 相似文献
92.
Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically
by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually
employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be
“close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence
many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report
results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process
can be improved to better reflect the actual properties sought.
In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend
themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms
of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling
approach may possibly lead to algorithms with improved efficiency.
AMS subject classification (2000) 65L05, 65M32, 65N21, 65N22, 65D18 相似文献
93.
Quantitative H–Al distances in acid sites of two zeolites with MFI and IFR framework topology were obtained by numerical simulation of 1H{27Al} rotational echo adiabatic passage double resonance (REAPDOR) experiments. A 27Al offset-dependent data set yields for each resolved 1H NMR line a corresponding nuclear electric quadrupole coupling constant of the neighboring 27Al site. This information is used for analyzing a second data set for on-resonance irradiation, where the dipolar evolution time (number of rotor cycles) was varied, to yield the 1H–27Al dipolar coupling constant. Numerical simulations indicate that the REAPDOR method does not depend significantly on the polar angles, defining the orientation of the electric field gradient tensor of 27Al with respect to the Al–H dipolar vector. In contrast, the transfer of populations in double resonance sequence is sensitive to these angles, and it can be thus used to measure them. 相似文献
94.
95.
Regina S. Burachik Rafail N. Gasimov Nergiz A. Ismayilova C. Yalçin. Kaya 《Journal of Global Optimization》2006,34(1):55-78
We study convergence properties of a modified subgradient algorithm, applied to the dual problem defined by the sharp augmented
Lagrangian. The primal problem we consider is nonconvex and nondifferentiable, with equality constraints. We obtain primal
and dual convergence results, as well as a condition for existence of a dual solution. Using a practical selection of the
step-size parameters, we demonstrate the algorithm and its advantages on test problems, including an integer programming and
an optimal control problem.
*Partially Supported by 2003 UniSA ITEE Small Research Grant Ero2.
Supported by CAPES, Brazil, Grant No. 0664-02/2, during her visit to the School of Mathematics and Statistics, UniSA. 相似文献
96.
In this paper, nonconvex multiobjective optimization problems are studied. New characterizations of a properly efficient solution in the sense of Geoffrion's are established in terms of the stability of one scalar optimization problem and the existence of an exact penalty function of a scalar constrained program, respectively. One of the characterizations is applied to derive necessary conditions for a properly efficient control-parameter pair of a nonconvex multiobjective discrete optimal control problem with linear constraints. 相似文献
97.
S. P. Popov 《Computational Mathematics and Mathematical Physics》2006,46(6):983-994
Numerical solutions to three systems of integrable evolutionary equations from the Toda lattice hierarchy are analyzed. These are the classical Toda lattice, the second local dispersive flow, and the second extended dispersive flow. Special attention is given to the properties of soliton solutions. For the equations of the second local flow, two types of solitons interacting in a special manner are found. Solutions corresponding to various initial data are qualitatively outlined. 相似文献
98.
This paper proposes a new method that extends the efficient global optimization to address stochastic black-box systems. The
method is based on a kriging meta-model that provides a global prediction of the objective values and a measure of prediction
uncertainty at every point. The criterion for the infill sample selection is an augmented expected improvement function with
desirable properties for stochastic responses. The method is empirically compared with the revised simplex search, the simultaneous
perturbation stochastic approximation, and the DIRECT methods using six test problems from the literature. An application
case study on an inventory system is also documented. The results suggest that the proposed method has excellent consistency
and efficiency in finding global optimal solutions, and is particularly useful for expensive systems. 相似文献
99.
M. A. Posypkin I. Kh. Sigal 《Computational Mathematics and Mathematical Physics》2006,46(12):2187-2202
The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered. 相似文献
100.
A. V. Kel’manov L. V. Mikhailova 《Computational Mathematics and Mathematical Physics》2006,46(1):165-181
The problem of joint a posteriori detection of reference fragments in a quasi-periodic sequence and its partition into segments containing series of recurring fragments from the reference tuple is solved. It is assumed that (i) an ordered reference tuple of sequences to be detected is given, (ii) the number of desired fragments is known, (iii) the index of the sequence term corresponding to the beginning of a fragment is a deterministic (not random) value, and (iv) a sequence distorted by an additive uncorrelated Gaussian noise is available for observation. It is established that the problem consists in testing a set of hypotheses about the mean of a random Gaussian vector. The cardinality of the set grows exponentially as the vector dimension (i.e., the sequence length) increases. An efficient a posteriori algorithm producing a maximum-likelihood optimal solution to the problem is substantiated. Time and space complexity bounds related to the parameters of the problem are derived. The results of numerical simulation are presented. 相似文献