全文获取类型
收费全文 | 3174篇 |
免费 | 488篇 |
国内免费 | 328篇 |
专业分类
化学 | 1381篇 |
晶体学 | 40篇 |
力学 | 213篇 |
综合类 | 41篇 |
数学 | 474篇 |
物理学 | 1841篇 |
出版年
2024年 | 15篇 |
2023年 | 40篇 |
2022年 | 144篇 |
2021年 | 110篇 |
2020年 | 114篇 |
2019年 | 102篇 |
2018年 | 96篇 |
2017年 | 118篇 |
2016年 | 140篇 |
2015年 | 105篇 |
2014年 | 168篇 |
2013年 | 253篇 |
2012年 | 177篇 |
2011年 | 210篇 |
2010年 | 163篇 |
2009年 | 165篇 |
2008年 | 204篇 |
2007年 | 227篇 |
2006年 | 134篇 |
2005年 | 143篇 |
2004年 | 123篇 |
2003年 | 136篇 |
2002年 | 132篇 |
2001年 | 107篇 |
2000年 | 97篇 |
1999年 | 73篇 |
1998年 | 84篇 |
1997年 | 63篇 |
1996年 | 56篇 |
1995年 | 52篇 |
1994年 | 47篇 |
1993年 | 42篇 |
1992年 | 32篇 |
1991年 | 18篇 |
1990年 | 21篇 |
1989年 | 21篇 |
1988年 | 11篇 |
1987年 | 9篇 |
1986年 | 5篇 |
1985年 | 7篇 |
1984年 | 3篇 |
1983年 | 3篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1976年 | 1篇 |
1974年 | 2篇 |
1971年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有3990条查询结果,搜索用时 9 毫秒
171.
We design a network that supports a feasible multicommodity flow even after the failures of any k edges. We present a mixed-integer linear program (MILP), a cutting plane algorithm, and a column-and-cut algorithm. The algorithms add constraints to repair vulnerabilities in partial network designs. Empirical studies on previously unsolved instances of SNDlib demonstrate their effectiveness. 相似文献
172.
In this paper we study the (k,c) – coloring problem, a generalization of the well known Vertex Coloring Problem (VCP). We propose a new formulation and compare it computationally with another formulation from the literature. We also develop a diving heuristic that provides with good quality results at a reasonable computational effort. 相似文献
173.
In this paper, the ‘source generation’ procedure (SGP) proposed by Hu and Wang [X.B. Hu, H.Y. Wang, Construction of dKP and BKP equation with self-consistent sources, Inverse Problems 22 (2006) 1903-1920] is utilized to derive Lie symmetries of bilinear soliton equations with self-consistent sources (SESCS) such as KPESCS, BKPESCS, and differential-difference KPESCS. Furthermore, it is shown that these Lie symmetries constitute generators of the corresponding Lie symmetry algebras. 相似文献
174.
A two-dimensional (2D) numerical model is developed for the wave simulation and propagation in a wave flume.The fluid flow is assumed to be viscous and incompressible,and the Navier-Stokes and continui... 相似文献
175.
软件Agent遇到语义二义性时无法正确地为用户解决矛盾问题.利用本体支持语义互操作的特点,在软件Agent策略生成机制中引入复合元本体,加入Agent智能引导的人机交互方法,实现了具有语义歧义消除能力的可拓策略生成系统.当用户输入的问题信息语义模糊时,Agent根据本体中的知识与用户交互,逐步理解用户的信息语义,直到能为用户生成解决矛盾问题的策略.以旅游与购物问题为例进行了实验,结果表明了软件Agent策略生成的语义互操作能力得到了提高. 相似文献
176.
Pawel J. Kalczynski 《European Journal of Operational Research》2012,216(3):679-686
This paper presents a new discrete approach to the price-based dynamic economic dispatch (PBDED) problem of fossil-fuel generators of electricity. The objective is to find a sequence of generator temperatures that maximizes profit over a fixed-length time horizon. The generic optimization model presented in this paper can be applied to automatic operation of fossil-fuel generators or to prepare market bids, and it works with various price forecasts. The model’s practical applications are demonstrated by the results of simulation experiments involving 2009 NYISO electricity market data, branch-and-bound, and tabu-search optimization techniques. 相似文献
177.
The long-term planning of electricity generation in a liberalised market using the Bloom and Gallant model can be posed as a quadratic programming (QP) problem with an exponential number of linear inequality constraints called load-matching constraints (LMCs) and several other linear non-LMCs. Direct solution methods are inefficient at handling such problems and a heuristic procedure has been devised to generate only those LMCs that are likely to be active at the optimiser. The problem is then solved as a finite succession of QP problems with an increasing, though still limited, number of LMCs, which can be solved efficiently using a direct method, as would be the case with a QP interior-point algorithm. Warm starting between successive QP solutions helps then in reducing the number of iterations necessary to reach the optimiser. 相似文献
178.
The Dantzig-Wolfe reformulation principle is presented based on the concept of generating sets. The use of generating sets allows for an easy extension to mixed integer programming. Moreover, it provides a unifying framework for viewing various column generation practices, such as relaxing or tightening the column generation subproblem and introducing stabilization techniques. 相似文献
179.
İbrahim Muter Ş. İlker BirbilKerem Bülbül Güvenç Şahin 《European Journal of Operational Research》2012
In their paper, Avella et al. (2006) investigate a time-constrained routing problem. The core of the proposed solution approach is a large-scale linear program that grows both row- and column-wise when new variables are introduced. Thus, a column-and-row generation algorithm is proposed to solve this linear program optimally, and an optimality condition is presented to terminate the column-and-row generation algorithm. We demonstrate by using Lagrangian duality that this optimality condition is incorrect and may lead to a suboptimal solution at termination. 相似文献
180.
We consider the application of Dantzig-Wolfe decomposition to stochastic integer programming problems arising in the capacity planning of electricity transmission networks that have some switchable transmission elements. The decomposition enables a column-generation algorithm to be applied, which allows the solution of large problem instances. The methodology is illustrated by its application to a problem of determining the optimal investment in switching equipment and transmission capacity for an existing network. Computational tests on IEEE test networks with 73 nodes and 118 nodes confirm the efficiency of the approach. 相似文献