全文获取类型
收费全文 | 1050篇 |
免费 | 28篇 |
国内免费 | 35篇 |
专业分类
化学 | 31篇 |
晶体学 | 3篇 |
力学 | 20篇 |
综合类 | 7篇 |
数学 | 832篇 |
物理学 | 220篇 |
出版年
2023年 | 7篇 |
2022年 | 15篇 |
2021年 | 17篇 |
2020年 | 11篇 |
2019年 | 14篇 |
2018年 | 11篇 |
2017年 | 24篇 |
2016年 | 24篇 |
2015年 | 14篇 |
2014年 | 53篇 |
2013年 | 55篇 |
2012年 | 33篇 |
2011年 | 50篇 |
2010年 | 51篇 |
2009年 | 66篇 |
2008年 | 73篇 |
2007年 | 63篇 |
2006年 | 69篇 |
2005年 | 60篇 |
2004年 | 28篇 |
2003年 | 46篇 |
2002年 | 33篇 |
2001年 | 31篇 |
2000年 | 28篇 |
1999年 | 23篇 |
1998年 | 14篇 |
1997年 | 26篇 |
1996年 | 21篇 |
1995年 | 21篇 |
1994年 | 23篇 |
1993年 | 14篇 |
1992年 | 10篇 |
1991年 | 17篇 |
1990年 | 10篇 |
1989年 | 11篇 |
1988年 | 11篇 |
1987年 | 11篇 |
1986年 | 2篇 |
1985年 | 3篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1980年 | 1篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 4篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有1113条查询结果,搜索用时 15 毫秒
11.
具有位相型修理的离散时间可修排队系统 总被引:1,自引:0,他引:1
本文研究了具有一般独立输入,位相型修理的离散时间可修排队系统,假定服务台对顾客的服务时间和服务台寿命服从几何分布,运用矩阵解析方法我们给出系统嵌入在到达时刻的稳态队长分布和等待时间分布,并证明这些分布均为离散位相型分布.我们也得到在广义服务时间内服务台发生故障次数的分布,证明它服从一个修正的几何分布.我们对离散时间可修排队与连续时间可修排队进行了比较,说明这两种排队系统在一些性能指标方面的区别之处.最后我们通过一些数值例子说明在这类系统中顾客的到达过程、服务时间和服务台的故障率之间的关系. 相似文献
12.
13.
We study a GI/M/c type queueing system with vacations in which all servers take vacations together when the system becomes empty. These servers keep taking synchronous vacations until they find waiting customers in the system at a vacation completion instant.The vacation time is a phase-type (PH) distributed random variable. Using embedded Markov chain modeling and the matrix geometric solution methods, we obtain explicit expressions for the stationary probability distributions of the queue length at arrivals and the waiting time. To compare the vacation model with the classical GI/M/c queue without vacations, we prove conditional stochastic decomposition properties for the queue length and the waiting time when all servers are busy. Our model is a generalization of several previous studies. 相似文献
14.
We study the vessel arrival process in bulk ports handling either cargo containers or minerals. Then we introduce the SHIP/G/1 queue to be able to study the queueing behavior at the port. We present approximations for the asymptotic probabilities of delay and the number of vessels at the port. Numerical examples show the accuracy of the approximations. In appendices, we provide details of the analysis of the number of vessels at the port and the correlation properties of the vessel arrival process. 相似文献
15.
This paper deals with the analysis of an M/M/c queueing system with setup times. This queueing model captures the major characteristics of phenomena occurring in production
when the system consists in a set of machines monitored by a single operator. We carry out an extensive analysis of the system
including limiting distribution of the system state, waiting time analysis, busy period and maximum queue length.
AMS subject classification: 90B22, 60K25 相似文献
16.
A Tandem Queue with Coupled Processors: Computational Issues 总被引:2,自引:0,他引:2
In Resing and Örmeci [16] it is shown that the two-stage tandem queue with coupled processors can be solved using the theory of boundary value problems. In this paper we consider the issues that arise when calculating performance measures like the mean queue length and the fraction of time a station is empty. It is assumed that jobs arrive at the first station according to a Poisson process and require service at both stations before leaving the system. The amount of work that a job requires at each of the stations is an independent, exponentially distributed random variable. When both stations are nonempty, the total service capacity is shared among the stations according to fixed proportions. When one of the stations becomes empty, the total service capacity is given to the nonempty station. We study the two-dimensional Markov process representing the numbers of jobs at the two stations. The problem of finding the generating function of the stationary distribution can be reduced to two different Riemann-Hilbert boundary value problems, where both problems yield a complete analytical solution. We discuss the similarities and differences between the two problems, and relate them to the computational aspects of obtaining performance measures. 相似文献
17.
The performance evaluation of many complex manufacturing, communication and computer systems has been made possible by modeling
them as queueing systems. Many approximations used in queueing theory have been drawn from the behavior of queues in light
and heavy traffic conditions. In this paper, we propose a new approximation technique, which combines the light and heavy
traffic characteristics. This interpolation approximation is based on the theory of multipoint Padé approximation which is
applied at two points: light and heavy traffic. We show how this can be applied for estimating the waiting time moments of
the GI/G/1 queue. The light traffic derivatives of any order can be evaluated using the MacLaurin series analysis procedure. The heavy
traffic limits of the GI/G/1 queue are well known in the literature. Our technique generalizes the previously developed interpolation approximations
and can be used to approximate any order of the waiting time moments. Through numerical examples, we show that the moments
of the steady state waiting time can be estimated with extremely high accuracy under all ranges of traffic intensities using
low orders of the approximant. We also present a framework for the development of simple analytical approximation formulas.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
18.
Hans van den Berg Michel Mandjes Rudesindo Núñez-Queija 《Operations Research Letters》2007,35(3):297-307
We study a processor-sharing model in which users choose between a high- and a low-priority service, based on their utility functions and prices charged by the service provider. The latter aims at revenue maximization. The model is motivated by file transmissions in data networks with distributed congestion control. 相似文献
19.
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. 相似文献
20.
This paper describes the k-means range algorithm, a combination of the partitional k-means clustering algorithm with a well known spatial data structure, namely the range tree, which allows fast range searches. It offers a real-time solution for the development of distributed interactive decision aids in e-commerce since it allows the consumer to model his preferences along multiple dimensions, search for product information, and then produce the data clusters of the products retrieved to enhance his purchase decisions. This paper also discusses the implications and advantages of this approach in the development of on-line shopping environments and consumer decision aids in traditional and mobile e-commerce applications. 相似文献