全文获取类型
收费全文 | 11601篇 |
免费 | 857篇 |
国内免费 | 479篇 |
专业分类
化学 | 2298篇 |
晶体学 | 41篇 |
力学 | 1599篇 |
综合类 | 164篇 |
数学 | 6806篇 |
物理学 | 2029篇 |
出版年
2024年 | 21篇 |
2023年 | 111篇 |
2022年 | 260篇 |
2021年 | 362篇 |
2020年 | 242篇 |
2019年 | 254篇 |
2018年 | 298篇 |
2017年 | 372篇 |
2016年 | 378篇 |
2015年 | 276篇 |
2014年 | 541篇 |
2013年 | 739篇 |
2012年 | 704篇 |
2011年 | 573篇 |
2010年 | 526篇 |
2009年 | 665篇 |
2008年 | 642篇 |
2007年 | 707篇 |
2006年 | 585篇 |
2005年 | 525篇 |
2004年 | 438篇 |
2003年 | 396篇 |
2002年 | 351篇 |
2001年 | 350篇 |
2000年 | 325篇 |
1999年 | 260篇 |
1998年 | 285篇 |
1997年 | 226篇 |
1996年 | 175篇 |
1995年 | 190篇 |
1994年 | 155篇 |
1993年 | 129篇 |
1992年 | 119篇 |
1991年 | 99篇 |
1990年 | 88篇 |
1989年 | 68篇 |
1988年 | 63篇 |
1987年 | 53篇 |
1986年 | 44篇 |
1985年 | 60篇 |
1984年 | 56篇 |
1983年 | 16篇 |
1982年 | 30篇 |
1981年 | 27篇 |
1980年 | 21篇 |
1979年 | 36篇 |
1978年 | 21篇 |
1977年 | 29篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
A manufacturing system with two tandem machines producing one part type is considered in this work. The machines are unreliable, each having two states, up and down. Both surplus controls and Kanban systems are considered. Algorithms for approximating the optimal threshold values are developed. First, perturbation analysis techniques are employed to obtain consistent gradient estimates based on a single simulation run. Then, iterative algorithms of the stochastic optimization type are constructed. It is shown that the algorithms converge to the optimal threshold values in an appropriate sense. Numerical examples are provided to demonstrate the performance of the algorithms.The research of these authors was supported in part by grants from URIF, MRCO, National Science Foundation, and Wayne State University. The authors would like to thank Dr. X. R. Cao, Digital Equipment Corporation, for the valuable initial discussion and Dr. X. Y. Zhou, University of Toronto, for his helpful comments. 相似文献
992.
Interval arithmetic and Taylor's formula can be used to bound the slope of the cord of a univariate function at a given point. This leads in turn to bounding the values of the function itself. Computing such bounds for the function, its first and second derviatives, allows the determination of intervals in which this function cannot have a global minimum. Exploiting this information together with a simple branching rule yields an efficient algorithm for global minimization of univariate functions. Computational experience is reported.The first and second authors have been supported by FCAR (Fonds pour la Formation de Chercheurs et l'Aide à la Recherche) Grant 92EQ1048 and AFOSR Grant 90-0008 to Rutgers University. The first author has also been supported by NSERC (Natural Sciences and Engineering Research Council of Canada) Grant to HEC and NSERC Grant GP0105574. The second author has been supported by NSERC Grant GP0036426, FCAR Grant 90NC0305, and a NSF Visiting Professorship for Women in Science at Princeton University. Work of the third author was done in part while he was a graduate student at the Department of Mathematics, Rutgers University, New Brunswick, New Jersey, USA and during a visit to GERAD, June–August 1991. 相似文献
993.
L. Lukšan 《Journal of Optimization Theory and Applications》1994,83(1):27-47
Variable metric methods from the Broyden family are well known and commonly used for unconstrained minimization. These methods have good theoretical and practical convergence properties which depend on a selection of free parameters. We demonstrate, using extensive computational experiments, the influence of both the Biggs stabilization parameter and Oren scaling parameter on 12 individual variable metric updates, two of which are new. This paper focuses on a class of variable metric updates belonging to the so-called preconvex part of the Broyden family. These methods outperform the more familiar BFGS method. We also experimentally demonstrate the efficiency of the controlled scaling strategy for problems of sufficient size and sparsity. 相似文献
994.
Convergence of Perry and Shanno's Memoryless Quasi-Newton Method for Nonconvex Optimization Problems 总被引:2,自引:0,他引:2
1.IntroductionWeconsidertheunconstrainedoptimizationproblem:minj(x).(1.1)acRewheref:R"-- Riscontinuouslydifferelltiable.PerryandShanno'smemorylesssquasiNewtonmethodisoftenusedtosolvetheproblem(1.1)whennislarge.ItwasoriginatedfromtheworksofPerry(1977[l])an… 相似文献
995.
Dietrich Stauffer 《Journal of statistical physics》1994,74(5-6):1293-1299
In Kauffman's Boolean automata model on the square lattice, the Darwinian fitness of survival can be defined as the fraction of elements which do not change from one iteration to the next. Biological mutations are simulated by filpping one bit in the rule of one site. Selection of the fitter mutant then optimizes the whole lattice completely. This optimization is particularly effective near the critical point of the transition to chaos, but is in itself not a critical phenomenon. Also a two-dimensional spin glass can be optimized in this way. 相似文献
996.
R. Lipton 《Journal of Optimization Theory and Applications》1994,81(3):549-568
The relaxation for optimal complicance design is independent of whether the underlying elastic problem is formulated in terms of displacements or strains. For the purposes of numerical experimentation and computation, it may be advantageous to formulate optimal design problems in terms of displacements as is done in Ref. 1. The relaxed problem delivered by the displacement-based formulation is of min-min-max type. Because of this, efficient numerical implementation is hampered by the order of the last two min-max operations. We show here that the last two min-max operations may be exchanged, facilitating an efficient numerical algorithm. We remark that the rigorous results given here corroborate the numerical methods and experiments given in Ref. 1.This work was supported by NSF Grant DMS-92-05158. 相似文献
997.
H. KamedaY. Zhang 《Mathematical and Computer Modelling》1995,22(10-12)
Optimal static routing problems in open BCMP queueing networks with state-independent arrival and service rates are studied. They include static routing problems in communication networks and optimal static load balancing problems in distributed computer systems. We consider an overall optimal policy that is the routing policy whereby the overall mean response (or sojourn) time of a job is minimized. We obtain the routing decisions of the overall optimal policy and show that they may not be unique, but that the utilization of each service center is uniquely determined by the overall optimal policy. We also consider an individually optimal policy whereby jobs are routed so that each job may feel that its own expected response time is minimized if it knows the mean delay time for each path. 相似文献
998.
In this paper, we study a modification of the Celis-Dennis-Tapia trust-region subproblem, which is obtained by replacing thel
2-norm with a polyhedral norm. The polyhedral norm Celis-Dennis-Tapia (CDT) subproblem can be solved using a standard quadratic programming code.We include computational results which compare the performance of the polyhedral-norm CDT trust-region algorithm with the performance of existing codes. The numerical results validate the effectiveness of the approach. These results show that there is not much loss of robustness or speed and suggest that the polyhedral-norm CDT algorithm may be a viable alternative. The topic merits further investigation.The first author was supported in part by the REDI foundation and State of Texas Award, Contract 1059 as Visiting Member of the Center for Research on Parallel Computation, Rice University, Houston, Texas, He thanks Rice University for the congenial scientific atmosphere provided. The second author was supported in part by the National Science Foundation, Cooperative Agreement CCR-88-09615, Air Force Office of Scientific Research Grant 89-0363, and Department of Energy Contract DEFG05-86-ER25017. 相似文献
999.
The convexification of a noninferior frontier can be achieved in an appropriate equivalent objective space for general nonconvex multiobjective optimization problems. Specifically, this paper proves that taking the exponentials of the objective functions can act as a convexification scheme. This convexification scheme further leads to the exponential generating method that guarantees the identification of the entire set of noninferior solutions. 相似文献
1000.
Combined heat and power (CHP) production is universally accepted as one of the most energy-efficient technologies to produce energy with lower fuel consumption and fewer emissions. In CHP technology, heat and power generation follow a joint characteristic. Traditional CHP production is usually applied in backpressure plants, where the joint characteristic can often be represented by a convex model. Advanced CHP production technologies such as backpressure plants with condensing and auxiliary cooling options, gas turbines, and combined gas and steam cycles may require non-convex models. Cost-efficient operation of a CHP system can be planned using an optimization model based on forecasts for heat load and power price. A long-term planning model decomposes into thousands of single-period models, which can be formulated in the convex case as linear programming (LP) problems, and in the non-convex case as mixed integer programming (MIP) problems. 相似文献