全文获取类型
收费全文 | 105182篇 |
免费 | 1427篇 |
国内免费 | 416篇 |
专业分类
化学 | 43608篇 |
晶体学 | 978篇 |
力学 | 7112篇 |
数学 | 35935篇 |
物理学 | 19392篇 |
出版年
2023年 | 236篇 |
2022年 | 527篇 |
2021年 | 636篇 |
2020年 | 552篇 |
2019年 | 556篇 |
2018年 | 10859篇 |
2017年 | 10603篇 |
2016年 | 7027篇 |
2015年 | 1675篇 |
2014年 | 1247篇 |
2013年 | 2194篇 |
2012年 | 5564篇 |
2011年 | 12108篇 |
2010年 | 6692篇 |
2009年 | 6939篇 |
2008年 | 8096篇 |
2007年 | 10207篇 |
2006年 | 1700篇 |
2005年 | 2603篇 |
2004年 | 2699篇 |
2003年 | 2844篇 |
2002年 | 1794篇 |
2001年 | 817篇 |
2000年 | 784篇 |
1999年 | 523篇 |
1998年 | 464篇 |
1997年 | 397篇 |
1996年 | 533篇 |
1995年 | 353篇 |
1994年 | 335篇 |
1993年 | 319篇 |
1992年 | 267篇 |
1991年 | 269篇 |
1990年 | 244篇 |
1989年 | 238篇 |
1988年 | 216篇 |
1987年 | 209篇 |
1986年 | 216篇 |
1985年 | 281篇 |
1984年 | 260篇 |
1983年 | 174篇 |
1982年 | 197篇 |
1981年 | 199篇 |
1980年 | 204篇 |
1979年 | 149篇 |
1978年 | 135篇 |
1977年 | 128篇 |
1976年 | 107篇 |
1975年 | 102篇 |
1973年 | 100篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
991.
Nazarov Anatoly Sztrik János Kvach Anna Tóth Ádám 《Methodology and Computing in Applied Probability》2022,24(3):1503-1518
Methodology and Computing in Applied Probability - This paper deals with a retrial queuing system with a finite number of sources and collision of the customers, where the server is subject to... 相似文献
992.
M. Angeles Díaz-Díez Fernando J. García-Barros Francisco J. Higes-Rolando Alvaro Bernalte-García Cristóbal Valenzuela-Calahorro 《Transition Metal Chemistry》1995,20(4):402-405
Summary Complexes of CuII with 2-(benzylamino)-2-deoxy-d-glycero-d-talo heptonic acid (BnMa) and 2-(benzylamino)-2-deoxy-d-glycero-l-gluco heptonic acid (BnGa) were prepared and characterized by elemental analysis, thermal data, i.r., electronic and e.s.r. spectra, magnetic susceptibility measurements, and X-ray powder diffraction. The metal:ligand stoichiometry of these complexes is 12 and coordination around CuII seems to be octahedral, with the ligands bound through the N atom of the amino group and O atoms of the bridging carboxylate group. 相似文献
993.
This paper studies the optimal operation of an M/E k /1 queueing system with a removable service station under steady-state conditions. Analytic closed-form solutions of the controllable M/E k /1 queueing system are derived. This is a generalization of the controllable M/M/1, the ordinary M/E k /1, and the ordinary M/M/1 queueing systems in the literature. We prove that the probability that the service station is busy in the steady-state is equal to the traffic intensity. Following the construction of the expected cost function per unit time, we determine the optimal operating policy at minimum cost. 相似文献
994.
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. 相似文献
995.
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. 相似文献
996.
Tamás F. Móri 《Journal of Theoretical Probability》1995,8(1):139-164
Considering an infinite string of i.i.d. random letters drawn from a finite alphabet we define the cover timeW
n
as the number of random letters needed until each pattern of lenghtn appears at least once as a substring. Sharp weak and a.s. limit results onW
n
are known in the symmetric case, i.e., when the random letters are uniformly distributed over the alphabet. In this paper we determine the limit distribution ofW
n
in the nonsymmetric case asn. Generalizations in terms of point processes are also proved.Dedicated to Endre Csáki on his 60th birthday. 相似文献
997.
C. Calderón 《Lithuanian Mathematical Journal》1995,35(1):18-29
We obtain an elementary derivation for Selberg's formula related to the function ψ r, k * (x; q, ?) for allr, k positive integers. 相似文献
998.
999.