全文获取类型
收费全文 | 5607篇 |
免费 | 636篇 |
国内免费 | 257篇 |
专业分类
化学 | 321篇 |
晶体学 | 9篇 |
力学 | 748篇 |
综合类 | 84篇 |
数学 | 3959篇 |
物理学 | 1379篇 |
出版年
2024年 | 5篇 |
2023年 | 41篇 |
2022年 | 86篇 |
2021年 | 99篇 |
2020年 | 151篇 |
2019年 | 146篇 |
2018年 | 136篇 |
2017年 | 181篇 |
2016年 | 200篇 |
2015年 | 134篇 |
2014年 | 275篇 |
2013年 | 640篇 |
2012年 | 252篇 |
2011年 | 305篇 |
2010年 | 265篇 |
2009年 | 339篇 |
2008年 | 329篇 |
2007年 | 367篇 |
2006年 | 302篇 |
2005年 | 276篇 |
2004年 | 239篇 |
2003年 | 230篇 |
2002年 | 196篇 |
2001年 | 168篇 |
2000年 | 168篇 |
1999年 | 155篇 |
1998年 | 137篇 |
1997年 | 103篇 |
1996年 | 108篇 |
1995年 | 67篇 |
1994年 | 63篇 |
1993年 | 43篇 |
1992年 | 51篇 |
1991年 | 53篇 |
1990年 | 24篇 |
1989年 | 16篇 |
1988年 | 11篇 |
1987年 | 16篇 |
1986年 | 10篇 |
1985年 | 22篇 |
1984年 | 18篇 |
1983年 | 11篇 |
1982年 | 12篇 |
1981年 | 16篇 |
1980年 | 6篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1977年 | 6篇 |
1976年 | 4篇 |
1974年 | 3篇 |
排序方式: 共有6500条查询结果,搜索用时 15 毫秒
31.
This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms. 相似文献
32.
一类经典”秘书问题”的推广 总被引:2,自引:0,他引:2
”秘书问题”在最优停时理论的发展中曾起过重要作用 ,实际中的一类问题与”秘书问题”有类似之处 ,但比”秘书问题”更复杂 .本文将经典”秘书问题”进行推广 ,建立了一类比经典”秘书问题”更有实际意义的模型 ,并给出了该类模型的解 . 相似文献
33.
A. S. Kholodov Ya. A. Kholodov 《Computational Mathematics and Mathematical Physics》2006,46(9):1560-1588
Previously formulated monotonicity criteria for explicit two-level difference schemes designed for hyperbolic equations (S.K. Godunov’s, A. Harten’s (TVD schemes), characteristic criteria) are extended to multileveled, including implicit, stencils. The characteristic monotonicity criterion is used to develop a universal algorithm for constructing high-order accurate nonlinear monotone schemes (for an arbitrary form of the desired solution) based on their analysis in the space of grid functions. Several new fourth-to-third-order accurate monotone difference schemes on a compact three-level stencil and nonexpanding (three-point) stencils are proposed for an extended system, which ensures their monotonicity for both the desired function and its derivatives. The difference schemes are tested using the characteristic monotonicity criterion and are extended to systems of hyperbolic equations. 相似文献
34.
External difference families (EDFs) are a type of new combinatorial designs originated from cryptography. In this paper, some
earlier ideas of recursive and cyclotomic constructions of combinatorial designs are extended, and a number of classes of
EDFs and disjoint difference families are presented. A link between a subclass of EDFs and a special type of (almost) difference
sets is set up. 相似文献
35.
本文针对一类非饱和土壤水流问题,提出了基于二次插值的特征差分格式,得到了严谨的L2模误差估计.并作了数值试验,指明方法的有效性. 相似文献
36.
Masanobu Haraguchi David F. P. Pile Toshihiro Okamoto Masuo Fukui Dmitri K. Gramotnev 《Optical Review》2006,13(4):228-230
We have numerically shown the existence of coupled wedge plasmons (CWPs) which propagates along a nano gap of a twin metal
wedge. The CWPs are formed by wedge plasmons which can interact with each other. The dispersion relations of the wavenumber,
propagation distance, and beam area of CWPs, are described and show that the characteristics of CWPs are similar to those
of wedge plasmons and of gap plasmons. We also propose a new plasmon waveguide composed of twin metal wedges with a nano gap. 相似文献
37.
High even order generalizations of the traditional upwind method are introduced to solve second order ODE-BVPs without recasting
the problem as a first order system. Both theoretical analysis and numerical comparison with central difference schemes of
the same order show that these new methods may avoid typical oscillations and achieve high accuracy. Singular perturbation
problems are taken into account to emphasize the main features of the proposed methods.
AMS subject classification (2000) 65L10, 65L12, 65L50 相似文献
38.
We construct a new family of cyclic difference sets with parameters ((3
d
– 1)/2, (3
d – 1 – 1)/2, (3
d – 2 – 1)/2) for each odd d. The difference sets are constructed with certain maps that form Jacobi sums. These new difference sets are similar to Maschietti's hyperoval difference sets, of the Segre type, in characteristic two. We conclude by calculating the 3-ranks of the new difference sets. 相似文献
39.
Eckhard Steffen 《Discrete Mathematics》2004,280(1-3):191-214
Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let ck be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r3=|E|−c3 and
. We show that on one side r3 and r2 bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r3 and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr3. For k=2,3, let ζk denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other. 相似文献
40.
Jerry Green 《International Journal of Game Theory》2005,33(2):159-180
This paper presents an axiomatic characterization of a family of solutions to two-player quasi-linear social choice problems. In these problems the players select a single action from a set available to them. They may also transfer money between themselves.The solutions form a one-parameter family, where the parameter is a non-negative number, t.The solutions can be interpreted as follows: Any efficient action can be selected. Based on this action, compute for each player a “best claim for compensation”. A claim for compensation is the difference between the value of an alternative action and the selected efficient action, minus a penalty proportional to the extent to which the alternative action is inefficient. The coefficient of proportionality of this penalty is t. The best claim for compensation for a player is the maximum of this computed claim over all possible alternative actions. The solution, at the parameter value t, is to implement the chosen efficient action and make a monetary transfer equal to the average of these two best claims. The characterization relies on three main axioms. The paper presents and justifies these axioms and compares them to related conditions used in other bargaining contexts. In Nash Bargaining Theory, the axioms analogous to these three are in conflict with each other. In contrast, in the quasi-linear social choice setting of this paper, all three conditions can be satisfied simultaneously.This work was supported by the Division of Research at the Harvard Business School. Thanks are due to the Cowles Foundation for Research in Economics at Yale University for its kind hospitality during the Spring of 2002. I have received helpful advice and comments from Youngsub Chun, Ehud Kalai, Herve Moulin, Al Roth, Ilya Segal, Adam Szeidl, Richard Zeckhauser, and other members of the Theory Seminars at Harvard, MIT, Princeton, Rice and Northwestern. 相似文献