全文获取类型
收费全文 | 432篇 |
免费 | 46篇 |
国内免费 | 14篇 |
专业分类
化学 | 8篇 |
力学 | 89篇 |
综合类 | 11篇 |
数学 | 270篇 |
物理学 | 114篇 |
出版年
2023年 | 4篇 |
2022年 | 7篇 |
2021年 | 23篇 |
2020年 | 9篇 |
2019年 | 6篇 |
2018年 | 11篇 |
2017年 | 6篇 |
2016年 | 13篇 |
2015年 | 6篇 |
2014年 | 13篇 |
2013年 | 29篇 |
2012年 | 20篇 |
2011年 | 10篇 |
2010年 | 16篇 |
2009年 | 14篇 |
2008年 | 18篇 |
2007年 | 30篇 |
2006年 | 24篇 |
2005年 | 37篇 |
2004年 | 13篇 |
2003年 | 22篇 |
2002年 | 20篇 |
2001年 | 11篇 |
2000年 | 12篇 |
1999年 | 19篇 |
1998年 | 9篇 |
1997年 | 11篇 |
1996年 | 11篇 |
1995年 | 11篇 |
1994年 | 10篇 |
1993年 | 7篇 |
1992年 | 4篇 |
1991年 | 9篇 |
1990年 | 3篇 |
1988年 | 1篇 |
1987年 | 5篇 |
1986年 | 3篇 |
1985年 | 4篇 |
1984年 | 10篇 |
1983年 | 1篇 |
排序方式: 共有492条查询结果,搜索用时 15 毫秒
1.
针对公众参与的语言信息多属性群决策问题,研究了考虑参与者满意度的概率语言多属性群决策方法。首先,根据参与者的语言评价信息确定并规范化概率语言决策矩阵。然后,对大群体进行共识分析,由最大化参与者群体的满意度构建线性规划模型,确定参与者群组的权重;构造正、负理想方案的评价向量,构建多目标规划模型,用拉格朗日乘子法求解属性权重;定义各方案的加权贴近度,并以此对方案进行排序和优选。最后,通过新型智慧城市市民获得感评价案例验证了模型的可行性和有效性。 相似文献
2.
3.
Bernardo Lafuerza-Guillén Donal O’regan Reza Saadati 《Proceedings Mathematical Sciences》2007,117(1):61-70
We introduce the concept of quotient in PN spaces and give some examples. We prove some theorems with regard to the completeness
of a quotient. 相似文献
4.
A probabilistic teleportation scheme for atomic state via cavity QED [Phys. Rev. A 70 (2004) 054303] is revisited and accordingly some improvements are made. 相似文献
5.
Thomas Wanner 《Transactions of the American Mathematical Society》2004,356(6):2251-2279
Many interesting and complicated patterns in the applied sciences are formed through transient pattern formation processes. In this paper we concentrate on the phenomenon of spinodal decomposition in metal alloys as described by the Cahn-Hilliard equation. This model depends on a small parameter, and one is generally interested in establishing sharp lower bounds on the amplitudes of the patterns as the parameter approaches zero. Recent results on spinodal decomposition have produced such lower bounds. Unfortunately, for higher-dimensional base domains these bounds are orders of magnitude smaller than what one would expect from simulations and experiments. The bounds exhibit a dependence on the dimension of the domain, which from a theoretical point of view seemed unavoidable, but which could not be observed in practice.
In this paper we resolve this apparent paradox. By employing probabilistic methods, we can improve the lower bounds for certain domains and remove the dimension dependence. We thereby obtain optimal results which close the gap between analytical methods and numerical observations, and provide more insight into the nature of the decomposition process. We also indicate how our results can be adapted to other situations.
6.
V. P. Maslov 《Theoretical and Mathematical Physics》2007,150(1):102-122
From the standpoint of thermodynamic averaging of fission microprocesses, we investigate the origin of radioactive release
in an NPP after an accident or after resource depletion. The genesis of the NPP release is interpreted as a new thermodynamic
phenomenon, a zeroth-order phase transition. This problem setting results in a problem in probabilistic number theory. We
prove the corresponding theorem leading to quantization of the Zipf law for the frequency of a zeroth-order phase transition
with different values of the jump of the Gibbs thermodynamic potential. We introduce the notion of hole dimension.
__________
Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 150, No. 1, pp. 118–142, January, 2007. 相似文献
7.
In this paper, we provide bounds for the expected value of the log of the condition number C(A) of a linear feasibility problem given by a n × m matrix A (Ref. 1). We show that this expected value is O(min{n, m log n}) if n > m and is O(log n) otherwise. A similar bound applies for the log of the condition number C
R(A) introduced by Renegar (Ref. 2). 相似文献
8.
本文在Menser概率赋范空间中引入了(Φ,Δ)型概率收缩的概念,研究了Menger概率赋范空间中具有这类概率收缩的非线性算子方程的解的存在性与唯一性.发展和改进了引文[1]、[4~8]的相应结果. 相似文献
9.
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time-space complexity is roughly quadratic in the logarithm of the cardinality of the field and a geometric invariant of the input system. This invariant, called the degree, is bounded by the Bézout number of the system. Our algorithm works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity which is roughly the fourth power of the degree of the input variety.
10.
We consider the following (solitary) game: each node of a directed graph contains a pile of chips. A move consists of selecting a node with at least as many chips as its outdegree, and sending one chip along each outgoing edge to its neighbors. We extend to directed graphs several results on the undirected version obtained earlier by the authors, P. Shor, and G. Tardos, and we discuss some new topics such as periodicity, reachability, and probabilistic aspects.Among the new results specifically concerning digraphs, we relate the length of the shortest period of an infinite game to the length of the longest terminating game, and also to the access time of random walks on the same graph. These questions involve a study of the Laplace operator for directed graphs. We show that for many graphs, in particular for undirected graphs, the problem whether a given position of the chips can be reached from the initial position is polynomial time solvable.Finally, we show how the basic properties of the probabilistic abacus can be derived from our results. 相似文献