首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1390篇
  免费   20篇
  国内免费   22篇
化学   756篇
晶体学   26篇
力学   26篇
数学   360篇
物理学   264篇
  2024年   7篇
  2023年   10篇
  2022年   21篇
  2021年   25篇
  2020年   33篇
  2019年   29篇
  2018年   11篇
  2017年   18篇
  2016年   38篇
  2015年   37篇
  2014年   32篇
  2013年   75篇
  2012年   85篇
  2011年   70篇
  2010年   51篇
  2009年   47篇
  2008年   75篇
  2007年   82篇
  2006年   90篇
  2005年   83篇
  2004年   71篇
  2003年   53篇
  2002年   66篇
  2001年   12篇
  2000年   27篇
  1999年   19篇
  1998年   22篇
  1997年   16篇
  1996年   19篇
  1995年   12篇
  1994年   23篇
  1993年   20篇
  1992年   19篇
  1991年   12篇
  1990年   14篇
  1989年   12篇
  1988年   4篇
  1987年   5篇
  1986年   8篇
  1985年   6篇
  1984年   4篇
  1983年   7篇
  1982年   7篇
  1981年   5篇
  1980年   9篇
  1978年   9篇
  1977年   5篇
  1976年   4篇
  1975年   6篇
  1973年   7篇
排序方式: 共有1432条查询结果,搜索用时 15 毫秒
991.
Suppose that a hider possesses a continuously divisible resource that he may distribute around a circle. The resources on a random arc in the circle are lost. The hider has a priori information on the length of the arc and he wants to maximize the probability that the retrieved portion exceeds a critical quantity, which is enough to survive on. We show that there exists an optimal resource distribution, which uses a finite number of point caches of equal size, establishing a conjecture of Kikuta and Ruckle. Our result is related to a conjecture of Samuels’ on-tail probabilities.  相似文献   
992.
Given a tournament matrix T, its reversal indexiR (T), is the minimum k such that the reversal of the orientation of k arcs in the directed graph associated with T results in a reducible matrix. We give a formula for iR (T) in terms of the score vector of T which generalizes a simple criterion for a tournament matrix to be irreducible. We show that iR (T)≤[(n?1)/2] for any tournament matrix T of order n, with equality holding if and only if T is regular or almost regular, according as n is odd or even. We construct, for each k between 1 and [(n?1)/2], a tournament matrix of order n whose reversal index is k. Finally, we suggest a few problems.  相似文献   
993.
A computational model for evaluating the performance of nano-material packed-bed filters was developed. The porous effects of the momentum and mass transport within the filter bed were simulated. For the momentum transport, an extended Ergun-type model was employed and the energy loss (pressure drop) along the packed-bed was simulated and compared with measurement. For the mass transport, a bulk adsorption model was developed to study the adsorption process (breakthrough behavior). Various types of porous materials and gas flows were tested in the filter system where the mathematical models used in the porous substrate were implemented and validated by comparing with experimental data and analytical solutions under similar conditions. Good agreements were obtained between experiments and model predictions.  相似文献   
994.
高压LDMOS晶体管准饱和效应分析与建模   总被引:1,自引:0,他引:1  
王磊  杨华岳 《物理学报》2010,59(1):571-578
研究了高压LDMOS(lateral double-diffused MOS)晶体管中一种特殊的电流饱和现象——准饱和效应.借助于TCAD模拟工具,澄清了准饱和效应的物理机理是漂移区载流子的速度饱和.进而从本征漏极电压Vk入手,给出了描述LDMOS管电流饱和特性的数学模型.该模型已经通过了Matlab的编程验证,兼具准确性、计算速度和可扩展性等优点,并可进一步应用于SPICE电路模拟.关键词:LDMOS准饱和效应高压  相似文献   
995.
996.
997.
    
We consider a problem appearing in an Australian Mathematics Challenge in 2003. This article considers whether a spreadsheet might be used to model this problem, thus allowing students to explore its structure within the spreadsheet environment. It then goes on to reflect on some general principles of problem decomposition when the final goal is a successful and lucid spreadsheet implementation.  相似文献   
998.
999.
    
Given a connected, dart‐transitive, cubic graph, constructions of its Hexagonal Capping and its Dart Graph are considered. In each case, the result is a tetravalent graph which inherits symmetry from the original graph and is a covering of the line graph.Similar constructions are then applied to a map (a cellular embedding of a graph in a surface) giving tetravalent coverings of the medial graph. For each construction, conditions on the graph or the map to make the constructed graph dart‐transitive, semisymmetric or ‐transitive are considered.  相似文献   
1000.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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