全文获取类型
收费全文 | 35856篇 |
免费 | 1185篇 |
国内免费 | 249篇 |
专业分类
化学 | 24563篇 |
晶体学 | 248篇 |
力学 | 877篇 |
数学 | 6062篇 |
物理学 | 5540篇 |
出版年
2023年 | 190篇 |
2021年 | 500篇 |
2020年 | 579篇 |
2019年 | 538篇 |
2018年 | 467篇 |
2017年 | 456篇 |
2016年 | 927篇 |
2015年 | 848篇 |
2014年 | 912篇 |
2013年 | 1891篇 |
2012年 | 2091篇 |
2011年 | 2567篇 |
2010年 | 1272篇 |
2009年 | 1095篇 |
2008年 | 2159篇 |
2007年 | 2186篇 |
2006年 | 2150篇 |
2005年 | 2193篇 |
2004年 | 1853篇 |
2003年 | 1566篇 |
2002年 | 1353篇 |
2001年 | 463篇 |
2000年 | 436篇 |
1999年 | 383篇 |
1998年 | 360篇 |
1997年 | 382篇 |
1996年 | 508篇 |
1995年 | 368篇 |
1994年 | 328篇 |
1993年 | 277篇 |
1992年 | 284篇 |
1991年 | 254篇 |
1990年 | 213篇 |
1989年 | 212篇 |
1988年 | 238篇 |
1987年 | 210篇 |
1986年 | 184篇 |
1985年 | 366篇 |
1984年 | 353篇 |
1983年 | 249篇 |
1982年 | 321篇 |
1981年 | 332篇 |
1980年 | 311篇 |
1979年 | 288篇 |
1978年 | 263篇 |
1977年 | 235篇 |
1976年 | 213篇 |
1975年 | 213篇 |
1974年 | 214篇 |
1973年 | 216篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
31.
32.
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 相似文献
33.
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. 相似文献
34.
35.
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. 相似文献
36.
37.
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. 相似文献
38.
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.
39.
Unsteady motion in single-line flow-injection systems consisting of n tubular elements with valve or hydrodynamic injection is studied theoretically. A formula for the duration of the initial period of unsteady flow is derived. This initial period is much shorter than the mean residence time of the analyte in practical systems. It can therefore be neglected in mathematical modelling of such systems. Experimental data obtained with single-line systems with valve and hydrodynamic injection confirmed the validity of the theoretical equations. 相似文献
40.