全文获取类型
收费全文 | 3639篇 |
免费 | 357篇 |
国内免费 | 155篇 |
专业分类
化学 | 92篇 |
晶体学 | 2篇 |
力学 | 374篇 |
综合类 | 52篇 |
数学 | 3247篇 |
物理学 | 384篇 |
出版年
2024年 | 4篇 |
2023年 | 36篇 |
2022年 | 54篇 |
2021年 | 73篇 |
2020年 | 102篇 |
2019年 | 93篇 |
2018年 | 93篇 |
2017年 | 120篇 |
2016年 | 148篇 |
2015年 | 86篇 |
2014年 | 126篇 |
2013年 | 269篇 |
2012年 | 181篇 |
2011年 | 147篇 |
2010年 | 120篇 |
2009年 | 169篇 |
2008年 | 201篇 |
2007年 | 163篇 |
2006年 | 192篇 |
2005年 | 176篇 |
2004年 | 129篇 |
2003年 | 142篇 |
2002年 | 137篇 |
2001年 | 124篇 |
2000年 | 125篇 |
1999年 | 111篇 |
1998年 | 85篇 |
1997年 | 72篇 |
1996年 | 57篇 |
1995年 | 75篇 |
1994年 | 36篇 |
1993年 | 36篇 |
1992年 | 40篇 |
1991年 | 43篇 |
1990年 | 35篇 |
1989年 | 24篇 |
1988年 | 36篇 |
1987年 | 30篇 |
1986年 | 24篇 |
1985年 | 30篇 |
1984年 | 27篇 |
1983年 | 15篇 |
1982年 | 30篇 |
1981年 | 15篇 |
1980年 | 32篇 |
1979年 | 21篇 |
1978年 | 13篇 |
1977年 | 22篇 |
1976年 | 20篇 |
1975年 | 6篇 |
排序方式: 共有4151条查询结果,搜索用时 882 毫秒
101.
For the multidimensional heat equation in a parallelepiped, optimal error estimates inL
2(Q) are derived. The error is of the order of +¦h¦2 for any right-hand sidef L
2(Q) and any initial function
; for appropriate classes of less regularf andu
0, the error is of the order of ((+¦h¦2
), 1/2<1.Translated fromMatematicheskie Zametki, Vol. 60, No. 2, pp. 185–197, August, 1996. 相似文献
102.
We consider a decentralized LQG measurement scheduling problem in which every measurement is costly, no communication between observers is permitted, and the observers' estimation errors are coupled quadratically. This setup, motivated by considerations from organization theory, models measurement scheduling problems in which cost, bandwidth, or security constraints necessitate that estimates be decentralized, although their errors are coupled. We show that, unlike the centralized case, in the decentralized case the problem of optimizing the time integral of the measurement cost and the quadratic estimation error is fundamentally stochastic, and we characterize the -optimal open-loop schedules as chattering solutions of a deterministic Lagrange optimal control problem. Using a numerical example, we describe also how this deterministic optimal control problem can be solved by nonlinear programming.This research was supported in part by ARPA Grant N00174-91-C-0116 and NSF Grant NCR-92-04419. 相似文献
103.
A note on smoothed estimating functions 总被引:1,自引:0,他引:1
A. Thavaneswaran Jagbir Singh 《Annals of the Institute of Statistical Mathematics》1993,45(4):721-729
The kernel estimate of regression function in likelihood based models has been studied in Staniswalis (1989,J. Amer. Statist. Assoc.,84, 276–283). The notion of optimal estimation for the nonparametric kernel estimation of semimartingale intensity (t) is proposed. The goal is to arrive at a nonparametric estimate
of 0=(t
0) for a fixed pointt
0 [0, 1]. We consider the estimator that is a solution of the smoothed optimal estimating equation
is the optimal estimating function as in Thavaneswaran and Thompson (1986,J. Appl. Probab.,23, 409–417). 相似文献
104.
C. S. Hsu 《Journal of Optimization Theory and Applications》1985,46(4):547-569
A discrete method of optimal control is proposed in this paper. The continuum state space of a system is discretized into a cell state space, and the cost function is discretized in a similar manner. Assuming intervalwise constant controls and using a finite set of admissible control levels (u) and a finite set of admissible time intervals (), the motion of the system under all possible interval controls (u, ) can then be expressed in terms of a family of cell-to-cell mappings. The proposed method extracts the optimal control results from these mappings by a systematic search, culminating in the construction of a discrete optimal control table.The possibility of expressing the optimal control results in the form of a control table seems to give this method a means to make systems real-time controllable.Dedicated to G. LeitmannThe material is based upon work supported by the National Science Foundation under Grant No. MEA-82-17471. The author is also indebted to Professor G. Leitmann for his many helpful comments. 相似文献
105.
Y. Yavin 《Journal of Optimization Theory and Applications》1984,44(1):159-179
Consider the random motion in the plane of a pointM, whose velocityv=(v
1,v
2) is perturbed by an 2-valued Gaussian white noise. Only noisy nonlinear observations taken on the point location (state) are available toM. The velocityv is of the formv(y)=
u
(u
1,u
2)
y
(du), wherey denotes the value of the observed signal,U is the range of the velocity, and, for eachy,
y
is a probability measure on (U). Using the available observations, the pointM wishes to steer itself into a given target set by choosing a randomized strategy ={
y
:y 2}. Sufficient conditions on weak optimal randomized strategies are derived. An algorithm for computing weak suboptimal randomized strategies is suggested, and the strategies are computed for a variety of cases.This work was partially supported by a grant from Control Data. 相似文献
106.
R. F. Hartl 《Journal of Optimization Theory and Applications》1984,43(1):51-72
In this paper, the Nerlove-Arrow model of optimal dynamic advertising policies is generalized by assuming a general probability distribution of the forgetting time, rather than the exponential one. A control problem with integrodifferential equations of motion is defined for which the transitory and steady-state properties of the optimal advertising policy are examined. The effects of assumptions like IHR-distributions and DHR-distributions, the existence of an upper bound for the forgetting time, etc., are explained. It is shown that there are two (in the case of an exponential distribution even three) different current-value adjoint functions associated with the problem, and relations between the two (three) are established. Also provided is a sensitivity analysis.Thanks are due to G. Feichtinger and S. Jorgensen for useful discussions. 相似文献
107.
Flos Spieksma 《Annals of Operations Research》1991,28(1):273-295
Recently Dekker and Hordijk [3,4] introduced conditions for the existence of deterministic Blackwell optimal policies in denumerable Markov decision chains with unbounded rewards. These conditions include- uniform geometric recurrence.The-uniform geometric recurrence property also implies the existence of average optimal policies, a solution to the average optimality equation with explicit formula's and convergence of the value iteration algorithm for average rewards. For this reason, the verification of-uniform geometric convergence is also useful in cases where average and-discounted rewards are considered.On the other hand,-uniform geometric recurrence is a heavy condition on the Markov decision chain structure for negative dynamic programming problems. The verification of-uniform geometric recurrence for the Markov chain induced by some deterministic policy together with results by Sennott [14] yields the existence of a deterministic policy that minimizes the expected average cost for non-negative immediate cost functions.In this paper-uniform geometric recurrence will be proved for two queueing models: theK competing queues and the two centre open Jackson network with control of the service rates.The research of the author is supported by the Netherlands Organization for Scientific Research N.W.O. 相似文献
108.
A. Žilinskas 《Journal of Global Optimization》1992,2(2):145-153
A review of statistical models for global optimization is presented. Rationality of the search for a global minimum is formulated axiomatically and the features of the corresponding algorithm are derived from the axioms. Furthermore the results of some applications of the proposed algorithm are presented and the perspectives of the approach are discussed. 相似文献
109.
A. Miele B. P. Mohanty P. Venkataraman Y. M. Kuo 《Journal of Optimization Theory and Applications》1982,38(1):97-109
This paper contains general transformation techniques useful to convert minimax problems of optimal control into the Mayer-Bolza problem of the calculus of variations [Problem (P)]. We consider two types of minimax problems: minimax problems of Type (Q), in which the minimax function depends on the state and does not depend on the control; and minimax problems of Type (R), in which the minimax function depends on both the state and the control. Both Problem (Q) and Problem (R) can be reduced to Problem (P).For Problem (Q), we exploit the analogy with a bounded-state problem in combination with a transformation of the Jacobson type. This requires the proper augmentation of the state vectorx(t), the control vectoru(t), and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.For Problem (R), we exploit the analogy with a bounded-control problem in combination with a transformation of the Valentine type. This requires the proper augmentation of the control vectoru(t) and the parameter vector , as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized.In a subsequent paper (Part 2), the transformation techniques presented here are employed in conjunction with the sequential gradient-restoration algorithm for solving optimal control problems on a digital computer; both the single-subarc approach and the multiple-subarc approach are discussed.This research was supported by the National Science Foundation, Grant No. ENG-79-18667, and by Wright-Patterson Air Force Base, Contract No. F33615-80-C3000. This paper is a condensation of the investigations reported in Refs. 1–7. The authors are indebted to E. M. Coker and E. M. Sims for analytical and computational assistance. 相似文献
110.
A constrained form of the Weber problem is formulated in which no path is permitted to enter a prespecified forbidden region of the plane. Using the calculus of variations the shortest path between two points which does not intersect is determined. If is unconstrained distance, we denote the shortes distance along a feasible path by . The constrained Weber problem is, then: given points and positive weights wj, j = 1,2,…,n, find a point such that is a minimum.An algorithm is formulated for the solution of this problem when is Euclidean distance and is a single circular region. Numerical results are presented. 相似文献