全文获取类型
收费全文 | 5387篇 |
免费 | 240篇 |
国内免费 | 126篇 |
专业分类
化学 | 367篇 |
晶体学 | 18篇 |
力学 | 826篇 |
综合类 | 33篇 |
数学 | 3204篇 |
物理学 | 1305篇 |
出版年
2023年 | 52篇 |
2022年 | 57篇 |
2021年 | 88篇 |
2020年 | 76篇 |
2019年 | 64篇 |
2018年 | 65篇 |
2017年 | 76篇 |
2016年 | 120篇 |
2015年 | 115篇 |
2014年 | 217篇 |
2013年 | 343篇 |
2012年 | 212篇 |
2011年 | 310篇 |
2010年 | 277篇 |
2009年 | 404篇 |
2008年 | 454篇 |
2007年 | 438篇 |
2006年 | 303篇 |
2005年 | 230篇 |
2004年 | 201篇 |
2003年 | 194篇 |
2002年 | 161篇 |
2001年 | 134篇 |
2000年 | 119篇 |
1999年 | 135篇 |
1998年 | 142篇 |
1997年 | 92篇 |
1996年 | 93篇 |
1995年 | 56篇 |
1994年 | 70篇 |
1993年 | 65篇 |
1992年 | 48篇 |
1991年 | 43篇 |
1990年 | 29篇 |
1989年 | 26篇 |
1988年 | 36篇 |
1987年 | 20篇 |
1986年 | 20篇 |
1985年 | 31篇 |
1984年 | 32篇 |
1983年 | 14篇 |
1982年 | 16篇 |
1981年 | 14篇 |
1980年 | 11篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1975年 | 4篇 |
1973年 | 3篇 |
排序方式: 共有5753条查询结果,搜索用时 39 毫秒
61.
“Optimization of aircraft maintenance/support infrastructure using genetic algorithms—level of repair analysis” 总被引:4,自引:0,他引:4
Level of repair analysis (LORA) is an approach used during the design stage of complex equipment for analysis of the cost
effectiveness of competing maintenance strategies. LORA is carried as a part of the life cycle cost and cost of ownership
analysis and plays a significant role in minimizing the life cycle cost and cost of ownership of the capital equipment. Since
many purchasing decisions of complex equipment are based on cost of ownership, it has become essential to carry out LORA to
compete in the market. In this paper, we develop a mathematical model for LORA and propose a solution methodology based on
genetic algorithms. The concept is illustrated using a hypothetical aircraft engine. 相似文献
62.
Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations 总被引:5,自引:0,他引:5
A. A. Brown M. C. Bartholomew-Biggs 《Journal of Optimization Theory and Applications》1989,62(2):211-224
In this paper, we review briefly some methods for minimizing a functionF(x), which proceed by follwoing the solution curve of a system of ordinary differential equations. Such methods have often been thought to be unacceptably expensive; but we show, by means of extensive numerical tests, using a variety of algorithms, that the ODE approach can in fact be implemented in such a way as to be more than competitive with currently available conventional techniques.This work was supported by a SERC research studentship for the first author. Both authors are indebted to Dr. J. J. McKeown and Dr. K. D. Patel of SCICON Ltd, the collaborating establishment, for their advice and encouragement. 相似文献
63.
In this paper, we discuss the classical ill-posed problem of numerical differentiation, assuming that the smoothness of the function to be differentiated is unknown. Using recent results on adaptive regularization of general ill-posed problems, we propose new rules for the choice of the stepsize in the finite-difference methods, and for the regularization parameter choice in numerical differentiation regularized by the iterated Tikhonov method. These methods are shown to be effective for the differentiation of noisy functions, and the order-optimal convergence results for them are proved.
64.
In a recent paper [17] we proposed a stochastic algorithm which generates optimal probabilities for the decompression of
an image represented by the fixed point of an IFS system (SAOP). We show here that such an algorithm is in fact a non trivial
example of Generalized Random System with Complete Connections. We also exhibit a generalization which could represent the
solution to the inverse problem for an image with grey levels, if a fixed set of contraction maps is available.
Received: 1 July 2002 相似文献
65.
Willem Hundsdorfer. 《Mathematics of Computation》1998,67(221):183-190
In this note some stability results are derived for the Douglas splitting method. The relevance of the theoretical results is tested for an advection-reaction equation.
66.
灰色Verhulst模型的样条插值函数的残差修正 总被引:4,自引:0,他引:4
本用样条函数对灰色Verhulst模型的残差序列进行插值拟合,然后作用于二阶线性微分方程,并以此修正原模型,得到一种新的预测模型的数值解,提高了拟合的精确度。 相似文献
67.
68.
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. 相似文献
69.
时贞军 《数学物理学报(A辑)》2004,4(6):675-682
该文提出一种无约束优化非线性共轭梯度法,证明了精确线性 搜索下的全局收敛性。当目标函数为一致凸函数时,证明了算法具有线性收敛速度。数值实验表明算法对于求解实际问题是有效的。 相似文献
70.
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. 相似文献