全文获取类型
收费全文 | 713篇 |
免费 | 42篇 |
国内免费 | 10篇 |
专业分类
化学 | 10篇 |
力学 | 5篇 |
综合类 | 2篇 |
数学 | 685篇 |
物理学 | 63篇 |
出版年
2024年 | 1篇 |
2023年 | 6篇 |
2022年 | 5篇 |
2021年 | 12篇 |
2020年 | 13篇 |
2019年 | 20篇 |
2018年 | 10篇 |
2017年 | 11篇 |
2016年 | 14篇 |
2015年 | 7篇 |
2014年 | 30篇 |
2013年 | 50篇 |
2012年 | 30篇 |
2011年 | 25篇 |
2010年 | 18篇 |
2009年 | 38篇 |
2008年 | 39篇 |
2007年 | 29篇 |
2006年 | 41篇 |
2005年 | 21篇 |
2004年 | 16篇 |
2003年 | 21篇 |
2002年 | 29篇 |
2001年 | 13篇 |
2000年 | 30篇 |
1999年 | 23篇 |
1998年 | 20篇 |
1997年 | 11篇 |
1996年 | 20篇 |
1995年 | 14篇 |
1994年 | 18篇 |
1993年 | 11篇 |
1992年 | 14篇 |
1991年 | 10篇 |
1990年 | 21篇 |
1989年 | 12篇 |
1988年 | 8篇 |
1987年 | 17篇 |
1986年 | 2篇 |
1985年 | 6篇 |
1984年 | 9篇 |
1983年 | 3篇 |
1982年 | 3篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 2篇 |
1976年 | 3篇 |
1975年 | 2篇 |
1974年 | 1篇 |
1973年 | 3篇 |
排序方式: 共有765条查询结果,搜索用时 15 毫秒
11.
Xuyang Lou 《Journal of Mathematical Analysis and Applications》2007,328(1):316-326
In this paper, the problem of stochastic stability for a class of time-delay Hopfield neural networks with Markovian jump parameters is investigated. The jumping parameters are modeled as a continuous-time, discrete-state Markov process. Without assuming the boundedness, monotonicity and differentiability of the activation functions, some results for delay-dependent stochastic stability criteria for the Markovian jumping Hopfield neural networks (MJDHNNs) with time-delay are developed. We establish that the sufficient conditions can be essentially solved in terms of linear matrix inequalities. 相似文献
12.
Richard O. LaMaire 《Queueing Systems》1992,11(4):357-375
We define and analyze anM/G/1/N vacation model that uses a service discipline that we call theE-limited with limit variation discipline. According to this discipline, the server provides service until either the system is emptied (i.e. exhausted) or a randomly chosen limit ofl customers has been served. The server then goes on a vacation before returning to service the queue again. The queue length distribution and the Laplace-Stieltjes transforms of the waiting time, busy period and cycle time distributions are found. Further, an expression for the mean waiting time is developed. Several previously analyzed service disciplines, including Bernoulli scheduling, nonexhaustive service and limited service, are special cases of the general varying limit discipline that is analyzed in this paper. 相似文献
13.
We consider a retrial queue with a finite buffer of size N, with arrivals of ordinary units and of negative units (which cancel one ordinary unit), both assumed to be Markovian arrival
processes. The service requirements are of phase type. In addition, a PHL,N bulk service discipline is assumed. This means that the units are served in groups of size at least L, where 1≤ L≤ N. If at the completion of a service fewer than L units are present at the buffer, the server switches off and waits until the buffer length reaches the threshold L. Then it switches on and initiates service for such a group of units. On the contrary, if at the completion of a service
L or more units are present at the buffer, all units enter service as a group. Units arriving when the buffer is full are not
lost, but they join a group of unsatisfied units called “orbit”. Our interest is in the continuous-time Markov chain describing
the state of the queue at arbitrary times, which constitutes a level dependent quasi-birth-and-death process. We start by
analyzing a simplified version of our queueing model, which is amenable to numerical calculation and is based on spatially
homogeneous quasi-birth-and-death processes. This leads to modified matrix-geometric formulas that reveal the basic qualitative
properties of our algorithmic approach for computing performance measures.
AMS Subject Classification: Primary 60K25 Secondary 68M20 90B22. 相似文献
14.
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. 相似文献
15.
El Kebir Boukas Peng Shi Sing Kiong Nguang 《Journal of Mathematical Analysis and Applications》2003,282(1):241-255
This paper studies the problem of stochastic stability and disturbance attenuation for a class of linear continuous-time uncertain systems with Markovian jumping parameters. The uncertainties are assumed to be nonlinear and state, control and external disturbance dependent. A sufficient condition is provided to solve the above problem. An H∞ controller is designed such that the resulting closed-loop system is stochastically stable and has a disturbance attenuation γ for all admissible uncertainties. It is shown that the control law is in terms of the solutions of a set of coupled Riccati inequalities. A numerical example is included to demonstrate the potential of the proposed technique. 相似文献
16.
In this paper the distribution of the maximum number of customers in a retrial orbit for a single server queue with Markovian
arrival process and phase type services is studied. Efficient algorithm for computing the probability distribution and some
interesting numerical examples are presented. 相似文献
17.
Hong Chen 《Queueing Systems》1989,5(4):281-293
We study a mixed problem of optimal scheduling and input and output control of a single server queue with multi-classes of customers. The model extends the classical optimal scheduling problem by allowing the general point processes as the arrival and departure processes and the control of the arrival and departure intensities. The objective of our scheduling and control problem is to minimize the expected discounted inventory cost over an infinite horizon, and the problem is formulated as an intensity control. We find the well-knownc is the optimal solution to our problem.Supported in part by NSF under grant ECS-8658157, by ONR under contract N00014-84-K-0465, and by a grant from AT&T Bell Laboratories.The work was done while the author was a postdoctoral fellow in the Division of Applied Sciences, Harvard University, Cambridge, Massachusetts 02138. 相似文献
18.
Richard F. Serfozo 《Queueing Systems》1989,5(1-3):5-36
A Markovian network process describes the movement of discrete units among a set of nodes that process the units. There is considerable knowledge of such networks, often called queueing networks, in which the nodes operate independently and the routes of the units are independent. The focus of this study, in contrast, is on networks with dependent nodes and routings. Examples of dependencies are parallel processing across several nodes, blocking of transitions because of capacity constraints on nodes, alternate routing of units to avoid congestion, and accelerating or decelerating the processing rate at a node depending on downstream congestion. We introduce a general network process representing the numbers of units at the nodes and derive its equilibrium distribution. This distribution takes the form of a product of functions of vectors in which the arguments of the functions satisfy an interchangeability property. This new type of distribution may apply to other multi-variate processes as well. A basic idea in our approach is a linking of certain micro-level balance properties of the network routing to the processing rates at the nodes. The link is via routing-balance partitions of nodes that are inherent in any network. A byproduct of this approach is a general characterization of blocking of transitions without the restriction that the process is reversible, which had been a standard assumption. We also give necessary and sufficient conditions under which a unit moving in the network sees a time average for the unmoved units (called the MUSTA property). Finally, we discuss when certain flows between nodes in an open network are Poisson processes.This research was sponsored in part by Air Force Office of Scientific Research contract 84-0367. 相似文献
19.
Shun-Chen Niu 《Queueing Systems》1988,3(2):157-178
We give in this paper a detailed sample-average analysis of GI/G/1 queues with the preemptive-resume LIFO (last-in-first-out) queue discipline: we study the long-run state behavior of the system by averaging over arrival epochs, departure epochs, as well as time, and obtain relations that express the resulting averages in terms of basic characteristics within busy cycles. These relations, together with the fact that the preemptive-resume LIFO queue discipline is work-conserving, imply new representations for both actual and virtual delays in standard GI/G/1 queues with the FIFO (first-in-first-out) queue discipline. The arguments by which our results are obtained unveil the underlying structural explanations for many classical and somewhat mysterious results relating to queue lengths and/or delays in standard GI/G/1 queues, including the well-known Bene's formula for the delay distribution in M/G/l. We also discuss how to extend our results to settings more general than GI/G/1. 相似文献
20.
Muhammad El-Taha 《Queueing Systems》1996,22(1-2):47-63
An input-output processZ = {Z(t), t 0} is said to be-rate stable ifZ(t) = o((t)) for some non-negative function(t). We prove that the processZ is -rate stable under weak conditions that include the assumption that input satisfies a linear burstiness condition and Z is asymptotically average stable. In many cases of interest, the conditions for-rate-stability can be verified from input data. For example, using input information, we establish-rate stability of the workload for multiserver queues, an ATM multiplexer, and-rate stability of queue-length processes for infinite server queues. 相似文献