首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   777篇
  免费   67篇
  国内免费   47篇
化学   25篇
力学   14篇
综合类   17篇
数学   750篇
物理学   85篇
  2023年   11篇
  2022年   16篇
  2021年   7篇
  2020年   30篇
  2019年   20篇
  2018年   19篇
  2017年   32篇
  2016年   27篇
  2015年   14篇
  2014年   19篇
  2013年   58篇
  2012年   24篇
  2011年   37篇
  2010年   41篇
  2009年   57篇
  2008年   40篇
  2007年   56篇
  2006年   67篇
  2005年   33篇
  2004年   34篇
  2003年   30篇
  2002年   33篇
  2001年   22篇
  2000年   23篇
  1999年   24篇
  1998年   18篇
  1997年   16篇
  1996年   15篇
  1995年   13篇
  1994年   5篇
  1993年   5篇
  1992年   5篇
  1991年   6篇
  1990年   4篇
  1989年   4篇
  1988年   6篇
  1987年   2篇
  1986年   2篇
  1985年   3篇
  1984年   2篇
  1982年   1篇
  1981年   2篇
  1979年   2篇
  1978年   1篇
  1977年   1篇
  1976年   2篇
  1973年   2篇
排序方式: 共有891条查询结果,搜索用时 31 毫秒
1.
离轴非球面作为非球面的一部分,是空间光学系统、天文学和高精度测量系统不可或缺的光学器件。针对空间光学对离轴非球面光学元件制造技术的重大需求,开展了离轴非球面反射镜的精密铣磨加工技术研究。分析了五轴联动范成法铣磨离轴非球面的原理,将离轴非球面所在的同轴母镜离散为一系列不同半径的球面环带,将工件坐标系建立在待加工离轴非球面的同轴母镜中心位置,使用杯形砂轮依次范成离轴镜所在的同轴母镜上的环带,由众多的球面环带拼接出离轴非球面。对Φ100mm直径离轴抛物镜进行工艺试验,环带宽度7.28mm,一次加工面形精度PV达到7μm,RMS达0.622μm,加工用时7min。研究表明该方法具有可行性,为离轴非球面快速铣磨提供了有效的解决方案。  相似文献   
2.
In this research paper, we propose a two-hop integrated radio frequency–visible light communication (RF–VLC) system which may provide a better option to transceive between the hospitals and some laboratory to transfer patient’s information. In the proposed system model, the data (such as patient’s lab test reports) is transmitted towards the amplify and forward (AF) relay mounted on the top of the hospital building via the RF channel. Further, the AF relay amplifies and converts the received information into corresponding optical signal using light emitting diodes (LED) and supporting circuitry. This optical signal is then forwarded towards the destination device (equipped with VLC transceiver), via the VLC channel. To analyse the performance of the system, we first derive the closed form analytical expressions for the cumulative distribution function (CDF) of the end-to-end (e2e) signal to noise ratio (SNR) of the system by using the moment generating function (MGF) of the SNR of the individual RF and VLC channels. Further, we use these statistical expressions to obtain the outage probability, average bit error rate (BER) and the average capacity of the system. Moreover, the asymptotic performance of the proposed system is also analysed to study the system’s behaviour at high SNR regimes. Finally, we studied the impact of the variations in channel parameters on the proposed system model performance through numerically simulated plots.  相似文献   
3.
4.
5.
《Discrete Mathematics》2020,343(10):112015
A long standing open problem in extremal graph theory is to describe all graphs that maximize the number of induced copies of a path on four vertices. The character of the problem changes in the setting of oriented graphs, and becomes more tractable. Here we resolve this problem in the setting of oriented graphs without transitive triangles.  相似文献   
6.
7.
A graph is 1-planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges induce a complete subgraph, then the graph is locally maximal 1-planar. For a 3-connected locally maximal 1-planar graph G, we show the existence of a spanning 3-connected planar subgraph and prove that G is Hamiltonian if G has at most three 3-vertex-cuts, and that G is traceable if G has at most four 3-vertex-cuts. Moreover, infinitely many nontraceable 5-connected 1-planar graphs are presented.  相似文献   
8.
9.
Using an operator ordering method for some commutative superposition operators, we introduce two new multi-variable special polynomials and their generating functions, and present some new operator identities and integral formulas involving the two special polynomials. Instead of calculating complicated partial differential, we use the special polynomials and their generating functions to concisely address the normalization, photocount distributions and Wigner distributions of several quantum states that can be realized physically, the results of which provide real convenience for further investigating the properties and applications of these states.  相似文献   
10.
Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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