全文获取类型
收费全文 | 6513篇 |
免费 | 780篇 |
国内免费 | 224篇 |
专业分类
化学 | 618篇 |
晶体学 | 5篇 |
力学 | 609篇 |
综合类 | 71篇 |
数学 | 4722篇 |
物理学 | 1492篇 |
出版年
2024年 | 8篇 |
2023年 | 55篇 |
2022年 | 91篇 |
2021年 | 138篇 |
2020年 | 185篇 |
2019年 | 186篇 |
2018年 | 186篇 |
2017年 | 211篇 |
2016年 | 235篇 |
2015年 | 162篇 |
2014年 | 249篇 |
2013年 | 640篇 |
2012年 | 295篇 |
2011年 | 305篇 |
2010年 | 287篇 |
2009年 | 307篇 |
2008年 | 307篇 |
2007年 | 298篇 |
2006年 | 279篇 |
2005年 | 285篇 |
2004年 | 230篇 |
2003年 | 249篇 |
2002年 | 372篇 |
2001年 | 240篇 |
2000年 | 243篇 |
1999年 | 166篇 |
1998年 | 166篇 |
1997年 | 132篇 |
1996年 | 97篇 |
1995年 | 86篇 |
1994年 | 85篇 |
1993年 | 54篇 |
1992年 | 69篇 |
1991年 | 62篇 |
1990年 | 55篇 |
1989年 | 44篇 |
1988年 | 43篇 |
1987年 | 36篇 |
1986年 | 40篇 |
1985年 | 58篇 |
1984年 | 49篇 |
1983年 | 18篇 |
1982年 | 35篇 |
1981年 | 25篇 |
1980年 | 23篇 |
1979年 | 29篇 |
1978年 | 16篇 |
1977年 | 25篇 |
1976年 | 28篇 |
1974年 | 10篇 |
排序方式: 共有7517条查询结果,搜索用时 0 毫秒
1.
Dean A. Carlson 《Journal of Mathematical Analysis and Applications》2002,276(2):561-588
The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results. 相似文献
2.
Y. Wardi 《Journal of Optimization Theory and Applications》1989,61(3):473-485
A stochastic algorithm for finding stationary points of real-valued functions defined on a Euclidean space is analyzed. It is based on the Robbins-Monro stochastic approximation procedure. Gradient evaluations are done by means of Monte Carlo simulations. At each iteratex
i
, one sample point is drawn from an underlying probability space, based on which the gradient is approximated. The descent direction is against the approximation of the gradient, and the stepsize is 1/i. It is shown that, under broad conditions, w.p.1 if the sequence of iteratesx
1,x
2,...generated by the algorithm is bounded, then all of its accumulation points are stationary. 相似文献
3.
We consider the optimal service control of a multiclass M/G/1 queueing system in which customers are served nonpreemptively and the system cost rate is additive across classes and increasing convex in the numbers present in each class. Following Whittle's approach to a class of restless bandit problems, we develop a Langrangian relaxation of the service control problem which serves to motivate the development of a class of index heuristics. The index for a particular customer class is characterised as a fair charge for service of that class. The paper develops these indices and reports an extensive numerical investigation which exhibits strong performance of the index heuristics for both discounted and average costs. 相似文献
4.
5.
We introduce here some Itô calculus for non-continuous Dirichlet processes. Such calculus extends what was known for continuous Dirichlet processes or for semimartingales. In particular we prove that non-continuous Dirichlet processes are stable under C
1 transformation. 相似文献
6.
7.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献
8.
Johan Revstedt 《国际流体数值方法杂志》2004,45(7):775-795
The flow around spherical, solid objects is considered. The boundary conditions on the solid boundaries have been applied by replacing the boundary with a surface force distribution on the surface, such that the required boundary conditions are satisfied. The velocity on the boundary is determined by extrapolation from the flow field. The source terms are determined iteratively, as part of the solution. They are then averaged and are smoothed out to nearby computational grid points. A multi‐grid scheme has been used to enhance the computational efficiency of the solution of the force equations. The method has been evaluated for flow around both moving and stationary spherical objects at very low and intermediate Reynolds numbers. The results shows a second order accuracy of the method both at creeping flow and at Re=100. The multi‐grid scheme is shown to enhance the convergence rate up to a factor 10 as compared to single grid approach. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
9.
Differential game formulations provide an adequate basis for a guidance law synthesis against highly maneuvering targets. This paper deals with a guidance law based on a linear-quadratic differential game formulation. This guidance law has many attractive properties: it is continuous, linear with respect to the state variables, and its gain coefficients can be precalculated offline. Nevertheless, due to the lack of hard control constraints in the formulation, the magnitude of the control can exceed the admissible level imposed by the nature of the problem. In this paper, the upper bound of the interceptor control is obtained depending on the system parameters and the penalty coefficients of the game performance index. It is shown that the interceptor can guarantee an arbitrarily small miss distance without exceeding the control constraints if it has sufficient maneuverability and if the penalty coefficients are chosen properly. By manipulating the penalty coefficients, it is possible to reduce significantly the maneuverability requirements compared to the case of zero interceptor penalty coefficient. 相似文献
10.
Defining speed of diffusion as the amount of time it takes to get from one penetration level to a higher one, we introduce a dynamic model in which we study the link between pricing policy, speed of diffusion, and number of competitors in the market. Our analysis shows that, in the case of strategic (oligopolistic) competition, the speed of diffusion has an important influence on the optimal pricing policy. In particular, we find that higher speeds of diffusion create an incentive to strategically interacting firms to lower their prices. 相似文献