首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4424篇
  免费   120篇
  国内免费   22篇
化学   2719篇
晶体学   48篇
力学   98篇
数学   512篇
物理学   1189篇
  2022年   36篇
  2021年   73篇
  2020年   62篇
  2019年   64篇
  2018年   48篇
  2017年   36篇
  2016年   112篇
  2015年   87篇
  2014年   106篇
  2013年   182篇
  2012年   185篇
  2011年   241篇
  2010年   107篇
  2009年   112篇
  2008年   193篇
  2007年   191篇
  2006年   180篇
  2005年   167篇
  2004年   125篇
  2003年   137篇
  2002年   105篇
  2001年   108篇
  2000年   94篇
  1999年   62篇
  1998年   71篇
  1997年   34篇
  1996年   72篇
  1995年   65篇
  1994年   60篇
  1993年   58篇
  1992年   73篇
  1991年   61篇
  1990年   55篇
  1989年   52篇
  1988年   55篇
  1987年   50篇
  1986年   52篇
  1985年   62篇
  1984年   60篇
  1983年   39篇
  1982年   52篇
  1981年   53篇
  1980年   52篇
  1979年   60篇
  1978年   55篇
  1977年   53篇
  1976年   37篇
  1975年   40篇
  1974年   39篇
  1973年   34篇
排序方式: 共有4566条查询结果,搜索用时 15 毫秒
1.
Summary Using a saturated non-boiling hydrocarbon mixture, the influence of two parameters on the results of field ionization mass spectrometry (FI-MS) measurements was studied: (a) the potential difference between the FI emitter and the counterelectrode; (b) the emitter temperature.Variation of the potential difference had only a minor effect on the average molecular mass measured and had no evident effect on the relative ring number distribution in the sample. In contrast, when the emitter temperature was increased, higher average molecular masses were recorded. Moreover, the average molecular masses shifted to higher ring numbers. In order to control the relationship between the described influences during mixture analysis, measuring instructions have been developed that enable the quantitative analysis of unknown saturated samples. However, average molecular mass of the mixture must be known.
Entwicklung einer quantitativen FI-MS-Methode zur Charakterisierung von gesättigten hoch- und nichtsiedenden Kohlenwasserstoffgemischen
  相似文献   
2.
3.
4.
5.
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  相似文献   
6.
We consider noncommutative line bundles associated with the Hopf fibrations of SUq(2) over all Podle? spheres and with a locally trivial Hopf fibration of S3pq. These bundles are given as finitely generated projective modules associated via 1-dimensional representations of U(1) with Galois-type extensions encoding the principal fibrations of SUq(2) and S3pq. We show that the Chern numbers of these modules coincide with the winding numbers of representations defining them. To cite this article: P.M. Hajac et al., C. R. Acad. Sci. Paris, Ser. I 336 (2003).  相似文献   
7.
The optimum assignment of structural steel shapes to rail cars is an important logistical problem in the steel industry. In this paper, we discuss an application at Bethlehem Steel that not only involves weight and dimensional constraints, but also customer unloading constraints. The formulation is a generalized bin packing problem which is solved by modifying and extending the first fit decreasing algorithm. The solution algorithm, SOLID (for Structural Optimal Loading IDentification), has been used extensively for one of Bethlehem's high tonnage customers providing very good practical (implementable) results that achieve the desired goals. Bethlehem has enhanced this approach for use with other customers.  相似文献   
8.
Research supported by the NSF Grant DMS-8602672  相似文献   
9.
In this paper we introduce the notion of generalized physical and SRB measures. These measures naturally generalize classical physical and SRB measures to measures which are supported on invariant sets that are not necessarily attractors. We then perform a detailed case study of these measures for hyperbolic Hènon maps. For this class of systems we are able to develop a complete theory about the existence, uniqueness, finiteness, and properties of these natural measures. Moreover, we derive a classification for the existence of a measure of full dimension. We also consider general hyperbolic surface diffeomorphisms and discuss possible extensions of, as well as the differences to, the results for Hènon maps. Finally, we study the regular dependence of the dimension of the generalized physical/SRB measure on the diffeomorphism. For the proofs we apply various techniques from smooth ergodic theory including the thermodynamic formalism. 2000 Mathematics Subject Classification. Primary: 37C45, 37D20, 37D35, Secondary: 37A35, 37E30  相似文献   
10.
The Hidden Markov Chains (HMC) are widely applied in various problems. This succes is mainly due to the fact that the hidden process can be recovered even in the case of very large set of data. These models have been recetly generalized to ‘Pairwise Markov Chains’ (PMC) model, which admit the same processing power and a better modeling one. The aim of this note is to propose further generalization called Triplet Markov Chains (TMC), in which the distribution of the couple (hidden process, observed process) is the marginal distribution of a Markov chain. Similarly to HMC, we show that posterior marginals are still calculable in Triplets Markov Chains. We provide a necessary and sufficient condition that a TMC is a PMC, which shows that the new model is strictly more general. Furthermore, a link with the Dempster–Shafer fusion is specified. To cite this article: W. Pieczynski, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 275–278.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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