全文获取类型
收费全文 | 113654篇 |
免费 | 1482篇 |
国内免费 | 650篇 |
专业分类
化学 | 48536篇 |
晶体学 | 1042篇 |
力学 | 7558篇 |
数学 | 37703篇 |
物理学 | 20947篇 |
出版年
2022年 | 296篇 |
2021年 | 439篇 |
2020年 | 554篇 |
2019年 | 521篇 |
2018年 | 10688篇 |
2017年 | 10524篇 |
2016年 | 6842篇 |
2015年 | 1605篇 |
2014年 | 1145篇 |
2013年 | 2225篇 |
2012年 | 5726篇 |
2011年 | 12853篇 |
2010年 | 6778篇 |
2009年 | 7019篇 |
2008年 | 8657篇 |
2007年 | 10727篇 |
2006年 | 2376篇 |
2005年 | 3319篇 |
2004年 | 3214篇 |
2003年 | 3443篇 |
2002年 | 2402篇 |
2001年 | 770篇 |
2000年 | 779篇 |
1999年 | 576篇 |
1998年 | 567篇 |
1997年 | 557篇 |
1996年 | 750篇 |
1995年 | 530篇 |
1994年 | 467篇 |
1993年 | 460篇 |
1992年 | 410篇 |
1991年 | 383篇 |
1990年 | 318篇 |
1989年 | 339篇 |
1988年 | 341篇 |
1987年 | 328篇 |
1986年 | 289篇 |
1985年 | 487篇 |
1984年 | 455篇 |
1983年 | 322篇 |
1982年 | 416篇 |
1981年 | 421篇 |
1980年 | 396篇 |
1979年 | 387篇 |
1978年 | 359篇 |
1977年 | 299篇 |
1976年 | 286篇 |
1975年 | 286篇 |
1974年 | 288篇 |
1973年 | 334篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
41.
This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics. 相似文献
42.
In this paper we suggest a unique model for estimating the operating cost of each of three waste-collection systems. Under the traditional system, which is widely used, waste is typically collected in plastic bags and a three-man crew is needed on each vehicle. The other two systems require a one-man crew for vehicle collecting street containers. The side-loader system with fixed body automatically empties street containers into the vehicle body and empties the load at the disposal site. The side-loader system with demountable body allows the separation of the waste collection phase from transport to the disposal site, since the vehicle body can be demounted. We also present two case studies and show how the estimation of operating costs is a critical issue in decisions regarding the type of system to be used for waste collection. 相似文献
43.
A nonlinear, compressible, non-isothermal gravity wave model that involves photochemistry is used to study the effects of gravity wave on atmospheric chemical species distributions in this paper. The changes in the distributions of oxygen compound and hydrogen compound density induced by gravity wave propagation are simulated. The results indicate that when a gravity wave propagates through a mesopause region, even if it does not break, it can influence the background distributions of chemical species. The effect of gravity wave on chemical species at night is larger than in daytime. 相似文献
44.
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 相似文献
45.
Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties)
polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They coincide with
the usual K-theoretic groups in the special case when the polytope is a unit simplex and can be thought of as compact/polytopal substitutes
for the tame automorphism groups of polynomial algebras. Relative to the classical case, many new aspects have to be taken
into account. We describe these groups explicitly when the underlying polytope is 2-dimensional. Already this low-dimensional
case provides interesting classes of groups.
Received: 13 December 2001 / Revised version: 24 June 2002
The second author was supported by the Deutsche Forschungsgemeinschaft, INTAS grant 99-00817 and TMR grant ERB FMRX CT-97-0107
Mathematics Subject Classification (2000): 14L27, 14M25, 19C09, 52B20 相似文献
46.
王巨平 《中国科学A辑(英文版)》2002,45(7):827-835
This paper verifies the singularity conjecture for Jacobi forms with higher degree in some typical cases, and gives constructions
for the Jacobi cusp forms whose Fourier coefficients can be expressed by some kind of Rankin-typeL-series. 相似文献
47.
It is explicitly shown that if phase transition occurs at the core of a newborn neutron star with moderately strong magnetic
field strength, which populates only the electron’s Landau levels, then in the β -equilibrium condition, the quark core is
energetically much more unstable than the neutron matter of identical physical condition. 相似文献
48.
Dimitar I. Pushkarov 《Central European Journal of Physics》2004,2(3):420-455
Basic ideas and results which characterize quantum diffusion of defects in quantum crystals like solid helium as a new phenomenon
are presented. Quantum effects in such media lead to a delocalization of point defects (vacancies, impurities etc.) and they
turn into quasiparticles of a new type—defectons, which are characterized not by their position in the crystal lattice but
by their quasimomentum and dispersion law. Defecton-defecton and defecton-phonon scattering are considered and an interpolation
formula for the diffusion coefficient valid in all interesting temperature and concentration regions is presented. A comparison
with the experimental data is made. Some alternative points of view are discussed in detail and the inconsistency of the Kisvarsanyi-Sullivan
theory is shown. 相似文献
49.
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. 相似文献
50.
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 相似文献