首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   6870篇
  免费   160篇
  国内免费   53篇
化学   4230篇
晶体学   45篇
力学   118篇
数学   856篇
物理学   1834篇
  2022年   35篇
  2021年   49篇
  2020年   59篇
  2019年   63篇
  2018年   51篇
  2017年   59篇
  2016年   127篇
  2015年   102篇
  2014年   118篇
  2013年   302篇
  2012年   364篇
  2011年   402篇
  2010年   217篇
  2009年   197篇
  2008年   364篇
  2007年   385篇
  2006年   366篇
  2005年   400篇
  2004年   327篇
  2003年   288篇
  2002年   265篇
  2001年   158篇
  2000年   150篇
  1999年   82篇
  1998年   74篇
  1997年   61篇
  1996年   122篇
  1995年   88篇
  1994年   108篇
  1993年   123篇
  1992年   110篇
  1991年   63篇
  1990年   64篇
  1989年   92篇
  1988年   61篇
  1987年   55篇
  1986年   66篇
  1985年   85篇
  1984年   66篇
  1983年   44篇
  1982年   65篇
  1981年   63篇
  1980年   62篇
  1979年   56篇
  1978年   57篇
  1977年   70篇
  1976年   47篇
  1975年   43篇
  1974年   50篇
  1973年   54篇
排序方式: 共有7083条查询结果,搜索用时 31 毫秒
1.
A combined experimental and computational approach was used to distinguish between different polymorphs of the pharmaceutical drug aspirin. This method involves the use of ab initio random structure searching (AIRSS), a density functional theory (DFT)-based crystal structure prediction method for the high-accuracy prediction of polymorphic structures, with DFT calculations of nuclear magnetic resonance (NMR) parameters and solid-state NMR experiments at natural abundance. AIRSS was used to predict the crystal structures of form-I and form-II of aspirin. The root-mean-square deviation between experimental and calculated 1H chemical shifts was used to identify form-I as the polymorph present in the experimental sample, the selection being successful despite the large similarities between the molecular environments in the crystals of the two polymorphs.  相似文献   
2.
Krabbe disease is a devastating neurodegenerative disorder characterized by rapid demyelination of nerve fibers. This disease is caused by defects in the lysosomal enzyme β-galactocerebrosidase (GALC), which hydrolyzes the terminal galactose from glycosphingolipids. These lipids are essential components of eukaryotic cell membranes: substrates of GALC include galactocerebroside, the primary lipid component of myelin, and psychosine, a cytotoxic metabolite. Mutations of GALC that cause misfolding of the protein may be responsive to pharmacological chaperone therapy (PCT), whereby small molecules are used to stabilize these mutant proteins, thus correcting trafficking defects and increasing residual catabolic activity in cells. Here we describe a new approach for the synthesis of galacto-configured azasugars and the characterization of their interaction with GALC using biophysical, biochemical and crystallographic methods. We identify that the global stabilization of GALC conferred by azasugar derivatives, measured by fluorescence-based thermal shift assays, is directly related to their binding affinity, measured by enzyme inhibition. X-ray crystal structures of these molecules bound in the GALC active site reveal which residues participate in stabilizing interactions, show how potency is achieved and illustrate the penalties of aza/iminosugar ring distortion. The structure–activity relationships described here identify the key physical properties required of pharmacological chaperones for Krabbe disease and highlight the potential of azasugars as stabilizing agents for future enzyme replacement therapies. This work lays the foundation for new drug-based treatments of Krabbe disease.  相似文献   
3.
4.
5.
6.
What strategy should a football (soccer, in American parlance) club adopt when deciding whether to sack its manager? This paper introduces a simple model assuming that a club's objective is to maximize the number of league points that it scores per season. The club's strategy consists of three choices: the length of the honeymoon period during which it will not consider sacking a new manager, the level of the performance trapdoor below which the manager get the sack, and the weight that it will give to more recent games compared to earlier ones. Some data from the last six seasons of the English Premiership are used to calibrate the model. At this early stage of the research, the best strategy appears to have only a short honeymoon period of eight games (much less than the actual shortest period of 12 games), to set the trapdoor at 0.74 points per game, and to put 47% of the weight on the last five games. A club adopting this strategy would obtain on average 56.8 points per season, compared to a Premiership average of 51.8 points.  相似文献   
7.
8.
 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  相似文献   
9.
We consider a zero-sum stochastic game with side constraints for both players with a special structure. There are two independent controlled Markov chains, one for each player. The transition probabilities of the chain associated with a player as well as the related side constraints depend only on the actions of the corresponding player; the side constraints also depend on the player’s controlled chain. The global cost that player 1 wishes to minimize and that player 2 wishes to maximize, depend however on the actions and Markov chains of both players. We obtain a linear programming formulations that allows to compute the value and saddle point policies for this problem. We illustrate the theoretical results through a zero-sum stochastic game in wireless networks in which each player has power constraints  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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