全文获取类型
收费全文 | 7944篇 |
免费 | 721篇 |
国内免费 | 878篇 |
专业分类
化学 | 2824篇 |
晶体学 | 26篇 |
力学 | 534篇 |
综合类 | 131篇 |
数学 | 4795篇 |
物理学 | 1233篇 |
出版年
2024年 | 10篇 |
2023年 | 70篇 |
2022年 | 179篇 |
2021年 | 229篇 |
2020年 | 222篇 |
2019年 | 231篇 |
2018年 | 211篇 |
2017年 | 218篇 |
2016年 | 266篇 |
2015年 | 228篇 |
2014年 | 402篇 |
2013年 | 579篇 |
2012年 | 371篇 |
2011年 | 412篇 |
2010年 | 356篇 |
2009年 | 510篇 |
2008年 | 493篇 |
2007年 | 541篇 |
2006年 | 479篇 |
2005年 | 385篇 |
2004年 | 369篇 |
2003年 | 335篇 |
2002年 | 333篇 |
2001年 | 290篇 |
2000年 | 286篇 |
1999年 | 188篇 |
1998年 | 190篇 |
1997年 | 160篇 |
1996年 | 166篇 |
1995年 | 144篇 |
1994年 | 122篇 |
1993年 | 80篇 |
1992年 | 75篇 |
1991年 | 63篇 |
1990年 | 41篇 |
1989年 | 27篇 |
1988年 | 41篇 |
1987年 | 30篇 |
1986年 | 27篇 |
1985年 | 40篇 |
1984年 | 39篇 |
1983年 | 12篇 |
1982年 | 14篇 |
1981年 | 12篇 |
1980年 | 19篇 |
1979年 | 13篇 |
1978年 | 12篇 |
1977年 | 8篇 |
1976年 | 8篇 |
1959年 | 2篇 |
排序方式: 共有9543条查询结果,搜索用时 46 毫秒
51.
对ALICE实验光子谱仪的触发选判机制进行了模拟研究, 内容包括: 1) 对光子谱仪的能量重建性能进行了研究, 通过计算机模拟检验光子谱仪探测器对大横动量范围的入射粒子的能量重建性能; 2) 对光子谱仪探测器的事件触发效率进行了研究, 通过计算机模拟分析触发阈值的选取并计算触发效率; 3) 对光子谱仪探测器的事件触发频率进行了研究, 通过计算机模拟对p-p和Pb-Pb两种碰撞模式下的触发频率分别进行了估算和讨论. 相似文献
52.
Alexander Kolokolov Nikolay Kosarev 《Journal of Mathematical Modelling and Algorithms》2006,5(2):189-199
In this paper the algorithms for solving the p-median problem based on the Benders decomposition are investigated. A family of problems hard for solving with such algorithms is constructed and then generalized to a special NP-hard case of the p-median problem. It is shown that the effectiveness of the considered algorithms depends on the choice of the optimal values of the dual variables used in Benders cuts. In particular, the depth of the cuts can be equal to one. 相似文献
53.
设(X,d)是一个可分的度量空间,Cu(X,d)是由全体一致连续函数所组成的C(X,d)的子空间,T是定义在X上的一致Lipschitz映射,那么对f∈Cu(X),1/n n∑k=1 Uk If在Cu(X)上收敛.从这个基本结果出发,利用Cu(X,d)的共扼空间的表示定理,得到了相空间的Yosida型遍历分解;利用空间的嵌入技术证明了非一致Lipschitz映射的大数法则. 相似文献
54.
This paper has demonstrated that the Schwartz alternating process must converge if D-N alternating process has converged. Its technique is that the overlapping regions in Schwartz alternating process are considered as independent domains, then Schwartz alternating process could be transformed into D-N alter-nating process. Finally the convergence estimation of Schwartz alternating process could be obtained. The results show that its convergence rate is same as that of D-N alternating process. 相似文献
55.
A cube factorization of the complete graph on n vertices, Kn, is a 3‐factorization of Kn in which the components of each factor are cubes. We show that there exists a cube factorization of Kn if and only if n ≡ 16 (mod 24), thus providing a new family of uniform 3‐factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. © 2004 Wiley Periodicals, Inc. 相似文献
56.
Gabriela Jeronimo Teresa Krick Juan Sabia Martín Sombra 《Foundations of Computational Mathematics》2004,4(1):41-117
We present a bounded probability algorithm for the computation of the
Chowforms of the equidimensional components of an algebraic variety. In particular,
this gives an alternative procedure for the effective equidimensional decomposition
of the variety, since each equidimensional component is characterized by its Chow
form.
The expected complexity of the algorithm is polynomial in the size and the geometric
degree of the input equation system defining the variety. Hence it improves (or
meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects,
which constitutes a further contribution of the paper.
The algorithm is based on elimination theory techniques, in line with the geometric
resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators.
In fact, ours can be considered as an extension of their algorithm for zero-dimensional
systems to the case of positive-dimensional varieties. The key element for dealing
with positive-dimensional varieties is a new Poisson-type product formula. This
formula allows us to compute the Chow form of an equidimensional variety from a
suitable zero-dimensional fiber.
As an application, we obtain an algorithm to compute a subclass of sparse resultants,
whose complexity is polynomial in the dimension and the volume of the input
set of exponents. As another application, we derive an algorithm for the computation
of the (unique) solution of a generic overdetermined polynomial equation system. 相似文献
57.
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.
58.
Bilevel programming approach applied to the flow shop scheduling problem under fuzziness 总被引:1,自引:0,他引:1
Samir A. Abass 《Computational Management Science》2005,2(4):279-293
This paper presents a fuzzy bilevel programming approach to solve the flow shop scheduling problem. The problem considered
here differs from the standard form in that operators are assigned to the machines and imposing a hierarchy of two decision
makers with fuzzy processing times. The shop owner considered higher level and assigns the jobs to the machines in order to
minimize the flow time while the customer is the lower level and decides on a job schedule in order to minimize the makespan.
In this paper, we use the concepts of tolerance membership function at each level to define a fuzzy decision model for generating
optimal (satisfactory) solution for bilevel flow shop scheduling problem. A solution algorithm for solving this problem is
given.
Mathematics Subject Classification:
90C70, 90B36, 90C99 相似文献
59.
Lá szló L. Stachó Borut Zalar 《Proceedings of the American Mathematical Society》2004,132(10):3019-3025
We prove that every JB* triple with rank one bicircular projection is a direct sum of two ideals, one of which is isometrically isomorphic to a Hilbert space.
60.
垃圾填埋场选址问题的模糊数学模型研究 总被引:3,自引:0,他引:3
为有助于在环境和经济框架内评价垃圾填埋场选址决策,本文建立了关于该问题的多目标模型,模型中既考虑了安置和运营设施需要的固定成本和可变成本,也考虑了居民区承受的风险,以及各居民区承担风险的公平性。并进一步讨论了用模糊方法处理的一般多目标规划模型的模糊最优解与有效解及弱有效解之间的关系。最后使用两种模糊目标规划方法求解数值例子以分析所建模型的适用性,结果表明,加权模糊方法可以为决策者提供更接近期望值的满意方案。 相似文献