全文获取类型
收费全文 | 924篇 |
免费 | 91篇 |
国内免费 | 22篇 |
专业分类
化学 | 49篇 |
力学 | 21篇 |
综合类 | 16篇 |
数学 | 844篇 |
物理学 | 107篇 |
出版年
2023年 | 3篇 |
2022年 | 24篇 |
2021年 | 34篇 |
2020年 | 22篇 |
2019年 | 21篇 |
2018年 | 18篇 |
2017年 | 41篇 |
2016年 | 47篇 |
2015年 | 27篇 |
2014年 | 53篇 |
2013年 | 60篇 |
2012年 | 42篇 |
2011年 | 40篇 |
2010年 | 35篇 |
2009年 | 71篇 |
2008年 | 62篇 |
2007年 | 56篇 |
2006年 | 55篇 |
2005年 | 50篇 |
2004年 | 35篇 |
2003年 | 25篇 |
2002年 | 34篇 |
2001年 | 19篇 |
2000年 | 10篇 |
1999年 | 12篇 |
1998年 | 19篇 |
1997年 | 23篇 |
1996年 | 18篇 |
1995年 | 15篇 |
1994年 | 6篇 |
1993年 | 8篇 |
1992年 | 6篇 |
1991年 | 5篇 |
1990年 | 2篇 |
1989年 | 4篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 5篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 4篇 |
1981年 | 4篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1973年 | 2篇 |
排序方式: 共有1037条查询结果,搜索用时 169 毫秒
61.
刘正春 《数学的实践与认识》2004,34(6):32-37
基于 APT理论 ,在不允许卖空、并考虑交易成本的情况下 ,本文建立了多因素证券组合投资决策模型 ,然后利用遗传算法研究了模型的求解 相似文献
62.
Comparisons are made between the expected gain of a prophet (an observer with complete foresight) and the maximal expected gain of a gambler (using only non-anticipating stopping times) observing a sequence of independent, uniformly bounded random variables where a non-negative fixed cost is charged for each observation. Sharp universal bounds are obtained under various restrictions on the cost and the length of the sequence. For example, it is shown for X1, X2, … independent, [0, 1]-valued random variables that for all c ≥ 0 and all n ≥ 1 that E(max1 ≤ j ≤ n(Xj − jc)) − supt Tn E(Xt − tc) ≤ 1/e, where Tn is the collection of all stopping times t which are less than or equal to n almost surely. 相似文献
63.
J. H. Park 《Journal of Optimization Theory and Applications》2005,124(2):491-502
In this article, the guaranteed cost control problem for a class of neutral delay systems is investigated. A linear--quadratic cost function is considered as a performance measure for the closed-loop system. Based on the Lyapunov method, delay-dependent criteria, which are expressed in terms of matrix inequalities, are proposed to guarantee the asymptotic stability of the system. The matrix inequalities can be solved easily by various efficient optimization algorithms. 相似文献
64.
一种超高耐久混凝土——梯度结构混凝土 总被引:2,自引:1,他引:1
分析超高耐久混凝土的研究现状,提出了一种高耐久、低成本的超高耐久混凝土--梯度结构混凝土(Gradient Structural Concrete,简称GSC),采用电量法和氯离子扩散系数法来评价梯度结构混凝土的抗氯离子渗透性能,最后进行梯度结构混凝土的寿命预测与成本分析.结果表明,高性能混凝土(High Performance Concrete,简称HPC)、无细观界面过渡区水泥基复合材料(Meso-interfacial transition zone-free cement-based materials,简称 MIF)和梯度结构混凝土MIF-HPC的6 h导电量和氯离子扩散系数的排列顺序均为:HPC>MIF-HPC>MIF,其抗氯离子渗透性能排列顺序为:MIF>MIF-HPC>HPC.梯度结构混凝土的成本会有所增加,但由于其氯离子渗透性能大幅降低,其使用寿命得到大幅延长,使得其年损耗费用大幅下降. 相似文献
65.
基于智能化信息处理的建筑工程造价短期预测 总被引:1,自引:0,他引:1
提出了一种新的基于智能化信息处理的建筑工程造价短期预测模型.该模型首次利用数据的高阶统计信息,提出了改进独立分量分析技术.通过构建适用于建筑工程造价的属性重构空间,挖掘出表征能力更强的造价独立属性,用于神经网络的学习和训练,从而建立了全新的建筑工程造价短期预测智能模型.该模型通过发挥独立分量分析强大的信号分离能力,增强了神经网络的学习效率,提高了预测精度.实例数据验证了文中所建模型的有效性. 相似文献
66.
遗传算法求解带容量限制的最小费用流问题 总被引:1,自引:0,他引:1
研究了带容量限制的带固定费用和可变费用的最小费用流问题,发现该问题是混合0-1整数规划问题,不存在多项式算法.在研究了最优解的结构后,结合最优解的结构特点为之设计了遗传算法,然后构造了一个100个节点的特殊网络,用计算机做了100例计算,验证了该算法具有很好的近似比和很快的收敛速度. 相似文献
67.
Linn I. Sennott 《Mathematical Methods of Operations Research》1997,45(1):45-62
The Approximating Sequence Method for computation of average cost optimal stationary policies in denumerahle state Markov decision chains, introduced in Sennott (1994), is reviewed. New methods for verifying the assumptions are given. These are useful for models with multidimensional state spaces that satisfy certain mild structural properties. The results are applied to four problems in the optimal routing of packets to parallel queues. Numerical results are given for one of the models. 相似文献
68.
Linn I. Sennott 《Mathematical Methods of Operations Research》1994,39(2):209-225
Zero-sum stochastic games with countable state space and with finitely many moves available to each player in a given state are treated. As a function of the current state and the moves chosen, player I incurs a nonnegative cost and player II receives this as a reward. For both the discounted and average cost cases, assumptions are given for the game to have a finite value and for the existence of an optimal randomized stationary strategy pair. In the average cost case, the assumptions generalize those given in Sennott (1993) for the case of a Markov decision chain. Theorems of Hoffman and Karp (1966) and Nowak (1992) are obtained as corollaries. Sufficient conditions are given for the assumptions to hold. A flow control example illustrates the results. 相似文献
69.
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance. A well known example for such a case that this paper specifically deals with is the turning operation on a CNC machine. Manufacturing cost of a turning operation is a nonlinear convex function of its processing time. In this paper, we deal with making optimal machine-job assignments and processing time decisions so as to minimize total manufacturing cost while the makespan being upper bounded by a known value, denoted as ?-constraint approach for a bicriteria problem. We then give optimality properties for the resulting single criterion problem. We provide alternative methods to compute cost lower bounds for partial schedules, which are used in developing an exact (branch and bound) algorithm. For the cases where the exact algorithm is not efficient in terms of computation time, we present a recovering beam search algorithm equipped with an improvement search procedure. In order to find improving search directions, the improvement search algorithm uses the proposed cost bounding properties. Computational results show that our lower bounding methods in branch and bound algorithm achieve a significant reduction in the search tree size that we need to traverse. Also, our recovering beam search and improvement search heuristics achieve solutions within 1% of the optimum on the average while they spent much less computational effort than the exact algorithm. 相似文献
70.
We address scheduling problems with job-dependent due-dates and general (possibly nonlinear and asymmetric) earliness and tardiness costs. The number of distinct due-dates is substantially smaller than the number of jobs, thus jobs are partitioned to classes, where all jobs of a given class share a common due-date. We consider the settings of a single machine and parallel identical machines. Our objective is of a minmax type, i.e., we seek a schedule that minimizes the maximum earliness/tardiness cost among all jobs. 相似文献