全文获取类型
收费全文 | 81983篇 |
免费 | 496篇 |
国内免费 | 415篇 |
专业分类
化学 | 26786篇 |
晶体学 | 812篇 |
力学 | 6817篇 |
数学 | 32820篇 |
物理学 | 15659篇 |
出版年
2022年 | 70篇 |
2021年 | 115篇 |
2020年 | 102篇 |
2019年 | 116篇 |
2018年 | 10493篇 |
2017年 | 10293篇 |
2016年 | 6186篇 |
2015年 | 946篇 |
2014年 | 424篇 |
2013年 | 549篇 |
2012年 | 4014篇 |
2011年 | 10751篇 |
2010年 | 5790篇 |
2009年 | 6189篇 |
2008年 | 6841篇 |
2007年 | 8914篇 |
2006年 | 430篇 |
2005年 | 1514篇 |
2004年 | 1729篇 |
2003年 | 2097篇 |
2002年 | 1147篇 |
2001年 | 292篇 |
2000年 | 335篇 |
1999年 | 214篇 |
1998年 | 238篇 |
1997年 | 180篇 |
1996年 | 268篇 |
1995年 | 156篇 |
1994年 | 109篇 |
1993年 | 124篇 |
1992年 | 84篇 |
1991年 | 96篇 |
1990年 | 68篇 |
1989年 | 77篇 |
1988年 | 77篇 |
1987年 | 84篇 |
1986年 | 76篇 |
1985年 | 71篇 |
1984年 | 70篇 |
1983年 | 48篇 |
1982年 | 75篇 |
1981年 | 68篇 |
1980年 | 60篇 |
1979年 | 65篇 |
1978年 | 67篇 |
1976年 | 41篇 |
1914年 | 46篇 |
1913年 | 42篇 |
1912年 | 42篇 |
1909年 | 41篇 |
排序方式: 共有10000条查询结果,搜索用时 171 毫秒
901.
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. 相似文献
902.
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. 相似文献
903.
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. 相似文献
904.
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. 相似文献
905.
LetV() be a smooth, non-constant function on the torus and letT be a hyperbolic toral automorphism. Consider a discrete one dimensional Schrödinger operatorH, whose potential at sitej is given bygV
j
=gV(T
j
). We prove that wheng0 is small andg
1/2
|E|2–g
1/2
, the Lyapunov exponent for the cocycle generated byH-E is proportional tog
2. The proof relies on a formula of Pastur and Figotin and on symbolic dynamics. 相似文献
906.
We formulate general conjectures about the relationship between the A-model connection on the cohomology of ad-dimensional Calabi-Yau complete intersectionV ofr hypersurfacesV
1
,...,V
r
in a toric varietyP
and the system of differential operators annihilating the special generalized hypergeometric series 0 constructed from the fan . Using this generalized hypergeometric series, we propose conjectural mirrorsV ofV and the canonicalq-coordinates on the moduli spaces of Calabi-Yau manifolds.In the second part of the paper we consider some examples of Calabi-Yau 3-folds having Picard number >1 in products of projective spaces. For conjectural mirrors, using the recurrent relation among coefficients of the restriction of the hypergeometric function 0 on a special line in the moduli space, we determine the Picard-Fuchs equation satisfied by periods of this special one-parameter subfamily. This allows to obtain some sequences of integers which can be conjecturally interpreted in terms of Gromov-Witten invariants. Using standard techniques from enumerative geometry, first terms of these sequence of integers are checked to coincide with numbers of rational curves on Calabi-Yau 3-folds. 相似文献
907.
A. González P. Sánchez J. M. Pingarrón L. M. Polo 《Fresenius' Journal of Analytical Chemistry》1994,348(10):666-673
A polarographic study was carried out of the reduction processes of diethyl and dibutyl phthalate in micellar solutions with the cationic surfactant Hyamine 1622, and in an emulsified medium from aliquots of the phthalates dissolved in a diethyl ether: ethyl acetate (1:9) mixture and Hyamine 1622 as emulsifying agent. The characteristics of the reduction processes in both media were established. The number of electrons involved was higher for the base form of the electroactive species. Using dpp at E=–50 mV, the detection limits obtained in the emulsified medium were 6.7×10–8 and 7.4×10–7 moll–1 for diethyl phthalate and dibutyl phthalate, respectively. Interferences between the two phthalates were studied, and the possibility of carrying out the overall determination of both phthalates was demonstrated. Good results were obtained when applying the polarographic method developed in the emulsified medium to determine diethyl phthalate by dpp in spiked milk after extraction of the analyte with diethyl ether: ethyl acetate (1:9). 相似文献
908.
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. 相似文献
909.
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. 相似文献
910.
Summary A critical issue in drug discovery utilizing combinatorial chemistry as part of the discovery process is the choice of scaffolds to be used for a proper presentation, in a three-dimensional space, of the critical elements of structure necessary for molecular recognition (binding) and information transfer (agonist/ antagonist). In the case of polypeptide ligands, considerations related to the properties of various backbone structures (-helix, -sheets, etc.; , space) and those related to three-dimensional presentation of side-chain moieties (topography; (chi) space) must be addressed, although they often present quite different elements in the molecular recognition puzzle. We have addressed aspects of this problem by examining the three-dimensional structures of chemically different scaffolds at various distances from the scaffold to evaluate their putative diversity. We find that chemically diverse scaffolds can readily become topographically similar. We suggest a topographical approach involving design in chi space to deal with these problems. 相似文献