全文获取类型
收费全文 | 5878篇 |
免费 | 370篇 |
国内免费 | 150篇 |
专业分类
化学 | 3369篇 |
晶体学 | 58篇 |
力学 | 202篇 |
综合类 | 7篇 |
数学 | 923篇 |
物理学 | 951篇 |
无线电 | 888篇 |
出版年
2024年 | 13篇 |
2023年 | 101篇 |
2022年 | 121篇 |
2021年 | 177篇 |
2020年 | 200篇 |
2019年 | 194篇 |
2018年 | 194篇 |
2017年 | 128篇 |
2016年 | 244篇 |
2015年 | 197篇 |
2014年 | 257篇 |
2013年 | 436篇 |
2012年 | 365篇 |
2011年 | 414篇 |
2010年 | 273篇 |
2009年 | 257篇 |
2008年 | 356篇 |
2007年 | 319篇 |
2006年 | 295篇 |
2005年 | 266篇 |
2004年 | 214篇 |
2003年 | 197篇 |
2002年 | 177篇 |
2001年 | 124篇 |
2000年 | 72篇 |
1999年 | 75篇 |
1998年 | 68篇 |
1997年 | 59篇 |
1996年 | 43篇 |
1995年 | 49篇 |
1994年 | 43篇 |
1993年 | 36篇 |
1992年 | 27篇 |
1991年 | 27篇 |
1990年 | 26篇 |
1989年 | 20篇 |
1988年 | 18篇 |
1987年 | 18篇 |
1986年 | 23篇 |
1985年 | 30篇 |
1984年 | 27篇 |
1983年 | 29篇 |
1982年 | 25篇 |
1981年 | 25篇 |
1980年 | 20篇 |
1979年 | 13篇 |
1978年 | 13篇 |
1977年 | 12篇 |
1975年 | 7篇 |
1973年 | 7篇 |
排序方式: 共有6398条查询结果,搜索用时 15 毫秒
21.
Sunanda Banerjee Rohini M Godbole Sreerup Raychaudhuri Ben Allanach Sunanda Banerjee Satyaki Bhattacharyya Debajyoti Choudhury Siba Prasad Das Anindya Datta Rohini M Godbole Monoranjan Guchait Sabine Kraml Gobinda Majumdar David Miller Margarete Mühlleitner Nobuchika Okada Maxim Perelstein Santosh K Rai Sreerup Raychaudhuri Saurabh D Rindani DP Roy K Sridhar Rishikesh Vaidya D Zeppenfeld 《Pramana》2006,67(4):617-637
This is summary of the activities of the working group on collider physics in the IXth Workshop on High Energy Physics Phenomenology
(WHEPP-9) held at the Institute of Physics, Bhubaneswar, India in January 2006. Some of the work subsequently done on these
problems by the subgroups formed during the workshop is included in this report. 相似文献
22.
A review of the optimal stopping problem with more than a single decision maker (DM) is presented in this paper. We classify
the existing literature according to the arrival of the offers, the utility of the DMs, the length of the sequence of offers,
the nature of the game and the number of offers to be selected. We enumerate various definitions for this problem and describe
some dynamic approaches.
Fouad Ben Abdelaziz is on leave from the Institut Superieur de Gestion, University of Tunis, Tunisia e-mail: foued.benabdelaz@isg.run.tn. 相似文献
23.
Intelligent methods for automatic protection and restoration are critical in optical transport mesh networks. This paper discusses the problem of quality-of-service (QoS)-based protection in terms of the protection-switching time and availability for end-to-end lightpaths in a WDM mesh network. We analyze the backup lightpath-sharing problem in such networks and study the correlation of the working lightpaths and the impact of the correlation on the sharing of the backup lightpaths. We present a multi-protocol-label-switching (MPLS) control-based fully distributed algorithm to solve the protection problem. The proposed algorithm includes intelligent and automatic procedures to set up, take down, activate, restore, and manage backup lightpaths. It greatly reduces the required resources for protection by allowing the sharing of network resources by multiple backup lightpaths. At the same time, it guarantees, if possible, to satisfy the availability requirement even with resource sharing by taking the correlation of working lightpaths into consideration. A simple analysis of the proposed algorithm in terms of computation time and message complexity indicates that the implementation of the algorithm is practical. The illustrative studies that compare the performance of 1:1, unlimited sharing, and QoS-based backup sharing algorithms indicate that QoS-based sharing achieves comparable performance as unlimited sharing, which is much better than the 1:1 backup scheme in terms of connection blocking probability, average number of connections in the network for a given offered load, and network resource utilization. 相似文献
24.
Lawrence B.L. Cha M. Kang J.U. Toruellas W. Stegeman G. Baker G. Meth J. Etemad S. 《Electronics letters》1994,30(5):447-448
Z-scan measurements at 1600 nm on single-crystal PTS (p-toluene sulfonate) with single, 65 ps pulses gave a complex nonlinear refractive index coefficient of n2=2.2(±0.3)×10-12 cm2/W at 1 GW/cm2 and α2<0.5 cm/GW. This is the first highly nonlinear, organic material to satisfy the conditions imposed by the figures of merit 相似文献
25.
26.
Ben Craps Matthias R. Gaberdiel Jeffrey A. Harvey 《Communications in Mathematical Physics》2003,234(2):229-251
We study D-branes in the bosonic closed string theory whose automorphism group is the Bimonster group (the wreath product
of the Monster simple group with ℤ2). We give a complete classification of D-branes preserving the chiral subalgebra of Monster invariants and show that they
transform in a representation of the Bimonster. Our results apply more generally to self-dual conformal field theories which
admit the action of a compact Lie group on both the left- and right-moving sectors.
Received: 20 February 2002 / Accepted: 17 August 2002 Published online: 19 December 2002
Communicated by R.H. Dijkgraaf 相似文献
27.
We prove some basic properties of Donaldson’s flow of surfaces in a hyperkähler 4-manifold. When the initial submanifold is symplectic with respect to one Kähler form and Lagrangian with respect to another, we show that certain kinds of singularities cannot form, and we prove a convergence result under a condition related to one considered by M.-T. Wang for the mean curvature flow. 相似文献
28.
29.
We continue the investigation of locally testable codes, i.e., error‐correcting codes for which membership of a given word in the code can be tested probabilistically by examining it in very few locations. We give two general results on local testability: First, motivated by the recently proposed notion of robust probabilistically checkable proofs, we introduce the notion of robust local testability of codes. We relate this notion to a product of codes introduced by Tanner and show a very simple composition lemma for this notion. Next, we show that codes built by tensor products can be tested robustly and somewhat locally by applying a variant of a test and proof technique introduced by Raz and Safra in the context of testing low‐degree multivariate polynomials (which are a special case of tensor codes). Combining these two results gives us a generic construction of codes of inverse polynomial rate that are testable with poly‐logarithmically many queries. We note that these locally testable tensor codes can be obtained from any linear error correcting code with good distance. Previous results on local testability, albeit much stronger quantitatively, rely heavily on algebraic properties of the underlying codes. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006 相似文献
30.
Ben J. Morris 《Random Structures and Algorithms》2002,21(2):135-146
We study the problem of sampling contingency tables (nonnegative integer matrices with specified row and column sums) uniformly at random. We give an algorithm which runs in polynomial time provided that the row sums ri and the column sums cj satisfy ri = Ω(n3/2m log m), and cj = Ω(m3/2n log n). This algorithm is based on a reduction to continuous sampling from a convex set. The same approach was taken by Dyer, Kannan, and Mount in previous work. However, the algorithm we present is simpler and has weaker requirements on the row and column sums. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 135–146, 2002 相似文献