首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3950篇
  国内免费   56篇
  完全免费   154篇
  数学   4160篇
  2019年   71篇
  2018年   303篇
  2017年   233篇
  2016年   148篇
  2015年   192篇
  2014年   318篇
  2013年   692篇
  2012年   384篇
  2011年   368篇
  2010年   282篇
  2009年   306篇
  2008年   197篇
  2007年   189篇
  2006年   86篇
  2005年   82篇
  2004年   56篇
  2003年   44篇
  2002年   34篇
  2001年   25篇
  2000年   21篇
  1999年   21篇
  1998年   16篇
  1997年   22篇
  1996年   5篇
  1995年   8篇
  1994年   3篇
  1993年   4篇
  1992年   7篇
  1991年   2篇
  1990年   2篇
  1989年   2篇
  1987年   2篇
  1986年   2篇
  1985年   2篇
  1984年   1篇
  1982年   1篇
  1980年   6篇
  1979年   8篇
  1978年   2篇
  1977年   1篇
  1976年   2篇
  1975年   2篇
  1973年   5篇
  1972年   1篇
  1970年   1篇
  1967年   1篇
排序方式: 共有4160条查询结果,搜索用时 156 毫秒
1.
On queueing with customer impatience until the beginning of service   总被引:8,自引:0,他引:8  
Ali Movaghar 《Queueing Systems》1998,29(2-4):337-350
We study queueing systems where customers have strict deadlines until the beginning of their service. An analytic method is given for the analysis of a class of such queues, namely, models. These are queues with state-dependent Poisson arrival process, exponential service times, multiple servers, FCFS service discipline, and general customer impatience. The state of the system is viewed to be the number of customers in the system. The principal measure of performance is the probability measure induced by the offered waiting time. Other measures of interest are the probability of missing deadline and the probability of blocking. Closed-form solutions are derived for the steady-state probabilities of the state process and some important modeling variables and parameters. The efficacy of our method is illustrated through a numerical example. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献
2.
On queueing with customer impatience until the beginning of service   总被引:8,自引:0,他引:8  
Ali Movaghar 《Queueing Systems》1998,29(2-4):337-350
We study queueing systems where customers have strict deadlines until the beginning of their service. An analytic method is given for the analysis of a class of such queues, namely, models. These are queues with state-dependent Poisson arrival process, exponential service times, multiple servers, FCFS service discipline, and general customer impatience. The state of the system is viewed to be the number of customers in the system. The principal measure of performance is the probability measure induced by the offered waiting time. Other measures of interest are the probability of missing deadline and the probability of blocking. Closed-form solutions are derived for the steady-state probabilities of the state process and some important modeling variables and parameters. The efficacy of our method is illustrated through a numerical example. This revised version was published online in June 2006 with corrections to the Cover Date.  相似文献
3.
This paper considers the relationship of the major uncertainties of a project by using proposed approach. This approach by using rotary algorithm intellectualized the classic Monte Carlo simulation. This will help utility function to come closer to reality so that decision making and risk analysis would be done based on the real and possible modes, providing better conditions for decision making. Analyzing and investigating uncertainties are done in the risk management frame work. Because opportunities and threats are not separated, Monte Carlo simulation analysis is implemented as an integrated tool to reach the project goals, analyzing and investigating a variety of uncertainty permutations simultaneously. This method is a powerful tool for investigating the effects of all uncertainties’ occurrence, so it has noticeable benefits such as simultaneous consideration of uncertainties and the capability of representing several dimensions of utility function. In spite of these benefits, not considering the type and level of relationships, some permutations of uncertainties will occur that are not possible in real world. This would divert the utility function from reality. A simple example is used to illustrate the application of the model in practice.  相似文献
4.
For ap-variate normal mean with known variances, the model proposed by Zellner (1986,J. Amer. Statist. Assoc.,81, 446–451) is discussed in a slightly different framework. A generalized Bayes estimate is derived from a three-stage Bayes point of view under the asymmetric loss function, and the admissibility of such estimators is proved.  相似文献
5.
6.
Scott Brown's techniques for perturbations of decomposable operators   总被引:5,自引:0,他引:5  
Using Scott Brown's techniques, J. Eschmeier and B. Prunaru showed that if T is the restriction of a decomposable (or S-decomposable) operator B to an invariant subspace such that (T) is dominating in C/S for some closed set S, then T has an invariant subspace. In the present paper we prove various invariant subspace theorems by weakening the decomposability condition on B and strengthening the thickness condition on (T).The research is supported by a grant from the Institute for Studies in Theoretical Physics and Mathematics (IRAN).  相似文献
7.
The efficiency measures provided by DEA can be used for ranking Decision Making Units (DMUs), however, this ranking procedure does not yield relative rankings for those units with 100% efficiency. Andersen and Petersen have proposed a modified efficiency measure for efficient units which can be used for ranking, but this ranking breaks down in some cases, and can be unstable when one of the DMUs has a relatively small value for some of its inputs. This paper proposes an alternative efficiency measure, based on a different optimization problem that removes the difficulties.  相似文献
8.
Application of honey-bee mating optimization algorithm on clustering   总被引:4,自引:0,他引:4  
Cluster analysis is one of attractive data mining technique that use in many fields. One popular class of data clustering algorithms is the center based clustering algorithm. K-means used as a popular clustering method due to its simplicity and high speed in clustering large datasets. However, K-means has two shortcomings: dependency on the initial state and convergence to local optima and global solutions of large problems cannot found with reasonable amount of computation effort. In order to overcome local optima problem lots of studies done in clustering. Over the last decade, modeling the behavior of social insects, such as ants and bees, for the purpose of search and problem solving has been the context of the emerging area of swarm intelligence. Honey-bees are among the most closely studied social insects. Honey-bee mating may also be considered as a typical swarm-based approach to optimization, in which the search algorithm is inspired by the process of marriage in real honey-bee. Honey-bee has been used to model agent-based systems. In this paper, we proposed application of honeybee mating optimization in clustering (HBMK-means). We compared HBMK-means with other heuristics algorithm in clustering, such as GA, SA, TS, and ACO, by implementing them on several well-known datasets. Our finding shows that the proposed algorithm works than the best one.  相似文献
9.
In this paper, a method for estimating an attractor embedding dimension based on polynomial models and its application in investigating the dimension of Bremen climatic dynamics are presented. The attractor embedding dimension provides the primary knowledge for analyzing the invariant characteristics of the attractor and determines the number of necessary variables to model the dynamics. Therefore, the optimality of this dimension has an important role in computational efforts, analysis of the Lyapunov exponents, and efficiency of modeling and prediction. The smoothness property of the reconstructed map implies that, there is no self-intersection in the reconstructed attractor. The method of this paper relies on testing this property by locally fitting a general polynomial autoregressive model to the given data and evaluating the normalized one step ahead prediction error. The corresponding algorithms are developed in uni/multivariate form and some probable advantages of using information from other time series are discussed. The effectiveness of the proposed method is shown by simulation results of its application to some well-known chaotic benchmark systems. Finally, the proposed methodology is applied to two major dynamic components of the climate data of the Bremen city to estimate the related minimum attractor embedding dimension.  相似文献
10.
By using quasimonotone and pseudomonotone bifunctions, we derive sufficient conditions which include weak coercivity conditions for existence of equilibrium points. As a consequence, we improve some recent results on the existence of such solutions.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号