全文获取类型
收费全文 | 85782篇 |
免费 | 578篇 |
国内免费 | 436篇 |
专业分类
化学 | 29492篇 |
晶体学 | 864篇 |
力学 | 6950篇 |
综合类 | 1篇 |
数学 | 33159篇 |
物理学 | 16330篇 |
出版年
2021年 | 81篇 |
2020年 | 155篇 |
2019年 | 114篇 |
2018年 | 10479篇 |
2017年 | 10317篇 |
2016年 | 6215篇 |
2015年 | 980篇 |
2014年 | 473篇 |
2013年 | 691篇 |
2012年 | 4199篇 |
2011年 | 10980篇 |
2010年 | 5872篇 |
2009年 | 6229篇 |
2008年 | 7033篇 |
2007年 | 9137篇 |
2006年 | 639篇 |
2005年 | 1722篇 |
2004年 | 1931篇 |
2003年 | 2236篇 |
2002年 | 1303篇 |
2001年 | 327篇 |
2000年 | 368篇 |
1999年 | 213篇 |
1998年 | 267篇 |
1997年 | 241篇 |
1996年 | 331篇 |
1995年 | 199篇 |
1994年 | 143篇 |
1993年 | 188篇 |
1992年 | 120篇 |
1991年 | 139篇 |
1990年 | 120篇 |
1989年 | 116篇 |
1988年 | 126篇 |
1987年 | 118篇 |
1986年 | 108篇 |
1985年 | 159篇 |
1984年 | 169篇 |
1983年 | 125篇 |
1982年 | 153篇 |
1981年 | 146篇 |
1980年 | 133篇 |
1979年 | 126篇 |
1978年 | 142篇 |
1977年 | 111篇 |
1976年 | 96篇 |
1975年 | 83篇 |
1974年 | 78篇 |
1973年 | 82篇 |
1966年 | 47篇 |
排序方式: 共有10000条查询结果,搜索用时 24 毫秒
31.
32.
A firm's logistics cost, including shipping and inventory-carrying, is a substantial percentage of its sales. Nevertheless, typical inventory-control methods ignore or insufficiently represent the shipping cost. This paper describes a recursive algorithm that determines the reorder cycle-time that minimizes total logistics cost. It allows for a realistic accounting of shipping cost, which is modelled here as a function of shipping distance and weight. The algorithm uses a relaxation procedure to identify a suitable initial approximation to the optimal order cycle-time and then, through a series of recursive steps, moves to the optimal result. We demonstrate the algorithm with a single item, with a group of items that share a common order cycle, and with multi-items when item demands are random variables. Experience with this algorithm indicates that it converges to the optimal result in a very few steps. 相似文献
33.
Graham Smith 《The Journal of the Operational Research Society》1989,40(9):761-770
Courses which teach discrete-event simulation are based on many different simulation languages. The requirements for a language to support teaching simulation are discussed. In particular, it is recommended that such languages separate into distinct modules those aspects of simulation which are taught as separate topics. Implementation of the separation is discussed. The SEESIM language, developed as a teaching aid, is described, and examples of its use are given. Straightforward use of SEESIM can be learned quickly, yet the language provides facilities for a staged introduction to advanced concepts of simulation. 相似文献
34.
J Ashenfelter 《Pramana》2002,59(5):713-717
The ESTU began operation in 1988 and achieved the design voltage of 20 MV in 1990. Since that time, improvements to the gas
handling system, negative ion injector, accelerator terminal and control system have greatly increased its capability and
reliability. Today, the ESTU can efficiently produce an extensive assortment of stable ions at wide-ranging energies in support
of low-energy nuclear physics. 相似文献
35.
A pressure sensitive paint (PSP) measurement has been known as a pressure field measurement technique based on the oxygen quenching phenomenon of luminescence of specific luminophores. A PSP measurement was applied for pressure field measurement in a low-solidity circular cascade diffuser of a single-stage transonic centrifugal compressor with 5 in pressure ratio for HFC134a gas. The oxygen concentration was about 500 ppm. Ru (bath-phen) was adsorbed on a silica-gel thinlayer chromatography sheet, and the sheet was pasted onto the side-wall between the cascade vanes. A drastic change in luminescent intensity was recognized during a surge condition. Also the pressure variations based on luminescent intensity agreed well with the pressure fluctuations measured using a semiconductor pressure sensor with high-frequency-response. It was shown that a PSP measurement worked well to investigate the unsteady pressure fields in a circular cascade diffuser of a transonic centrifugal compressor. Moreover, the time response of PSP becomes clear as a problem to be overcome for the present. 相似文献
36.
Charles J. Colbourn Sosina S. Martirosyan Gary L. Mullen Dennis Shasha George B. Sherwood Joseph L. Yucas 《组合设计杂志》2006,14(2):124-138
A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006 相似文献
37.
38.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献
39.
Joseph Krasil'shchik 《Acta Appl Math》2002,72(1-2):1-17
A short introduction to geometrical theory of nonlinear differential equations is given to provide a unified overview to the collection 'Symmetries of differential equations and related topics'. 相似文献
40.
Yasuyuki Kawahigashi 《Communications in Mathematical Physics》2002,226(2):269-287
We study the recent construction of subfactors by Rehren which generalizes the Longo–Rehren subfactors. We prove that if
we apply this construction to a non-degenerately braided subfactor N⊂M and α±-induction, then the resulting subfactor is dual to the Longo–Rehren subfactor M⊗M
opp⊂R arising from the entire system of irreducible endomorphisms of M resulting from αplusmn;-induction. As a corollary, we solve a problem on existence of braiding raised by Rehren negatively. Furthermore, we generalize
our previous study with Longo and Müger on multi-interval subfactors arising from a completely rational conformal net of factors
on S
1 to a net of subfactors and show that the (generalized) Longo–Rehren subfactors and α-induction naturally appear in this context.
Received: 11 September 2001 / Accepted: 7 October 2001 相似文献