首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10474篇
  免费   762篇
  国内免费   826篇
化学   1033篇
晶体学   20篇
力学   1261篇
综合类   78篇
数学   6911篇
物理学   2759篇
  2023年   85篇
  2022年   93篇
  2021年   127篇
  2020年   203篇
  2019年   196篇
  2018年   235篇
  2017年   265篇
  2016年   294篇
  2015年   201篇
  2014年   447篇
  2013年   709篇
  2012年   428篇
  2011年   483篇
  2010年   437篇
  2009年   633篇
  2008年   738篇
  2007年   677篇
  2006年   654篇
  2005年   559篇
  2004年   454篇
  2003年   496篇
  2002年   443篇
  2001年   366篇
  2000年   370篇
  1999年   337篇
  1998年   284篇
  1997年   288篇
  1996年   183篇
  1995年   166篇
  1994年   129篇
  1993年   106篇
  1992年   96篇
  1991年   98篇
  1990年   83篇
  1989年   78篇
  1988年   67篇
  1987年   52篇
  1986年   48篇
  1985年   56篇
  1984年   62篇
  1983年   24篇
  1982年   41篇
  1981年   37篇
  1980年   36篇
  1979年   28篇
  1978年   31篇
  1977年   41篇
  1976年   25篇
  1974年   14篇
  1973年   15篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key roles in solving large scale knowledge-based data classification problems where they are used to describe the containments as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments.  相似文献   
52.
We present the recent experimental results on the 6He structure studied by the 6Li(t, 3He)6He reaction at 336 MeV. Above the conspicuous peaks for ground and first excited states for 6He, we have observed a broad structures at E x∼ 5 MeV, and E x∼ 15 MeV. The angular distribution of this structure exhibits the dominance of a ΔL = 1 transition, indicating the existence of intruder dipole states at low excitation energies in 6He. A slight admixture of positive-parity states in this structure has been indicated as well. Received: 1 May 2001 / Accepted: 4 December 2001  相似文献   
53.
In this paper, we first define a kind of pseudo–distance function and annulus domain on Riemann surfaces, then prove the Hadamard Theorem and the Borel–Carathéodory Theorem on any Riemann surfaces. Supported by NSFC 10501052  相似文献   
54.
刘小青  谢芳森 《光子学报》2002,31(10):1178-1183
导出了类Kerr介质中双模SU(1,1)相干态场与Λ型三能级原子相互作用系统的态函数,研究了Kerr效应对Λ型三能级原子布居概率、双模SU(1,1)相干态场的互关联函数、Cauchy-Schwartz不等式及二阶相干度的影响.结果表明:Kerr效应使原子与光场的耦合减弱,原子布居的崩塌与复苏的周期缩短;在初始光场较弱和较强两种情况下,类Kerr介质对双模SU(1,1)相干态场两模间的相关性、相关程度以及光子的聚束与反聚束效应产生的作用有明显的区别.  相似文献   
55.
In this paper, we review and unify some classes of generalized convex functions introduced by different authors to prove minimax results in infinite-dimensional spaces and show the relations between these classes. We list also for the most general class already introduced by Jeyakumar (Ref. 1) an elementary proof of a minimax result. The proof of this result uses only a finite-dimensional separa- tion theorem; although this minimax result was already presented by Neumann (Ref. 2) and independently by Jeyakumar (Ref. 1), we believe that the present proof is shorter and more transparent.  相似文献   
56.
Noncooperative games of a finite number of persons with interval-valued payoff functions are considered. The concept of an equilibrium situation is introduced. A reduction of such games to deterministic noncooperative games is proposed. Properties of the reduced games are discussed. Interval antagonistic and bimatrix games are examined, and illustrative examples are considered.  相似文献   
57.
Necessary and sufficient conditions in constrained optimization   总被引:22,自引:0,他引:22  
Additional conditions are attached to the Kuhn-Tucker conditions giving a set of conditions which are both necessary and sufficient for optimality in constrained optimization, under appropriate constraint qualifications. Necessary and sufficient conditions are also given for optimality of the dual problem. Duality and converse duality are treated accordingly.  相似文献   
58.
We establish an exclusion principle in discrete-time Kolmogorov systems by using average Liapunov functions. The exclusion principle shows that a weakly dominant species with a convex logarithmic growth rate function eliminates species with concave logarithmic growth rate functions. A general result is applied to specific population models. This application gives an improved exclusion principle for the specific population models.

  相似文献   

59.
Consider a portfolio containing heterogeneous risks. The premiums of the policyholders might not cover the amount of the payments which an insurance company pays the policyholders. When setting the premium, this risk has to be taken into consideration. On the other hand the premium that the insured pays has to be fair. This fairness is measured by a function of the difference between the risk and the premium paid—we call this function a distance function. For a given small probability of insolvency, we find the premium for each class, such that the distance function is minimized. Next we formulate and solve the dual problem, which is minimizing the insolvency probability under the constraint that the distance function does not exceed a given level. This paper generalizes a previous paper [Zaks, Y., Frostig, E., Levikson, B., 2006. Optimal pricing of a heterogeneous portfolio for a given risk level. Astin Bull. 36 (1), 161–185] where only a square distance function was considered.  相似文献   
60.
We introduce the concept of quotient in PN spaces and give some examples. We prove some theorems with regard to the completeness of a quotient.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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