首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   13260篇
  免费   2212篇
  国内免费   1421篇
化学   9140篇
晶体学   122篇
力学   884篇
综合类   88篇
数学   1615篇
物理学   5044篇
  2024年   45篇
  2023年   282篇
  2022年   476篇
  2021年   519篇
  2020年   532篇
  2019年   476篇
  2018年   463篇
  2017年   402篇
  2016年   576篇
  2015年   639篇
  2014年   736篇
  2013年   983篇
  2012年   1128篇
  2011年   1153篇
  2010年   798篇
  2009年   737篇
  2008年   821篇
  2007年   766篇
  2006年   687篇
  2005年   567篇
  2004年   417篇
  2003年   349篇
  2002年   320篇
  2001年   281篇
  2000年   235篇
  1999年   278篇
  1998年   262篇
  1997年   191篇
  1996年   214篇
  1995年   213篇
  1994年   183篇
  1993年   160篇
  1992年   129篇
  1991年   142篇
  1990年   143篇
  1989年   108篇
  1988年   92篇
  1987年   78篇
  1986年   61篇
  1985年   62篇
  1984年   28篇
  1983年   33篇
  1982年   26篇
  1981年   20篇
  1980年   13篇
  1979年   10篇
  1978年   8篇
  1977年   10篇
  1974年   6篇
  1973年   9篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
This paper introduces the essential stability for set optimization problems. Some kinds of essential stable sets of weakly minimal and minimal solutions are shown. The graph of minimal solution mappings is not necessarily closed, which is different from weakly minimal solution mappings. The existence of minimum essential sets of minimal solutions is proved.  相似文献   
992.
The symmetric cone complementarity problem (denoted by SCCP) is a broad class of optimization problems, which contains the semidefinite complementarity problem, the second-order cone complementarity problem, and the nonlinear complementarity problem. In this paper we first extend the smoothing function proposed by Huang et al. (Sci. China 44:1107–1114, 2001) for the nonlinear complementarity problem to the context of symmetric cones and show that it is coercive under suitable assumptions. Based on this smoothing function, a smoothing-type algorithm, which is a modified version of the Qi-Sun-Zhou method (Qi et al. in Math. Program. 87:1–35, 2000), is proposed for solving the SCCP. By using the theory of Euclidean Jordan algebras, we prove that the proposed algorithm is globally and locally quadratically convergent under suitable assumptions. Preliminary numerical results for some second-order cone complementarity problems are reported which indicate that the proposed algorithm is effective.  相似文献   
993.
研究了Kenichiro提出的轮换对称形式的丢番图方程,即方程ab bc ca=ya+b+c3的求解问题,利用素数整除的一些性质,证明了该方程仅有平凡解a=b=c以及非平凡解(a,b,c)=(k,k,4k),(k,4k,k),(4k,k,k)(k∈N),从而完全解决了这个方程.  相似文献   
994.
Let FG be a group algebra of a group G over a field F and U (FG) the unit group of FG. It is a classical question to determine the structure of the unit group of the group algebra of a finite group over a finite field. In this article, the structure of the unit group of the group algebra of the non-abelian group G with order 21 over any finite field of characteristic 3 is established. We also characterize the structure of the unit group of FA 4 over any finite field of characteristic 3 and the structure of the unit group of FQ 12 over any finite field of characteristic 2, where Q 12 = 〈x, y; x 6 = 1, y 2 = x 3, x y = x ?1〉.  相似文献   
995.
On the Largest Graph-Lagrangian of 3-Graphs with Fixed Number of Edges   总被引:1,自引:0,他引:1  
The Graph-Lagrangian of a hypergraph has been a useful tool in hypergraph extremal problems. In most applications, we need an upper bound for the Graph-Lagrangian of a hypergraph. Frankl and Füredi conjectured that the \({r}\) -graph with \(m\) edges formed by taking the first \(\textit{m}\) sets in the colex ordering of the collection of all subsets of \({\mathbb N}\) of size \({r}\) has the largest Graph-Lagrangian of all \(r\) -graphs with \(m\) edges. In this paper, we show that the largest Graph-Lagrangian of a class of left-compressed \(3\) -graphs with \(m\) edges is at most the Graph-Lagrangian of the \(\mathrm 3 \) -graph with \(m\) edges formed by taking the first \(m\) sets in the colex ordering of the collection of all subsets of \({\mathbb N}\) of size \({3}\) .  相似文献   
996.
997.
998.
Abstract

In this article, a projection-type method for mixed variational inequalities is proposed in Hilbert spaces. The proposed method has the following nice features: (i) The algorithm is well defined whether the solution set of the problem is nonempty or not, under some mild assumptions; (ii) If the solution set is nonempty, then the sequence generated by the method is strongly convergent to the solution, which is closest to the initial point; (iii) The existence of the solutions to variational inequalities can be verified through the behavior of the generated sequence. The results presented in this article generalize and improve some known results.  相似文献   
999.
1000.
Let (R, 𝔪) be a Cohen–Macaulay local ring of dimension d > 0, I an 𝔪-primary ideal of R and K an ideal containing I. When depth G(I) ≥ d ? 1 and r(I | K) < ∞, we present a lower bound on the second fiber coefficient of the fiber cones, and also provide a characterization, in terms of f 2(I, K), of the condition depth F K (I) ≥ d ? 1.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号