全文获取类型
收费全文 | 4443篇 |
免费 | 216篇 |
国内免费 | 209篇 |
专业分类
化学 | 203篇 |
晶体学 | 2篇 |
力学 | 78篇 |
综合类 | 83篇 |
数学 | 3963篇 |
物理学 | 539篇 |
出版年
2023年 | 29篇 |
2022年 | 70篇 |
2021年 | 99篇 |
2020年 | 94篇 |
2019年 | 114篇 |
2018年 | 105篇 |
2017年 | 111篇 |
2016年 | 131篇 |
2015年 | 87篇 |
2014年 | 168篇 |
2013年 | 448篇 |
2012年 | 171篇 |
2011年 | 198篇 |
2010年 | 188篇 |
2009年 | 248篇 |
2008年 | 277篇 |
2007年 | 290篇 |
2006年 | 220篇 |
2005年 | 164篇 |
2004年 | 143篇 |
2003年 | 165篇 |
2002年 | 157篇 |
2001年 | 146篇 |
2000年 | 122篇 |
1999年 | 118篇 |
1998年 | 104篇 |
1997年 | 77篇 |
1996年 | 79篇 |
1995年 | 72篇 |
1994年 | 67篇 |
1993年 | 34篇 |
1992年 | 32篇 |
1991年 | 45篇 |
1990年 | 25篇 |
1989年 | 27篇 |
1988年 | 21篇 |
1987年 | 21篇 |
1986年 | 22篇 |
1985年 | 35篇 |
1984年 | 22篇 |
1983年 | 17篇 |
1982年 | 24篇 |
1981年 | 9篇 |
1980年 | 9篇 |
1979年 | 20篇 |
1978年 | 7篇 |
1977年 | 12篇 |
1976年 | 6篇 |
1975年 | 7篇 |
1973年 | 3篇 |
排序方式: 共有4868条查询结果,搜索用时 546 毫秒
81.
Su-Yun Huang Chuhsing Kate Hsiao Ching-Wei Chang 《Annals of the Institute of Statistical Mathematics》2003,55(3):655-670
The article provides a refinement for the volume-corrected Laplace-Metropolis estimator of the marginal likelihood of DiCiccioet al. The correction volume of probability α in DiCiccioet al. is fixed and suggested to take the value α=0.05. In this article α is selected based on an asymptotic analysis to minimize
the mean square relative error (MSRE). This optimal choice of α is shown to be invariant under linear transformations. The
invariance property leads to easy implementation for multivariate problems. An implementation procedure is provided for practical
use. A simulation study and a real data example are presented. 相似文献
82.
Keith Jonathan M. Kroese Dirk P. Bryant Darryn 《Methodology and Computing in Applied Probability》2004,6(1):29-53
A recent development of the Markov chain Monte Carlo (MCMC) technique is the emergence of MCMC samplers that allow transitions between different models. Such samplers make possible a range of computational tasks involving models, including model selection, model evaluation, model averaging and hypothesis testing. An example of this type of sampler is the reversible jump MCMC sampler, which is a generalization of the Metropolis–Hastings algorithm. Here, we present a new MCMC sampler of this type. The new sampler is a generalization of the Gibbs sampler, but somewhat surprisingly, it also turns out to encompass as particular cases all of the well-known MCMC samplers, including those of Metropolis, Barker, and Hastings. Moreover, the new sampler generalizes the reversible jump MCMC. It therefore appears to be a very general framework for MCMC sampling. This paper describes the new sampler and illustrates its use in three applications in Computational Biology, specifically determination of consensus sequences, phylogenetic inference and delineation of isochores via multiple change-point analysis. 相似文献
83.
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 相似文献
84.
Pierre Gaspard 《Journal of statistical physics》2004,117(3-4):599-615
A concept of time-reversed entropy per unit time is introduced in analogy with the entropy per unit time by Shannon, Kolmogorov, and Sinai. This time-reversed entropy per unit time characterizes the dynamical randomness of a stochastic process backward in time, while the standard entropy per unit time characterizes the dynamical randomness forward in time. The difference between the time-reversed and standard entropies per unit time is shown to give the entropy production of Markovian processes in nonequilibrium steady states. 相似文献
85.
We focus on continuous Markov chains as a model to describe the evolution of credit ratings. In this work it is checked whether a simple, tridiagonal type of generator provides a good approximation to a general one. Three different tridiagonal approximations are proposed and their performance is checked against two generators, corresponding to a volatile and a stable period, respectively. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
86.
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. 相似文献
87.
主要研究相互粒子系统中概率测度的负相关.我们得到判定概率测度是负相关的一个充分必要条件.最后证明了具有负相关的概率测度的线性组合及乘积测度仍是负相关的. 相似文献
88.
Torbjörn Kolsrud 《Journal of Theoretical Probability》1989,2(4):399-418
We derive explicit isomorphism formulas between weighted Dirichlet integrals for harmonic functions and boundary Dirichlet forms. Applications yield results on traces of Markov processes and convergence quasieverywhere of harmonic functions. 相似文献
89.
Perfect information two-person zero-sum markov games with imprecise transition probabilities 总被引:1,自引:0,他引:1
Hyeong Soo Chang 《Mathematical Methods of Operations Research》2006,64(2):335-351
Based on an extension of the controlled Markov set-chain model by Kurano et al. (in J Appl Prob 35:293–302, 1998) into competitive two-player game setting, we provide a model of perfect information two-person zero-sum Markov games with imprecise transition probabilities. We define an equilibrium value for the games formulated with the model in terms of a partial order and then establish the existence of an equilibrium policy pair that achieves the equilibrium value. We further analyze finite-approximation error bounds obtained from a value iteration-type algorithm and discuss some applications of the model. 相似文献
90.
M. Brazil 《Discrete Applied Mathematics》2006,154(18):2545-2564
The Steiner problem in a λ-plane is the problem of constructing a minimum length network interconnecting a given set of nodes (called terminals), with the constraint that all line segments in the network have slopes chosen from λ uniform orientations in the plane. This network is referred to as a minimum λ-tree. The problem is a generalization of the classical Euclidean and rectilinear Steiner tree problems, with important applications to VLSI wiring design.A λ-tree is said to be locally minimal if its length cannot be reduced by small perturbations of its Steiner points. In this paper we prove that a λ-tree is locally minimal if and only if the length of each path in the tree cannot be reduced under a special parallel perturbation on paths known as a shift. This proves a conjecture on necessary and sufficient conditions for locally minimal λ-trees raised in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. For any path P in a λ-tree T, we then find a simple condition, based on the sum of all angles on one side of P, to determine whether a shift on P reduces, preserves, or increases the length of T. This result improves on our previous forbidden paths results in [M. Brazil, D.A. Thomas, J.F. Weng, Forbidden subpaths for Steiner minimum networks in uniform orientation metrics, Networks 39 (2002) 186-222]. 相似文献