全文获取类型
收费全文 | 86962篇 |
免费 | 847篇 |
国内免费 | 453篇 |
专业分类
化学 | 30450篇 |
晶体学 | 907篇 |
力学 | 7089篇 |
综合类 | 1篇 |
数学 | 33145篇 |
物理学 | 16670篇 |
出版年
2023年 | 71篇 |
2022年 | 394篇 |
2021年 | 443篇 |
2020年 | 325篇 |
2019年 | 395篇 |
2018年 | 10675篇 |
2017年 | 10436篇 |
2016年 | 6488篇 |
2015年 | 1121篇 |
2014年 | 718篇 |
2013年 | 1187篇 |
2012年 | 4314篇 |
2011年 | 11010篇 |
2010年 | 5982篇 |
2009年 | 6359篇 |
2008年 | 6949篇 |
2007年 | 9093篇 |
2006年 | 573篇 |
2005年 | 1575篇 |
2004年 | 1789篇 |
2003年 | 2194篇 |
2002年 | 1295篇 |
2001年 | 369篇 |
2000年 | 438篇 |
1999年 | 251篇 |
1998年 | 263篇 |
1997年 | 214篇 |
1996年 | 265篇 |
1995年 | 182篇 |
1994年 | 146篇 |
1993年 | 157篇 |
1992年 | 119篇 |
1991年 | 121篇 |
1990年 | 93篇 |
1989年 | 132篇 |
1988年 | 123篇 |
1987年 | 104篇 |
1986年 | 105篇 |
1985年 | 103篇 |
1984年 | 103篇 |
1983年 | 84篇 |
1982年 | 79篇 |
1981年 | 84篇 |
1980年 | 83篇 |
1979年 | 77篇 |
1978年 | 72篇 |
1977年 | 45篇 |
1975年 | 43篇 |
1973年 | 44篇 |
1914年 | 45篇 |
排序方式: 共有10000条查询结果,搜索用时 296 毫秒
111.
YaoKui ChenZhixiang 《分析论及其应用》2003,19(2):115-120
This paper gives the weighted Lp convergence rate estimations of the Gruenwald interpolatory polynomials based on the zeros of Chebyshev polymomials of the first kind,and proves that the order of the estimations is optimal for p≥1. 相似文献
112.
Howard Robinson 《Acta Analytica》2005,20(3):7-10
Nicholas Nathan tries to resist the current version of the causal argument for sense-data in two ways. First he suggests that,
on what he considers to be the correct re-construction of the argument, it equivocates on the sense of proximate cause. Second
he defends a form of disjunctivism, by claiming that there might be an extra mechanism involved in producing veridical hallucination,
that is not present in perception. I argue that Nathan’s reconstruction of the argument is not the appropriate one, and that,
properly interpreted, the argument does not equivocate on proximate cause. Furthermore, I claim that his postulation of a
modified mechanism for hallucinations is implausibly ad hoc. 相似文献
113.
Chris Pollett 《Archive for Mathematical Logic》2003,42(5):469-488
The paper establishes lower bounds on the provability of 𝒟=NP and the MRDP theorem in weak fragments of arithmetic. The
theory I
5
E
1
is shown to be unable to prove 𝒟=NP. This non-provability result is used to show that I
5
E
1
cannot prove the MRDP theorem. On the other hand it is shown that I
1
E
1
proves 𝒟 contains all predicates of the form (∀i≤|b|)P(i,x)^Q(i,x) where ^ is =, <, or ≤, and I
0
E
1
proves 𝒟 contains all predicates of the form (∀i≤b)P(i,x)=Q(i,x). Here P and Q are polynomials. A conjecture is made that 𝒟 contains NLOGTIME. However, it is shown that this conjecture would not be sufficient
to imply 𝒟=N P. Weak reductions to equality are then considered as a way of showing 𝒟=NP. It is shown that the bit-wise less than predicate,
≤2, and equality are both co-NLOGTIME complete under FDLOGTIME reductions. This is used to show that if the FDLOGTIME functions
are definable in 𝒟 then 𝒟=N P.
Received: 13 July 2001 / Revised version: 9 April 2002 /
Published online: 19 December 2002
Key words or phrases: Bounded Arithmetic – Bounded Diophantine Complexity 相似文献
114.
115.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献
116.
Grégory Duby 《Archive for Mathematical Logic》2003,42(5):435-447
This paper generalizes results of F. K?rner from [4] where she established the existence of maximal automorphisms (i.e. automorphisms
moving all non-algebraic elements). An ω-maximal automorphism is an automorphism whose powers are maximal automorphisms. We
prove that any structure has an elementary extension with an ω-maximal automorphism. We also show the existence of ω-maximal
automorphisms in all countable arithmetically saturated structures. Further we describe the pairs of tuples (ˉa,ˉb) for which there is an ω-maximal automorphism mapping ˉa to ˉb.
Received: 12 December 2001 /
Published online: 10 October 2002
Supported by the ``Fonds pour la Formation à la Recherche dans l'Industrie et dans l'Agriculture'
Mathematics Subject Classification (2000): Primary: 03C50; Secondary: 03C57
Key words or phrases: Automorphism – Recursively saturated structure 相似文献
117.
This paper analyzes the compromise social choice correspondence derived from the τ-value of digraph games. Monotonicity of
this correspondence is shown. A connection between several properties of social choice correspondences based on game theoretical
solutions and game theoretical properties of the underlying solutions is given. Applications to several game theoretic solutions
are provided. 相似文献
118.
119.
120.
A.R.ELAMROUSS 《数学学报(英文版)》2005,21(1):129-142
This paper contains a generalization of the well-known Palais-Smale and Cerami compactness conditions. The compactness condition introduced is used to prove some general existence theorems for critical points. Some applications are given to differential equations. 相似文献