全文获取类型
收费全文 | 5236篇 |
免费 | 645篇 |
国内免费 | 254篇 |
专业分类
化学 | 226篇 |
晶体学 | 10篇 |
力学 | 293篇 |
综合类 | 48篇 |
数学 | 2249篇 |
物理学 | 1188篇 |
无线电 | 2121篇 |
出版年
2024年 | 6篇 |
2023年 | 52篇 |
2022年 | 77篇 |
2021年 | 102篇 |
2020年 | 121篇 |
2019年 | 123篇 |
2018年 | 127篇 |
2017年 | 165篇 |
2016年 | 190篇 |
2015年 | 169篇 |
2014年 | 315篇 |
2013年 | 354篇 |
2012年 | 272篇 |
2011年 | 371篇 |
2010年 | 337篇 |
2009年 | 285篇 |
2008年 | 326篇 |
2007年 | 384篇 |
2006年 | 283篇 |
2005年 | 278篇 |
2004年 | 267篇 |
2003年 | 228篇 |
2002年 | 173篇 |
2001年 | 153篇 |
2000年 | 143篇 |
1999年 | 130篇 |
1998年 | 100篇 |
1997年 | 91篇 |
1996年 | 55篇 |
1995年 | 71篇 |
1994年 | 54篇 |
1993年 | 38篇 |
1992年 | 41篇 |
1991年 | 34篇 |
1990年 | 22篇 |
1989年 | 21篇 |
1988年 | 20篇 |
1987年 | 23篇 |
1986年 | 10篇 |
1985年 | 24篇 |
1984年 | 16篇 |
1983年 | 12篇 |
1982年 | 9篇 |
1981年 | 11篇 |
1980年 | 11篇 |
1979年 | 9篇 |
1978年 | 6篇 |
1977年 | 7篇 |
1976年 | 5篇 |
1975年 | 4篇 |
排序方式: 共有6135条查询结果,搜索用时 195 毫秒
81.
Xiangqing Tian Xiaoqiong Qi Qiongfang Ma Xiaoping Zhang 《Photonic Network Communications》2006,11(3):271-276
A new design scheme for a distributed algorithm for routing and wavelength assignment (RWA) is developed in this paper, and
the communication rules between the nodes to exchange signaling packets are discussed. The Adaptive-Alternate-Routing-Least-Load
(AARLL) algorithm is implemented in the distributed scheme for the first time. Under dynamic traffic circumstances, the influence
of the race condition, which does not exist in centralized scheme, on the network performance is analyzed and the analyzed
results show that the race condition has a major impact on network performance only under light traffic load, while under
medium and heavy traffic load the impact is very small. To analyze the performance loss caused by adopting the distributed
algorithm for RWA, the capacity loss factor (CLF) is introduced and the calculated results show that CLF does not exceed 6%
under medium traffic load. 相似文献
82.
保险公司离散型崩溃模型研究 总被引:4,自引:1,他引:3
本文提出并讨论了含投资因素、红利分配因素的崩溃模型,得出了关于崩溃概率、保险公司的期望寿命的结论,这些结论推广了没有考虑投资因素的崩溃模型的相关结论. 相似文献
83.
Noga Alon Oded Goldreich Johan Hstad Ren Peralta 《Random Structures and Algorithms》1992,3(3):289-304
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 + o(1)) (log log n + k/2 + log k + log 1/?), where ? is the statistical difference between the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recently presented by Naor and Naor (our size bound is better as long as ? < 1/(k log n)). An additional advantage of our constructions is their simplicity. 相似文献
84.
OU Yang-jun LI Hong-jian DAI Xiao-yu 《半导体光子学与技术》2006,12(4):245-249,261
Based on the charge injection and recombination processes and the triplet-triplet annihilation process, a model to calculate the electro.luminescent(EL) efficiency is presented. The influences of the applied electric field on the injection efficiency, recombination efficiency and electroluminescent efficiency are discussed. It is found that: (1) The injection efficiency is increasing while the recombination efficiency is decreasing with the applied electric field increasing. (2) The EL efficiency is enhanced at low electric field slowly but is decreasing at high electric field with the increase of applied voltage. (3) The EL efficiency is decreasing with the increase of the host-guest molecular distance (R). So, it is concluded that the EL efficiency in single-layer organic electrophosphorescent devices is dominated by injection efficiency at lower electric field and recombination efficiency at higher electric field. 相似文献
85.
Ioannis D. Moscholios Michael D. Logothetis 《International Journal of Communication Systems》2006,19(1):67-93
We consider a single link loss system of quasi‐random input, described by the Engset multirate loss model (EnMLM). Blocked calls may once reattempt to be connected to the system requiring less bandwidth; then the system is described by the single retry model for finite sources (f‐SRM). The EnMLM and the f‐SRM are extended with the single threshold finite source model (f‐STM), where calls may attempt to be connected to the system with less bandwidth requirements, according to the link occupancy, before blocking occurs. We focus on CBP equalization in the EnMLM, f‐SRM and f‐STM, under the bandwidth reservation (BR) policy. For this analysis, we apply two approximate methods, the Roberts' method and the method of reverse transition rates (RTR), which lead to a recursive CBP calculation. We evaluate the accuracy of the above models under the BR policy by comparing the analytical with simulation CBP results, based on the relative approximation errors (RAE). The results are highly satisfactory because they show that the proposed models (formulas) lead to small RAE. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
86.
事物未来的状态仅仅受事物现状的影响,而与过去的状态无关,也就是具有马尔可夫性。用马尔可夫链的理论与方法,对具有马尔可夫性产品的可靠性进行预测,既为产品的可靠性设计和产品售后服务的经济性分析提供了参考,也为马尔可夫模型的实际应用拓广了范围。通过实例说明在数学软件的帮助下这种预测方法的简单可行性。 相似文献
87.
We define a classical probability analogue of Voiculescu's free entropy dimension that we shall call the classical probability entropy dimension of a probability measure on Rn. We show that the classical probability entropy dimension of a measure is related with diverse other notions of dimension. First, it can be viewed as a kind of fractal dimension. Second, if one extends Bochner's inequalities to a measure by requiring that microstates around this measure asymptotically satisfy the classical Bochner's inequalities, then we show that the classical probability entropy dimension controls the rate of increase of optimal constants in Bochner's inequality for a measure regularized by convolution with the Gaussian law as the regularization is removed. We introduce a free analogue of the Bochner inequality and study the related free entropy dimension quantity. We show that it is greater or equal to the non-microstates free entropy dimension. 相似文献
88.
Discrete-time GI/Geo/1 queue with multiple working vacations 总被引:2,自引:0,他引:2
Consider the discrete time GI/Geo/1 queue with working vacations under EAS and LAS schemes. The server takes the original
work at the lower rate rather than completely stopping during the vacation period. Using the matrix-geometric solution method,
we obtain the steady-state distribution of the number of customers in the system and present the stochastic decomposition
property of the queue length. Furthermore, we find and verify the closed property of conditional probability for negative
binomial distributions. Using such property, we obtain the specific expression for the steady-state distribution of the waiting
time and explain its two conditional stochastic decomposition structures. Finally, two special models are presented.
相似文献
89.
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. 相似文献
90.
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. 相似文献