全文获取类型
收费全文 | 2015篇 |
免费 | 121篇 |
国内免费 | 106篇 |
专业分类
化学 | 92篇 |
力学 | 57篇 |
综合类 | 18篇 |
数学 | 1709篇 |
物理学 | 366篇 |
出版年
2024年 | 1篇 |
2023年 | 25篇 |
2022年 | 79篇 |
2021年 | 100篇 |
2020年 | 67篇 |
2019年 | 44篇 |
2018年 | 45篇 |
2017年 | 54篇 |
2016年 | 51篇 |
2015年 | 42篇 |
2014年 | 58篇 |
2013年 | 160篇 |
2012年 | 74篇 |
2011年 | 119篇 |
2010年 | 90篇 |
2009年 | 150篇 |
2008年 | 137篇 |
2007年 | 134篇 |
2006年 | 116篇 |
2005年 | 77篇 |
2004年 | 69篇 |
2003年 | 66篇 |
2002年 | 60篇 |
2001年 | 58篇 |
2000年 | 65篇 |
1999年 | 49篇 |
1998年 | 39篇 |
1997年 | 50篇 |
1996年 | 26篇 |
1995年 | 16篇 |
1994年 | 25篇 |
1993年 | 16篇 |
1992年 | 13篇 |
1991年 | 9篇 |
1990年 | 10篇 |
1989年 | 2篇 |
1988年 | 5篇 |
1987年 | 6篇 |
1986年 | 9篇 |
1985年 | 12篇 |
1984年 | 8篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1975年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有2242条查询结果,搜索用时 78 毫秒
21.
22.
Let E\subset \Bbb R
s
be compact and let d
n
E
denote the dimension of the space of polynomials of degree at most n in s variables restricted to E . We introduce the notion of an asymptotic interpolation measure (AIM). Such a measure, if it exists , describes the asymptotic behavior of any scheme τ
n
={ \bf x
k,n
}
k=1
dnE
, n=1,2,\ldots , of nodes for multivariate polynomial interpolation for which the norms of the corresponding interpolation operators do
not grow geometrically large with n . We demonstrate the existence of AIMs for the finite union of compact subsets of certain algebraic curves in R
2
. It turns out that the theory of logarithmic potentials with external fields plays a useful role in the investigation. Furthermore,
for the sets mentioned above, we give a computationally simple construction for ``good' interpolation schemes.
November 9, 2000. Date revised: August 4, 2001. Date accepted: September 14, 2001. 相似文献
23.
W. Brüggemann K. Fischer H. Jahnke 《Journal of Mathematical Modelling and Algorithms》2003,2(2):153-169
In Part I of this study, we suggest to identify an operations research (OR) problem with the equivalence class of models describing the problem and enhance the standard computer-science theory of computational complexity to be applicable to this situation of an often model-based OR context. The Discrete Lot-sizing and Scheduling Problem (DLSP) is analysed here in detail to demonstrate the difficulties which can arise if these aspects are neglected and to illustrate the new theoretical concept. In addition, a new minimal model is introduced for the DLSP which makes this problem eventually amenable to a rigorous analysis of its computational complexity. 相似文献
24.
Some properties of the bilevel programming problem 总被引:8,自引:0,他引:8
J. F. Bard 《Journal of Optimization Theory and Applications》1991,68(2):371-378
The purpose of this paper is to elaborate on the difficulties accompanying the development of efficient algorithms for solving the bilevel programming problem (BLPP). We begin with a pair of examples showing that, even under the best of circumstances, solutions may not exist. This is followed by a proof that the BLPP is NP-hard.This work was partially supported by a grant from the Advanced Research Program of the Texas Higher Education Coordinating Board. 相似文献
25.
J. Freudenberger 《Discrete Applied Mathematics》2006,154(2):294-304
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and the complexity of this suboptimum list decoding scheme for the binary symmetric channel. The reliability function of the list decoding scheme is equivalent to the sphere-packing bound, where the decoding complexity is asymptotically bounded by 2nR(1-R). Furthermore, we investigate a decision feedback strategy that is based on bounded distance list decoding. Here, any output with zero or many codewords will call for a repeated transmission. In this case the decoding complexity will be of the order 2nR(1-C), where C denotes the channel capacity. The reliability function is close to Forney's feedback exponent. 相似文献
26.
R. Webster 《国际流体数值方法杂志》1994,18(8):761-780
An efficient numerical method is presented for solving the equations of motion for viscous fluids. The equations are discretized on the basis of unstructured finite element meshes and then solved by direct iteration. Advective fluxes are temporarily fixed at each iteration to provide a linearized set of coupled equations which are then also solved by iteration using a fully implicit algebraic multigrid (AMG) scheme. A rapid convergence to machine accuracy is achieved that is almost mesh-independent. The scaling of computing time with mesh size is therefore close to the optimum. 相似文献
27.
28.
Pure adaptive search in global optimization 总被引:10,自引:0,他引:10
Pure adaptive seach iteratively constructs a sequence of interior points uniformly distributed within the corresponding sequence of nested improving regions of the feasible space. That is, at any iteration, the next point in the sequence is uniformly distributed over the region of feasible space containing all points that are strictly superior in value to the previous points in the sequence. The complexity of this algorithm is measured by the expected number of iterations required to achieve a given accuracy of solution. We show that for global mathematical programs satisfying the Lipschitz condition, its complexity increases at mostlinearly in the dimension of the problem.This work was supported in part by NATO grant 0119/89. 相似文献
29.
研究无原子布氏代数的计算复杂性 .得到了下面的新定理 :定理 1 无原子布氏代数理论Δ具有完全的量词消去法 ,也就是说每一个式子都Δ等价于一个开式子 .定理 2 无原子布氏代数的初等型Γ (x1,… ,xn)是由型内的不含量词的全体开式子所唯一决定 .定理 3 无原子布氏代数的一个长度为 n的语句的判断过程所消耗的 Turing时间和空间都是属于 2 2 cn指数级 . 相似文献
30.
J.-Q. Shen H.-Y. Zhu P. Chen 《The European Physical Journal D - Atomic, Molecular, Optical and Plasma Physics》2003,23(2):305-313
There exist a number of typical and interesting systems and/or models, which possess three-generator Lie-algebraic structure,
in atomic physics, quantum optics, nuclear physics and laser physics. The well-known fact that all simple 3-generator algebras
are either isomorphic to the algebra sl (2, C) or to one of its real forms enables us to treat these time-dependent quantum systems in a unified way. By making use of
both the Lewis-Riesenfeld invariant theory and the invariant-related unitary transformation formulation, the present paper
obtains exact solutions of the time-dependent Schr?dinger equations governing various three-generator Lie-algebraic quantum
systems. For some quantum systems whose time-dependent Hamiltonians have no quasialgebraic structures, it is shown that the exact solutions can also be obtained by working in a
sub-Hilbert-space corresponding to a particular eigenvalue of the conserved generator (i.e., the time-independent invariant that commutes with the time-dependent Hamiltonian). The topological property of geometric phase factors and its adiabatic limit in time-dependent systems is briefly
discussed.
Received 6 July 2002 / Received in final form 21 October 2002 Published online 11 February 2003 相似文献