全文获取类型
收费全文 | 3393篇 |
免费 | 126篇 |
国内免费 | 141篇 |
专业分类
化学 | 72篇 |
晶体学 | 2篇 |
力学 | 55篇 |
综合类 | 36篇 |
数学 | 3147篇 |
物理学 | 348篇 |
出版年
2024年 | 4篇 |
2023年 | 18篇 |
2022年 | 34篇 |
2021年 | 71篇 |
2020年 | 65篇 |
2019年 | 74篇 |
2018年 | 77篇 |
2017年 | 69篇 |
2016年 | 98篇 |
2015年 | 61篇 |
2014年 | 119篇 |
2013年 | 346篇 |
2012年 | 128篇 |
2011年 | 150篇 |
2010年 | 121篇 |
2009年 | 187篇 |
2008年 | 198篇 |
2007年 | 215篇 |
2006年 | 161篇 |
2005年 | 137篇 |
2004年 | 100篇 |
2003年 | 126篇 |
2002年 | 126篇 |
2001年 | 116篇 |
2000年 | 98篇 |
1999年 | 98篇 |
1998年 | 75篇 |
1997年 | 72篇 |
1996年 | 59篇 |
1995年 | 58篇 |
1994年 | 55篇 |
1993年 | 27篇 |
1992年 | 29篇 |
1991年 | 38篇 |
1990年 | 19篇 |
1989年 | 23篇 |
1988年 | 21篇 |
1987年 | 18篇 |
1986年 | 14篇 |
1985年 | 31篇 |
1984年 | 19篇 |
1983年 | 16篇 |
1982年 | 15篇 |
1981年 | 6篇 |
1980年 | 8篇 |
1979年 | 19篇 |
1978年 | 7篇 |
1977年 | 14篇 |
1976年 | 6篇 |
1975年 | 7篇 |
排序方式: 共有3660条查询结果,搜索用时 15 毫秒
81.
设M=(m_(ij))是一个b×b阶矩阵且m_(ij)∈{0,1},∑_(M)是矩阵M=(m_(ij))诱导产生的有限型,σ是其上左推移算子.本文主要研究的是有限型动力系统(∑_(M),σ)上的首次返回速度问题.令τ_(k)(x)是点x∈∑_(M)首次返回到包含x的k阶柱集时间,且E_(α,β)={x∈∑_(M):lim inf_(k→∞)(logτ_(k)(x))/k=α,lim sup_(k→∞)(logτ_(k)(x))/k=β}.我们证明了:当M是不可约矩阵时,对任意0≤α≤β≤+∞,集合E_(α,β)的Markov测度要么等于0要么等于1并且具有满的Hausdorff维数. 相似文献
82.
In this article, a novel method is proposed for investigating the set controllability of Markov jump switching Boolean control networks (MJSBCNs). Specifically, the switching signal is described as a discrete-time homogeneous Markov chain. By resorting to the expectation and switching indicator function, an expectation system is constructed. Based on the expectation system, a novel verifiable condition is established for solving the set reachability of MJSBCNs. With the newly obtained results on set reachability, a necessary and sufficient condition is further derived for the set controllability of MJSBCNs. The obtained results are applied to Boolean control networks with Markov jump time delays. Examples are demonstrated to justify the theoretical results. 相似文献
83.
Anthony J. D'Aristotile 《Journal of Theoretical Probability》1995,8(2):321-346
LetX be the collection ofk-dimensional subspaces of ann-dimensional vector spaceV
n overGF(q). A metric may be defined onX by letting
相似文献
84.
Consider anM/M/1 queueing system with server vacations where the server is turned off as soon as the queue gets empty. We assume that the vacation durations form a sequence of i.i.d. random variables with exponential distribution. At the end of a vacation period, the server may either be turned on if the queue is non empty or take another vacation. The following costs are incurred: a holding cost ofh per unit of time and per customer in the system and a fixed cost of each time the server is turned on. We show that there exists a threshold policy that minimizes the long-run average cost criterion. The approach we use was first proposed in Blanc et al. (1990) and enables us to determine explicitly the optimal threshold and the optimal long-run average cost in terms of the model parameters. 相似文献
85.
The distributions of two--block--factors arising from i.i.d. sequences are observed to coincide with the distributions of the superdiagonals of jointly exchangeable and dissociated arrays . An inequality for superdiagonal probabilities of the arrays is presented. It provides, together with the observation, a simple proof of the fact that a special one--dependent Markov sequence of Aaronson, Gilat and Keane (1992) is not a two--block factor.
86.
We consider a matched queueing network PH/M/coPH/PH/1, where the output of the first subsystem PH/M/c is regarded as one of the inputs of the second subsystem and matched with another input of PH-renewal process, and they are served by a single server with PH-service-distribution. The stationary state probabilities, the distribution of the virtual waiting times in the two subsystems, and the distribution of the total virtual waiting time are derived.The work was supported by the Max-Planck-Gesellschaft, Germany, and the Chinese Academy ofSciences. 相似文献
87.
Random walk on distant mesh points Monte Carlo methods 总被引:1,自引:0,他引:1
A new technique for obtaining Monte Carlo algorithms based on the Markov chains with a finite number of states is suggested. Instead of the classical random walk on neighboring mesh points, a general way of constructing Monte Carlo algorithms that could be called random walk on distant mesh points is considered. It is applied to solve boundary value problems. The numerical examples indicate that the new methods are less laborious and therefore more efficient.In conclusion, we mention that all Monte Carlo algorithms are parallel and could be easily realized on parallel computers. 相似文献
88.
Elisabetta Scoppola 《Journal of statistical physics》1993,73(1-2):83-121
In this paper we introduce a new renormalization group method for the study of the long-time behavior of Markov chains with finite state space and with transition probabilities exponentially small in an external parameter. A general approach of metastability problems emerges from this analysis and is discussed in detail in the case of a two-dimensional Ising system at low temperature, 相似文献
89.
Basilis Gidas 《Journal of statistical physics》1985,39(1-2):73-131
We study the asymptotic behavior as timet + of certain nonstationary Markov chains, and prove the convergence of the annealing algorithm in Monte Carlo simulations. We find that in the limitt + , a nonstationary Markov chain may exhibit phase transitions. Nonstationary Markov chains in general, and the annealing algorithm in particular, lead to biased estimators for the expectation values of the process. We compute the leading terms in the bias and the variance of the sample-means estimator. We find that the annealing algorithm converges if the temperatureT(t) goes to zero no faster thanC/log(t/t
0) ast+, with a computable constantC andt
0 the initial time. The bias and the variance of the sample-means estimator in the annealing algorithm go to zero likeO(t–1+) for some 0<1, with =0 only in very special circumstances. Our results concerning the convergence of the annealing algorithm, and the rate of convergence to zero of the bias and the variance of the sample-means estimator, provide a rigorous procedure for choosing the optimal annealing schedule. This optimal choice reflects the competition between two physical effects: (a) The adiabatic effect, whereby if the temperature is loweredtoo abruptly the system may end up not in a ground state but in a nearby metastable state, and (b) the super-cooling effect, whereby if the temperature is loweredtoo slowly the system will indeed approach the ground state(s) but may do so extremely slowly. 相似文献
90.
We investigate a piecewise linear (area-preserving) mapT describing two coupled baker transformations on two squares, with coupling parameter 0c1. The resulting dynamical system is Kolmogorov for anyc0. For rational values ofc, we construct a generating partition on whichT induces a Markov chain. This Markov structure is used to discuss the decay of correlation functions: exponential decay is found for a class of functions related to the partition. Explicit results are given forc=2–n. The macroscopic analog of our model is a leaking process between two (badly) stirred containers: according to the Markov analysis, the corresponding progress variable decays exponentially, but the rate coefficients characterizing this decay are not those determined from the one-way flux across the cell boundary. The validity of the macroscopic rate law is discussed. 相似文献
|