全文获取类型
收费全文 | 16187篇 |
免费 | 1442篇 |
国内免费 | 1079篇 |
专业分类
化学 | 1914篇 |
晶体学 | 21篇 |
力学 | 2422篇 |
综合类 | 170篇 |
数学 | 1722篇 |
物理学 | 1898篇 |
综合类 | 10561篇 |
出版年
2024年 | 68篇 |
2023年 | 202篇 |
2022年 | 349篇 |
2021年 | 381篇 |
2020年 | 433篇 |
2019年 | 371篇 |
2018年 | 385篇 |
2017年 | 485篇 |
2016年 | 531篇 |
2015年 | 574篇 |
2014年 | 711篇 |
2013年 | 909篇 |
2012年 | 936篇 |
2011年 | 909篇 |
2010年 | 695篇 |
2009年 | 774篇 |
2008年 | 754篇 |
2007年 | 933篇 |
2006年 | 940篇 |
2005年 | 863篇 |
2004年 | 795篇 |
2003年 | 738篇 |
2002年 | 604篇 |
2001年 | 530篇 |
2000年 | 528篇 |
1999年 | 462篇 |
1998年 | 364篇 |
1997年 | 346篇 |
1996年 | 343篇 |
1995年 | 261篇 |
1994年 | 245篇 |
1993年 | 203篇 |
1992年 | 201篇 |
1991年 | 150篇 |
1990年 | 163篇 |
1989年 | 129篇 |
1988年 | 127篇 |
1987年 | 93篇 |
1986年 | 58篇 |
1985年 | 35篇 |
1984年 | 27篇 |
1983年 | 9篇 |
1982年 | 27篇 |
1981年 | 13篇 |
1980年 | 5篇 |
1978年 | 8篇 |
1977年 | 7篇 |
1976年 | 4篇 |
1975年 | 4篇 |
1957年 | 13篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
11.
通过用动态规划给出化学反应器序列最小占用时间的设计方法,提出了一个过程的最优化输出设计,该设计在输出产品浓度给定的条件下建立问题的基本设计量和数学模型,利用动态规划原则确定各阶段的占用时间,使总的占用时间为最小值,能够合理的确定各阶段反应器的体积以取得较好的经济效应.图3,表1,参8. 相似文献
12.
We consider a resource management problem in which the management objective is to minimize fluctuations in resource stocks. Stabilizing management policies constitute the designing of memoryless state feedback control strategies for a discrete time resource model which contains unknown but bounded fluctuations. We also show that the problem of maximizing sustainable yield in an uncertain fishery can be considered as the problem of stabilizing of the stock level.The paper corresponds to an invited talk at the 14th Symposium on Operations Research, Ulm, September 6–8, 1989.The support by Yrjö Jahnsson Foundation is gratefully acknowledged.This work was supported by NSF and AFOSR under grant ECS 8602524. 相似文献
13.
Papert's (1978) appeal to reconsider the power and possibilities of the aesthetic in mathematics learning is often ignored in mathematics education research. This paper begins with the premise, put forth by Dewey (1934), that the aesthetic structures many dimensions of inquiry and experience. In the same way that using particular paintings, musical compositions, or even everyday experiences has been instrumental to attempts by philosophers to understand the aesthetic dimensions of meaning and experience in artistic domains, I propose that analysing a particular encounter with mathematics may help reveal the nature and role of the often nebulous responses of elegance, beauty, and `fit' to which mathematicians lay claim in their mathematical activity. To achieve this, I draw on and adapt the defining features of the aesthetic character of experience set forth by the aesthetician Beardsley (1982). This, in turn, sheds light on the role thataesthetics can play in mathematical inquiry and experience, and provides initial categories and conjectures that can be used to investigate the potential roles of aesthetics in mathematics learning contexts.This revised version was published online in September 2005 with corrections to the Cover Date. 相似文献
14.
15.
16.
ON HYPERBOLIC TIME DISCOUNTING IN EXHAUSTIBLE RESOURCE MODELS: AN APPLICATION TO WORLD OIL RESOURCES
JOHN ROWSE 《Natural Resource Modeling》2006,19(2):243-277
ABSTRACT. Recent research on discounting in long term economic models involves hyperbolic discounting, in which the marginal discount rate shrinks as time passes. To investigate hyperbolic discounting and exhaustible resource allocation, this work develops a discrete‐time world oil model and model solution procedure, then uses the model to examine the consequences of adopting conventional (constant annual) discounting when hyperbolic discounting is appropriate, of adopting one hyperbolic discount rate path when a different hyperbolic path is appropriate, and of adopting hyperbolic discounting when conventional discounting is appropriate. Five conventional and two hyperbolic discount rate paths are considered. One hyperbolic path is that used by Nordhaus and Boyer [2000]; the other is that recommended by Weitzman [2001]. The generality of the findings is also assessed. 相似文献
17.
Dalila B. M. M. Fontes Eleni Hadjiconstantinou Nicos Christofides 《Journal of Global Optimization》2006,34(1):97-125
In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations
of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on
the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving
transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation
of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial
solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as
a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively
improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications.
Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to
improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can
be obtained for concave cost network flow problems, particularly for fixed-charge problems. 相似文献
18.
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. 相似文献
19.
针对飞行动作数据随机性强与长度不一致的问题,提出通过减小动态时间规整(DTW)算法的搜索空间,并定义不同特征参数贡献度的概念,实现对飞行数据的多元时间序列融合,从而完成对战术机动动作的识别。通过引入预分类和细分类结合的方式,对动作数据进行预处理,然后根据改进的动态时间规整(WDTW)算法对待测数据进行识别。仿真实验表明,相比传统DTW算法,WDTW算法通过降低算法复杂度,识别计算时间变化明显;对核密度与精准度系数的分析表明识别准确率亦有所提高。实验结果验证了所提方法的准确性。 相似文献
20.