首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2266篇
  免费   94篇
  国内免费   7篇
化学   1619篇
晶体学   25篇
力学   56篇
数学   318篇
物理学   349篇
  2022年   13篇
  2021年   25篇
  2020年   21篇
  2019年   25篇
  2018年   21篇
  2017年   11篇
  2016年   53篇
  2015年   51篇
  2014年   62篇
  2013年   145篇
  2012年   115篇
  2011年   142篇
  2010年   87篇
  2009年   67篇
  2008年   121篇
  2007年   123篇
  2006年   141篇
  2005年   119篇
  2004年   129篇
  2003年   96篇
  2002年   87篇
  2001年   21篇
  2000年   28篇
  1999年   22篇
  1998年   26篇
  1997年   28篇
  1996年   34篇
  1995年   25篇
  1994年   27篇
  1993年   25篇
  1992年   17篇
  1991年   19篇
  1990年   18篇
  1989年   26篇
  1988年   21篇
  1987年   13篇
  1986年   18篇
  1985年   33篇
  1984年   31篇
  1983年   22篇
  1982年   22篇
  1981年   28篇
  1980年   31篇
  1979年   20篇
  1978年   17篇
  1977年   23篇
  1976年   16篇
  1975年   21篇
  1974年   13篇
  1973年   21篇
排序方式: 共有2367条查询结果,搜索用时 15 毫秒
11.
12.
Amylopectin tris(phenylcarbamate) has been evaluated as a chiral stationary phase for HPLC; the influence on its cptical resolving capabilities of mobile phase composition and nature of the alcohol used as modifier has been studied. Separation and resolution of twelve arylalcohol racemates were examined. In most instances, the stationary phase exhibited high optical resolving capacity.  相似文献   
13.
The problem ofminimum color sumof a graph is to color the vertices of the graph such that the sum (average) of all assigned colors is minimum. Recently it was shown that in general graphs this problem cannot be approximated withinn1 − ε, for any ε > 0, unlessNP = ZPP(Bar-Noyet al., Information and Computation140(1998), 183–202). In the same paper, a 9/8-approximation algorithm was presented for bipartite graphs. The hardness question for this problem on bipartite graphs was left open. In this paper we show that the minimum color sum problem for bipartite graphs admits no polynomial approximation scheme, unlessP = NP. The proof is byL-reducing the problem of finding the maximum independent set in a graph whose maximum degree is four to this problem. This result indicates clearly that the minimum color sum problem is much harder than the traditional coloring problem, which is trivially solvable in bipartite graphs. As for the approximation ratio, we make a further step toward finding the precise threshold. We present a polynomial 10/9-approximation algorithm. Our algorithm uses a flow procedure in addition to the maximum independent set procedure used in previous solutions.  相似文献   
14.
15.
The treatment of nanoscopic silica grafted in the blend during the processing of silica‐filled styrene butadiene rubber was performed with silane, introduced at different concentrations, or at a constant concentration with a given length of alkyl chain. From swelling measurements in water and in solvent, the maximum silane content that can be grafted has been calculated as a function of the length of the silane alkyl chains as well as their efficiency to cover the silica surface. The found values are close to the values found in the literature for grafting in solution. Moreover, a direct correspondence between the length of the silane alkyl chains and their concentration has been deduced. © 2005 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 44: 143–152, 2006  相似文献   
16.
The propagation speeds of linear waves in gas–solid suspensions depend strongly on the solids volume fraction and the wave frequency. The latter is due to gas–solid momentum transfer and allows a simple test on filtered gas–solid momentum transfer models. Such models may predict linear wave propagation speeds different from those obtained with the non-filtered model at wave frequencies higher than the filter frequency, but not at wave frequencies lower than the filter frequency.  相似文献   
17.
For about thirty years, time series models with time-dependent coefficients have sometimes been considered as an alternative to models with constant coefficients or non-linear models. Analysis based on models with time-dependent models has long suffered from the absence of an asymptotic theory except in very special cases. The purpose of this paper is to provide such a theory without using a locally stationary spectral representation and time rescaling. We consider autoregressive-moving average (ARMA) models with time-dependent coefficients and a heteroscedastic innovation process. The coefficients and the innovation variance are deterministic functions of time which depend on a finite number of parameters. These parameters are estimated by maximising the Gaussian likelihood function. Deriving conditions for consistency and asymptotic normality and obtaining the asymptotic covariance matrix are done using some assumptions on the functions of time in order to attenuate non-stationarity, mild assumptions for the distribution of the innovations, and also a kind of mixing condition. Theorems from the theory of martingales and mixtingales are used. Some simulation results are given and both theoretical and practical examples are treated. Received 2004; Final version 23 December 2004  相似文献   
18.
Fayolle  Guy 《Queueing Systems》1989,5(1-3):167-183
A simple and quite general approach is proposed to derive criteria for transience and ergodicity of a certain class of irreducibleN-dimensional Markov chains in + N assuming a boundedness condition on the second moment of the jumps. The method consists in constructing convenient smooth supermartingales outside some compact set. The Lyapounov functions introduced belong to the set of quadratic forms in + N and do not always have a definite sign. Existence and construction of these forms is shown to be basically equivalent to finding vectors satisfying a system of linear inequalities.Part I is restricted toN=2, in which case a complete characterization is obtained for the type of random walks analyzed by Malyshev and Mensikov, thus relaxing their condition of boundedness of the jumps. The motivation for this work is partly from a large class of queueing systems that give rise to random walks in + N   相似文献   
19.
Backward proton and pion production is studied in ν and \(\bar v\) charged current interactions in neon. The results are compared with other experiments and theory. The complete backward proton data is compatible with protons produced by reinteractions in the nucleus. However in events with only one proton, muon variables appear correlated to those for the backward proton, as expected by the two-nucleon correlation model.  相似文献   
20.
A complete and consistent set of 95 Benson group additive values (GAV) for the standard enthalpy of formation of hydrocarbons and hydrocarbon radicals at 298 K and 1 bar is derived from an extensive and accurate database of 233 ab initio standard enthalpies of formation, calculated at the CBS-QB3 level of theory. The accuracy of the database was further improved by adding newly determined bond additive corrections (BAC) to the CBS-QB3 enthalpies. The mean absolute deviation (MAD) for a training set of 51 hydrocarbons is better than 2 kJ mol(-1). GAVs for 16 hydrocarbon groups, i.e., C(C(d))(3)(C), C-(C(d))(4), C-(C(t))(C(d))(C)(2), C-(C(t))(C(d))(2)(C), C-(C(t))(C(d))(3), C-(C(t))(2)(C)(2), C-(C(t))(2)(C(d))(C), C-(C(t))(2)(C(d))(2), C-(C(t))(3)(C), C-(C(t))(3)(C(d)), C-(C(t))(4), C-(C(b))(C(d))(C)(H), C-(C(b))(C(t))(H)(2), C-(C(b))(C(t))(C)(H), C-(C(b))(C(t))(C)(2), C(d)-(C(b))(C(t)), for 25 hydrocarbon radical groups, and several ring strain corrections (RSC) are determined for the first time. The new parameters significantly extend the applicability of Benson's group additivity method. The extensive database allowed an evaluation of previously proposed methods to account for non-next-nearest neighbor interactions (NNI). Here, a novel consistent scheme is proposed to account for NNIs in radicals. In addition, hydrogen bond increments (HBI) are determined for the calculation of radical standard enthalpies of formation. In particular for resonance stabilized radicals, the HBI method provides an improvement over Benson's group additivity method.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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