首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7212篇
  免费   762篇
  国内免费   673篇
化学   3881篇
晶体学   40篇
力学   167篇
综合类   75篇
数学   3393篇
物理学   1091篇
  2024年   11篇
  2023年   77篇
  2022年   134篇
  2021年   176篇
  2020年   194篇
  2019年   222篇
  2018年   163篇
  2017年   247篇
  2016年   288篇
  2015年   233篇
  2014年   410篇
  2013年   759篇
  2012年   451篇
  2011年   472篇
  2010年   444篇
  2009年   494篇
  2008年   497篇
  2007年   542篇
  2006年   370篇
  2005年   326篇
  2004年   253篇
  2003年   245篇
  2002年   197篇
  2001年   209篇
  2000年   155篇
  1999年   151篇
  1998年   117篇
  1997年   108篇
  1996年   110篇
  1995年   96篇
  1994年   76篇
  1993年   69篇
  1992年   74篇
  1991年   56篇
  1990年   26篇
  1989年   28篇
  1988年   23篇
  1987年   16篇
  1986年   17篇
  1985年   20篇
  1984年   13篇
  1983年   8篇
  1982年   23篇
  1981年   6篇
  1980年   7篇
  1979年   10篇
  1978年   6篇
  1977年   3篇
  1974年   3篇
  1973年   7篇
排序方式: 共有8647条查询结果,搜索用时 78 毫秒
991.
The ergodic behavior of a linear diatomic chain is shown to be analogous to that of a linear monatomic chain. Starting with the expressions for the time-relaxed correlation functions between any two particles in the chain, we show that the existence of Poincaré cycles is not inconsistent with the development of an equilibrium state. Also, we show that those dynamical variables that are ergodic for the linear monoatomic chain remain ergodic in the diatomic chain. It is shown that the autocorrelation functions for particles with equal or different masses decay in time ast –1/2 .This work was completed when the author was associated with the Institute for Fluid Dynamics and Applied Mathematics, University of Maryland and supported by the United States Air Force through the Air Force Office of Scientific Research of the Air Research and Development Command under contract No. AF18(600)1315.  相似文献   
992.
The problem of multivariate information analysis is considered. First, the interaction information in each dimension is defined analogously according to McGill [4] and then applied to Markov chains. The property of interaction information zero deeply relates to a certain class of weakly dependent random variables. For homogeneous, recurrent Markov chains with m states, mn ≥3, the zero criterion of n-dimensional interaction information is achieved only by (n ? 2)-dependent Markov chains, which are generated by some nilpotent matrices. Further for Gaussian Markov chains, it gives the decomposition rule of the variables into mutually correlated subchains.  相似文献   
993.
The products of the reactions of polymethylalumoxane (MAO) with triisobutylaluminum (TIBA), rac-Me2Si(2-Me,4-PhInd)2ZrCl2 (1) with MAO (1 + MAO), and (1 + MAO) + TIBA were studied by 1H NMR at different molar ratios of the components. When the ratio AlTIBA/AlMAO is ∼6, the reaction between MAO and TIBA involves the replacement of the methyl group of MAO by isobutyl groups and the formation of isobutylmethylalumoxane or mixed isobutylmethylalumoxane structures. When the TIBA content in the system increases to 30 mol.%, these structures are rearranged to form products with a low degree of association. With the equimolar ratio of the reactants, the main reaction products are tetraisobutylalumoxane and polyisobutylalumoxane. The 1 + MAO system with the molar ratio AlMAO/Zr = 50 affords a MAO-bonded monomethyl monochloride derivative [L2ZrCl-μ-Me]δ+[MAO]δ−. An increase in this ratio to 150 produces intermediate binuclear complexes [L2ZrCl-μ-Me-MeZrL2]+[MAO] and [Me2Al-(μ-Me)2-ZrL2]+[MAO]. The addition of TIBA induces the replacement of the ZrMe groups by isobutyl groups at the first step of the interaction and formation of nonidentified reaction products at the subsequent steps. __________ Published in Russian in Izvestiya Akademii Nauk. Seriya Khimicheskaya, No. 4, pp. 934–940, April, 2005.  相似文献   
994.
Chain graph (CG) is a general model of graphical Markov models. Some different chain graphs may describe the same conditional independence structure, then we say that these CGs are Markov equivalent. In 1990 Frydenberg showed that every class of Markov equivalent CGs has a CG which is called the largest chain graph with the greatest number of lines. This paper presents an efficient algorithm for finding the largest chain graph of the corresponding Markov equivalent class of a given CG. The computational complexity of the algorithm is O(n3). It is more efficient than the complexity O(n!) of the present algorithms. Also a more intuitive graphical characterization of the largest chain graph is provided based on the algorithm in this paper.  相似文献   
995.
For each a compact group automorphism is constructed with the property that


