全文获取类型
收费全文 | 2328篇 |
免费 | 283篇 |
国内免费 | 193篇 |
专业分类
化学 | 637篇 |
晶体学 | 17篇 |
力学 | 283篇 |
综合类 | 30篇 |
数学 | 704篇 |
物理学 | 1133篇 |
出版年
2024年 | 3篇 |
2023年 | 30篇 |
2022年 | 50篇 |
2021年 | 45篇 |
2020年 | 72篇 |
2019年 | 59篇 |
2018年 | 45篇 |
2017年 | 68篇 |
2016年 | 80篇 |
2015年 | 60篇 |
2014年 | 109篇 |
2013年 | 181篇 |
2012年 | 134篇 |
2011年 | 175篇 |
2010年 | 140篇 |
2009年 | 176篇 |
2008年 | 180篇 |
2007年 | 122篇 |
2006年 | 131篇 |
2005年 | 118篇 |
2004年 | 87篇 |
2003年 | 74篇 |
2002年 | 86篇 |
2001年 | 81篇 |
2000年 | 56篇 |
1999年 | 58篇 |
1998年 | 53篇 |
1997年 | 47篇 |
1996年 | 62篇 |
1995年 | 28篇 |
1994年 | 25篇 |
1993年 | 25篇 |
1992年 | 27篇 |
1991年 | 17篇 |
1990年 | 12篇 |
1989年 | 17篇 |
1988年 | 14篇 |
1987年 | 12篇 |
1986年 | 6篇 |
1985年 | 8篇 |
1984年 | 10篇 |
1983年 | 3篇 |
1982年 | 6篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1978年 | 3篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有2804条查询结果,搜索用时 15 毫秒
31.
具有位相型修理的离散时间可修排队系统 总被引:1,自引:0,他引:1
本文研究了具有一般独立输入,位相型修理的离散时间可修排队系统,假定服务台对顾客的服务时间和服务台寿命服从几何分布,运用矩阵解析方法我们给出系统嵌入在到达时刻的稳态队长分布和等待时间分布,并证明这些分布均为离散位相型分布.我们也得到在广义服务时间内服务台发生故障次数的分布,证明它服从一个修正的几何分布.我们对离散时间可修排队与连续时间可修排队进行了比较,说明这两种排队系统在一些性能指标方面的区别之处.最后我们通过一些数值例子说明在这类系统中顾客的到达过程、服务时间和服务台的故障率之间的关系. 相似文献
32.
33.
R.A. Gunasekaran M. Agarwal A. Singh P. Dubasi P. Coane K. Varahramyan 《Optics and Lasers in Engineering》2005,43(6):1086
A novel small fluid controlled optical lens system that is capable of displaying dynamic variation of its focal length and field-of-view (FOV) is designed and fabricated. In this active lens system, appropriate volume of the optical fluid can be pumped into or out of the lens chamber to provide double-convex (DCX) or double-concave (DCV) lens effect. Simple optical imaging experiments were performed using different sets of glass lenses with fixed focal lengths to determine the optimum lens configuration required for designing a dynamic optical lens system. The experimental results obtained from the glass lenses demonstrate that a combination of a single DCX lens with three DCV lenses provides a wider FOV. The flexible membranes for fluid controlled lenses were fabricated using polydimethylsiloxane polymer material, which has good optical transparency and elasticity. A simple fluid injection system is used to vary the radius of curvature of the lenses, and thereby to change the focal length. A dynamic optical lens system with a combination of one DCX and multiple variable focal length DCV lenses as designed here can image an object with a wide range of focal length and FOV. With this fluid controlled optical system, the FOV and focal length could be continuously varied and a maximum FOV of 118.3° could be achieved. The smallest f-number (f/#) for this fluid controlled single lens system was found to be 1.3, which corresponds to the numerical aperture value of 0.35. 相似文献
34.
André Kündgen 《Discrete Mathematics》2005,296(1):121-128
A cycle cover (cut cover) of a graph G is a collection of cycles (cuts) of G that covers every edge of G at least once. The total size of a cycle cover (cut cover) is the sum of the number of edges of the cycles (cuts) in the cover.We discuss several results for cycle covers and the corresponding results for cut covers. Our main result is that every connected graph on n vertices and e edges has a cut cover of total size at most 2e-n+1 with equality precisely when every block of the graph is an odd cycle or a complete graph (other than K4 or K8). This corresponds to the result of Fan [J. Combin. Theory Ser. B 74 (1998) 353-367] that every graph without cut-edges has a cycle cover of total size at most e+n-1. 相似文献
35.
Mieko Tanaka-Yamawaki 《Annals of the Institute of Statistical Mathematics》2003,55(2):437-446
Contrary to the common sense in economics and financial engineering, price fluctuations at very fine level of motion exhibit
various evidences against the efficient market hypothesis. We attempt to investigate this issue by studying extensive amount
of foreign currency exchange data for over five years at the finest level of resolution. We specifically focus on the proposed
stability in binomial conditional probabilities originally found in much smaller examples of financial time series. In order
to handle very large data, we have written an efficient program in C that automatically generates those conditional probabilities.
It is found that the stability is maintained for extremely large time duration that covers almost the entire period. Based
on the length of conditions for which the conditional probabilities are distinguishable each other, we identify the length
of memory being less than 3 movements. 相似文献
36.
设k是一个正整数,G是一个顶点数为|G|=4k的图. 假设σ\-2(G)≥4k-1, 则G有一个支撑子图含k-1个4圈和一条顶点数为4的路,使得所有这些圈和路都是相互独立的. 设G=(V\-1,V \-2;E)是一个二分图使得|V\-1|=|V\-2|=2k. 如果对G中每一对满足x∈V\-1和y∈V\-2的不 相邻的顶点x和y 都有d(x)+d(y)≥2k+1, 则G包含k-1个相互独立的4圈和一条顶点数为4的路,使得所有这些圈和路都是相互独立的,并且此度条件是最好的. 相似文献
37.
PSN is a fast forward permutation if for each m the computational complexity of evaluating Pm(x) is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions. By studying the evolution of permutation graphs, we prove that the number of queries needed to distinguish a random cyclus from a random permutation in SN is Θ(N) if one does not use queries of the form Pm(x), but is only Θ(1) if one is allowed to make such queries. We construct fast forward permutations which are indistinguishable from random permutations even when queries of the form Pm(x) are allowed. This is done by introducing an efficient method to sample the cycle structure of a random permutation, which in turn solves an open problem of Naor and Reingold. 相似文献
38.
Consider a queueing system where customers arrive at a circle according to a homogeneous Poisson process. After choosing their positions on the circle, according to a uniform distribution, they wait for a single server who travels on the circle. The server's movement is modelled by a Brownian motion with drift. Whenever the server encounters a customer, he stops and serves this customer. The service times are independent, but arbitrarily distributed. The model generalizes the continuous cyclic polling system (the diffusion coefficient of the Brownian motion is zero in this case) and can be interpreted as a continuous version of a Markov polling system. Using Tweedie's lemma for positive recurrence of Markov chains with general state space, we show that the system is stable if and only if the traffic intensity is less than one. Moreover, we derive a stochastic decomposition result which leads to equilibrium equations for the stationary configuration of customers on the circle. Steady-state performance characteristics are determined, in particular the expected number of customers in the system as seen by a travelling server and at an arbitrary point in time. 相似文献
39.
S. W. Fuhrmann 《Queueing Systems》1992,11(1-2):109-120
Boxma and Groenendijk have shown that the workload in polling models decomposes into two independent variables. This paper demonstrates a different type of decomposition that has an explicit multi-dimensional form. This decomposition does not apply to all polling models, but does, for example, apply to models with constant switch-over times and either exhaustive or gated service disciplines. For such models, we show that the population of customers present in the system (represented by a vector indicating the number of customers at each queue) at key time points breaks into two independent subpopulations: (1) the population of customers present in the related model with zero switch-over times; (2) another population, which is particularly easy to analyze. This result has a number of theoretical and applied implications. 相似文献
40.