全文获取类型
收费全文 | 13502篇 |
免费 | 1515篇 |
国内免费 | 395篇 |
专业分类
化学 | 1288篇 |
晶体学 | 28篇 |
力学 | 1078篇 |
综合类 | 150篇 |
数学 | 6738篇 |
物理学 | 1498篇 |
无线电 | 4632篇 |
出版年
2024年 | 40篇 |
2023年 | 202篇 |
2022年 | 350篇 |
2021年 | 470篇 |
2020年 | 378篇 |
2019年 | 362篇 |
2018年 | 361篇 |
2017年 | 500篇 |
2016年 | 543篇 |
2015年 | 482篇 |
2014年 | 831篇 |
2013年 | 856篇 |
2012年 | 967篇 |
2011年 | 833篇 |
2010年 | 639篇 |
2009年 | 768篇 |
2008年 | 788篇 |
2007年 | 827篇 |
2006年 | 669篇 |
2005年 | 594篇 |
2004年 | 443篇 |
2003年 | 421篇 |
2002年 | 373篇 |
2001年 | 339篇 |
2000年 | 304篇 |
1999年 | 231篇 |
1998年 | 254篇 |
1997年 | 216篇 |
1996年 | 156篇 |
1995年 | 172篇 |
1994年 | 142篇 |
1993年 | 132篇 |
1992年 | 109篇 |
1991年 | 89篇 |
1990年 | 76篇 |
1989年 | 63篇 |
1988年 | 50篇 |
1987年 | 41篇 |
1986年 | 38篇 |
1985年 | 57篇 |
1984年 | 52篇 |
1983年 | 15篇 |
1982年 | 22篇 |
1981年 | 20篇 |
1980年 | 18篇 |
1979年 | 31篇 |
1978年 | 20篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 140 毫秒
881.
This paper presents techniques for solving the problem of minimizing investment costs on an existing gas transportation network. The goal of this program is to find, first, the optimal location of pipeline segments to be reinforced and, second, the optimal sizes (among a discrete commercial list of diameters) under the constraint of satisfaction of demands with high enough pressure for all users. 相似文献
882.
M. Durea 《Journal of Mathematical Analysis and Applications》2008,348(2):589-606
The aim of this paper is to point out some sufficient constraint qualification conditions ensuring the boundedness of a set of Lagrange multipliers for vectorial optimization problems in infinite dimension. In some (smooth) cases these conditions turn out to be necessary for the existence of multipliers as well. 相似文献
883.
Vincent Kelner Florin Capitanescu Olivier Léonard Louis Wehenkel 《Journal of Computational and Applied Mathematics》2008
Evolutionary algorithms are robust and powerful global optimization techniques for solving large-scale problems that have many local optima. However, they require high CPU times, and they are very poor in terms of convergence performance. On the other hand, local search algorithms can converge in a few iterations but lack a global perspective. The combination of global and local search procedures should offer the advantages of both optimization methods while offsetting their disadvantages. This paper proposes a new hybrid optimization technique that merges a genetic algorithm with a local search strategy based on the interior point method. The efficiency of this hybrid approach is demonstrated by solving a constrained multi-objective mathematical test-case. 相似文献
884.
Current technological possibilities for implementing multi-service networks include both single technology ATM or IP networks and multi-technology networks such as SONET-based or flat networks. However, regardless of the technology employed, the synthesis problem – to optimally route traffic and divide the network's transmission resources between its virtual links – remains of prime importance.In this paper, we review, compare, and classify the extensive recent literature concerning multi-service network synthesis methods. In order to do this, we propose a typology based on switching and control strategies and a general notation that reflects the layered nature of the network. Technology independent mathematical models describe the various, essentially different, approaches presently found in the literature. 相似文献
885.
Flat-rate charging of telecommunication networks does not seem relevant anymore as it creates congestion (like in the Internet). Among usage-based charging schemes, auctionning for bandwidth looks very promising. We review here the tremendous work called progressive second price auction and give some new results about users' behaviour in order to prove the results published in the literature. 相似文献
886.
A stochastic model is developed describing a service system subject to inhomogeneous Poisson interruptions with age dependent interruption periods. By studying the probabilistic flow of the underlying multivariate Markov process, the Laplace transform of the effective service time is explicitly obtained. For general renewal interruptions, only the expected effective service time is derived. As an application, an optimal checkpoint policy is examined for database management. It is shown that an optimal policy maximizing the ergodic availability of the database is to implement a checkpoint as soon as the cumulative uptime of the database reaches a prespecified constantk
*. A computational procedure is then developed for findingk
* and numerical results are exhibited.This work was supported in part by the National Science Foundation under Grant No. ECS-8600992 and by the IBM Program of Support for Education in the Management of Information Systems. 相似文献
887.
O. Briant C. Lemaréchal Ph. Meurdesoif S. Michel N. Perrot F. Vanderbeck 《Mathematical Programming》2008,113(2):299-344
When a column generation approach is applied to decomposable mixed integer programming problems, it is standard to formulate
and solve the master problem as a linear program. Seen in the dual space, this results in the algorithm known in the nonlinear
programming community as the cutting-plane algorithm of Kelley and Cheney-Goldstein. However, more stable methods with better
theoretical convergence rates are known and have been used as alternatives to this standard. One of them is the bundle method;
our aim is to illustrate its differences with Kelley’s method. In the process we review alternative stabilization techniques
used in column generation, comparing them from both primal and dual points of view. Numerical comparisons are presented for
five applications: cutting stock (which includes bin packing), vertex coloring, capacitated vehicle routing, multi-item lot
sizing, and traveling salesman. We also give a sketchy comparison with the volume algorithm.
This research has been supported by Inria New Investigation Grant “Convex Optimization and Dantzig-Wolfe Decomposition”. 相似文献
888.
We present a geometrical interpretation of the weighting method for constrained (finite dimensional) vector optimization.
This approach is based on rigid movements which separate the image set from the negative of the ordering cone. We study conditions
on the existence of such translations in terms of the boundedness of the scalar problems produced by the weighting method.
Finally, using recession cones, we obtain the main result of our work: a sufficient condition under which weighting vectors
yield solvable scalar problems.
An erratum to this article can be found at 相似文献
889.
In this paper a control strategy is formulated that minimizes the costs for a single chemical cleaning of a dead-end ultra filtration membrane. From the process model, the performance index and the constraints it can be derived that dynamic optimization will lead to a ‘maximum effort control problem’, in which the controls (cleaning flow and cleaning agent concentration) are either zero or maximum. The change from maximum to zero is called the switching point. This switching point depends on the overall cleaning time and the requested cleaning effectiveness. From the calculated optimal control strategy it follows that cleaning time can be significantly reduced, compared to conventional cleaning. 相似文献
890.
S. Nobakhtian 《Journal of Optimization Theory and Applications》2008,136(1):61-68
A mixed-type dual for a nonsmooth multiobjective optimization problem with inequality and equality constraints is formulated.
We obtain weak and strong duality theorems for a mixed-type dual without requiring the regularity assumptions and the nonnegativeness
of the Lagrange multipliers associated to the equality constraints. We apply also a nonsmooth constraint qualification for
multiobjective programming to establish strong duality results. In this case, our constraint qualification assures the existence
of positive Lagrange multipliers associated with the vector-valued objective function.
This work was supported by Center of Excellence for Mathematics, University of Isfahan, Isfahan, Iran. 相似文献