全文获取类型
收费全文 | 719篇 |
免费 | 87篇 |
国内免费 | 41篇 |
专业分类
化学 | 40篇 |
力学 | 23篇 |
综合类 | 30篇 |
数学 | 183篇 |
物理学 | 571篇 |
出版年
2023年 | 4篇 |
2022年 | 17篇 |
2021年 | 15篇 |
2020年 | 12篇 |
2019年 | 11篇 |
2018年 | 19篇 |
2017年 | 32篇 |
2016年 | 17篇 |
2015年 | 15篇 |
2014年 | 52篇 |
2013年 | 88篇 |
2012年 | 27篇 |
2011年 | 34篇 |
2010年 | 30篇 |
2009年 | 30篇 |
2008年 | 46篇 |
2007年 | 48篇 |
2006年 | 35篇 |
2005年 | 31篇 |
2004年 | 43篇 |
2003年 | 44篇 |
2002年 | 35篇 |
2001年 | 28篇 |
2000年 | 26篇 |
1999年 | 25篇 |
1998年 | 21篇 |
1997年 | 14篇 |
1996年 | 12篇 |
1995年 | 11篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
排序方式: 共有847条查询结果,搜索用时 0 毫秒
1.
单个波长到多个波长的变换实验 总被引:3,自引:1,他引:2
报道一种波长变换的新方法.采用此方法不需要任何泵浦光便能够直接将信号光变换成在特定谱宽内的任意多个任意波长的变换光,这对于将来的波分复用光网络提供了较大的方便.此波长变换的原理是利用色散位移光纤的非线性效应产生超连续光谱(SC)信号,由于这种SC信号携带有变换光信号,对这种连续谱进行滤波便能够得到所需要的任意频率的变换信号.此变换方式具有变换频带宽,偏振不敏感的优点。 相似文献
2.
While it is well-known that the RSA public-key cryptosystem can be broken if its modulusN can be factored, it is not known whether there are other ways of breaking RSA. This paper presents a public-key scheme which necessarily requires knowledge of the factorization of its modulus in order to be broken. Rabin introduced the first system whose security is equivalent to the difficulty of factoring the modulus. His scheme is based on squaring (cubing) for encryption and extracting square (cube) roots for decryption. This introduces a 14 (19) ambiguity in the decryption. Various schemes which overcome this problem have been introduced for both the quadratic and cubic case. We generalize the ideas of Williams' cubic system to larger prime exponents. The cases of higher prime order introduce a number of problems not encountered in the quadratic and cubic cases, namely the existence of fundamental units in the underlying cyclotomic field, the evaluation of higher power residue symbols, and the increased difficulty of Euclidean division in the field. 相似文献
3.
4.
5.
Reference-frame-independent quantum key distribution of wavelength division multiplexing with multiple quantum channels 下载免费PDF全文
Zhongqi Sun 《中国物理 B》2021,30(11):110303-110303
Reference-frame-independent quantum key distribution (RFI-QKD) can allow a quantum key distribution system to obtain the ideal key rate and transmission distance without reference system calibration, which has attracted much attention. Here, we propose an RFI-QKD protocol based on wavelength division multiplexing (WDM) considering finite-key analysis and crosstalk. The finite-key bound for RFI-QKD with decoy states is derived under the crosstalk of WDM. The resulting secret key rate of RFI-QKD, which is more rigorous, is obtained. Simulation results reveal that the secret key rate of RFI-QKD based on WDM is affected by the multiplexing channel number, as well as crosstalk between adjacent channels. 相似文献
6.
为了提高PM-CO-OFDM-PON系统中上行数据的传输速率,提出采用偏振复用结构与相干检测技术相结合,通过光载波源方式实现上行链路光网络单元无色化传输的技术方案.利用光学软件VPI和Matlab,搭建了基于偏振复用技术的40Gb/s PM-CO-OFDM-PON系统仿真平台,结果表明:该方案可有效提高PM-CO-OFDM-PON系统中上行数据传输速率,并实现光网络单元无色化;利用相干检测比直接检测可以更高地提高接收端的灵敏度. 相似文献
7.
For a spatial characteristic, there exist commonly fat-tail frequency distributions of fragment-size and -mass of glass, areas enclosed by city roads, and pore size/volume in random packings. In order to give a new analytical approach for the distributions, we consider a simple model which constructs a fractal-like hierarchical network based on random divisions of rectangles. The stochastic process makes a Markov chain and corresponds to directional random walks with splitting into four particles. We derive a combinatorial analytical form and its continuous approximation for the distribution of rectangle areas, and numerically show a good fitting with the actual distribution in the averaging behavior of the divisions. 相似文献
8.
9.
Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs. 相似文献
10.