全文获取类型
收费全文 | 12543篇 |
免费 | 1176篇 |
国内免费 | 512篇 |
专业分类
化学 | 1459篇 |
晶体学 | 35篇 |
力学 | 1353篇 |
综合类 | 219篇 |
数学 | 9350篇 |
物理学 | 1815篇 |
出版年
2024年 | 34篇 |
2023年 | 135篇 |
2022年 | 367篇 |
2021年 | 387篇 |
2020年 | 308篇 |
2019年 | 309篇 |
2018年 | 353篇 |
2017年 | 467篇 |
2016年 | 446篇 |
2015年 | 313篇 |
2014年 | 570篇 |
2013年 | 821篇 |
2012年 | 727篇 |
2011年 | 611篇 |
2010年 | 564篇 |
2009年 | 683篇 |
2008年 | 694篇 |
2007年 | 787篇 |
2006年 | 648篇 |
2005年 | 563篇 |
2004年 | 447篇 |
2003年 | 444篇 |
2002年 | 422篇 |
2001年 | 386篇 |
2000年 | 350篇 |
1999年 | 283篇 |
1998年 | 287篇 |
1997年 | 254篇 |
1996年 | 182篇 |
1995年 | 205篇 |
1994年 | 158篇 |
1993年 | 132篇 |
1992年 | 124篇 |
1991年 | 101篇 |
1990年 | 89篇 |
1989年 | 70篇 |
1988年 | 57篇 |
1987年 | 45篇 |
1986年 | 43篇 |
1985年 | 60篇 |
1984年 | 61篇 |
1983年 | 17篇 |
1982年 | 29篇 |
1981年 | 27篇 |
1980年 | 31篇 |
1979年 | 38篇 |
1978年 | 23篇 |
1977年 | 36篇 |
1976年 | 19篇 |
1957年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
91.
PERSISTENCE AND GLOBAL STABILITY FOR TWO-SPECIES NONAUTONOMOUS PREDATOR-PREY SYSTEM WITH DIFFUSION AND TIME DELAY 总被引:3,自引:0,他引:3
In this paper, a non-autonomous predator-prey model with diffusion andcontinuous time delay is studied, where the prey can diffuse between two pat-ches of a heterogeneous environment with barriers between patches, but for thepredator, the diffusion does not involve a barrier between patches, further itis assumed that all the parameters are time-dependent. It is shown that thesystem can be made persistent under some appropriate conditions. Moreover,sufficient conditions that guarantee the existence of a unique periodic solutionwhich is globally asymptotic stable are derived. 相似文献
92.
Fabio Schoen 《Journal of Global Optimization》1994,4(1):17-35
In this paper a new algorithm is proposed for global optimization problems. The main idea is that of modifying a standard clustering approach by sequentially sampling the objective function while adaptively deciding an appropriate sample size. Theoretical as well as computational results are presented. 相似文献
93.
We study the effect of arrival model uncertainties on the optimal routing in a system of parallel queues. For exponential service time distributions and Bernoulli routing, the optimal mean system delay generally depends on the interarrival time distribution. Any error in modeling the arriving process will cause a model-based optimal routing algorithm to produce a mean system delay higher than the true optimum. In this paper, we present an asymptotic analysis of the behavior of this error under heavy traffic conditions for a general renewal arrival process. An asymptotic analysis of the error in optimal mean delay due to uncertainties in the service time distribution for Poisson arrivals was reported in Ref. 6, where it was shown that, when the first moment of the service time distribution is known, this error in performance vanishes asymptotically as the traffic load approaches the system capacity. In contrast, this paper establishes the somewhat surprising result that, when only the first moment of the arrival distribution is known, the error in optimal mean delay due to uncertainties in the arrival model is unbounded as the traffic approaches the system capacity. However, when both first and second moments are known, the error vanishes asymptotically. Numerical examples corroborating the theoretical results are also presented.This work was supported by the National Science Foundation under Grants ECS-88-01912 and EID-92-12122 and by NASA under Contract NAG 2-595.The authors wish to thank an anonymous referee for pointing out Ref. 20, thus avoiding the need for an explicit proof of convexity of the cost function considered in the paper. 相似文献
94.
The paper deals with the global minimization of a differentiable cost function mapping a ball of a finite dimensional Euclidean space into an interval of real numbers. It is established that a suitable random perturbation of the gradient method with a fixed parameter generates a bounded minimizing sequence and leads to a global minimum: the perturbation avoids convergence to local minima. The stated results suggest an algorithm for the numerical approximation of global minima: experiments are performed for the problem of fitting a sum of exponentials to discrete data and to a nonlinear system involving about 5000 variables. The effect of the random perturbation is examined by comparison with the purely deterministic gradient method. 相似文献
95.
A filled function with adjustable parameters is suggested in this paper for finding a global minimum point of a general class of nonlinear programming problems with a bounded and closed domain. This function has two adjustable parameters. We will discuss the properties of the proposed filled function. Conditions on this function and on the values of parameters are given so that the constructed function has the desired properties of traditional filled function. 相似文献
96.
利用集值映射切导数与半可微概念,给出了无约束与具约束的集值向量优化问题局部真有效解与局部强有效解的最优性条件。 相似文献
97.
J. Haslinger T. Kozubek K. Kunisch G. Peichl 《Journal of Mathematical Analysis and Applications》2004,290(2):665-685
This contribution combines a shape optimization approach to free boundary value problems of Bernoulli type with an embedding domain technique. A theoretical framework is developed which allows to prove continuous dependence of the primal and dual variables in the resulting saddle point problems with respect to the domain. This ensures the existence of a solution of a related shape optimization problem in a sufficiently large class of admissible domains. 相似文献
98.
Grundel D. A. Oliveira C. A. S. Pardalos P. M. 《Journal of Optimization Theory and Applications》2004,122(3):487-500
The multidimensional assignment problem (MAP) is a NP-hard combinatorial optimization problem, occurring in many applications, such as data association. In this paper, we prove two conjectures made in Ref. 1 and based on data from computational experiments on MAPs. We show that the mean optimal objective function cost of random instances of the MAP goes to zero as the problem size increases, when assignment costs are independent exponentially or uniformly distributed random variables. We prove also that the mean optimal solution goes to negative infinity when assignment costs are independent normally distributed random variables. 相似文献
99.
Currently, most combinatorial optimisation problems have to be solved, if the optimum solution is sought, using general techniques
to explore the space of feasible solutions and, more specifically, through exploratory enumerative procedures in trees and
search graphs. We propose Branch and Win, a general formulation for understanding and synthesising the different tree search
procedures that have been presented in the literature of operations research as well as in that of artificial intelligence.
Several general ideas are also presented, whose application allows designing new hybrid search algorithms, in order to implement
the procedure. 相似文献
100.
We develop two implementable algorithms, the first for the solution of finite and the second for the solution of semi-infinite min-max-min problems. A smoothing technique (together with discretization for the semi-infinite case) is used to construct a sequence of approximating finite min-max problems, which are solved with increasing precision. The smoothing and discretization approximations are initially coarse, but are made progressively finer as the number of iterations is increased. This reduces the potential ill-conditioning due to high smoothing precision parameter values and computational cost due to high levels of discretization. The behavior of the algorithms is illustrated with three semi-infinite numerical examples. 相似文献