全文获取类型
收费全文 | 278篇 |
免费 | 27篇 |
国内免费 | 9篇 |
专业分类
化学 | 32篇 |
力学 | 14篇 |
综合类 | 30篇 |
数学 | 190篇 |
物理学 | 48篇 |
出版年
2023年 | 3篇 |
2022年 | 4篇 |
2021年 | 9篇 |
2020年 | 5篇 |
2019年 | 5篇 |
2018年 | 4篇 |
2017年 | 14篇 |
2016年 | 5篇 |
2015年 | 7篇 |
2014年 | 8篇 |
2013年 | 14篇 |
2012年 | 11篇 |
2011年 | 14篇 |
2010年 | 13篇 |
2009年 | 15篇 |
2008年 | 21篇 |
2007年 | 11篇 |
2006年 | 20篇 |
2005年 | 18篇 |
2004年 | 10篇 |
2003年 | 9篇 |
2002年 | 9篇 |
2001年 | 5篇 |
2000年 | 6篇 |
1999年 | 8篇 |
1998年 | 8篇 |
1997年 | 5篇 |
1996年 | 4篇 |
1995年 | 5篇 |
1994年 | 8篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 4篇 |
1989年 | 6篇 |
1988年 | 5篇 |
1987年 | 7篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有314条查询结果,搜索用时 15 毫秒
1.
2.
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. 相似文献
3.
A. Puhalskii 《Queueing Systems》1995,21(1-2):5-66
We establish the large deviation principle (LDP) for the virtual waiting time and queue length processes in the GI/GI/1 queue. The rate functions are found explicitly. As an application, we obtain the logarithmic asymptotics of the probabilities that the virtual waiting time and queue length exceed high levels at large times. Additional new results deal with the LDP for renewal processes and with the derivation of unconditional LDPs for conditional ones. Our approach applies in large deviations ideas and methods of weak convergence theory.This work was supported in part by AT&T Bell Labs. 相似文献
4.
Masakiyo Miyazawa 《Queueing Systems》1994,15(1-4):1-58
We survey the rate conservation law, RCL for short, arising in queues and related stochastic models. RCL was recognized as one of the fundamental principles to get relationships between time and embedded averages such as the extended Little's formulaH=G, but we show that it has other applications. For example, RCL is one of the important techniques for deriving equilibrium equations for stochastic processes. It is shown that the various techniques, including Mecke's formula for a stationary random measure, can be formulated as RCL. For this purpose, we start with a new definition of the rate with respect to a random measure, and generalize RCL by using it. We further introduce the notion of quasi-expectation, which is a certain extension of the ordinary expectation, and derive RCL applicable to the sample average results. It means that the sample average formulas such asH=G can be obtained as the stationary RCL in the quasi-expectation framework. We also survey several extensions of RCL and discuss examples. Throughout the paper, we would like to emphasize how results can be easily obtained by using a simple principle, RCL. 相似文献
5.
J. Neveu 《Stochastic Processes and their Applications》1985,19(2):237-258
Given a stationary stochastic continuous demand of service σ(θtω) dt with ∫ σ(ω)P(dω) < 1, we construct real stationary point processes such that for a given constant D \2>0. These point processes correspond to a service discipline for which a single server services during the time intervals [Tn, Tn+1[ the demand of service accumulated during the proceding intervals [Tn?1, Tn[ and take a rest of fixed duration D. 相似文献
6.
A food web model with a closed nutrient cycle is presented and analyzed via Monte Carlo simulations. The model consists of three trophic levels, each of which is populated by animals of one distinct species. While the species at the intermediate level feeds on the basal species, and is eaten by the predators living at the highest level, the basal species itself uses the detritus of animals from higher levels as the food resource. The individual organisms remain localized, but the species can invade new lattice areas via proliferation. The impact of different proliferation strategies on the viability of the system is investigated. From the phase diagrams generated in the simulations it follows that in general a strategy with the intermediate level species searching for food is the best for the survival of the system. The results indicate that both the intermediate and top level species play a critical role in maintaining the structure of the system. 相似文献
7.
8.
Hyojin Lee Chi P. Huynh Stephen C. Hawkins Mustafa Musameh Dae Hyung Kim 《Liquid crystals》2013,40(3):322-327
We investigated the orientational and electro-optical properties of a nematic liquid crystal (LC) aligned with a directly spinnable carbon nanotube (CNT) web functioning both as an electrode and as an alignment layer. The LC molecules were uniformly oriented along the drawing direction of the CNT web and the spatially averaged birefringence was comparable to a rubbed polyimide sample. The CNT web sample also showed smaller residual DC and hysteresis compared to the polyimide sample. 相似文献
9.
常规Webshell检测方法一般基于代码特征库和基于通信特征. 代码混淆和虚假通信等反检测技术的出现, 提升了Webshell隐蔽度, 常规方法难于发现. 为了检测此类隐蔽度较高的Webshell, 采用了抽取程序代码多维Webshell特征, 用余弦相似计算原理度量代码文件间的相似度, 平均相似度极低的文件即为可疑Webshell文件. 实验表明, 正常代码文件间的平均相似度在10-1~10-2量级, 而Webshell文件和正常代码文件的平均相似度在10-4量级, 此方法可以有效地检测出Webshell. 相似文献
10.
We consider a single server unreliable queue represented by a 2-dimensional continuous-time Markov chain. At failure times, the present customers leave the system. Moreover, customers become impatient and perform synchronized abandonments, as long as the server is down. We analyze this model and derive the main performance measures using results from the basic q-hypergeometric series. 相似文献