全文获取类型
收费全文 | 6945篇 |
免费 | 513篇 |
国内免费 | 382篇 |
专业分类
化学 | 339篇 |
晶体学 | 8篇 |
力学 | 304篇 |
综合类 | 45篇 |
数学 | 2462篇 |
物理学 | 1579篇 |
综合类 | 3103篇 |
出版年
2024年 | 16篇 |
2023年 | 66篇 |
2022年 | 122篇 |
2021年 | 119篇 |
2020年 | 127篇 |
2019年 | 118篇 |
2018年 | 115篇 |
2017年 | 152篇 |
2016年 | 178篇 |
2015年 | 178篇 |
2014年 | 306篇 |
2013年 | 319篇 |
2012年 | 327篇 |
2011年 | 355篇 |
2010年 | 345篇 |
2009年 | 470篇 |
2008年 | 451篇 |
2007年 | 594篇 |
2006年 | 481篇 |
2005年 | 373篇 |
2004年 | 333篇 |
2003年 | 301篇 |
2002年 | 303篇 |
2001年 | 238篇 |
2000年 | 208篇 |
1999年 | 169篇 |
1998年 | 172篇 |
1997年 | 146篇 |
1996年 | 145篇 |
1995年 | 100篇 |
1994年 | 80篇 |
1993年 | 63篇 |
1992年 | 47篇 |
1991年 | 48篇 |
1990年 | 37篇 |
1989年 | 27篇 |
1988年 | 41篇 |
1987年 | 23篇 |
1986年 | 28篇 |
1985年 | 18篇 |
1984年 | 23篇 |
1983年 | 5篇 |
1982年 | 16篇 |
1981年 | 10篇 |
1980年 | 10篇 |
1979年 | 7篇 |
1978年 | 9篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1957年 | 2篇 |
排序方式: 共有7840条查询结果,搜索用时 281 毫秒
41.
42.
A rigorous and systematic intercomparison of codes used for the retrieval of trace gas profiles from high-resolution ground-based solar absorption FTIR measurements is presented for the first time. Spectra were analyzed with the two widely used independent, retrieval codes: SFIT2 and PROFFIT9. Vertical profiles of O3, HNO3, HDO, and N2O were derived from the same set of typical observed spectra. Analysis of O3 was improved by using updated line parameters. It is shown that profiles and total column amounts are in excellent agreement, when similar constraints are applied, and that the resolution kernel matrices are also consistent. Owing to the limited altitude resolution of ground-based observations, the impact of the constraints on the solution is not negligible. It is shown that the results are also compatible for independently chosen constraints. Perspectives for refined constraints are discussed. It can be concluded that the error budget introduced by the radiative transfer code and the retrieval algorithm on total columns deduced from high-resolution ground-based solar FTIR spectra is below 1%. 相似文献
43.
We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful measure for optimization problems where the random assignment algorithm is known to give essentially the best possible polynomial time approximation. In this paper, we focus on this measure for the optimization problems Max‐Lin‐2 in which we need to maximize the number of satisfied linear equations in a system of linear equations modulo 2, and Max‐k‐Lin‐2, a special case of the above problem in which each equation has at most k variables. The main techniques we use, in our approximation algorithms and inapproximability results for this measure, are from Fourier analysis and derandomization. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
44.
L.G. Casado I. García T. Csendes V.G. Ruíz 《Journal of Optimization Theory and Applications》2003,118(1):27-43
Based on the investigation carried out in Ref. 1, this paper incorporates new studies about the properties of inclusion functions on subintervals while a branch-and-bound algorithm is solving global optimization problems. It is found that the relative place of the global minimum value within the inclusion function value of the objective function at the current interval indicates mostly whether the given interval is close to a minimizer point. This information is used in a heuristic interval rejection rule that can save a considerable amount of computation. Illustrative examples are discussed and an extended numerical study shows the advantages of the new approach. 相似文献
45.
46.
Suppose that attached to each site z ∈ ? is a coin with bias θ(z), and only finitely many of these coins have nonzero bias. Allow a simple random walker to generate observations by tossing, at each move, the coin attached to its current position. Then we can determine the biases {θ(z)}z∈?, using only the outcomes of these coin tosses and no information about the path of the random walker, up to a shift and reflection of ?. This generalizes a result of Harris and Keane. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004 相似文献
47.
Linear mixed 0–1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP)
problems. We exploit these equivalences to transpose the concept of mixed 0–1 Gomory cuts to BLP. The first phase of our new
algorithm generates Gomory-like cuts. The second phase consists of a branch-and-bound procedure to ensure finite termination
with a global optimal solution. Different features of the algorithm, in particular, the cut selection and branching criteria
are studied in details. We propose also a set of algorithmic tests and procedures to improve the method. Finally, we illustrate
the performance through numerical experiments. Our algorithm outperforms pure branch-and-bound when tested on a series of
randomly generated problems.
Work of the authors was partially supported by FCAR, MITACS and NSERC grants. 相似文献
48.
49.
Some authors claim that reporting the best result obtained by a stochastic algorithm in a number of runs is more meaningful
than reporting some central statistic. In this short note, we analyze and refute the main argument brought in favor of this
statement. 相似文献
50.
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). 相似文献