全文获取类型
收费全文 | 2393篇 |
免费 | 162篇 |
国内免费 | 163篇 |
专业分类
化学 | 110篇 |
力学 | 221篇 |
综合类 | 47篇 |
数学 | 2088篇 |
物理学 | 252篇 |
出版年
2024年 | 5篇 |
2023年 | 40篇 |
2022年 | 40篇 |
2021年 | 35篇 |
2020年 | 49篇 |
2019年 | 61篇 |
2018年 | 64篇 |
2017年 | 60篇 |
2016年 | 71篇 |
2015年 | 53篇 |
2014年 | 116篇 |
2013年 | 192篇 |
2012年 | 101篇 |
2011年 | 135篇 |
2010年 | 124篇 |
2009年 | 154篇 |
2008年 | 142篇 |
2007年 | 152篇 |
2006年 | 147篇 |
2005年 | 108篇 |
2004年 | 100篇 |
2003年 | 79篇 |
2002年 | 101篇 |
2001年 | 85篇 |
2000年 | 64篇 |
1999年 | 70篇 |
1998年 | 55篇 |
1997年 | 55篇 |
1996年 | 36篇 |
1995年 | 45篇 |
1994年 | 33篇 |
1993年 | 19篇 |
1992年 | 28篇 |
1991年 | 15篇 |
1990年 | 11篇 |
1989年 | 6篇 |
1988年 | 11篇 |
1987年 | 4篇 |
1986年 | 4篇 |
1985年 | 5篇 |
1984年 | 4篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 9篇 |
1980年 | 9篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 5篇 |
1976年 | 2篇 |
1973年 | 1篇 |
排序方式: 共有2718条查询结果,搜索用时 153 毫秒
1.
《Operations Research Letters》2022,50(3):274-280
The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets. 相似文献
2.
本文证明了Heisenberg群上Laplace算子的Dirichlet特征值的存在性,给出了特征值的估计 相似文献
3.
利用Riccati变换求解同谐谐振子的定态薛定谔方程,求得了能谱及态函数
关键词:
同调谐振子
本征值谱
Riccati变换法 相似文献
4.
A. A. Abramov S. V. Kurochkin 《Computational Mathematics and Mathematical Physics》2006,46(6):949-954
A new method for calculating the radial spheroidal functions of the first kind is proposed for the arguments that are greater than unity in modulus. A well-known representation of these functions is refined and used for this purpose. The constructs and the software implementation proposed in the paper provide an efficient tool for the calculation of the functions with a desired accuracy in a wide range of parameters. 相似文献
5.
Equilibrium Problems with Applications to Eigenvalue Problems 总被引:5,自引:0,他引:5
In this paper, we consider equilibrium problems and introduce the concept of (S)+ condition for bifunctions. Existence results for equilibrium problems with the (S)+ condition are derived. As special cases, we obtain several existence results for the generalized nonlinear variational inequality studied by Ding and Tarafdar (Ref. 1) and the generalized variational inequality studied by Cubiotti and Yao (Ref. 2). Finally, applications to a class of eigenvalue problems are given. 相似文献
6.
Francis K. Bell 《Journal of Graph Theory》2003,43(2):137-149
It is shown that, if t is an integer ≥3 and not equal to 7 or 8, then there is a unique maximal graph having the path Pt as a star complement for the eigenvalue ?2. The maximal graph is the line graph of Km,m if t = 2m?1, and of Km,m+1 if t = 2m. This result yields a characterization of L(G ) when G is a (t + 1)‐vertex bipartite graph with a Hamiltonian path. The graphs with star complement Pr ∪ Ps or Pr ∪ Cs for ?2 are also determined. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 137–149, 2003 相似文献
7.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
8.
Riad Hassani Patrick Hild Ioan Ionescu 《Mathematical Methods in the Applied Sciences》2004,27(1):47-67
We consider the Signorini problem with Coulomb friction in elasticity. Sufficient conditions of non‐uniqueness are obtained for the continuous model. These conditions are linked to the existence of real eigenvalues of an operator in a Hilbert space. We prove that, under appropriate conditions, real eigenvalues exist for a non‐local Coulomb friction model. Finite element approximation of the eigenvalue problem is considered and numerical experiments are performed. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
9.
We present an O(min(Kn,n2)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality. 相似文献
10.
Yao Ping HOU 《数学学报(英文版)》2005,21(4):955-960
A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated. 相似文献