全文获取类型
收费全文 | 577篇 |
免费 | 46篇 |
国内免费 | 18篇 |
专业分类
化学 | 73篇 |
力学 | 5篇 |
综合类 | 10篇 |
数学 | 395篇 |
物理学 | 158篇 |
出版年
2023年 | 3篇 |
2022年 | 11篇 |
2021年 | 19篇 |
2020年 | 10篇 |
2019年 | 7篇 |
2018年 | 14篇 |
2017年 | 18篇 |
2016年 | 11篇 |
2015年 | 14篇 |
2014年 | 24篇 |
2013年 | 33篇 |
2012年 | 14篇 |
2011年 | 25篇 |
2010年 | 29篇 |
2009年 | 24篇 |
2008年 | 39篇 |
2007年 | 40篇 |
2006年 | 35篇 |
2005年 | 28篇 |
2004年 | 24篇 |
2003年 | 28篇 |
2002年 | 22篇 |
2001年 | 13篇 |
2000年 | 13篇 |
1999年 | 17篇 |
1998年 | 8篇 |
1997年 | 12篇 |
1996年 | 12篇 |
1995年 | 11篇 |
1994年 | 7篇 |
1993年 | 4篇 |
1992年 | 6篇 |
1991年 | 5篇 |
1990年 | 5篇 |
1989年 | 6篇 |
1988年 | 5篇 |
1987年 | 7篇 |
1986年 | 2篇 |
1985年 | 7篇 |
1984年 | 7篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 2篇 |
1974年 | 3篇 |
1973年 | 3篇 |
1959年 | 1篇 |
排序方式: 共有641条查询结果,搜索用时 15 毫秒
21.
《International Journal of Approximate Reasoning》2014,55(8):1694-1707
The Goodman–Nguyen relation is a partial order generalising the implication (inclusion) relation to conditional events. As such, with precise probabilities it both induces an agreeing probability ordering and is a key tool in a certain common extension problem. Most previous work involving this relation is concerned with either conditional event algebras or precise probabilities. We investigate here its role within imprecise probability theory, first in the framework of conditional events and then proposing a generalisation of the Goodman–Nguyen relation to conditional gambles. It turns out that this relation induces an agreeing ordering on coherent or C-convex conditional imprecise previsions. In a standard inferential problem with conditional events, it lets us determine the natural extension, as well as an upper extension. With conditional gambles, it is useful in deriving a number of inferential inequalities. 相似文献
23.
For a double channel Markovian queue with finite waiting space the difference equations satisfied by the Laplace transforms of the state probabilities at finite time are solved and the state probabilities are obtained in a simple closed form which can be easily used to find the important parameters of the system. 相似文献
24.
唐启鹤 《中国科学A辑(英文版)》2002,45(5):632-639
The famous Embrechts-Goldie-Veraverbeke formula shows that, in the classical Cramér-Lundberg risk model, the ruin probabilities satisfy \(R(x, \infty ) \sim \rho ^{ - 1} \bar F_e (x)\) if the claim sizes are heavy-tailed, where Fe denotes the equilibrium distribution of the common d.f. F of the i.i.d. claims, ? is the safety loading coefficient of the model and the limit process is for x → ∞. In this paper we obtain a related local asymptotic relationship for the ruin probabilities. In doing this we establish two lemmas regarding the n-fold convolution of subexponential equilibrium distributions, which are of significance on their own right. 相似文献
25.
Gisella Facchinetti 《Fuzzy Optimization and Decision Making》2002,1(3):313-327
In this paper we present two definitions of possibilistic weighted average of fuzzy numbers, and by them we introduce two different rankings on the set of real fuzzy numbers. The two methods are dependent on several parameters. In the first case, the parameter is constant and the results generalize what Carlsson and Fuller have obtained in (2001). In the second case, the parameter is a function, not fixed a priori by the decision maker, but it depends on the position of the interval on the real axe. In all the two cases we call the parameter degree of risk, which takes into account of a risk-tendency or aversion of the decision maker. 相似文献
26.
Let M
n =X1+...+Xn be a martingale with bounded differences Xm=Mm-Mm-1 such that {|Xm| m}=1 with some nonnegative m. Write 2=
1
2
+ ... +
n
2
. We prove the inequalities {M
nx}c(1-(x/)), {M
n x} 1- c(1- (-x/)) with a constant
. The result yields sharp inequalities in some models related to the measure concentration phenomena. 相似文献
27.
Suppose we are given finitely generated groups Γ1,…,Γm equipped with irreducible random walks. Thereby we assume that the expansions of the corresponding Green functions at their radii of convergence contain only logarithmic or algebraic terms as singular terms up to sufficiently large order (except for some degenerate cases). We consider transient random walks on the free product Γ1* … *Γm and give a complete classification of the possible asymptotic behaviour of the corresponding n‐step return probabilities. They either inherit a law of the form ?nδn log n from one of the free factors Γi or obey a ?nδn?3/2‐law, where ? < 1 is the corresponding spectral radius and δ is the period of the random walk. In addition, we determine the full range of the asymptotic behaviour in the case of nearest neighbour random walks on free products of the form $\mathbb{Z}^{d_1}\ast \ldots \ast \mathbb{Z}^{d_m}Suppose we are given finitely generated groups Γ1,…,Γm equipped with irreducible random walks. Thereby we assume that the expansions of the corresponding Green functions at their radii of convergence contain only logarithmic or algebraic terms as singular terms up to sufficiently large order (except for some degenerate cases). We consider transient random walks on the free product Γ1* … *Γm and give a complete classification of the possible asymptotic behaviour of the corresponding n‐step return probabilities. They either inherit a law of the form ?nδn log n from one of the free factors Γi or obey a ?nδn?3/2‐law, where ? < 1 is the corresponding spectral radius and δ is the period of the random walk. In addition, we determine the full range of the asymptotic behaviour in the case of nearest neighbour random walks on free products of the form $\mathbb{Z}^{d_1}\ast \ldots \ast \mathbb{Z}^{d_m}$. Moreover, we characterize the possible phase transitions of the non‐exponential types n log n in the case Γ1 * Γ2. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012 相似文献
28.
实际应用排序集抽样时,主观排序总是会出现误差。本文考虑了不完美排序对最优抽样下分位数符号检验的影响,并且给出不同分位数的误差函数图像,以便具体应用时参考。 相似文献
29.
本文提出一种新的主成分分析方法,称为组合加权主成分分析。该方法优化和主成分方法相结合,实现多个年度的综合排名。我们将这一方法应用于新疆14个州市工会服务能力的评估,结果符合实际,对工会工作起到了指导作用。 相似文献
30.
Kazuhisa Makino Yushi Uno Toshihide Ibaraki 《Journal of Algorithms in Cognition, Informatics and Logic》2001,38(2):411
In this paper, we introduce the problem of computing a minimum edge ranking spanning tree (MERST); i.e., find a spanning tree of a given graph G whose edge ranking is minimum. Although the minimum edge ranking of a given tree can be computed in polynomial time, we show that problem MERST is NP-hard. Furthermore, we present an approximation algorithm for MERST, which realizes its worst case performance ratio
where n is the number of vertices in G and Δ* is the maximum degree of a spanning tree whose maximum degree is minimum. Although the approximation algorithm is a combination of two existing algorithms for the restricted spanning tree problem and for the minimum edge ranking problem of trees, the analysis is based on novel properties of the edge ranking of trees. 相似文献