全文获取类型
收费全文 | 20103篇 |
免费 | 2103篇 |
国内免费 | 952篇 |
专业分类
化学 | 7114篇 |
晶体学 | 114篇 |
力学 | 2214篇 |
综合类 | 363篇 |
数学 | 8749篇 |
物理学 | 4604篇 |
出版年
2024年 | 47篇 |
2023年 | 247篇 |
2022年 | 774篇 |
2021年 | 770篇 |
2020年 | 729篇 |
2019年 | 572篇 |
2018年 | 552篇 |
2017年 | 748篇 |
2016年 | 838篇 |
2015年 | 672篇 |
2014年 | 1025篇 |
2013年 | 1312篇 |
2012年 | 1197篇 |
2011年 | 1015篇 |
2010年 | 917篇 |
2009年 | 1113篇 |
2008年 | 1069篇 |
2007年 | 1176篇 |
2006年 | 1006篇 |
2005年 | 889篇 |
2004年 | 739篇 |
2003年 | 702篇 |
2002年 | 596篇 |
2001年 | 507篇 |
2000年 | 510篇 |
1999年 | 385篇 |
1998年 | 413篇 |
1997年 | 367篇 |
1996年 | 297篇 |
1995年 | 326篇 |
1994年 | 268篇 |
1993年 | 224篇 |
1992年 | 183篇 |
1991年 | 142篇 |
1990年 | 124篇 |
1989年 | 100篇 |
1988年 | 68篇 |
1987年 | 60篇 |
1986年 | 58篇 |
1985年 | 88篇 |
1984年 | 70篇 |
1983年 | 20篇 |
1982年 | 38篇 |
1981年 | 23篇 |
1980年 | 27篇 |
1979年 | 44篇 |
1978年 | 25篇 |
1977年 | 35篇 |
1976年 | 24篇 |
1957年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
151.
In this paper we consider a class of systems described by singular integrodifferential equations. This type of systems appear, for example, in the modeling of certain aeroelastic control problems. We study these systems in frequency domain framework and show the existence of finite-dimensional stabilizing controllers. An algorithmic procedure is outlined for the construction of such controllers. In order to illustrate the numerical aspects of this algorithm, we present an example involving the classical Theodorsen model of an airfoil, which fits in the class of systems considered here.This work was supported in part by the National Science Foundation under Grants DMS-8907019 and MSS-9203418. 相似文献
152.
Summary A critical issue in drug discovery utilizing combinatorial chemistry as part of the discovery process is the choice of scaffolds to be used for a proper presentation, in a three-dimensional space, of the critical elements of structure necessary for molecular recognition (binding) and information transfer (agonist/ antagonist). In the case of polypeptide ligands, considerations related to the properties of various backbone structures (-helix, -sheets, etc.; , space) and those related to three-dimensional presentation of side-chain moieties (topography; (chi) space) must be addressed, although they often present quite different elements in the molecular recognition puzzle. We have addressed aspects of this problem by examining the three-dimensional structures of chemically different scaffolds at various distances from the scaffold to evaluate their putative diversity. We find that chemically diverse scaffolds can readily become topographically similar. We suggest a topographical approach involving design in chi space to deal with these problems. 相似文献
153.
The linear ordering problem is an NP-hard combinatorial problem with a large number of applications. Contrary to another very popular problem from the same category, the traveling salesman problem, relatively little space in the literature has been devoted to the linear ordering problem so far. This is particularly true for the question of developing good heuristic algorithms solving this problem.In the paper we propose a new heuristic algorithm solving the linear ordering problem. In this algorithm we made use of the sorting through insertion pattern as well as of the operation of permutation reversal. The surprisingly positive effect of the reversal operation, justified in part theoretically and confirmed in computational examples, seems to be the result of a unique property of the problem, called in the paper the symmetry of the linear ordering problem. This property consists in the fact that if a given permutation is an optimal solution of the problem with the criterion function being maximized, then the reversed permutation is a solution of the problem with the same criterion function being minimized. 相似文献
154.
We show that an ε-approximate solution of the cost-constrainedK-commodity flow problem on anN-nodeM-arc network,G can be computed by sequentially solving O(K(? ?2+logGK) logGM log (G? ?1 GK)) single-commodity minimum-cost flow problems on the same network. In particular, an approximate minimum-cost multicommodity flow can be computed in $\tilde O$ (G? ?2 GKNM) running time, where the notation Õ(·) means “up to logarithmic factors”. This result improves the time bound mentioned by Grigoriadis and Khachiyan [4] by a factor ofM/N and that developed more recently by Karger and Plotkin [8] by a factor of? ?1. We also provide a simple $\tilde O$ (NM)-time algorithm for single-commodity budget-constrained minimum-cost flows which is $\tilde O$ (? ?3) times faster than the algorithm developed in the latter paper. 相似文献
155.
In this paper, we present a general scheme for bundle-type algorithms which includes a nonmonotone line search procedure and for which global convergence can be proved. Some numerical examples are reported, showing that the nonmonotonicity can be beneficial from a computational point of view.This work was partially supported by the National Research Program on Metodi di ottimizzazione per le decisioni, Ministero dell' Universitá e della Ricerca Scientifica e Tecnologica and by ASI: Agenzia Spaziale Italiana. 相似文献
156.
We prove that the-optimal solutions of convex optimization problems are Lipschitz continuous with respect to data perturbations when these are measured in terms of the epi-distance. A similar property is obtained for the distance between the level sets of extended real valued functions. We also show that these properties imply that the-subgradient mapping is Lipschitz continuous.Research supported in part by the National Science Foundation and the Air Force Office of Scientific Research. 相似文献
157.
Since Dantzig—Wolfe's pioneering contribution, the decomposition approach using a pricing mechanism has been developed for a wide class of mathematical programs. For convex programs a linear space of Lagrangean multipliers is enough to define price functions. For general mathematical programs the price functions could be defined by using a subclass of nondecreasing functions. However the space of nondecreasing functions is no longer finite dimensional. In this paper we consider a specific nonconvex optimization problem min {f(x):h
j
(x)g(x),j=1, ,m, xX}, wheref(·),h
j
(·) andg(·) are finite convex functions andX is a closed convex set. We generalize optimal price functions for this problem in such a way that the parameters of generalized price functions are defined in a finite dimensional space. Combining convex duality and a nonconvex duality we can develop a decomposition method to find a globally optimal solution.This paper is dedicated to Phil Wolfe on the occasion of his 65th birthday. 相似文献
158.
A smooth method for the finite minimax problem 总被引:2,自引:0,他引:2
We consider unconstrained minimax problems where the objective function is the maximum of a finite number of smooth functions. We prove that, under usual assumptions, it is possible to construct a continuously differentiable function, whose minimizers yield the minimizers of the max function and the corresponding minimum values. On this basis, we can define implementable algorithms for the solution of the minimax problem, which are globally convergent at a superlinear convergence rate. Preliminary numerical results are reported.This research was partially supported by the National Research Program on Metodi di ottimizzazione per le decisioni, Ministero dell'Università e della Ricerca Scientifica e Tecnologica, Italy. 相似文献
159.
S. K. Zavriev 《Journal of Global Optimization》1993,3(1):67-78
The paper is devoted to the convergence properties of finite-difference local descent algorithms in global optimization problems with a special -convex structure. It is assumed that the objective function can be closely approximated by some smooth convex function. Stability properties of the perturbed gradient descent and coordinate descent methods are investigated. Basing on this results some global optimization properties of finite-difference local descent algorithms, in particular, coordinate descent method, are discovered. These properties are not inherent in methods using exact gradients.The paper was presented at the II. IIASA-Workshop on Global Optimization, Sopron (Hungary), December 9–14, 1990. 相似文献
160.
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm 总被引:9,自引:0,他引:9
V. Černý 《Journal of Optimization Theory and Applications》1985,45(1):41-51
We present a Monte Carlo algorithm to find approximate solutions of the traveling salesman problem. The algorithm generates randomly the permutations of the stations of the traveling salesman trip, with probability depending on the length of the corresponding route. Reasoning by analogy with statistical thermodynamics, we use the probability given by the Boltzmann-Gibbs distribution. Surprisingly enough, using this simple algorithm, one can get very close to the optimal solution of the problem or even find the true optimum. We demonstrate this on several examples.We conjecture that the analogy with thermodynamics can offer a new insight into optimization problems and can suggest efficient algorithms for solving them.The author acknowledges stimulating discussions with J. Piút concerning the main ideas of the present paper. The author is also indebted to P. Brunovský, J. erný, M. Hamala, . Peko, . Znám, and R. Zajac for useful comments. 相似文献