全文获取类型
收费全文 | 79130篇 |
免费 | 371篇 |
国内免费 | 380篇 |
专业分类
化学 | 25124篇 |
晶体学 | 807篇 |
力学 | 6736篇 |
数学 | 31980篇 |
物理学 | 15234篇 |
出版年
2018年 | 10441篇 |
2017年 | 10267篇 |
2016年 | 6072篇 |
2015年 | 851篇 |
2014年 | 313篇 |
2013年 | 354篇 |
2012年 | 3830篇 |
2011年 | 10569篇 |
2010年 | 5662篇 |
2009年 | 6085篇 |
2008年 | 6640篇 |
2007年 | 8801篇 |
2006年 | 282篇 |
2005年 | 1376篇 |
2004年 | 1589篇 |
2003年 | 2021篇 |
2002年 | 1070篇 |
2001年 | 271篇 |
2000年 | 305篇 |
1999年 | 161篇 |
1998年 | 208篇 |
1997年 | 167篇 |
1996年 | 211篇 |
1995年 | 125篇 |
1994年 | 83篇 |
1993年 | 106篇 |
1992年 | 70篇 |
1991年 | 73篇 |
1990年 | 66篇 |
1989年 | 70篇 |
1988年 | 66篇 |
1987年 | 61篇 |
1986年 | 68篇 |
1985年 | 71篇 |
1984年 | 66篇 |
1983年 | 45篇 |
1982年 | 67篇 |
1981年 | 63篇 |
1980年 | 72篇 |
1979年 | 66篇 |
1978年 | 46篇 |
1977年 | 32篇 |
1976年 | 30篇 |
1973年 | 37篇 |
1914年 | 45篇 |
1913年 | 40篇 |
1912年 | 40篇 |
1909年 | 41篇 |
1908年 | 40篇 |
1907年 | 32篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
81.
M C Testik J K Cochran G C Runger 《The Journal of the Operational Research Society》2004,55(3):233-239
We study the short-term staffing problem of systems that experience random, non-stationary demand. The typical method to accommodate changes in arrival rate is to use historical data to identify peak periods and associated forecasting for upcoming time windows. In this paper, we develop a method that instead detects change as it happens. Motivated by an automatic call distributor system in a call centre with time-varying arrivals, we propose a change detection algorithm based upon non-homogeneous Poisson processes. The proposed method is general and may be thought of as a feed-forward strategy, in which we detect a change in the arrival process, estimate the new magnitude of the arrival rate, and assign an appropriate number of servers to the tasks. The generalized likelihood ratio statistic is used and a recommendation for its decision limit is developed. Simulation results are used to evaluate the performance of the detector in the context of a telephone call centre. 相似文献
82.
This paper considers a receiver set partitioning and sequencing problem in a wavelength division multiplexing single-hop lightwave network for multicasting traffic. The problem is analysed in the approach of uncapacitated single batch-processing machine scheduling. In the analysis, several solution properties are characterized with respect to a mean flow time measure, based upon which two heuristic algorithms are developed, along with a dynamic programming algorithm. Several numerical experiments show that the heuristic algorithms generate good schedules. The problem is extended to consider two measures simultaneously including the mean flow time and the number of transmissions, for which the proposed algorithms also perform well. 相似文献
83.
Flávio A. Pavan Yoshitaka Gushikem Celso C. Moro Tania M. Costa Edilson V. Benvenutti 《Colloid and polymer science》2003,281(2):173-177
Anilinepropylsilica xerogel was obtained by using an appropriate organosilane and tetraethyl orthosilicate as precursor reagents. The gelation was carried out using HF and NaF as catalysts. The presence of Na+ (when NaF was used) resulted in a decrease in the final organic content of the materials. This effect was interpreted as an inhibition of the organosilane polycondensation possibly due to the Na+ interaction with the SiO- groups of the hydrolyzed organosilane. The presence of Na+ also results in morphological changes in the xerogels. 相似文献
84.
Robert Jerrard Alberto Montero Peter Sternberg 《Communications in Mathematical Physics》2004,249(3):549-577
We establish the existence of locally minimizing vortex solutions to the full Ginzburg-Landau energy in three dimensional simply-connected domains with or without the presence of an applied magnetic field. The approach is based upon the theory of weak Jacobians and applies to nonconvex sample geometries for which there exists a configuration of locally shortest line segments with endpoints on the boundary.Research partially supported by NSERC grant number 261955 相似文献
85.
Jiří Herec 《Czechoslovak Journal of Physics》2004,54(12):1473-1481
In this paper the quantum-statistical properties of light beams propagating in a directional nonlinear coupler are investigated.
This device is composed of a pair of linearly coupled nonlinear waveguides operating by means of degenerate parametric downconversion.
The possibility of generation of nonclassical states of light in single and compound modes, using the short-length approximation,
is discussed. Influence of linear and nonlinear mismatches for generation of nonclassical light is taken into account.
This work was supported by Project LN00A015, Research Project No. CEZ: J14/98 and the COST project OC P11.003 of the Czech
Ministry of Education. 相似文献
86.
C Guéret N Jussien O Lhomme C Pavageau C Prins 《The Journal of the Operational Research Society》2003,54(5):458-465
In this paper, we describe an aircraft loading problem submitted by the French military agency (DGA) as part of a more general military airlift planning problem. It can be viewed as a kind of bi-dimensional bin-packing problem, with heterogeneous bins and several additional constraints. We introduce two-phase methods for solving this NP-hard problem. The first phase consists in building good initial solutions, thanks to two fast algorithms: a list-based heuristic and a loading pattern generation method. Both algorithms call a constraint-based subroutine, able to determine quickly if the items already loaded can be reshuffled to accommodate a new object. The second phase improves these preliminary solutions using local search techniques. Results obtained on real data sets are presented. 相似文献
87.
YaoKui ChenZhixiang 《分析论及其应用》2003,19(2):115-120
This paper gives the weighted Lp convergence rate estimations of the Gruenwald interpolatory polynomials based on the zeros of Chebyshev polymomials of the first kind,and proves that the order of the estimations is optimal for p≥1. 相似文献
88.
S. Koh K. Konishi Y. Shiraki 《Physica E: Low-dimensional Systems and Nanostructures》2004,21(2-4):440
Self-assembled GeSiC dots stacked on a Ge hut-cluster layer buried in Si have been investigated. The critical thickness for formation of GeSiC dots is reduced owing to the strain fields from the buried hut-clusters. By utilizing the stacked structure, the dot size is decreased and the uniformity is improved. The highest density of the GeSiC dots with stacked structures is 7.4×1010 cm−2, which is six times larger than that of single GeSiC dots. The formation of the self-assembled GeSiC dots is strongly influenced by being stacked with buried Ge dots as well as C incorporation. 相似文献
89.
Howard Robinson 《Acta Analytica》2005,20(3):7-10
Nicholas Nathan tries to resist the current version of the causal argument for sense-data in two ways. First he suggests that,
on what he considers to be the correct re-construction of the argument, it equivocates on the sense of proximate cause. Second
he defends a form of disjunctivism, by claiming that there might be an extra mechanism involved in producing veridical hallucination,
that is not present in perception. I argue that Nathan’s reconstruction of the argument is not the appropriate one, and that,
properly interpreted, the argument does not equivocate on proximate cause. Furthermore, I claim that his postulation of a
modified mechanism for hallucinations is implausibly ad hoc. 相似文献
90.
Chris Pollett 《Archive for Mathematical Logic》2003,42(5):469-488
The paper establishes lower bounds on the provability of 𝒟=NP and the MRDP theorem in weak fragments of arithmetic. The
theory I
5
E
1
is shown to be unable to prove 𝒟=NP. This non-provability result is used to show that I
5
E
1
cannot prove the MRDP theorem. On the other hand it is shown that I
1
E
1
proves 𝒟 contains all predicates of the form (∀i≤|b|)P(i,x)^Q(i,x) where ^ is =, <, or ≤, and I
0
E
1
proves 𝒟 contains all predicates of the form (∀i≤b)P(i,x)=Q(i,x). Here P and Q are polynomials. A conjecture is made that 𝒟 contains NLOGTIME. However, it is shown that this conjecture would not be sufficient
to imply 𝒟=N P. Weak reductions to equality are then considered as a way of showing 𝒟=NP. It is shown that the bit-wise less than predicate,
≤2, and equality are both co-NLOGTIME complete under FDLOGTIME reductions. This is used to show that if the FDLOGTIME functions
are definable in 𝒟 then 𝒟=N P.
Received: 13 July 2001 / Revised version: 9 April 2002 /
Published online: 19 December 2002
Key words or phrases: Bounded Arithmetic – Bounded Diophantine Complexity 相似文献