全文获取类型
收费全文 | 4525篇 |
免费 | 148篇 |
国内免费 | 345篇 |
专业分类
化学 | 1034篇 |
晶体学 | 5篇 |
力学 | 98篇 |
综合类 | 38篇 |
数学 | 3346篇 |
物理学 | 497篇 |
出版年
2023年 | 74篇 |
2022年 | 56篇 |
2021年 | 95篇 |
2020年 | 81篇 |
2019年 | 105篇 |
2018年 | 102篇 |
2017年 | 108篇 |
2016年 | 120篇 |
2015年 | 86篇 |
2014年 | 184篇 |
2013年 | 436篇 |
2012年 | 193篇 |
2011年 | 225篇 |
2010年 | 200篇 |
2009年 | 268篇 |
2008年 | 266篇 |
2007年 | 291篇 |
2006年 | 209篇 |
2005年 | 197篇 |
2004年 | 152篇 |
2003年 | 158篇 |
2002年 | 152篇 |
2001年 | 141篇 |
2000年 | 118篇 |
1999年 | 140篇 |
1998年 | 121篇 |
1997年 | 89篇 |
1996年 | 79篇 |
1995年 | 88篇 |
1994年 | 69篇 |
1993年 | 37篇 |
1992年 | 34篇 |
1991年 | 46篇 |
1990年 | 24篇 |
1989年 | 29篇 |
1988年 | 29篇 |
1987年 | 21篇 |
1986年 | 16篇 |
1985年 | 37篇 |
1984年 | 20篇 |
1983年 | 16篇 |
1982年 | 22篇 |
1981年 | 7篇 |
1980年 | 11篇 |
1979年 | 19篇 |
1978年 | 10篇 |
1977年 | 12篇 |
1976年 | 6篇 |
1975年 | 7篇 |
1973年 | 4篇 |
排序方式: 共有5018条查询结果,搜索用时 31 毫秒
71.
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. 相似文献
72.
主要研究相互粒子系统中概率测度的负相关.我们得到判定概率测度是负相关的一个充分必要条件.最后证明了具有负相关的概率测度的线性组合及乘积测度仍是负相关的. 相似文献
73.
Novel oscillatory flow results of phenoxy/organoclay nanocomposites are analysed considering the blocking effect of nanostructure on polymer chain mobility. The modification provoked by this hindering effect on loss tangent spectrum is investigated. The study of three different systems, involving a pristine montmorillonite and two montmorillonites modified with one alkyl tail and two alkyl tails, respectively, leads to conclude that polymer-alkyl repulsive interactions play the most important role in the chain mobility obstruction process. Our results suggest that polymer-alkyl interactions increase with temperature. 相似文献
74.
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. 相似文献
75.
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. 相似文献
76.
Converging Marriage in Honey-Bees Optimization and Application to Stochastic Dynamic Programming 总被引:1,自引:0,他引:1
Hyeong Soo Chang 《Journal of Global Optimization》2006,35(3):423-441
In this paper, we first refine a recently proposed metaheuristic called “Marriage in Honey-Bees Optimization” (MBO) for solving
combinatorial optimization problems with some modifications to formally show that MBO converges to the global optimum value.
We then adapt MBO into an algorithm called “Honey-Bees Policy Iteration” (HBPI) for solving infinite horizon-discounted cost
stochastic dynamic programming problems and show that HBPI also converges to the optimal value. 相似文献
77.
STRONG LAW OF LARGE NUMBERS AND ASYMPTOTIC EQUIPARTITION PROPERTY FOR NONSYMMETRIC MARKOV CHAIN FIELDS ON CAYLEY TREES 总被引:1,自引:0,他引:1
Some strong laws of large numbers for the frequcncies of occurrence of states and ordered couples of states for nonsymmetric Markov chain fields(NSMC)on Cayley trees are studied.In the proof,a new technique for the study of strong liinit theorems of Markov chains is extended to the case of Markov chain fields.The asymptotic equiparti- tion properties with almost everywhere(a.e.)convergence for NSMC on Cayley trees are obtained. 相似文献
78.
Matthew D. Bailey Steven M. Shechter Andrew J. Schaefer 《Operations Research Letters》2006,34(3):307-315
We consider a general adversarial stochastic optimization model. Our model involves the design of a system that an adversary may subsequently attempt to destroy or degrade. We introduce SPAR, which utilizes mixed-integer programming for the design decision and a Markov decision process (MDP) for the modeling of our adversarial phase. 相似文献
79.
Eitan Altman 《Mathematical Methods of Operations Research》1993,37(2):151-170
We present in this paper several asymptotic properties of constrained Markov Decision Processes (MDPs) with a countable state space. We treat both the discounted and the expected average cost, with unbounded cost. We are interested in (1) the convergence of finite horizon MDPs to the infinite horizon MDP, (2) convergence of MDPs with a truncated state space to the problem with infinite state space, (3) convergence of MDPs as the discount factor goes to a limit. In all these cases we establish the convergence of optimal values and policies. Moreover, based on the optimal policy for the limiting problem, we construct policies which are almost optimal for the other (approximating) problems. Based on the convergence of MDPs with a truncated state space to the problem with infinite state space, we show that an optimal stationary policy exists such that the number of randomisations it uses is less or equal to the number of constraints plus one. We finally apply the results to a dynamic scheduling problem.This work was partially supported by the Chateaubriand fellowship from the French embassy in Israel and by the European Grant BRA-QMIPS of CEC DG XIII 相似文献
80.
This article is concerned with Markov chains on m constructed by randomly choosing an affine map at each stage, and then making the transition from the current point to its image under this map. The distribution of the random affine map can depend on the current point (i.e., state of the chain). Sufficient conditions are given under which this chain is ergodic. 相似文献