全文获取类型
收费全文 | 13850篇 |
免费 | 1720篇 |
国内免费 | 400篇 |
专业分类
化学 | 1513篇 |
晶体学 | 33篇 |
力学 | 1678篇 |
综合类 | 191篇 |
数学 | 8977篇 |
物理学 | 3578篇 |
出版年
2024年 | 24篇 |
2023年 | 131篇 |
2022年 | 408篇 |
2021年 | 421篇 |
2020年 | 275篇 |
2019年 | 273篇 |
2018年 | 292篇 |
2017年 | 397篇 |
2016年 | 405篇 |
2015年 | 307篇 |
2014年 | 612篇 |
2013年 | 776篇 |
2012年 | 825篇 |
2011年 | 687篇 |
2010年 | 692篇 |
2009年 | 834篇 |
2008年 | 896篇 |
2007年 | 954篇 |
2006年 | 810篇 |
2005年 | 681篇 |
2004年 | 517篇 |
2003年 | 529篇 |
2002年 | 483篇 |
2001年 | 457篇 |
2000年 | 407篇 |
1999年 | 322篇 |
1998年 | 346篇 |
1997年 | 309篇 |
1996年 | 221篇 |
1995年 | 232篇 |
1994年 | 196篇 |
1993年 | 172篇 |
1992年 | 156篇 |
1991年 | 127篇 |
1990年 | 106篇 |
1989年 | 85篇 |
1988年 | 74篇 |
1987年 | 63篇 |
1986年 | 62篇 |
1985年 | 78篇 |
1984年 | 64篇 |
1983年 | 22篇 |
1982年 | 36篇 |
1981年 | 32篇 |
1980年 | 26篇 |
1979年 | 37篇 |
1978年 | 28篇 |
1977年 | 34篇 |
1976年 | 22篇 |
1957年 | 6篇 |
排序方式: 共有10000条查询结果,搜索用时 11 毫秒
151.
A classical Fermi accelerator model (FAM) is known to show chaotic behavior. The FAM is defined by a free particle bouncing elastically from two rigid walls, one fixed and the other oscillating periodically in time. The central aim of this paper is to connect the quantum and the classical solutions to the FAM in the semiclassical limit. This goal is accomplished using a finite inverted parametric oscillator (FIPO), confined to a box withfixed walls, as an alternative representation of the FAM. In the FIPO representation, an explicit correspondence between classical and quantum limits is accomplished using a Husimi representation of the quasienergy eigenfunctions. 相似文献
152.
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. 相似文献
153.
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. 相似文献
154.
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. 相似文献
155.
156.
We consider two problems: given a collection of n fat objects in a fixed dimension, (1) ( packing) find the maximum subcollection of pairwise disjoint objects, and (2) ( piercing) find the minimum point set that intersects every object. Recently, Erlebach, Jansen, and Seidel gave a polynomial-time approximation scheme (PTAS) for the packing problem, based on a shifted hierarchical subdivision method. Using shifted quadtrees, we describe a similar algorithm for packing but with a smaller time bound. Erlebach et al.'s algorithm requires polynomial space. We describe a different algorithm, based on geometric separators, that requires only linear space. This algorithm can also be applied to piercing, yielding the first PTAS for that problem. 相似文献
157.
利用集值映射切导数与半可微概念,给出了无约束与具约束的集值向量优化问题局部真有效解与局部强有效解的最优性条件。 相似文献
158.
In this paper we construct the linear support vector machine (SVM) based on the nonlinear rescaling (NR) methodology (see
[Polyak in Math Program 54:177–222, 1992; Polyak in Math Program Ser A 92:197–235, 2002; Polyak and Teboulle in Math Program
76:265–284, 1997] and references therein). The formulation of the linear SVM based on the NR method leads to an algorithm
which reduces the number of support vectors without compromising the classification performance compared to the linear soft-margin
SVM formulation. The NR algorithm computes both the primal and the dual approximation at each step. The dual variables associated
with the given data-set provide important information about each data point and play the key role in selecting the set of
support vectors. Experimental results on ten benchmark classification problems show that the NR formulation is feasible. The
quality of discrimination, in most instances, is comparable to the linear soft-margin SVM while the number of support vectors
in several instances were substantially reduced. 相似文献
159.
The shock structure problem is one of the classical problems of fluid mechanics and at least for non-reacting dilute gases it has been considered essentially solved. Here we present a few recent findings, to show that this is not the case. There are still new physical effects to be discovered provided that the numerical technique is general enough to not rule them out a priori. While the results have been obtained for dense fluids, some of the effects might also be observable for shocks in dilute gases. 相似文献
160.