首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   126820篇
  免费   2417篇
  国内免费   424篇
化学   56452篇
晶体学   1004篇
力学   8209篇
数学   39090篇
物理学   24906篇
  2023年   399篇
  2022年   384篇
  2021年   586篇
  2020年   755篇
  2019年   716篇
  2018年   11084篇
  2017年   10737篇
  2016年   7493篇
  2015年   2325篇
  2014年   1824篇
  2013年   3417篇
  2012年   7260篇
  2011年   13693篇
  2010年   7565篇
  2009年   7635篇
  2008年   9468篇
  2007年   11517篇
  2006年   2987篇
  2005年   3959篇
  2004年   3836篇
  2003年   3794篇
  2002年   2590篇
  2001年   1189篇
  2000年   1074篇
  1999年   721篇
  1998年   628篇
  1997年   540篇
  1996年   706篇
  1995年   427篇
  1994年   447篇
  1993年   459篇
  1992年   457篇
  1991年   407篇
  1990年   384篇
  1989年   384篇
  1988年   326篇
  1987年   325篇
  1986年   290篇
  1985年   458篇
  1984年   416篇
  1983年   299篇
  1982年   396篇
  1981年   364篇
  1980年   338篇
  1979年   322篇
  1978年   302篇
  1976年   293篇
  1975年   257篇
  1974年   268篇
  1973年   266篇
排序方式: 共有10000条查询结果,搜索用时 5 毫秒
91.
Summary We give a syntactic characterization of (finitary) theories whose categories of models are closed under the formation of connected limits (respectively the formation of pullbacks and substructures) in the category of all structures. They are also those theories whose consistent extensions by new atomic facts admit in each component an initial structure (respectively an initial term structure), and also thoseT for whichM(T) is locally finitely multi-presentable in a canonical way. We also show that these two properties of theories are nonuniform.  相似文献   
92.
93.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.  相似文献   
94.
In this Note, we study a 2×2 system of evolution equations with some codimension 3 crossing. We derive two conditions of non-degeneracy. We focus on one of them and reduce our system to some Landau–Zener's type system. Using this reduction, we describe the energy transfer at the crossing by Landau–Zener formula for 2-scales semi-classical measures. To cite this article: C. Fermanian Kammerer, P. Gérard, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 915–920.  相似文献   
95.
We study the recent construction of subfactors by Rehren which generalizes the Longo–Rehren subfactors. We prove that if we apply this construction to a non-degenerately braided subfactor NM and α±-induction, then the resulting subfactor is dual to the Longo–Rehren subfactor MM oppR arising from the entire system of irreducible endomorphisms of M resulting from αplusmn;-induction. As a corollary, we solve a problem on existence of braiding raised by Rehren negatively. Furthermore, we generalize our previous study with Longo and Müger on multi-interval subfactors arising from a completely rational conformal net of factors on S 1 to a net of subfactors and show that the (generalized) Longo–Rehren subfactors and α-induction naturally appear in this context. Received: 11 September 2001 / Accepted: 7 October 2001  相似文献   
96.
We consider complete ideals supported on finite sequences of infinitely near points, in regular local rings with dimensions greater than two. We study properties of factorizations in Lipman special *-simple complete ideals. We relate it to a type of proximity, linear proximity, of the points, and give conditions in order to have unique factorization. Several examples are presented. Received: 2 February 2000 / in final form: 14 March 2001 / Published online: 18 January 2002  相似文献   
97.
98.
99.
100.
We consider autonomous systems with a nonlinear part depending on a parameter and study Hopf bifurcations at infinity. The nonlinear part consists of the nonlinear functional term and the Prandtl--Ishlinskii hysteresis term. The linear part of the system has a special form such that the close-loop system can be considered as a hysteresis perturbation of a quasilinear Hamiltonian system. The Hamiltonian system has a continuum of arbitrarily large cycles for each value of the parameter. We present sufficient conditions for the existence of bifurcation points for the non-Hamiltonian system with hysteresis. These bifurcation points are determined by simple characteristics of the hysteresis nonlinearity.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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