全文获取类型
收费全文 | 81321篇 |
免费 | 804篇 |
国内免费 | 688篇 |
专业分类
化学 | 26524篇 |
晶体学 | 807篇 |
力学 | 6878篇 |
综合类 | 24篇 |
数学 | 32429篇 |
物理学 | 16151篇 |
出版年
2023年 | 87篇 |
2022年 | 86篇 |
2021年 | 120篇 |
2020年 | 127篇 |
2019年 | 128篇 |
2018年 | 10499篇 |
2017年 | 10321篇 |
2016年 | 6192篇 |
2015年 | 971篇 |
2014年 | 456篇 |
2013年 | 550篇 |
2012年 | 4075篇 |
2011年 | 10777篇 |
2010年 | 5834篇 |
2009年 | 6200篇 |
2008年 | 6807篇 |
2007年 | 8909篇 |
2006年 | 393篇 |
2005年 | 1456篇 |
2004年 | 1658篇 |
2003年 | 2109篇 |
2002年 | 1122篇 |
2001年 | 336篇 |
2000年 | 356篇 |
1999年 | 217篇 |
1998年 | 239篇 |
1997年 | 207篇 |
1996年 | 261篇 |
1995年 | 162篇 |
1994年 | 117篇 |
1993年 | 131篇 |
1992年 | 80篇 |
1991年 | 82篇 |
1990年 | 77篇 |
1989年 | 75篇 |
1988年 | 74篇 |
1987年 | 74篇 |
1986年 | 72篇 |
1985年 | 64篇 |
1984年 | 64篇 |
1983年 | 50篇 |
1982年 | 54篇 |
1981年 | 46篇 |
1980年 | 60篇 |
1979年 | 58篇 |
1978年 | 41篇 |
1914年 | 45篇 |
1912年 | 40篇 |
1909年 | 41篇 |
1908年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
911.
Kun-Jen Chung 《The Journal of the Operational Research Society》1995,46(11):1374-1385
Chiu, in 1976, studied the economic design of np charts for processes subject to a multiplicity of assignable causes. Chiu developed a two-step minimization procedure to obtain the three control variables, namely, the sampling interval, the sample size and the acceptance number. Although Chiu's two-step minimization procedure is simple, applicable and down to earth, it is rather inefficient and has some drawbacks. This paper presents an algorithm to overcome these drawbacks. The results and the execution times of all numerical examples show that the accuracy and the efficiency of the algorithm is reasonably good. 相似文献
912.
Karin Krüger Natalia V. Shakhlevich Yuri N. Sotskov Frank Werner 《The Journal of the Operational Research Society》1995,46(12):1481-1497
We consider a scheduling problem where a set of n jobs has to be processed on a set of m machines and arbitrary precedence constraints between operations are given. Moreover, for any two operations i and j values a ij >0 and a ji >0 may be given where a ij is the minimal difference between the starting times of operations i and j when operation i is processed first. Often, the objective is to minimize the makespan but we consider also arbitrary regular criteria. Even the special cases of the classical job shop problem J//Cmax belong to the set of NP-hard problems. Therefore, approximation or heuristic algorithms are necessary to handle large-dimension problems. Based on the mixed graph model we give a heuristic decomposition algorithm for such a problem, i.e. the initial problem is partitioned into subproblems that can be solved exactly or approximately with a small error bound. These subproblems are obtained by a relaxation of a subset of the set of undirected edges of the mixed graph. The subproblems are successively solved and a proportion of the results obtained for one subproblem is kept for further subproblem definitions. Numerical results of the algorithm presented here are given. 相似文献
913.
Yi-Chih Hsieh Mark S. Andersland 《The Journal of the Operational Research Society》1995,46(6):747-752
We develop an exact closed-form expression for the steady-state availability of a repairable, N-server system in which the ith server contains n i identical, reconfigurable, breakdown-prone units. Our approach, which follows from the Markov chain balance equations and the recursive properties of Hessenberg matrix determinants, is simpler than previously proposed matrix geometric approaches, and can readily be adapted to the availability analysis of more complicated structures. We illustrate this by computing the steady-state availability of a mixed parallel-serial gracefully degrading replicated system. 相似文献
914.
915.
Bai JZ Bardon O Blum I Breakstone A Burnett T Chen GP Chen HF Chen J Chen SJ Chen SM Chen Y Chen YB Chen YQ Cheng BS Cowan RF Cui HC Cui XZ Ding HL Du ZZ Dunwoodie W Fan XL Fang J Fero M Gao CS Gao ML Gao SQ Gao WX Gratton P Gu JH Gu SD Gu WX Gu YF Guo YN Han SW Han Y Harris FA Hatanaka M He J He KR He M Hitlin DG Hu GY Hu HB Hu T Hu XQ Huang DQ Huang YZ Izen JM Jia QP Jiang CH Jin Y Jones L Kang SH Kelsey MH Kim BK Lai YF Lan HB Lang PF Lankford A Li F Li J Li PQ Li Q Li RB 《Physical review D: Particles and fields》1995,52(7):3781-3784
916.
John Doyle 《The Journal of the Operational Research Society》1994,45(2):203-213
Following a critique of existing algorithms, an algorithm is presented which will re-organize a 2-way data table to bring like rows together, and like columns together. Extensions of the method are described, and justified, to accommodate distances measured in modular arithmetic, and with bipolar columns/rows, as in repertory grid analysis. One value of the algorithms is that the user can see relationships in the tables without the data in the cells themselves ever having been transformed. Thus, users will continue to feel they own their data. 相似文献
917.
This paper deals with the GI x /G/c queueing system in a steady state. We refine a diffusion approximation method incorporating the constraint of traffic conservation for general queueing systems. An approximate expression for the distribution of the number of customers is obtained. Numerical results are presented to show that the refined model provides improved performance. 相似文献
918.
919.
920.