全文获取类型
收费全文 | 10985篇 |
免费 | 1680篇 |
国内免费 | 497篇 |
专业分类
化学 | 1954篇 |
晶体学 | 46篇 |
力学 | 1808篇 |
综合类 | 197篇 |
数学 | 5270篇 |
物理学 | 3887篇 |
出版年
2024年 | 25篇 |
2023年 | 168篇 |
2022年 | 271篇 |
2021年 | 305篇 |
2020年 | 263篇 |
2019年 | 257篇 |
2018年 | 263篇 |
2017年 | 467篇 |
2016年 | 522篇 |
2015年 | 481篇 |
2014年 | 627篇 |
2013年 | 861篇 |
2012年 | 596篇 |
2011年 | 628篇 |
2010年 | 561篇 |
2009年 | 663篇 |
2008年 | 677篇 |
2007年 | 681篇 |
2006年 | 523篇 |
2005年 | 418篇 |
2004年 | 421篇 |
2003年 | 439篇 |
2002年 | 367篇 |
2001年 | 272篇 |
2000年 | 296篇 |
1999年 | 284篇 |
1998年 | 238篇 |
1997年 | 173篇 |
1996年 | 177篇 |
1995年 | 159篇 |
1994年 | 126篇 |
1993年 | 96篇 |
1992年 | 79篇 |
1991年 | 85篇 |
1990年 | 72篇 |
1989年 | 52篇 |
1988年 | 62篇 |
1987年 | 53篇 |
1986年 | 38篇 |
1985年 | 66篇 |
1984年 | 34篇 |
1983年 | 27篇 |
1982年 | 33篇 |
1981年 | 27篇 |
1980年 | 47篇 |
1979年 | 45篇 |
1978年 | 26篇 |
1977年 | 35篇 |
1976年 | 36篇 |
1974年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
René Meziat Diego Patiño Pablo Pedregal 《Computational Optimization and Applications》2007,38(1):147-171
We propose an alternative method for computing effectively the solution of non-linear, fixed-terminal-time, optimal control
problems when they are given in Lagrange, Bolza or Mayer forms. This method works well when the nonlinearities in the control
variable can be expressed as polynomials. The essential of this proposal is the transformation of a non-linear, non-convex
optimal control problem into an equivalent optimal control problem with linear and convex structure. The method is based on
global optimization of polynomials by the method of moments. With this method we can determine either the existence or lacking
of minimizers. In addition, we can calculate generalized solutions when the original problem lacks of minimizers. We also
present the numerical schemes to solve several examples arising in science and technology. 相似文献
32.
On the departure process of a leaky bucket system with long-range dependent input traffic 总被引:2,自引:0,他引:2
Due to the strong experimental evidence that the traffic to be offered to future broadband networks will display long-range
dependence, it is important to study the possible implications that such traffic may have for the design and performance of
these networks. In particular, an important question is whether the offered traffic preserves its long-range dependent nature
after passing through a policing mechanism at the interface of the network. One of the proposed solutions for flow control
in the context of the emerging ATM standard is the so-called leaky bucket scheme. In this paper we consider a leaky bucket
system with long-range dependent input traffic. We adopt the following popular model for long-range dependent traffic: Time
is discrete. At each unit time a random number of sessions is initiated, having the distribution of a Poisson random variable
with mean λ. Each of these sessions has a random duration τ, where the integer random variable τ has finite mean, infinite
variance, and a regularly varying tail, i.e., P(τ >К) ~ К-Lα
L(К), where 1 < α < 2 L(·) is a slowly varying function. Once a session is initiated, it generates one cell at each unit of time until its termination.
We examine the departure process of the leaky bucket policing mechanism driven by such an arrival process, and show that it
too is long-range dependent for any token buffer size and any - finite or infinite - cell buffer size. Moreover, upper and
lower bounds for the covariance sequence of the output process are established. The above results demonstrate that long-range
dependence cannot be removed by the kinds of flow control schemes that are currently being envisioned for broadband networks.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
33.
Jesús M. Velásquez Bermúdez 《Annals of Operations Research》2002,117(1-4):21-31
This document presents theoretical considerations about the solution of dynamic optimization problems integrating the Benders Theory, the Dynamic Programming approach and the concepts of Control Theory. The so called Generalized Dual Dynamic Programming Theory (GDDP) can be considered as an extension of two previous approaches known as Dual Dynamic Programming (DDP): The first is the work developed by Pereira and Pinto [3–5], which was revised by Velásquez and others [8,9]. The second is the work developed by Read and others [2,6,7]. 相似文献
34.
K. Holmåker 《Journal of Optimization Theory and Applications》1991,71(2):205-235
Some optimization problems concerning a substrate in a fluid are considered. The concentration of the substrate is affected by diffusion, convection, and elimination by enzymes, and the problem is to find the optimal distribution of enzymes. In this paper, the rate of elimination and the transmission coefficient are optimized. Mathematically, these problems are optimal control problems, and they are analyzed by means of Pontryagin's maximum principle. 相似文献
35.
F. Blanchini 《Journal of Optimization Theory and Applications》1991,71(3):465-484
The linear state feedback synthesis problem for uncertain linear systems with state and control constraints is considered. We assume that the uncertainties are present in both the state and input matrices and they are bounded. The main goal is to find a linear control law assuring that both state and input constraints are fulfilled at each time. The problem is solved by confining the state within a compact and convex positively invariant set contained in the allowable state region.It is shown that, if the controls, the state, and the uncertainties are subject to linear inequality constraints and if a candidate compact and convex polyhedral set is assigned, a feedback matrix assuring that this region is positively invariant for the closed-loop system is found as a solution of a set of linear inequalities for both continuous and discrete time design problems.These results are extended to the case in which additive disturbances are present. The relationship between positive invariance and system stability is investigated and conditions for the existence of positively invariant regions of the polyhedral type are given.The author is grateful to Drs. Vito Cerone and Roberto Tempo for their comments. 相似文献
36.
Optimization theory provides a framework for determining the best decisions or actions with respect to some mathematical model of a process. This paper focuses on learning to act in a near-optimal manner through reinforcement learning for problems that either have no model or the model is too complex. One approach to solving this class of problems is via approximate dynamic programming. The application of these methods are established primarily for the case of discrete state and action spaces. In this paper we develop efficient methods of learning which act in complex systems with continuous state and action spaces. Monte-Carlo approaches are employed to estimate function values in an iterative, incremental procedure. Derivative-free line search methods are used to obtain a near-optimal action in the continuous action space for a discrete subset of the state space. This near-optimal control policy is then extended to the entire continuous state space via a fuzzy additive model. To compensate for approximation errors, a modified procedure for perturbing the generated control policy is developed. Convergence results under moderate assumptions and stopping criteria are established. 相似文献
37.
On the properties of solutions to the Goursat-Darboux problem with boundary and distributed controls
N. I. Pogodaev 《Siberian Mathematical Journal》2007,48(5):897-912
We consider a control system described by the Goursat-Darboux equation. The system is controlled by distributed and boundary controls. The controls are subject to the constraints given as multivalued mappings with closed, possibly nonconvex, values depending on the phase variable. Alongside the initial constraints, we consider the convexified constraints and the constraints whose values are the extreme points of the convexified constraints. We study the questions of existence of solutions and establish connections between the solutions under various constraints. 相似文献
38.
A scheme for vehicle density and velocity estimation in a stretch of highway based on a modified cell transmission model [C.
F. Daganzo, Transportation Research, Part B, 28B(4),269–287, 1994. Elsevier is presented. The scheme is intended for use with on-ramp metering control algorithms, providing
local knowledge of densities and velocities that is helpful to improve on-ramp metering control performance. Estimation of
density is obtained by nonlinear estimators, while velocity estimation is obtained by gradient algorithms. There is one density–velocity
estimator for free traffic flow and other for congested traffic flow. Both estimator schemes work in parallel. The final estimation
of density and velocity results from a convex combination of the predictions of the two estimators. This combination depends
on occupancy or density measurements at the boundaries of the stretch and is produced by a fuzzy inference system. Stability
and convergence of the density and velocity estimation scheme is proved by Lyapunov based techniques. Simulation results comparing
measured and estimated traffic data are presented. They confirm good performance of the estimators.
Research sponsored by grants UNAM PAPIIT IN110403 and CONACYT 47583. 相似文献
39.
In this paper, we examine a class of convex problems of Bolza type, involving a time delay in the state. It encompasses a variety of time-delay problems arising in the calculus of variations and optimal control. A duality analysis is carried out which, among other things, leads to a characterization of minimizers in terms of the Euler-Lagrange inclusion. The results obtained improve in significant respects on what is achievable by techniques previously employed, based on elimination of the time delay by introduction of an infinite-dimensional state space or on the method of steps. 相似文献
40.
Alexander J. Zaslavski 《Journal of Mathematical Analysis and Applications》2007,335(2):962-973
The Tonelli existence theorem in the calculus of variations and its subsequent modifications were established for integrands f which satisfy convexity and growth conditions. In this paper we consider a large class of optimal control problems which is identified with a complete metric space of integrands without convexity assumptions and show that for a generic integrand the corresponding optimal control problem possesses a unique solution and this solution is Lipschitzian. 相似文献