全文获取类型
收费全文 | 86404篇 |
免费 | 1622篇 |
国内免费 | 1118篇 |
专业分类
化学 | 30472篇 |
晶体学 | 904篇 |
力学 | 7106篇 |
综合类 | 51篇 |
数学 | 32680篇 |
物理学 | 17931篇 |
出版年
2023年 | 178篇 |
2022年 | 266篇 |
2021年 | 302篇 |
2020年 | 353篇 |
2019年 | 326篇 |
2018年 | 10621篇 |
2017年 | 10420篇 |
2016年 | 6459篇 |
2015年 | 1208篇 |
2014年 | 734篇 |
2013年 | 955篇 |
2012年 | 4581篇 |
2011年 | 11261篇 |
2010年 | 6097篇 |
2009年 | 6499篇 |
2008年 | 7137篇 |
2007年 | 9263篇 |
2006年 | 688篇 |
2005年 | 1728篇 |
2004年 | 1804篇 |
2003年 | 2155篇 |
2002年 | 1219篇 |
2001年 | 429篇 |
2000年 | 465篇 |
1999年 | 306篇 |
1998年 | 335篇 |
1997年 | 255篇 |
1996年 | 302篇 |
1995年 | 250篇 |
1994年 | 193篇 |
1993年 | 182篇 |
1992年 | 131篇 |
1991年 | 132篇 |
1990年 | 116篇 |
1989年 | 92篇 |
1988年 | 103篇 |
1987年 | 92篇 |
1986年 | 92篇 |
1985年 | 77篇 |
1984年 | 68篇 |
1983年 | 45篇 |
1982年 | 61篇 |
1981年 | 52篇 |
1980年 | 53篇 |
1979年 | 51篇 |
1978年 | 44篇 |
1914年 | 45篇 |
1913年 | 41篇 |
1909年 | 41篇 |
1908年 | 40篇 |
排序方式: 共有10000条查询结果,搜索用时 546 毫秒
991.
Koichi Kikuta Koji Noda Shin Okumura Toshiaki Yamaguchi Shin-ichi Hirano 《Journal of Sol-Gel Science and Technology》2007,42(3):381-387
Orientation control of perovskite compounds was investigated by the application of a seed layer prepared from oxide nanosheets.
An aqueous suspension of oxide nanosheets was prepared by the exfoliation of a layered compound of KCa2Nb3O10 oxide grains. A seed layer composed of (TBA)Ca2Nb3O10 nanosheets (TBA = tetrabutylammonium) was formed on a glass substrate by simply dip coating it in the suspension. Two kinds
of perovskite compounds, LaNiO3 (LNO) and Pb(Zr,Ti)O3 (PZT) with a preferred orientation of (00l) were successfully grown on this seeded glass substrate. In this study, the relation between lattice mismatch and electrical
properties is investigated. A large, oriented PZT film with a size of 5 ×4 cm shows an improved P-E hysteresis behavior by
use of this orientation control. 相似文献
992.
Li Jingchao Su Bihao Wei Zhenghong Nie Ciyu 《Methodology and Computing in Applied Probability》2022,24(3):2169-2194
In this paper, we consider the problem of computing different types of finite time survival probabilities for a Markov-Modulated risk model and a Markov-Modulated risk model with reinsurance, both with varying premium rates. We use the multinomial approximation scheme to derive an efficient recursive algorithm to compute finite time survival probabilities and finite time draw-down survival probabilities. Numerical results show that by comparing with MCMC approximation, discretize approximation and diffusion approximation methods, the proposed scheme performs accurate results in all the considered cases and with better computation efficiency.
相似文献993.
John M. Charnes Howard Marmorstein Walter Zinn 《The Journal of the Operational Research Society》1995,46(8):1006-1013
We consider a periodic-review inventory replenishment model with an order-up-to-R operating doctrine for the case of deterministic lead times and a covariance-stationary stochastic demand process. A method is derived for setting the inventory safety stock to achieve an exact desired stockout probability when the autocovariance function for Gaussian demand is known. Because the method does not require that parametric time-series models be fit to the data, it is easily implemented in practice. Moreover, the method is shown to be asymptotically valid when the autocovariance function of demand is estimated from historical data. The effects on the stockout rate of various levels of autocorrelated demand are demonstrated for situations in which autocorrelation in demand goes undetected or is ignored by the inventory manager. Similarly, the changes to the required level of safety stock are demonstrated for varying levels of autocorrelation. 相似文献
994.
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. 相似文献
995.
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. 相似文献
996.
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. 相似文献
997.
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. 相似文献
998.
999.
1000.