全文获取类型
收费全文 | 961篇 |
免费 | 151篇 |
国内免费 | 30篇 |
专业分类
化学 | 45篇 |
晶体学 | 1篇 |
力学 | 24篇 |
综合类 | 19篇 |
数学 | 803篇 |
物理学 | 250篇 |
出版年
2024年 | 1篇 |
2023年 | 14篇 |
2022年 | 26篇 |
2021年 | 35篇 |
2020年 | 29篇 |
2019年 | 27篇 |
2018年 | 21篇 |
2017年 | 29篇 |
2016年 | 34篇 |
2015年 | 23篇 |
2014年 | 59篇 |
2013年 | 43篇 |
2012年 | 48篇 |
2011年 | 54篇 |
2010年 | 57篇 |
2009年 | 49篇 |
2008年 | 59篇 |
2007年 | 54篇 |
2006年 | 63篇 |
2005年 | 33篇 |
2004年 | 20篇 |
2003年 | 35篇 |
2002年 | 34篇 |
2001年 | 23篇 |
2000年 | 27篇 |
1999年 | 19篇 |
1998年 | 31篇 |
1997年 | 17篇 |
1996年 | 22篇 |
1995年 | 19篇 |
1994年 | 19篇 |
1993年 | 12篇 |
1992年 | 14篇 |
1991年 | 12篇 |
1990年 | 19篇 |
1989年 | 10篇 |
1988年 | 6篇 |
1987年 | 19篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1984年 | 9篇 |
1983年 | 1篇 |
1982年 | 3篇 |
1978年 | 1篇 |
1975年 | 2篇 |
1973年 | 1篇 |
1968年 | 1篇 |
排序方式: 共有1142条查询结果,搜索用时 15 毫秒
1.
An M/G/1 retrial queueing system with additional phase of service and possible preemptive resume service discipline is considered. For an arbitrarily distributed retrial time distribution, the necessary and sufficient condition for the system stability is obtained, assuming that only the customer at the head of the orbit has priority access to the server. The steady-state distributions of the server state and the number of customers in the orbit are obtained along with other performance measures. The effects of various parameters on the system performance are analysed numerically. A general decomposition law for this retrial queueing system is established. 相似文献
2.
设f是非常数亚纯函数,g是f的线性微分多项式.a和b是f的两个不同的小函数.本文证明如果f和g几乎CM分担a和b,则f≡g;此外,若f是非常数整函数,且f和f(k)(k≥1)IM分担a和b,b-a≠Peλz,测f≡g. 相似文献
3.
Indrajit Lahiri 《Journal of Mathematical Analysis and Applications》2002,271(1):206-216
In this paper we prove a uniqueness theorem for meromorphic functions sharing three values with some weight which improves some known results. 相似文献
4.
5.
We discuss the approximation of performance measures in multi-class M/M/k queues with preemptive priorities for large problem instances (many classes and servers) using class aggregation and server reduction. We compared our approximations to exact and simulation results and found that our approach yields small-to-moderate approximation errors. 相似文献
6.
We consider two queues in tandem, each with an exponential server, and with deterministic arrivals to the first queue. We
obtain an explicit solution for the steady state distribution of the process (N1(t), N2(t), Y(t)), where Nj(t) is the queue length in the jth queue and Y(t) measures the time elapsed since the last arrival. Then we obtain the marginal distributions of (N1(t), N2(t)) and of N2(t). We also evaluate the solution in various limiting cases, such as heavy traffic.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
7.
We establish the optimal asymptotic decay rate of per-session queue length tail distributions for a two-queue system where
a single constant rate server serves the two queues using the Generalized Processor Sharing (GPS) scheduling discipline. The
result is obtained using the sample-path large deviation principle and has implications in call admission control for high-speed
communication networks.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
8.
We consider the following Type of problems. Calls arrive at a queue of capacity K (which is called the primary queue), and attempt to get served by a single server. If upon arrival, the queue is full and
the server is busy, the new arriving call moves into an infinite capacity orbit, from which it makes new attempts to reach
the primary queue, until it finds it non-full (or it finds the server idle). If the queue is not full upon arrival, then the
call (customer) waits in line, and will be served according to the FIFO order. If λ is the arrival rate (average number per
time unit) of calls and μ is one over the expected service time in the facility, it is well known that μ > λ is not always
sufficient for stability. The aim of this paper is to provide general conditions under which it is a sufficient condition.
In particular, (i) we derive conditions for Harris ergodicity and obtain bounds for the rate of convergence to the steady
state and large deviations results, in the case that the inter-arrival times, retrial times and service times are independent
i.i.d. sequences and the retrial times are exponentially distributed; (ii) we establish conditions for strong coupling convergence
to a stationary regime when either service times are general stationary ergodic (no independence assumption), and inter-arrival
and retrial times are i.i.d. exponentially distributed; or when inter-arrival times are general stationary ergodic, and service
and retrial times are i.i.d. exponentially distributed; (iii) we obtain conditions for the existence of uniform exponential
bounds of the queue length process under some rather broad conditions on the retrial process. We finally present conditions
for boundedness in distribution for the case of nonpatient (or non persistent) customers.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
9.
Ross Anderson Cunsheng Ding Tor Helleseth Torleiv Klove 《Designs, Codes and Cryptography》1998,15(2):111-124
Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes. 相似文献
10.
In this paper we consider the (t, n)-threshold visual secret sharing scheme (VSSS) in which black pixels in a secret black-white images is reproduced perfectly
as black pixels when we stack arbitrary t shares. This paper provides a new characterization of the (t, n)-threshold visual secret sharing scheme with such a property (hereafter, we call such a VSSS the (t, n)-PBVSSS for short). We use an algebraic method to characterize basis matrices of the (t, n)-PBVSSS in a certain class of matrices. We show that the set of all homogeneous polynomials each element of which yields
basis matrices of the (t, n)-PBVSSS becomes a set of lattice points in an (n−t+1)-dimensional linear space. In addition, we prove that the optimal basis matrices in the sense of maximizing the relative
difference among all the basis matrices in the class coincides with the basis matrices given by Blundo, Bonis and De Santis
[3] for all n≥ t ≥ 2. 相似文献