全文获取类型
收费全文 | 33044篇 |
免费 | 1095篇 |
国内免费 | 250篇 |
专业分类
化学 | 22871篇 |
晶体学 | 230篇 |
力学 | 827篇 |
数学 | 5442篇 |
物理学 | 5019篇 |
出版年
2022年 | 289篇 |
2021年 | 421篇 |
2020年 | 518篇 |
2019年 | 489篇 |
2018年 | 378篇 |
2017年 | 373篇 |
2016年 | 837篇 |
2015年 | 740篇 |
2014年 | 810篇 |
2013年 | 1744篇 |
2012年 | 1874篇 |
2011年 | 2372篇 |
2010年 | 1155篇 |
2009年 | 1012篇 |
2008年 | 2027篇 |
2007年 | 2039篇 |
2006年 | 2017篇 |
2005年 | 1885篇 |
2004年 | 1594篇 |
2003年 | 1394篇 |
2002年 | 1298篇 |
2001年 | 410篇 |
2000年 | 401篇 |
1999年 | 364篇 |
1998年 | 339篇 |
1997年 | 361篇 |
1996年 | 499篇 |
1995年 | 350篇 |
1994年 | 303篇 |
1993年 | 278篇 |
1992年 | 279篇 |
1991年 | 250篇 |
1990年 | 209篇 |
1989年 | 207篇 |
1988年 | 236篇 |
1987年 | 203篇 |
1986年 | 184篇 |
1985年 | 352篇 |
1984年 | 341篇 |
1983年 | 252篇 |
1982年 | 321篇 |
1981年 | 326篇 |
1980年 | 302篇 |
1979年 | 287篇 |
1978年 | 263篇 |
1977年 | 231篇 |
1976年 | 210篇 |
1975年 | 211篇 |
1974年 | 215篇 |
1973年 | 215篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
We analyze new forms of aberrations affecting a time dependent magnetic field lens recently proposed. The lens consist of an axially symmetric ellipsoidal solenoid producing a spatially uniform but time pulsating homogeneous field. The dynamics of electrons emitted by some object and injected into this coil shows that this system is capable of focusing a parallel beam or produce images free of geometrical aberrations. The cardinal elements of this lens change periodically in positions and therefore to obtain a stationary image it is necessary to employ a chopped electron beam. Two forms of aberrations originate from the finite duration of the electron pulse and the energy dispersion of the incoming beam (chromatic aberration). Their image degradation effects are quite similar and result from recording different axially displaced images at some fixed stationary plane. We show how, by adjusting the parameters characterizing the magnetic pulse and introducing small apertures that increase the depth of focus, their effects can be reduced or in some cases eliminated. Other forms of instrumental aberrations characteristic of this time dependent magnetic field lens are briefly discussed. 相似文献
22.
A Garcia-Quiroz David L AzevedoE.C da Silva 《Journal of Physics and Chemistry of Solids》2002,63(10):1863-1866
Properties of oxygenated carbon nitride films have attracted the attention of physics researchers due to their magnetic and physical properties, as well as for their usefulness in the industry. The free radicals were investigated using electron paramagnetic resonance applied in the study of spin concentration due to the different mechanism of preparation of carbon nitride films by RF-discharge with different kinds of plasma. Unpaired spin concentrations, in the order of 1020 per cm3, were measured and their time recombination dependency was important in those films. The films were grown by plasma enhanced chemical vapor deposition using mixtures of hydrocarbons, N2 and O2 in different proportions. 相似文献
23.
24.
David B. Wilson 《Random Structures and Algorithms》2002,21(2):182-195
There has been much recent interest in the satisfiability of random Boolean formulas. A random k‐SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known that when the number of variables n is large, there is a sharp transition from satisfiability to unsatisfiability; in the case of 2‐SAT this happens when m/n → 1, for 3‐SAT the critical ratio is thought to be m/n ≈ 4.2. The sharpness of this transition is characterized by a critical exponent, sometimes called ν = νk (the smaller the value of ν the sharper the transition). Experiments have suggested that ν3 = 1.5 ± 0.1. ν4 = 1.25 ± 0.05, ν5 = 1.1 ± 0.05, ν6 = 1.05 ± 0.05, and heuristics have suggested that νk → 1 as k → ∞. We give here a simple proof that each of these exponents is at least 2 (provided the exponent is well defined). This result holds for each of the three standard ensembles of random k‐SAT formulas: m clauses selected uniformly at random without replacement, m clauses selected uniformly at random with replacement, and each clause selected with probability p independent of the other clauses. We also obtain similar results for q‐colorability and the appearance of a q‐core in a random graph. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 182–195, 2002 相似文献
25.
Given a connected spaceX, we consider the effect of Quillen’s plus construction on the homotopy groups ofX in terms of its Postnikov decomposition. Specifically, using universal properties of the fibration sequenceAX→X→X
+, we explain the contribution of π
n
X to π
n
X
+, π
n+1
X
+ and π
n
AX, π
n+1
AX explicitly in terms of the low dimensional homology of π
n
X regarded as a module over π1
X. Key ingredients developed here for this purpose are universal II-central fibrations and a theory of universal central extensions
of modules, analogous to universal central extensions of perfect groups.
Research partially supported by NSERC of Canada. 相似文献
26.
27.
The auction algorithm for the transportation problem 总被引:1,自引:0,他引:1
The auction algorithm is a parallel relaxation method for solving the classical assignment problem. It resembles a competitive bidding process whereby unassigned persons bid simultaneously for objects, thereby raising their prices. Once all bids are in, objects are awarded to the highest bidder. This paper generalizes the auction algorithm to solve linear transportation problems. The idea is to convert the transportation problem into an assignment problem, and then to modify the auction algorithm to exploit the special structure of this problem. Computational results show that this modified version of the auction algorithm is very efficient for certain types of transportation problems. 相似文献
28.
29.
Tor Schoenmeyr David Yu Zhang 《Journal of Algorithms in Cognition, Informatics and Logic》2005,57(2):130-139
The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method. 相似文献
30.
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.