全文获取类型
收费全文 | 383047篇 |
免费 | 5793篇 |
国内免费 | 2044篇 |
专业分类
化学 | 214829篇 |
晶体学 | 5354篇 |
力学 | 15927篇 |
综合类 | 66篇 |
数学 | 43349篇 |
物理学 | 111359篇 |
出版年
2020年 | 3105篇 |
2019年 | 3257篇 |
2018年 | 3696篇 |
2017年 | 3757篇 |
2016年 | 6248篇 |
2015年 | 4551篇 |
2014年 | 6276篇 |
2013年 | 16444篇 |
2012年 | 14075篇 |
2011年 | 17260篇 |
2010年 | 11505篇 |
2009年 | 11326篇 |
2008年 | 15921篇 |
2007年 | 15964篇 |
2006年 | 15222篇 |
2005年 | 14032篇 |
2004年 | 12539篇 |
2003年 | 10890篇 |
2002年 | 10772篇 |
2001年 | 11739篇 |
2000年 | 9032篇 |
1999年 | 6791篇 |
1998年 | 5496篇 |
1997年 | 5477篇 |
1996年 | 5456篇 |
1995年 | 4793篇 |
1994年 | 4763篇 |
1993年 | 4550篇 |
1992年 | 4990篇 |
1991年 | 4947篇 |
1990年 | 4566篇 |
1989年 | 4476篇 |
1988年 | 4409篇 |
1987年 | 4265篇 |
1986年 | 4213篇 |
1985年 | 5831篇 |
1984年 | 5871篇 |
1983年 | 4832篇 |
1982年 | 5251篇 |
1981年 | 4919篇 |
1980年 | 4651篇 |
1979年 | 4783篇 |
1978年 | 5086篇 |
1977年 | 5067篇 |
1976年 | 5009篇 |
1975年 | 4717篇 |
1974年 | 4791篇 |
1973年 | 4876篇 |
1972年 | 3438篇 |
1971年 | 2647篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
941.
S. V. Ivanov V. V. Trachevskii O. S. Titova L. A. Zozulya 《Russian Journal of Applied Chemistry》2006,79(10):1712-1714
Experimental data demonstrate that a study of accelerated aging can enable prognostication of the working capacity and storage life of polymeric formulations used in aircraft components on the basis of changes in thermogravimetric constants of these polymeric formulations. 相似文献
942.
L. A. Gil‐Alana 《商业与工业应用随机模型》2006,22(4):385-395
This article examines the length of the cycles in the gross domestic product (GDP) real per capita series of 15 countries by means of new statistical techniques based on unit root cycles. We propose tests for unit root cycles at each of the frequencies of the process. Using this approach, we are able to approximate the number of periods per cycle. The results show that the cycles have a periodicity of approximately six years when the disturbances are white noise. However, if we permit autocorrelation, they may also occur at smaller intervals of time. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
943.
We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and
service rates, where the load can vary over time, including periods of overload. Using the same asymptotic technique as uniform
acceleration as demonstrated in [12] and [13], we obtain fluid and diffusion limits for the sojourn time of the Mt/Mt/1 processor-sharing queue. Our analysis is enabled by the introduction of a “virtual customer” which differs from the notion
of a “tagged customer” in that the former has no effect on the processing time of the other customers in the system. Our analysis
generalizes to non-exponential service and interarrival times, when the fluid and diffusion limits for the queueing process
are known. 相似文献
944.
Adhesion of zein to solid substrates has been studied using surface energy profiles as indices and by adhesion mapping using
atomic force microscopy (AFM). Different plasticizers like glycerol and sorbitol have been used to form mixed films with zein
and properties of these films are studied using surface energy profiles. Comparison of the results from the different mixed
samples with those from the pure zein films showed that force mapping could identify areas rich in protein. The adhesion maps
produced were deconvoluted from sample topography and contrasted with the data obtained from contact angle measurements. A
comparison of the two methods shows that the extent of contact angle hysteresis is indicative of both hydrophobicity of the
surface as well as the force of adhesion. Mechanical properties and microstructure of zein films prepared by casting from
solutions and using Langmuir-Blodgett film technique have been investigated. Pure zein seemed brittle and exhibited an essentially
linear relationship between stress and strain. Films with plasticizer were tougher than these films. In general, mixed films
showed better mechanical properties than pure films and had higher ultimate tensile strength and increased per cent elongation.
Further, the mixed films of zein showed a higher force of adhesion compared to the pure films. 相似文献
945.
L. T. Ashchepkov D. V. Davydov 《Computational Mathematics and Mathematical Physics》2006,46(11):1910-1917
Noncooperative games of a finite number of persons with interval-valued payoff functions are considered. The concept of an equilibrium situation is introduced. A reduction of such games to deterministic noncooperative games is proposed. Properties of the reduced games are discussed. Interval antagonistic and bimatrix games are examined, and illustrative examples are considered. 相似文献
946.
A new theory of transverse susceptibility (TS) based on magnetization vector dynamics, as described by the Landau–Lifshitz equation of motion, is given. It is shown that the traditional TS experiment is, in fact, the zero-frequency limit of the ferromagnetic resonance (FMR). The importance of these results resides in the generality of the approach which allows one to find the TS for virtually any magnetic system if an expression for the magnetic free-energy density is known. Moreover, the effect of the frequency of excitatory AC field on the TS experiments and the effect of energy dissipation through the imaginary part of TS emerge coherently from the new TS model. 相似文献
947.
Reductions in overshoot following intense sound exposures 总被引:1,自引:0,他引:1
Overshoot refers to the poorer detectability of brief signals presented soon after the onset of a masking noise compared to those presented after longer delays. In the present experiment, brief tonal signals were presented 2 or 190 ms following the onset of a broadband masker that was 200 ms in duration. These two conditions of signal delay were tested before and after a series of exposures to a tone intense enough to induce temporary threshold shift (TTS). The magnitude of the overshoot was reduced after the exposure when a TTS of at least 10 dB was induced, but not when smaller amounts of TTS were induced. The reduction in overshoot was due to a decrease in the masked thresholds with the 2-ms delay; masked thresholds with the 190-ms delay were not different pre- and post-exposure. The implication is that the mechanisms responsible for the normal overshoot effect are temporarily inactivated by the same stimulus manipulations that produce a mild exposure-induced hearing loss. Thus the result is the paradox that exposure to intense sounds can produce a loss of signal detectability in certain stimulus conditions and a simultaneous improvement in detectability in other stimulus conditions. 相似文献
948.
949.
Sherif Yehia C. Mitros Sanjeev Kumar S. Jha Glenn M. Julian R. A. Dunlap 《Hyperfine Interactions》1987,34(1-4):415-418
The systematics of hyperfine magnetic fields at sp impurities on the Z-sites in Co based Heusler alloys are investigated. New TDPAC measurements of Cd hyperfine fields are reported. 相似文献
950.
Hans L. Bodlaender 《Discrete Applied Mathematics》2007,155(11):1348-1372
The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all k∈N. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications. 相似文献