全文获取类型
收费全文 | 148056篇 |
免费 | 5417篇 |
国内免费 | 3072篇 |
专业分类
化学 | 85019篇 |
晶体学 | 2308篇 |
力学 | 6327篇 |
综合类 | 244篇 |
数学 | 14722篇 |
物理学 | 47925篇 |
出版年
2021年 | 1308篇 |
2020年 | 1621篇 |
2019年 | 1502篇 |
2018年 | 1373篇 |
2017年 | 1284篇 |
2016年 | 2341篇 |
2015年 | 2008篇 |
2014年 | 2591篇 |
2013年 | 6415篇 |
2012年 | 5398篇 |
2011年 | 6406篇 |
2010年 | 4102篇 |
2009年 | 3851篇 |
2008年 | 5406篇 |
2007年 | 5324篇 |
2006年 | 5303篇 |
2005年 | 4979篇 |
2004年 | 4255篇 |
2003年 | 3812篇 |
2002年 | 3648篇 |
2001年 | 4050篇 |
2000年 | 3169篇 |
1999年 | 2768篇 |
1998年 | 2354篇 |
1997年 | 2291篇 |
1996年 | 2232篇 |
1995年 | 2151篇 |
1994年 | 1894篇 |
1993年 | 1855篇 |
1992年 | 2017篇 |
1991年 | 1965篇 |
1990年 | 1908篇 |
1989年 | 1840篇 |
1988年 | 1801篇 |
1987年 | 1754篇 |
1986年 | 1683篇 |
1985年 | 2195篇 |
1984年 | 2299篇 |
1983年 | 1926篇 |
1982年 | 2247篇 |
1981年 | 2048篇 |
1980年 | 2081篇 |
1979年 | 2064篇 |
1978年 | 2186篇 |
1977年 | 2090篇 |
1976年 | 2116篇 |
1975年 | 2053篇 |
1974年 | 1895篇 |
1973年 | 2102篇 |
1972年 | 1282篇 |
排序方式: 共有10000条查询结果,搜索用时 44 毫秒
141.
142.
We compute neutral Higgs and Z0-boson couplings to quarks in a model with three quark-lepton families and one mirror family. Mixing between ordinary and mirrorquarks leads to flavour-changing couplings which are negligible for the known quarks. However, t-quark couplings are sizeable and the branching ratio for the decay
can be as large as 10−4. 相似文献
143.
Blood serum samples were irradiated by monochromatic synchrotron radiation (15 keV) and by 2.4-MeV protons to compare their performance for the detection of trace elements by x-ray fluorescence (XRF) spectrometry. Absolute concentration assignment was based on the addition of an internal standard and on a method which uses the incoherent and coherent radiation as a flux monitor of the incoming beam. Preliminary experiments with a synchrotron XRF microprobe are reported. 相似文献
144.
In this paper we obtain a number of Maharam-type slice integral representations, with respect to scalar measures, for positive
projections in Dedekind complete vector lattices and f-algebras.
AMS Classification: 47B65, 46A40, 06F25 相似文献
145.
H E Cline W E Lorensen R J Herfkens G A Johnson G H Glover 《Magnetic resonance imaging》1989,7(1):45-54
A three-dimensional examination of blood vessels is provided using MR data from seven cases. The vascular surfaces are constructed with an algorithm that automatically follows the selected artery or vein and generates a projected three-dimensional gradient shaded image. Fast 3DFT pulse sequences were optimized to enhance the time-of-flight contrast of the intravascular region. By increasing the surface threshold value in a three-dimensional head study, the flesh of a patient's face was peeled away to demonstrate the superfacial temporal artery. Gated cardiac images show the great vessels and cardiac chambers. A three-dimensional view of the aorta shows an irregular surface in the vicinity of an adrenal tumor. 3D MR exams provide a non-invasive technique for assessing vascular morphology in a clinical setting. 相似文献
146.
It is widely accepted that next-generation networks will provide guaranteed services, in contrast to the “best effort” approach today. We study and analyze queueing policies for network switches that support the QoS (Quality of Service) feature. One realization of the QoS feature is that packets are not necessarily all equal, with some having higher priorities than the others. We model this situation by assigning an intrinsic value to each packet. In this paper we are concerned with three different queueing policies: the nonpreemptive model, the FIFO preemptive model, and the bounded delay model. We concentrate on the situation where the incoming traffic overloads the queue, resulting in packet loss. The objective is to maximize the total value of packets transmitted by the queueing policy. The difficulty lies in the unpredictable nature of the future packet arrivals. We analyze the performance of the online queueing policies via competitive analysis, providing upper and lower bounds for the competitive ratios. We develop practical yet sophisticated online algorithms (queueing policies) for the three queueing models. The algorithms in many cases have provably optimal worst-case bounds. For the nonpreemptive model, we devise an optimal online algorithm for the common 2-value model. We provide a tight logarithmic bound for the general nonpreemptive model. For the FIFO preemptive model, we improve the general lower bound to 1.414, while showing a tight bound of 1.434 for the special case of queue size 2. We prove that the bounded delay model with uniform delay 2 is equivalent to a modified FIFO preemptive model with queue size 2. We then give improved upper and lower bounds on the 2-uniform bounded delay model. We also show an improved lower bound of 1.618 for the 2-variable bounded delay model, matching the previously known upper bound. 相似文献
147.
H. G. Bohlen W. von Oertzen R. Kalpakchieva B. Gebauer S. M. Grimes A. Lenz T. N. Massey M. Milin Ch. Schulz Tz. Kokalova S. Torilov S. Thummerer 《Physics of Atomic Nuclei》2003,66(8):1494-1500
The structure of neutron-rich beryllium isotopes has been investigated using different heavy-ion-induced transfer reactions. In neutron transfer reactions, the population of final states shows a strong sensitivity to the chosen core nucleus, i.e., the target nuclei 9Be or 10Be, respectively. Molecular rotational bands up to high excitation energies are observed with 9Be as the core due to its pronounced 2α-cluster structure, whereas only a few states at low excitation energies are populated with 10Be as the core. For 11Be, a detailed investigation has been performed for the three states at 3.41, 3.89, and 3.96 MeV, which resulted in the most probable spin-parity assignments 3/2+, 5/2?, and 3/2?, respectively. Furthermore, we have studied particle-hole states of 16C using the 13C(12C, 9C)16C reaction and found 14 previously unknown states. Using the 12C(12C, 9C)15C reaction, five new states were observed for 15C. 相似文献
148.
This paper is devoted to a detailed theoretical study of an ion pair SN2 reaction LiNCO+CH3F in the gas phase and in solution at the level of MP2(full)/6-31+G**//HF/6-31+G**. Two possible reaction mechanisms, inversion and retention, are discussed. There are eight possible reaction pathways. The inversion mechanism is more favorable no matter in the gas phase or in solution based on analyses of the transition structures. Methyl isocyanate should form preferentially in the gas phase and more stable methyl cyanate is the main product in solution. The retardation of the reaction in solvents was attributed to the difference in solvation in the separated reactants and in the transition state. 相似文献
149.
Michael T. Jury David W. Kribs 《Proceedings of the American Mathematical Society》2005,133(1):213-222
Given a row contraction of operators on a Hilbert space and a family of projections on the space that stabilizes the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries that satisfy natural relations. For a fixed row contraction the set of all dilations forms a partially ordered set with a largest and smallest element. A key technical device in our analysis is a connection with directed graphs. We use a Wold decomposition for partial isometries to describe the models for these dilations, and we discuss how the basic properties of a dilation depend on the row contraction.
150.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献