首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   650篇
  免费   47篇
  国内免费   59篇
化学   27篇
晶体学   3篇
力学   62篇
综合类   22篇
数学   538篇
物理学   104篇
  2024年   1篇
  2023年   11篇
  2022年   15篇
  2021年   14篇
  2020年   16篇
  2019年   27篇
  2018年   23篇
  2017年   21篇
  2016年   17篇
  2015年   21篇
  2014年   31篇
  2013年   78篇
  2012年   22篇
  2011年   30篇
  2010年   29篇
  2009年   45篇
  2008年   65篇
  2007年   42篇
  2006年   53篇
  2005年   26篇
  2004年   13篇
  2003年   26篇
  2002年   27篇
  2001年   18篇
  2000年   12篇
  1999年   13篇
  1998年   11篇
  1997年   7篇
  1996年   8篇
  1995年   9篇
  1994年   6篇
  1992年   3篇
  1991年   4篇
  1989年   5篇
  1986年   1篇
  1982年   1篇
  1981年   1篇
  1980年   1篇
  1979年   1篇
  1978年   1篇
  1959年   1篇
排序方式: 共有756条查询结果,搜索用时 62 毫秒
1.
激光除冰研究   总被引:7,自引:0,他引:7  
刘磊  朱晓 《光散射学报》2006,18(4):379-385
架空输送电线路因覆冰而导致的事故危害性很大,本文总结了目前国内外输电线路导线覆冰的现状。统计国内外探索出来的各种预防,融化,除冰等很多解决方案。通过研究和探讨,分析导线覆冰的传热和能量,运用了多种激光器进行激光熔(除)冰实验,比较研究二氧化碳激光器的除冰情况。以及提出激光熔冰的方法、研究方向和前景。  相似文献   
2.
A new family of proximity graphs: Class cover catch digraphs   总被引:1,自引:0,他引:1  
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given.  相似文献   
3.
A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.  相似文献   
4.
The unsteady boundary layer over a semi-infinite flat plate was investigated in this paper. The flow involves the unsteady flow over a flat plate with leading edge accretion or ablation. The momentum boundary layer was further analyzed and it was shown that the leading edge ablation had a similar effect to the wall mass injection or upstream wall movement making the fluid blown away from the wall. The thermal boundary layer of the same flow was also studied. Results show that the leading edge accretion or ablation can greatly change the fluid motion and the heat transfer characteristics.  相似文献   
5.
All the connected components of the moduli space of flat connections on SU (2) and SO (3) (trivial and non-trivial) bundles over closed oriented surfaces are determined. The symplectic structure and volumes of the non-maximal strata of the moduli space are also determined.  相似文献   
6.
Abstract We present an alternate definition of the mod Z component of the Atiyah-Patodi-Singer η invariant associated to (not necessary unitary) flat vector bundles, which identifies explicitly its real and imaginary parts. This is done by combining a deformation of flat connections introduced in a previous paper with the analytic continuation procedure appearing in the original article of Atiyah, Patodi and Singer. * Project supported by the Cheung-Kong Scholarship of the Ministry of Education of China and the 973 Project of the Ministry of Science and Technology of China. (Dedicated to the memory of Shiing-Shen Chern)  相似文献   
7.
We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.  相似文献   
8.
On the basis of the hydrodynamic equations for nonlinear elastic-gravity waves beneath a solid ice cover and their Hamiltonian representation, a three-wave kinetic equation for the time evolution of the wave spectrum is formulated. The properties of the kernel of the kinetic integral describing the nonlinear interactions between wave triplets are investigated. An algorithm for numerically calculating the kinetic integral is developed. The rate of nonlinear energy transfer over the wave spectrum is estimated quantitatively and its most important characteristics are found.  相似文献   
9.
We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process in group technology. Three types of economic decisions are considered: subcontracting, machine duplication and intercell moves. The problem is formulated as a minimum weighted node covering problem in a hypergraph, and we show that it can be solved in polynomial time by finding a maximum weighted stable set in a bipartite graph. We extend this result to cellular manufacturing systems in which the sequence of operations of each part is known in advance.  相似文献   
10.
The generalized Mycielskians (also known as cones over graphs) are the natural generalization of the Mycielski graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer m?0, one can transform G into a new graph μm(G), the generalized Mycielskian of G. This paper investigates circular clique number, total domination number, open packing number, fractional open packing number, vertex cover number, determinant, spectrum, and biclique partition number of μm(G).  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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