全文获取类型
收费全文 | 6749篇 |
免费 | 1144篇 |
国内免费 | 408篇 |
专业分类
化学 | 1999篇 |
晶体学 | 35篇 |
力学 | 489篇 |
综合类 | 238篇 |
数学 | 2481篇 |
物理学 | 3059篇 |
出版年
2024年 | 21篇 |
2023年 | 111篇 |
2022年 | 384篇 |
2021年 | 352篇 |
2020年 | 228篇 |
2019年 | 171篇 |
2018年 | 143篇 |
2017年 | 270篇 |
2016年 | 322篇 |
2015年 | 250篇 |
2014年 | 440篇 |
2013年 | 530篇 |
2012年 | 434篇 |
2011年 | 403篇 |
2010年 | 374篇 |
2009年 | 417篇 |
2008年 | 390篇 |
2007年 | 408篇 |
2006年 | 347篇 |
2005年 | 268篇 |
2004年 | 213篇 |
2003年 | 231篇 |
2002年 | 231篇 |
2001年 | 182篇 |
2000年 | 188篇 |
1999年 | 152篇 |
1998年 | 137篇 |
1997年 | 119篇 |
1996年 | 108篇 |
1995年 | 63篇 |
1994年 | 78篇 |
1993年 | 68篇 |
1992年 | 39篇 |
1991年 | 34篇 |
1990年 | 37篇 |
1989年 | 23篇 |
1988年 | 19篇 |
1987年 | 18篇 |
1986年 | 22篇 |
1985年 | 23篇 |
1984年 | 16篇 |
1982年 | 9篇 |
1981年 | 7篇 |
1979年 | 5篇 |
1978年 | 1篇 |
1977年 | 5篇 |
1975年 | 2篇 |
1972年 | 1篇 |
1967年 | 1篇 |
1959年 | 4篇 |
排序方式: 共有8301条查询结果,搜索用时 15 毫秒
61.
资源有限网络计划的PRWI启发式优化方法 总被引:1,自引:0,他引:1
本文在综合考虑了有资源约束的网络计划结构特征、资源强度、时间约束等方面因素的基础上,提出了一种新的资源优化的启发式优化方法—PRWI方法,并通过分析证明了该方法处理问题的效果较现有的其它方法好。 相似文献
62.
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. 相似文献
63.
提出了一种用于修正光学神经网络硬件系统误差的虚拟神经网络模型,光学实验结果表明该网络能够有效地消除硬件系统误差对实验结果的影响。 相似文献
64.
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. 相似文献
65.
In this paper, we analyze a discrete-time preemptive repeat priority queue with resampling. High-priority packets have preemptive
repeat priority, and interrupted low-priority packets are subjected to independent retransmission attempts. Both classes contain
packets with generally distributed transmission times. We show that the use of generating functions is beneficial for analyzing
the system contents and packet delay of both classes. The influence of the priority scheduling on the performance measures
is illustrated by some numerical examples.
This work has been supported by the Interuniversity Attraction Poles Programme–Belgian Science Policy. 相似文献
66.
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 相似文献
67.
M. Brazil 《Discrete Applied Mathematics》2006,154(18):2545-2564
The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalization of the classical Euclidean and rectilinear Steiner tree problems, with important applications to VLSI wiring design.A λ-tree is said to be locally minimal if its length cannot be reduced by small perturbations of its Steiner points. In this paper we prove that a λ-tree is locally minimal if and only if the length of each path in the tree cannot be reduced under a special parallel perturbation on paths known as a shift. This proves a conjecture on necessary and sufficient conditions for locally minimal λ-trees raised in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. For any path P in a λ-tree T, we then find a simple condition, based on the sum of all angles on one side of P, to determine whether a shift on P reduces, preserves, or increases the length of T. This result improves on our previous forbidden paths results in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. 相似文献
68.
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. 相似文献
69.
We examine the resource allocation problem of partitioning identical servers into two parallel pooling centers, and simultaneously
assigning job types to pooling centers. Each job type has a distinct Poisson arrival rate and a distinct holding cost per
unit time. Each pooling center becomes a queueing system with an exponential service time distribution. The goal is to minimize
the total holding cost. The problem is shown to be polynomial if a job type can be divided between the pooling centers, and
NP-hard if dividing job types is not possible. When there are two servers and jobs cannot be divided, we demonstrate that
the two pooling center configuration is rarely optimal. A heuristic which checks the single pooling center has an upper bound
on the relative error of 4/3. The heuristic is extended for the multiple server problem, where relative error is bounded above
by the number of servers.
相似文献
70.
In this paper the distribution of the maximum number of customers in a retrial orbit for a single server queue with Markovian
arrival process and phase type services is studied. Efficient algorithm for computing the probability distribution and some
interesting numerical examples are presented. 相似文献