全文获取类型
收费全文 | 17748篇 |
免费 | 2654篇 |
国内免费 | 1149篇 |
专业分类
化学 | 2690篇 |
晶体学 | 99篇 |
力学 | 2139篇 |
综合类 | 287篇 |
数学 | 9692篇 |
物理学 | 6644篇 |
出版年
2024年 | 24篇 |
2023年 | 184篇 |
2022年 | 348篇 |
2021年 | 423篇 |
2020年 | 500篇 |
2019年 | 508篇 |
2018年 | 540篇 |
2017年 | 668篇 |
2016年 | 730篇 |
2015年 | 597篇 |
2014年 | 937篇 |
2013年 | 1540篇 |
2012年 | 972篇 |
2011年 | 1048篇 |
2010年 | 867篇 |
2009年 | 1007篇 |
2008年 | 1130篇 |
2007年 | 1099篇 |
2006年 | 977篇 |
2005年 | 874篇 |
2004年 | 715篇 |
2003年 | 772篇 |
2002年 | 705篇 |
2001年 | 600篇 |
2000年 | 555篇 |
1999年 | 521篇 |
1998年 | 406篇 |
1997年 | 362篇 |
1996年 | 318篇 |
1995年 | 268篇 |
1994年 | 190篇 |
1993年 | 143篇 |
1992年 | 132篇 |
1991年 | 131篇 |
1990年 | 96篇 |
1989年 | 75篇 |
1988年 | 59篇 |
1987年 | 65篇 |
1986年 | 57篇 |
1985年 | 85篇 |
1984年 | 53篇 |
1983年 | 30篇 |
1982年 | 42篇 |
1981年 | 34篇 |
1980年 | 25篇 |
1979年 | 32篇 |
1978年 | 24篇 |
1977年 | 20篇 |
1976年 | 21篇 |
1973年 | 11篇 |
排序方式: 共有10000条查询结果,搜索用时 9 毫秒
71.
We consider a single machine scheduling problem with two min-sum objective functions: the sum of completion times and the sum of weighted completion times. We propose a simple polynomial time (1+(1/γ),1+γ)-approximation algorithm, and show that for γ>1, there is no (x,y)-approximation with 1<x<1+(1/γ) and 1<y<1+(γ-1)/(2+γ). 相似文献
72.
S. V. Dil’man 《Mathematical Notes》2006,79(5-6):625-631
In 1996, D. Deng established an analog of the Baum—Katz theorem on the convergence rate in the law of large numbers for multi-indexed random variables. The series describing the convergence rate depends, in a natural way, on the parameter characterizing the excess of the normalized sums over some level. In this paper, we find the precise asymptotics of the sum of this series with respect to the above-mentioned parameter. Thus, a generalization of a recent result due to A. Gut and A. Spataru is obtained. 相似文献
73.
Karl Sigman 《Operations Research Letters》2007,35(5):581-583
In Mandelbaum and Yechiali [The conditional residual service time in the M/G/1 queue, http://www.math.tau.ac.il/∼uriy/publications (No. 30a), 1979] and in Fakinos [The expected remaining service time in a single-server queue, Oper. Res. 30 (1982) 1014-1018] a simple formula is derived for the (stationary) expected remaining service time in a M/G/1 queue, conditional on the number of customers in the system. We give a short new proof of the formula using Rate Conservation Law, and generalize to handle higher moments. 相似文献
74.
S. Juneja 《Queueing Systems》2007,57(2-3):115-127
Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems
in Monte-Carlo simulation. In the last few years, applied probabilists have achieved considerable success in developing efficient
algorithms for some such simple but fundamental tail probabilities. Usually, unbiased importance sampling estimators of such
tail probabilities are developed and it is proved that these estimators are asymptotically efficient or even possess the desirable
bounded relative error property. In this paper, as an illustration, we consider a simple tail probability involving geometric
sums of heavy tailed random variables. This is useful in estimating the probability of large delays in M/G/1 queues. In this setting we develop an unbiased estimator whose relative error decreases to zero asymptotically. The key
idea is to decompose the probability of interest into a known dominant component and an unknown small component. Simulation
then focuses on estimating the latter ‘residual’ probability. Here we show that the existing conditioning methods or importance
sampling methods are not effective in estimating the residual probability while an appropriate combination of the two estimates
it with bounded relative error. As a further illustration of the proposed ideas, we apply them to develop an estimator for
the probability of large delays in stochastic activity networks that has an asymptotically zero relative error.
相似文献
75.
In this paper we derive a priori and a posteriori error estimates for cell centered finite volume approximations of nonlinear conservation laws on polygonal bounded domains. Numerical experiments show the applicability of the a posteriori result for the derivation of local adaptive solution strategies.
76.
77.
Robert S. Maier 《Random Structures and Algorithms》1991,2(4):379-420
We analyze the performance of a prototypical scheme for shared storage allocation: two initially empty stacks evolving in a contiguous block of memory of size m. We treat the case in which the stacks are more likely to shrink than grow, but with the probabilities of insertion and deletion allowed to depend arbitrarily on stack height as a fraction of m. New results are obtained on the m → ∞ asymptotics of the stack collision time, and of the final stack heights. The results of Wentzell and Freidlin on the large deviations of Markov chains are used, and the relation of their formalism to the Hamiltonian formulation of classical mechanics is emphasized. Certain results on higher-order asymptotics follow from WKB expansions. 相似文献
78.
We consider the M(t)/M(t)/m/m queue, where the arrival rate λ(t) and service rate μ(t) are arbitrary (smooth) functions of time. Letting pn(t) be the probability that n servers are occupied at time t (0≤ n≤ m, t > 0), we study this distribution asymptotically, for m→∞ with a comparably large arrival rate λ(t) = O(m) (with μ(t) = O(1)). We use singular perturbation techniques to solve the forward equation for pn(t) asymptotically. Particular attention is paid to computing the mean number of occupied servers and the blocking probability
pm(t). The analysis involves several different space-time ranges, as well as different initial conditions (we assume that at t = 0 exactly n0 servers are occupied, 0≤ n0≤ m). Numerical studies back up the asymptotic analysis.
AMS subject classification: 60K25,34E10
Supported in part by NSF grants DMS-99-71656 and DMS-02-02815 相似文献
79.
Jinyan Fan 《Computational Optimization and Applications》2006,34(2):215-227
In this paper, we present the new trust region method for nonlinear equations with the trust region converging to zero. The
new method preserves the global convergence of the traditional trust region methods in which the trust region radius will
be larger than a positive constant. We study the convergence rate of the new method under the local error bound condition
which is weaker than the nonsingularity. An example given by Y.X. Yuan shows that the convergence rate can not be quadratic.
Finally, some numerical results are given.
This work is supported by Chinese NSFC grants 10401023 and 10371076, Research Grants for Young Teachers of Shanghai Jiao Tong
University, and E-Institute of Computational Sciences of Shanghai Universities.
An erratum to this article is available at . 相似文献
80.
Ronald H. Nickel Igor Mikolic-Torreira Jon W. Tolle 《Computational Optimization and Applications》2006,35(1):109-126
Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked
on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready
to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the
cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the
Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements
of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear
and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization
viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions
are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives
are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult
to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation
and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this
problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed
version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern
search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned
as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous
computers in an office environment, thus, drastically reducing the time required to find the solution. 相似文献