全文获取类型
收费全文 | 22549篇 |
免费 | 1566篇 |
国内免费 | 1061篇 |
专业分类
化学 | 1487篇 |
晶体学 | 35篇 |
力学 | 1338篇 |
综合类 | 177篇 |
数学 | 6875篇 |
物理学 | 2206篇 |
综合类 | 13058篇 |
出版年
2024年 | 126篇 |
2023年 | 327篇 |
2022年 | 629篇 |
2021年 | 674篇 |
2020年 | 528篇 |
2019年 | 516篇 |
2018年 | 512篇 |
2017年 | 685篇 |
2016年 | 667篇 |
2015年 | 655篇 |
2014年 | 1188篇 |
2013年 | 1208篇 |
2012年 | 1434篇 |
2011年 | 1357篇 |
2010年 | 1077篇 |
2009年 | 1219篇 |
2008年 | 1194篇 |
2007年 | 1473篇 |
2006年 | 1262篇 |
2005年 | 1037篇 |
2004年 | 872篇 |
2003年 | 758篇 |
2002年 | 690篇 |
2001年 | 645篇 |
2000年 | 583篇 |
1999年 | 499篇 |
1998年 | 472篇 |
1997年 | 419篇 |
1996年 | 329篇 |
1995年 | 325篇 |
1994年 | 261篇 |
1993年 | 243篇 |
1992年 | 213篇 |
1991年 | 191篇 |
1990年 | 159篇 |
1989年 | 152篇 |
1988年 | 118篇 |
1987年 | 96篇 |
1986年 | 60篇 |
1985年 | 63篇 |
1984年 | 56篇 |
1983年 | 17篇 |
1982年 | 24篇 |
1981年 | 20篇 |
1980年 | 17篇 |
1979年 | 32篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1955年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
In this paper we propose a general integration scheme for a Multi-Criteria Decision Making model of the Multi-Attribute Utility
Theory in Constraint Programming. We introduce the Choquet integral as a general aggregation function for multi-criteria optimization
problems and define the Choquet global constraint that propagates this function during the Branch-and-Bound search. Finally the benefits of the propagation
of the Choquet constraint are evaluated on the examination timetabling problem. 相似文献
82.
We present a new verified optimization method to find regions for Hénon systems where the conditions of chaotic behaviour
hold. The present paper provides a methodology to verify chaos for certain mappings and regions. We discuss first how to check
the set theoretical conditions of a respective theorem in a reliable way by computer programs. Then we introduce optimization
problems that provide a model to locate chaotic regions. We prove the correctness of the underlying checking algorithms and
the optimization model. We have verified an earlier published chaotic region, and we also give new chaotic places located
by the new technique. 相似文献
83.
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 . 相似文献
84.
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 相似文献
85.
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. 相似文献
86.
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. 相似文献
87.
This paper describes the performance and simulation of a compact integrated optical processor for the real-time reconstruction of two-dimensional images in airborne stripmap synthetic aperture radar applications. The functional behavior of the processor is explained in some detail. The design criteria are briefly given. The simulation step allowed the main processor characteristics and properties to be identified. A number of comparisons were obtained in airborne SAR mission scenarios between the predictions of the optical device and those achieved by the modern electronic digital approach, based on the wavefront reconstruction method by matched filtering. 相似文献
88.
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. 相似文献
89.
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. 相似文献
90.
Silvia Vogel 《Annals of Operations Research》2006,142(1):269-282
The paper considers upper semicontinuous behavior in distribution of sequences of random closed sets. Semiconvergence in distribution
will be described via convergence in distribution of random variables with values in a suitable topological space. Convergence
statements for suitable functions of random sets are proved and the results are employed to derive stability statements for
random optimization problems where the objective function and the constraint set are approximated simultaneously.
The author is grateful to two anonymous referees for helpful suggestions. 相似文献