首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   381篇
  免费   41篇
  国内免费   15篇
化学   30篇
力学   21篇
综合类   5篇
数学   328篇
物理学   53篇
  2023年   1篇
  2022年   7篇
  2021年   7篇
  2020年   7篇
  2019年   6篇
  2018年   11篇
  2017年   10篇
  2016年   12篇
  2015年   3篇
  2014年   24篇
  2013年   50篇
  2012年   14篇
  2011年   12篇
  2010年   17篇
  2009年   14篇
  2008年   13篇
  2007年   22篇
  2006年   21篇
  2005年   13篇
  2004年   16篇
  2003年   12篇
  2002年   18篇
  2001年   15篇
  2000年   20篇
  1999年   14篇
  1998年   17篇
  1997年   13篇
  1996年   11篇
  1995年   6篇
  1994年   3篇
  1993年   1篇
  1992年   1篇
  1991年   3篇
  1990年   2篇
  1989年   4篇
  1988年   3篇
  1987年   3篇
  1985年   4篇
  1984年   1篇
  1983年   1篇
  1982年   1篇
  1981年   1篇
  1979年   1篇
  1978年   1篇
  1976年   1篇
排序方式: 共有437条查询结果,搜索用时 281 毫秒
11.
张立彬  张功  李广平 《大学物理》2011,30(12):48-53,64
深入探讨了哈佛大学提升物理课程教学质量的举措,诸如卓越的教学方法、全面的教师培养、科学的教学指导、高效的教学评价等.哈佛大学的这些全面、细致、具体、实用的举措对我国大学物理教学质量的提升具有一定的借鉴意义.  相似文献   
12.
This article reviews static and dynamic models of information aggregation in the literature. It highlights the key assumptions these models make, the results they obtain and the issues that still need to be explored to further our understanding of information aggregation in financial markets.  相似文献   
13.
Cheng and Tang [Biometrika, 88 (2001), pp. 1169–1174] derived an upper bound on the maximum number of columns that can be accommodated in a two‐symbol supersaturated design (SSD) for a given number of rows () and a maximum in absolute value correlation between any two columns (). In particular, they proved that for (mod ) and . However, the only known SSD satisfying this upper bound is when . By utilizing a computer search, we prove that for , and . These results are obtained by proving the nonexistence of certain resolvable incomplete blocks designs. The combinatorial properties of the RIBDs are used to reduce the search space. Our results improve the lower bound for SSDs with rows and columns, for , and . Finally, we show that a skew‐type Hadamard matrix of order can be used to construct an SSD with rows and columns that proves . Hence, we establish for and for all (mod ) such that . Our result also implies that when is a prime power and (mod ). We conjecture that for all and (mod ), where is the maximum number of equiangular lines in with pairwise angle .  相似文献   
14.
Necessary conditions for the existence of a super‐simple, decomposable, near‐resolvable ‐balanced incomplete block design (BIBD) whose 2‐component subdesigns are both near‐resolvable ‐BIBDs are (mod ) and . In this paper, we show that these necessary conditions are sufficient. Using these designs, we also establish that the necessary conditions for the existence of a super‐simple near‐resolvable ‐RBIBD, namely (mod ) and , are sufficient. A few new pairwise balanced designs are also given.  相似文献   
15.
In this article we show that the order of the point value, in the sense of Łojasiewicz, of a tempered distribution and the order of summability of the pointwise Fourier inversion formula are closely related. Assuming that the order of the point values and certain order of growth at infinity are given for a tempered distribution, we estimate the order of summability of the Fourier inversion formula. For Fourier series, and in other cases, it is shown that if the distribution has a distributional point value of order k, then its Fourier series is e.v. Cesàro summable to the distributional point value of order k+1. Conversely, we also show that if the pointwise Fourier inversion formula is e.v. Cesàro summable of order k, then the distribution is the (k+1)-th derivative of a locally integrable function, and the distribution has a distributional point value of order k+2. We also establish connections between orders of summability and local behavior for other Fourier inversion problems.  相似文献   
16.
Kreher and Rees 3 proved that if h is the size of a hole in an incomplete balanced design of order υ and index λ having minimum block size , then, They showed that when t = 2 or 3, this bound is sharp infinitely often in that for each ht and each kt + 1, (t,h,k) ≠(3,3,4), there exists an ItBD meeting the bound. In this article, we show that this bound is sharp infinitely often for every t, viz., for each t ≥ 4 there exists a constant Ct > 0 such that whenever (h ? t)(k ? t ? 1) ≥ Ct there exists an ItBD meeting the bound for some λ = λ(t,h,k). We then describe an algorithm by which it appears that one can obtain a reasonable upper bound on Ct for any given value of t. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 256–281, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10014  相似文献   
17.
We report here an efficient implementation of the finite difference Poisson-Boltzmann solvent model based on the Modified Incomplete Cholsky Conjugate Gradient algorithm, which gives rather impressive performance for both static and dynamic systems. This is achieved by implementing the algorithm with Eisenstat's two optimizations, utilizing the electrostatic update in simulations, and applying prudent approximations, including: relaxing the convergence criterion, not updating Poisson-Boltzmann-related forces every step, and using electrostatic focusing. It is also possible to markedly accelerate the supporting routines that are used to set up the calculations and to obtain energies and forces. The resulting finite difference Poisson-Boltzmann method delivers efficiency comparable to the distance-dependent dielectric model for a system tested, HIV Protease, making it a strong candidate for solution-phase molecular dynamics simulations. Further, the finite difference method includes all intrasolute electrostatic interactions, whereas the distance dependent dielectric calculations use a 15-A cutoff. The speed of our numerical finite difference method is comparable to that of the pair-wise Generalized Born approximation to the Poisson-Boltzmann method.  相似文献   
18.
效益滞后是经理人员工作的基本性质,文章以信息经济学为理论基础,并采用信息论的方法对经理人员工作效益滞后性的内在原因和机制进行了深入的探讨,然后用控制论的方法对决策滞后系统建模,并作进一步分析。  相似文献   
19.
A directed balanced incomplete block design (or D B(k,;v)) (X,) is called self-converse if there is an isomorphic mapping f from (X,) to (X,–1), where –1={B –1:B} and B –1=(x k ,x k –1,,x 2,x 1) for B=(x 1,x 2,,x k –1,x k ). In this paper, we give the existence spectrum for self-converse D B(4,1;v). AMS Classification:05BResearch supported in part by NSFC Grant 10071002 and SRFDP under No. 20010004001  相似文献   
20.
Die vorliegende Arbeit beschāftigt sich mit der Answertung von Autoradiogrammen inhomogen markierter mikroskopischer Strukturen am Densitron. Dazu fertigten wir von herkömmlichen Stripping-Filmen (z. B. ORW O K 106) Mikro-Stufengraukeile an und bestimmten die Schwärzung Sijeder Stufe photometrisch. Graukeile geeigneten Schwärzungsumfangs dienten dann zur Einstellung der Farbtrigger des Densitrons, so daß sich die bei dieser Einstellung gemessenen Farbflächen Fi des jeweiligen Objektes bestimmten Schwärzungswerten zuordnen ließen.

Als Modellobjekte verwendelen wir erstens Autoradiogramme von 3H-Thymidin-markierten Tumorzellen. Vergleichsmessungen an unterschiedlich lange exponierten, sonst aber identischen Präparaten ergaben eine gute Reproduzierbarkeit der Meßergebnisse. Als zweites Testobjekt dienlen Autoradiogramme einer nur schwach markierten Struktur im Gehirn von Fröschen. Die an diesem Grenzfall erhaltenen Ergebnisse werden mit Meßwerten verglichen, die vom gleichen Objekt mittels Scanning-Photometrie an einem. Mikroskop-Photometer SMP 01 (OPTON, Oberkoches, BRD) gewonnen wurden.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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