首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1462篇
  免费   119篇
  国内免费   95篇
化学   50篇
力学   97篇
综合类   19篇
数学   190篇
物理学   169篇
综合类   1151篇
  2024年   5篇
  2023年   22篇
  2022年   48篇
  2021年   39篇
  2020年   31篇
  2019年   40篇
  2018年   31篇
  2017年   33篇
  2016年   58篇
  2015年   65篇
  2014年   113篇
  2013年   87篇
  2012年   109篇
  2011年   105篇
  2010年   57篇
  2009年   87篇
  2008年   73篇
  2007年   95篇
  2006年   70篇
  2005年   76篇
  2004年   64篇
  2003年   58篇
  2002年   56篇
  2001年   30篇
  2000年   36篇
  1999年   21篇
  1998年   20篇
  1997年   19篇
  1996年   19篇
  1995年   17篇
  1994年   18篇
  1993年   16篇
  1992年   11篇
  1991年   8篇
  1990年   7篇
  1989年   11篇
  1988年   4篇
  1987年   6篇
  1986年   2篇
  1985年   3篇
  1982年   1篇
  1979年   2篇
  1975年   1篇
  1957年   1篇
  1955年   1篇
排序方式: 共有1676条查询结果,搜索用时 0 毫秒
1.
校园网终端网络节点自治性的探讨   总被引:1,自引:0,他引:1  
讨论了校园网终端网络节点自治性的建设,给出了开通另一通信出口,电子邮局及实时在线通信等问题的设计与实现的方法,并指出终端网络节点信息化建设的优劣决定校园网的网络性能。  相似文献   
2.
Simply generated families of trees are described by the equation T(z) = ϕ(T(z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a label ∈ { 1,…,n}, no label occurs twice, and whenever we proceed from the root to a leaf, the labels are increasing. This leads to the concept of simple families of increasing trees. Three such families are especially important: recursive trees, heap ordered trees, and binary increasing trees. They belong to the subclass of very simple families of increasing trees, which can be characterized in 3 different ways. This paper contains results about these families as well as about polynomial families (the function ϕ(u) is just a polynomial). The random variable of interest is the level of the node (labelled) j, in random trees of size nj. For very simple families, this is independent of n, and the limiting distribution is Gaussian. For polynomial families, we can prove this as well for j,n → ∞ such that nj is fixed. Additional results are also given. These results follow from the study of certain trivariate generating functions and Hwang's quasi power theorem. They unify and extend earlier results by Devroye, Mahmoud, and others. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007  相似文献   
3.
本文对电荷守恒定律和磁链守恒定律从数学方面作了较深入的论证,并给出了其物理意义。  相似文献   
4.
从分析最简单最优的矩形单元节点编号着手,分析其特点,得出各个节点的相邻单元节点编号总和除以该节点相邻单元数所得的节点商以及相邻单元最小最大节点编号和都为升序排列。总结出一种新型的有限元节点重编号方法,并举例说明该算法能减少有限元的带宽。  相似文献   
5.
本文所介绍的主要方法是综合支路故障诊断法和节点故障诊断法的优点来诊断模拟线性网络的故障,避免了广义逆矩阵带来的计算复杂性和需要找出有多少个故障才能计算的麻烦。利用矩阵的初等变换公式求出诊断支路的导纳矩阵,并与标准电路中的对应的元素相比较,初步找出可能为故障的支路,然后利用矩阵运算特殊性算出元件参考数,以进一步确定真正的故障支路  相似文献   
6.
本文介绍立方体结构并行处理系统的原理及可靠性的计算机仿真并给出结果  相似文献   
7.
8.
As a representative of traditionally fermented Chinese medicine, Massa Medicata Fermentata (MMF) shows the functions of invigorating the spleen and stomach and promoting digestion, which plays an important role in the treatment of gastrointestinal diseases. The fermentation mechanism and the key factors that affect the quality of MMF have not been revealed yet, which has become an urgent issue that limits its clinical application. This article aims to systematically and comprehensively reveal the transformation of physical properties and the dynamic trend of chemical components including substrate components, volatile components, and lactic acid as anaerobic fermentation product during MMF fermentation. Along with obvious hyphae growth observed for MMF, the weight of MMF decreased, and the moisture and temperature increased. Through the quantified 14 components from substrate, ferulic acid increased from 45.53 ± 6.94 to 141.89 ± 78.40 μg/g, while glycosides and phenolic acids declined except caffeic acid. Also, within the 66 volatile components analyzed, alcohols and acids increased, while aldehydes and ketones decreased. Lactic acid was not detected in the fermentation substrate, but an apparent increase in lactic acid content was observed along with the increased fermentation days, resulting in 2.54 ± 0.15 mg/g on day 8. Based on the tested components, the fermentation process of MMF was discriminated into three distinct stages by principal component analysis, and an optimal fermentation time of four days was proposed. The results of this study will be of great significance to clarify the characteristics of fermentation and conduce to improving quality standards of MMF.  相似文献   
9.
We present a Monte Carlo algorithm to find approximate solutions of the traveling salesman problem. The algorithm generates randomly the permutations of the stations of the traveling salesman trip, with probability depending on the length of the corresponding route. Reasoning by analogy with statistical thermodynamics, we use the probability given by the Boltzmann-Gibbs distribution. Surprisingly enough, using this simple algorithm, one can get very close to the optimal solution of the problem or even find the true optimum. We demonstrate this on several examples.We conjecture that the analogy with thermodynamics can offer a new insight into optimization problems and can suggest efficient algorithms for solving them.The author acknowledges stimulating discussions with J. Piút concerning the main ideas of the present paper. The author is also indebted to P. Brunovský, J. erný, M. Hamala, . Peko, . Znám, and R. Zajac for useful comments.  相似文献   
10.
Functional organic molecular materials and conjugated oligomers or polymers now allow the low-cost fabrication of thin films for insertion into new generations of electronic and optoelectronic devices. The performance of these devices relies on the understanding and optimization of several complementary processes. Our goal is to discuss the relationship between the molecular stacking structures and their optoelectronic properties that are of importance in all these areas. The concept of intermolecular interaction should be taken here in the special sense that is inter-dipole coupling. Specifically, we will address the impact of inter-dipole interaction between adjacent molecules in aggregate state on the solid-state emission properties.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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