首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1941篇
  免费   41篇
  国内免费   6篇
化学   1035篇
晶体学   8篇
力学   77篇
数学   332篇
物理学   536篇
  2023年   9篇
  2022年   32篇
  2021年   39篇
  2020年   33篇
  2019年   44篇
  2018年   35篇
  2017年   38篇
  2016年   66篇
  2015年   38篇
  2014年   57篇
  2013年   108篇
  2012年   110篇
  2011年   135篇
  2010年   81篇
  2009年   71篇
  2008年   109篇
  2007年   84篇
  2006年   81篇
  2005年   89篇
  2004年   67篇
  2003年   59篇
  2002年   54篇
  2001年   29篇
  2000年   28篇
  1999年   31篇
  1998年   23篇
  1997年   20篇
  1996年   30篇
  1995年   25篇
  1994年   19篇
  1993年   19篇
  1992年   14篇
  1991年   25篇
  1990年   23篇
  1989年   25篇
  1988年   9篇
  1987年   9篇
  1986年   14篇
  1985年   10篇
  1984年   16篇
  1982年   8篇
  1979年   17篇
  1978年   15篇
  1975年   8篇
  1972年   14篇
  1971年   9篇
  1968年   8篇
  1967年   9篇
  1966年   7篇
  1938年   8篇
排序方式: 共有1988条查询结果,搜索用时 15 毫秒
1.
Multinomial permutations on a circle are considered in the framework of combinatorics. Different cases are presented and shown to agree with previously derived formula for the number of cyclic necklaces. Two applied examples are discussed with a view to illustrate the implications of derived formulas. Copyright © 2006 John Wiley & Sons, Ltd.  相似文献   
2.
Supported by the United States-Israel Binational Science Foundation grant 94-00302  相似文献   
3.
Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s1 and s2 to, respectively, a given vertex t1, and each vertex of a given subset of vertices T2.  相似文献   
4.
5.
A study of body waves in fractured porous media saturated by two fluids is presented. We show the existence of four compressional and one rotational waves. The first and third compressional waves are analogous to the fast and slow compressional waves in Biot's theory. The second compressional wave arises because of fractures, whereas the fourth compressional wave is associated with the pressure difference between the fluid phases in the porous blocks. The effects of fractures on the phase velocity and attenuation coefficient of body waves are numerically investigated for a fractured sandstone saturated by air and water phases. All compressional waves except the first compressional wave are diffusive-type waves, i.e., highly attenuated and do not exist at low frequencies.Now at Izmir Institute of Technology, Faculty of Engineering, Gaziosmanpasa Bulvari, No.16, Cankaya, Izmir, Turkey.  相似文献   
6.
7.
8.
The influence of the number of 3, 3, 3-trifluoropropyl(methyl)siloxane links (/) in the cyclotetrasiloxanes mD4-m, where D represents the dimethylsiloxane link and m=0–4, on the rearrangement of these compounds in acetone solution under the action of sodium siloxanolate has been studied. The rearrangement takes place with the formation of a linear polysiloxane the degradation of which yields, in addition to the initial ring, cyclosiloxanes with a different structure. The rate of rearrangement of mD4-m and of the formation of a linear polysiloxane rises with an increase in m from 0 to 3. The equilibrium concentration of the linear polysiloxane formed from mD4-m is inversely proportional to m. Results have been obtained on the kinetics of the formation of the cyclosiloxanes mDn, where m=0–5, n=0–5, and m+n=3–6, in the rearrangement of the rings D3, 2D2, 3D, and 4. The reactivity of the siloxane links rises in the sequence (CH3)2Si-O-Si(CH3)2 < (CF3CH2CH2)-(CH3) Si-O-Si(CH3)2 <(CF3CH2CH2) (CH3)Si-O-Si(CH3) (CH2CH2CF3) . Because of the negative inductive effect transferred through the siloxane links, the 3, 3, 3-trifluoropropyl groups strongly activate the siloxane ring with respect to nucleophiiic reagents.For part I, see [3].  相似文献   
9.
10.
The perturbed-chain statistical associating fluid theory (PC-SAFT) is studied for a wide range of temperature, T, pressure, p, and (effective) chain length, m, to establish the generic phase diagram of polymers according to this theory. In addition to the expected gas-liquid coexistence, two additional phase separations are found, termed "gas-gas" equilibrium (at very low densities) and "liquid-liquid" equilibrium (at densities where the system is expected to be solid already). These phase separations imply that in one-component polymer systems three critical points occur, as well as equilibria of three fluid phases at triple points. However, Monte Carlo simulations of the corresponding system yield no trace of the gas-gas and liquid-liquid equilibria, and we conclude that the latter are just artefacts of the PC-SAFT approach. Using PC-SAFT to correlate data for polybutadiene melts, we suggest that discrepancies in modelling the polymer density at ambient temperature and high pressure can be related to the presumably artificial liquid-liquid phase separation at lower temperatures. Thus, particular care is needed in engineering applications of the PC-SAFT theory that aims at predicting properties of macromolecular materials.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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