全文获取类型
收费全文 | 67675篇 |
免费 | 10374篇 |
国内免费 | 1643篇 |
专业分类
化学 | 62999篇 |
晶体学 | 546篇 |
力学 | 1221篇 |
数学 | 7361篇 |
物理学 | 7565篇 |
出版年
2022年 | 301篇 |
2021年 | 586篇 |
2020年 | 1704篇 |
2019年 | 3010篇 |
2018年 | 1354篇 |
2017年 | 1007篇 |
2016年 | 4103篇 |
2015年 | 4148篇 |
2014年 | 4141篇 |
2013年 | 5707篇 |
2012年 | 4705篇 |
2011年 | 4491篇 |
2010年 | 3924篇 |
2009年 | 3774篇 |
2008年 | 4363篇 |
2007年 | 3763篇 |
2006年 | 3438篇 |
2005年 | 3478篇 |
2004年 | 3000篇 |
2003年 | 2654篇 |
2002年 | 3259篇 |
2001年 | 1761篇 |
2000年 | 1691篇 |
1999年 | 729篇 |
1998年 | 407篇 |
1997年 | 411篇 |
1996年 | 526篇 |
1995年 | 385篇 |
1994年 | 338篇 |
1993年 | 314篇 |
1992年 | 311篇 |
1991年 | 283篇 |
1990年 | 252篇 |
1989年 | 238篇 |
1988年 | 266篇 |
1987年 | 229篇 |
1986年 | 212篇 |
1985年 | 383篇 |
1984年 | 373篇 |
1983年 | 263篇 |
1982年 | 338篇 |
1981年 | 347篇 |
1980年 | 308篇 |
1979年 | 291篇 |
1978年 | 268篇 |
1977年 | 246篇 |
1976年 | 217篇 |
1975年 | 220篇 |
1974年 | 221篇 |
1973年 | 218篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
71.
It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
72.
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 相似文献
73.
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. 相似文献
74.
We investigate the dynamics of the Λ system driven by two resonant laser fields in presence of dissipation for coupling strengths where the rotating‐wave approximation starts to break down. This regime is characterised by Rabi frequencies being approximately equal or smaller than the field frequencies. A systematic procedure to obtain an expansion for the solution of the Bloch evolution equations of the system is presented. The lowest contribution results to be the well‐known rotating‐wave approximation. The method is based on a semi‐classical treatment of the problem, and its predictions are interpreted fully quantum mechanically. The theory is illustrated by a detailed study of the disappearance of coherent population trapping as the intensities of the fields increase. 相似文献
75.
76.
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. 相似文献
77.
78.
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. 相似文献
79.
80.