首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   8135篇
  免费   209篇
  国内免费   42篇
化学   5146篇
晶体学   84篇
力学   273篇
数学   903篇
物理学   1980篇
  2022年   57篇
  2021年   62篇
  2020年   81篇
  2019年   75篇
  2018年   77篇
  2017年   62篇
  2016年   150篇
  2015年   158篇
  2014年   138篇
  2013年   397篇
  2012年   409篇
  2011年   433篇
  2010年   272篇
  2009年   229篇
  2008年   376篇
  2007年   396篇
  2006年   416篇
  2005年   420篇
  2004年   325篇
  2003年   294篇
  2002年   304篇
  2001年   150篇
  2000年   146篇
  1999年   104篇
  1998年   99篇
  1997年   140篇
  1996年   157篇
  1995年   112篇
  1994年   129篇
  1993年   151篇
  1992年   129篇
  1991年   76篇
  1990年   73篇
  1989年   108篇
  1988年   90篇
  1987年   83篇
  1986年   85篇
  1985年   105篇
  1984年   112篇
  1983年   88篇
  1982年   87篇
  1981年   89篇
  1980年   75篇
  1979年   79篇
  1978年   71篇
  1977年   73篇
  1976年   60篇
  1975年   79篇
  1974年   72篇
  1973年   64篇
排序方式: 共有8386条查询结果,搜索用时 15 毫秒
11.
Polymer films with a dispersed liquid crystal were prepared by photopolymerization of (meth)acrylic monomers. The electrooptical properties of these films were studied. The influence exerted by the composition of the monomer mixture, cross-linking agents, and chain-transfer agent on the liquid crystal drop size and on the transmission of the polymer-liquid crystal films was examined.  相似文献   
12.
 The paper establishes lower bounds on the provability of 𝒟=NP and the MRDP theorem in weak fragments of arithmetic. The theory I 5 E 1 is shown to be unable to prove 𝒟=NP. This non-provability result is used to show that I 5 E 1 cannot prove the MRDP theorem. On the other hand it is shown that I 1 E 1 proves 𝒟 contains all predicates of the form (∀i≤|b|)P(i,x)^Q(i,x) where ^ is =, <, or ≤, and I 0 E 1 proves 𝒟 contains all predicates of the form (∀ib)P(i,x)=Q(i,x). Here P and Q are polynomials. A conjecture is made that 𝒟 contains NLOGTIME. However, it is shown that this conjecture would not be sufficient to imply 𝒟=N P. Weak reductions to equality are then considered as a way of showing 𝒟=NP. It is shown that the bit-wise less than predicate, ≤2, and equality are both co-NLOGTIME complete under FDLOGTIME reductions. This is used to show that if the FDLOGTIME functions are definable in 𝒟 then 𝒟=N P. Received: 13 July 2001 / Revised version: 9 April 2002 / Published online: 19 December 2002 Key words or phrases: Bounded Arithmetic – Bounded Diophantine Complexity  相似文献   
13.
14.
We have used Affymetrix gene chips to measure the expression of 10 CESA and 29 CSL genes of Arabidopsis in different developmental stages or organs. These measurements reveal that many of the genes exhibit different levels of expression in the various organs. While several CESA genes are highly expressed in all the tissues examined, very few CSL genes approach such high levels of expression. This suggests that the CSL genes either encode enzymes for the synthesis of minor components of cell walls or are expressed only in specific cell types. The expression data also highlights the potential importance of the CESA genes for primary and secondary cell wall formation during different developmental stages and in the different organs examined.  相似文献   
15.
Large melting point depressions for organic nanocrystals, in comparison with those of the bulk, were observed in an associative polymer: telechelic, pyrene‐labeled poly(dimethylsiloxane) (Py‐PDMS‐Py). Nanocrystals formed within nanoaggregates of pyrenyl units that were immiscible in poly(dimethylsiloxane). For 5 and 7 kg/mol Py‐PDMS‐Py, physical gels resulted, with melting points exceeding 40 °C and with small‐angle X‐ray scattering peaks indicating that the crystals were nanoconfined, were 2–3 nm long, and contained roughly 18–30 pyrenyl dye end units. In contrast, 30 kg/mol Py‐PDMS‐PY was not a gel and exhibited no scattering peak at room temperature; however, after 12 h of annealing at ?5 °C, multiple melting peaks were present at 5–30 °C. © 2004 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 42: 3470–3475, 2004  相似文献   
16.
There is growing evidence that temporal lobe seizures are preceded by a preictal transition, characterized by a gradual dynamical change from asymptomatic interictal state to seizure. We herein report the first prospective analysis of the online automated algorithm for detecting the preictal transition in ongoing EEG signals. Such, the algorithm constitutes a seizure warning system. The algorithm estimates STLmax, a measure of the order or disorder of the signal, of EEG signals recorded from individual electrode sites. The optimization techniques were employed to select critical brain electrode sites that exhibit the preictal transition for the warning of epileptic seizures. Specifically, a quadratically constrained quadratic 0-1 programming problem is formulated to identify critical electrode sites. The automated seizure warning algorithm was tested in continuous, long-term EEG recordings obtained from 5 patients with temporal lobe epilepsy. For individual patient, we use the first half of seizures to train the parameter settings, which is evaluated by ROC (Receiver Operating Characteristic) curve analysis. With the best parameter setting, the algorithm applied to all cases predicted an average of 91.7% of seizures with an average false prediction rate of 0.196 per hour. These results indicate that it may be possible to develop automated seizure warning devices for diagnostic and therapeutic purposes.Mathematics Subject Classification (1991):20E28, 20G40, 20C20  相似文献   
17.
18.
19.
In this paper we describe a method for separating a combination of a chaotic time series and a discrete-valued signal. The method uses a feedback technique stabilised using knowledge of the chaotic system and the discrete nature of the signal. It is not based on a linearization of the dynamics, and therefore, unlike previously proposed separation methods, does not require that the signal be small. Nor does it make any assumptions about the relative timescales of the signal and the chaotic time series.  相似文献   
20.
The gedanken experiment of the clock paradox is solved exactly using the general relativistic equations for a static homogeneous gravitational field. We demonstrate that the general and special relativistic clock paradox solutions are identical and in particular that they are identical for finite acceleration. Practical expressions are obtained for proper time and coordinate time by using the destination distance as the key observable parameter. This solution provides a formal demonstration of the identity between the special and general relativistic clock paradox with finite acceleration and where proper time is assumed to be the same in both formalisms. By solving the equations of motion for a freely falling clock in a static homogeneous field elapsed times are calculated for realistic journeys to the stars. 1 Both authors contributed equally to this paper.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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