全文获取类型
收费全文 | 8240篇 |
免费 | 318篇 |
国内免费 | 142篇 |
专业分类
化学 | 169篇 |
晶体学 | 1篇 |
力学 | 214篇 |
综合类 | 66篇 |
数学 | 6921篇 |
物理学 | 185篇 |
无线电 | 1144篇 |
出版年
2023年 | 35篇 |
2022年 | 71篇 |
2021年 | 91篇 |
2020年 | 97篇 |
2019年 | 113篇 |
2018年 | 117篇 |
2017年 | 154篇 |
2016年 | 152篇 |
2015年 | 142篇 |
2014年 | 373篇 |
2013年 | 376篇 |
2012年 | 471篇 |
2011年 | 352篇 |
2010年 | 356篇 |
2009年 | 493篇 |
2008年 | 514篇 |
2007年 | 565篇 |
2006年 | 380篇 |
2005年 | 347篇 |
2004年 | 278篇 |
2003年 | 261篇 |
2002年 | 253篇 |
2001年 | 231篇 |
2000年 | 229篇 |
1999年 | 193篇 |
1998年 | 170篇 |
1997年 | 148篇 |
1996年 | 185篇 |
1995年 | 179篇 |
1994年 | 119篇 |
1993年 | 129篇 |
1992年 | 129篇 |
1991年 | 117篇 |
1990年 | 93篇 |
1989年 | 64篇 |
1988年 | 84篇 |
1987年 | 53篇 |
1986年 | 79篇 |
1985年 | 108篇 |
1984年 | 75篇 |
1983年 | 23篇 |
1982年 | 46篇 |
1981年 | 37篇 |
1980年 | 33篇 |
1979年 | 26篇 |
1978年 | 47篇 |
1977年 | 46篇 |
1976年 | 26篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有8700条查询结果,搜索用时 15 毫秒
101.
Zhao-Long Hu Zhesi Shen Chang-Bing Tang Bin-Bin Xie Jian-Feng Lu 《Physics letters. A》2018,382(14):931-937
Locating sources in a large network is of paramount importance to reduce the spreading of disruptive behavior. Based on the backward diffusion-based method and integer programming, we propose an efficient approach to locate sources in complex networks with limited observers. The results on model networks and empirical networks demonstrate that, for a certain fraction of observers, the accuracy of our method for source localization will improve as the increase of network size. Besides, compared with the previous method (the maximum–minimum method), the performance of our method is much better with a small fraction of observers, especially in heterogeneous networks. Furthermore, our method is more robust against noise environments and strategies of choosing observers. 相似文献
102.
In several applications, underestimation of functions has proven to be a helpful tool for global optimization. In protein–ligand
docking problems as well as in protein structure prediction, single convex quadratic underestimators have been used to approximate
the location of the global minimum point. While this approach has been successful for basin-shaped functions, it is not suitable
for energy functions with more than one distinct local minimum with a large magnitude. Such functions may contain several
basin-shaped components and, thus, cannot be underfitted by a single convex underestimator. In this paper, we propose using
an underestimator composed of several negative Gaussian functions. Such an underestimator can be computed by solving a nonlinear
programming problem, which minimizes the error between the data points and the underestimator in the L
1 norm. Numerical results for simulated and actual docking energy functions are presented. 相似文献
103.
We investigate the quality of solutions obtained from sample-average approximations to two-stage stochastic linear programs
with recourse. We use a recently developed software tool executing on a computational grid to solve many large instances of
these problems, allowing us to obtain high-quality solutions and to verify optimality and near-optimality of the computed
solutions in various ways.
Research supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced
Scientific Computing Research, U.S. Department of Energy, under Contract W-31-109-Eng-38, and by the National Science Foundation
under Grant 9726385.
Research supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced
Scientific Computing Research, U.S. Department of Energy, under Contract W-31-109-Eng-38, and by the National Science Foundation
under Grant DMS-0073770.
Research supported by the Mathematical, Information, and Computational Sciences Division subprogram of the Office of Advanced
Scientific Computing Research, U.S. Department of Energy, under Contract W-31-109-Eng-38, and by the National Science Foundation
under Grants 9726385 and 0082065. 相似文献
104.
Bahram Alidaee Fred Glover Gary Kochenberger Haibo Wang 《European Journal of Operational Research》2007
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience reported in the literature with several problem classes has demonstrated that this approach works surprisingly well in terms of solution quality and computational times, often rivaling and sometimes surpassing more traditional methods. In this paper we report on the application of UQP to the maximum edge-weighted clique problem. Computational experience is reported illustrating the attractiveness of the approach. 相似文献
105.
本文应用灰色系统理论和方法,把动态Leontief投入产出模型和线性规划结合起来,建立一种灰色动态投入产出优化模型,在山东省农业经济发展规划定量研究中,应用该模型取得比较满意的结果. 相似文献
106.
Wiesława T. Obuchowska 《Computational Optimization and Applications》2004,29(1):69-90
In this paper we analyze properties of the analytic centers for perturbed convex problems. In particular we study the continuity of convex regions with respect to such characteristics as boundedness, full dimensionality and the existence of an analytic centre. Furthermore, we state the necessary and sufficient conditions for the existence of the analytic centre for possibly unbounded regions and we show that the analytic centre is identical for any minimal representation of the convex set. We are also concerned with the limiting behaviour of the central path as it approaches the set of optimal solutions of the problem. 相似文献
107.
In this article, approximate solutions of multi-objective optimization problems are analysed. The notion of approximate solution suggested by Kutateladze is dealt with, and, utilizing different scalarization approaches, some necessary and sufficient conditions for ?-(strong, weak, proper) efficiency are provided. Almost all of the provided results are established without any convexity assumption. 相似文献
108.
An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints 总被引:1,自引:0,他引:1
S. Armagan Tarim Mustafa K. Dogˇru Ula? Özen Roberto Rossi 《European Journal of Operational Research》2011,215(3):563-571
We provide an efficient computational approach to solve the mixed integer programming (MIP) model developed by Tarim and Kingsman [8] for solving a stochastic lot-sizing problem with service level constraints under the static-dynamic uncertainty strategy. The effectiveness of the proposed method hinges on three novelties: (i) the proposed relaxation is computationally efficient and provides an optimal solution most of the time, (ii) if the relaxation produces an infeasible solution, then this solution yields a tight lower bound for the optimal cost, and (iii) it can be modified easily to obtain a feasible solution, which yields an upper bound. In case of infeasibility, the relaxation approach is implemented at each node of the search tree in a branch-and-bound procedure to efficiently search for an optimal solution. Extensive numerical tests show that our method dominates the MIP solution approach and can handle real-life size problems in trivial time. 相似文献
109.
Alain Billionnet 《Applied Mathematical Modelling》2012,36(5):2213-2223
We consider a landscape divided into elementary cells, each of these cells containing some species to be protected. We search to select a set of cells to form a natural reserve in order to protect all the species present in the landscape. A species is considered protected if it is present in a certain number of cells of the reserve. There is an important spatial constraint concerning the set of selected cells: a species must be able to go from any cell to any cell without leaving the reserve. An integer linear programming model was proposed by Önal and Briers [2] for this reserve selection problem, but the size of the problems which can be handled by this model is limited: several hours of computation are required for solving instances with hundred of cells and hundred of species. Having proposed an improvement of this model which reduces appreciably the computation time, we propose another integer linear programming model, easy to carry out, which allows to obtain, in a few seconds of computation, optimal or near-optimal solutions for instances with hundred of cells and hundred of species. However, the computation time becomes prohibitive for instances with more than 200 cells and 100 species. But, this approach can be particularly useful to solve the problem, in an approximate way, by aggregation of cells as proposed by Önal and Briers [2]. 相似文献
110.
《Optimization》2012,61(2):401-421
Abstract We study the efficient set X E for a multiple objective linear program by using its projection into the linear space L spanned by the independent criteria. We show that in the orthogonally complementary space of L, the efficient points form a polyhedron, while in L an efficiency-equivalent polyhedron for the projection P(X E ) of X E can be constructed by algorithms of outer and inner approximation types. These algorithms can be also used for generating all extreme points of P(X E ). Application to optimization over the efficient set for a multiple objective linear program is considered. 相似文献