首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   14719篇
  免费   1503篇
  国内免费   1227篇
化学   1769篇
晶体学   50篇
力学   1258篇
综合类   344篇
数学   10605篇
物理学   3423篇
  2024年   29篇
  2023年   98篇
  2022年   139篇
  2021年   226篇
  2020年   305篇
  2019年   343篇
  2018年   322篇
  2017年   444篇
  2016年   496篇
  2015年   347篇
  2014年   584篇
  2013年   1137篇
  2012年   705篇
  2011年   760篇
  2010年   690篇
  2009年   908篇
  2008年   949篇
  2007年   986篇
  2006年   846篇
  2005年   735篇
  2004年   683篇
  2003年   724篇
  2002年   648篇
  2001年   522篇
  2000年   546篇
  1999年   466篇
  1998年   411篇
  1997年   357篇
  1996年   299篇
  1995年   191篇
  1994年   218篇
  1993年   156篇
  1992年   154篇
  1991年   142篇
  1990年   114篇
  1989年   87篇
  1988年   79篇
  1987年   71篇
  1986年   48篇
  1985年   77篇
  1984年   73篇
  1983年   44篇
  1982年   50篇
  1981年   58篇
  1980年   32篇
  1979年   33篇
  1978年   36篇
  1977年   23篇
  1976年   18篇
  1973年   11篇
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
81.
The paper considers upper semicontinuous behavior in distribution of sequences of random closed sets. Semiconvergence in distribution will be described via convergence in distribution of random variables with values in a suitable topological space. Convergence statements for suitable functions of random sets are proved and the results are employed to derive stability statements for random optimization problems where the objective function and the constraint set are approximated simultaneously. The author is grateful to two anonymous referees for helpful suggestions.  相似文献   
82.
The double-pass method is thought to obtain the point spread function (PSF) in human eyes based on two techniques: the symmetric double-pass method using the same pupil size and the asymmetric double-pass method using a different pupil size. The symmetric double-pass method provides autocorrelation of the retinal PSF and, thus, the modulation transfer function. The asymmetric double-pass method provides low-frequency partial-phase information and the partial phase-retrieval algorithm is applied to obtain the complete-phase information, and to estimate the PSF. The partial phase-retrieval algorithm is based on the iteration method proposed by Fineup and Kowalczyk and requires a lengthy computation. In this study, we propose a new high-speed phase-retrieval algorithm based on the property that the real and imaginary parts of optical transfer functions (OTFs) continuously change in value.  相似文献   
83.
引进了随机环境中多物种分枝随机游动的一般模型.在分枝过程非灭绝的情况下,讨论了系统的状态分类,得到了系统暂留及强常返的充要条件是存在k个定义在整数集上的函数分别满足某种性质.最后给出了系统强暂留的充分条件.  相似文献   
84.
The bond random mixed compound Fe(Br0.9I0.1)2 has been studied by magnetization and Mössbauer measurements. Although the zero-field cooled and field-cooled magnetization variations are not like a typical spin glass one, the Mössbauer spectrum below Néel temperature shows a hyperfine field distribution. It implies that the 10% FeI2 mixed in FeBr2 can be induced by the bond random effect which causes the sample to exhibit a spin glass-like behavior.  相似文献   
85.
Bubble pressure points of ethanol–1,1,1,2,3,3,3-heptafluoropropane (HFC-227ea refrigerant) mixtures from the third Industrial Fluid Properties Simulation Challenge are computed using publicly available molecular simulation software. Several published force fields are compared against the known answers provided in the contest guidelines and the best force fields are used to make predictions for the unknown results.  相似文献   
86.
87.
通过对开关布局问题的研究,来解决一类象开关线路一样比较特殊,比较复杂的布局优化问题。从而寻找出这类问题的全局优化算法。本应用对称群对集合的作用,轨道,不动点等讨论了开关布局问题,给出了本质不同的开关线路个数的计算公式。  相似文献   
88.
Let X be a Banach space whose characteristic of noncompact convexity is less than 1 and satisfies the nonstrict Opial condition. Let C be a bounded closed convex subset of X, KC(X) the family of all compact convex subsets of X and T a nonexpansive mapping from C into KC(X) with bounded range. We prove that T has a fixed point. The nonstrict Opial condition can be removed if, in addition, T is an 1-χ-contractive mapping.  相似文献   
89.
We study the asymptotic distribution of the fill‐up level in a binary trie built over n independent strings generated by a biased memoryless source. The fill‐up level is the number of full levels in a tree. A level is full if it contains the maximum allowable number of nodes (e.g., in a binary tree level k can have up to 2k nodes). The fill‐up level finds many interesting applications, e.g., in the internet IP lookup problem and in the analysis of level compressed tries (LC tries). In this paper, we present a complete asymptotic characterization of the fill‐up distribution. In particular, we prove that this distribution concentrates on one or two points around the most probably value k = ?log1/qn ? log log log n + 1 + log log(p/q)?, where p > q = 1 ? p is the probability of generating the more likely symbol (while q = 1 ? p is the probability of the less likely symbol). We derive our results by analytic methods such as generating functions, Mellin transform, the saddle point method, and analytic depoissonization. We also present some numerical verification of our results. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004  相似文献   
90.
We propose a new approach towards proving that the fixed point property for ordered sets is preserved by products. This approach uses a characterization of fixed points in products via isotone relations. First explorations of classes of isotone relations are presented. These first explorations give us hope that this approach could lead to advances on the Product Problem.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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