全文获取类型
收费全文 | 7758篇 |
免费 | 1321篇 |
国内免费 | 472篇 |
专业分类
化学 | 2405篇 |
晶体学 | 36篇 |
力学 | 596篇 |
综合类 | 263篇 |
数学 | 2567篇 |
物理学 | 3684篇 |
出版年
2024年 | 36篇 |
2023年 | 145篇 |
2022年 | 540篇 |
2021年 | 458篇 |
2020年 | 261篇 |
2019年 | 216篇 |
2018年 | 165篇 |
2017年 | 305篇 |
2016年 | 366篇 |
2015年 | 282篇 |
2014年 | 485篇 |
2013年 | 612篇 |
2012年 | 501篇 |
2011年 | 452篇 |
2010年 | 437篇 |
2009年 | 490篇 |
2008年 | 472篇 |
2007年 | 480篇 |
2006年 | 397篇 |
2005年 | 309篇 |
2004年 | 254篇 |
2003年 | 273篇 |
2002年 | 242篇 |
2001年 | 191篇 |
2000年 | 198篇 |
1999年 | 161篇 |
1998年 | 140篇 |
1997年 | 134篇 |
1996年 | 117篇 |
1995年 | 64篇 |
1994年 | 71篇 |
1993年 | 71篇 |
1992年 | 36篇 |
1991年 | 31篇 |
1990年 | 34篇 |
1989年 | 16篇 |
1988年 | 16篇 |
1987年 | 10篇 |
1986年 | 21篇 |
1985年 | 16篇 |
1984年 | 13篇 |
1982年 | 6篇 |
1981年 | 8篇 |
1979年 | 4篇 |
1977年 | 5篇 |
1975年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
1967年 | 1篇 |
1959年 | 4篇 |
排序方式: 共有9551条查询结果,搜索用时 15 毫秒
31.
面对多样化的市场需求,企业的销售渠道也变得异常复杂,利用网络图可以简化实际问题,并能形象地描述它。本根据网络知识建立了产品分销模型,探求企业在市场需求固定和随机时的最优收益。最后,章还进行实例验算,并做出相应的结果分析。 相似文献
32.
33.
资源有限网络计划的PRWI启发式优化方法 总被引:1,自引:0,他引:1
本文在综合考虑了有资源约束的网络计划结构特征、资源强度、时间约束等方面因素的基础上,提出了一种新的资源优化的启发式优化方法—PRWI方法,并通过分析证明了该方法处理问题的效果较现有的其它方法好。 相似文献
34.
Andrew V. Goldberg Michael D. Grigoriadis Robert E. Tarjan 《Mathematical Programming》1991,50(1-3):277-290
Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n
2
m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467. 相似文献
35.
In this paper, a model of translation gateway is proposed. The communications between IPv4 network and IPv6 network are realized by using the Microsoft intermediate driver technology in environment of Windows 2000. 相似文献
36.
We give an almost complete classification of ergodicity and transience conditions for a general multi-queue system with the
following features: arrivals form Poisson streams and there are various routing schemes for allocating arrivals to queues;
the servers can be configured in a variety of ways; completed jobs can feed back into the system; the exponential service
times and feedback probabilities depend upon the configuration of the servers (this model includes some types of multi-class
queueing system); switching between service regimes is instantaneous. Several different levels of control of the service regimes
are considered. Our results for the N-queue system require randomisation of service configurations but we have studied the two queue system in situations where
there is less control. We use the semi-martingale methods described in Fayolle, Malyshev and Menshikov [3] and our results
generalise Kurkova [8] and complement Foley and McDonald [4] and [5].
AMS 2000 subject classification: Primary: 90B22; Secondary: 60J10 90B15 相似文献
37.
Reverse-mode polymer stabilized cholesteric texture (PSCT) cells with various chiral dopant and monomer concentrations were fabricated. Experimental results indicate that the chiral dopant concentration and the monomer concentration significantly influence the threshold voltage and hysteresis of the cells. The chiral dopant and monomer deform the hysteresis loop. Increasing the monomer concentration reduces the width of the hysteresis loop of the reverse-mode PSCT cell. 相似文献
38.
模糊神经网络在复合地基沉降量预测中的应用 总被引:1,自引:0,他引:1
复合地基后期沉降变形对于建筑物设计及安全具有重要意义,针对通过长期沉降观测以得到复合地基的最终沉降需要耗费较多资源的问题,提出了一种基于模糊神经网络的预测方法.该方法考虑沉降变化过程有较大的随机性和模糊性,直接将样本数据进行模糊化,所得的模糊数代表了样本点集与控制点集中各分量之间的相关度,并依此建立模糊BP神经网络进行学习和估算.实验结果表明了该方法对沉降进行预测是可行与有效的,且在相对误差的有效控制方面优于BP网络方法与灰色方法. 相似文献
39.
A class of circuit-switching open queueing networks is discussed. The main result of the paper is that if extra message flows are not too intensive and the path distribution is mainly concentrated on the paths of (graph) distance 1 (nearest neighbour connections), then the network has a unique stationary working regime, no matter how large the configuration graph of the network is. Standard properties of this regime are established such as decay of correlation and continuity. 相似文献
40.
Richard F. Serfozo 《Queueing Systems》1989,5(1-3):5-36
A Markovian network process describes the movement of discrete units among a set of nodes that process the units. There is considerable knowledge of such networks, often called queueing networks, in which the nodes operate independently and the routes of the units are independent. The focus of this study, in contrast, is on networks with dependent nodes and routings. Examples of dependencies are parallel processing across several nodes, blocking of transitions because of capacity constraints on nodes, alternate routing of units to avoid congestion, and accelerating or decelerating the processing rate at a node depending on downstream congestion. We introduce a general network process representing the numbers of units at the nodes and derive its equilibrium distribution. This distribution takes the form of a product of functions of vectors in which the arguments of the functions satisfy an interchangeability property. This new type of distribution may apply to other multi-variate processes as well. A basic idea in our approach is a linking of certain micro-level balance properties of the network routing to the processing rates at the nodes. The link is via routing-balance partitions of nodes that are inherent in any network. A byproduct of this approach is a general characterization of blocking of transitions without the restriction that the process is reversible, which had been a standard assumption. We also give necessary and sufficient conditions under which a unit moving in the network sees a time average for the unmoved units (called the MUSTA property). Finally, we discuss when certain flows between nodes in an open network are Poisson processes.This research was sponsored in part by Air Force Office of Scientific Research contract 84-0367. 相似文献