全文获取类型
收费全文 | 699篇 |
免费 | 255篇 |
国内免费 | 5篇 |
专业分类
化学 | 10篇 |
力学 | 52篇 |
综合类 | 40篇 |
数学 | 405篇 |
物理学 | 452篇 |
出版年
2023年 | 9篇 |
2022年 | 17篇 |
2021年 | 19篇 |
2020年 | 16篇 |
2019年 | 15篇 |
2018年 | 18篇 |
2017年 | 27篇 |
2016年 | 33篇 |
2015年 | 19篇 |
2014年 | 57篇 |
2013年 | 63篇 |
2012年 | 56篇 |
2011年 | 64篇 |
2010年 | 48篇 |
2009年 | 76篇 |
2008年 | 55篇 |
2007年 | 55篇 |
2006年 | 48篇 |
2005年 | 33篇 |
2004年 | 27篇 |
2003年 | 28篇 |
2002年 | 34篇 |
2001年 | 17篇 |
2000年 | 17篇 |
1999年 | 13篇 |
1998年 | 16篇 |
1997年 | 14篇 |
1996年 | 3篇 |
1995年 | 7篇 |
1994年 | 14篇 |
1993年 | 8篇 |
1992年 | 6篇 |
1991年 | 5篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1984年 | 3篇 |
1983年 | 2篇 |
1979年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有959条查询结果,搜索用时 15 毫秒
1.
In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived. 相似文献
2.
3.
We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch. 相似文献
4.
5.
For vector quasivariational inequalities involving multifunctions in topological vector spaces, an existence result is obtained without a monotonicity assumption and with a convergence assumption weaker than semicontinuity. A new type of quasivariational inequality is proposed. Applications to quasicomplementarity problems and traffic network equilibria are considered. In particular, definitions of weak and strong Wardrop equilibria are introduced for the case of multivalued cost functions. 相似文献
6.
随机化交通灯的二维元胞自动机交通模型 总被引:8,自引:0,他引:8
元胞自动机交通模型以简单的规则反映交通系统中的多种因素,可以分析各种交通现象,且可在计算机上方便、高效地运作·Biham-Middleton-Levine模型(BML模型)实现了二维交通问题的元胞自动机模型的模拟研究·本文对BML模型作了改进,解除了该模型中关于交通灯同步变化的限制·在新模型中,每个路口的交通灯可以自由选定起始工作时间和变化节奏,于是可以更全面、准确地反映交通灯对交通系统性能的影响·本文还对新模型中出现的若干新效应作了解释· 相似文献
7.
In this paper, we present a unified treatment and analysis of a dynamic traffic network model with elastic demands formulated and studied as a projected dynamical system. We propose a travel route choice adjustment process that satisfies the projected dynamical system. Under certain conditions, stability and asymptotical stability of the equilibrium patterns are then derived. Finally, two discrete-time algorithms, the Euler method and the Heun method, are proposed for the computation of the solutions, and convergence results established. The convergence results depend crucially on stability analysis. The performance of the algorithms is then illustrated on several transportation networks. 相似文献
8.
We study the expected delay in cyclic polling models with general ‘branching-type’ service disciplines. For this class of
models, which contains models with exhaustive and gated service as special cases, we obtain closed-form expressions for the
expected delay under standard heavy-traffic scalings. We identify a single parameter associated with the service discipline
at each queue, which we call the ‘exhaustiveness’. We show that the scaled expected delay figures depend on the service policies
at the queues only through the exhaustiveness of each of the service disciplines. This implies that the influence of different
service disciplines, but with the same exhaustiveness, on the expected delays at the queues becomes the same when the system
reaches saturation. This observation leads to a new classification of the service disciplines. In addition, we show monotonicity
of the scaled expected delays with respect to the exhaustiveness of the service disciplines. This induces a complete ordering
in terms of efficiency of the service disciplines. The results also lead to new rules for optimization of the system performance
with respect to the service disciplines at the queues. Further, the exact asymptotic results suggest simple expected waiting-time
approximations for polling models in heavy traffic. Numerical experiments show that the accuracy of the approximations is
excellent for practical heavy-traffic scenarios.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
9.
Real-time packet traffic is characterized by a strict deadline on the end-to-end time delay and an upper bound on the information loss. Due to the high correlation among consecutive packets, the individual packet loss does not well characterize the performance of real-time packet sessions. An additional measure of packet loss is necessary to adequately assess the quality of each real-time connection. The additional measure considered here is the average number of consecutively lost packets, also called the average packet gap. We derive a closed form for the average packet gap for the multiclassG/G/m/B queueing system in equilibrium and show that it only depends on the loss behavior of two consecutive packets. This result considerably simplifies the monitoring process of real-time packet traffic sessions. If the packet loss process is markovian, the consecutive packet loss has a geometric distribution. 相似文献
10.
It is suggested that the question of existence of a jamming phase transition in a broad class of single-lane cellular-automaton traffic models may be studied using a correspondence to the asymmetric chipping model. In models where such correspondence is applicable, jamming phase transition does not take place. Rather, the system exhibits a smooth crossover between free-flow and jammed states, as the car density is increased. 相似文献