This may be interpreted as a combinatorial analogue of the (still open) problem of whether compact group automorphisms with any given topological entropy exist.

  相似文献   

996.
The one-dimensional, two-component linear Ising chain with nearest-neighbor interaction is formulated by using the transfer matrix method, with emphasis placed on the case in which the two components are randomly distributed along the chain. Certain recurrence formulas appear such that themth-order partition function of one of the components is dependent on the lower-order ones. The algorithm provides a working basis for discussing the thermodynamic and magnetic functions with various concentrations of one of the components. An exact expression for the partition function is derived for a linear chain which is composed of a periodic distribution of the two components. The construction of a periodic sequence which would approximate a random distribution of the two components is briefly discussed.This study was partially supported by ARPA and monitored by ONR(N00014-17-0308).  相似文献   
997.
This review of the properties of leptons, mesons, and baryons is an updating of Review of Particle Properties, Particle Data Group [Rev. Mod. Phys. 45, No. 2, Part II, Supplement (1973)]. Data are evaluated, listed, averaged, and summarized in tables.  相似文献   
998.
This article solves the problem of finding a set of group decisions that satisfy the classical Pareto unanimity principle for the case of initial data represented as fuzzy relations of individual preference. The solution proceeds from results obtained in studying the structure of convex (in the sense defined here) sets and their convex hulls. In the first part that study is carried out for spaces of arbitrary fuzzy binary relations.  相似文献   
999.
Tolerance, bioaccumulation, biotransformation and excretion of arsenic compounds by the fresh–water shrimp (Neocaridina denticulata) and the killifish (Oryzias latipes) (collected from the natural environment) were investigated. Tolerances (LC50) of the shrimp against disodium arsenate [abbreviated as As(V)], methylarsonic acid (MAA), dimethylarsinic acid (DMAA), and arsenobetaine (AB) were 1.5, 10, 40, and 150μg As ml?1, respectively. N. denticulata accumulated arsenic from an aqueous phase containing 1 μg As ml?1 of As(V), 10 μg As ml?1 of MAA, 30 μg As ml?1 of DMAA or 150 μg As ml?1 of AB, and biotransformed and excreted part of these species. Both methylation and demethylation of the arsenicals were observed in vivo. When living N. denticulata accumulating arsenic was transferred into an arsenic–free medium, a part of the accumulated arsenic was excreted. The concentration of methylated arsenicals relative to total arsenic was higher in the excrement than in the organism. Total arsenic accumulation in each species via food in the food chain Green algae (Chlorella vulgaris) → shrimp (N. denticulata) → killifish (O. latipes) decreased by one order of magnitude or more, and the concentration of methylated arsenic relative to total arsenic accumulated increased successively with elevation in the trophic level. Only trace amounts of monomethylarsenic species were detected in the shrimp and fish tested. Dimethylarsenic species in alga and shrimp, and trimethylarsenic species in killifish, were the predominant methylated arsenic species, respectively.  相似文献   
1000.
刘云  韩广甸 《合成化学》1994,2(3):200-209
综述了近五年来由17-甾体酮基合成皮质激素侧链方法的进展。参考文献14篇。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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