全文获取类型
收费全文 | 10395篇 |
免费 | 867篇 |
国内免费 | 345篇 |
专业分类
化学 | 1440篇 |
晶体学 | 31篇 |
力学 | 1187篇 |
综合类 | 154篇 |
数学 | 6757篇 |
物理学 | 2038篇 |
出版年
2024年 | 23篇 |
2023年 | 112篇 |
2022年 | 354篇 |
2021年 | 356篇 |
2020年 | 220篇 |
2019年 | 236篇 |
2018年 | 260篇 |
2017年 | 348篇 |
2016年 | 344篇 |
2015年 | 253篇 |
2014年 | 500篇 |
2013年 | 588篇 |
2012年 | 646篇 |
2011年 | 513篇 |
2010年 | 489篇 |
2009年 | 592篇 |
2008年 | 607篇 |
2007年 | 638篇 |
2006年 | 521篇 |
2005年 | 456篇 |
2004年 | 376篇 |
2003年 | 337篇 |
2002年 | 312篇 |
2001年 | 287篇 |
2000年 | 282篇 |
1999年 | 206篇 |
1998年 | 218篇 |
1997年 | 197篇 |
1996年 | 151篇 |
1995年 | 170篇 |
1994年 | 138篇 |
1993年 | 113篇 |
1992年 | 104篇 |
1991年 | 87篇 |
1990年 | 76篇 |
1989年 | 66篇 |
1988年 | 49篇 |
1987年 | 40篇 |
1986年 | 39篇 |
1985年 | 54篇 |
1984年 | 53篇 |
1983年 | 14篇 |
1982年 | 23篇 |
1981年 | 22篇 |
1980年 | 18篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1957年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
131.
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. 相似文献
132.
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. 相似文献
133.
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. 相似文献
134.
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. 相似文献
135.
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. 相似文献
136.
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. 相似文献
137.
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. 相似文献
138.
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. 相似文献
139.
Glycosylations are notoriously difficult reactions that require extensive optimization regarding the type of anomeric leaving group, solvent, reaction temperature, and reaction time. Described is the use of a silicon‐based microreactor to screen reaction conditions and to scale‐up synthetic procedures. For the first time, glycosyl phosphates were employed in a microreactor. The optimized reaction conditions were successfully transferred to a batch process. 相似文献
140.
Exact rotamer optimization for protein design 总被引:1,自引:0,他引:1
Computational methods play a central role in the rational design of novel proteins. The present work describes a new hybrid exact rotamer optimization (HERO) method that builds on previous dead-end elimination algorithms to yield dramatic performance enhancements. Measured on experimentally validated physical models, these improvements make it possible to perform previously intractable designs of entire protein core, surface, or boundary regions. Computational demonstrations include a full core design of the variable domains of the light and heavy chains of catalytic antibody 48G7 FAB with 74 residues and 10(128) conformations, a full core/boundary design of the beta1 domain of protein G with 25 residues and 10(53) conformations, and a full surface design of the beta1 domain of protein G with 27 residues and 10(60) conformations. In addition, a full sequence design of the beta1 domain of protein G is used to demonstrate the strong dependence of algorithm performance on the exact form of the potential function and the fidelity of the rotamer library. These results emphasize that search algorithm performance for protein design can only be meaningfully evaluated on physical models that have been subjected to experimental scrutiny. The new algorithm greatly facilitates ongoing efforts to engineer increasingly complex protein features. 相似文献