首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   161104篇
  免费   16745篇
  国内免费   9430篇
化学   82419篇
晶体学   1630篇
力学   11891篇
综合类   512篇
数学   41100篇
物理学   49727篇
  2024年   230篇
  2023年   1991篇
  2022年   2498篇
  2021年   3105篇
  2020年   3875篇
  2019年   3451篇
  2018年   12755篇
  2017年   12281篇
  2016年   10028篇
  2015年   4920篇
  2014年   5367篇
  2013年   6832篇
  2012年   11608篇
  2011年   18297篇
  2010年   10847篇
  2009年   11044篇
  2008年   11987篇
  2007年   13435篇
  2006年   4955篇
  2005年   5059篇
  2004年   4383篇
  2003年   4180篇
  2002年   3066篇
  2001年   2049篇
  2000年   1887篇
  1999年   1989篇
  1998年   1779篇
  1997年   1718篇
  1996年   1756篇
  1995年   1436篇
  1994年   1224篇
  1993年   1088篇
  1992年   910篇
  1991年   845篇
  1990年   691篇
  1989年   559篇
  1988年   428篇
  1987年   365篇
  1986年   380篇
  1985年   307篇
  1984年   193篇
  1983年   153篇
  1982年   141篇
  1981年   95篇
  1980年   88篇
  1979年   54篇
  1914年   45篇
  1912年   40篇
  1909年   41篇
  1908年   40篇
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
181.
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.  相似文献   
182.
We extend two inequalities involving Hadamard products of positive definite Hermitian matrices to positive semi-definite Hermitian matrices. Simultaneously, we also show the sufficient conditions for equalities to hold. Moreover, some other matrix inequalities are also obtained. Our results and methods are different from those which are obtained by S. Liu in [J. Math. Anal. Appl. 243:458–463(2000)] and B.-Y. Wang et al. in [Lin. Alg. Appl. 302–303: 163–172(1999)].  相似文献   
183.
ON A LINEAR DELAY DIFFERENCE EQUATION WITH IMPULSES   总被引:2,自引:0,他引:2  
IIntroductlonLet N denote the set of all Integers.FOr any a;b E N,define N(a)={a,a+1,…},N(a,b)二{a,a+1,…,b}when a<b.Consider the dlf卜巳renceequationl 凸x。+P。x。-。=0;nEN(0)andN4n。;2—“-””’”门二l0 凸X。,=~X。,,JENO);where A denotes the forward difference operator八。。=x。+l一 x。,{P。} Isa sequence ofnon-negative real numbers,{nj}Is a sequence ofnon-negativeIntegers with nj<nj+lfor j E N(1)and nj一 co as ;一 co,{4}Is a sequence。I优。且皿mb ers,…  相似文献   
184.
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  相似文献   
185.
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  相似文献   
186.
187.
188.
Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λKn into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P3,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008  相似文献   
189.
190.
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号