首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   112450篇
  免费   5910篇
  国内免费   4031篇
化学   48704篇
晶体学   1125篇
力学   8732篇
综合类   241篇
数学   35832篇
物理学   27757篇
  2024年   71篇
  2023年   741篇
  2022年   986篇
  2021年   1259篇
  2020年   1428篇
  2019年   1296篇
  2018年   11266篇
  2017年   11023篇
  2016年   7475篇
  2015年   2368篇
  2014年   2216篇
  2013年   2799篇
  2012年   6896篇
  2011年   13427篇
  2010年   7668篇
  2009年   7954篇
  2008年   8672篇
  2007年   10575篇
  2006年   2052篇
  2005年   2812篇
  2004年   2791篇
  2003年   2925篇
  2002年   1885篇
  2001年   976篇
  2000年   978篇
  1999年   984篇
  1998年   882篇
  1997年   781篇
  1996年   902篇
  1995年   715篇
  1994年   625篇
  1993年   564篇
  1992年   511篇
  1991年   428篇
  1990年   375篇
  1989年   295篇
  1988年   274篇
  1987年   256篇
  1986年   198篇
  1985年   202篇
  1984年   177篇
  1983年   153篇
  1982年   122篇
  1981年   97篇
  1980年   95篇
  1979年   76篇
  1978年   60篇
  1976年   43篇
  1975年   47篇
  1914年   45篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
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.  相似文献   
82.
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  相似文献   
83.
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  相似文献   
84.
85.
86.
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.  相似文献   
87.
The principal physics goals of the Compact Muon Solenoid experiment under construction at the Large Hadron Collider at CERN in Geneva are reviewed. Procedures to search for the Standard Model Higgs boson, supersymmetric Higgses and other supersymmetric particles are described.  相似文献   
88.
Analysis of the field distributions in a single biological cell under electromagnetic wave is given. With Debye approximation, the dielectric relaxation of each part of the cell, including the extracellular and cellular media, the cell membrane and the nuclear membrane, was taken into account. Making use of some typical parameters for a cell, the voltage across nuclear and cytoplasma membranes under electromagnetic waves are calculated up to millimeter wave frequency range. The calculated result indicates that it is unlikely to generate electroporation by present available millimeter wave sources.  相似文献   
89.
提出了一种基于微悬臂梁传感技术研究大分子折叠/构象转变的新方法.通过分子自组装的方法将热敏性的聚N-异丙基丙烯酰胺(PNIPAM)分子链修饰到微悬臂梁的单侧表面,用光杠杆技术检测温度在20-40 ℃之间变化时由于微悬臂梁上的PNIPAM分子在水中的构象转变所引起的微悬臂梁变形.实验结果显示:在升温过程中,微悬臂梁的表面应力发生了变化并且导致微悬臂梁产生了弯曲变形,这个过程对应着微悬臂梁上的PNIPAM分子从无规线团构象到塌缩小球构象的构象转变.在降温过程中,微悬臂梁发生了反方向的弯曲变形,这对应着PNIPAM分子从塌缩小球构象向无规线团构象的构象转变.整个温度变化过程中构象转变是连续进行的,而在低临界溶解温度(约32 ℃)附近转变幅度较大,这与自由水溶液中PNIPAM分子的无规线团-塌缩小球构象转变相对应.实验结果还显示:由于PNIPAM分子在塌缩过程中氢键的形成和链段间可能的缠结效应,整个温度循环过程中微悬臂梁的变形是不可逆的且有明显的迟滞效应.  相似文献   
90.
This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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