全文获取类型
收费全文 | 348篇 |
免费 | 9篇 |
国内免费 | 12篇 |
专业分类
化学 | 16篇 |
力学 | 17篇 |
综合类 | 2篇 |
数学 | 247篇 |
物理学 | 87篇 |
出版年
2023年 | 7篇 |
2022年 | 11篇 |
2021年 | 3篇 |
2020年 | 8篇 |
2019年 | 8篇 |
2018年 | 12篇 |
2017年 | 7篇 |
2016年 | 10篇 |
2015年 | 10篇 |
2014年 | 20篇 |
2013年 | 25篇 |
2012年 | 9篇 |
2011年 | 23篇 |
2010年 | 18篇 |
2009年 | 29篇 |
2008年 | 35篇 |
2007年 | 24篇 |
2006年 | 20篇 |
2005年 | 8篇 |
2004年 | 8篇 |
2003年 | 8篇 |
2002年 | 5篇 |
2001年 | 3篇 |
2000年 | 8篇 |
1999年 | 7篇 |
1998年 | 9篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有369条查询结果,搜索用时 15 毫秒
1.
2.
Accurate Calculation of Equilibrium Reduced Density Matrix for the System-Bath Model: a Multilayer Multiconfiguration Time-Dependent Hartree Approach and its Comparison to a Multi-Electronic-State Path Integral Molecular Dynamics Approach? 下载免费PDF全文
An efficient and accurate method for computing the equilibrium reduced density matrix is presented for treating open quantum systems characterized by the system-bath model. The method employs the multilayer multiconfiguration time-dependent Hartree theory for imaginary time propagation and an importance sampling procedure for calculating the quantum mechanical trace. The method is applied to the spin-boson Hamiltonian, which leads to accurate results in agreement with those produced by the multi-electronic-state path integral molecular dynamics method. 相似文献
3.
Gallai’s path decomposition conjecture states that the edges of any connected graph on vertices can be decomposed into at most paths. We confirm that conjecture for all graphs with maximum degree at most five. 相似文献
4.
A path decomposition of a graph is a collection of edge-disjoint paths of that covers the edge set of . Gallai (1968) conjectured that every connected graph on vertices admits a path decomposition of cardinality at most . Gallai’s Conjecture has been verified for many classes of graphs. In particular, Lovász (1968) verified this conjecture for graphs with at most one vertex with even degree, and Pyber (1996) verified it for graphs in which every cycle contains a vertex with odd degree. Recently, Bonamy and Perrett (2016) verified Gallai’s Conjecture for graphs with maximum degree at most 5, and Botler et al. (2017) verified it for graphs with treewidth at most 3. In this paper, we verify Gallai’s Conjecture for triangle-free planar graphs. 相似文献
6.
In this paper, the deformation of the Heisenberg algebra, consistent with both the generalized uncertainty principle and doubly special relativity, has been analyzed. It has been observed that, though this algebra can give rise to fractional derivative terms in the corresponding quantum mechanical Hamiltonian, a formal meaning can be given to them by using the theory of harmonic extensions of function. Depending on this argument, the expression of the propagator of the path integral corresponding to the deformed Heisenberg algebra, has been obtained. In particular, the consistent expression of the one dimensional free particle propagator has been evaluated explicitly. With this propagator in hand, it has been shown that, even in free particle case, normal generalized uncertainty principle and doubly special relativity show very much different result. 相似文献
7.
It is easy to see that in a connected graph any longest paths have a vertex in common. For , Skupień in 1966 obtained a connected graph in which some longest paths have no common vertex, but every longest paths have a common vertex. It is not known whether every longest paths in a connected graph have a common vertex and similarly for 4, 5, and longest path. Fujita et al. in 2015 give an upper bound on distance among longest paths in a connected graph. In this paper we give a similar upper bound on distance between longest paths and also for longest paths, in general. 相似文献
8.
9.
《Stochastic Processes and their Applications》2020,130(12):7547-7574
10.
在非直视无线紫外光通信中,利用大气中的粒子对紫外光进行散射作用来传递信息,非直视紫外光通信在近距离隐蔽通信中有广阔的应用前景。雾霾粒子属于气溶胶范畴,由空气中的灰尘、硫化物、有机碳氢化合物等粒子组成。雾霾粒子的尺度、浓度、形状等因素均会对无线紫外光散射通信的传输特性产生较大的影响。首先,基于蒙特卡罗方法建立了非直视紫外光多次散射模型,将霾粒子的半径和浓度这两个物理量引入该模型中,通过模拟大量光子在雾霾条件下经多次散射到达接收端的概率,进而仿真分析了系统路径损耗与粒子半径和浓度之间的关系。结果表明,(1) 在无线紫外光近距离通信条件下,雾霾浓度越大,路径损耗越小,系统通信性能越好;(2) 通信距离大于500 m时,增加雾霾粒子浓度,系统路径损耗总体先减小再增大;(3) 在粒子浓度一定情况下,增大粒子半径,路径损耗先减小后增大,且随着通信距离的增大,路径损耗极小值的位置不断向粒子半径小的一侧移动。其次,在模型中引入粒子尺度谱分布的概念,对粒子尺度谱分布进行分割,分别求出不同粒径及其所对应浓度。假定粒子尺度谱分布中不同粒径的粒子依次对光子产生散射作用,对相应光子到达接收端的概率求和,得到光子到达接收端的总概率,进而求得多种粒径的粒子共同存在情况下系统的路径损耗,使仿真模型更加逼近实际大气信道中多种半径雾霾粒子共同存在的事实。最后,搭建实验平台,分别在良好、严重雾霾、极严重雾霾三种不同天气条件下,实验测量了系统路径损耗和通信距离、收发仰角之间的关系,并与考虑粒子尺度谱分布模型中计算得到的路径损耗进行对比,实验数据与仿真结果趋势一致,雾霾天气下的通信质量优于良好天气,收发仰角越大对应的路径损耗也越大。 相似文献