全文获取类型
收费全文 | 14795篇 |
免费 | 2215篇 |
国内免费 | 903篇 |
专业分类
化学 | 2657篇 |
晶体学 | 66篇 |
力学 | 2269篇 |
综合类 | 296篇 |
数学 | 7842篇 |
物理学 | 4783篇 |
出版年
2024年 | 34篇 |
2023年 | 200篇 |
2022年 | 363篇 |
2021年 | 417篇 |
2020年 | 399篇 |
2019年 | 369篇 |
2018年 | 395篇 |
2017年 | 611篇 |
2016年 | 655篇 |
2015年 | 586篇 |
2014年 | 747篇 |
2013年 | 1190篇 |
2012年 | 730篇 |
2011年 | 765篇 |
2010年 | 706篇 |
2009年 | 871篇 |
2008年 | 873篇 |
2007年 | 945篇 |
2006年 | 771篇 |
2005年 | 662篇 |
2004年 | 595篇 |
2003年 | 596篇 |
2002年 | 553篇 |
2001年 | 434篇 |
2000年 | 454篇 |
1999年 | 410篇 |
1998年 | 353篇 |
1997年 | 286篇 |
1996年 | 257篇 |
1995年 | 215篇 |
1994年 | 186篇 |
1993年 | 136篇 |
1992年 | 106篇 |
1991年 | 110篇 |
1990年 | 99篇 |
1989年 | 76篇 |
1988年 | 79篇 |
1987年 | 73篇 |
1986年 | 56篇 |
1985年 | 88篇 |
1984年 | 52篇 |
1983年 | 36篇 |
1982年 | 50篇 |
1981年 | 40篇 |
1980年 | 64篇 |
1979年 | 49篇 |
1978年 | 35篇 |
1977年 | 38篇 |
1976年 | 40篇 |
1974年 | 17篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
We develop two implementable algorithms, the first for the solution of finite and the second for the solution of semi-infinite min-max-min problems. A smoothing technique (together with discretization for the semi-infinite case) is used to construct a sequence of approximating finite min-max problems, which are solved with increasing precision. The smoothing and discretization approximations are initially coarse, but are made progressively finer as the number of iterations is increased. This reduces the potential ill-conditioning due to high smoothing precision parameter values and computational cost due to high levels of discretization. The behavior of the algorithms is illustrated with three semi-infinite numerical examples. 相似文献
62.
Lou 《Applied Mathematics and Optimization》2003,47(2):121-142
Abstract. Optimal control problems governed by semilinear parabolic partial differential equations are considered. No Cesari-type conditions
are assumed. By proving the existence theorem and the Pontryagin maximum principle of optimal ``state-control" pairs for the
corresponding relaxed problems, an existence theorem of optimal pairs for the original problem is established. 相似文献
63.
A Tabu-Search Hyperheuristic for Timetabling and Rostering 总被引:4,自引:0,他引:4
Hyperheuristics can be defined to be heuristics which choose between heuristics in order to solve a given optimisation problem. The main motivation behind the development of such approaches is the goal of developing automated scheduling methods which are not restricted to one problem. In this paper we report the investigation of a hyperheuristic approach and evaluate it on various instances of two distinct timetabling and rostering problems. In the framework of our hyperheuristic approach, heuristics compete using rules based on the principles of reinforcement learning. A tabu list of heuristics is also maintained which prevents certain heuristics from being chosen at certain times during the search. We demonstrate that this tabu-search hyperheuristic is an easily re-usable method which can produce solutions of at least acceptable quality across a variety of problems and instances. In effect the proposed method is capable of producing solutions that are competitive with those obtained using state-of-the-art problem-specific techniques for the problems studied here, but is fundamentally more general than those techniques. 相似文献
64.
本文研究了完全检验的质量控制问题,将广泛用于X-控制图的AT&T准则应用于完全检验,并根据完全检验的特点,提出一种新的最优模型,数值实验结果表明AT&T准则下的完全检验优于传统的完全检验。 相似文献
65.
In this paper the question of what classes A of T
0-spaces should be paired with classes of domains in order that all function spaces [AB] for AA and B are -compact domains is considered. It is shown that core compact spaces are paired with bounded complete domains and a class of topological spaces called RW-spaces (with finitely many components) is paired with the class of -compact pointed L-domains (L-domains). 相似文献
66.
This paper examines the complexity of global verification for MAX-SAT, MAX-k-SAT (for k3), Vertex Cover, and Traveling Salesman Problem. These results are obtained by adaptations of the transformations that prove such problems to be NP-complete. The class of problems PGS is defined to be those discrete optimization problems for which there exists a polynomial time algorithm such that given any solution , either a solution can be found with a better objective function value or it can be concluded that no such solution exists and is a global optimum. This paper demonstrates that if any one of MAX-SAT, MAX-k-SAT (for k3), Vertex Cover, or Traveling Salesman Problem are in PGS, then P=NP. 相似文献
67.
Direct Shooting Method for the Numerical Solution of Higher-Index DAE Optimal Control Problems 总被引:3,自引:0,他引:3
A method for the numerical solution of state-constrained optimal control problems subject to higher-index differential-algebraic equation (DAE) systems is introduced. For a broad and important class of DAE systems (semiexplicit systems with algebraic variables of different index), a direct multiple shooting method is developed. The multiple shooting method is based on the discretization of the optimal control problem and its transformation into a finite-dimensional nonlinear programming problem (NLP). Special attention is turned to the mandatory calculation of consistent initial values at the multiple shooting nodes within the iterative solution process of (NLP). Two different methods are proposed. The projection method guarantees consistency within each iteration, whereas the relaxation method achieves consistency only at an optimal solution. An illustrative example completes this article. 相似文献
68.
A process is considered whose quality deteriorates accordingto a constant failure intensity . As in practice it can be difficultto estimate the true value of the purpose of this paper isto present a strategy which can be applied without knowing .In order to maximize the number of conforming items per timeunit perfect inspections and renewals are performed. The lengthof the inspection interval is described by an arithmetical sequenceand changes by the time depending on perceived assignable causes.Optimal adaptive control plans provide nearly the same performanceas in the case when is known. 相似文献
69.
Consider a regular diffusion process X with finite speed measure m. Denote the normalized speed measure by μ. We prove that the uniform law of large numbers
holds if the class
has an envelope function that is μ-integrable, or if
is bounded in L
p(μ) for some p>1. In contrast with uniform laws of large numbers for i.i.d. random variables, we do not need conditions on the ‘size’ of
the class
in terms of bracketing or covering numbers. The result is a consequence of a number of asymptotic properties of diffusion
local time that we derive. We apply our abstract results to improve consistency results for the local time estimator (LTE)
and to prove consistency for a class of simple M-estimators.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
70.
Ana-Maria Matache Tomáš Roubíček Christoph Schwab 《Advances in Computational Mathematics》2003,19(1-3):73-97
The general theory of approximation of (possibly generalized) Young measures is presented, and concrete cases are investigated. An adjoint-operator approach, combined with quasi-interpolation of test integrands, is systematically used. Applicability is demonstrated on an optimal control problem for an elliptic system, together with one-dimensional illustrative calculations of various options. 相似文献